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

Theorem equtr 1130
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 963 . 2 |- (y = x -> (y = z -> x = z))
21equcoms 1129 1 |- (x = y -> (y = z -> x = z))
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 955
This theorem is referenced by:  equtrr 1131  equtr2 1132  equequ1 1133  equvin 1274  a12lem1 1375  axsep 2698  dscmet 7880
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 962  ax-8 963  ax-12 967  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122
Copyright terms: Public domain