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

Theorem carduni 9905
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 7735 . . . . 5 (𝐴𝑉 → (𝐴 ⊆ On → 𝐴 ∈ On))
2 fveq2 6842 . . . . . . . . 9 (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
3 id 22 . . . . . . . . 9 (𝑥 = 𝑦𝑥 = 𝑦)
42, 3eqeq12d 2753 . . . . . . . 8 (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
54rspcv 3574 . . . . . . 7 (𝑦𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (card‘𝑦) = 𝑦))
6 cardon 9868 . . . . . . . 8 (card‘𝑦) ∈ On
7 eleq1 2825 . . . . . . . 8 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ∈ On ↔ 𝑦 ∈ On))
86, 7mpbii 233 . . . . . . 7 ((card‘𝑦) = 𝑦𝑦 ∈ On)
95, 8syl6com 37 . . . . . 6 (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (𝑦𝐴𝑦 ∈ On))
109ssrdv 3941 . . . . 5 (∀𝑥𝐴 (card‘𝑥) = 𝑥𝐴 ⊆ On)
111, 10impel 505 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → 𝐴 ∈ On)
12 cardonle 9881 . . . 4 ( 𝐴 ∈ On → (card‘ 𝐴) ⊆ 𝐴)
1311, 12syl 17 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → (card‘ 𝐴) ⊆ 𝐴)
14 cardon 9868 . . . . 5 (card‘ 𝐴) ∈ On
1514onirri 6439 . . . 4 ¬ (card‘ 𝐴) ∈ (card‘ 𝐴)
16 eluni 4868 . . . . . . . 8 ((card‘ 𝐴) ∈ 𝐴 ↔ ∃𝑦((card‘ 𝐴) ∈ 𝑦𝑦𝐴))
17 elssuni 4896 . . . . . . . . . . . . . . . . . 18 (𝑦𝐴𝑦 𝐴)
18 ssdomg 8949 . . . . . . . . . . . . . . . . . . 19 ( 𝐴 ∈ On → (𝑦 𝐴𝑦 𝐴))
1918adantl 481 . . . . . . . . . . . . . . . . . 18 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦 𝐴𝑦 𝐴))
2017, 19syl5 34 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴𝑦 𝐴))
21 id 22 . . . . . . . . . . . . . . . . . . 19 ((card‘𝑦) = 𝑦 → (card‘𝑦) = 𝑦)
22 onenon 9873 . . . . . . . . . . . . . . . . . . . 20 ((card‘𝑦) ∈ On → (card‘𝑦) ∈ dom card)
236, 22ax-mp 5 . . . . . . . . . . . . . . . . . . 19 (card‘𝑦) ∈ dom card
2421, 23eqeltrrdi 2846 . . . . . . . . . . . . . . . . . 18 ((card‘𝑦) = 𝑦𝑦 ∈ dom card)
25 onenon 9873 . . . . . . . . . . . . . . . . . 18 ( 𝐴 ∈ On → 𝐴 ∈ dom card)
26 carddom2 9901 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 𝐴))
2724, 25, 26syl2an 597 . . . . . . . . . . . . . . . . 17 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 𝐴))
2820, 27sylibrd 259 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴 → (card‘𝑦) ⊆ (card‘ 𝐴)))
29 sseq1 3961 . . . . . . . . . . . . . . . . 17 ((card‘𝑦) = 𝑦 → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 ⊆ (card‘ 𝐴)))
3029adantr 480 . . . . . . . . . . . . . . . 16 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘ 𝐴) ↔ 𝑦 ⊆ (card‘ 𝐴)))
3128, 30sylibd 239 . . . . . . . . . . . . . . 15 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴𝑦 ⊆ (card‘ 𝐴)))
32 ssel 3929 . . . . . . . . . . . . . . 15 (𝑦 ⊆ (card‘ 𝐴) → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
3331, 32syl6 35 . . . . . . . . . . . . . 14 (((card‘𝑦) = 𝑦 𝐴 ∈ On) → (𝑦𝐴 → ((card‘ 𝐴) ∈ 𝑦 → (card‘ 𝐴) ∈ (card‘ 𝐴))))
3433ex 412 . . . . . . . . . . . . 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 406 . . . . . . . . 9 (((card‘ 𝐴) ∈ 𝑦𝑦𝐴) → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
3938exlimiv 1932 . . . . . . . 8 (∃𝑦((card‘ 𝐴) ∈ 𝑦𝑦𝐴) → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4016, 39sylbi 217 . . . . . . 7 ((card‘ 𝐴) ∈ 𝐴 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ( 𝐴 ∈ On → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4140com13 88 . . . . . 6 ( 𝐴 ∈ On → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴))))
4241imp 406 . . . . 5 (( 𝐴 ∈ On ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
4311, 42sylancom 589 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) ∈ 𝐴 → (card‘ 𝐴) ∈ (card‘ 𝐴)))
4415, 43mtoi 199 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ¬ (card‘ 𝐴) ∈ 𝐴)
4514onordi 6438 . . . 4 Ord (card‘ 𝐴)
46 eloni 6335 . . . . 5 ( 𝐴 ∈ On → Ord 𝐴)
4711, 46syl 17 . . . 4 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → Ord 𝐴)
48 ordtri4 6362 . . . 4 ((Ord (card‘ 𝐴) ∧ Ord 𝐴) → ((card‘ 𝐴) = 𝐴 ↔ ((card‘ 𝐴) ⊆ 𝐴 ∧ ¬ (card‘ 𝐴) ∈ 𝐴)))
4945, 47, 48sylancr 588 . . 3 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → ((card‘ 𝐴) = 𝐴 ↔ ((card‘ 𝐴) ⊆ 𝐴 ∧ ¬ (card‘ 𝐴) ∈ 𝐴)))
5013, 44, 49mpbir2and 714 . 2 ((𝐴𝑉 ∧ ∀𝑥𝐴 (card‘𝑥) = 𝑥) → (card‘ 𝐴) = 𝐴)
5150ex 412 1 (𝐴𝑉 → (∀𝑥𝐴 (card‘𝑥) = 𝑥 → (card‘ 𝐴) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wex 1781  wcel 2114  wral 3052  wss 3903   cuni 4865   class class class wbr 5100  dom cdm 5632  Ord word 6324  Oncon0 6325  cfv 6500  cdom 8893  cardccrd 9859
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-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-card 9863
This theorem is referenced by:  cardiun  9906  carduniima  10018
  Copyright terms: Public domain W3C validator