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

Theorem equtr 1168
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 1000 . 2 |- (y = x -> (y = z -> x = z))
21equcoms 1167 1 |- (x = y -> (y = z -> x = z))
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 992
This theorem is referenced by:  equtrr 1169  equtr2 1170  equequ1 1171  equvin 1313  a12lem1 1415  axsep 2776  dscmet 8129
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 999  ax-8 1000  ax-12 1004  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159
Copyright terms: Public domain