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

Theorem fo2ndf 6401
Description: The  2nd (second component of an ordered pair) function restricted to a function  F is a function from  F onto the range of  F. (Contributed by Alexander van der Vekens, 4-Feb-2018.)
Assertion
Ref Expression
fo2ndf  |-  ( F : A --> B  -> 
( 2nd  |`  F ) : F -onto-> ran  F
)

Proof of Theorem fo2ndf
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ffn 5489 . . . 4  |-  ( F : A --> B  ->  F  Fn  A )
2 dffn3 5500 . . . 4  |-  ( F  Fn  A  <->  F : A
--> ran  F )
31, 2sylib 122 . . 3  |-  ( F : A --> B  ->  F : A --> ran  F
)
4 f2ndf 6400 . . 3  |-  ( F : A --> ran  F  ->  ( 2nd  |`  F ) : F --> ran  F
)
53, 4syl 14 . 2  |-  ( F : A --> B  -> 
( 2nd  |`  F ) : F --> ran  F
)
62, 4sylbi 121 . . . . 5  |-  ( F  Fn  A  ->  ( 2nd  |`  F ) : F --> ran  F )
71, 6syl 14 . . . 4  |-  ( F : A --> B  -> 
( 2nd  |`  F ) : F --> ran  F
)
8 frn 5498 . . . 4  |-  ( ( 2nd  |`  F ) : F --> ran  F  ->  ran  ( 2nd  |`  F ) 
C_  ran  F )
97, 8syl 14 . . 3  |-  ( F : A --> B  ->  ran  ( 2nd  |`  F ) 
C_  ran  F )
10 elrn2g 4926 . . . . . 6  |-  ( y  e.  ran  F  -> 
( y  e.  ran  F  <->  E. x <. x ,  y
>.  e.  F ) )
1110ibi 176 . . . . 5  |-  ( y  e.  ran  F  ->  E. x <. x ,  y
>.  e.  F )
12 fvres 5672 . . . . . . . . . 10  |-  ( <.
x ,  y >.  e.  F  ->  ( ( 2nd  |`  F ) `  <. x ,  y
>. )  =  ( 2nd `  <. x ,  y
>. ) )
1312adantl 277 . . . . . . . . 9  |-  ( ( F : A --> B  /\  <.
x ,  y >.  e.  F )  ->  (
( 2nd  |`  F ) `
 <. x ,  y
>. )  =  ( 2nd `  <. x ,  y
>. ) )
14 vex 2806 . . . . . . . . . 10  |-  x  e. 
_V
15 vex 2806 . . . . . . . . . 10  |-  y  e. 
_V
1614, 15op2nd 6319 . . . . . . . . 9  |-  ( 2nd `  <. x ,  y
>. )  =  y
1713, 16eqtr2di 2281 . . . . . . . 8  |-  ( ( F : A --> B  /\  <.
x ,  y >.  e.  F )  ->  y  =  ( ( 2nd  |`  F ) `  <. x ,  y >. )
)
18 f2ndf 6400 . . . . . . . . . 10  |-  ( F : A --> B  -> 
( 2nd  |`  F ) : F --> B )
19 ffn 5489 . . . . . . . . . 10  |-  ( ( 2nd  |`  F ) : F --> B  ->  ( 2nd  |`  F )  Fn  F )
2018, 19syl 14 . . . . . . . . 9  |-  ( F : A --> B  -> 
( 2nd  |`  F )  Fn  F )
21 fnfvelrn 5787 . . . . . . . . 9  |-  ( ( ( 2nd  |`  F )  Fn  F  /\  <. x ,  y >.  e.  F
)  ->  ( ( 2nd  |`  F ) `  <. x ,  y >.
)  e.  ran  ( 2nd  |`  F ) )
2220, 21sylan 283 . . . . . . . 8  |-  ( ( F : A --> B  /\  <.
x ,  y >.  e.  F )  ->  (
( 2nd  |`  F ) `
 <. x ,  y
>. )  e.  ran  ( 2nd  |`  F )
)
2317, 22eqeltrd 2308 . . . . . . 7  |-  ( ( F : A --> B  /\  <.
x ,  y >.  e.  F )  ->  y  e.  ran  ( 2nd  |`  F ) )
2423ex 115 . . . . . 6  |-  ( F : A --> B  -> 
( <. x ,  y
>.  e.  F  ->  y  e.  ran  ( 2nd  |`  F ) ) )
2524exlimdv 1867 . . . . 5  |-  ( F : A --> B  -> 
( E. x <. x ,  y >.  e.  F  ->  y  e.  ran  ( 2nd  |`  F ) ) )
2611, 25syl5 32 . . . 4  |-  ( F : A --> B  -> 
( y  e.  ran  F  ->  y  e.  ran  ( 2nd  |`  F )
) )
2726ssrdv 3234 . . 3  |-  ( F : A --> B  ->  ran  F  C_  ran  ( 2nd  |`  F ) )
289, 27eqssd 3245 . 2  |-  ( F : A --> B  ->  ran  ( 2nd  |`  F )  =  ran  F )
29 dffo2 5572 . 2  |-  ( ( 2nd  |`  F ) : F -onto-> ran  F  <->  ( ( 2nd  |`  F ) : F --> ran  F  /\  ran  ( 2nd  |`  F )  =  ran  F ) )
305, 28, 29sylanbrc 417 1  |-  ( F : A --> B  -> 
( 2nd  |`  F ) : F -onto-> ran  F
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2202    C_ wss 3201   <.cop 3676   ran crn 4732    |` cres 4733    Fn wfn 5328   -->wf 5329   -onto->wfo 5331   ` cfv 5333   2ndc2nd 6311
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fo 5339  df-fv 5341  df-2nd 6313
This theorem is referenced by:  f1o2ndf1  6402
  Copyright terms: Public domain W3C validator