![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > unctb | Structured version Visualization version GIF version |
Description: The union of two countable sets is countable. (Contributed by FL, 25-Aug-2006.) (Proof shortened by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
unctb | ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ∪ 𝐵) ≼ ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ctex 8986 | . . 3 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V) | |
2 | ctex 8986 | . . 3 ⊢ (𝐵 ≼ ω → 𝐵 ∈ V) | |
3 | undjudom 10203 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) | |
4 | 1, 2, 3 | syl2an 594 | . 2 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) |
5 | djudom1 10218 | . . . . 5 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ∈ V) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵)) | |
6 | 2, 5 | sylan2 591 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵)) |
7 | simpr 483 | . . . . 5 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → 𝐵 ≼ ω) | |
8 | omex 9679 | . . . . 5 ⊢ ω ∈ V | |
9 | djudom2 10219 | . . . . 5 ⊢ ((𝐵 ≼ ω ∧ ω ∈ V) → (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) | |
10 | 7, 8, 9 | sylancl 584 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) |
11 | domtr 9030 | . . . 4 ⊢ (((𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵) ∧ (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω)) | |
12 | 6, 10, 11 | syl2anc 582 | . . 3 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω)) |
13 | 8, 8 | xpex 7753 | . . . . 5 ⊢ (ω × ω) ∈ V |
14 | xp2dju 10212 | . . . . . 6 ⊢ (2o × ω) = (ω ⊔ ω) | |
15 | ordom 7878 | . . . . . . . 8 ⊢ Ord ω | |
16 | 2onn 8664 | . . . . . . . 8 ⊢ 2o ∈ ω | |
17 | ordelss 6384 | . . . . . . . 8 ⊢ ((Ord ω ∧ 2o ∈ ω) → 2o ⊆ ω) | |
18 | 15, 16, 17 | mp2an 690 | . . . . . . 7 ⊢ 2o ⊆ ω |
19 | xpss1 5693 | . . . . . . 7 ⊢ (2o ⊆ ω → (2o × ω) ⊆ (ω × ω)) | |
20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ (2o × ω) ⊆ (ω × ω) |
21 | 14, 20 | eqsstrri 4014 | . . . . 5 ⊢ (ω ⊔ ω) ⊆ (ω × ω) |
22 | ssdomg 9023 | . . . . 5 ⊢ ((ω × ω) ∈ V → ((ω ⊔ ω) ⊆ (ω × ω) → (ω ⊔ ω) ≼ (ω × ω))) | |
23 | 13, 21, 22 | mp2 9 | . . . 4 ⊢ (ω ⊔ ω) ≼ (ω × ω) |
24 | xpomen 10051 | . . . 4 ⊢ (ω × ω) ≈ ω | |
25 | domentr 9036 | . . . 4 ⊢ (((ω ⊔ ω) ≼ (ω × ω) ∧ (ω × ω) ≈ ω) → (ω ⊔ ω) ≼ ω) | |
26 | 23, 24, 25 | mp2an 690 | . . 3 ⊢ (ω ⊔ ω) ≼ ω |
27 | domtr 9030 | . . 3 ⊢ (((𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω) ∧ (ω ⊔ ω) ≼ ω) → (𝐴 ⊔ 𝐵) ≼ ω) | |
28 | 12, 26, 27 | sylancl 584 | . 2 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ ω) |
29 | domtr 9030 | . 2 ⊢ (((𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵) ∧ (𝐴 ⊔ 𝐵) ≼ ω) → (𝐴 ∪ 𝐵) ≼ ω) | |
30 | 4, 28, 29 | syl2anc 582 | 1 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ∪ 𝐵) ≼ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∈ wcel 2099 Vcvv 3462 ∪ cun 3944 ⊆ wss 3946 class class class wbr 5145 × cxp 5672 Ord word 6367 ωcom 7868 2oc2o 8482 ≈ cen 8963 ≼ cdom 8964 ⊔ cdju 9934 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5282 ax-sep 5296 ax-nul 5303 ax-pow 5361 ax-pr 5425 ax-un 7738 ax-inf2 9677 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-pss 3966 df-nul 4323 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4906 df-int 4947 df-iun 4995 df-br 5146 df-opab 5208 df-mpt 5229 df-tr 5263 df-id 5572 df-eprel 5578 df-po 5586 df-so 5587 df-fr 5629 df-se 5630 df-we 5631 df-xp 5680 df-rel 5681 df-cnv 5682 df-co 5683 df-dm 5684 df-rn 5685 df-res 5686 df-ima 5687 df-pred 6304 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6498 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-isom 6555 df-riota 7372 df-ov 7419 df-om 7869 df-1st 7995 df-2nd 7996 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-1o 8488 df-2o 8489 df-er 8726 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-oi 9546 df-dju 9937 df-card 9975 |
This theorem is referenced by: cctop 22997 2ndcdisj2 23449 ovolctb2 25509 uniiccdif 25595 prct 32628 pibt2 37137 |
Copyright terms: Public domain | W3C validator |