Proof: Transitive Property Application 6

Let's prove the following theorem:

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

then a = g

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
6 f = g
Proof Table
# Claim Reason
1 a = f if e = f and d = e and c = d and b = c and a = b, then a = f
2 a = g if f = g and a = f, then a = g

Comments

Please log in to add comments