![]() |
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 4267 | . . 3 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
4 | 3 | anbi1i 458 | . 2 ⊢ ((〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) |
5 | 1, 2 | opex 4259 | . . 3 ⊢ 〈𝐴, 𝐵〉 ∈ V |
6 | otth.3 | . . 3 ⊢ 𝑅 ∈ V | |
7 | 5, 6 | opth 4267 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ∧ 𝑅 = 𝑆)) |
8 | df-3an 982 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆) ↔ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ∧ 𝑅 = 𝑆)) | |
9 | 4, 7, 8 | 3bitr4i 212 | 1 ⊢ (〈〈𝐴, 𝐵〉, 𝑅〉 = 〈〈𝐶, 𝐷〉, 𝑆〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷 ∧ 𝑅 = 𝑆)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 Vcvv 2760 〈cop 3622 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 |
This theorem is referenced by: otth 4272 oprabid 5951 eloprabga 6006 |
Copyright terms: Public domain | W3C validator |