MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.49c Structured version   Visualization version   Unicode version

Theorem tz7.49c 7541
Description: Corollary of Proposition 7.49 of [TakeutiZaring] p. 51. (Contributed by NM, 10-Feb-1997.) (Revised by Mario Carneiro, 19-Jan-2013.)
Hypothesis
Ref Expression
tz7.49c.1  |-  F  Fn  On
Assertion
Ref Expression
tz7.49c  |-  ( ( A  e.  B  /\  A. x  e.  On  (
( A  \  ( F " x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) ) )  ->  E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A )
Distinct variable groups:    x, A    x, F
Allowed substitution hint:    B( x)

Proof of Theorem tz7.49c
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 tz7.49c.1 . . 3  |-  F  Fn  On
2 biid 251 . . 3  |-  ( A. x  e.  On  (
( A  \  ( F " x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) )  <->  A. x  e.  On  ( ( A  \ 
( F " x
) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F " x ) ) ) )
31, 2tz7.49 7540 . 2  |-  ( ( A  e.  B  /\  A. x  e.  On  (
( A  \  ( F " x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) ) )  ->  E. x  e.  On  ( A. y  e.  x  ( A  \  ( F " y
) )  =/=  (/)  /\  ( F " x )  =  A  /\  Fun  `' ( F  |`  x ) ) )
4 3simpc 1060 . . . 4  |-  ( ( A. y  e.  x  ( A  \  ( F " y ) )  =/=  (/)  /\  ( F
" x )  =  A  /\  Fun  `' ( F  |`  x ) )  ->  ( ( F " x )  =  A  /\  Fun  `' ( F  |`  x ) ) )
5 onss 6990 . . . . . . . . 9  |-  ( x  e.  On  ->  x  C_  On )
6 fnssres 6004 . . . . . . . . 9  |-  ( ( F  Fn  On  /\  x  C_  On )  -> 
( F  |`  x
)  Fn  x )
71, 5, 6sylancr 695 . . . . . . . 8  |-  ( x  e.  On  ->  ( F  |`  x )  Fn  x )
8 df-ima 5127 . . . . . . . . . 10  |-  ( F
" x )  =  ran  ( F  |`  x )
98eqeq1i 2627 . . . . . . . . 9  |-  ( ( F " x )  =  A  <->  ran  ( F  |`  x )  =  A )
109biimpi 206 . . . . . . . 8  |-  ( ( F " x )  =  A  ->  ran  ( F  |`  x )  =  A )
117, 10anim12i 590 . . . . . . 7  |-  ( ( x  e.  On  /\  ( F " x )  =  A )  -> 
( ( F  |`  x )  Fn  x  /\  ran  ( F  |`  x )  =  A ) )
1211anim1i 592 . . . . . 6  |-  ( ( ( x  e.  On  /\  ( F " x
)  =  A )  /\  Fun  `' ( F  |`  x )
)  ->  ( (
( F  |`  x
)  Fn  x  /\  ran  ( F  |`  x
)  =  A )  /\  Fun  `' ( F  |`  x )
) )
13 dff1o2 6142 . . . . . . 7  |-  ( ( F  |`  x ) : x -1-1-onto-> A  <->  ( ( F  |`  x )  Fn  x  /\  Fun  `' ( F  |`  x )  /\  ran  ( F  |`  x )  =  A ) )
14 3anan32 1050 . . . . . . 7  |-  ( ( ( F  |`  x
)  Fn  x  /\  Fun  `' ( F  |`  x )  /\  ran  ( F  |`  x )  =  A )  <->  ( (
( F  |`  x
)  Fn  x  /\  ran  ( F  |`  x
)  =  A )  /\  Fun  `' ( F  |`  x )
) )
1513, 14bitri 264 . . . . . 6  |-  ( ( F  |`  x ) : x -1-1-onto-> A  <->  ( ( ( F  |`  x )  Fn  x  /\  ran  ( F  |`  x )  =  A )  /\  Fun  `' ( F  |`  x
) ) )
1612, 15sylibr 224 . . . . 5  |-  ( ( ( x  e.  On  /\  ( F " x
)  =  A )  /\  Fun  `' ( F  |`  x )
)  ->  ( F  |`  x ) : x -1-1-onto-> A )
1716expl 648 . . . 4  |-  ( x  e.  On  ->  (
( ( F "
x )  =  A  /\  Fun  `' ( F  |`  x )
)  ->  ( F  |`  x ) : x -1-1-onto-> A ) )
184, 17syl5 34 . . 3  |-  ( x  e.  On  ->  (
( A. y  e.  x  ( A  \ 
( F " y
) )  =/=  (/)  /\  ( F " x )  =  A  /\  Fun  `' ( F  |`  x ) )  ->  ( F  |`  x ) : x -1-1-onto-> A ) )
1918reximia 3009 . 2  |-  ( E. x  e.  On  ( A. y  e.  x  ( A  \  ( F " y ) )  =/=  (/)  /\  ( F
" x )  =  A  /\  Fun  `' ( F  |`  x ) )  ->  E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A )
203, 19syl 17 1  |-  ( ( A  e.  B  /\  A. x  e.  On  (
( A  \  ( F " x ) )  =/=  (/)  ->  ( F `  x )  e.  ( A  \  ( F
" x ) ) ) )  ->  E. x  e.  On  ( F  |`  x ) : x -1-1-onto-> A )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990    =/= wne 2794   A.wral 2912   E.wrex 2913    \ cdif 3571    C_ wss 3574   (/)c0 3915   `'ccnv 5113   ran crn 5115    |` cres 5116   "cima 5117   Oncon0 5723   Fun wfun 5882    Fn wfn 5883   -1-1-onto->wf1o 5887   ` cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896
This theorem is referenced by:  dfac8alem  8852  dnnumch1  37614
  Copyright terms: Public domain W3C validator