MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  alephgch Unicode version

Theorem alephgch 8316
Description: If  ( aleph `  suc  A ) is equinumerous to the powerset of  ( aleph `  A
), then  ( aleph `  A
) is a GCH-set. (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
alephgch  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  ( aleph `  A )  e. GCH )

Proof of Theorem alephgch
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 alephnbtwn2 7715 . . . . 5  |-  -.  (
( aleph `  A )  ~<  x  /\  x  ~<  (
aleph `  suc  A ) )
2 sdomen2 7022 . . . . . 6  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  ( x  ~<  ( aleph `  suc  A )  <-> 
x  ~<  ~P ( aleph `  A ) ) )
32anbi2d 684 . . . . 5  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  ( (
( aleph `  A )  ~<  x  /\  x  ~<  (
aleph `  suc  A ) )  <->  ( ( aleph `  A )  ~<  x  /\  x  ~<  ~P ( aleph `  A ) ) ) )
41, 3mtbii 293 . . . 4  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  -.  (
( aleph `  A )  ~<  x  /\  x  ~<  ~P ( aleph `  A )
) )
54alrimiv 1621 . . 3  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  A. x  -.  ( ( aleph `  A
)  ~<  x  /\  x  ~<  ~P ( aleph `  A
) ) )
65olcd 382 . 2  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  ( ( aleph `  A )  e. 
Fin  \/  A. x  -.  ( ( aleph `  A
)  ~<  x  /\  x  ~<  ~P ( aleph `  A
) ) ) )
7 fvex 5555 . . 3  |-  ( aleph `  A )  e.  _V
8 elgch 8260 . . 3  |-  ( (
aleph `  A )  e. 
_V  ->  ( ( aleph `  A )  e. GCH  <->  ( ( aleph `  A )  e. 
Fin  \/  A. x  -.  ( ( aleph `  A
)  ~<  x  /\  x  ~<  ~P ( aleph `  A
) ) ) ) )
97, 8ax-mp 8 . 2  |-  ( (
aleph `  A )  e. GCH  <->  ( ( aleph `  A )  e.  Fin  \/  A. x  -.  ( ( aleph `  A
)  ~<  x  /\  x  ~<  ~P ( aleph `  A
) ) ) )
106, 9sylibr 203 1  |-  ( (
aleph `  suc  A ) 
~~  ~P ( aleph `  A
)  ->  ( aleph `  A )  e. GCH )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358   A.wal 1530    e. wcel 1696   _Vcvv 2801   ~Pcpw 3638   class class class wbr 4039   suc csuc 4410   ` cfv 5271    ~~ cen 6876    ~< csdm 6878   Fincfn 6879   alephcale 7585  GCHcgch 8258
This theorem is referenced by:  gch3  8318
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-inf2 7358
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rmo 2564  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-int 3879  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-se 4369  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-isom 5280  df-riota 6320  df-recs 6404  df-rdg 6439  df-er 6676  df-en 6880  df-dom 6881  df-sdom 6882  df-fin 6883  df-oi 7241  df-har 7288  df-card 7588  df-aleph 7589  df-gch 8259
  Copyright terms: Public domain W3C validator