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

Theorem cardinfima 7724
Description: If a mapping to cardinals has an infinite value, then the union of its image is an infinite cardinal. Corollary 11.17 of [TakeutiZaring] p. 104. (Contributed by NM, 4-Nov-2004.)
Assertion
Ref Expression
cardinfima  |-  ( A  e.  B  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  E. x  e.  A  ( F `  x )  e.  ran  aleph )  ->  U. ( F " A
)  e.  ran  aleph ) )
Distinct variable groups:    x, F    x, A
Allowed substitution hint:    B( x)

Proof of Theorem cardinfima
StepHypRef Expression
1 elex 2796 . 2  |-  ( A  e.  B  ->  A  e.  _V )
2 isinfcard 7719 . . . . . . . . . . . . 13  |-  ( ( om  C_  ( F `  x )  /\  ( card `  ( F `  x ) )  =  ( F `  x
) )  <->  ( F `  x )  e.  ran  aleph
)
32bicomi 193 . . . . . . . . . . . 12  |-  ( ( F `  x )  e.  ran  aleph  <->  ( om  C_  ( F `  x
)  /\  ( card `  ( F `  x
) )  =  ( F `  x ) ) )
43simplbi 446 . . . . . . . . . . 11  |-  ( ( F `  x )  e.  ran  aleph  ->  om  C_  ( F `  x )
)
5 ffn 5389 . . . . . . . . . . . 12  |-  ( F : A --> ( om  u.  ran  aleph )  ->  F  Fn  A )
6 fnfvelrn 5662 . . . . . . . . . . . . . . . 16  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  e.  ran  F
)
76ex 423 . . . . . . . . . . . . . . 15  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  e.  ran  F
) )
8 fnima 5362 . . . . . . . . . . . . . . . 16  |-  ( F  Fn  A  ->  ( F " A )  =  ran  F )
98eleq2d 2350 . . . . . . . . . . . . . . 15  |-  ( F  Fn  A  ->  (
( F `  x
)  e.  ( F
" A )  <->  ( F `  x )  e.  ran  F ) )
107, 9sylibrd 225 . . . . . . . . . . . . . 14  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  e.  ( F
" A ) ) )
11 elssuni 3855 . . . . . . . . . . . . . 14  |-  ( ( F `  x )  e.  ( F " A )  ->  ( F `  x )  C_ 
U. ( F " A ) )
1210, 11syl6 29 . . . . . . . . . . . . 13  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  C_  U. ( F " A ) ) )
1312imp 418 . . . . . . . . . . . 12  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  C_  U. ( F " A ) )
145, 13sylan 457 . . . . . . . . . . 11  |-  ( ( F : A --> ( om  u.  ran  aleph )  /\  x  e.  A )  ->  ( F `  x
)  C_  U. ( F " A ) )
154, 14sylan9ssr 3193 . . . . . . . . . 10  |-  ( ( ( F : A --> ( om  u.  ran  aleph )  /\  x  e.  A )  /\  ( F `  x
)  e.  ran  aleph )  ->  om  C_  U. ( F
" A ) )
1615anasss 628 . . . . . . . . 9  |-  ( ( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  om  C_  U. ( F " A ) )
1716a1i 10 . . . . . . . 8  |-  ( A  e.  _V  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  om  C_  U. ( F " A ) ) )
18 carduniima 7723 . . . . . . . . . 10  |-  ( A  e.  _V  ->  ( F : A --> ( om  u.  ran  aleph )  ->  U. ( F " A
)  e.  ( om  u.  ran  aleph ) ) )
19 iscard3 7720 . . . . . . . . . 10  |-  ( (
card `  U. ( F
" A ) )  =  U. ( F
" A )  <->  U. ( F " A )  e.  ( om  u.  ran  aleph
) )
2018, 19syl6ibr 218 . . . . . . . . 9  |-  ( A  e.  _V  ->  ( F : A --> ( om  u.  ran  aleph )  -> 
( card `  U. ( F
" A ) )  =  U. ( F
" A ) ) )
2120adantrd 454 . . . . . . . 8  |-  ( A  e.  _V  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  ( card `  U. ( F " A ) )  =  U. ( F " A ) ) )
2217, 21jcad 519 . . . . . . 7  |-  ( A  e.  _V  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  ( om  C_  U. ( F " A )  /\  ( card `  U. ( F
" A ) )  =  U. ( F
" A ) ) ) )
23 isinfcard 7719 . . . . . . 7  |-  ( ( om  C_  U. ( F " A )  /\  ( card `  U. ( F
" A ) )  =  U. ( F
" A ) )  <->  U. ( F " A
)  e.  ran  aleph )
2422, 23syl6ib 217 . . . . . 6  |-  ( A  e.  _V  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  U. ( F " A )  e.  ran  aleph
) )
2524exp4d 592 . . . . 5  |-  ( A  e.  _V  ->  ( F : A --> ( om  u.  ran  aleph )  -> 
( x  e.  A  ->  ( ( F `  x )  e.  ran  aleph  ->  U. ( F " A )  e.  ran  aleph
) ) ) )
2625imp 418 . . . 4  |-  ( ( A  e.  _V  /\  F : A --> ( om  u.  ran  aleph ) )  ->  ( x  e.  A  ->  ( ( F `  x )  e.  ran  aleph  ->  U. ( F " A )  e. 
ran  aleph ) ) )
2726rexlimdv 2666 . . 3  |-  ( ( A  e.  _V  /\  F : A --> ( om  u.  ran  aleph ) )  ->  ( E. x  e.  A  ( F `  x )  e.  ran  aleph  ->  U. ( F " A )  e.  ran  aleph
) )
2827expimpd 586 . 2  |-  ( A  e.  _V  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  E. x  e.  A  ( F `  x )  e.  ran  aleph )  ->  U. ( F " A
)  e.  ran  aleph ) )
291, 28syl 15 1  |-  ( A  e.  B  ->  (
( F : A --> ( om  u.  ran  aleph )  /\  E. x  e.  A  ( F `  x )  e.  ran  aleph )  ->  U. ( F " A
)  e.  ran  aleph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1623    e. wcel 1684   E.wrex 2544   _Vcvv 2788    u. cun 3150    C_ wss 3152   U.cuni 3827   omcom 4656   ran crn 4690   "cima 4692    Fn wfn 5250   -->wf 5251   ` cfv 5255   cardccrd 7568   alephcale 7569
This theorem is referenced by:  alephfplem4  7734
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-inf2 7342
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 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-int 3863  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-se 4353  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-riota 6304  df-recs 6388  df-rdg 6423  df-er 6660  df-en 6864  df-dom 6865  df-sdom 6866  df-fin 6867  df-oi 7225  df-har 7272  df-card 7572  df-aleph 7573
  Copyright terms: Public domain W3C validator