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

Theorem cardmin 3666
Description: The smallest ordinal that strictly dominates a set is a cardinal.
Assertion
Ref Expression
cardmin (AB → (card ‘{x ∈ On∣Ax}) = {x ∈ On∣Ax})
Distinct variable group(s):   x,A

Proof of Theorem cardmin
StepHypRef Expression
1 numthcor 3601 . . . 4 (AB → ∃x ∈ On Ax)
2 onintrab2 2269 . . . 4 (∃x ∈ On Ax{x ∈ On∣Ax} ∈ On)
31, 2sylib 173 . . 3 (AB{x ∈ On∣Ax} ∈ On)
4 onelon 2223 . . . . . . . . . 10 (({x ∈ On∣Ax} ∈ On ∧ y{x ∈ On∣Ax}) → y ∈ On)
54exp 291 . . . . . . . . 9 ({x ∈ On∣Ax} ∈ On → (y{x ∈ On∣Ax} → y ∈ On))
63, 5syl 12 . . . . . . . 8 (AB → (y{x ∈ On∣Ax} → y ∈ On))
7 breq2 2066 . . . . . . . . . . . 12 (x = y → (AxAy))
87elrab 1422 . . . . . . . . . . 11 (y ∈ {x ∈ On∣Ax} ↔ (y ∈ On ∧ Ay))
9 ssrab 1556 . . . . . . . . . . . 12 {x ∈ On∣Ax} ⊆ On
10 onnmin 2270 . . . . . . . . . . . 12 (({x ∈ On∣Ax} ⊆ On ∧ y ∈ {x ∈ On∣Ax}) → ¬ y{x ∈ On∣Ax})
119, 10mpan 518 . . . . . . . . . . 11 (y ∈ {x ∈ On∣Ax} → ¬ y{x ∈ On∣Ax})
128, 11sylbir 176 . . . . . . . . . 10 ((y ∈ On ∧ Ay) → ¬ y{x ∈ On∣Ax})
1312exp 291 . . . . . . . . 9 (y ∈ On → (Ay → ¬ y{x ∈ On∣Ax}))
1413con2d 83 . . . . . . . 8 (y ∈ On → (y{x ∈ On∣Ax} → ¬ Ay))
156, 14syli 52 . . . . . . 7 (AB → (y{x ∈ On∣Ax} → ¬ Ay))
16 visset 1350 . . . . . . . 8 yV
17 domtri 3644 . . . . . . . 8 ((yVAB) → (yA ↔ ¬ Ay))
1816, 17mpan 518 . . . . . . 7 (AB → (yA ↔ ¬ Ay))
1915, 18sylibrd 179 . . . . . 6 (AB → (y{x ∈ On∣Ax} → yA))
20 ax-17 925 . . . . . . . . . 10 (yA → ∀x yA)
21 ax-17 925 . . . . . . . . . 10 (y ∈ ≺ → ∀x y ∈ ≺ )
22 hbrab1 1310 . . . . . . . . . . 11 (y ∈ {x ∈ On∣Ax} → ∀x y ∈ {x ∈ On∣Ax})
2322hbint 1975 . . . . . . . . . 10 (y{x ∈ On∣Ax} → ∀x y{x ∈ On∣Ax})
2420, 21, 23hbbr 2095 . . . . . . . . 9 (A{x ∈ On∣Ax} → ∀x A{x ∈ On∣Ax})
25 breq2 2066 . . . . . . . . 9 (x = {x ∈ On∣Ax} → (AxA{x ∈ On∣Ax}))
2624, 25onminsb 2264 . . . . . . . 8 (∃x ∈ On AxA{x ∈ On∣Ax})
271, 26syl 12 . . . . . . 7 (ABA{x ∈ On∣Ax})
2827a1d 14 . . . . . 6 (AB → (y{x ∈ On∣Ax} → A{x ∈ On∣Ax}))
2919, 28jcad 455 . . . . 5 (AB → (y{x ∈ On∣Ax} → (yAA{x ∈ On∣Ax})))
30 domsdomtr 3374 . . . . 5 ((yAA{x ∈ On∣Ax}) → y{x ∈ On∣Ax})
3129, 30syl6 23 . . . 4 (AB → (y{x ∈ On∣Ax} → y{x ∈ On∣Ax}))
3231r19.21aiv 1259 . . 3 (AB → ∀y {x ∈ On∣Ax}y{x ∈ On∣Ax})
333, 32jca 236 . 2 (AB → ({x ∈ On∣Ax} ∈ On ∧ ∀y {x ∈ On∣Ax}y{x ∈ On∣Ax}))
34 iscard 3659 . 2 ((card ‘{x ∈ On∣Ax}) = {x ∈ On∣Ax} ↔ ({x ∈ On∣Ax} ∈ On ∧ ∀y {x ∈ On∣Ax}y{x ∈ On∣Ax}))
3533, 34sylibr 175 1 (AB → (card ‘{x ∈ On∣Ax}) = {x ∈ On∣Ax})
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   ∧ wa 196   = wceq 1091   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202  {crab 1204  Vcvv 1348   ⊆ wss 1487  cint 1965   class class class wbr 2054  Oncon0 2199   ‘cfv 2422   ≼ cdom 3272   ≺ csdm 3273  cardccrd 3620
This theorem is referenced by:  alephcard 3673
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