| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpnz | Structured version Visualization version GIF version | ||
| Description: The Cartesian product of nonempty classes is nonempty. (Variation of a theorem contributed by Raph Levien, 30-Jun-2006.) (Contributed by NM, 30-Jun-2006.) |
| Ref | Expression |
|---|---|
| xpnz | ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (𝐴 × 𝐵) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4315 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | n0 4315 | . . . . 5 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵) | |
| 3 | 1, 2 | anbi12i 639 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) |
| 4 | exdistrv 1982 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr4i 281 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 6 | opex 5446 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
| 7 | eleq1 2857 | . . . . . . 7 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
| 8 | opelxp 5698 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 9 | 7, 8 | bitrdi 290 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
| 10 | 6, 9 | spcev 3574 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) |
| 11 | n0 4315 | . . . . 5 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) | |
| 12 | 10, 11 | sylibr 237 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 13 | 12 | exlimivv 1959 | . . 3 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 14 | 5, 13 | sylbi 220 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≠ ∅) |
| 15 | xpeq1 5676 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵)) | |
| 16 | 0xp 5761 | . . . . 5 ⊢ (∅ × 𝐵) = ∅ | |
| 17 | 15, 16 | eqtrdi 2820 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅) |
| 18 | 17 | necon3i 2996 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅) |
| 19 | xpeq2 5683 | . . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅)) | |
| 20 | xp0 5762 | . . . . 5 ⊢ (𝐴 × ∅) = ∅ | |
| 21 | 19, 20 | eqtrdi 2820 | . . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅) |
| 22 | 21 | necon3i 2996 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅) |
| 23 | 18, 22 | jca 520 | . 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) |
| 24 | 14, 23 | impbii 212 | 1 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (𝐴 × 𝐵) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ≠ wne 2964 ∅c0 4294 〈cop 4600 × cxp 5660 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-opab 5178 df-xp 5668 |
| This theorem is referenced by: xpeq0 6158 ssxpb 6173 xp11 6174 unixpid 6286 xpexr2 7915 frxp 8121 xpfir 9227 axcc2lem 10419 axdc4lem 10438 pzriprnglem4 21602 mamufacex 22521 txindis 23759 2ndimaxp 32931 bj-xpnzex 37482 bj-1upln0 37532 bj-2upln1upl 37547 dibn0 41816 aks6d1c2lem4 42783 aks6d1c2 42786 aks6d1c6lem3 42828 imasubc 49813 |
| Copyright terms: Public domain | W3C validator |