MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  equtrr Structured version   Visualization version   GIF version

Theorem equtrr 2054
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
StepHypRef Expression
1 equtr 2053 . 2 (𝑧 = 𝑥 → (𝑥 = 𝑦 → 𝑧 = 𝑦))
21com12 33 1 (𝑥 = 𝑦 → (𝑧 = 𝑥 → 𝑧 = 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812
This theorem is used by:  equeuclr  2055  equequ2  2058  ax12v2  2214  2ax6elem  2499  wl-spae  38546  ax12eq  40091  sn-axprlem3  43365  ax6e2eq  45633  ax6e2eqVD  45982
  Copyright terms: Public domain W3C validator