Theorem ofmres 6329

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 6330, allowing it to be used as a function or structure argument. By ofmresval 6278, 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 3260	. . 3 |- A C_ _V
2		ssv 3260	. . 3 |- B C_ _V
3		resmpo 6151	. . 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 6266	. . 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 5034	. 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 2232	. . 3 |- A = A
8		eqid 2232	. . 3 |- B = B
9		vex 2816	. . . 4 |- f e. _V
10		vex 2816	. . . 4 |- g e. _V
11	9	dmex 5024	. . . . . 6 |- dom f e. _V
12	11	inex1 4244	. . . . 5 |- ( dom f i^i dom g ) e. _V
13	12	mptex 5912	. . . 4 |- ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) e. _V
14	5	ovmpt4g 6176	. . . 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 1374	. . 3 |- ( f oF R g ) = ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) )
16	7, 8, 15	mpoeq123i 6116	. 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 2263	1 |- ( oF R |` ( A X. B ) ) = ( f e. A , g e. B |-> ( f oF R g ) )

Syntax hints:   = wceq 1398   e. wcel 2203   _Vcvv 2813   i^i cin 3210   C_ wss 3211   |-> cmpt 4171   X. cxp 4747   dom cdm 4749   |` cres 4751   ` cfv 5352  (class class class)co 6050   e. cmpo 6052   oFcof 6264

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-of 6266

This theorem is referenced by: (None)