Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eq2tri | Structured version Visualization version GIF version |
Description: A compound transitive inference for class equality. (Contributed by NM, 22-Jan-2004.) |
Ref | Expression |
---|---|
eq2tri.1 | ⊢ (𝐴 = 𝐶 → 𝐷 = 𝐹) |
eq2tri.2 | ⊢ (𝐵 = 𝐷 → 𝐶 = 𝐺) |
Ref | Expression |
---|---|
eq2tri | ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐹) ↔ (𝐵 = 𝐷 ∧ 𝐴 = 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ancom 461 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐵 = 𝐷 ∧ 𝐴 = 𝐶)) | |
2 | eq2tri.1 | . . . 4 ⊢ (𝐴 = 𝐶 → 𝐷 = 𝐹) | |
3 | 2 | eqeq2d 2749 | . . 3 ⊢ (𝐴 = 𝐶 → (𝐵 = 𝐷 ↔ 𝐵 = 𝐹)) |
4 | 3 | pm5.32i 575 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐹)) |
5 | eq2tri.2 | . . . 4 ⊢ (𝐵 = 𝐷 → 𝐶 = 𝐺) | |
6 | 5 | eqeq2d 2749 | . . 3 ⊢ (𝐵 = 𝐷 → (𝐴 = 𝐶 ↔ 𝐴 = 𝐺)) |
7 | 6 | pm5.32i 575 | . 2 ⊢ ((𝐵 = 𝐷 ∧ 𝐴 = 𝐶) ↔ (𝐵 = 𝐷 ∧ 𝐴 = 𝐺)) |
8 | 1, 4, 7 | 3bitr3i 301 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐹) ↔ (𝐵 = 𝐷 ∧ 𝐴 = 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 df-cleq 2730 |
This theorem is referenced by: xpassen 8841 |
Copyright terms: Public domain | W3C validator |