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

Theorem card1 9894
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 8580 . . . . . . . 8 1o ∈ ω
2 cardnn 9889 . . . . . . . 8 (1o ∈ ω → (card‘1o) = 1o)
31, 2ax-mp 5 . . . . . . 7 (card‘1o) = 1o
4 1n0 8427 . . . . . . 7 1o ≠ ∅
53, 4eqnetri 3003 . . . . . 6 (card‘1o) ≠ ∅
6 carden2a 9892 . . . . . 6 (((card‘1o) = (card‘𝐴) ∧ (card‘1o) ≠ ∅) → 1o𝐴)
75, 6mpan2 692 . . . . 5 ((card‘1o) = (card‘𝐴) → 1o𝐴)
87eqcoms 2745 . . . 4 ((card‘𝐴) = (card‘1o) → 1o𝐴)
98ensymd 8956 . . 3 ((card‘𝐴) = (card‘1o) → 𝐴 ≈ 1o)
10 carden2b 9893 . . 3 (𝐴 ≈ 1o → (card‘𝐴) = (card‘1o))
119, 10impbii 209 . 2 ((card‘𝐴) = (card‘1o) ↔ 𝐴 ≈ 1o)
123eqeq2i 2750 . 2 ((card‘𝐴) = (card‘1o) ↔ (card‘𝐴) = 1o)
13 en1 8975 . 2 (𝐴 ≈ 1o ↔ ∃𝑥 𝐴 = {𝑥})
1411, 12, 133bitr3i 301 1 ((card‘𝐴) = 1o ↔ ∃𝑥 𝐴 = {𝑥})
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1542  wex 1781  wcel 2114  wne 2933  c0 4287  {csn 4582   class class class wbr 5100  cfv 6502  ωcom 7820  1oc1o 8402  cen 8894  cardccrd 9861
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 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692
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-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  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 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-om 7821  df-1o 8409  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-fin 8901  df-card 9865
This theorem is referenced by:  cardsn  9895
  Copyright terms: Public domain W3C validator