![]() |
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 3804 | . . . 4 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
2 | 1 | eqeq1d 2202 | . . 3 ⊢ (𝑥 = 𝐴 → (〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉)) |
3 | eqeq1 2200 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐶 ↔ 𝐴 = 𝐶)) | |
4 | 3 | anbi1d 465 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷))) |
5 | 2, 4 | bibi12d 235 | . 2 ⊢ (𝑥 = 𝐴 → ((〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷)))) |
6 | opeq2 3805 | . . . 4 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
7 | 6 | eqeq1d 2202 | . . 3 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉)) |
8 | eqeq1 2200 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐷 ↔ 𝐵 = 𝐷)) | |
9 | 8 | anbi2d 464 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 = 𝐶 ∧ 𝑦 = 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
10 | 7, 9 | bibi12d 235 | . 2 ⊢ (𝑦 = 𝐵 → ((〈𝐴, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))) |
11 | vex 2763 | . . 3 ⊢ 𝑥 ∈ V | |
12 | vex 2763 | . . 3 ⊢ 𝑦 ∈ V | |
13 | 11, 12 | opth 4266 | . 2 ⊢ (〈𝑥, 𝑦〉 = 〈𝐶, 𝐷〉 ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) |
14 | 5, 10, 13 | vtocl2g 2824 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 〈cop 3621 |
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 4147 ax-pow 4203 ax-pr 4238 |
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 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 |
This theorem is referenced by: opthg2 4268 xpopth 6229 eqop 6230 inl11 7124 preqlu 7532 cauappcvgprlemladd 7718 elrealeu 7889 qnumdenbi 12330 crth 12362 imasaddfnlemg 12897 |
Copyright terms: Public domain | W3C validator |