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

Theorem winacard 10605
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 10599 . 2 (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦))
2 cardcf 10165 . . . 4 (card‘(cf‘𝐴)) = (cf‘𝐴)
3 fveq2 6826 . . . 4 ((cf‘𝐴) = 𝐴 → (card‘(cf‘𝐴)) = (card‘𝐴))
4 id 22 . . . 4 ((cf‘𝐴) = 𝐴 → (cf‘𝐴) = 𝐴)
52, 3, 43eqtr3a 2788 . . 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 1540  wcel 2109  wne 2925  wral 3044  wrex 3053  c0 4286   class class class wbr 5095  cfv 6486  csdm 8878  cardccrd 9850  cfccf 9852  Inaccwcwina 10595
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-ord 6314  df-on 6315  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-er 8632  df-en 8880  df-card 9854  df-cf 9856  df-wina 10597
This theorem is referenced by:  winalim  10608  winalim2  10609  gchina  10612  inar1  10688
  Copyright terms: Public domain W3C validator