| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > otth2 | Structured version Visualization version GIF version | ||
| Description: Ordered triple theorem, with triple expressed with ordered pairs. (Contributed by NM, 1-May-1995.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| otth.1 | ⊢ 𝐴 ∈ V |
| otth.2 | ⊢ 𝐵 ∈ V |
| otth.3 | ⊢ 𝑅 ∈ V |
| Ref | Expression |
|---|---|
| otth2 | ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | otth.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | otth.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 1, 2 | opth 5458 | . . 3 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| 4 | 3 | anbi1i 635 | . 2 ⊢ ((〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) |
| 5 | opex 5445 | . . 3 ⊢ 〈𝐴, 𝐵〉 ∈ V | |
| 6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
| 7 | 5, 6 | opth 5458 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆)) |
| 8 | df-3an 1105 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) | |
| 9 | 4, 7, 8 | 3bitr4i 306 | 1 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 〈cop 4595 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 |
| This theorem is referenced by: otth 5466 oprabidw 7441 oprabid 7442 eloprabga 7519 |
| Copyright terms: Public domain | W3C validator |