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

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

Proof of Theorem eqt
StepHypRef Expression
1 ax-8 798 . 2 |- (y = x -> (y = z -> x = z))
21eqcoms 813 1 |- (x = y -> (y = z -> x = z))
Colors of variables: wff set class
Syntax hints:   -> wi 2   = weq 797
This theorem is referenced by:  eqt2 815  eqan 816  a8b 817  eqvin.l2 931  zfaus 1480
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-gen 677  ax-8 798  ax-9 799  ax-12 802
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679
metamath.org