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

Theorem cardinfima 7971
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 2957 . 2  |-  ( A  e.  B  ->  A  e.  _V )
2 isinfcard 7966 . . . . . . . . . . . . 13  |-  ( ( om  C_  ( F `  x )  /\  ( card `  ( F `  x ) )  =  ( F `  x
) )  <->  ( F `  x )  e.  ran  aleph
)
32bicomi 194 . . . . . . . . . . . 12  |-  ( ( F `  x )  e.  ran  aleph  <->  ( om  C_  ( F `  x
)  /\  ( card `  ( F `  x
) )  =  ( F `  x ) ) )
43simplbi 447 . . . . . . . . . . 11  |-  ( ( F `  x )  e.  ran  aleph  ->  om  C_  ( F `  x )
)
5 ffn 5584 . . . . . . . . . . . 12  |-  ( F : A --> ( om  u.  ran  aleph )  ->  F  Fn  A )
6 fnfvelrn 5860 . . . . . . . . . . . . . . . 16  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  e.  ran  F
)
76ex 424 . . . . . . . . . . . . . . 15  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  e.  ran  F
) )
8 fnima 5556 . . . . . . . . . . . . . . . 16  |-  ( F  Fn  A  ->  ( F " A )  =  ran  F )
98eleq2d 2503 . . . . . . . . . . . . . . 15  |-  ( F  Fn  A  ->  (
( F `  x
)  e.  ( F
" A )  <->  ( F `  x )  e.  ran  F ) )
107, 9sylibrd 226 . . . . . . . . . . . . . 14  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  e.  ( F
" A ) ) )
11 elssuni 4036 . . . . . . . . . . . . . 14  |-  ( ( F `  x )  e.  ( F " A )  ->  ( F `  x )  C_ 
U. ( F " A ) )
1210, 11syl6 31 . . . . . . . . . . . . 13  |-  ( F  Fn  A  ->  (
x  e.  A  -> 
( F `  x
)  C_  U. ( F " A ) ) )
1312imp 419 . . . . . . . . . . . 12  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  C_  U. ( F " A ) )
145, 13sylan 458 . . . . . . . . . . 11  |-  ( ( F : A --> ( om  u.  ran  aleph )  /\  x  e.  A )  ->  ( F `  x
)  C_  U. ( F " A ) )
154, 14sylan9ssr 3355 . . . . . . . . . 10  |-  ( ( ( F : A --> ( om  u.  ran  aleph )  /\  x  e.  A )  /\  ( F `  x
)  e.  ran  aleph )  ->  om  C_  U. ( F
" A ) )
1615anasss 629 . . . . . . . . 9  |-  ( ( F : A --> ( om  u.  ran  aleph )  /\  ( x  e.  A  /\  ( F `  x
)  e.  ran  aleph ) )  ->  om  C_  U. ( F " A ) )
1716a1i 11 . . . . . . . 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 7970 . . . . . . . . . 10  |-  ( A  e.  _V  ->  ( F : A --> ( om  u.  ran  aleph )  ->  U. ( F " A
)  e.  ( om  u.  ran  aleph ) ) )
19 iscard3 7967 . . . . . . . . . 10  |-  ( (
card `  U. ( F
" A ) )  =  U. ( F
" A )  <->  U. ( F " A )  e.  ( om  u.  ran  aleph
) )
2018, 19syl6ibr 219 . . . . . . . . 9  |-  ( A  e.  _V  ->  ( F : A --> ( om  u.  ran  aleph )  -> 
( card `  U. ( F
" A ) )  =  U. ( F
" A ) ) )
2120adantrd 455 . . . . . . . 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 520 . . . . . . 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 7966 . . . . . . 7  |-  ( ( om  C_  U. ( F " A )  /\  ( card `  U. ( F
" A ) )  =  U. ( F
" A ) )  <->  U. ( F " A
)  e.  ran  aleph )
2422, 23syl6ib 218 . . . . . 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 593 . . . . 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 419 . . . 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 2822 . . 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 587 . 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 16 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 359    = wceq 1652    e. wcel 1725   E.wrex 2699   _Vcvv 2949    u. cun 3311    C_ wss 3313   U.cuni 4008   omcom 4838   ran crn 4872   "cima 4874    Fn wfn 5442   -->wf 5443   ` cfv 5447   cardccrd 7815   alephcale 7816
This theorem is referenced by:  alephfplem4  7981
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-rep 4313  ax-sep 4323  ax-nul 4331  ax-pow 4370  ax-pr 4396  ax-un 4694  ax-inf2 7589
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2703  df-rex 2704  df-reu 2705  df-rmo 2706  df-rab 2707  df-v 2951  df-sbc 3155  df-csb 3245  df-dif 3316  df-un 3318  df-in 3320  df-ss 3327  df-pss 3329  df-nul 3622  df-if 3733  df-pw 3794  df-sn 3813  df-pr 3814  df-tp 3815  df-op 3816  df-uni 4009  df-int 4044  df-iun 4088  df-br 4206  df-opab 4260  df-mpt 4261  df-tr 4296  df-eprel 4487  df-id 4491  df-po 4496  df-so 4497  df-fr 4534  df-se 4535  df-we 4536  df-ord 4577  df-on 4578  df-lim 4579  df-suc 4580  df-om 4839  df-xp 4877  df-rel 4878  df-cnv 4879  df-co 4880  df-dm 4881  df-rn 4882  df-res 4883  df-ima 4884  df-iota 5411  df-fun 5449  df-fn 5450  df-f 5451  df-f1 5452  df-fo 5453  df-f1o 5454  df-fv 5455  df-isom 5456  df-riota 6542  df-recs 6626  df-rdg 6661  df-er 6898  df-en 7103  df-dom 7104  df-sdom 7105  df-fin 7106  df-oi 7472  df-har 7519  df-card 7819  df-aleph 7820
  Copyright terms: Public domain W3C validator