| 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 4772 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) | |
| 2 | vex 2818 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | vex 2818 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | opth2 4361 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 𝑥 ∧ 𝐵 = 𝑦)) |
| 5 | eleq1 2297 | . . . . . . 7 ⊢ (𝐴 = 𝑥 → (𝐴 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)) | |
| 6 | eleq1 2297 | . . . . . . 7 ⊢ (𝐵 = 𝑦 → (𝐵 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)) | |
| 7 | 5, 6 | bi2anan9 610 | . . . . . 6 ⊢ ((𝐴 = 𝑥 ∧ 𝐵 = 𝑦) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 8 | 4, 7 | sylbi 121 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 9 | 8 | biimprcd 160 | . . . 4 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷))) |
| 10 | 9 | rexlimivv 2668 | . . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
| 11 | eqid 2234 | . . . 4 ⊢ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉 | |
| 12 | opeq1 3888 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
| 13 | 12 | eqeq2d 2246 | . . . . 5 ⊢ (𝑥 = 𝐴 → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉)) |
| 14 | opeq2 3889 | . . . . . 6 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
| 15 | 14 | eqeq2d 2246 | . . . . 5 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉)) |
| 16 | 13, 15 | rspc2ev 2939 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
| 17 | 11, 16 | mp3an3 1363 | . . 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 1398 ∈ wcel 2205 ∃wrex 2523 〈cop 3697 × cxp 4752 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-v 2817 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-opab 4177 df-xp 4760 |
| This theorem is referenced by: brxp 4785 opelxpi 4786 opelxp1 4788 opelxp2 4789 opthprc 4806 elxp3 4809 opeliunxp 4810 optocl 4831 xpiindim 4897 opelres 5048 resiexg 5088 restidsing 5099 codir 5156 qfto 5157 xpmlem 5188 rnxpid 5202 ssrnres 5210 dfco2 5267 relssdmrn 5288 ressn 5308 opelf 5540 fnovex 6091 oprab4 6132 resoprab 6157 elmpocl 6257 fo1stresm 6368 fo2ndresm 6369 dfoprab4 6399 xporderlem 6440 f1od2 6444 brecop 6872 xpdom2 7095 mapunen 7117 djulclb 7359 djuss 7374 enq0enq 7762 enq0sym 7763 enq0tr 7765 nqnq0pi 7769 nnnq0lem1 7777 elinp 7805 genipv 7840 prsrlem1 8073 gt0srpr 8079 opelcn 8157 opelreal 8158 elreal2 8161 frecuzrdgrrn 10794 frec2uzrdg 10795 frecuzrdgrcl 10796 frecuzrdgsuc 10800 frecuzrdgrclt 10801 frecuzrdgsuctlem 10809 fisumcom2 12149 fprodcom2fi 12337 sqpweven 12897 2sqpwodd 12898 phimullem 12947 relelbasov 13359 txuni2 15247 txcnp 15262 txcnmpt 15264 txdis1cn 15269 txlm 15270 xmeterval 15426 limccnp2lem 15667 limccnp2cntop 15668 lgsquadlem1 16076 lgsquadlem2 16077 |
| Copyright terms: Public domain | W3C validator |