Theorem fo2ndf 6132

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.

Step	Hyp	Ref	Expression
1		ffn 5280	. . . 4 |- ( F : A --> B -> F Fn A )
2		dffn3 5291	. . . 4 |- ( F Fn A <-> F : A --> ran F )
3	1, 2	sylib 121	. . 3 |- ( F : A --> B -> F : A --> ran F )
4		f2ndf 6131	. . 3 |- ( F : A --> ran F -> ( 2nd |` F ) : F --> ran F )
5	3, 4	syl 14	. 2 |- ( F : A --> B -> ( 2nd |` F ) : F --> ran F )
6	2, 4	sylbi 120	. . . . 5 |- ( F Fn A -> ( 2nd |` F ) : F --> ran F )
7	1, 6	syl 14	. . . 4 |- ( F : A --> B -> ( 2nd |` F ) : F --> ran F )
8		frn 5289	. . . 4 |- ( ( 2nd |` F ) : F --> ran F -> ran ( 2nd |` F ) C_ ran F )
9	7, 8	syl 14	. . 3 |- ( F : A --> B -> ran ( 2nd |` F ) C_ ran F )
10		elrn2g 4737	. . . . . 6 |- ( y e. ran F -> ( y e. ran F <-> E. x <. x , y >. e. F ) )
11	10	ibi 175	. . . . 5 |- ( y e. ran F -> E. x <. x , y >. e. F )
12		fvres 5453	. . . . . . . . . 10 |- ( <. x , y >. e. F -> ( ( 2nd |` F ) ` <. x , y >. ) = ( 2nd ` <. x , y >. ) )
13	12	adantl 275	. . . . . . . . 9 |- ( ( F : A --> B /\ <. x , y >. e. F ) -> ( ( 2nd |` F ) ` <. x , y >. ) = ( 2nd ` <. x , y >. ) )
14		vex 2692	. . . . . . . . . 10 |- x e. _V
15		vex 2692	. . . . . . . . . 10 |- y e. _V
16	14, 15	op2nd 6053	. . . . . . . . 9 |- ( 2nd ` <. x , y >. ) = y
17	13, 16	eqtr2di 2190	. . . . . . . 8 |- ( ( F : A --> B /\ <. x , y >. e. F ) -> y = ( ( 2nd |` F ) ` <. x , y >. ) )
18		f2ndf 6131	. . . . . . . . . 10 |- ( F : A --> B -> ( 2nd |` F ) : F --> B )
19		ffn 5280	. . . . . . . . . 10 |- ( ( 2nd |` F ) : F --> B -> ( 2nd |` F ) Fn F )
20	18, 19	syl 14	. . . . . . . . 9 |- ( F : A --> B -> ( 2nd |` F ) Fn F )
21		fnfvelrn 5560	. . . . . . . . 9 |- ( ( ( 2nd |` F ) Fn F /\ <. x , y >. e. F ) -> ( ( 2nd |` F ) ` <. x , y >. ) e. ran ( 2nd |` F ) )
22	20, 21	sylan 281	. . . . . . . 8 |- ( ( F : A --> B /\ <. x , y >. e. F ) -> ( ( 2nd |` F ) ` <. x , y >. ) e. ran ( 2nd |` F ) )
23	17, 22	eqeltrd 2217	. . . . . . 7 |- ( ( F : A --> B /\ <. x , y >. e. F ) -> y e. ran ( 2nd |` F ) )
24	23	ex 114	. . . . . 6 |- ( F : A --> B -> ( <. x , y >. e. F -> y e. ran ( 2nd |` F ) ) )
25	24	exlimdv 1792	. . . . 5 |- ( F : A --> B -> ( E. x <. x , y >. e. F -> y e. ran ( 2nd |` F ) ) )
26	11, 25	syl5 32	. . . 4 |- ( F : A --> B -> ( y e. ran F -> y e. ran ( 2nd |` F ) ) )
27	26	ssrdv 3108	. . 3 |- ( F : A --> B -> ran F C_ ran ( 2nd |` F ) )
28	9, 27	eqssd 3119	. 2 |- ( F : A --> B -> ran ( 2nd |` F ) = ran F )
29		dffo2 5357	. 2 |- ( ( 2nd |` F ) : F -onto-> ran F <-> ( ( 2nd |` F ) : F --> ran F /\ ran ( 2nd |` F ) = ran F ) )
30	5, 28, 29	sylanbrc 414	1 |- ( F : A --> B -> ( 2nd |` F ) : F -onto-> ran F )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1332   E.wex 1469   e. wcel 1481   C_ wss 3076   <.cop 3535   ran crn 4548   |` cres 4549   Fn wfn 5126   -->wf 5127   -onto->wfo 5129   ` cfv 5131   2ndc2nd 6045

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fo 5137  df-fv 5139  df-2nd 6047

This theorem is referenced by:  f1o2ndf1  6133