Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xpct | Structured version Visualization version GIF version |
Description: The cartesian product of two countable sets is countable. (Contributed by Thierry Arnoux, 24-Sep-2017.) |
Ref | Expression |
---|---|
xpct | ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 × 𝐵) ≼ ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ctex 8518 | . . . . 5 ⊢ (𝐵 ≼ ω → 𝐵 ∈ V) | |
2 | 1 | adantl 484 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → 𝐵 ∈ V) |
3 | simpl 485 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → 𝐴 ≼ ω) | |
4 | xpdom1g 8608 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐴 ≼ ω) → (𝐴 × 𝐵) ≼ (ω × 𝐵)) | |
5 | 2, 3, 4 | syl2anc 586 | . . 3 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 × 𝐵) ≼ (ω × 𝐵)) |
6 | omex 9100 | . . . . 5 ⊢ ω ∈ V | |
7 | 6 | xpdom2 8606 | . . . 4 ⊢ (𝐵 ≼ ω → (ω × 𝐵) ≼ (ω × ω)) |
8 | 7 | adantl 484 | . . 3 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (ω × 𝐵) ≼ (ω × ω)) |
9 | domtr 8556 | . . 3 ⊢ (((𝐴 × 𝐵) ≼ (ω × 𝐵) ∧ (ω × 𝐵) ≼ (ω × ω)) → (𝐴 × 𝐵) ≼ (ω × ω)) | |
10 | 5, 8, 9 | syl2anc 586 | . 2 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 × 𝐵) ≼ (ω × ω)) |
11 | xpomen 9435 | . 2 ⊢ (ω × ω) ≈ ω | |
12 | domentr 8562 | . 2 ⊢ (((𝐴 × 𝐵) ≼ (ω × ω) ∧ (ω × ω) ≈ ω) → (𝐴 × 𝐵) ≼ ω) | |
13 | 10, 11, 12 | sylancl 588 | 1 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 × 𝐵) ≼ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∈ wcel 2110 Vcvv 3495 class class class wbr 5059 × cxp 5548 ωcom 7574 ≈ cen 8500 ≼ cdom 8501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-inf2 9098 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-se 5510 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-isom 6359 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-oi 8968 df-card 9362 |
This theorem is referenced by: tx1stc 22252 mpocti 30445 mpct 41456 opnvonmbllem2 42908 smflimlem6 43045 smfpimbor1lem1 43066 |
Copyright terms: Public domain | W3C validator |