Theorem offval3 6367

Description: General value of ( F oF R G ) with no assumptions on functionality of F and G. (Contributed by Stefan O'Rear, 24-Jan-2015.)

Assertion

Ref	Expression
offval3	|- ( ( F e. V /\ G e. W ) -> ( F oF R G ) = ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) )

Distinct variable groups:   x, F   x, G   x, V   x, W   x, R

Proof of Theorem offval3

Dummy variables a b are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2833	. . 3 |- ( F e. V -> F e. _V )
2	1	adantr 276	. 2 |- ( ( F e. V /\ G e. W ) -> F e. _V )
3		elex 2833	. . 3 |- ( G e. W -> G e. _V )
4	3	adantl 277	. 2 |- ( ( F e. V /\ G e. W ) -> G e. _V )
5		dmexg 5046	. . . 4 |- ( F e. V -> dom F e. _V )
6		inex1g 4269	. . . 4 |- ( dom F e. _V -> ( dom F i^i dom G ) e. _V )
7		mptexg 5942	. . . 4 |- ( ( dom F i^i dom G ) e. _V -> ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) e. _V )
8	5, 6, 7	3syl 17	. . 3 |- ( F e. V -> ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) e. _V )
9	8	adantr 276	. 2 |- ( ( F e. V /\ G e. W ) -> ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) e. _V )
10		dmeq 4981	. . . . 5 |- ( a = F -> dom a = dom F )
11		dmeq 4981	. . . . 5 |- ( b = G -> dom b = dom G )
12	10, 11	ineqan12d 3434	. . . 4 |- ( ( a = F /\ b = G ) -> ( dom a i^i dom b ) = ( dom F i^i dom G ) )
13		fveq1 5694	. . . . 5 |- ( a = F -> ( a ` x ) = ( F ` x ) )
14		fveq1 5694	. . . . 5 |- ( b = G -> ( b ` x ) = ( G ` x ) )
15	13, 14	oveqan12d 6104	. . . 4 |- ( ( a = F /\ b = G ) -> ( ( a ` x ) R ( b ` x ) ) = ( ( F ` x ) R ( G ` x ) ) )
16	12, 15	mpteq12dv 4213	. . 3 |- ( ( a = F /\ b = G ) -> ( x e. ( dom a i^i dom b ) |-> ( ( a ` x ) R ( b ` x ) ) ) = ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) )
17		df-of 6302	. . 3 |- oF R = ( a e. _V , b e. _V |-> ( x e. ( dom a i^i dom b ) |-> ( ( a ` x ) R ( b ` x ) ) ) )
18	16, 17	ovmpoga 6218	. 2 |- ( ( 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 ) ) ) )
19	2, 4, 9, 18	syl3anc 1278	1 |- ( ( F e. V /\ G e. W ) -> ( F oF R G ) = ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   i^i cin 3219   |-> cmpt 4192   dom cdm 4774   ` cfv 5377  (class class class)co 6085   oFcof 6300

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  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-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302

This theorem is used by:  offres  6368