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

Theorem carduni 9926
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 7719 . . . . 5 (𝐴𝑉 → (𝐴 ⊆ On → 𝐴 ∈ On))
2 fveq2 6847 . . . . . . . . 9 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
3 id 22 . . . . . . . . 9 (𝑥 = 𝑦𝑥 = 𝑦)
42, 3eqeq12d 2747 . . . . . . . 8 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
54rspcv 3578 . . . . . . 7 (𝑦𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (card‘𝑦) = 𝑦))
6 cardon 9889 . . . . . . . 8 (card‘𝑦) ∈ On
7 eleq1 2820 . . . . . . . 8 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ∈ On ↔ 𝑦 ∈ On))
86, 7mpbii 232 . . . . . . 7 ((card‘𝑦) = 𝑦𝑦 ∈ On)
95, 8syl6com 37 . . . . . 6 (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (𝑦𝐴𝑦 ∈ On))
109ssrdv 3953 . . . . 5 (∀𝑥𝐴 (card‘𝑥) = 𝑥𝐴 ⊆ On)
111, 10impel 506 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → 𝐴 ∈ On)
12 cardonle 9902 . . . 4 ( 𝐴 ∈ On → (card‘ 𝐴) ⊆ 𝐴)
1311, 12syl 17 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → (card‘ 𝐴) ⊆ 𝐴)
14 cardon 9889 . . . . 5 (card‘ 𝐴) ∈ On
1514onirri 6435 . . . 4 ¬ (card‘ 𝐴) ∈ (card‘ 𝐴)
16 eluni 4873 . . . . . . . 8 ((card‘ 𝐴) ∈ 𝐴 ↔ ∃𝑦((card‘ 𝐴) ∈ 𝑦𝑦𝐴))
17 elssuni 4903 . . . . . . . . . . . . . . . . . 18 (𝑦𝐴𝑦 𝐴)
18 ssdomg 8947 . . . . . . . . . . . . . . . . . . 19 ( 𝐴 ∈ On → (𝑦 𝐴𝑦 𝐴))
1918adantl 482 . . . . . . . . . . . . . . . . . 18 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦 𝐴𝑦 𝐴))
2017, 19syl5 34 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴𝑦 𝐴))
21 id 22 . . . . . . . . . . . . . . . . . . 19 ((card‘𝑦) = 𝑦 → (card‘𝑦) = 𝑦)
22 onenon 9894 . . . . . . . . . . . . . . . . . . . 20 ((card‘𝑦) ∈ On → (card‘𝑦) ∈ dom card)
236, 22ax-mp 5 . . . . . . . . . . . . . . . . . . 19 (card‘𝑦) ∈ dom card
2421, 23eqeltrrdi 2841 . . . . . . . . . . . . . . . . . 18 ((card‘𝑦) = 𝑦𝑦 ∈ dom card)
25 onenon 9894 . . . . . . . . . . . . . . . . . 18 ( 𝐴 ∈ On → 𝐴 ∈ dom card)
26 carddom2 9922 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 𝐴))
2724, 25, 26syl2an 596 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 𝐴))
2820, 27sylibrd 258 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴 → (card‘𝑦) ⊆ (card‘ 𝐴)))
29 sseq1 3972 . . . . . . . . . . . . . . . . 17 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 ⊆ (card‘ 𝐴)))
3029adantr 481 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 ⊆ (card‘ 𝐴)))
3128, 30sylibd 238 . . . . . . . . . . . . . . 15 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴𝑦 ⊆ (card‘ 𝐴)))
32 ssel 3940 . . . . . . . . . . . . . . 15 (𝑦 ⊆ (card‘ 𝐴) → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
3331, 32syl6 35 . . . . . . . . . . . . . 14 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴 → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴))))
3433ex 413 . . . . . . . . . . . . 13 ((card‘𝑦) = 𝑦 → ( 𝐴 ∈ On → (𝑦𝐴 → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴)))))
3534com3r 87 . . . . . . . . . . . 12 (𝑦𝐴 → ((card‘𝑦) = 𝑦 → ( 𝐴 ∈ On → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴)))))
365, 35syld 47 . . . . . . . . . . 11 (𝑦𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴)))))
3736com4r 94 . . . . . . . . . 10 ((card‘ 𝐴) ∈ 𝑦 → (𝑦𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴)))))
3837imp 407 . . . . . . . . 9 (((card‘ 𝐴) ∈ 𝑦𝑦𝐴) → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
3938exlimiv 1933 . . . . . . . 8 (∃𝑦((card‘ 𝐴) ∈ 𝑦𝑦𝐴) → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4016, 39sylbi 216 . . . . . . 7 ((card‘ 𝐴) ∈ 𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4140com13 88 . . . . . 6 ( 𝐴 ∈ On → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4241imp 407 . . . . 5 (( 𝐴 ∈ On ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
4311, 42sylancom 588 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
4415, 43mtoi 198 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ¬ (card‘ 𝐴) ∈ 𝐴)
4514onordi 6433 . . . 4 Ord (card‘ 𝐴)
46 eloni 6332 . . . . 5 ( 𝐴 ∈ On → Ord 𝐴)
4711, 46syl 17 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → Ord 𝐴)
48 ordtri4 6359 . . . 4 ((Ord (card‘ 𝐴) ∧ Ord 𝐴) → ((card‘ 𝐴) = 𝐴 ↔ ((card‘ 𝐴) ⊆ 𝐴 ∧ ¬ (card‘ 𝐴) ∈ 𝐴)))
4945, 47, 48sylancr 587 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) = 𝐴 ↔ ((card‘ 𝐴) ⊆ 𝐴 ∧ ¬ (card‘ 𝐴) ∈ 𝐴)))
5013, 44, 49mpbir2and 711 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → (card‘ 𝐴) = 𝐴)
5150ex 413 1 (𝐴𝑉 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (card‘ 𝐴) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  wral 3060  wss 3913   cuni 4870   class class class wbr 5110  dom cdm 5638  Ord word 6321  Oncon0 6322  cfv 6501  cdom 8888  cardccrd 9880
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-int 4913  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6325  df-on 6326  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-er 8655  df-en 8891  df-dom 8892  df-sdom 8893  df-card 9884
This theorem is referenced by:  cardiun  9927  carduniima  10041
  Copyright terms: Public domain W3C validator