HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem cardinfima 3696
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.
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 group(s):   x,F   x,A

Proof of Theorem cardinfima
StepHypRef Expression
1 elisset 1354 . 2 |- (A e. B -> A e. V)
2 isinfcard 3692 . . . . . . . . . . . . . 14 |- ((om (_ (F` x) /\ (card` (F` x)) = (F` x)) <-> (F` x) e. ran aleph)
32bicomi 150 . . . . . . . . . . . . 13 |- ((F` x) e. ran aleph <-> (om (_ (F` x) /\ (card` (F` x)) = (F` x)))
43pm3.26bd 259 . . . . . . . . . . . 12 |- ((F` x) e. ran aleph -> om (_ (F` x))
5 fnfvrn 2889 . . . . . . . . . . . . . . . . 17 |- ((F Fn A /\ x e. A) -> (F` x) e. ran F)
65exp 291 . . . . . . . . . . . . . . . 16 |- (F Fn A -> (x e. A -> (F` x) e. ran F))
7 fnima 2738 . . . . . . . . . . . . . . . . 17 |- (F Fn A -> (F"A) = ran F)
87eleq2d 1156 . . . . . . . . . . . . . . . 16 |- (F Fn A -> ((F` x) e. (F"A) <-> (F` x) e. ran F))
96, 8sylibrd 179 . . . . . . . . . . . . . . 15 |- (F Fn A -> (x e. A -> (F` x) e. (F"A)))
10 elssuni 1940 . . . . . . . . . . . . . . 15 |- ((F` x) e. (F"A) -> (F` x) (_ U.(F"A))
119, 10syl6 23 . . . . . . . . . . . . . 14 |- (F Fn A -> (x e. A -> (F` x) (_ U.(F"A)))
1211imp 277 . . . . . . . . . . . . 13 |- ((F Fn A /\ x e. A) -> (F` x) (_ U.(F"A))
13 ffn 2752 . . . . . . . . . . . . 13 |- (F:A-->(om u. ran aleph) -> F Fn A)
1412, 13sylan 343 . . . . . . . . . . . 12 |- ((F:A-->(om u. ran aleph) /\ x e. A) -> (F` x) (_ U.(F"A))
154, 14sylan9ssr 1515 . . . . . . . . . . 11 |- (((F:A-->(om u. ran aleph) /\ x e. A) /\ (F` x) e. ran aleph) -> om (_ U.(F"A))
1615anasss 337 . . . . . . . . . 10 |- ((F:A-->(om u. ran aleph) /\ (x e. A /\ (F` x) e. ran aleph)) -> om (_ U.(F"A))
1716a1i 7 . . . . . . . . 9 |- (A e. V -> ((F:A-->(om u. ran aleph) /\ (x e. A /\ (F` x) e. ran aleph)) -> om (_ U.(F"A)))
18 carduniima 3695 . . . . . . . . . . 11 |- (A e. V -> (F:A-->(om u. ran aleph) -> U.(F"A) e. (om u. ran aleph)))
19 iscard3 3693 . . . . . . . . . . 11 |- ((card` U.(F"A)) = U.(F"A) <-> U.(F"A) e. (om u. ran aleph))
2018, 19syl6ibr 186 . . . . . . . . . 10 |- (A e. V -> (F:A-->(om u. ran aleph) -> (card`
U.(F"A)) = U.(F"A)))
2120adantrd 308 . . . . . . . . 9 |- (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 455 . . . . . . . 8 |- (A e. V -> ((F:A-->(om u. ran aleph) /\ (x e. A /\ (F` x) e. ran aleph)) -> (om (_ U.(F"A) /\ (card` U.(F"A)) = U.(F"A))))
23 isinfcard 3692 . . . . . . . 8 |- ((om (_ U.(F"A) /\ (card` U.(F"A)) = U.(F"A)) <-> U.(F"A) e. ran aleph)
2422, 23syl6ib 185 . . . . . . 7 |- (A e. V -> ((F:A-->(om u. ran aleph) /\ (x e. A /\ (F` x) e. ran aleph)) -> U.(F"A) e. ran aleph))
2524exp4d 298 . . . . . 6 |- (A e. V -> (F:A-->(om u. ran aleph) -> (x e. A -> ((F` x) e. ran aleph -> U.(F"A) e. ran aleph))))
2625imp 277 . . . . 5 |- ((A e. V /\ F:A-->(om u. ran aleph)) -> (x e. A -> ((F` x) e. ran aleph -> U.(F"A) e. ran aleph)))
2726r19.23adv 1286 . . . 4 |- ((A e. V /\ F:A-->(om u. ran aleph)) -> (E.x e. A (F` x) e. ran aleph -> U.(F"A) e. ran aleph))
2827exp 291 . . 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)))
2928imp3a 279 . 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))
301, 29syl 12 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 2   /\ wa 196   = wceq 1091   e. wcel 1092  E.wrex 1202  Vcvv 1348   u. cun 1485   (_ wss 1487  U.cuni 1919  omcom 2372  ran crn 2411  "cima 2413   Fn wfn 2417  -->wf 2418  ` cfv 2422  cardccrd 3620  alephcale 3621
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-inf 1079  ax-ac 1080
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-fv 2438  df-rdg 2970  df-er 3200  df-en 3274  df-dom 3275  df-sdom 3276  df-card 3623  df-aleph 3624
metamath.org