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

Theorem winacard 10603
Description: A weakly inaccessible cardinal is a cardinal. (Contributed by Mario Carneiro, 29-May-2014.)
Assertion
Ref Expression
winacard (𝐴 ∈ Inaccw → (card‘𝐴) = 𝐴)

Proof of Theorem winacard
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elwina 10597 . 2 (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦))
2 cardcf 10162 . . . 4 (card‘(cf‘𝐴)) = (cf‘𝐴)
3 fveq2 6834 . . . 4 ((cf‘𝐴) = 𝐴 → (card‘(cf‘𝐴)) = (card‘𝐴))
4 id 22 . . . 4 ((cf‘𝐴) = 𝐴 → (cf‘𝐴) = 𝐴)
52, 3, 43eqtr3a 2795 . . 3 ((cf‘𝐴) = 𝐴 → (card‘𝐴) = 𝐴)
653ad2ant2 1134 . 2 ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦) → (card‘𝐴) = 𝐴)
71, 6sylbi 217 1 (𝐴 ∈ Inaccw → (card‘𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wcel 2113  wne 2932  wral 3051  wrex 3060  c0 4285   class class class wbr 5098  cfv 6492  csdm 8882  cardccrd 9847  cfccf 9849  Inaccwcwina 10593
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-er 8635  df-en 8884  df-card 9851  df-cf 9853  df-wina 10595
This theorem is referenced by:  winalim  10606  winalim2  10607  gchina  10610  inar1  10686
  Copyright terms: Public domain W3C validator