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

Theorem cofuass 18096
Description: Functor composition is associative. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
cofuass.g (𝜑 → 𝐺 ∈ (𝐶 Func 𝐷))
cofuass.h (𝜑 → 𝐻 ∈ (𝐷 Func 𝐸))
cofuass.k (𝜑 → 𝐾 ∈ (𝐸 Func 𝐹))
Assertion
Ref Expression
cofuass (𝜑 → ((𝐾 ∘func 𝐻) ∘func 𝐺) = (𝐾 ∘func (𝐻 ∘func 𝐺)))

Proof of Theorem cofuass
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 coass 6285 . . . 4 (((1st ‘𝐾) ∘ (1st ‘𝐻)) ∘ (1st ‘𝐺)) = ((1st ‘𝐾) ∘ ((1st ‘𝐻) ∘ (1st ‘𝐺)))
2 eqid 2763 . . . . . 6 (Base‘𝐷) = (Base‘𝐷)
3 cofuass.h . . . . . 6 (𝜑 → 𝐻 ∈ (𝐷 Func 𝐸))
4 cofuass.k . . . . . 6 (𝜑 → 𝐾 ∈ (𝐸 Func 𝐹))
52, 3, 4cofu1st 18090 . . . . 5 (𝜑 → (1st ‘(𝐾 ∘func 𝐻)) = ((1st ‘𝐾) ∘ (1st ‘𝐻)))
65coeq1d 5846 . . . 4 (𝜑 → ((1st ‘(𝐾 ∘func 𝐻)) ∘ (1st ‘𝐺)) = (((1st ‘𝐾) ∘ (1st ‘𝐻)) ∘ (1st ‘𝐺)))
7 eqid 2763 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
8 cofuass.g . . . . . 6 (𝜑 → 𝐺 ∈ (𝐶 Func 𝐷))
97, 8, 3cofu1st 18090 . . . . 5 (𝜑 → (1st ‘(𝐻 ∘func 𝐺)) = ((1st ‘𝐻) ∘ (1st ‘𝐺)))
109coeq2d 5847 . . . 4 (𝜑 → ((1st ‘𝐾) ∘ (1st ‘(𝐻 ∘func 𝐺))) = ((1st ‘𝐾) ∘ ((1st ‘𝐻) ∘ (1st ‘𝐺))))
111, 6, 103eqtr4a 2824 . . 3 (𝜑 → ((1st ‘(𝐾 ∘func 𝐻)) ∘ (1st ‘𝐺)) = ((1st ‘𝐾) ∘ (1st ‘(𝐻 ∘func 𝐺))))
12 coass 6285 . . . . 5 (((((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))) ∘ (((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦))) ∘ (𝑥(2nd ‘𝐺)𝑦)) = ((((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))) ∘ ((((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)))
1333ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → 𝐻 ∈ (𝐷 Func 𝐸))
1443ad2ant1 1151 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → 𝐾 ∈ (𝐸 Func 𝐹))
15 relfunc 18069 . . . . . . . . . . 11 Rel (𝐶 Func 𝐷)
16 1st2ndbr 8080 . . . . . . . . . . 11 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐺)(𝐶 Func 𝐷)(2nd ‘𝐺))
1715, 8, 16sylancr 599 . . . . . . . . . 10 (𝜑 → (1st ‘𝐺)(𝐶 Func 𝐷)(2nd ‘𝐺))
18173ad2ant1 1151 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (1st ‘𝐺)(𝐶 Func 𝐷)(2nd ‘𝐺))
197, 2, 18funcf1 18073 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (1st ‘𝐺):(Base‘𝐶)⟶(Base‘𝐷))
20 simp2 1155 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → 𝑥 ∈ (Base‘𝐶))
2119, 20ffvelcdmd 7112 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((1st ‘𝐺)‘𝑥) ∈ (Base‘𝐷))
22 simp3 1156 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → 𝑦 ∈ (Base‘𝐶))
2319, 22ffvelcdmd 7112 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((1st ‘𝐺)‘𝑦) ∈ (Base‘𝐷))
242, 13, 14, 21, 23cofu2nd 18092 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) = ((((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))) ∘ (((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦))))
2524coeq1d 5846 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)) = (((((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))) ∘ (((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦))) ∘ (𝑥(2nd ‘𝐺)𝑦)))
2683ad2ant1 1151 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → 𝐺 ∈ (𝐶 Func 𝐷))
277, 26, 13, 20cofu1 18091 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((1st ‘(𝐻 ∘func 𝐺))‘𝑥) = ((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥)))
287, 26, 13, 22cofu1 18091 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((1st ‘(𝐻 ∘func 𝐺))‘𝑦) = ((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦)))
2927, 28oveq12d 7464 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) = (((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))))
307, 26, 13, 20, 22cofu2nd 18092 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦) = ((((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)))
3129, 30coeq12d 5849 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) ∘ (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦)) = ((((1st ‘𝐻)‘((1st ‘𝐺)‘𝑥))(2nd ‘𝐾)((1st ‘𝐻)‘((1st ‘𝐺)‘𝑦))) ∘ ((((1st ‘𝐺)‘𝑥)(2nd ‘𝐻)((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦))))
3212, 25, 313eqtr4a 2824 . . . 4 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶)) → ((((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)) = ((((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) ∘ (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦)))
3332mpoeq3dva 7523 . . 3 (𝜑 → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) ∘ (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦))))
3411, 33opeq12d 4851 . 2 (𝜑 → ⟨((1st ‘(𝐾 ∘func 𝐻)) ∘ (1st ‘𝐺)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)))⟩ = ⟨((1st ‘𝐾) ∘ (1st ‘(𝐻 ∘func 𝐺))), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) ∘ (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦)))⟩)
353, 4cofucl 18095 . . 3 (𝜑 → (𝐾 ∘func 𝐻) ∈ (𝐷 Func 𝐹))
367, 8, 35cofuval 18089 . 2 (𝜑 → ((𝐾 ∘func 𝐻) ∘func 𝐺) = ⟨((1st ‘(𝐾 ∘func 𝐻)) ∘ (1st ‘𝐺)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘𝐺)‘𝑥)(2nd ‘(𝐾 ∘func 𝐻))((1st ‘𝐺)‘𝑦)) ∘ (𝑥(2nd ‘𝐺)𝑦)))⟩)
378, 3cofucl 18095 . . 3 (𝜑 → (𝐻 ∘func 𝐺) ∈ (𝐶 Func 𝐸))
387, 37, 4cofuval 18089 . 2 (𝜑 → (𝐾 ∘func (𝐻 ∘func 𝐺)) = ⟨((1st ‘𝐾) ∘ (1st ‘(𝐻 ∘func 𝐺))), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((((1st ‘(𝐻 ∘func 𝐺))‘𝑥)(2nd ‘𝐾)((1st ‘(𝐻 ∘func 𝐺))‘𝑦)) ∘ (𝑥(2nd ‘(𝐻 ∘func 𝐺))𝑦)))⟩)
3934, 36, 383eqtr4d 2808 1 (𝜑 → ((𝐾 ∘func 𝐻) ∘func 𝐺) = (𝐾 ∘func (𝐻 ∘func 𝐺)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ⟨cop 4838   class class class wbr 5106   ∘ ccom 5660  Rel wrel 5661  ‘cfv 6561  (class class class)co 7446   ∈ cmpo 7448  1st c1st 8026  2nd c2nd 8027  Basecbs 17419   Func cfunc 18061   ∘func ccofu 18063
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-map 8880  df-ixp 8957  df-cat 17874  df-cid 17875  df-func 18065  df-cofu 18067
This theorem is used by:  catccatid  18313  uobeqw  50550
  Copyright terms: Public domain W3C validator