Theorem ofco2 22416

Description: Distribution law for the function operation and the composition of functions. (Contributed by Stefan O'Rear, 17-Jul-2018.)

Assertion

Ref	Expression
ofco2	⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻) = ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)))

Proof of Theorem ofco2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr1 1196	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → Fun 𝐻)
2		fvimacnvi 7004	. . . 4 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻‘𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
3	1, 2	sylan 581	. . 3 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻‘𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
4	1	funfnd 6529	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → 𝐻 Fn dom 𝐻)
5		dffn5 6898	. . . . . 6 ⊢ (𝐻 Fn dom 𝐻 ↔ 𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)))
6	4, 5	sylib 218	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → 𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)))
7	6	reseq1d 5943	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = ((𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)) ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
8		cnvimass 6047	. . . . 5 ⊢ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ⊆ dom 𝐻
9		resmpt 6002	. . . . 5 ⊢ ((◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ⊆ dom 𝐻 → ((𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)) ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻‘𝑥)))
10	8, 9	ax-mp 5	. . . 4 ⊢ ((𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)) ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻‘𝑥))
11	7, 10	eqtrdi 2787	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻‘𝑥)))
12		offval3 7935	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑦)𝑅(𝐺‘𝑦))))
13	12	adantr 480	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑦)𝑅(𝐺‘𝑦))))
14		fveq2 6840	. . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥)))
15		fveq2 6840	. . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥)))
16	14, 15	oveq12d 7385	. . 3 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦)) = ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
17	3, 11, 13, 16	fmptco 7082	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
18		ovex 7400	. . . . . . . 8 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V
19	18	rgenw 3055	. . . . . . 7 ⊢ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V
20		eqid 2736	. . . . . . . 8 ⊢ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
21	20	fnmpt 6638	. . . . . . 7 ⊢ (∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
22	19, 21	mp1i 13	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
23		offval3 7935	. . . . . . . 8 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
24	23	adantr 480	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
25	24	fneq1d 6591	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺) ↔ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺)))
26	22, 25	mpbird 257	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺))
27	26	fndmd 6603	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → dom (𝐹 ∘f 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺))
28		eqimss 3980	. . . 4 ⊢ (dom (𝐹 ∘f 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺) → dom (𝐹 ∘f 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺))
29		cores2 6224	. . . 4 ⊢ (dom (𝐹 ∘f 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻))
30	27, 28, 29	3syl 18	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻))
31		funcnvres2 6578	. . . . 5 ⊢ (Fun 𝐻 → ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
32	1, 31	syl 17	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
33	32	coeq2d 5817	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
34	30, 33	eqtr3d 2773	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻) = ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
35		simpr2 1197	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘ 𝐻) ∈ V)
36		simpr3 1198	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐺 ∘ 𝐻) ∈ V)
37		offval3 7935	. . . 4 ⊢ (((𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))))
38	35, 36, 37	syl2anc 585	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))))
39		dmco 6219	. . . . . 6 ⊢ dom (𝐹 ∘ 𝐻) = (◡𝐻 “ dom 𝐹)
40		dmco 6219	. . . . . 6 ⊢ dom (𝐺 ∘ 𝐻) = (◡𝐻 “ dom 𝐺)
41	39, 40	ineq12i 4158	. . . . 5 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺))
42		inpreima 7016	. . . . . 6 ⊢ (Fun 𝐻 → (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺)))
43	1, 42	syl 17	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺)))
44	41, 43	eqtr4id 2790	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) = (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))
45		simplr1 1217	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → Fun 𝐻)
46		inss2 4178	. . . . . . . . 9 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom (𝐺 ∘ 𝐻)
47		dmcoss 5930	. . . . . . . . 9 ⊢ dom (𝐺 ∘ 𝐻) ⊆ dom 𝐻
48	46, 47	sstri 3931	. . . . . . . 8 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻
49	48	a1i 11	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻)
50	49	sselda 3921	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → 𝑥 ∈ dom 𝐻)
51		fvco 6938	. . . . . 6 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ dom 𝐻) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥)))
52	45, 50, 51	syl2anc 585	. . . . 5 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥)))
53		inss1 4177	. . . . . . . . 9 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom (𝐹 ∘ 𝐻)
54		dmcoss 5930	. . . . . . . . 9 ⊢ dom (𝐹 ∘ 𝐻) ⊆ dom 𝐻
55	53, 54	sstri 3931	. . . . . . . 8 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻
56	55	a1i 11	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻)
57	56	sselda 3921	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → 𝑥 ∈ dom 𝐻)
58		fvco 6938	. . . . . 6 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ dom 𝐻) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥)))
59	45, 57, 58	syl2anc 585	. . . . 5 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥)))
60	52, 59	oveq12d 7385	. . . 4 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥)) = ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
61	44, 60	mpteq12dva 5171	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
62	38, 61	eqtrd 2771	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
63	17, 34, 62	3eqtr4d 2781	1 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻) = ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3051  Vcvv 3429   ∩ cin 3888   ⊆ wss 3889   ↦ cmpt 5166  ^◡ccnv 5630  dom cdm 5631   ↾ cres 5633   “ cima 5634   ∘ ccom 5635  Fun wfun 6492   Fn wfn 6493  ‘cfv 6498  (class class class)co 7367   ∘_f cof 7629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-of 7631

This theorem is referenced by:  oftpos  22417