| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > otthg | Structured version Visualization version GIF version | ||
| Description: Ordered triple theorem, closed form. (Contributed by Alexander van der Vekens, 10-Mar-2018.) |
| Ref | Expression |
|---|---|
| otthg | ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (〈𝐴, 𝐵, 𝐶〉 = 〈𝐷, 𝐸, 𝐹〉 ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ot 4861 | . . 3 ⊢ 〈𝐴, 𝐵, 𝐶〉 = 〈〈𝐴, 𝐵〉, 𝐶〉 | |
| 2 | df-ot 4861 | . . 3 ⊢ 〈𝐷, 𝐸, 𝐹〉 = 〈〈𝐷, 𝐸〉, 𝐹〉 | |
| 3 | 1, 2 | eqeq12i 2781 | . 2 ⊢ (〈𝐴, 𝐵, 𝐶〉 = 〈𝐷, 𝐸, 𝐹〉 ↔ 〈〈𝐴, 𝐵〉, 𝐶〉 = 〈〈𝐷, 𝐸〉, 𝐹〉) |
| 4 | opex 5435 | . . . . 5 ⊢ 〈𝐴, 𝐵〉 ∈ V | |
| 5 | opthg 5449 | . . . . 5 ⊢ ((〈𝐴, 𝐵〉 ∈ V ∧ 𝐶 ∈ 𝑊) → (〈〈𝐴, 𝐵〉, 𝐶〉 = 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (〈𝐴, 𝐵〉 = 〈𝐷, 𝐸〉 ∧ 𝐶 = 𝐹))) | |
| 6 | 4, 5 | mpan 703 | . . . 4 ⊢ (𝐶 ∈ 𝑊 → (〈〈𝐴, 𝐵〉, 𝐶〉 = 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (〈𝐴, 𝐵〉 = 〈𝐷, 𝐸〉 ∧ 𝐶 = 𝐹))) |
| 7 | opthg 5449 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → (〈𝐴, 𝐵〉 = 〈𝐷, 𝐸〉 ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸))) | |
| 8 | 7 | anbi1d 643 | . . . . 5 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((〈𝐴, 𝐵〉 = 〈𝐷, 𝐸〉 ∧ 𝐶 = 𝐹) ↔ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸) ∧ 𝐶 = 𝐹))) |
| 9 | df-3an 1105 | . . . . 5 ⊢ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹) ↔ ((𝐴 = 𝐷 ∧ 𝐵 = 𝐸) ∧ 𝐶 = 𝐹)) | |
| 10 | 8, 9 | bitr4di 292 | . . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((〈𝐴, 𝐵〉 = 〈𝐷, 𝐸〉 ∧ 𝐶 = 𝐹) ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))) |
| 11 | 6, 10 | sylan9bbr 520 | . . 3 ⊢ (((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) ∧ 𝐶 ∈ 𝑊) → (〈〈𝐴, 𝐵〉, 𝐶〉 = 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))) |
| 12 | 11 | 3impa 1127 | . 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (〈〈𝐴, 𝐵〉, 𝐶〉 = 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))) |
| 13 | 3, 12 | bitrid 286 | 1 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (〈𝐴, 𝐵, 𝐶〉 = 〈𝐷, 𝐸, 𝐹〉 ↔ (𝐴 = 𝐷 ∧ 𝐵 = 𝐸 ∧ 𝐶 = 𝐹))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 Vcvv 3453 〈cop 4837 〈cotp 4860 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-ot 4861 |
| This theorem is used by: otsndisj 5495 otiunsndisj 5496 mpt3fvot2d 7697 otiunsndisjX 48488 |
| Copyright terms: Public domain | W3C validator |