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

Theorem winacard 10615
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 10609 . 2 (𝐴 ∈ Inaccw ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦))
2 cardcf 10174 . . . 4 (card‘(cf‘𝐴)) = (cf‘𝐴)
3 fveq2 6842 . . . 4 ((cf‘𝐴) = 𝐴 → (card‘(cf‘𝐴)) = (card‘𝐴))
4 id 22 . . . 4 ((cf‘𝐴) = 𝐴 → (cf‘𝐴) = 𝐴)
52, 3, 43eqtr3a 2796 . . 3 ((cf‘𝐴) = 𝐴 → (card‘𝐴) = 𝐴)
653ad2ant2 1135 . 2 ((𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦) → (card‘𝐴) = 𝐴)
71, 6sylbi 217 1 (𝐴 ∈ Inaccw → (card‘𝐴) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  wne 2933  wral 3052  wrex 3062  c0 4287   class class class wbr 5100  cfv 6500  csdm 8894  cardccrd 9859  cfccf 9861  Inaccwcwina 10605
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-er 8645  df-en 8896  df-card 9863  df-cf 9865  df-wina 10607
This theorem is referenced by:  winalim  10618  winalim2  10619  gchina  10622  inar1  10698
  Copyright terms: Public domain W3C validator