Theorem equtrr 1132

Description: A transitive law for equality. Lemma L17 in [Megill] p. 446 (p. 14 of the preprint).

Assertion

Ref	Expression
equtrr	|- (x = y -> (z = x -> z = y))

Proof of Theorem equtrr

Step	Hyp	Ref	Expression
1		equtr 1131	. 2 |- (z = x -> (x = y -> z = y))
2	1	com12 11	1 |- (x = y -> (z = x -> z = y))

Syntax hints:   -> wi 3   = wceq 956

This theorem is referenced by:  equequ2 1135  equvini 1168  ax11eq 1363

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-8 964  ax-12 968  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123

Copyright terms: Public domain