Proof: Transitive Property Application 5

Let's prove the following theorem:

if the following are true:
  • a = b
  • b = c
  • c = d
  • d = e
  • e = f

then a = f

Proof:

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

Given
1 a = b
2 b = c
3 c = d
4 d = e
5 e = f
Proof Table
# Claim Reason
1 a = e if d = e and c = d and b = c and a = b, then a = e
2 a = f if e = f and a = e, then a = f

Comments

Please log in to add comments