Theorem equtrr 1667

Description: A transitive law for equality. Lemma L17 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 23-Aug-1993.)

Assertion

Ref	Expression
equtrr	⊢ (𝑥 = 𝑦 → (𝑧 = 𝑥 → 𝑧 = 𝑦))

Proof of Theorem equtrr

Step	Hyp	Ref	Expression
1		equtr 1666	. 2 ⊢ (𝑧 = 𝑥 → (𝑥 = 𝑦 → 𝑧 = 𝑦))
2	1	com12 30	1 ⊢ (𝑥 = 𝑦 → (𝑧 = 𝑥 → 𝑧 = 𝑦))

Syntax hints:   → wi 4

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-gen 1406  ax-ie2 1451  ax-8 1463  ax-17 1487  ax-i9 1491

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  equtr2  1668  equequ2  1670