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

Theorem gchaleph2 10560
Description: If (ℵ‘𝐴) and (ℵ‘suc 𝐴) are GCH-sets, then the successor aleph (ℵ‘suc 𝐴) is equinumerous to the powerset of (ℵ‘𝐴). (Contributed by Mario Carneiro, 31-May-2015.)
Assertion
Ref Expression
gchaleph2 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))

Proof of Theorem gchaleph2
StepHypRef Expression
1 harcl 9445 . . 3 (har‘(ℵ‘𝐴)) ∈ On
2 alephon 9957 . . . . 5 (ℵ‘𝐴) ∈ On
3 onenon 9839 . . . . 5 ((ℵ‘𝐴) ∈ On → (ℵ‘𝐴) ∈ dom card)
4 harsdom 9885 . . . . 5 ((ℵ‘𝐴) ∈ dom card → (ℵ‘𝐴) ≺ (har‘(ℵ‘𝐴)))
52, 3, 4mp2b 10 . . . 4 (ℵ‘𝐴) ≺ (har‘(ℵ‘𝐴))
6 simp1 1136 . . . . . . 7 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → 𝐴 ∈ On)
7 alephgeom 9970 . . . . . . 7 (𝐴 ∈ On ↔ ω ⊆ (ℵ‘𝐴))
86, 7sylib 218 . . . . . 6 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → ω ⊆ (ℵ‘𝐴))
9 ssdomg 8922 . . . . . 6 ((ℵ‘𝐴) ∈ On → (ω ⊆ (ℵ‘𝐴) → ω ≼ (ℵ‘𝐴)))
102, 8, 9mpsyl 68 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → ω ≼ (ℵ‘𝐴))
11 simp2 1137 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (ℵ‘𝐴) ∈ GCH)
12 alephsuc 9956 . . . . . . 7 (𝐴 ∈ On → (ℵ‘suc 𝐴) = (har‘(ℵ‘𝐴)))
136, 12syl 17 . . . . . 6 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (ℵ‘suc 𝐴) = (har‘(ℵ‘𝐴)))
14 simp3 1138 . . . . . 6 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (ℵ‘suc 𝐴) ∈ GCH)
1513, 14eqeltrrd 2832 . . . . 5 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (har‘(ℵ‘𝐴)) ∈ GCH)
16 gchpwdom 10558 . . . . 5 ((ω ≼ (ℵ‘𝐴) ∧ (ℵ‘𝐴) ∈ GCH ∧ (har‘(ℵ‘𝐴)) ∈ GCH) → ((ℵ‘𝐴) ≺ (har‘(ℵ‘𝐴)) ↔ 𝒫 (ℵ‘𝐴) ≼ (har‘(ℵ‘𝐴))))
1710, 11, 15, 16syl3anc 1373 . . . 4 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → ((ℵ‘𝐴) ≺ (har‘(ℵ‘𝐴)) ↔ 𝒫 (ℵ‘𝐴) ≼ (har‘(ℵ‘𝐴))))
185, 17mpbii 233 . . 3 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → 𝒫 (ℵ‘𝐴) ≼ (har‘(ℵ‘𝐴)))
19 ondomen 9925 . . 3 (((har‘(ℵ‘𝐴)) ∈ On ∧ 𝒫 (ℵ‘𝐴) ≼ (har‘(ℵ‘𝐴))) → 𝒫 (ℵ‘𝐴) ∈ dom card)
201, 18, 19sylancr 587 . 2 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → 𝒫 (ℵ‘𝐴) ∈ dom card)
21 gchaleph 10559 . 2 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ 𝒫 (ℵ‘𝐴) ∈ dom card) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))
2220, 21syld3an3 1411 1 ((𝐴 ∈ On ∧ (ℵ‘𝐴) ∈ GCH ∧ (ℵ‘suc 𝐴) ∈ GCH) → (ℵ‘suc 𝐴) ≈ 𝒫 (ℵ‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  w3a 1086   = wceq 1541  wcel 2111  wss 3902  𝒫 cpw 4550   class class class wbr 5091  dom cdm 5616  Oncon0 6306  suc csuc 6308  cfv 6481  ωcom 7796  cen 8866  cdom 8867  csdm 8868  harchar 9442  cardccrd 9825  cale 9826  GCHcgch 10508
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-inf2 9531
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-tp 4581  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-se 5570  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-isom 6490  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-supp 8091  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-seqom 8367  df-1o 8385  df-2o 8386  df-oadd 8389  df-omul 8390  df-oexp 8391  df-er 8622  df-map 8752  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873  df-fsupp 9246  df-oi 9396  df-har 9443  df-wdom 9451  df-cnf 9552  df-dju 9791  df-card 9829  df-aleph 9830  df-fin4 10175  df-gch 10509
This theorem is referenced by:  gch2  10563  gch3  10564
  Copyright terms: Public domain W3C validator