Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  gchaleph Structured version   Visualization version   GIF version

Theorem gchaleph 9438
 Description: If (ℵ‘𝐴) is a GCH-set and its powerset is well-orderable, then the successor aleph (ℵ‘suc 𝐴) is equinumerous to the powerset of (ℵ‘𝐴). (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
gchaleph ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))

Proof of Theorem gchaleph
StepHypRef Expression
1 alephsucpw2 8879 . . 3 ¬ 𝒫 (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴)
2 alephon 8837 . . . . 5 (ℵ‘suc 𝐴) ∈ On
3 onenon 8720 . . . . 5 ((ℵ‘suc 𝐴) ∈ On → (ℵ‘suc 𝐴) ∈ dom card)
42, 3ax-mp 5 . . . 4 (ℵ‘suc 𝐴) ∈ dom card
5 simp3 1061 . . . 4 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → 𝒫 (ℵ‘𝐴) ∈ dom card)
6 domtri2 8760 . . . 4 (((ℵ‘suc 𝐴) ∈ dom card ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ((ℵ‘suc 𝐴) ≼ 𝒫 (ℵ‘𝐴) ↔ ¬ 𝒫 (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴)))
74, 5, 6sylancr 694 . . 3 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ((ℵ‘suc 𝐴) ≼ 𝒫 (ℵ‘𝐴) ↔ ¬ 𝒫 (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴)))
81, 7mpbiri 248 . 2 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘suc 𝐴) ≼ 𝒫 (ℵ‘𝐴))
9 fvex 6160 . . . . . . 7 (ℵ‘𝐴) ∈ V
10 simp1 1059 . . . . . . . 8 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → 𝐴 ∈ On)
11 alephgeom 8850 . . . . . . . 8 (𝐴 ∈ On ↔ ω ⊆ (ℵ‘𝐴))
1210, 11sylib 208 . . . . . . 7 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ω ⊆ (ℵ‘𝐴))
13 ssdomg 7946 . . . . . . 7 ((ℵ‘𝐴) ∈ V → (ω ⊆ (ℵ‘𝐴) → ω ≼ (ℵ‘𝐴)))
149, 12, 13mpsyl 68 . . . . . 6 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ω ≼ (ℵ‘𝐴))
15 domnsym 8031 . . . . . 6 (ω ≼ (ℵ‘𝐴) → ¬ (ℵ‘𝐴) ≺ ω)
1614, 15syl 17 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ¬ (ℵ‘𝐴) ≺ ω)
17 isfinite 8494 . . . . 5 ((ℵ‘𝐴) ∈ Fin ↔ (ℵ‘𝐴) ≺ ω)
1816, 17sylnibr 319 . . . 4 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ¬ (ℵ‘𝐴) ∈ Fin)
19 simp2 1060 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘𝐴) ∈ GCH)
20 alephordilem1 8841 . . . . . 6 (𝐴 ∈ On → (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴))
21203ad2ant1 1080 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴))
22 gchi 9391 . . . . . 6 (((ℵ‘𝐴) ∈ GCH ∧ (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴) ∧ (ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴)) → (ℵ‘𝐴) ∈ Fin)
23223expia 1264 . . . . 5 (((ℵ‘𝐴) ∈ GCH ∧ (ℵ‘𝐴) ≺ (ℵ‘suc 𝐴)) → ((ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴) → (ℵ‘𝐴) ∈ Fin))
2419, 21, 23syl2anc 692 . . . 4 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ((ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴) → (ℵ‘𝐴) ∈ Fin))
2518, 24mtod 189 . . 3 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → ¬ (ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴))
26 domtri2 8760 . . . 4 ((𝒫 (ℵ‘𝐴) ∈ dom card ∧ (ℵ‘suc 𝐴) ∈ dom card) → (𝒫 (ℵ‘𝐴) ≼ (ℵ‘suc 𝐴) ↔ ¬ (ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴)))
275, 4, 26sylancl 693 . . 3 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (𝒫 (ℵ‘𝐴) ≼ (ℵ‘suc 𝐴) ↔ ¬ (ℵ‘suc 𝐴) ≺ 𝒫 (ℵ‘𝐴)))
2825, 27mpbird 247 . 2 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → 𝒫 (ℵ‘𝐴) ≼ (ℵ‘suc 𝐴))
29 sbth 8025 . 2 (((ℵ‘suc 𝐴) ≼ 𝒫 (ℵ‘𝐴) ∧ 𝒫 (ℵ‘𝐴) ≼ (ℵ‘suc 𝐴)) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))
308, 28, 29syl2anc 692 1 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ w3a 1036   ∈ wcel 1992  Vcvv 3191   ⊆ wss 3560  𝒫 cpw 4135   class class class wbr 4618  dom cdm 5079  Oncon0 5685  suc csuc 5687  ‘cfv 5850  ωcom 7013   ≈ cen 7897   ≼ cdom 7898   ≺ csdm 7899  Fincfn 7900  cardccrd 8706  ℵcale 8707  GCHcgch 9387 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903  ax-inf2 8483 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3193  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-se 5039  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5642  df-ord 5688  df-on 5689  df-lim 5690  df-suc 5691  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-isom 5859  df-riota 6566  df-om 7014  df-wrecs 7353  df-recs 7414  df-rdg 7452  df-er 7688  df-en 7901  df-dom 7902  df-sdom 7903  df-fin 7904  df-oi 8360  df-har 8408  df-card 8710  df-aleph 8711  df-gch 9388 This theorem is referenced by:  gchaleph2  9439
 Copyright terms: Public domain W3C validator