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

Theorem isnumi 7315
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 4062 . . . . 5  |-  ( y  =  A  ->  (
y  ~~  B  <->  A  ~~  B ) )
21rspcev 2884 . . . 4  |-  ( ( A  e.  On  /\  A  ~~  B )  ->  E. y  e.  On  y  ~~  B )
3 intexrabim 4213 . . . 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 6856 . . . . . 6  |-  ( A 
~~  B  ->  ( A  e.  _V  /\  B  e.  _V ) )
65simprd 114 . . . . 5  |-  ( A 
~~  B  ->  B  e.  _V )
7 breq2 4063 . . . . . . . . 9  |-  ( x  =  B  ->  (
y  ~~  x  <->  y  ~~  B ) )
87rabbidv 2765 . . . . . . . 8  |-  ( x  =  B  ->  { y  e.  On  |  y 
~~  x }  =  { y  e.  On  |  y  ~~  B }
)
98inteqd 3904 . . . . . . 7  |-  ( x  =  B  ->  |^| { y  e.  On  |  y 
~~  x }  =  |^| { y  e.  On  |  y  ~~  B }
)
109eleq1d 2276 . . . . . 6  |-  ( x  =  B  ->  ( |^| { y  e.  On  |  y  ~~  x }  e.  _V  <->  |^| { y  e.  On  |  y  ~~  B }  e.  _V ) )
1110elrab3 2937 . . . . 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 7312 . . 3  |-  card  =  ( x  e.  _V  |->  |^|
{ y  e.  On  |  y  ~~  x }
)
1615dmmpt 5197 . 2  |-  dom  card  =  { x  e.  _V  |  |^| { y  e.  On  |  y  ~~  x }  e.  _V }
1714, 16eleqtrrdi 2301 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 1373    e. wcel 2178   E.wrex 2487   {crab 2490   _Vcvv 2776   |^|cint 3899   class class class wbr 4059   Oncon0 4428   dom cdm 4693    ~~ cen 6848   cardccrd 7310
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-xp 4699  df-rel 4700  df-cnv 4701  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-en 6851  df-card 7312
This theorem is referenced by:  finnum  7316  onenon  7317
  Copyright terms: Public domain W3C validator