| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpnum | Structured version Visualization version GIF version | ||
| Description: The cartesian product of numerable sets is numerable. (Contributed by Mario Carneiro, 3-Mar-2013.) (Revised by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| xpnum | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isnum2 9951 | . 2 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴) | |
| 2 | isnum2 9951 | . 2 ⊢ (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦 ≈ 𝐵) | |
| 3 | reeanv 3234 | . . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵)) | |
| 4 | omcl 8524 | . . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On) | |
| 5 | omxpen 9078 | . . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦)) | |
| 6 | xpen 9139 | . . . . . . 7 ⊢ ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) | |
| 7 | entr 9013 | . . . . . . 7 ⊢ (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) | |
| 8 | 5, 6, 7 | syl2an 608 | . . . . . 6 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) |
| 9 | isnumi 9952 | . . . . . 6 ⊢ (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card) | |
| 10 | 4, 8, 9 | syl2an2r 698 | . . . . 5 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝐴 × 𝐵) ∈ dom card) |
| 11 | 10 | ex 418 | . . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)) |
| 12 | 11 | rexlimivv 3204 | . . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card) |
| 13 | 3, 12 | sylbir 238 | . 2 ⊢ ((∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card) |
| 14 | 1, 2, 13 | syl2anb 610 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 ∃wrex 3086 class class class wbr 5103 × cxp 5653 dom cdm 5655 Oncon0 6357 (class class class)co 7414 ·o comu 8454 ≈ cen 8950 cardccrd 9941 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-oadd 8460 df-omul 8461 df-er 8697 df-en 8954 df-dom 8955 df-card 9945 |
| This theorem is used by: iunfictbso 10118 znnen 16301 qnnen 16302 ptcmplem2 24280 finixpnum 38360 poimirlem32 38402 isnumbasgrplem2 43946 smflimlem6 47605 |
| Copyright terms: Public domain | W3C validator |