| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > otth | Structured version Visualization version GIF version | ||
| Description: Ordered triple theorem. (Contributed by NM, 25-Sep-2014.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| otth.1 | ⊢ 𝐴 ∈ V |
| otth.2 | ⊢ 𝐵 ∈ V |
| otth.3 | ⊢ 𝑅 ∈ V |
| Ref | Expression |
|---|---|
| otth | ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ot 4593 | . . 3 ⊢ 〈𝐴, 𝐵, 𝑅〉 = 〈〈𝐴, 𝐵〉, 𝑅〉 | |
| 2 | df-ot 4593 | . . 3 ⊢ 〈𝐶, 𝐷, 𝑆〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 | |
| 3 | 1, 2 | eqeq12i 2778 | . 2 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ 〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉) |
| 4 | otth.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 5 | otth.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
| 7 | 4, 5, 6 | otth2 5459 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| 8 | 3, 7 | bitri 278 | 1 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 〈cop 4590 〈cotp 4592 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-ot 4593 |
| This theorem is used by: otthne 5462 euotd 5490 mthmpps 36164 ackval40 49626 arweuthinc 50458 arweutermc 50459 |
| Copyright terms: Public domain | W3C validator |