Theorem ofco2 22660

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 1213	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → Fun 𝐻)
2		fvimacnvi 7051	. . . 4 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻‘𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
3	1, 2	sylan 592	. . 3 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻‘𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
4	1	funfnd 6571	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → 𝐻 Fn dom 𝐻)
5		dffn5 6943	. . . . . 6 ⊢ (𝐻 Fn dom 𝐻 ↔ 𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)))
6	4, 5	sylib 221	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → 𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)))
7	6	reseq1d 5979	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = ((𝑥 ∈ dom 𝐻 ↦ (𝐻‘𝑥)) ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
8		cnvimass 6086	. . . . 5 ⊢ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ⊆ dom 𝐻
9		resmpt 6041	. . . . 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 2816	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻‘𝑥)))
12		offval3 7985	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑦)𝑅(𝐺‘𝑦))))
13	12	adantr 486	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑦)𝑅(𝐺‘𝑦))))
14		fveq2 6885	. . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐹‘𝑦) = (𝐹‘(𝐻‘𝑥)))
15		fveq2 6885	. . . 4 ⊢ (𝑦 = (𝐻‘𝑥) → (𝐺‘𝑦) = (𝐺‘(𝐻‘𝑥)))
16	14, 15	oveq12d 7437	. . 3 ⊢ (𝑦 = (𝐻‘𝑥) → ((𝐹‘𝑦)𝑅(𝐺‘𝑦)) = ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
17	3, 11, 13, 16	fmptco 7129	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
18		ovex 7452	. . . . . . . 8 ⊢ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V
19	18	rgenw 3085	. . . . . . 7 ⊢ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V
20		eqid 2765	. . . . . . . 8 ⊢ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
21	20	fnmpt 6679	. . . . . . 7 ⊢ (∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹‘𝑥)𝑅(𝐺‘𝑥)) ∈ V → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
22	19, 21	mp1i 14	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
23		offval3 7985	. . . . . . . 8 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
24	23	adantr 486	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
25	24	fneq1d 6632	. . . . . 6 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺) ↔ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) Fn (dom 𝐹 ∩ dom 𝐺)))
26	22, 25	mpbird 260	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘f 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺))
27	26	fndmd 6644	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → dom (𝐹 ∘f 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺))
28		eqimss 3996	. . . 4 ⊢ (dom (𝐹 ∘f 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺) → dom (𝐹 ∘f 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺))
29		cores2 6263	. . . 4 ⊢ (dom (𝐹 ∘f 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻))
30	27, 28, 29	3syl 19	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻))
31		funcnvres2 6620	. . . . 5 ⊢ (Fun 𝐻 → ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
32	1, 31	syl 18	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
33	32	coeq2d 5850	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ ◡(◡𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
34	30, 33	eqtr3d 2802	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻) = ((𝐹 ∘f 𝑅𝐺) ∘ (𝐻 ↾ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
35		simpr2 1214	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐹 ∘ 𝐻) ∈ V)
36		simpr3 1215	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝐺 ∘ 𝐻) ∈ V)
37		offval3 7985	. . . 4 ⊢ (((𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))))
38	35, 36, 37	syl2anc 596	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))))
39		dmco 6258	. . . . . 6 ⊢ dom (𝐹 ∘ 𝐻) = (◡𝐻 “ dom 𝐹)
40		dmco 6258	. . . . . 6 ⊢ dom (𝐺 ∘ 𝐻) = (◡𝐻 “ dom 𝐺)
41	39, 40	ineq12i 4171	. . . . 5 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺))
42		inpreima 7063	. . . . . 6 ⊢ (Fun 𝐻 → (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺)))
43	1, 42	syl 18	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((◡𝐻 “ dom 𝐹) ∩ (◡𝐻 “ dom 𝐺)))
44	41, 43	eqtr4id 2819	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) = (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)))
45		simplr1 1234	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → Fun 𝐻)
46		inss2 4190	. . . . . . . . 9 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom (𝐺 ∘ 𝐻)
47		dmcoss 5967	. . . . . . . . 9 ⊢ dom (𝐺 ∘ 𝐻) ⊆ dom 𝐻
48	46, 47	sstri 3947	. . . . . . . 8 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻
49	48	a1i 11	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻)
50	49	sselda 3938	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → 𝑥 ∈ dom 𝐻)
51		fvco 6983	. . . . . 6 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ dom 𝐻) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥)))
52	45, 50, 51	syl2anc 596	. . . . 5 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → ((𝐹 ∘ 𝐻)‘𝑥) = (𝐹‘(𝐻‘𝑥)))
53		inss1 4189	. . . . . . . . 9 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom (𝐹 ∘ 𝐻)
54		dmcoss 5967	. . . . . . . . 9 ⊢ dom (𝐹 ∘ 𝐻) ⊆ dom 𝐻
55	53, 54	sstri 3947	. . . . . . . 8 ⊢ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻
56	55	a1i 11	. . . . . . 7 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ⊆ dom 𝐻)
57	56	sselda 3938	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → 𝑥 ∈ dom 𝐻)
58		fvco 6983	. . . . . 6 ⊢ ((Fun 𝐻 ∧ 𝑥 ∈ dom 𝐻) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥)))
59	45, 57, 58	syl2anc 596	. . . . 5 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → ((𝐺 ∘ 𝐻)‘𝑥) = (𝐺‘(𝐻‘𝑥)))
60	52, 59	oveq12d 7437	. . . 4 ⊢ ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻))) → (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥)) = ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥))))
61	44, 60	mpteq12dva 5199	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → (𝑥 ∈ (dom (𝐹 ∘ 𝐻) ∩ dom (𝐺 ∘ 𝐻)) ↦ (((𝐹 ∘ 𝐻)‘𝑥)𝑅((𝐺 ∘ 𝐻)‘𝑥))) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
62	38, 61	eqtrd 2800	. 2 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)) = (𝑥 ∈ (◡𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻‘𝑥))𝑅(𝐺‘(𝐻‘𝑥)))))
63	17, 34, 62	3eqtr4d 2810	1 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹 ∘ 𝐻) ∈ V ∧ (𝐺 ∘ 𝐻) ∈ V)) → ((𝐹 ∘f 𝑅𝐺) ∘ 𝐻) = ((𝐹 ∘ 𝐻) ∘f 𝑅(𝐺 ∘ 𝐻)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  Vcvv 3457   ∩ cin 3905   ⊆ wss 3906   ↦ cmpt 5194  ^◡ccnv 5662  dom cdm 5663   ↾ cres 5665   “ cima 5666   ∘ ccom 5667  Fun wfun 6534   Fn wfn 6535  ‘cfv 6540  (class class class)co 7419   ∘_f cof 7682

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-of 7684

This theorem is used by:  oftpos  22661