HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem equtr 1127
Description: A transitive law for equality.
Assertion
Ref Expression
equtr |- (x = y -> (y = z -> x = z))

Proof of Theorem equtr
StepHypRef Expression
1 ax-8 961 . 2 |- (y = x -> (y = z -> x = z))
21equcoms 1126 1 |- (x = y -> (y = z -> x = z))
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 953
This theorem is referenced by:  equtrr 1128  equtr2 1129  equequ1 1130  equvin 1270  a12lem1 1369  axsep 2692  dscmet 7856
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-8 961  ax-12 965  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119
Copyright terms: Public domain