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

Theorem cardid2 9871
Description: Any numerable set is equinumerous to its cardinal number. Proposition 10.5 of [TakeutiZaring] p. 85. (Contributed by Mario Carneiro, 7-Jan-2013.)
Assertion
Ref Expression
cardid2 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)

Proof of Theorem cardid2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cardval3 9870 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
2 ssrab2 4021 . . . 4 {𝑦 ∈ On ∣ 𝑦𝐴} ⊆ On
3 fvex 6848 . . . . . 6 (card‘𝐴) ∈ V
41, 3eqeltrrdi 2846 . . . . 5 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ V)
5 intex 5282 . . . . 5 ({𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅ ↔ {𝑦 ∈ On ∣ 𝑦𝐴} ∈ V)
64, 5sylibr 234 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅)
7 onint 7738 . . . 4 (({𝑦 ∈ On ∣ 𝑦𝐴} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅) → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
82, 6, 7sylancr 588 . . 3 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
91, 8eqeltrd 2837 . 2 (𝐴 ∈ dom card → (card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
10 breq1 5089 . . . 4 (𝑦 = (card‘𝐴) → (𝑦𝐴 ↔ (card‘𝐴) ≈ 𝐴))
1110elrab 3635 . . 3 ((card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ((card‘𝐴) ∈ On ∧ (card‘𝐴) ≈ 𝐴))
1211simprbi 497 . 2 ((card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → (card‘𝐴) ≈ 𝐴)
139, 12syl 17 1 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  wne 2933  {crab 3390  Vcvv 3430  wss 3890  c0 4274   cint 4890   class class class wbr 5086  dom cdm 5625  Oncon0 6318  cfv 6493  cen 8884  cardccrd 9853
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 5232  ax-nul 5242  ax-pr 5371
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 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  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 6321  df-on 6322  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-en 8888  df-card 9857
This theorem is referenced by:  isnum3  9872  oncardid  9874  cardidm  9877  ficardom  9879  ficardid  9880  cardnn  9881  cardnueq0  9882  carden2a  9884  carden2b  9885  carddomi2  9888  sdomsdomcardi  9889  cardsdomelir  9891  cardsdomel  9892  infxpidm2  9933  dfac8b  9947  numdom  9954  alephnbtwn2  9988  alephsucdom  9995  infenaleph  10007  dfac12r  10063  cardadju  10111  pwsdompw  10119  cff1  10174  cfflb  10175  cflim2  10179  cfss  10181  cfslb  10182  domtriomlem  10358  cardid  10463  cardidg  10464  carden  10467  sdomsdomcard  10476  hargch  10590  gch2  10592  hashkf  14288
  Copyright terms: Public domain W3C validator