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

Theorem carduniima 10182
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 6717 . . . . 5 (𝐹:𝐴⟶(ω ∪ ran ℵ) → Fun 𝐹)
2 funimaexg 6631 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
31, 2sylan 592 . . . 4 ((𝐹:𝐴⟶(ω ∪ ran ℵ) ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
43expcom 419 . . 3 (𝐴 ∈ 𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹 “ 𝐴) ∈ V))
5 fimass 6735 . . . . . . 7 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝐹 “ 𝐴) ⊆ (ω ∪ ran ℵ))
65sseld 3908 . . . . . 6 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝑥 ∈ (𝐹 “ 𝐴) → 𝑥 ∈ (ω ∪ ran ℵ)))
7 iscard3 10179 . . . . . 6 ((card‘𝑥) = 𝑥 ↔ 𝑥 ∈ (ω ∪ ran ℵ))
86, 7imbitrrdi 255 . . . . 5 (𝐹:𝐴⟶(ω ∪ ran ℵ) → (𝑥 ∈ (𝐹 “ 𝐴) → (card‘𝑥) = 𝑥))
98ralrimiv 3153 . . . 4 (𝐹:𝐴⟶(ω ∪ ran ℵ) → ∀𝑥 ∈ (𝐹 “ 𝐴)(card‘𝑥) = 𝑥)
10 carduni 10069 . . . 4 ((𝐹 “ 𝐴) ∈ V → (∀𝑥 ∈ (𝐹 “ 𝐴)(card‘𝑥) = 𝑥 → (card‘∪ (𝐹 “ 𝐴)) = ∪ (𝐹 “ 𝐴)))
119, 10syl5 35 . . 3 ((𝐹 “ 𝐴) ∈ V → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (card‘∪ (𝐹 “ 𝐴)) = ∪ (𝐹 “ 𝐴)))
124, 11syli 40 . 2 (𝐴 ∈ 𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → (card‘∪ (𝐹 “ 𝐴)) = ∪ (𝐹 “ 𝐴)))
13 iscard3 10179 . 2 ((card‘∪ (𝐹 “ 𝐴)) = ∪ (𝐹 “ 𝐴) ↔ ∪ (𝐹 “ 𝐴) ∈ (ω ∪ ran ℵ))
1412, 13imbitrdi 254 1 (𝐴 ∈ 𝐵 → (𝐹:𝐴⟶(ω ∪ ran ℵ) → ∪ (𝐹 “ 𝐴) ∈ (ω ∪ ran ℵ)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ∪ cun 4148  ∪ cuni 4866  ran crn 5652   “ cima 5654  Fun wfun 6537  ⟶wf 6539  ‘cfv 6543  ωcom 7881  cardccrd 10023  ℵcale 10024
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-inf2 9649
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7381  df-ov 7427  df-om 7882  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-1o 8484  df-er 8725  df-en 8982  df-dom 8983  df-sdom 8984  df-fin 8985  df-oi 9511  df-har 9558  df-card 10027  df-aleph 10028
This theorem is used by:  cardinfima  10183
  Copyright terms: Public domain W3C validator