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

Theorem equtr 2054
Description: A transitive law for equality. (Contributed by NM, 23-Aug-1993.)
Assertion
Ref Expression
equtr (𝑥 = 𝑦 → (𝑦 = 𝑧𝑥 = 𝑧))

Proof of Theorem equtr
StepHypRef Expression
1 ax7 2049 . 2 (𝑦 = 𝑥 → (𝑦 = 𝑧𝑥 = 𝑧))
21equcoms 2053 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 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  equtrr  2055  equequ1  2058  equvinva  2063  ax6e  2414  equvini  2486  axprlem3OLD  5398
  Copyright terms: Public domain W3C validator