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

Theorem carduni 10099
Description: The union of a set of cardinals is a cardinal. Theorem 18.14 of [Monk1] p. 133. (Contributed by Mario Carneiro, 20-Jan-2013.)
Assertion
Ref Expression
carduni (𝐴 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘∪ 𝐴) = ∪ 𝐴))
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem carduni
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssonuni 7826 . . . . 5 (𝐴 ∈ 𝑉 → (𝐴 ⊆ On → ∪ 𝐴 ∈ On))
2 fveq2 6914 . . . . . . . . 9 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
3 id 23 . . . . . . . . 9 (𝑥 = 𝑦 → 𝑥 = 𝑦)
42, 3eqeq12d 2779 . . . . . . . 8 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
54rspcv 3576 . . . . . . 7 (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘𝑦) = 𝑦))
6 cardon 10060 . . . . . . . 8 (card‘𝑦) ∈ On
7 eleq1 2852 . . . . . . . 8 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ∈ On ↔ 𝑦 ∈ On))
86, 7mpbii 236 . . . . . . 7 ((card‘𝑦) = 𝑦 → 𝑦 ∈ On)
95, 8syl6com 38 . . . . . 6 (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (𝑦 ∈ 𝐴 → 𝑦 ∈ On))
109ssrdv 3919 . . . . 5 (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → 𝐴 ⊆ On)
111, 10impel 515 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ∪ 𝐴 ∈ On)
12 cardonle 10073 . . . 4 (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
1311, 12syl 18 . . 3 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
14 cardon 10060 . . . . 5 (card‘∪ 𝐴) ∈ On
1514onirri 6501 . . . 4 ¬ (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)
16 eluni 4873 . . . . . . . 8 ((card‘∪ 𝐴) ∈ ∪ 𝐴 ↔ ∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴))
17 elssuni 4902 . . . . . . . . . . . . . . . . . 18 (𝑦 ∈ 𝐴 → 𝑦 ⊆ ∪ 𝐴)
18 ssdomg 9063 . . . . . . . . . . . . . . . . . . 19 (∪ 𝐴 ∈ On → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
1918adantl 487 . . . . . . . . . . . . . . . . . 18 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
2017, 19syl5 35 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ≼ ∪ 𝐴))
21 id 23 . . . . . . . . . . . . . . . . . . 19 ((card‘𝑦) = 𝑦 → (card‘𝑦) = 𝑦)
22 onenon 10065 . . . . . . . . . . . . . . . . . . . 20 ((card‘𝑦) ∈ On → (card‘𝑦) ∈ dom card)
236, 22ax-mp 5 . . . . . . . . . . . . . . . . . . 19 (card‘𝑦) ∈ dom card
2421, 23eqeltrrdi 2873 . . . . . . . . . . . . . . . . . 18 ((card‘𝑦) = 𝑦 → 𝑦 ∈ dom card)
25 onenon 10065 . . . . . . . . . . . . . . . . . 18 (∪ 𝐴 ∈ On → ∪ 𝐴 ∈ dom card)
26 carddom2 10093 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ dom card ∧ ∪ 𝐴 ∈ dom card) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
2724, 25, 26syl2an 608 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
2820, 27sylibrd 262 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → (card‘𝑦) ⊆ (card‘∪ 𝐴)))
29 sseq1 3938 . . . . . . . . . . . . . . . . 17 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
3029adantr 486 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
3128, 30sylibd 242 . . . . . . . . . . . . . . 15 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ⊆ (card‘∪ 𝐴)))
32 ssel 3907 . . . . . . . . . . . . . . 15 (𝑦 ⊆ (card‘∪ 𝐴) → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
3331, 32syl6 36 . . . . . . . . . . . . . 14 (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
3433ex 418 . . . . . . . . . . . . 13 ((card‘𝑦) = 𝑦 → (∪ 𝐴 ∈ On → (𝑦 ∈ 𝐴 → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
3534com3r 88 . . . . . . . . . . . 12 (𝑦 ∈ 𝐴 → ((card‘𝑦) = 𝑦 → (∪ 𝐴 ∈ On → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
365, 35syld 48 . . . . . . . . . . 11 (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
3736com4r 95 . . . . . . . . . 10 ((card‘∪ 𝐴) ∈ 𝑦 → (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
3837imp 412 . . . . . . . . 9 (((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
3938exlimiv 1965 . . . . . . . 8 (∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
4016, 39sylbi 220 . . . . . . 7 ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
4140com13 89 . . . . . 6 (∪ 𝐴 ∈ On → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
4241imp 412 . . . . 5 ((∪ 𝐴 ∈ On ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
4311, 42sylancom 600 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
4415, 43mtoi 202 . . 3 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)
4514onordi 6500 . . . 4 Ord (card‘∪ 𝐴)
46 eloni 6396 . . . . 5 (∪ 𝐴 ∈ On → Ord ∪ 𝐴)
4711, 46syl 18 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → Ord ∪ 𝐴)
48 ordtri4 6424 . . . 4 ((Ord (card‘∪ 𝐴) ∧ Ord ∪ 𝐴) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
4945, 47, 48sylancr 599 . . 3 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
5013, 44, 49mpbir2and 726 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) = ∪ 𝐴)
5150ex 418 1 (𝐴 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘∪ 𝐴) = ∪ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ∪ cuni 4870   class class class wbr 5106  dom cdm 5656  Ord word 6385  Oncon0 6386  ‘cfv 6564   ≼ cdom 9007  cardccrd 10051
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ord 6389  df-on 6390  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-er 8753  df-en 9010  df-dom 9011  df-sdom 9012  df-card 10055
This theorem is used by:  cardiun  10100  carduniima  10212
  Copyright terms: Public domain W3C validator