MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ofco2 Structured version   Visualization version   GIF version

Theorem ofco2 20014
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)) → ((𝐹𝑓 𝑅𝐺) ∘ 𝐻) = ((𝐹𝐻) ∘𝑓 𝑅(𝐺𝐻)))

Proof of Theorem ofco2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr1 1059 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → Fun 𝐻)
2 fvimacnvi 6220 . . . 4 ((Fun 𝐻𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
31, 2sylan 486 . . 3 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) → (𝐻𝑥) ∈ (dom 𝐹 ∩ dom 𝐺))
4 funfn 5815 . . . . . . 7 (Fun 𝐻𝐻 Fn dom 𝐻)
51, 4sylib 206 . . . . . 6 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → 𝐻 Fn dom 𝐻)
6 dffn5 6132 . . . . . 6 (𝐻 Fn dom 𝐻𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻𝑥)))
75, 6sylib 206 . . . . 5 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → 𝐻 = (𝑥 ∈ dom 𝐻 ↦ (𝐻𝑥)))
87reseq1d 5299 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = ((𝑥 ∈ dom 𝐻 ↦ (𝐻𝑥)) ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
9 cnvimass 5387 . . . . 5 (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ⊆ dom 𝐻
10 resmpt 5352 . . . . 5 ((𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ⊆ dom 𝐻 → ((𝑥 ∈ dom 𝐻 ↦ (𝐻𝑥)) ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻𝑥)))
119, 10ax-mp 5 . . . 4 ((𝑥 ∈ dom 𝐻 ↦ (𝐻𝑥)) ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻𝑥))
128, 11syl6eq 2655 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ (𝐻𝑥)))
13 offval3 7026 . . . 4 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹𝑓 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑦)𝑅(𝐺𝑦))))
1413adantr 479 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐹𝑓 𝑅𝐺) = (𝑦 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑦)𝑅(𝐺𝑦))))
15 fveq2 6084 . . . 4 (𝑦 = (𝐻𝑥) → (𝐹𝑦) = (𝐹‘(𝐻𝑥)))
16 fveq2 6084 . . . 4 (𝑦 = (𝐻𝑥) → (𝐺𝑦) = (𝐺‘(𝐻𝑥)))
1715, 16oveq12d 6541 . . 3 (𝑦 = (𝐻𝑥) → ((𝐹𝑦)𝑅(𝐺𝑦)) = ((𝐹‘(𝐻𝑥))𝑅(𝐺‘(𝐻𝑥))))
183, 12, 14, 17fmptco 6284 . 2 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)))) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻𝑥))𝑅(𝐺‘(𝐻𝑥)))))
19 ovex 6551 . . . . . . . 8 ((𝐹𝑥)𝑅(𝐺𝑥)) ∈ V
2019rgenw 2903 . . . . . . 7 𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹𝑥)𝑅(𝐺𝑥)) ∈ V
21 eqid 2605 . . . . . . . 8 (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥)))
2221fnmpt 5915 . . . . . . 7 (∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)((𝐹𝑥)𝑅(𝐺𝑥)) ∈ V → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
2320, 22mp1i 13 . . . . . 6 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) Fn (dom 𝐹 ∩ dom 𝐺))
24 offval3 7026 . . . . . . . 8 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
2524adantr 479 . . . . . . 7 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
2625fneq1d 5877 . . . . . 6 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺) ↔ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) Fn (dom 𝐹 ∩ dom 𝐺)))
2723, 26mpbird 245 . . . . 5 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐹𝑓 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺))
28 fndm 5886 . . . . 5 ((𝐹𝑓 𝑅𝐺) Fn (dom 𝐹 ∩ dom 𝐺) → dom (𝐹𝑓 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺))
2927, 28syl 17 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → dom (𝐹𝑓 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺))
30 eqimss 3615 . . . 4 (dom (𝐹𝑓 𝑅𝐺) = (dom 𝐹 ∩ dom 𝐺) → dom (𝐹𝑓 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺))
31 cores2 5547 . . . 4 (dom (𝐹𝑓 𝑅𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺) → ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹𝑓 𝑅𝐺) ∘ 𝐻))
3229, 30, 313syl 18 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹𝑓 𝑅𝐺) ∘ 𝐻))
33 funcnvres2 5865 . . . . 5 (Fun 𝐻(𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
341, 33syl 17 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐻 ↾ (dom 𝐹 ∩ dom 𝐺)) = (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺))))
3534coeq2d 5190 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (dom 𝐹 ∩ dom 𝐺))) = ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
3632, 35eqtr3d 2641 . 2 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) ∘ 𝐻) = ((𝐹𝑓 𝑅𝐺) ∘ (𝐻 ↾ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)))))
37 simpr2 1060 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐹𝐻) ∈ V)
38 simpr3 1061 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐺𝐻) ∈ V)
39 offval3 7026 . . . 4 (((𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V) → ((𝐹𝐻) ∘𝑓 𝑅(𝐺𝐻)) = (𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ↦ (((𝐹𝐻)‘𝑥)𝑅((𝐺𝐻)‘𝑥))))
4037, 38, 39syl2anc 690 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝐻) ∘𝑓 𝑅(𝐺𝐻)) = (𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ↦ (((𝐹𝐻)‘𝑥)𝑅((𝐺𝐻)‘𝑥))))
41 inpreima 6231 . . . . . 6 (Fun 𝐻 → (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((𝐻 “ dom 𝐹) ∩ (𝐻 “ dom 𝐺)))
421, 41syl 17 . . . . 5 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) = ((𝐻 “ dom 𝐹) ∩ (𝐻 “ dom 𝐺)))
43 dmco 5542 . . . . . 6 dom (𝐹𝐻) = (𝐻 “ dom 𝐹)
44 dmco 5542 . . . . . 6 dom (𝐺𝐻) = (𝐻 “ dom 𝐺)
4543, 44ineq12i 3769 . . . . 5 (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) = ((𝐻 “ dom 𝐹) ∩ (𝐻 “ dom 𝐺))
4642, 45syl6reqr 2658 . . . 4 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) = (𝐻 “ (dom 𝐹 ∩ dom 𝐺)))
47 simplr1 1095 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → Fun 𝐻)
48 inss2 3791 . . . . . . . . 9 (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom (𝐺𝐻)
49 dmcoss 5289 . . . . . . . . 9 dom (𝐺𝐻) ⊆ dom 𝐻
5048, 49sstri 3572 . . . . . . . 8 (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom 𝐻
5150a1i 11 . . . . . . 7 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom 𝐻)
5251sselda 3563 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → 𝑥 ∈ dom 𝐻)
53 fvco 6165 . . . . . 6 ((Fun 𝐻𝑥 ∈ dom 𝐻) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
5447, 52, 53syl2anc 690 . . . . 5 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → ((𝐹𝐻)‘𝑥) = (𝐹‘(𝐻𝑥)))
55 inss1 3790 . . . . . . . . 9 (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom (𝐹𝐻)
56 dmcoss 5289 . . . . . . . . 9 dom (𝐹𝐻) ⊆ dom 𝐻
5755, 56sstri 3572 . . . . . . . 8 (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom 𝐻
5857a1i 11 . . . . . . 7 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ⊆ dom 𝐻)
5958sselda 3563 . . . . . 6 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → 𝑥 ∈ dom 𝐻)
60 fvco 6165 . . . . . 6 ((Fun 𝐻𝑥 ∈ dom 𝐻) → ((𝐺𝐻)‘𝑥) = (𝐺‘(𝐻𝑥)))
6147, 59, 60syl2anc 690 . . . . 5 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → ((𝐺𝐻)‘𝑥) = (𝐺‘(𝐻𝑥)))
6254, 61oveq12d 6541 . . . 4 ((((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) ∧ 𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻))) → (((𝐹𝐻)‘𝑥)𝑅((𝐺𝐻)‘𝑥)) = ((𝐹‘(𝐻𝑥))𝑅(𝐺‘(𝐻𝑥))))
6346, 62mpteq12dva 4652 . . 3 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → (𝑥 ∈ (dom (𝐹𝐻) ∩ dom (𝐺𝐻)) ↦ (((𝐹𝐻)‘𝑥)𝑅((𝐺𝐻)‘𝑥))) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻𝑥))𝑅(𝐺‘(𝐻𝑥)))))
6440, 63eqtrd 2639 . 2 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝐻) ∘𝑓 𝑅(𝐺𝐻)) = (𝑥 ∈ (𝐻 “ (dom 𝐹 ∩ dom 𝐺)) ↦ ((𝐹‘(𝐻𝑥))𝑅(𝐺‘(𝐻𝑥)))))
6518, 36, 643eqtr4d 2649 1 (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ (Fun 𝐻 ∧ (𝐹𝐻) ∈ V ∧ (𝐺𝐻) ∈ V)) → ((𝐹𝑓 𝑅𝐺) ∘ 𝐻) = ((𝐹𝐻) ∘𝑓 𝑅(𝐺𝐻)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  w3a 1030   = wceq 1474  wcel 1975  wral 2891  Vcvv 3168  cin 3534  wss 3535  cmpt 4633  ccnv 5023  dom cdm 5024  cres 5026  cima 5027  ccom 5028  Fun wfun 5780   Fn wfn 5781  cfv 5786  (class class class)co 6523  𝑓 cof 6766
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-8 1977  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585  ax-rep 4689  ax-sep 4699  ax-nul 4708  ax-pow 4760  ax-pr 4824  ax-un 6820
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2457  df-mo 2458  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ne 2777  df-ral 2896  df-rex 2897  df-reu 2898  df-rab 2900  df-v 3170  df-sbc 3398  df-csb 3495  df-dif 3538  df-un 3540  df-in 3542  df-ss 3549  df-nul 3870  df-if 4032  df-sn 4121  df-pr 4123  df-op 4127  df-uni 4363  df-iun 4447  df-br 4574  df-opab 4634  df-mpt 4635  df-id 4939  df-xp 5030  df-rel 5031  df-cnv 5032  df-co 5033  df-dm 5034  df-rn 5035  df-res 5036  df-ima 5037  df-iota 5750  df-fun 5788  df-fn 5789  df-f 5790  df-f1 5791  df-fo 5792  df-f1o 5793  df-fv 5794  df-ov 6526  df-oprab 6527  df-mpt2 6528  df-of 6768
This theorem is referenced by:  oftpos  20015
  Copyright terms: Public domain W3C validator