Proof: Cross Multiply Theorem

Let's prove the following theorem:

if the following are true:
  • a / b = c / d
  • not (b = 0)
  • not (d = 0)

then ad = bc

For clarity, here is the condition in fraction notation:

ab = cd

This theorem says that the product of the left numerator and the right denominator is equal to the product of the left denominator and the right numerator.

In the proof, we first multiply both sides by b. Then we show that the left side reduces to a.

Next, we multiply both sides by d. At that point, the left side is:

a ⋅ d

Then we show that the right side reduces to

b ⋅ c

Proof:

View as a tree | View dependent proofs | Try proving it

Given
1 a / b = c / d
2 not (b = 0)
3 not (d = 0)
Proof Table
# Claim Reason
1 (a / b) ⋅ b = (c / d) ⋅ b if a / b = c / d, then (a / b) ⋅ b = (c / d) ⋅ b
2 (a / b) ⋅ b = a if not (b = 0), then (a / b) ⋅ b = a
3 a = (c / d) ⋅ b if (a / b) ⋅ b = a and (a / b) ⋅ b = (c / d) ⋅ b, then a = (c / d) ⋅ b
4 ad = ((c / d) ⋅ b) ⋅ d if a = (c / d) ⋅ b, then ad = ((c / d) ⋅ b) ⋅ d
5 ((c / d) ⋅ b) ⋅ d = cb if not (d = 0), then ((c / d) ⋅ b) ⋅ d = cb
6 ad = cb if ad = ((c / d) ⋅ b) ⋅ d and ((c / d) ⋅ b) ⋅ d = cb, then ad = cb
7 cb = bc cb = bc
8 ad = bc if ad = cb and cb = bc, then ad = bc

Comments

Please log in to add comments