| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > otth | 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 3683 | . . 3 ⊢ 〈𝐴, 𝐵, 𝑅〉 = 〈〈𝐴, 𝐵〉, 𝑅〉 | |
| 2 | df-ot 3683 | . . 3 ⊢ 〈𝐶, 𝐷, 𝑆〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 | |
| 3 | 1, 2 | eqeq12i 2245 | . 2 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ 〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉) |
| 4 | otth.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 5 | otth.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
| 7 | 4, 5, 6 | otth2 4339 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| 8 | 3, 7 | bitri 184 | 1 ⊢ (〈𝐴, 𝐵, 𝑅〉 = 〈𝐶, 𝐷, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 Vcvv 2803 〈cop 3676 〈cotp 3677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-ot 3683 |
| This theorem is referenced by: euotd 4353 |
| Copyright terms: Public domain | W3C validator |