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

Theorem isnumi 7491
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 4117 . . . . 5  |-  ( y  =  A  ->  (
y  ~~  B  <->  A  ~~  B ) )
21rspcev 2923 . . . 4  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  E. y  e.  On  y  ~~  B )
3 intexrabim 4270 . . . 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 6994 . . . . . 6  |-  ( A 
~~  B  ->  ( A  e.  _V  /\  B  e.  _V ) )
65simprd 114 . . . . 5  |-  ( A 
~~  B  ->  B  e.  _V )
7 breq2 4118 . . . . . . . . 9  |-  ( x  =  B  ->  (
y  ~~  x  <->  y  ~~  B ) )
87rabbidv 2804 . . . . . . . 8  |-  ( x  =  B  ->  { y  e.  On  |  y 
~~  x }  =  { y  e.  On  |  y  ~~  B }
)
98inteqd 3959 . . . . . . 7  |-  ( x  =  B  ->  |^| { y  e.  On  |  y 
~~  x }  =  |^| { y  e.  On  |  y  ~~  B }
)
109eleq1d 2303 . . . . . 6  |-  ( x  =  B  ->  ( |^| { y  e.  On  |  y  ~~  x }  e.  _V  <->  |^| { y  e.  On  |  y  ~~  B }  e.  _V ) )
1110elrab3 2977 . . . . 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 7488 . . 3  |-  card  =  ( x  e.  _V  |->  |^|
{ y  e.  On  |  y  ~~  x }
)
1615dmmpt 5263 . 2  |-  dom  card  =  { x  e.  _V  |  |^| { y  e.  On  |  y  ~~  x }  e.  _V }
1714, 16eleqtrrdi 2328 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 1398    e. wcel 2205   E.wrex 2523   {crab 2526   _Vcvv 2815   |^|cint 3954   class class class wbr 4114   Oncon0 4489   dom cdm 4754    ~~ cen 6986   cardccrd 7486
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-xp 4760  df-rel 4761  df-cnv 4762  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-en 6989  df-card 7488
This theorem is referenced by:  finnum  7492  onenon  7493
  Copyright terms: Public domain W3C validator