| 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 4792 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) | |
| 2 | vex 2824 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | vex 2824 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | opth2 4380 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 𝑥 ∧ 𝐵 = 𝑦)) |
| 5 | eleq1 2301 | . . . . . . 7 ⊢ (𝐴 = 𝑥 → (𝐴 ∈ 𝐶 ↔ 𝑥 ∈ 𝐶)) | |
| 6 | eleq1 2301 | . . . . . . 7 ⊢ (𝐵 = 𝑦 → (𝐵 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)) | |
| 7 | 5, 6 | bi2anan9 614 | . . . . . 6 ⊢ ((𝐴 = 𝑥 ∧ 𝐵 = 𝑦) → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 8 | 4, 7 | sylbi 121 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 9 | 8 | biimprcd 160 | . . . 4 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷))) |
| 10 | 9 | rexlimivv 2674 | . . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
| 11 | eqid 2238 | . . . 4 ⊢ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉 | |
| 12 | opeq1 3904 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 〈𝑥, 𝑦〉 = 〈𝐴, 𝑦〉) | |
| 13 | 12 | eqeq2d 2250 | . . . . 5 ⊢ (𝑥 = 𝐴 → (〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉)) |
| 14 | opeq2 3905 | . . . . . 6 ⊢ (𝑦 = 𝐵 → 〈𝐴, 𝑦〉 = 〈𝐴, 𝐵〉) | |
| 15 | 14 | eqeq2d 2250 | . . . . 5 ⊢ (𝑦 = 𝐵 → (〈𝐴, 𝐵〉 = 〈𝐴, 𝑦〉 ↔ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉)) |
| 16 | 13, 15 | rspc2ev 2945 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 〈𝐴, 𝐵〉 = 〈𝐴, 𝐵〉) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
| 17 | 11, 16 | mp3an3 1367 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉) |
| 18 | 10, 17 | impbii 126 | . 2 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ↔ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
| 19 | 1, 18 | bitri 184 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) ↔ (𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 〈cop 3712 × cxp 4772 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-opab 4193 df-xp 4780 |
| This theorem is used by: brxp 4805 opelxpi 4806 opelxp1 4808 opelxp2 4809 opthprc 4826 elxp3 4829 opeliunxp 4830 optocl 4851 xpiindim 4917 opelres 5068 resiexg 5108 restidsing 5119 codir 5176 qfto 5177 xpmlem 5208 rnxpid 5222 ssrnres 5230 dfco2 5287 relssdmrn 5308 ressn 5328 opelf 5560 fnovex 6118 oprab4 6159 resoprab 6184 elmpocl 6284 fo1stresm 6395 fo2ndresm 6396 dfoprab4 6426 xporderlem 6467 f1od2 6471 brecop 6899 xpdom2 7129 mapunen 7151 djulclb 7395 djuss 7410 enq0enq 7798 enq0sym 7799 enq0tr 7801 nqnq0pi 7805 nnnq0lem1 7813 elinp 7841 genipv 7876 prsrlem1 8109 gt0srpr 8115 opelcn 8193 opelreal 8194 elreal2 8197 frecuzrdgrrn 10845 frec2uzrdg 10846 frecuzrdgrcl 10847 frecuzrdgsuc 10851 frecuzrdgrclt 10852 frecuzrdgsuctlem 10860 fisumcom2 12205 fprodcom2fi 12393 sqpweven 12953 2sqpwodd 12954 phimullem 13003 relelbasov 13416 txuni2 15357 txcnp 15372 txcnmpt 15374 txdis1cn 15379 txlm 15380 xmeterval 15536 limccnp2lem 15777 limccnp2cntop 15778 lgsquadlem1 16196 lgsquadlem2 16197 |
| Copyright terms: Public domain | W3C validator |