| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > otth2 | GIF version | ||
| Description: Ordered triple theorem, with triple express 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 4322 | . . 3 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| 4 | 3 | anbi1i 458 | . 2 ⊢ ((〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) |
| 5 | 1, 2 | opex 4314 | . . 3 ⊢ 〈𝐴, 𝐵〉 ∈ V |
| 6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
| 7 | 5, 6 | opth 4322 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆)) |
| 8 | df-3an 1004 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) | |
| 9 | 4, 7, 8 | 3bitr4i 212 | 1 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 Vcvv 2799 〈cop 3669 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 |
| This theorem is referenced by: otth 4327 oprabid 6032 eloprabga 6090 |
| Copyright terms: Public domain | W3C validator |