Theorem eq2tr 1533

Description: A compound transitive inference for class equality.

Hypotheses

Ref	Expression
eq2tr.1	|- (A = C -> D = F)
eq2tr.2	|- (B = D -> C = G)

Assertion

Ref	Expression
eq2tr	|- ((A = C /\ B = F) <-> (B = D /\ A = G))

Proof of Theorem eq2tr

Step	Hyp	Ref	Expression
1		ancom 435	. 2 |- ((A = C /\ B = D) <-> (B = D /\ A = C))
2		eq2tr.1	. . . 4 |- (A = C -> D = F)
3	2	eqeq2d 1486	. . 3 |- (A = C -> (B = D <-> B = F))
4	3	pm5.32i 645	. 2 |- ((A = C /\ B = D) <-> (A = C /\ B = F))
5		eq2tr.2	. . . 4 |- (B = D -> C = G)
6	5	eqeq2d 1486	. . 3 |- (B = D -> (A = C <-> A = G))
7	6	pm5.32i 645	. 2 |- ((B = D /\ A = C) <-> (B = D /\ A = G))
8	1, 4, 7	3bitr3 181	1 |- ((A = C /\ B = F) <-> (B = D /\ A = G))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956

This theorem is referenced by:  xpcomen 4439  xpassen 4441

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-17 971  ax-4 973  ax-5o 975  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-an 225  df-cleq 1469

Copyright terms: Public domain