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

Theorem cardid2 7519
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  |-  ( A  e.  dom  card  ->  (
card `  A )  ~~  A )

Proof of Theorem cardid2
StepHypRef Expression
1 cardval3 7518 . . 3  |-  ( A  e.  dom  card  ->  (
card `  A )  =  |^| { y  e.  On  |  y  ~~  A } )
2 ssrab2 3200 . . . 4  |-  { y  e.  On  |  y 
~~  A }  C_  On
3 fvex 5437 . . . . . 6  |-  ( card `  A )  e.  _V
41, 3syl6eqelr 2345 . . . . 5  |-  ( A  e.  dom  card  ->  |^|
{ y  e.  On  |  y  ~~  A }  e.  _V )
5 intex 4109 . . . . 5  |-  ( { y  e.  On  | 
y  ~~  A }  =/=  (/)  <->  |^| { y  e.  On  |  y  ~~  A }  e.  _V )
64, 5sylibr 205 . . . 4  |-  ( A  e.  dom  card  ->  { y  e.  On  | 
y  ~~  A }  =/=  (/) )
7 onint 4523 . . . 4  |-  ( ( { y  e.  On  |  y  ~~  A }  C_  On  /\  { y  e.  On  |  y 
~~  A }  =/=  (/) )  ->  |^| { y  e.  On  |  y 
~~  A }  e.  { y  e.  On  | 
y  ~~  A }
)
82, 6, 7sylancr 647 . . 3  |-  ( A  e.  dom  card  ->  |^|
{ y  e.  On  |  y  ~~  A }  e.  { y  e.  On  |  y  ~~  A }
)
91, 8eqeltrd 2330 . 2  |-  ( A  e.  dom  card  ->  (
card `  A )  e.  { y  e.  On  |  y  ~~  A }
)
10 breq1 3966 . . . 4  |-  ( y  =  ( card `  A
)  ->  ( y  ~~  A  <->  ( card `  A
)  ~~  A )
)
1110elrab 2874 . . 3  |-  ( (
card `  A )  e.  { y  e.  On  |  y  ~~  A }  <->  ( ( card `  A
)  e.  On  /\  ( card `  A )  ~~  A ) )
1211simprbi 452 . 2  |-  ( (
card `  A )  e.  { y  e.  On  |  y  ~~  A }  ->  ( card `  A
)  ~~  A )
139, 12syl 17 1  |-  ( A  e.  dom  card  ->  (
card `  A )  ~~  A )
Colors of variables: wff set class
Syntax hints:    -> wi 6    e. wcel 1621    =/= wne 2419   {crab 2519   _Vcvv 2740    C_ wss 3094   (/)c0 3397   |^|cint 3803   class class class wbr 3963   Oncon0 4329   dom cdm 4626   ` cfv 4638    ~~ cen 6793   cardccrd 7501
This theorem is referenced by:  isnum3  7520  oncardid  7522  cardidm  7525  ficardom  7527  ficardid  7528  cardnn  7529  cardnueq0  7530  carden2a  7532  carden2b  7533  carddomi2  7536  sdomsdomcardi  7537  cardsdomelir  7539  cardsdomel  7540  infxpidm2  7577  dfac8b  7591  numdom  7598  alephnbtwn2  7632  alephsucdom  7639  infenaleph  7651  dfac12r  7705  cardacda  7757  pwsdompw  7763  cff1  7817  cfflb  7818  cflim2  7822  cfss  7824  cfslb  7825  domtriomlem  8001  cardid  8102  cardidg  8103  carden  8106  sdomsdomcard  8115  hargch  8232  gch2  8234  tskcard  8336  tskuni  8338  hashkf  11270
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237  ax-sep 4081  ax-nul 4089  ax-pr 4152  ax-un 4449
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-ral 2520  df-rex 2521  df-rab 2523  df-v 2742  df-sbc 2936  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-pss 3110  df-nul 3398  df-if 3507  df-sn 3587  df-pr 3588  df-tp 3589  df-op 3590  df-uni 3769  df-int 3804  df-br 3964  df-opab 4018  df-mpt 4019  df-tr 4054  df-eprel 4242  df-id 4246  df-po 4251  df-so 4252  df-fr 4289  df-we 4291  df-ord 4332  df-on 4333  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-fv 4654  df-en 6797  df-card 7505
  Copyright terms: Public domain W3C validator