![]() |
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 8955 | . . 3 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V) | |
2 | ctex 8955 | . . 3 ⊢ (𝐵 ≼ ω → 𝐵 ∈ V) | |
3 | undjudom 10158 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) | |
4 | 1, 2, 3 | syl2an 595 | . 2 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵)) |
5 | djudom1 10173 | . . . . 5 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ∈ V) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵)) | |
6 | 2, 5 | sylan2 592 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵)) |
7 | simpr 484 | . . . . 5 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → 𝐵 ≼ ω) | |
8 | omex 9634 | . . . . 5 ⊢ ω ∈ V | |
9 | djudom2 10174 | . . . . 5 ⊢ ((𝐵 ≼ ω ∧ ω ∈ V) → (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) | |
10 | 7, 8, 9 | sylancl 585 | . . . 4 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) |
11 | domtr 8999 | . . . 4 ⊢ (((𝐴 ⊔ 𝐵) ≼ (ω ⊔ 𝐵) ∧ (ω ⊔ 𝐵) ≼ (ω ⊔ ω)) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω)) | |
12 | 6, 10, 11 | syl2anc 583 | . . 3 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω)) |
13 | 8, 8 | xpex 7733 | . . . . 5 ⊢ (ω × ω) ∈ V |
14 | xp2dju 10167 | . . . . . 6 ⊢ (2o × ω) = (ω ⊔ ω) | |
15 | ordom 7858 | . . . . . . . 8 ⊢ Ord ω | |
16 | 2onn 8637 | . . . . . . . 8 ⊢ 2o ∈ ω | |
17 | ordelss 6370 | . . . . . . . 8 ⊢ ((Ord ω ∧ 2o ∈ ω) → 2o ⊆ ω) | |
18 | 15, 16, 17 | mp2an 689 | . . . . . . 7 ⊢ 2o ⊆ ω |
19 | xpss1 5685 | . . . . . . 7 ⊢ (2o ⊆ ω → (2o × ω) ⊆ (ω × ω)) | |
20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ (2o × ω) ⊆ (ω × ω) |
21 | 14, 20 | eqsstrri 4009 | . . . . 5 ⊢ (ω ⊔ ω) ⊆ (ω × ω) |
22 | ssdomg 8992 | . . . . 5 ⊢ ((ω × ω) ∈ V → ((ω ⊔ ω) ⊆ (ω × ω) → (ω ⊔ ω) ≼ (ω × ω))) | |
23 | 13, 21, 22 | mp2 9 | . . . 4 ⊢ (ω ⊔ ω) ≼ (ω × ω) |
24 | xpomen 10006 | . . . 4 ⊢ (ω × ω) ≈ ω | |
25 | domentr 9005 | . . . 4 ⊢ (((ω ⊔ ω) ≼ (ω × ω) ∧ (ω × ω) ≈ ω) → (ω ⊔ ω) ≼ ω) | |
26 | 23, 24, 25 | mp2an 689 | . . 3 ⊢ (ω ⊔ ω) ≼ ω |
27 | domtr 8999 | . . 3 ⊢ (((𝐴 ⊔ 𝐵) ≼ (ω ⊔ ω) ∧ (ω ⊔ ω) ≼ ω) → (𝐴 ⊔ 𝐵) ≼ ω) | |
28 | 12, 26, 27 | sylancl 585 | . 2 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ⊔ 𝐵) ≼ ω) |
29 | domtr 8999 | . 2 ⊢ (((𝐴 ∪ 𝐵) ≼ (𝐴 ⊔ 𝐵) ∧ (𝐴 ⊔ 𝐵) ≼ ω) → (𝐴 ∪ 𝐵) ≼ ω) | |
30 | 4, 28, 29 | syl2anc 583 | 1 ⊢ ((𝐴 ≼ ω ∧ 𝐵 ≼ ω) → (𝐴 ∪ 𝐵) ≼ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2098 Vcvv 3466 ∪ cun 3938 ⊆ wss 3940 class class class wbr 5138 × cxp 5664 Ord word 6353 ωcom 7848 2oc2o 8455 ≈ cen 8932 ≼ cdom 8933 ⊔ cdju 9889 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-inf2 9632 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-se 5622 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7357 df-ov 7404 df-om 7849 df-1st 7968 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-2o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-oi 9501 df-dju 9892 df-card 9930 |
This theorem is referenced by: cctop 22831 2ndcdisj2 23283 ovolctb2 25343 uniiccdif 25429 prct 32408 pibt2 36788 |
Copyright terms: Public domain | W3C validator |