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

Theorem cardid2 10000
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 9999 . . 3 (𝐴 ∈ dom card → (card‘𝐴) = {𝑦 ∈ On ∣ 𝑦𝐴})
2 ssrab2 4093 . . . 4 {𝑦 ∈ On ∣ 𝑦𝐴} ⊆ On
3 fvex 6927 . . . . . 6 (card‘𝐴) ∈ V
41, 3eqeltrrdi 2850 . . . . 5 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ V)
5 intex 5353 . . . . 5 ({𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅ ↔ {𝑦 ∈ On ∣ 𝑦𝐴} ∈ V)
64, 5sylibr 234 . . . 4 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅)
7 onint 7817 . . . 4 (({𝑦 ∈ On ∣ 𝑦𝐴} ⊆ On ∧ {𝑦 ∈ On ∣ 𝑦𝐴} ≠ ∅) → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
82, 6, 7sylancr 587 . . 3 (𝐴 ∈ dom card → {𝑦 ∈ On ∣ 𝑦𝐴} ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
91, 8eqeltrd 2841 . 2 (𝐴 ∈ dom card → (card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴})
10 breq1 5154 . . . 4 (𝑦 = (card‘𝐴) → (𝑦𝐴 ↔ (card‘𝐴) ≈ 𝐴))
1110elrab 3698 . . 3 ((card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴} ↔ ((card‘𝐴) ∈ On ∧ (card‘𝐴) ≈ 𝐴))
1211simprbi 496 . 2 ((card‘𝐴) ∈ {𝑦 ∈ On ∣ 𝑦𝐴} → (card‘𝐴) ≈ 𝐴)
139, 12syl 17 1 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2108  wne 2940  {crab 3436  Vcvv 3481  wss 3966  c0 4342   cint 4954   class class class wbr 5151  dom cdm 5693  Oncon0 6392  cfv 6569  cen 8990  cardccrd 9982
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5305  ax-nul 5315  ax-pr 5441
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3483  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-pss 3986  df-nul 4343  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-int 4955  df-br 5152  df-opab 5214  df-mpt 5235  df-tr 5269  df-id 5587  df-eprel 5593  df-po 5601  df-so 5602  df-fr 5645  df-we 5647  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-ord 6395  df-on 6396  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-fv 6577  df-en 8994  df-card 9986
This theorem is referenced by:  isnum3  10001  oncardid  10003  cardidm  10006  ficardom  10008  ficardid  10009  cardnn  10010  cardnueq0  10011  carden2a  10013  carden2b  10014  carddomi2  10017  sdomsdomcardi  10018  cardsdomelir  10020  cardsdomel  10021  infxpidm2  10064  dfac8b  10078  numdom  10085  alephnbtwn2  10119  alephsucdom  10126  infenaleph  10138  dfac12r  10194  cardadju  10242  pwsdompw  10250  cff1  10305  cfflb  10306  cflim2  10310  cfss  10312  cfslb  10313  domtriomlem  10489  cardid  10594  cardidg  10595  carden  10598  sdomsdomcard  10607  hargch  10720  gch2  10722  hashkf  14377
  Copyright terms: Public domain W3C validator