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

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

Proof of Theorem equtr
StepHypRef Expression
1 ax7 2048 . 2 (𝑦 = 𝑥 → (𝑦 = 𝑧 → 𝑥 = 𝑧))
21equcoms 2052 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:  equtrr  2054  equequ1  2057  equvinva  2062  ax6e  2412  equvini  2484
  Copyright terms: Public domain W3C validator