MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  carduniima Structured version   Visualization version   GIF version

Theorem carduniima 10012
Description: The union of the image of a mapping to cardinals is a cardinal. Proposition 11.16 of [TakeutiZaring] p. 104. (Contributed by NM, 4-Nov-2004.)
Assertion
Ref Expression
carduniima (𝐴𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹𝐴) ∈ (ω ∪ ran ℵ)))

Proof of Theorem carduniima
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ffun 6666 . . . . 5 (𝐹:𝐴⟶(ω ∪ ran ℵ) → Fun 𝐹)
2 funimaexg 6580 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
31, 2sylan 581 . . . 4 ((𝐹:𝐴⟶(ω ∪ ran ℵ) ∧ 𝐴𝐵) → (𝐹𝐴) ∈ V)
43expcom 413 . . 3 (𝐴𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹𝐴) ∈ V))
5 fimass 6683 . . . . . . 7 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹𝐴) ⊆ (ω ∪ ran ℵ))
65sseld 3921 . . . . . 6 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝑥 ∈ (𝐹𝐴) → 𝑥 ∈ (ω ∪ ran ℵ)))
7 iscard3 10009 . . . . . 6 ((card‘𝑥) = 𝑥𝑥 ∈ (ω ∪ ran ℵ))
86, 7imbitrrdi 252 . . . . 5 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝑥 ∈ (𝐹𝐴) → (card‘𝑥) = 𝑥))
98ralrimiv 3129 . . . 4 (𝐹:𝐴⟶(ω ∪ ran ℵ) → ∀𝑥 ∈ (𝐹𝐴)(card‘𝑥) = 𝑥)
10 carduni 9899 . . . 4 ((𝐹𝐴) ∈ V → (∀𝑥 ∈ (𝐹𝐴)(card‘𝑥) = 𝑥 → (card‘ (𝐹𝐴)) = (𝐹𝐴)))
119, 10syl5 34 . . 3 ((𝐹𝐴) ∈ V → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (card‘ (𝐹𝐴)) = (𝐹𝐴)))
124, 11syli 39 . 2 (𝐴𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (card‘ (𝐹𝐴)) = (𝐹𝐴)))
13 iscard3 10009 . 2 ((card‘ (𝐹𝐴)) = (𝐹𝐴) ↔ (𝐹𝐴) ∈ (ω ∪ ran ℵ))
1412, 13imbitrdi 251 1 (𝐴𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹𝐴) ∈ (ω ∪ ran ℵ)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  wral 3052  Vcvv 3430  cun 3888   cuni 4851  ran crn 5626  cima 5628  Fun wfun 6487  wf 6489  cfv 6493  ωcom 7811  cardccrd 9853  cale 9854
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-inf2 9556
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7318  df-ov 7364  df-om 7812  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-oi 9419  df-har 9466  df-card 9857  df-aleph 9858
This theorem is referenced by:  cardinfima  10013
  Copyright terms: Public domain W3C validator