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

Theorem card1 9657
Description: A set has cardinality one iff it is a singleton. (Contributed by Mario Carneiro, 10-Jan-2013.)
Assertion
Ref Expression
card1 ((card‘𝐴) = 1o ↔ ∃𝑥 𝐴 = {𝑥})
Distinct variable group:   𝑥,𝐴

Proof of Theorem card1
StepHypRef Expression
1 1onn 8432 . . . . . . . 8 1o ∈ ω
2 cardnn 9652 . . . . . . . 8 (1o ∈ ω → (card‘1o) = 1o)
31, 2ax-mp 5 . . . . . . 7 (card‘1o) = 1o
4 1n0 8286 . . . . . . 7 1o ≠ ∅
53, 4eqnetri 3013 . . . . . 6 (card‘1o) ≠ ∅
6 carden2a 9655 . . . . . 6 (((card‘1o) = (card‘𝐴) ∧ (card‘1o) ≠ ∅) → 1o𝐴)
75, 6mpan2 687 . . . . 5 ((card‘1o) = (card‘𝐴) → 1o𝐴)
87eqcoms 2746 . . . 4 ((card‘𝐴) = (card‘1o) → 1o𝐴)
98ensymd 8746 . . 3 ((card‘𝐴) = (card‘1o) → 𝐴 ≈ 1o)
10 carden2b 9656 . . 3 (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o))
119, 10impbii 208 . 2 ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o)
123eqeq2i 2751 . 2 ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o)
13 en1 8765 . 2 (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})
1411, 12, 133bitr3i 300 1 ((card‘𝐴) = 1o ↔ ∃𝑥 𝐴 = {𝑥})
Colors of variables: wff setvar class
Syntax hints:  wb 205   = wceq 1539  wex 1783  wcel 2108  wne 2942  c0 4253  {csn 4558   class class class wbr 5070  cfv 6418  ωcom 7687  1oc1o 8260  cen 8688  cardccrd 9624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-card 9628
This theorem is referenced by:  cardsn  9658
  Copyright terms: Public domain W3C validator