Theorem curry1 6210

Description: Composition with `' ( 2nd |` ( { C } X. _V ) ) turns any binary operation F with a constant first operand into a function G of the second operand only. This transformation is called "currying." (Contributed by NM, 28-Mar-2008.) (Revised by Mario Carneiro, 26-Dec-2014.)

Hypothesis

Ref	Expression
curry1.1	|- G = ( F o. `' ( 2nd |` ( { C } X. _V ) ) )

Assertion

Ref	Expression
curry1	|- ( ( F Fn ( A X. B ) /\ C e. A ) -> G = ( x e. B |-> ( C F x ) ) )

Distinct variable groups:   x, A   x, B   x, C   x, F   x, G

Proof of Theorem curry1

Step	Hyp	Ref	Expression
1		fnfun 5341	. . . . 5 |- ( F Fn ( A X. B ) -> Fun F )
2		2ndconst 6208	. . . . . 6 |- ( C e. A -> ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V )
3		dff1o3 5478	. . . . . . 7 |- ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V <-> ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -onto-> _V /\ Fun `' ( 2nd |` ( { C } X. _V ) ) ) )
4	3	simprbi 450	. . . . . 6 |- ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V -> Fun `' ( 2nd |` ( { C } X. _V ) ) )
5	2, 4	syl 15	. . . . 5 |- ( C e. A -> Fun `' ( 2nd |` ( { C } X. _V ) ) )
6		funco 5292	. . . . 5 |- ( ( Fun F /\ Fun `' ( 2nd |` ( { C } X. _V ) ) ) -> Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) )
7	1, 5, 6	syl2an 463	. . . 4 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) )
8		dmco 5181	. . . . 5 |- dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F )
9		fndm 5343	. . . . . . . 8 |- ( F Fn ( A X. B ) -> dom F = ( A X. B ) )
10	9	adantr 451	. . . . . . 7 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> dom F = ( A X. B ) )
11	10	imaeq2d 5012	. . . . . 6 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F ) = ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) )
12		imacnvcnv 5137	. . . . . . . . 9 |- ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ( ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) )
13		df-ima 4702	. . . . . . . . 9 |- ( ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ran ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) )
14		resres 4968	. . . . . . . . . 10 |- ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) ) = ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
15	14	rneqi 4905	. . . . . . . . 9 |- ran ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) ) = ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
16	12, 13, 15	3eqtri 2307	. . . . . . . 8 |- ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
17		inxp 4818	. . . . . . . . . . . . 13 |- ( ( { C } X. _V ) i^i ( A X. B ) ) = ( ( { C } i^i A ) X. ( _V i^i B ) )
18		incom 3361	. . . . . . . . . . . . . . 15 |- ( _V i^i B ) = ( B i^i _V )
19		inv1 3481	. . . . . . . . . . . . . . 15 |- ( B i^i _V ) = B
20	18, 19	eqtri 2303	. . . . . . . . . . . . . 14 |- ( _V i^i B ) = B
21	20	xpeq2i 4710	. . . . . . . . . . . . 13 |- ( ( { C } i^i A ) X. ( _V i^i B ) ) = ( ( { C } i^i A ) X. B )
22	17, 21	eqtri 2303	. . . . . . . . . . . 12 |- ( ( { C } X. _V ) i^i ( A X. B ) ) = ( ( { C } i^i A ) X. B )
23		snssi 3759	. . . . . . . . . . . . . 14 |- ( C e. A -> { C } C_ A )
24		df-ss 3166	. . . . . . . . . . . . . 14 |- ( { C } C_ A <-> ( { C } i^i A ) = { C } )
25	23, 24	sylib 188	. . . . . . . . . . . . 13 |- ( C e. A -> ( { C } i^i A ) = { C } )
26	25	xpeq1d 4712	. . . . . . . . . . . 12 |- ( C e. A -> ( ( { C } i^i A ) X. B ) = ( { C } X. B ) )
27	22, 26	syl5eq 2327	. . . . . . . . . . 11 |- ( C e. A -> ( ( { C } X. _V ) i^i ( A X. B ) ) = ( { C } X. B ) )
28	27	reseq2d 4955	. . . . . . . . . 10 |- ( C e. A -> ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = ( 2nd |` ( { C } X. B ) ) )
29	28	rneqd 4906	. . . . . . . . 9 |- ( C e. A -> ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = ran ( 2nd |` ( { C } X. B ) ) )
30		2ndconst 6208	. . . . . . . . . 10 |- ( C e. A -> ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -1-1-onto-> B )
31		f1ofo 5479	. . . . . . . . . 10 |- ( ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -1-1-onto-> B -> ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -onto-> B )
32		forn 5454	. . . . . . . . . 10 |- ( ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -onto-> B -> ran ( 2nd |` ( { C } X. B ) ) = B )
33	30, 31, 32	3syl 18	. . . . . . . . 9 |- ( C e. A -> ran ( 2nd |` ( { C } X. B ) ) = B )
34	29, 33	eqtrd 2315	. . . . . . . 8 |- ( C e. A -> ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = B )
35	16, 34	syl5eq 2327	. . . . . . 7 |- ( C e. A -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = B )
36	35	adantl 452	. . . . . 6 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = B )
37	11, 36	eqtrd 2315	. . . . 5 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F ) = B )
38	8, 37	syl5eq 2327	. . . 4 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = B )
39		curry1.1	. . . . . 6 |- G = ( F o. `' ( 2nd |` ( { C } X. _V ) ) )
40	39	fneq1i 5338	. . . . 5 |- ( G Fn B <-> ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) Fn B )
41		df-fn 5258	. . . . 5 |- ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) Fn B <-> ( Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) /\ dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = B ) )
42	40, 41	bitri 240	. . . 4 |- ( G Fn B <-> ( Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) /\ dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = B ) )
43	7, 38, 42	sylanbrc 645	. . 3 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G Fn B )
44		dffn5 5568	. . 3 |- ( G Fn B <-> G = ( x e. B |-> ( G ` x ) ) )
45	43, 44	sylib 188	. 2 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G = ( x e. B |-> ( G ` x ) ) )
46	39	fveq1i 5526	. . . . 5 |- ( G ` x ) = ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x )
47		dff1o4 5480	. . . . . . . . 9 |- ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V <-> ( ( 2nd |` ( { C } X. _V ) ) Fn ( { C } X. _V ) /\ `' ( 2nd |` ( { C } X. _V ) ) Fn _V ) )
48	2, 47	sylib 188	. . . . . . . 8 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) Fn ( { C } X. _V ) /\ `' ( 2nd |` ( { C } X. _V ) ) Fn _V ) )
49	48	simprd 449	. . . . . . 7 |- ( C e. A -> `' ( 2nd |` ( { C } X. _V ) ) Fn _V )
50		vex 2791	. . . . . . . 8 |- x e. _V
51		fvco2 5594	. . . . . . . 8 |- ( ( `' ( 2nd |` ( { C } X. _V ) ) Fn _V /\ x e. _V ) -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
52	50, 51	mpan2 652	. . . . . . 7 |- ( `' ( 2nd |` ( { C } X. _V ) ) Fn _V -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
53	49, 52	syl 15	. . . . . 6 |- ( C e. A -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
54	53	ad2antlr 707	. . . . 5 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
55	46, 54	syl5eq 2327	. . . 4 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( G ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
56	2	adantr 451	. . . . . . . . 9 |- ( ( C e. A /\ x e. B ) -> ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V )
57		snidg 3665	. . . . . . . . . . . 12 |- ( C e. A -> C e. { C } )
58	57, 50	jctir 524	. . . . . . . . . . 11 |- ( C e. A -> ( C e. { C } /\ x e. _V ) )
59		opelxp 4719	. . . . . . . . . . 11 |- ( <. C , x >. e. ( { C } X. _V ) <-> ( C e. { C } /\ x e. _V ) )
60	58, 59	sylibr 203	. . . . . . . . . 10 |- ( C e. A -> <. C , x >. e. ( { C } X. _V ) )
61	60	adantr 451	. . . . . . . . 9 |- ( ( C e. A /\ x e. B ) -> <. C , x >. e. ( { C } X. _V ) )
62	56, 61	jca 518	. . . . . . . 8 |- ( ( C e. A /\ x e. B ) -> ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V /\ <. C , x >. e. ( { C } X. _V ) ) )
63		fvres 5542	. . . . . . . . . . 11 |- ( <. C , x >. e. ( { C } X. _V ) -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = ( 2nd ` <. C , x >. ) )
64	60, 63	syl 15	. . . . . . . . . 10 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = ( 2nd ` <. C , x >. ) )
65		op2ndg 6133	. . . . . . . . . . 11 |- ( ( C e. A /\ x e. _V ) -> ( 2nd ` <. C , x >. ) = x )
66	50, 65	mpan2 652	. . . . . . . . . 10 |- ( C e. A -> ( 2nd ` <. C , x >. ) = x )
67	64, 66	eqtrd 2315	. . . . . . . . 9 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = x )
68	67	adantr 451	. . . . . . . 8 |- ( ( C e. A /\ x e. B ) -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = x )
69		f1ocnvfv 5794	. . . . . . . 8 |- ( ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V /\ <. C , x >. e. ( { C } X. _V ) ) -> ( ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = x -> ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) = <. C , x >. ) )
70	62, 68, 69	sylc 56	. . . . . . 7 |- ( ( C e. A /\ x e. B ) -> ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) = <. C , x >. )
71	70	fveq2d 5529	. . . . . 6 |- ( ( C e. A /\ x e. B ) -> ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) = ( F ` <. C , x >. ) )
72	71	adantll 694	. . . . 5 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) = ( F ` <. C , x >. ) )
73		df-ov 5861	. . . . 5 |- ( C F x ) = ( F ` <. C , x >. )
74	72, 73	syl6eqr 2333	. . . 4 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) = ( C F x ) )
75	55, 74	eqtrd 2315	. . 3 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( G ` x ) = ( C F x ) )
76	75	mpteq2dva 4106	. 2 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( x e. B |-> ( G ` x ) ) = ( x e. B |-> ( C F x ) ) )
77	45, 76	eqtrd 2315	1 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G = ( x e. B |-> ( C F x ) ) )

Syntax hints:   -> wi 4   /\ wa 358   = wceq 1623   e. wcel 1684   _Vcvv 2788   i^i cin 3151   C_ wss 3152   {csn 3640   <.cop 3643   e. cmpt 4077   X. cxp 4687   `'ccnv 4688   dom cdm 4689   ran crn 4690   |` cres 4691   "cima 4692   o. ccom 4693   Fun wfun 5249   Fn wfn 5250   -onto->wfo 5253   -1-1-onto->wf1o 5254   ` cfv 5255  (class class class)co 5858   2ndc2nd 6121

This theorem is referenced by:  curry1val  6211  curry1f  6212  valcurfn2  25205

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-1st 6122  df-2nd 6123