Theorem curry1 6907

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 5683	. . . . 5 |- ( F Fn ( A X. B ) -> Fun F )
2		2ndconst 6904	. . . . . 6 |- ( C e. A -> ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V )
3		dff1o3 5834	. . . . . . 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 471	. . . . . 6 |- ( ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V -> Fun `' ( 2nd |` ( { C } X. _V ) ) )
5	2, 4	syl 17	. . . . 5 |- ( C e. A -> Fun `' ( 2nd |` ( { C } X. _V ) ) )
6		funco 5627	. . . . 5 |- ( ( Fun F /\ Fun `' ( 2nd |` ( { C } X. _V ) ) ) -> Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) )
7	1, 5, 6	syl2an 485	. . . 4 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) )
8		dmco 5350	. . . . 5 |- dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F )
9		fndm 5685	. . . . . . . 8 |- ( F Fn ( A X. B ) -> dom F = ( A X. B ) )
10	9	adantr 472	. . . . . . 7 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> dom F = ( A X. B ) )
11	10	imaeq2d 5174	. . . . . 6 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F ) = ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) )
12		imacnvcnv 5307	. . . . . . . . 9 |- ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ( ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) )
13		df-ima 4852	. . . . . . . . 9 |- ( ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ran ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) )
14		resres 5123	. . . . . . . . . 10 |- ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) ) = ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
15	14	rneqi 5067	. . . . . . . . 9 |- ran ( ( 2nd |` ( { C } X. _V ) ) |` ( A X. B ) ) = ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
16	12, 13, 15	3eqtri 2497	. . . . . . . 8 |- ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) )
17		inxp 4972	. . . . . . . . . . . . 13 |- ( ( { C } X. _V ) i^i ( A X. B ) ) = ( ( { C } i^i A ) X. ( _V i^i B ) )
18		incom 3616	. . . . . . . . . . . . . . 15 |- ( _V i^i B ) = ( B i^i _V )
19		inv1 3764	. . . . . . . . . . . . . . 15 |- ( B i^i _V ) = B
20	18, 19	eqtri 2493	. . . . . . . . . . . . . 14 |- ( _V i^i B ) = B
21	20	xpeq2i 4860	. . . . . . . . . . . . 13 |- ( ( { C } i^i A ) X. ( _V i^i B ) ) = ( ( { C } i^i A ) X. B )
22	17, 21	eqtri 2493	. . . . . . . . . . . 12 |- ( ( { C } X. _V ) i^i ( A X. B ) ) = ( ( { C } i^i A ) X. B )
23		snssi 4107	. . . . . . . . . . . . . 14 |- ( C e. A -> { C } C_ A )
24		df-ss 3404	. . . . . . . . . . . . . 14 |- ( { C } C_ A <-> ( { C } i^i A ) = { C } )
25	23, 24	sylib 201	. . . . . . . . . . . . 13 |- ( C e. A -> ( { C } i^i A ) = { C } )
26	25	xpeq1d 4862	. . . . . . . . . . . 12 |- ( C e. A -> ( ( { C } i^i A ) X. B ) = ( { C } X. B ) )
27	22, 26	syl5eq 2517	. . . . . . . . . . 11 |- ( C e. A -> ( ( { C } X. _V ) i^i ( A X. B ) ) = ( { C } X. B ) )
28	27	reseq2d 5111	. . . . . . . . . 10 |- ( C e. A -> ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = ( 2nd |` ( { C } X. B ) ) )
29	28	rneqd 5068	. . . . . . . . 9 |- ( C e. A -> ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = ran ( 2nd |` ( { C } X. B ) ) )
30		2ndconst 6904	. . . . . . . . . 10 |- ( C e. A -> ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -1-1-onto-> B )
31		f1ofo 5835	. . . . . . . . . 10 |- ( ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -1-1-onto-> B -> ( 2nd |` ( { C } X. B ) ) : ( { C } X. B ) -onto-> B )
32		forn 5809	. . . . . . . . . 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 2505	. . . . . . . 8 |- ( C e. A -> ran ( 2nd |` ( ( { C } X. _V ) i^i ( A X. B ) ) ) = B )
35	16, 34	syl5eq 2517	. . . . . . 7 |- ( C e. A -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = B )
36	35	adantl 473	. . . . . 6 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " ( A X. B ) ) = B )
37	11, 36	eqtrd 2505	. . . . 5 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( `' `' ( 2nd |` ( { C } X. _V ) ) " dom F ) = B )
38	8, 37	syl5eq 2517	. . . 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 5680	. . . . 5 |- ( G Fn B <-> ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) Fn B )
41		df-fn 5592	. . . . 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 257	. . . 4 |- ( G Fn B <-> ( Fun ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) /\ dom ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) = B ) )
43	7, 38, 42	sylanbrc 677	. . 3 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G Fn B )
44		dffn5 5924	. . 3 |- ( G Fn B <-> G = ( x e. B |-> ( G ` x ) ) )
45	43, 44	sylib 201	. 2 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G = ( x e. B |-> ( G ` x ) ) )
46	39	fveq1i 5880	. . . . 5 |- ( G ` x ) = ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x )
47		dff1o4 5836	. . . . . . . . 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 201	. . . . . . . 8 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) Fn ( { C } X. _V ) /\ `' ( 2nd |` ( { C } X. _V ) ) Fn _V ) )
49	48	simprd 470	. . . . . . 7 |- ( C e. A -> `' ( 2nd |` ( { C } X. _V ) ) Fn _V )
50		vex 3034	. . . . . . . 8 |- x e. _V
51		fvco2 5955	. . . . . . . 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 685	. . . . . . 7 |- ( `' ( 2nd |` ( { C } X. _V ) ) Fn _V -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
53	49, 52	syl 17	. . . . . 6 |- ( C e. A -> ( ( F o. `' ( 2nd |` ( { C } X. _V ) ) ) ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
54	53	ad2antlr 741	. . . . 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 2517	. . . 4 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( G ` x ) = ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) )
56	2	adantr 472	. . . . . . . . 9 |- ( ( C e. A /\ x e. B ) -> ( 2nd |` ( { C } X. _V ) ) : ( { C } X. _V ) -1-1-onto-> _V )
57		snidg 3986	. . . . . . . . . . . 12 |- ( C e. A -> C e. { C } )
58	57, 50	jctir 547	. . . . . . . . . . 11 |- ( C e. A -> ( C e. { C } /\ x e. _V ) )
59		opelxp 4869	. . . . . . . . . . 11 |- ( <. C , x >. e. ( { C } X. _V ) <-> ( C e. { C } /\ x e. _V ) )
60	58, 59	sylibr 217	. . . . . . . . . 10 |- ( C e. A -> <. C , x >. e. ( { C } X. _V ) )
61	60	adantr 472	. . . . . . . . 9 |- ( ( C e. A /\ x e. B ) -> <. C , x >. e. ( { C } X. _V ) )
62	56, 61	jca 541	. . . . . . . 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 5893	. . . . . . . . . . 11 |- ( <. C , x >. e. ( { C } X. _V ) -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = ( 2nd ` <. C , x >. ) )
64	60, 63	syl 17	. . . . . . . . . 10 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = ( 2nd ` <. C , x >. ) )
65		op2ndg 6825	. . . . . . . . . . 11 |- ( ( C e. A /\ x e. _V ) -> ( 2nd ` <. C , x >. ) = x )
66	50, 65	mpan2 685	. . . . . . . . . 10 |- ( C e. A -> ( 2nd ` <. C , x >. ) = x )
67	64, 66	eqtrd 2505	. . . . . . . . 9 |- ( C e. A -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = x )
68	67	adantr 472	. . . . . . . 8 |- ( ( C e. A /\ x e. B ) -> ( ( 2nd |` ( { C } X. _V ) ) ` <. C , x >. ) = x )
69		f1ocnvfv 6195	. . . . . . . 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 61	. . . . . . 7 |- ( ( C e. A /\ x e. B ) -> ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) = <. C , x >. )
71	70	fveq2d 5883	. . . . . 6 |- ( ( C e. A /\ x e. B ) -> ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) = ( F ` <. C , x >. ) )
72	71	adantll 728	. . . . 5 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( F ` ( `' ( 2nd |` ( { C } X. _V ) ) ` x ) ) = ( F ` <. C , x >. ) )
73		df-ov 6311	. . . . 5 |- ( C F x ) = ( F ` <. C , x >. )
74	72, 73	syl6eqr 2523	. . . 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 2505	. . 3 |- ( ( ( F Fn ( A X. B ) /\ C e. A ) /\ x e. B ) -> ( G ` x ) = ( C F x ) )
76	75	mpteq2dva 4482	. 2 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> ( x e. B |-> ( G ` x ) ) = ( x e. B |-> ( C F x ) ) )
77	45, 76	eqtrd 2505	1 |- ( ( F Fn ( A X. B ) /\ C e. A ) -> G = ( x e. B |-> ( C F x ) ) )

Syntax hints:   -> wi 4   /\ wa 376   = wceq 1452   e. wcel 1904   _Vcvv 3031   i^i cin 3389   C_ wss 3390   {csn 3959   <.cop 3965   |-> cmpt 4454   X. cxp 4837   `'ccnv 4838   dom cdm 4839   ran crn 4840   |` cres 4841   "cima 4842   o. ccom 4843   Fun wfun 5583   Fn wfn 5584   -onto->wfo 5587   -1-1-onto->wf1o 5588   ` cfv 5589  (class class class)co 6308   2ndc2nd 6811

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602

This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-nul 3723  df-if 3873  df-sn 3960  df-pr 3962  df-op 3966  df-uni 4191  df-iun 4271  df-br 4396  df-opab 4455  df-mpt 4456  df-id 4754  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-ov 6311  df-1st 6812  df-2nd 6813

This theorem is referenced by:  curry1val  6908  curry1f  6909