| 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 4601 | . . 3 ⊢ 〈𝐴, 𝐵, 𝑅〉 = 〈〈𝐴, 𝐵〉, 𝑅〉 | |
| 2 | df-ot 4601 | . . 3 ⊢ 〈𝐶, 𝐷, 𝑆〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 | |
| 3 | 1, 2 | eqeq12i 2748 | . 2 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ 〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉) |
| 4 | otth.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 5 | otth.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
| 7 | 4, 5, 6 | otth2 5446 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| 8 | 3, 7 | bitri 275 | 1 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 Vcvv 3450 〈cop 4598 〈cotp 4600 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-ot 4601 |
| This theorem is referenced by: otthne 5449 euotd 5476 mthmpps 35576 ackval40 48686 arweuthinc 49522 arweutermc 49523 |
| Copyright terms: Public domain | W3C validator |