![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > alephsucdom | Structured version Visualization version GIF version |
Description: A set dominated by an aleph is strictly dominated by its successor aleph and vice-versa. (Contributed by NM, 3-Nov-2003.) (Revised by Mario Carneiro, 2-Feb-2013.) |
Ref | Expression |
---|---|
alephsucdom | ⊢ (𝐵 ∈ On → (𝐴 ≼ (ℵ‘𝐵) ↔ 𝐴 ≺ (ℵ‘suc 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | alephordilem1 9100 | . . 3 ⊢ (𝐵 ∈ On → (ℵ‘𝐵) ≺ (ℵ‘suc 𝐵)) | |
2 | domsdomtr 8255 | . . . 4 ⊢ ((𝐴 ≼ (ℵ‘𝐵) ∧ (ℵ‘𝐵) ≺ (ℵ‘suc 𝐵)) → 𝐴 ≺ (ℵ‘suc 𝐵)) | |
3 | 2 | ex 397 | . . 3 ⊢ (𝐴 ≼ (ℵ‘𝐵) → ((ℵ‘𝐵) ≺ (ℵ‘suc 𝐵) → 𝐴 ≺ (ℵ‘suc 𝐵))) |
4 | 1, 3 | syl5com 31 | . 2 ⊢ (𝐵 ∈ On → (𝐴 ≼ (ℵ‘𝐵) → 𝐴 ≺ (ℵ‘suc 𝐵))) |
5 | sdomdom 8141 | . . . . 5 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → 𝐴 ≼ (ℵ‘suc 𝐵)) | |
6 | alephon 9096 | . . . . . 6 ⊢ (ℵ‘suc 𝐵) ∈ On | |
7 | ondomen 9064 | . . . . . 6 ⊢ (((ℵ‘suc 𝐵) ∈ On ∧ 𝐴 ≼ (ℵ‘suc 𝐵)) → 𝐴 ∈ dom card) | |
8 | 6, 7 | mpan 670 | . . . . 5 ⊢ (𝐴 ≼ (ℵ‘suc 𝐵) → 𝐴 ∈ dom card) |
9 | cardid2 8983 | . . . . 5 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴) | |
10 | 5, 8, 9 | 3syl 18 | . . . 4 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → (card‘𝐴) ≈ 𝐴) |
11 | 10 | ensymd 8164 | . . 3 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → 𝐴 ≈ (card‘𝐴)) |
12 | alephnbtwn2 9099 | . . . . . 6 ⊢ ¬ ((ℵ‘𝐵) ≺ (card‘𝐴) ∧ (card‘𝐴) ≺ (ℵ‘suc 𝐵)) | |
13 | 12 | imnani 387 | . . . . 5 ⊢ ((ℵ‘𝐵) ≺ (card‘𝐴) → ¬ (card‘𝐴) ≺ (ℵ‘suc 𝐵)) |
14 | ensdomtr 8256 | . . . . . 6 ⊢ (((card‘𝐴) ≈ 𝐴 ∧ 𝐴 ≺ (ℵ‘suc 𝐵)) → (card‘𝐴) ≺ (ℵ‘suc 𝐵)) | |
15 | 10, 14 | mpancom 668 | . . . . 5 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → (card‘𝐴) ≺ (ℵ‘suc 𝐵)) |
16 | 13, 15 | nsyl3 135 | . . . 4 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → ¬ (ℵ‘𝐵) ≺ (card‘𝐴)) |
17 | cardon 8974 | . . . . 5 ⊢ (card‘𝐴) ∈ On | |
18 | alephon 9096 | . . . . 5 ⊢ (ℵ‘𝐵) ∈ On | |
19 | domtriord 8266 | . . . . 5 ⊢ (((card‘𝐴) ∈ On ∧ (ℵ‘𝐵) ∈ On) → ((card‘𝐴) ≼ (ℵ‘𝐵) ↔ ¬ (ℵ‘𝐵) ≺ (card‘𝐴))) | |
20 | 17, 18, 19 | mp2an 672 | . . . 4 ⊢ ((card‘𝐴) ≼ (ℵ‘𝐵) ↔ ¬ (ℵ‘𝐵) ≺ (card‘𝐴)) |
21 | 16, 20 | sylibr 224 | . . 3 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → (card‘𝐴) ≼ (ℵ‘𝐵)) |
22 | endomtr 8171 | . . 3 ⊢ ((𝐴 ≈ (card‘𝐴) ∧ (card‘𝐴) ≼ (ℵ‘𝐵)) → 𝐴 ≼ (ℵ‘𝐵)) | |
23 | 11, 21, 22 | syl2anc 573 | . 2 ⊢ (𝐴 ≺ (ℵ‘suc 𝐵) → 𝐴 ≼ (ℵ‘𝐵)) |
24 | 4, 23 | impbid1 215 | 1 ⊢ (𝐵 ∈ On → (𝐴 ≼ (ℵ‘𝐵) ↔ 𝐴 ≺ (ℵ‘suc 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∈ wcel 2145 class class class wbr 4787 dom cdm 5250 Oncon0 5865 suc csuc 5867 ‘cfv 6030 ≈ cen 8110 ≼ cdom 8111 ≺ csdm 8112 cardccrd 8965 ℵcale 8966 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4905 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7100 ax-inf2 8706 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-se 5210 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-isom 6039 df-riota 6757 df-om 7217 df-wrecs 7563 df-recs 7625 df-rdg 7663 df-er 7900 df-en 8114 df-dom 8115 df-sdom 8116 df-fin 8117 df-oi 8575 df-har 8623 df-card 8969 df-aleph 8970 |
This theorem is referenced by: alephsuc2 9107 alephreg 9610 |
Copyright terms: Public domain | W3C validator |