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

Theorem cardcf 8088
Description: Cofinality is a cardinal number. Proposition 11.11 of [TakeutiZaring] p. 103. (Contributed by NM, 24-Apr-2004.) (Revised by Mario Carneiro, 15-Sep-2013.)
Assertion
Ref Expression
cardcf  |-  ( card `  ( cf `  A
) )  =  ( cf `  A )

Proof of Theorem cardcf
Dummy variables  x  y  z  w  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cfval 8083 . . . 4  |-  ( A  e.  On  ->  ( cf `  A )  = 
|^| { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } )
2 vex 2919 . . . . . . . . 9  |-  v  e. 
_V
3 eqeq1 2410 . . . . . . . . . . 11  |-  ( x  =  v  ->  (
x  =  ( card `  y )  <->  v  =  ( card `  y )
) )
43anbi1d 686 . . . . . . . . . 10  |-  ( x  =  v  ->  (
( x  =  (
card `  y )  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y 
z  C_  w )
)  <->  ( v  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) ) )
54exbidv 1633 . . . . . . . . 9  |-  ( x  =  v  ->  ( E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) )  <->  E. y
( v  =  (
card `  y )  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y 
z  C_  w )
) ) )
62, 5elab 3042 . . . . . . . 8  |-  ( v  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  <->  E. y ( v  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) )
7 fveq2 5687 . . . . . . . . . . . 12  |-  ( v  =  ( card `  y
)  ->  ( card `  v )  =  (
card `  ( card `  y ) ) )
8 cardidm 7802 . . . . . . . . . . . 12  |-  ( card `  ( card `  y
) )  =  (
card `  y )
97, 8syl6eq 2452 . . . . . . . . . . 11  |-  ( v  =  ( card `  y
)  ->  ( card `  v )  =  (
card `  y )
)
10 eqeq2 2413 . . . . . . . . . . 11  |-  ( v  =  ( card `  y
)  ->  ( ( card `  v )  =  v  <->  ( card `  v
)  =  ( card `  y ) ) )
119, 10mpbird 224 . . . . . . . . . 10  |-  ( v  =  ( card `  y
)  ->  ( card `  v )  =  v )
1211adantr 452 . . . . . . . . 9  |-  ( ( v  =  ( card `  y )  /\  (
y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) )  -> 
( card `  v )  =  v )
1312exlimiv 1641 . . . . . . . 8  |-  ( E. y ( v  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) )  -> 
( card `  v )  =  v )
146, 13sylbi 188 . . . . . . 7  |-  ( v  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  ->  ( card `  v
)  =  v )
15 cardon 7787 . . . . . . 7  |-  ( card `  v )  e.  On
1614, 15syl6eqelr 2493 . . . . . 6  |-  ( v  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  ->  v  e.  On )
1716ssriv 3312 . . . . 5  |-  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } 
C_  On
18 fvex 5701 . . . . . . 7  |-  ( cf `  A )  e.  _V
191, 18syl6eqelr 2493 . . . . . 6  |-  ( A  e.  On  ->  |^| { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  e.  _V )
20 intex 4316 . . . . . 6  |-  ( { x  |  E. y
( x  =  (
card `  y )  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y 
z  C_  w )
) }  =/=  (/)  <->  |^| { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  e.  _V )
2119, 20sylibr 204 . . . . 5  |-  ( A  e.  On  ->  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  =/=  (/) )
22 onint 4734 . . . . 5  |-  ( ( { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } 
C_  On  /\  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  =/=  (/) )  ->  |^| { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } )
2317, 21, 22sylancr 645 . . . 4  |-  ( A  e.  On  ->  |^| { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } )
241, 23eqeltrd 2478 . . 3  |-  ( A  e.  On  ->  ( cf `  A )  e. 
{ x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) } )
25 fveq2 5687 . . . . 5  |-  ( v  =  ( cf `  A
)  ->  ( card `  v )  =  (
card `  ( cf `  A ) ) )
26 id 20 . . . . 5  |-  ( v  =  ( cf `  A
)  ->  v  =  ( cf `  A ) )
2725, 26eqeq12d 2418 . . . 4  |-  ( v  =  ( cf `  A
)  ->  ( ( card `  v )  =  v  <->  ( card `  ( cf `  A ) )  =  ( cf `  A
) ) )
2827, 14vtoclga 2977 . . 3  |-  ( ( cf `  A )  e.  { x  |  E. y ( x  =  ( card `  y
)  /\  ( y  C_  A  /\  A. z  e.  A  E. w  e.  y  z  C_  w ) ) }  ->  ( card `  ( cf `  A ) )  =  ( cf `  A
) )
2924, 28syl 16 . 2  |-  ( A  e.  On  ->  ( card `  ( cf `  A
) )  =  ( cf `  A ) )
30 cff 8084 . . . . . 6  |-  cf : On
--> On
3130fdmi 5555 . . . . 5  |-  dom  cf  =  On
3231eleq2i 2468 . . . 4  |-  ( A  e.  dom  cf  <->  A  e.  On )
33 ndmfv 5714 . . . 4  |-  ( -.  A  e.  dom  cf  ->  ( cf `  A
)  =  (/) )
3432, 33sylnbir 299 . . 3  |-  ( -.  A  e.  On  ->  ( cf `  A )  =  (/) )
35 card0 7801 . . . 4  |-  ( card `  (/) )  =  (/)
36 fveq2 5687 . . . 4  |-  ( ( cf `  A )  =  (/)  ->  ( card `  ( cf `  A
) )  =  (
card `  (/) ) )
37 id 20 . . . 4  |-  ( ( cf `  A )  =  (/)  ->  ( cf `  A )  =  (/) )
3835, 36, 373eqtr4a 2462 . . 3  |-  ( ( cf `  A )  =  (/)  ->  ( card `  ( cf `  A
) )  =  ( cf `  A ) )
3934, 38syl 16 . 2  |-  ( -.  A  e.  On  ->  (
card `  ( cf `  A ) )  =  ( cf `  A
) )
4029, 39pm2.61i 158 1  |-  ( card `  ( cf `  A
) )  =  ( cf `  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 359   E.wex 1547    = wceq 1649    e. wcel 1721   {cab 2390    =/= wne 2567   A.wral 2666   E.wrex 2667   _Vcvv 2916    C_ wss 3280   (/)c0 3588   |^|cint 4010   Oncon0 4541   dom cdm 4837   ` cfv 5413   cardccrd 7778   cfccf 7780
This theorem is referenced by:  cfon  8091  winacard  8523
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-rab 2675  df-v 2918  df-sbc 3122  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-pss 3296  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-tp 3782  df-op 3783  df-uni 3976  df-int 4011  df-br 4173  df-opab 4227  df-mpt 4228  df-tr 4263  df-eprel 4454  df-id 4458  df-po 4463  df-so 4464  df-fr 4501  df-we 4503  df-ord 4544  df-on 4545  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-er 6864  df-en 7069  df-card 7782  df-cf 7784
  Copyright terms: Public domain W3C validator