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

Theorem equtrr 2023
 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 2022 . 2 (𝑧 = 𝑥 → (𝑥 = 𝑦𝑧 = 𝑦))
21com12 32 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 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009 This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1775 This theorem is referenced by:  equeuclr  2024  equequ2  2027  ax12v2  2172  2ax6elem  2487  axprlem3  5316  wl-spae  34753  ax12eq  36069  sn-axprlem3  39099  ax6e2eq  40881  ax6e2eqVD  41231
 Copyright terms: Public domain W3C validator