HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem carduni 3664
Description: The union of a set of cardinals is a cardinal. Theorem 18.14 of [Monk1] p. 133.
Assertion
Ref Expression
carduni (AB → (∀xA (card ‘x) = x → (card ‘A) = A))
Distinct variable group(s):   x,A

Proof of Theorem carduni
StepHypRef Expression
1 onunit 2250 . . . . . . 7 (AB → (A ⊆ On → A ∈ On))
2 fveq2 2832 . . . . . . . . . . 11 (x = y → (card ‘x) = (card ‘y))
3 id 9 . . . . . . . . . . 11 (x = yx = y)
42, 3cleq12d 1115 . . . . . . . . . 10 (x = y → ((card ‘x) = x ↔ (card ‘y) = y))
54rcla4v 1402 . . . . . . . . 9 (∀xA (card ‘x) = x → (yA → (card ‘y) = y))
6 cardon 3634 . . . . . . . . . 10 (card ‘y) ∈ On
7 eleq1 1149 . . . . . . . . . 10 ((card ‘y) = y → ((card ‘y) ∈ On ↔ y ∈ On))
86, 7mpbii 168 . . . . . . . . 9 ((card ‘y) = yy ∈ On)
95, 8syl6 23 . . . . . . . 8 (∀xA (card ‘x) = x → (yAy ∈ On))
109ssrdv 1509 . . . . . . 7 (∀xA (card ‘x) = xA ⊆ On)
111, 10syl5 22 . . . . . 6 (AB → (∀xA (card ‘x) = xA ∈ On))
1211imp 277 . . . . 5 ((AB ∧ ∀xA (card ‘x) = x) → A ∈ On)
13 cardonle 3629 . . . . 5 (A ∈ On → (card ‘A) ⊆ A)
1412, 13syl 12 . . . 4 ((AB ∧ ∀xA (card ‘x) = x) → (card ‘A) ⊆ A)
15 cardon 3634 . . . . . 6 (card ‘A) ∈ On
1615oneirr 2345 . . . . 5 ¬ (card ‘A) ∈ (card ‘A)
17 eluni 1922 . . . . . . . 8 ((card ‘A) ∈ A ↔ ∃y((card ‘A) ∈ yyA))
185com12 13 . . . . . . . . . . . 12 (yA → (∀xA (card ‘x) = x → (card ‘y) = y))
19 uniexg 1948 . . . . . . . . . . . . . . . . . 18 (ABAV)
20 visset 1350 . . . . . . . . . . . . . . . . . . . 20 yV
21 carddom 3642 . . . . . . . . . . . . . . . . . . . 20 ((yVAV) → ((card ‘y) ⊆ (card ‘A) ↔ yA))
2220, 21mpan 518 . . . . . . . . . . . . . . . . . . 19 (AV → ((card ‘y) ⊆ (card ‘A) ↔ yA))
2322bicomd 399 . . . . . . . . . . . . . . . . . 18 (AV → (yA ↔ (card ‘y) ⊆ (card ‘A)))
2419, 23syl 12 . . . . . . . . . . . . . . . . 17 (AB → (yA ↔ (card ‘y) ⊆ (card ‘A)))
25 sseq1 1521 . . . . . . . . . . . . . . . . 17 ((card ‘y) = y → ((card ‘y) ⊆ (card ‘A) ↔ y ⊆ (card ‘A)))
2624, 25sylan9bb 418 . . . . . . . . . . . . . . . 16 ((AB ∧ (card ‘y) = y) → (yAy ⊆ (card ‘A)))
27 elssuni 1940 . . . . . . . . . . . . . . . . 17 (yAyA)
28 ssdomg 3311 . . . . . . . . . . . . . . . . . 18 (yV → (yAyA))
2920, 28ax-mp 6 . . . . . . . . . . . . . . . . 17 (yAyA)
3027, 29syl 12 . . . . . . . . . . . . . . . 16 (yAyA)
3126, 30syl5bi 183 . . . . . . . . . . . . . . 15 ((AB ∧ (card ‘y) = y) → (yAy ⊆ (card ‘A)))
32 ssel 1502 . . . . . . . . . . . . . . 15 (y ⊆ (card ‘A) → ((card ‘A) ∈ y → (card ‘A) ∈ (card ‘A)))
3331, 32syl6 23 . . . . . . . . . . . . . 14 ((AB ∧ (card ‘y) = y) → (yA → ((card ‘A) ∈ y → (card ‘A) ∈ (card ‘A))))
3433exp 291 . . . . . . . . . . . . 13 (AB → ((card ‘y) = y → (yA → ((card ‘A) ∈ y → (card ‘A) ∈ (card ‘A)))))
3534com13 33 . . . . . . . . . . . 12 (yA → ((card ‘y) = y → (AB → ((card ‘A) ∈ y → (card ‘A) ∈ (card ‘A)))))
3618, 35syld 27 . . . . . . . . . . 11 (yA → (∀xA (card ‘x) = x → (AB → ((card ‘A) ∈ y → (card ‘A) ∈ (card ‘A)))))
3736com4r 41 . . . . . . . . . 10 ((card ‘A) ∈ y → (yA → (∀xA (card ‘x) = x → (AB → (card ‘A) ∈ (card ‘A)))))
3837imp 277 . . . . . . . . 9 (((card ‘A) ∈ yyA) → (∀xA (card ‘x) = x → (AB → (card ‘A) ∈ (card ‘A))))
393819.23aiv 952 . . . . . . . 8 (∃y((card ‘A) ∈ yyA) → (∀xA (card ‘x) = x → (AB → (card ‘A) ∈ (card ‘A))))
4017, 39sylbi 174 . . . . . . 7 ((card ‘A) ∈ A → (∀xA (card ‘x) = x → (AB → (card ‘A) ∈ (card ‘A))))
4140com13 33 . . . . . 6 (AB → (∀xA (card ‘x) = x → ((card ‘A) ∈ A → (card ‘A) ∈ (card ‘A))))
4241imp 277 . . . . 5 ((AB ∧ ∀xA (card ‘x) = x) → ((card ‘A) ∈ A → (card ‘A) ∈ (card ‘A)))
4316, 42mtoi 94 . . . 4 ((AB ∧ ∀xA (card ‘x) = x) → ¬ (card ‘A) ∈ A)
4414, 43jca 236 . . 3 ((AB ∧ ∀xA (card ‘x) = x) → ((card ‘A) ⊆ A ∧ ¬ (card ‘A) ∈ A))
45 eloni 2209 . . . 4 (A ∈ On → Ord A)
4615onord 2343 . . . . 5 Ord (card ‘A)
47 ordtri4 2235 . . . . 5 ((Ord (card ‘A) ∧ Ord A) → ((card ‘A) = A ↔ ((card ‘A) ⊆ A ∧ ¬ (card ‘A) ∈ A)))
4846, 47mpan 518 . . . 4 (Ord A → ((card ‘A) = A ↔ ((card ‘A) ⊆ A ∧ ¬ (card ‘A) ∈ A)))
4912, 45, 483syl 21 . . 3 ((AB ∧ ∀xA (card ‘x) = x) → ((card ‘A) = A ↔ ((card ‘A) ⊆ A ∧ ¬ (card ‘A) ∈ A)))
5044, 49mpbird 171 . 2 ((AB ∧ ∀xA (card ‘x) = x) → (card ‘A) = A)
5150exp 291 1 (AB → (∀xA (card ‘x) = x → (card ‘A) = A))
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   ∧ wa 196  ∃wex 678   = weq 797   = wceq 1091   ∈ wcel 1092  ∀wral 1201  Vcvv 1348   ⊆ wss 1487  cuni 1919   class class class wbr 2054  Ord word 2198  Oncon0 2199   ‘cfv 2422   ≼ cdom 3272  cardccrd 3620
This theorem is referenced by:  cardiun 3665  carduniima 3695
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-ac 1080
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-suc 2205  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-fv 2438  df-er 3200  df-en 3274  df-dom 3275  df-sdom 3276  df-card 3623
metamath.org