MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eq2tri Structured version   Visualization version   GIF version

Theorem eq2tri 2667
Description: A compound transitive inference for class equality. (Contributed by NM, 22-Jan-2004.)
Hypotheses
Ref Expression
eq2tr.1 (𝐴 = 𝐶𝐷 = 𝐹)
eq2tr.2 (𝐵 = 𝐷𝐶 = 𝐺)
Assertion
Ref Expression
eq2tri ((𝐴 = 𝐶𝐵 = 𝐹) ↔ (𝐵 = 𝐷𝐴 = 𝐺))

Proof of Theorem eq2tri
StepHypRef Expression
1 ancom 464 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) ↔ (𝐵 = 𝐷𝐴 = 𝐶))
2 eq2tr.1 . . . 4 (𝐴 = 𝐶𝐷 = 𝐹)
32eqeq2d 2616 . . 3 (𝐴 = 𝐶 → (𝐵 = 𝐷𝐵 = 𝐹))
43pm5.32i 666 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) ↔ (𝐴 = 𝐶𝐵 = 𝐹))
5 eq2tr.2 . . . 4 (𝐵 = 𝐷𝐶 = 𝐺)
65eqeq2d 2616 . . 3 (𝐵 = 𝐷 → (𝐴 = 𝐶𝐴 = 𝐺))
76pm5.32i 666 . 2 ((𝐵 = 𝐷𝐴 = 𝐶) ↔ (𝐵 = 𝐷𝐴 = 𝐺))
81, 4, 73bitr3i 288 1 ((𝐴 = 𝐶𝐵 = 𝐹) ↔ (𝐵 = 𝐷𝐴 = 𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382   = wceq 1474
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-ext 2586
This theorem depends on definitions:  df-bi 195  df-an 384  df-cleq 2599
This theorem is referenced by:  xpassen  7913
  Copyright terms: Public domain W3C validator