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

Theorem dfac8alem 8413
Description: Lemma for dfac8a 8414. If the power set of a set has a choice function, then the set is numerable. (Contributed by NM, 10-Feb-1997.) (Revised by Mario Carneiro, 5-Jan-2013.)
Hypotheses
Ref Expression
dfac8alem.2  |-  F  = recs ( G )
dfac8alem.3  |-  G  =  ( f  e.  _V  |->  ( g `  ( A  \  ran  f ) ) )
Assertion
Ref Expression
dfac8alem  |-  ( A  e.  C  ->  ( E. g A. y  e. 
~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  A  e.  dom  card ) )
Distinct variable groups:    f, g,
y, A    C, g    f, F, y
Allowed substitution hints:    C( y, f)    F( g)    G( y, f, g)

Proof of Theorem dfac8alem
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elex 3104 . . 3  |-  ( A  e.  C  ->  A  e.  _V )
2 difss 3616 . . . . . . . . . . . 12  |-  ( A 
\  ( F "
x ) )  C_  A
3 elpw2g 4600 . . . . . . . . . . . 12  |-  ( A  e.  _V  ->  (
( A  \  ( F " x ) )  e.  ~P A  <->  ( A  \  ( F " x
) )  C_  A
) )
42, 3mpbiri 233 . . . . . . . . . . 11  |-  ( A  e.  _V  ->  ( A  \  ( F "
x ) )  e. 
~P A )
5 neeq1 2724 . . . . . . . . . . . . 13  |-  ( y  =  ( A  \ 
( F " x
) )  ->  (
y  =/=  (/)  <->  ( A  \  ( F " x
) )  =/=  (/) ) )
6 fveq2 5856 . . . . . . . . . . . . . 14  |-  ( y  =  ( A  \ 
( F " x
) )  ->  (
g `  y )  =  ( g `  ( A  \  ( F " x ) ) ) )
7 id 22 . . . . . . . . . . . . . 14  |-  ( y  =  ( A  \ 
( F " x
) )  ->  y  =  ( A  \ 
( F " x
) ) )
86, 7eleq12d 2525 . . . . . . . . . . . . 13  |-  ( y  =  ( A  \ 
( F " x
) )  ->  (
( g `  y
)  e.  y  <->  ( g `  ( A  \  ( F " x ) ) )  e.  ( A 
\  ( F "
x ) ) ) )
95, 8imbi12d 320 . . . . . . . . . . . 12  |-  ( y  =  ( A  \ 
( F " x
) )  ->  (
( y  =/=  (/)  ->  (
g `  y )  e.  y )  <->  ( ( A  \  ( F "
x ) )  =/=  (/)  ->  ( g `  ( A  \  ( F " x ) ) )  e.  ( A 
\  ( F "
x ) ) ) ) )
109rspcv 3192 . . . . . . . . . . 11  |-  ( ( A  \  ( F
" x ) )  e.  ~P A  -> 
( A. y  e. 
~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  ( ( A  \  ( F "
x ) )  =/=  (/)  ->  ( g `  ( A  \  ( F " x ) ) )  e.  ( A 
\  ( F "
x ) ) ) ) )
114, 10syl 16 . . . . . . . . . 10  |-  ( A  e.  _V  ->  ( A. y  e.  ~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  ( ( A  \  ( F "
x ) )  =/=  (/)  ->  ( g `  ( A  \  ( F " x ) ) )  e.  ( A 
\  ( F "
x ) ) ) ) )
12113imp 1191 . . . . . . . . 9  |-  ( ( A  e.  _V  /\  A. y  e.  ~P  A
( y  =/=  (/)  ->  (
g `  y )  e.  y )  /\  ( A  \  ( F "
x ) )  =/=  (/) )  ->  ( g `
 ( A  \ 
( F " x
) ) )  e.  ( A  \  ( F " x ) ) )
13 dfac8alem.2 . . . . . . . . . . . 12  |-  F  = recs ( G )
1413tfr2 7069 . . . . . . . . . . 11  |-  ( x  e.  On  ->  ( F `  x )  =  ( G `  ( F  |`  x ) ) )
1513tfr1 7068 . . . . . . . . . . . . . 14  |-  F  Fn  On
16 fnfun 5668 . . . . . . . . . . . . . 14  |-  ( F  Fn  On  ->  Fun  F )
1715, 16ax-mp 5 . . . . . . . . . . . . 13  |-  Fun  F
18 vex 3098 . . . . . . . . . . . . 13  |-  x  e. 
_V
19 resfunexg 6122 . . . . . . . . . . . . 13  |-  ( ( Fun  F  /\  x  e.  _V )  ->  ( F  |`  x )  e. 
_V )
2017, 18, 19mp2an 672 . . . . . . . . . . . 12  |-  ( F  |`  x )  e.  _V
21 rneq 5218 . . . . . . . . . . . . . . . 16  |-  ( f  =  ( F  |`  x )  ->  ran  f  =  ran  ( F  |`  x ) )
22 df-ima 5002 . . . . . . . . . . . . . . . 16  |-  ( F
" x )  =  ran  ( F  |`  x )
2321, 22syl6eqr 2502 . . . . . . . . . . . . . . 15  |-  ( f  =  ( F  |`  x )  ->  ran  f  =  ( F " x ) )
2423difeq2d 3607 . . . . . . . . . . . . . 14  |-  ( f  =  ( F  |`  x )  ->  ( A  \  ran  f )  =  ( A  \ 
( F " x
) ) )
2524fveq2d 5860 . . . . . . . . . . . . 13  |-  ( f  =  ( F  |`  x )  ->  (
g `  ( A  \  ran  f ) )  =  ( g `  ( A  \  ( F " x ) ) ) )
26 dfac8alem.3 . . . . . . . . . . . . 13  |-  G  =  ( f  e.  _V  |->  ( g `  ( A  \  ran  f ) ) )
27 fvex 5866 . . . . . . . . . . . . 13  |-  ( g `
 ( A  \ 
( F " x
) ) )  e. 
_V
2825, 26, 27fvmpt 5941 . . . . . . . . . . . 12  |-  ( ( F  |`  x )  e.  _V  ->  ( G `  ( F  |`  x
) )  =  ( g `  ( A 
\  ( F "
x ) ) ) )
2920, 28ax-mp 5 . . . . . . . . . . 11  |-  ( G `
 ( F  |`  x ) )  =  ( g `  ( A  \  ( F "
x ) ) )
3014, 29syl6eq 2500 . . . . . . . . . 10  |-  ( x  e.  On  ->  ( F `  x )  =  ( g `  ( A  \  ( F " x ) ) ) )
3130eleq1d 2512 . . . . . . . . 9  |-  ( x  e.  On  ->  (
( F `  x
)  e.  ( A 
\  ( F "
x ) )  <->  ( g `  ( A  \  ( F " x ) ) )  e.  ( A 
\  ( F "
x ) ) ) )
3212, 31syl5ibrcom 222 . . . . . . . 8  |-  ( ( A  e.  _V  /\  A. y  e.  ~P  A
( y  =/=  (/)  ->  (
g `  y )  e.  y )  /\  ( A  \  ( F "
x ) )  =/=  (/) )  ->  ( x  e.  On  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) ) )
33323expia 1199 . . . . . . 7  |-  ( ( A  e.  _V  /\  A. y  e.  ~P  A
( y  =/=  (/)  ->  (
g `  y )  e.  y ) )  -> 
( ( A  \ 
( F " x
) )  =/=  (/)  ->  (
x  e.  On  ->  ( F `  x )  e.  ( A  \ 
( F " x
) ) ) ) )
3433com23 78 . . . . . 6  |-  ( ( A  e.  _V  /\  A. y  e.  ~P  A
( y  =/=  (/)  ->  (
g `  y )  e.  y ) )  -> 
( x  e.  On  ->  ( ( A  \ 
( F " x
) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) ) ) )
3534ralrimiv 2855 . . . . 5  |-  ( ( A  e.  _V  /\  A. y  e.  ~P  A
( y  =/=  (/)  ->  (
g `  y )  e.  y ) )  ->  A. x  e.  On  ( ( A  \ 
( F " x
) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) ) )
3635ex 434 . . . 4  |-  ( A  e.  _V  ->  ( A. y  e.  ~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  A. x  e.  On  ( ( A 
\  ( F "
x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) ) ) )
3715tz7.49c 7113 . . . . . 6  |-  ( ( A  e.  _V  /\  A. x  e.  On  (
( A  \  ( F " x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) ) )  ->  E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A )
3837ex 434 . . . . 5  |-  ( A  e.  _V  ->  ( A. x  e.  On  ( ( A  \ 
( F " x
) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) )  ->  E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A ) )
3918f1oen 7538 . . . . . . 7  |-  ( ( F  |`  x ) : x -1-1-onto-> A  ->  x  ~~  A )
40 isnumi 8330 . . . . . . 7  |-  ( ( x  e.  On  /\  x  ~~  A )  ->  A  e.  dom  card )
4139, 40sylan2 474 . . . . . 6  |-  ( ( x  e.  On  /\  ( F  |`  x ) : x -1-1-onto-> A )  ->  A  e.  dom  card )
4241rexlimiva 2931 . . . . 5  |-  ( E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A  ->  A  e.  dom  card )
4338, 42syl6 33 . . . 4  |-  ( A  e.  _V  ->  ( A. x  e.  On  ( ( A  \ 
( F " x
) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) )  ->  A  e.  dom  card ) )
4436, 43syld 44 . . 3  |-  ( A  e.  _V  ->  ( A. y  e.  ~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  A  e.  dom  card ) )
451, 44syl 16 . 2  |-  ( A  e.  C  ->  ( A. y  e.  ~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  A  e.  dom  card ) )
4645exlimdv 1711 1  |-  ( A  e.  C  ->  ( E. g A. y  e. 
~P  A ( y  =/=  (/)  ->  ( g `  y )  e.  y )  ->  A  e.  dom  card ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 974    = wceq 1383   E.wex 1599    e. wcel 1804    =/= wne 2638   A.wral 2793   E.wrex 2794   _Vcvv 3095    \ cdif 3458    C_ wss 3461   (/)c0 3770   ~Pcpw 3997   class class class wbr 4437    |-> cmpt 4495   Oncon0 4868   dom cdm 4989   ran crn 4990    |` cres 4991   "cima 4992   Fun wfun 5572    Fn wfn 5573   -1-1-onto->wf1o 5577   ` cfv 5578  recscrecs 7043    ~~ cen 7515   cardccrd 8319
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-8 1806  ax-9 1808  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-rep 4548  ax-sep 4558  ax-nul 4566  ax-pow 4615  ax-pr 4676  ax-un 6577
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 975  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-mo 2273  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-reu 2800  df-rab 2802  df-v 3097  df-sbc 3314  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3771  df-if 3927  df-pw 3999  df-sn 4015  df-pr 4017  df-tp 4019  df-op 4021  df-uni 4235  df-int 4272  df-iun 4317  df-br 4438  df-opab 4496  df-mpt 4497  df-tr 4531  df-eprel 4781  df-id 4785  df-po 4790  df-so 4791  df-fr 4828  df-we 4830  df-ord 4871  df-on 4872  df-suc 4874  df-xp 4995  df-rel 4996  df-cnv 4997  df-co 4998  df-dm 4999  df-rn 5000  df-res 5001  df-ima 5002  df-iota 5541  df-fun 5580  df-fn 5581  df-f 5582  df-f1 5583  df-fo 5584  df-f1o 5585  df-fv 5586  df-recs 7044  df-en 7519  df-card 8323
This theorem is referenced by:  dfac8a  8414
  Copyright terms: Public domain W3C validator