![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cdainflem | Structured version Visualization version GIF version |
Description: Any partition of omega into two pieces (which may be disjoint) contains an infinite subset. (Contributed by Mario Carneiro, 11-Feb-2013.) |
Ref | Expression |
---|---|
cdainflem | ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (𝐴 ≈ ω ∨ 𝐵 ≈ ω)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unfi2 9314 | . . . 4 ⊢ ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴 ∪ 𝐵) ≺ ω) | |
2 | sdomnen 8976 | . . . 4 ⊢ ((𝐴 ∪ 𝐵) ≺ ω → ¬ (𝐴 ∪ 𝐵) ≈ ω) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ ((𝐴 ≺ ω ∧ 𝐵 ≺ ω) → ¬ (𝐴 ∪ 𝐵) ≈ ω) |
4 | 3 | con2i 139 | . 2 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → ¬ (𝐴 ≺ ω ∧ 𝐵 ≺ ω)) |
5 | ianor 980 | . . 3 ⊢ (¬ (𝐴 ≺ ω ∧ 𝐵 ≺ ω) ↔ (¬ 𝐴 ≺ ω ∨ ¬ 𝐵 ≺ ω)) | |
6 | relen 8943 | . . . . . . . . . 10 ⊢ Rel ≈ | |
7 | 6 | brrelex1i 5732 | . . . . . . . . 9 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (𝐴 ∪ 𝐵) ∈ V) |
8 | ssun1 4172 | . . . . . . . . 9 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵) | |
9 | ssdomg 8995 | . . . . . . . . 9 ⊢ ((𝐴 ∪ 𝐵) ∈ V → (𝐴 ⊆ (𝐴 ∪ 𝐵) → 𝐴 ≼ (𝐴 ∪ 𝐵))) | |
10 | 7, 8, 9 | mpisyl 21 | . . . . . . . 8 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → 𝐴 ≼ (𝐴 ∪ 𝐵)) |
11 | domentr 9008 | . . . . . . . 8 ⊢ ((𝐴 ≼ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ≈ ω) → 𝐴 ≼ ω) | |
12 | 10, 11 | mpancom 686 | . . . . . . 7 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → 𝐴 ≼ ω) |
13 | 12 | anim1i 615 | . . . . . 6 ⊢ (((𝐴 ∪ 𝐵) ≈ ω ∧ ¬ 𝐴 ≺ ω) → (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) |
14 | bren2 8978 | . . . . . 6 ⊢ (𝐴 ≈ ω ↔ (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) | |
15 | 13, 14 | sylibr 233 | . . . . 5 ⊢ (((𝐴 ∪ 𝐵) ≈ ω ∧ ¬ 𝐴 ≺ ω) → 𝐴 ≈ ω) |
16 | 15 | ex 413 | . . . 4 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (¬ 𝐴 ≺ ω → 𝐴 ≈ ω)) |
17 | ssun2 4173 | . . . . . . . . 9 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵) | |
18 | ssdomg 8995 | . . . . . . . . 9 ⊢ ((𝐴 ∪ 𝐵) ∈ V → (𝐵 ⊆ (𝐴 ∪ 𝐵) → 𝐵 ≼ (𝐴 ∪ 𝐵))) | |
19 | 7, 17, 18 | mpisyl 21 | . . . . . . . 8 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → 𝐵 ≼ (𝐴 ∪ 𝐵)) |
20 | domentr 9008 | . . . . . . . 8 ⊢ ((𝐵 ≼ (𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵) ≈ ω) → 𝐵 ≼ ω) | |
21 | 19, 20 | mpancom 686 | . . . . . . 7 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → 𝐵 ≼ ω) |
22 | 21 | anim1i 615 | . . . . . 6 ⊢ (((𝐴 ∪ 𝐵) ≈ ω ∧ ¬ 𝐵 ≺ ω) → (𝐵 ≼ ω ∧ ¬ 𝐵 ≺ ω)) |
23 | bren2 8978 | . . . . . 6 ⊢ (𝐵 ≈ ω ↔ (𝐵 ≼ ω ∧ ¬ 𝐵 ≺ ω)) | |
24 | 22, 23 | sylibr 233 | . . . . 5 ⊢ (((𝐴 ∪ 𝐵) ≈ ω ∧ ¬ 𝐵 ≺ ω) → 𝐵 ≈ ω) |
25 | 24 | ex 413 | . . . 4 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (¬ 𝐵 ≺ ω → 𝐵 ≈ ω)) |
26 | 16, 25 | orim12d 963 | . . 3 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → ((¬ 𝐴 ≺ ω ∨ ¬ 𝐵 ≺ ω) → (𝐴 ≈ ω ∨ 𝐵 ≈ ω))) |
27 | 5, 26 | biimtrid 241 | . 2 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (¬ (𝐴 ≺ ω ∧ 𝐵 ≺ ω) → (𝐴 ≈ ω ∨ 𝐵 ≈ ω))) |
28 | 4, 27 | mpd 15 | 1 ⊢ ((𝐴 ∪ 𝐵) ≈ ω → (𝐴 ≈ ω ∨ 𝐵 ≈ ω)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 845 ∈ wcel 2106 Vcvv 3474 ∪ cun 3946 ⊆ wss 3948 class class class wbr 5148 ωcom 7854 ≈ cen 8935 ≼ cdom 8936 ≺ csdm 8937 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-om 7855 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 |
This theorem is referenced by: djuinf 10182 |
Copyright terms: Public domain | W3C validator |