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

Theorem alephsing 7870
Description: The cofinality of a limit aleph is the same as the cofinality of its argument, so if  ( aleph `  A )  <  A, then  ( aleph `  A
) is singular. Conversely, if  ( aleph `  A ) is regular (i.e. weakly inaccessible), then  ( aleph `  A )  =  A, so  A has to be rather large (see alephfp 7703). Proposition 11.13 of [TakeutiZaring] p. 103. (Contributed by Mario Carneiro, 9-Mar-2013.)
Assertion
Ref Expression
alephsing  |-  ( Lim 
A  ->  ( cf `  ( aleph `  A )
)  =  ( cf `  A ) )

Proof of Theorem alephsing
StepHypRef Expression
1 alephfnon 7660 . . . . . . 7  |-  aleph  Fn  On
2 fnfun 5279 . . . . . . 7  |-  ( aleph  Fn  On  ->  Fun  aleph )
31, 2ax-mp 10 . . . . . 6  |-  Fun  aleph
4 simpl 445 . . . . . 6  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A  e.  _V )
5 resfunexg 5671 . . . . . 6  |-  ( ( Fun  aleph  /\  A  e.  _V )  ->  ( aleph  |`  A )  e.  _V )
63, 4, 5sylancr 647 . . . . 5  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( aleph 
|`  A )  e. 
_V )
7 limelon 4427 . . . . . . . 8  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A  e.  On )
8 onss 4554 . . . . . . . 8  |-  ( A  e.  On  ->  A  C_  On )
97, 8syl 17 . . . . . . 7  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A  C_  On )
10 fnssres 5295 . . . . . . 7  |-  ( (
aleph  Fn  On  /\  A  C_  On )  ->  ( aleph 
|`  A )  Fn  A )
111, 9, 10sylancr 647 . . . . . 6  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( aleph 
|`  A )  Fn  A )
12 fvres 5475 . . . . . . . . . . 11  |-  ( y  e.  A  ->  (
( aleph  |`  A ) `  y )  =  (
aleph `  y ) )
1312adantl 454 . . . . . . . . . 10  |-  ( ( A  e.  On  /\  y  e.  A )  ->  ( ( aleph  |`  A ) `
 y )  =  ( aleph `  y )
)
14 alephord2i 7672 . . . . . . . . . . 11  |-  ( A  e.  On  ->  (
y  e.  A  -> 
( aleph `  y )  e.  ( aleph `  A )
) )
1514imp 420 . . . . . . . . . 10  |-  ( ( A  e.  On  /\  y  e.  A )  ->  ( aleph `  y )  e.  ( aleph `  A )
)
1613, 15eqeltrd 2332 . . . . . . . . 9  |-  ( ( A  e.  On  /\  y  e.  A )  ->  ( ( aleph  |`  A ) `
 y )  e.  ( aleph `  A )
)
177, 16sylan 459 . . . . . . . 8  |-  ( ( ( A  e.  _V  /\ 
Lim  A )  /\  y  e.  A )  ->  ( ( aleph  |`  A ) `
 y )  e.  ( aleph `  A )
)
1817ralrimiva 2601 . . . . . . 7  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A. y  e.  A  ( ( aleph 
|`  A ) `  y )  e.  (
aleph `  A ) )
19 fnfvrnss 5621 . . . . . . 7  |-  ( ( ( aleph  |`  A )  Fn  A  /\  A. y  e.  A  ( ( aleph 
|`  A ) `  y )  e.  (
aleph `  A ) )  ->  ran  ( aleph  |`  A )  C_  ( aleph `  A ) )
2011, 18, 19syl2anc 645 . . . . . 6  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ran  ( aleph  |`  A )  C_  ( aleph `  A )
)
21 df-f 4685 . . . . . 6  |-  ( (
aleph  |`  A ) : A --> ( aleph `  A
)  <->  ( ( aleph  |`  A )  Fn  A  /\  ran  ( aleph  |`  A ) 
C_  ( aleph `  A
) ) )
2211, 20, 21sylanbrc 648 . . . . 5  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( aleph 
|`  A ) : A --> ( aleph `  A
) )
23 alephsmo 7697 . . . . . 6  |-  Smo  aleph
24 fndm 5281 . . . . . . . 8  |-  ( aleph  Fn  On  ->  dom  aleph  =  On )
251, 24ax-mp 10 . . . . . . 7  |-  dom  aleph  =  On
267, 25syl6eleqr 2349 . . . . . 6  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A  e.  dom  aleph )
27 smores 6337 . . . . . 6  |-  ( ( Smo  aleph  /\  A  e.  dom  aleph )  ->  Smo  ( aleph  |`  A ) )
2823, 26, 27sylancr 647 . . . . 5  |-  ( ( A  e.  _V  /\  Lim  A )  ->  Smo  ( aleph  |`  A ) )
29 alephlim 7662 . . . . . . . 8  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( aleph `  A )  = 
U_ y  e.  A  ( aleph `  y )
)
3029eleq2d 2325 . . . . . . 7  |-  ( ( A  e.  _V  /\  Lim  A )  ->  (
x  e.  ( aleph `  A )  <->  x  e.  U_ y  e.  A  (
aleph `  y ) ) )
31 eliun 3883 . . . . . . . 8  |-  ( x  e.  U_ y  e.  A  ( aleph `  y
)  <->  E. y  e.  A  x  e.  ( aleph `  y ) )
32 alephon 7664 . . . . . . . . . 10  |-  ( aleph `  y )  e.  On
3332onelssi 4473 . . . . . . . . 9  |-  ( x  e.  ( aleph `  y
)  ->  x  C_  ( aleph `  y ) )
3433reximi 2625 . . . . . . . 8  |-  ( E. y  e.  A  x  e.  ( aleph `  y
)  ->  E. y  e.  A  x  C_  ( aleph `  y ) )
3531, 34sylbi 189 . . . . . . 7  |-  ( x  e.  U_ y  e.  A  ( aleph `  y
)  ->  E. y  e.  A  x  C_  ( aleph `  y ) )
3630, 35syl6bi 221 . . . . . 6  |-  ( ( A  e.  _V  /\  Lim  A )  ->  (
x  e.  ( aleph `  A )  ->  E. y  e.  A  x  C_  ( aleph `  y ) ) )
3736ralrimiv 2600 . . . . 5  |-  ( ( A  e.  _V  /\  Lim  A )  ->  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( aleph `  y
) )
38 feq1 5313 . . . . . . . 8  |-  ( f  =  ( aleph  |`  A )  ->  ( f : A --> ( aleph `  A
)  <->  ( aleph  |`  A ) : A --> ( aleph `  A ) ) )
39 smoeq 6335 . . . . . . . 8  |-  ( f  =  ( aleph  |`  A )  ->  ( Smo  f  <->  Smo  ( aleph  |`  A ) ) )
40 fveq1 5457 . . . . . . . . . . . 12  |-  ( f  =  ( aleph  |`  A )  ->  ( f `  y )  =  ( ( aleph  |`  A ) `  y ) )
4140, 12sylan9eq 2310 . . . . . . . . . . 11  |-  ( ( f  =  ( aleph  |`  A )  /\  y  e.  A )  ->  (
f `  y )  =  ( aleph `  y
) )
4241sseq2d 3181 . . . . . . . . . 10  |-  ( ( f  =  ( aleph  |`  A )  /\  y  e.  A )  ->  (
x  C_  ( f `  y )  <->  x  C_  ( aleph `  y ) ) )
4342rexbidva 2535 . . . . . . . . 9  |-  ( f  =  ( aleph  |`  A )  ->  ( E. y  e.  A  x  C_  (
f `  y )  <->  E. y  e.  A  x 
C_  ( aleph `  y
) ) )
4443ralbidv 2538 . . . . . . . 8  |-  ( f  =  ( aleph  |`  A )  ->  ( A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( f `  y )  <->  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( aleph `  y
) ) )
4538, 39, 443anbi123d 1257 . . . . . . 7  |-  ( f  =  ( aleph  |`  A )  ->  ( ( f : A --> ( aleph `  A )  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( f `  y ) )  <->  ( ( aleph 
|`  A ) : A --> ( aleph `  A
)  /\  Smo  ( aleph  |`  A )  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( aleph `  y ) ) ) )
4645cla4egv 2844 . . . . . 6  |-  ( (
aleph  |`  A )  e. 
_V  ->  ( ( (
aleph  |`  A ) : A --> ( aleph `  A
)  /\  Smo  ( aleph  |`  A )  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( aleph `  y ) )  ->  E. f ( f : A --> ( aleph `  A )  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( f `  y ) ) ) )
4746imp 420 . . . . 5  |-  ( ( ( aleph  |`  A )  e. 
_V  /\  ( ( aleph 
|`  A ) : A --> ( aleph `  A
)  /\  Smo  ( aleph  |`  A )  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  ( aleph `  y ) ) )  ->  E. f
( f : A --> ( aleph `  A )  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  (
f `  y )
) )
486, 22, 28, 37, 47syl13anc 1189 . . . 4  |-  ( ( A  e.  _V  /\  Lim  A )  ->  E. f
( f : A --> ( aleph `  A )  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  (
f `  y )
) )
49 alephon 7664 . . . . 5  |-  ( aleph `  A )  e.  On
50 cfcof 7868 . . . . 5  |-  ( ( ( aleph `  A )  e.  On  /\  A  e.  On )  ->  ( E. f ( f : A --> ( aleph `  A
)  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  (
f `  y )
)  ->  ( cf `  ( aleph `  A )
)  =  ( cf `  A ) ) )
5149, 7, 50sylancr 647 . . . 4  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( E. f ( f : A --> ( aleph `  A
)  /\  Smo  f  /\  A. x  e.  ( aleph `  A ) E. y  e.  A  x  C_  (
f `  y )
)  ->  ( cf `  ( aleph `  A )
)  =  ( cf `  A ) ) )
5248, 51mpd 16 . . 3  |-  ( ( A  e.  _V  /\  Lim  A )  ->  ( cf `  ( aleph `  A
) )  =  ( cf `  A ) )
5352expcom 426 . 2  |-  ( Lim 
A  ->  ( A  e.  _V  ->  ( cf `  ( aleph `  A )
)  =  ( cf `  A ) ) )
54 cf0 7845 . . 3  |-  ( cf `  (/) )  =  (/)
55 fvprc 5455 . . . 4  |-  ( -.  A  e.  _V  ->  (
aleph `  A )  =  (/) )
5655fveq2d 5462 . . 3  |-  ( -.  A  e.  _V  ->  ( cf `  ( aleph `  A ) )  =  ( cf `  (/) ) )
57 fvprc 5455 . . 3  |-  ( -.  A  e.  _V  ->  ( cf `  A )  =  (/) )
5854, 56, 573eqtr4a 2316 . 2  |-  ( -.  A  e.  _V  ->  ( cf `  ( aleph `  A ) )  =  ( cf `  A
) )
5953, 58pm2.61d1 153 1  |-  ( Lim 
A  ->  ( cf `  ( aleph `  A )
)  =  ( cf `  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 5    -> wi 6    /\ wa 360    /\ w3a 939   E.wex 1537    = wceq 1619    e. wcel 1621   A.wral 2518   E.wrex 2519   _Vcvv 2763    C_ wss 3127   (/)c0 3430   U_ciun 3879   Oncon0 4364   Lim wlim 4365   dom cdm 4661   ran crn 4662    |` cres 4663   Fun wfun 4667    Fn wfn 4668   -->wf 4669   ` cfv 4673   Smo wsmo 6330   alephcale 7537   cfccf 7538
This theorem is referenced by:  alephom  8175  winafp  8287
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239  ax-rep 4105  ax-sep 4115  ax-nul 4123  ax-pow 4160  ax-pr 4186  ax-un 4484  ax-inf2 7310
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2122  df-mo 2123  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-ne 2423  df-ral 2523  df-rex 2524  df-reu 2525  df-rmo 2526  df-rab 2527  df-v 2765  df-sbc 2967  df-csb 3057  df-dif 3130  df-un 3132  df-in 3134  df-ss 3141  df-pss 3143  df-nul 3431  df-if 3540  df-pw 3601  df-sn 3620  df-pr 3621  df-tp 3622  df-op 3623  df-uni 3802  df-int 3837  df-iun 3881  df-br 3998  df-opab 4052  df-mpt 4053  df-tr 4088  df-eprel 4277  df-id 4281  df-po 4286  df-so 4287  df-fr 4324  df-se 4325  df-we 4326  df-ord 4367  df-on 4368  df-lim 4369  df-suc 4370  df-om 4629  df-xp 4675  df-rel 4676  df-cnv 4677  df-co 4678  df-dm 4679  df-rn 4680  df-res 4681  df-ima 4682  df-fun 4683  df-fn 4684  df-f 4685  df-f1 4686  df-fo 4687  df-f1o 4688  df-fv 4689  df-isom 4690  df-ov 5795  df-oprab 5796  df-mpt2 5797  df-1st 6056  df-2nd 6057  df-iota 6225  df-riota 6272  df-smo 6331  df-recs 6356  df-rdg 6391  df-er 6628  df-map 6742  df-en 6832  df-dom 6833  df-sdom 6834  df-fin 6835  df-oi 7193  df-har 7240  df-card 7540  df-aleph 7541  df-cf 7542  df-acn 7543
  Copyright terms: Public domain W3C validator