| 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 4307 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | n0 4307 | . . . . 5 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵) | |
| 3 | 1, 2 | anbi12i 639 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) |
| 4 | exdistrv 1985 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr4i 281 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 6 | opex 5445 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
| 7 | eleq1 2851 | . . . . . . 7 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
| 8 | opelxp 5697 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 9 | 7, 8 | bitrdi 290 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
| 10 | 6, 9 | spcev 3565 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) |
| 11 | n0 4307 | . . . . 5 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) | |
| 12 | 10, 11 | sylibr 237 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 13 | 12 | exlimivv 1962 | . . 3 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 14 | 5, 13 | sylbi 220 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≠ ∅) |
| 15 | xpeq1 5675 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵)) | |
| 16 | 0xp 5760 | . . . . 5 ⊢ (∅ × 𝐵) = ∅ | |
| 17 | 15, 16 | eqtrdi 2814 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅) |
| 18 | 17 | necon3i 2990 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅) |
| 19 | xpeq2 5682 | . . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅)) | |
| 20 | xp0 5761 | . . . . 5 ⊢ (𝐴 × ∅) = ∅ | |
| 21 | 19, 20 | eqtrdi 2814 | . . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅) |
| 22 | 21 | necon3i 2990 | . . 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 1570 ∃wex 1809 ∈ wcel 2143 ≠ wne 2958 ∅c0 4286 〈cop 4595 × cxp 5659 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5174 df-xp 5667 |
| This theorem is referenced by: xpeq0 6157 ssxpb 6172 xp11 6173 unixpid 6285 xpexr2 7912 frxp 8118 xpfir 9224 axcc2lem 10415 axdc4lem 10434 pzriprnglem4 21634 mamufacex 22553 txindis 23791 2ndimaxp 32991 bj-xpnzex 37595 bj-1upln0 37645 bj-2upln1upl 37660 dibn0 41927 aks6d1c2lem4 42894 aks6d1c2 42897 aks6d1c6lem3 42939 imasubc 49929 |
| Copyright terms: Public domain | W3C validator |