![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > opelxp | GIF version |
Description: Ordered pair membership in a cross product. (Contributed by NM, 15-Nov-1994.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
opelxp | ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxp2 4678 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) | |
2 | vex 2763 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
3 | vex 2763 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
4 | 2, 3 | opth2 4270 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 𝑥 ∧ 𝐵 = 𝑦)) |
5 | eleq1 2256 | . . . . . . 7 ⊢ (𝐴 = 𝑥 → (𝐴 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)) | |
6 | eleq1 2256 | . . . . . . 7 ⊢ (𝐵 = 𝑦 → (𝐵 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)) | |
7 | 5, 6 | bi2anan9 606 | . . . . . 6 ⊢ ((𝐴 = 𝑥 ∧ 𝐵 = 𝑦) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
8 | 4, 7 | sylbi 121 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
9 | 8 | biimprcd 160 | . . . 4 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷))) |
10 | 9 | rexlimivv 2617 | . . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
11 | eqid 2193 | . . . 4 ⊢ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉 | |
12 | opeq1 3805 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
13 | 12 | eqeq2d 2205 | . . . . 5 ⊢ (𝑥 = 𝐴 → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉)) |
14 | opeq2 3806 | . . . . . 6 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
15 | 14 | eqeq2d 2205 | . . . . 5 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉)) |
16 | 13, 15 | rspc2ev 2880 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
17 | 11, 16 | mp3an3 1337 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
18 | 10, 17 | impbii 126 | . 2 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
19 | 1, 18 | bitri 184 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 ∃wrex 2473 〈cop 3622 × cxp 4658 |
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-ral 2477 df-rex 2478 df-v 2762 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-opab 4092 df-xp 4666 |
This theorem is referenced by: brxp 4691 opelxpi 4692 opelxp1 4694 opelxp2 4695 opthprc 4711 elxp3 4714 opeliunxp 4715 optocl 4736 xpiindim 4800 opelres 4948 resiexg 4988 restidsing 4999 codir 5055 qfto 5056 xpmlem 5087 rnxpid 5101 ssrnres 5109 dfco2 5166 relssdmrn 5187 ressn 5207 opelf 5426 fnovex 5952 oprab4 5990 resoprab 6015 elmpocl 6115 fo1stresm 6216 fo2ndresm 6217 dfoprab4 6247 xporderlem 6286 f1od2 6290 brecop 6681 xpdom2 6887 djulclb 7116 djuss 7131 enq0enq 7493 enq0sym 7494 enq0tr 7496 nqnq0pi 7500 nnnq0lem1 7508 elinp 7536 genipv 7571 prsrlem1 7804 gt0srpr 7810 opelcn 7888 opelreal 7889 elreal2 7892 frecuzrdgrrn 10482 frec2uzrdg 10483 frecuzrdgrcl 10484 frecuzrdgsuc 10488 frecuzrdgrclt 10489 frecuzrdgsuctlem 10497 fisumcom2 11584 fprodcom2fi 11772 sqpweven 12316 2sqpwodd 12317 phimullem 12366 relelbasov 12683 txuni2 14435 txcnp 14450 txcnmpt 14452 txdis1cn 14457 txlm 14458 xmeterval 14614 limccnp2lem 14855 limccnp2cntop 14856 lgsquadlem1 15234 lgsquadlem2 15235 |
Copyright terms: Public domain | W3C validator |