Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > opthg | GIF version |
Description: Ordered pair theorem. 𝐶 and 𝐷 are not required to be sets under our specific ordered pair definition. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
opthg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opeq1 3700 | . . . 4 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
2 | 1 | eqeq1d 2146 | . . 3 ⊢ (𝑥 = 𝐴 → (〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉)) |
3 | eqeq1 2144 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐶 ↔ 𝐴 = 𝐶)) | |
4 | 3 | anbi1d 460 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷))) |
5 | 2, 4 | bibi12d 234 | . 2 ⊢ (𝑥 = 𝐴 → ((〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷)))) |
6 | opeq2 3701 | . . . 4 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
7 | 6 | eqeq1d 2146 | . . 3 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉)) |
8 | eqeq1 2144 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐷 ↔ 𝐵 = 𝐷)) | |
9 | 8 | anbi2d 459 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 = 𝐶 ∧ 𝑦 = 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
10 | 7, 9 | bibi12d 234 | . 2 ⊢ (𝑦 = 𝐵 → ((〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))) |
11 | vex 2684 | . . 3 ⊢ 𝑥 ∈ V | |
12 | vex 2684 | . . 3 ⊢ 𝑦 ∈ V | |
13 | 11, 12 | opth 4154 | . 2 ⊢ (〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) |
14 | 5, 10, 13 | vtocl2g 2745 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 〈cop 3525 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 |
This theorem is referenced by: opthg2 4156 xpopth 6067 eqop 6068 inl11 6943 preqlu 7273 cauappcvgprlemladd 7459 elrealeu 7630 qnumdenbi 11859 crth 11889 |
Copyright terms: Public domain | W3C validator |