ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isnumi Unicode version

Theorem isnumi 7517
Description: A set equinumerous to an ordinal is numerable. (Contributed by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
isnumi  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  B  e.  dom  card )

Proof of Theorem isnumi
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 4128 . . . . 5  |-  ( y  =  A  ->  (
y  ~~  B  <->  A  ~~  B ) )
21rspcev 2929 . . . 4  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  E. y  e.  On  y  ~~  B )
3 intexrabim 4284 . . . 4  |-  ( E. y  e.  On  y  ~~  B  ->  |^| { y  e.  On  |  y 
~~  B }  e.  _V )
42, 3syl 14 . . 3  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  |^| { y  e.  On  |  y  ~~  B }  e.  _V )
5 encv 7018 . . . . . 6  |-  ( A 
~~  B  ->  ( A  e.  _V  /\  B  e.  _V ) )
65simprd 114 . . . . 5  |-  ( A 
~~  B  ->  B  e.  _V )
7 breq2 4129 . . . . . . . . 9  |-  ( x  =  B  ->  (
y  ~~  x  <->  y  ~~  B ) )
87rabbidv 2810 . . . . . . . 8  |-  ( x  =  B  ->  { y  e.  On  |  y 
~~  x }  =  { y  e.  On  |  y  ~~  B }
)
98inteqd 3970 . . . . . . 7  |-  ( x  =  B  ->  |^| { y  e.  On  |  y 
~~  x }  =  |^| { y  e.  On  |  y  ~~  B }
)
109eleq1d 2307 . . . . . 6  |-  ( x  =  B  ->  ( |^| { y  e.  On  |  y  ~~  x }  e.  _V  <->  |^| { y  e.  On  |  y  ~~  B }  e.  _V ) )
1110elrab3 2983 . . . . 5  |-  ( B  e.  _V  ->  ( B  e.  { x  e.  _V  |  |^| { y  e.  On  |  y 
~~  x }  e.  _V }  <->  |^| { y  e.  On  |  y  ~~  B }  e.  _V ) )
126, 11syl 14 . . . 4  |-  ( A 
~~  B  ->  ( B  e.  { x  e.  _V  |  |^| { y  e.  On  |  y 
~~  x }  e.  _V }  <->  |^| { y  e.  On  |  y  ~~  B }  e.  _V ) )
1312adantl 277 . . 3  |-  ( ( A  e.  On  /\  A  ~~  B )  -> 
( B  e.  {
x  e.  _V  |  |^| { y  e.  On  |  y  ~~  x }  e.  _V }  <->  |^| { y  e.  On  |  y 
~~  B }  e.  _V ) )
144, 13mpbird 167 . 2  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  B  e.  { x  e.  _V  |  |^| { y  e.  On  |  y 
~~  x }  e.  _V } )
15 df-card 7514 . . 3  |-  card  =  ( x  e.  _V  |->  |^|
{ y  e.  On  |  y  ~~  x }
)
1615dmmpt 5278 . 2  |-  dom  card  =  { x  e.  _V  |  |^| { y  e.  On  |  y  ~~  x }  e.  _V }
1714, 16eleqtrrdi 2332 1  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  B  e.  dom  card )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E.wrex 2529   {crab 2532   _Vcvv 2821   |^|cint 3965   class class class wbr 4125   Oncon0 4503   dom cdm 4769    ~~ cen 7010   cardccrd 7512
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-xp 4775  df-rel 4776  df-cnv 4777  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-en 7013  df-card 7514
This theorem is referenced by:  finnum  7518  onenon  7519
  Copyright terms: Public domain W3C validator