| 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 4304 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 2 | n0 4304 | . . . . 5 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵) | |
| 3 | 1, 2 | anbi12i 628 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) |
| 4 | exdistrv 1955 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) | |
| 5 | 3, 4 | bitr4i 278 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 6 | opex 5407 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
| 7 | eleq1 2816 | . . . . . . 7 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
| 8 | opelxp 5655 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 9 | 7, 8 | bitrdi 287 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
| 10 | 6, 9 | spcev 3561 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) |
| 11 | n0 4304 | . . . . 5 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) | |
| 12 | 10, 11 | sylibr 234 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 13 | 12 | exlimivv 1932 | . . 3 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
| 14 | 5, 13 | sylbi 217 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≠ ∅) |
| 15 | xpeq1 5633 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵)) | |
| 16 | 0xp 5718 | . . . . 5 ⊢ (∅ × 𝐵) = ∅ | |
| 17 | 15, 16 | eqtrdi 2780 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅) |
| 18 | 17 | necon3i 2957 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅) |
| 19 | xpeq2 5640 | . . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅)) | |
| 20 | xp0 6107 | . . . . 5 ⊢ (𝐴 × ∅) = ∅ | |
| 21 | 19, 20 | eqtrdi 2780 | . . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅) |
| 22 | 21 | necon3i 2957 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅) |
| 23 | 18, 22 | jca 511 | . 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) |
| 24 | 14, 23 | impbii 209 | 1 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (𝐴 × 𝐵) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2925 ∅c0 4284 〈cop 4583 × cxp 5617 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3395 df-v 3438 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-br 5093 df-opab 5155 df-xp 5625 df-rel 5626 df-cnv 5627 |
| This theorem is referenced by: xpeq0 6109 ssxpb 6123 xp11 6124 unixpid 6232 xpexr2 7852 frxp 8059 xpfir 9157 axcc2lem 10330 axdc4lem 10349 pzriprnglem4 21391 mamufacex 22281 txindis 23519 2ndimaxp 32589 bj-xpnzex 36933 bj-1upln0 36983 bj-2upln1upl 36998 dibn0 41132 aks6d1c2lem4 42100 aks6d1c2 42103 aks6d1c6lem3 42145 imasubc 49136 |
| Copyright terms: Public domain | W3C validator |