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

Theorem equtrr 2052
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 2051 . 2 (𝑧 = 𝑥 → (𝑥 = 𝑦𝑧 = 𝑦))
21com12 33 1 (𝑥 = 𝑦 → (𝑧 = 𝑥𝑧 = 𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810
This theorem is referenced by:  equeuclr  2053  equequ2  2056  ax12v2  2215  2ax6elem  2502  axprlem3OLD  5402  wl-spae  38154  ax12eq  39693  sn-axprlem3  42967  ax6e2eq  45246  ax6e2eqVD  45595
  Copyright terms: Public domain W3C validator