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 4247 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
2 | n0 4247 | . . . . 5 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵) | |
3 | 1, 2 | anbi12i 629 | . . . 4 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) |
4 | exdistrv 1956 | . . . 4 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ 𝐵)) | |
5 | 3, 4 | bitr4i 281 | . . 3 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ ∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
6 | opex 5328 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
7 | eleq1 2839 | . . . . . . 7 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
8 | opelxp 5564 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
9 | 7, 8 | bitrdi 290 | . . . . . 6 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑧 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
10 | 6, 9 | spcev 3527 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) |
11 | n0 4247 | . . . . 5 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐴 × 𝐵)) | |
12 | 10, 11 | sylibr 237 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
13 | 12 | exlimivv 1933 | . . 3 ⊢ (∃𝑥∃𝑦(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐴 × 𝐵) ≠ ∅) |
14 | 5, 13 | sylbi 220 | . 2 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) → (𝐴 × 𝐵) ≠ ∅) |
15 | xpeq1 5542 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵)) | |
16 | 0xp 5623 | . . . . 5 ⊢ (∅ × 𝐵) = ∅ | |
17 | 15, 16 | eqtrdi 2809 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅) |
18 | 17 | necon3i 2983 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅) |
19 | xpeq2 5549 | . . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅)) | |
20 | xp0 5992 | . . . . 5 ⊢ (𝐴 × ∅) = ∅ | |
21 | 19, 20 | eqtrdi 2809 | . . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅) |
22 | 21 | necon3i 2983 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅) |
23 | 18, 22 | jca 515 | . 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) |
24 | 14, 23 | impbii 212 | 1 ⊢ ((𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅) ↔ (𝐴 × 𝐵) ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ≠ wne 2951 ∅c0 4227 〈cop 4531 × cxp 5526 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5173 ax-nul 5180 ax-pr 5302 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2736 df-cleq 2750 df-clel 2830 df-ne 2952 df-ral 3075 df-rex 3076 df-v 3411 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-nul 4228 df-if 4424 df-sn 4526 df-pr 4528 df-op 4532 df-br 5037 df-opab 5099 df-xp 5534 df-rel 5535 df-cnv 5536 |
This theorem is referenced by: xpeq0 5994 ssxpb 6008 xp11 6009 unixpid 6118 xpexr2 7635 frxp 7831 xpfir 8790 axcc2lem 9909 axdc4lem 9928 mamufacex 21104 txindis 22347 2ndimaxp 30519 bj-xpnzex 34710 bj-1upln0 34760 bj-2upln1upl 34775 dibn0 38763 |
Copyright terms: Public domain | W3C validator |