Theorem fo2ndresm 6396

Description: Onto mapping of a restriction of the 2nd (second member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.)

Assertion

Ref	Expression
fo2ndresm	|- ( E. x x e. A -> ( 2nd |` ( A X. B ) ) : ( A X. B ) -onto-> B )

Distinct variable group:   x, A

Allowed substitution hint:   B( x)

Proof of Theorem fo2ndresm

Dummy variables v u are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2301	. . 3 |- ( u = x -> ( u e. A <-> x e. A ) )
2	1	cbvexv 1974	. 2 |- ( E. u u e. A <-> E. x x e. A )
3		opelxp 4804	. . . . . . . . . 10 |- ( <. u , v >. e. ( A X. B ) <-> ( u e. A /\ v e. B ) )
4		fvres 5719	. . . . . . . . . . . 12 |- ( <. u , v >. e. ( A X. B ) -> ( ( 2nd |` ( A X. B ) ) ` <. u , v >. ) = ( 2nd ` <. u , v >. ) )
5		vex 2824	. . . . . . . . . . . . 13 |- u e. _V
6		vex 2824	. . . . . . . . . . . . 13 |- v e. _V
7	5, 6	op2nd 6381	. . . . . . . . . . . 12 |- ( 2nd ` <. u , v >. ) = v
8	4, 7	eqtr2di 2288	. . . . . . . . . . 11 |- ( <. u , v >. e. ( A X. B ) -> v = ( ( 2nd |` ( A X. B ) ) ` <. u , v >. ) )
9		f2ndres 6394	. . . . . . . . . . . . 13 |- ( 2nd |` ( A X. B ) ) : ( A X. B ) --> B
10		ffn 5533	. . . . . . . . . . . . 13 |- ( ( 2nd |` ( A X. B ) ) : ( A X. B ) --> B -> ( 2nd |` ( A X. B ) ) Fn ( A X. B ) )
11	9, 10	ax-mp 5	. . . . . . . . . . . 12 |- ( 2nd |` ( A X. B ) ) Fn ( A X. B )
12		fnfvelrn 5840	. . . . . . . . . . . 12 |- ( ( ( 2nd |` ( A X. B ) ) Fn ( A X. B ) /\ <. u , v >. e. ( A X. B ) ) -> ( ( 2nd |` ( A X. B ) ) ` <. u , v >. ) e. ran ( 2nd |` ( A X. B ) ) )
13	11, 12	mpan 428	. . . . . . . . . . 11 |- ( <. u , v >. e. ( A X. B ) -> ( ( 2nd |` ( A X. B ) ) ` <. u , v >. ) e. ran ( 2nd |` ( A X. B ) ) )
14	8, 13	eqeltrd 2315	. . . . . . . . . 10 |- ( <. u , v >. e. ( A X. B ) -> v e. ran ( 2nd |` ( A X. B ) ) )
15	3, 14	sylbir 135	. . . . . . . . 9 |- ( ( u e. A /\ v e. B ) -> v e. ran ( 2nd |` ( A X. B ) ) )
16	15	ex 115	. . . . . . . 8 |- ( u e. A -> ( v e. B -> v e. ran ( 2nd |` ( A X. B ) ) ) )
17	16	exlimiv 1651	. . . . . . 7 |- ( E. u u e. A -> ( v e. B -> v e. ran ( 2nd |` ( A X. B ) ) ) )
18	17	ssrdv 3254	. . . . . 6 |- ( E. u u e. A -> B C_ ran ( 2nd |` ( A X. B ) ) )
19		frn 5542	. . . . . . 7 |- ( ( 2nd |` ( A X. B ) ) : ( A X. B ) --> B -> ran ( 2nd |` ( A X. B ) ) C_ B )
20	9, 19	ax-mp 5	. . . . . 6 |- ran ( 2nd |` ( A X. B ) ) C_ B
21	18, 20	jctil 312	. . . . 5 |- ( E. u u e. A -> ( ran ( 2nd |` ( A X. B ) ) C_ B /\ B C_ ran ( 2nd |` ( A X. B ) ) ) )
22		eqss 3263	. . . . 5 |- ( ran ( 2nd |` ( A X. B ) ) = B <-> ( ran ( 2nd |` ( A X. B ) ) C_ B /\ B C_ ran ( 2nd |` ( A X. B ) ) ) )
23	21, 22	sylibr 134	. . . 4 |- ( E. u u e. A -> ran ( 2nd |` ( A X. B ) ) = B )
24	23, 9	jctil 312	. . 3 |- ( E. u u e. A -> ( ( 2nd |` ( A X. B ) ) : ( A X. B ) --> B /\ ran ( 2nd |` ( A X. B ) ) = B ) )
25		dffo2 5619	. . 3 |- ( ( 2nd |` ( A X. B ) ) : ( A X. B ) -onto-> B <-> ( ( 2nd |` ( A X. B ) ) : ( A X. B ) --> B /\ ran ( 2nd |` ( A X. B ) ) = B ) )
26	24, 25	sylibr 134	. 2 |- ( E. u u e. A -> ( 2nd |` ( A X. B ) ) : ( A X. B ) -onto-> B )
27	2, 26	sylbir 135	1 |- ( E. x x e. A -> ( 2nd |` ( A X. B ) ) : ( A X. B ) -onto-> B )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   E.wex 1545   e. wcel 2209   C_ wss 3220   <.cop 3712   X. cxp 4772   ran crn 4775   |` cres 4776   Fn wfn 5372   -->wf 5373   -onto->wfo 5375   ` cfv 5377   2ndc2nd 6373

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-2nd 6375

This theorem is used by:  2ndconst  6458