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

Theorem oncard 9979
Description: A set is a cardinal number iff it equals its own cardinal number. Proposition 10.9 of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 7-Jan-2013.)
Assertion
Ref Expression
oncard (∃𝑥 𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem oncard
StepHypRef Expression
1 id 22 . . . 4 (𝐴 = (card‘𝑥) → 𝐴 = (card‘𝑥))
2 fveq2 6881 . . . . 5 (𝐴 = (card‘𝑥) → (card‘𝐴) = (card‘(card‘𝑥)))
3 cardidm 9978 . . . . 5 (card‘(card‘𝑥)) = (card‘𝑥)
42, 3eqtrdi 2787 . . . 4 (𝐴 = (card‘𝑥) → (card‘𝐴) = (card‘𝑥))
51, 4eqtr4d 2774 . . 3 (𝐴 = (card‘𝑥) → 𝐴 = (card‘𝐴))
65exlimiv 1930 . 2 (∃𝑥 𝐴 = (card‘𝑥) → 𝐴 = (card‘𝐴))
7 fvex 6894 . . . 4 (card‘𝐴) ∈ V
8 eleq1 2823 . . . 4 (𝐴 = (card‘𝐴) → (𝐴 ∈ V ↔ (card‘𝐴) ∈ V))
97, 8mpbiri 258 . . 3 (𝐴 = (card‘𝐴) → 𝐴 ∈ V)
10 fveq2 6881 . . . . 5 (𝑥 = 𝐴 → (card‘𝑥) = (card‘𝐴))
1110eqeq2d 2747 . . . 4 (𝑥 = 𝐴 → (𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴)))
1211spcegv 3581 . . 3 (𝐴 ∈ V → (𝐴 = (card‘𝐴) → ∃𝑥 𝐴 = (card‘𝑥)))
139, 12mpcom 38 . 2 (𝐴 = (card‘𝐴) → ∃𝑥 𝐴 = (card‘𝑥))
146, 13impbii 209 1 (∃𝑥 𝐴 = (card‘𝑥) ↔ 𝐴 = (card‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1540  wex 1779  wcel 2109  Vcvv 3464  cfv 6536  cardccrd 9954
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 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-er 8724  df-en 8965  df-card 9958
This theorem is referenced by:  iscard4  43524
  Copyright terms: Public domain W3C validator