| 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 4743 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) | |
| 2 | vex 2805 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | vex 2805 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | opth2 4332 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 𝑥 ∧ 𝐵 = 𝑦)) |
| 5 | eleq1 2294 | . . . . . . 7 ⊢ (𝐴 = 𝑥 → (𝐴 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)) | |
| 6 | eleq1 2294 | . . . . . . 7 ⊢ (𝐵 = 𝑦 → (𝐵 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)) | |
| 7 | 5, 6 | bi2anan9 610 | . . . . . 6 ⊢ ((𝐴 = 𝑥 ∧ 𝐵 = 𝑦) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 8 | 4, 7 | sylbi 121 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 9 | 8 | biimprcd 160 | . . . 4 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷))) |
| 10 | 9 | rexlimivv 2656 | . . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
| 11 | eqid 2231 | . . . 4 ⊢ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉 | |
| 12 | opeq1 3862 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
| 13 | 12 | eqeq2d 2243 | . . . . 5 ⊢ (𝑥 = 𝐴 → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉)) |
| 14 | opeq2 3863 | . . . . . 6 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
| 15 | 14 | eqeq2d 2243 | . . . . 5 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉)) |
| 16 | 13, 15 | rspc2ev 2925 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
| 17 | 11, 16 | mp3an3 1362 | . . 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 1397 ∈ wcel 2202 ∃wrex 2511 〈cop 3672 × cxp 4723 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-opab 4151 df-xp 4731 |
| This theorem is referenced by: brxp 4756 opelxpi 4757 opelxp1 4759 opelxp2 4760 opthprc 4777 elxp3 4780 opeliunxp 4781 optocl 4802 xpiindim 4867 opelres 5018 resiexg 5058 restidsing 5069 codir 5125 qfto 5126 xpmlem 5157 rnxpid 5171 ssrnres 5179 dfco2 5236 relssdmrn 5257 ressn 5277 opelf 5507 fnovex 6050 oprab4 6091 resoprab 6116 elmpocl 6216 fo1stresm 6323 fo2ndresm 6324 dfoprab4 6354 xporderlem 6395 f1od2 6399 brecop 6793 xpdom2 7014 djulclb 7253 djuss 7268 enq0enq 7650 enq0sym 7651 enq0tr 7653 nqnq0pi 7657 nnnq0lem1 7665 elinp 7693 genipv 7728 prsrlem1 7961 gt0srpr 7967 opelcn 8045 opelreal 8046 elreal2 8049 frecuzrdgrrn 10669 frec2uzrdg 10670 frecuzrdgrcl 10671 frecuzrdgsuc 10675 frecuzrdgrclt 10676 frecuzrdgsuctlem 10684 fisumcom2 11998 fprodcom2fi 12186 sqpweven 12746 2sqpwodd 12747 phimullem 12796 relelbasov 13144 txuni2 14979 txcnp 14994 txcnmpt 14996 txdis1cn 15001 txlm 15002 xmeterval 15158 limccnp2lem 15399 limccnp2cntop 15400 lgsquadlem1 15805 lgsquadlem2 15806 |
| Copyright terms: Public domain | W3C validator |