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

Theorem winacard 10613
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 10607 . 2 (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦))
2 cardcf 10172 . . . 4 (card‘(cf‘𝐴)) = (cf‘𝐴)
3 fveq2 6834 . . . 4 ((cf‘𝐴) = 𝐴 → (card‘(cf‘𝐴)) = (card‘𝐴))
4 id 22 . . . 4 ((cf‘𝐴) = 𝐴 → (cf‘𝐴) = 𝐴)
52, 3, 43eqtr3a 2799 . . 3 ((cf‘𝐴) = 𝐴 → (card‘𝐴) = 𝐴)
653ad2ant2 1140 . 2 ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦) → (card‘𝐴) = 𝐴)
71, 6sylbi 218 1 (𝐴 ∈ Inaccw → (card‘𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1092   = wceq 1547  wcel 2119  wne 2935  wral 3054  wrex 3064  c0 4268   class class class wbr 5079  cfv 6492  csdm 8889  cardccrd 9857  cfccf 9859  Inaccwcwina 10603
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 8640  df-en 8891  df-card 9861  df-cf 9863  df-wina 10605
This theorem is referenced by:  winalim  10616  winalim2  10617  gchina  10620  inar1  10696
  Copyright terms: Public domain W3C validator