Theorem ofmres 6190

Description: Equivalent expressions for a restriction of the function operation map. Unlike oF R which is a proper class, ( oF R |` ( A X. B ) ) can be a set by ofmresex 6191, allowing it to be used as a function or structure argument. By ofmresval 6144, the restricted operation map values are the same as the original values, allowing theorems for oF R to be reused. (Contributed by NM, 20-Oct-2014.)

Assertion

Ref	Expression
ofmres	|- ( oF R |` ( A X. B ) ) = ( f e. A , g e. B |-> ( f oF R g ) )

Distinct variable groups:   f, g, A   B, f, g   R, f, g

Proof of Theorem ofmres

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssv 3202	. . 3 |- A C_ _V
2		ssv 3202	. . 3 |- B C_ _V
3		resmpo 6017	. . 3 |- ( ( A C_ _V /\ B C_ _V ) -> ( ( f e. _V , g e. _V |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) ) |` ( A X. B ) ) = ( f e. A , g e. B |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) ) )
4	1, 2, 3	mp2an 426	. 2 |- ( ( f e. _V , g e. _V |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) ) |` ( A X. B ) ) = ( f e. A , g e. B |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) )
5		df-of 6132	. . 3 |- oF R = ( f e. _V , g e. _V |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) )
6	5	reseq1i 4939	. 2 |- ( oF R |` ( A X. B ) ) = ( ( f e. _V , g e. _V |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) ) |` ( A X. B ) )
7		eqid 2193	. . 3 |- A = A
8		eqid 2193	. . 3 |- B = B
9		vex 2763	. . . 4 |- f e. _V
10		vex 2763	. . . 4 |- g e. _V
11	9	dmex 4929	. . . . . 6 |- dom f e. _V
12	11	inex1 4164	. . . . 5 |- ( dom f i^i dom g ) e. _V
13	12	mptex 5785	. . . 4 |- ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) e. _V
14	5	ovmpt4g 6042	. . . 4 |- ( ( f e. _V /\ g e. _V /\ ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) e. _V ) -> ( f oF R g ) = ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) )
15	9, 10, 13, 14	mp3an 1348	. . 3 |- ( f oF R g ) = ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) )
16	7, 8, 15	mpoeq123i 5982	. 2 |- ( f e. A , g e. B |-> ( f oF R g ) ) = ( f e. A , g e. B |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) )
17	4, 6, 16	3eqtr4i 2224	1 |- ( oF R |` ( A X. B ) ) = ( f e. A , g e. B |-> ( f oF R g ) )

Syntax hints:   = wceq 1364   e. wcel 2164   _Vcvv 2760   i^i cin 3153   C_ wss 3154   |-> cmpt 4091   X. cxp 4658   dom cdm 4660   |` cres 4662   ` cfv 5255  (class class class)co 5919   e. cmpo 5921   oFcof 6130

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-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-of 6132

This theorem is referenced by: (None)