Theorem ofovex 6311

Description: Applying a function operation to two functions which are sets yields a set. (Contributed by Jim Kingdon, 9-Oct-2026.)

Assertion

Ref	Expression
ofovex	|- ( ( F e. V /\ G e. W ) -> ( F oF R G ) e. _V )

Proof of Theorem ofovex

Dummy variables f g x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2833	. . . 4 |- ( F e. V -> F e. _V )
2	1	adantr 276	. . 3 |- ( ( F e. V /\ G e. W ) -> F e. _V )
3		elex 2833	. . . 4 |- ( G e. W -> G e. _V )
4	3	adantl 277	. . 3 |- ( ( F e. V /\ G e. W ) -> G e. _V )
5		dmexg 5048	. . . . . 6 |- ( F e. V -> dom F e. _V )
6	5	adantr 276	. . . . 5 |- ( ( F e. V /\ G e. W ) -> dom F e. _V )
7		inex1g 4271	. . . . 5 |- ( dom F e. _V -> ( dom F i^i dom G ) e. _V )
8	6, 7	syl 14	. . . 4 |- ( ( F e. V /\ G e. W ) -> ( dom F i^i dom G ) e. _V )
9	8	mptexd 5947	. . 3 |- ( ( F e. V /\ G e. W ) -> ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) e. _V )
10		dmeq 4983	. . . . . 6 |- ( f = F -> dom f = dom F )
11	10	ineq1d 3431	. . . . 5 |- ( f = F -> ( dom f i^i dom g ) = ( dom F i^i dom g ) )
12		fveq1 5697	. . . . . 6 |- ( f = F -> ( f ` x ) = ( F ` x ) )
13	12	oveq1d 6103	. . . . 5 |- ( f = F -> ( ( f ` x ) R ( g ` x ) ) = ( ( F ` x ) R ( g ` x ) ) )
14	11, 13	mpteq12dv 4214	. . . 4 |- ( f = F -> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) = ( x e. ( dom F i^i dom g ) |-> ( ( F ` x ) R ( g ` x ) ) ) )
15		dmeq 4983	. . . . . 6 |- ( g = G -> dom g = dom G )
16	15	ineq2d 3432	. . . . 5 |- ( g = G -> ( dom F i^i dom g ) = ( dom F i^i dom G ) )
17		fveq1 5697	. . . . . 6 |- ( g = G -> ( g ` x ) = ( G ` x ) )
18	17	oveq2d 6104	. . . . 5 |- ( g = G -> ( ( F ` x ) R ( g ` x ) ) = ( ( F ` x ) R ( G ` x ) ) )
19	16, 18	mpteq12dv 4214	. . . 4 |- ( g = G -> ( x e. ( dom F i^i dom g ) |-> ( ( F ` x ) R ( g ` x ) ) ) = ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) )
20		df-of 6305	. . . 4 |- oF R = ( f e. _V , g e. _V |-> ( x e. ( dom f i^i dom g ) |-> ( ( f ` x ) R ( g ` x ) ) ) )
21	14, 19, 20	ovmpog 6226	. . 3 |- ( ( 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 ) ) ) )
22	2, 4, 9, 21	syl3anc 1278	. 2 |- ( ( F e. V /\ G e. W ) -> ( F oF R G ) = ( x e. ( dom F i^i dom G ) |-> ( ( F ` x ) R ( G ` x ) ) ) )
23	22, 9	eqeltrd 2315	1 |- ( ( F e. V /\ G e. W ) -> ( F oF R G ) e. _V )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   i^i cin 3219   |-> cmpt 4193   dom cdm 4776   ` cfv 5380  (class class class)co 6088   oFcof 6303

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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686

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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-of 6305

This theorem is used by:  psrass1filem  15177