Theorem cofuval 17578

Description: Value of the composition of two functors. (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
cofuval.b	⊢ 𝐵 = (Base‘𝐶)
cofuval.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
cofuval.g	⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 𝐸))

Assertion

Ref	Expression
cofuval	⊢ (𝜑 → (𝐺 ∘func 𝐹) = ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩)

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦)   𝐸(𝑥,𝑦)

Proof of Theorem cofuval

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-cofu 17556	. . 3 ⊢ ∘func = (𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
2	1	a1i 11	. 2 ⊢ (𝜑 → ∘func = (𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩))
3		simprl 767	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑔 = 𝐺)
4	3	fveq2d 6772	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1st ‘𝑔) = (1st ‘𝐺))
5		simprr 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
6	5	fveq2d 6772	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1st ‘𝑓) = (1st ‘𝐹))
7	4, 6	coeq12d 5770	. . 3 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑔) ∘ (1st ‘𝑓)) = ((1st ‘𝐺) ∘ (1st ‘𝐹)))
8	5	fveq2d 6772	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑓) = (2nd ‘𝐹))
9	8	dmeqd 5811	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝑓) = dom (2nd ‘𝐹))
10		cofuval.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐶)
11		relfunc 17558	. . . . . . . . . . 11 ⊢ Rel (𝐶 Func 𝐷)
12		cofuval.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
13		1st2ndbr 7869	. . . . . . . . . . 11 ⊢ ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
14	11, 12, 13	sylancr 586	. . . . . . . . . 10 ⊢ (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
15	10, 14	funcfn2 17565	. . . . . . . . 9 ⊢ (𝜑 → (2nd ‘𝐹) Fn (𝐵 × 𝐵))
16	15	fndmd 6534	. . . . . . . 8 ⊢ (𝜑 → dom (2nd ‘𝐹) = (𝐵 × 𝐵))
17	16	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝐹) = (𝐵 × 𝐵))
18	9, 17	eqtrd 2779	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝑓) = (𝐵 × 𝐵))
19	18	dmeqd 5811	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom dom (2nd ‘𝑓) = dom (𝐵 × 𝐵))
20		dmxpid 5836	. . . . 5 ⊢ dom (𝐵 × 𝐵) = 𝐵
21	19, 20	eqtrdi 2795	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom dom (2nd ‘𝑓) = 𝐵)
22	3	fveq2d 6772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑔) = (2nd ‘𝐺))
23	6	fveq1d 6770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
24	6	fveq1d 6770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑓)‘𝑦) = ((1st ‘𝐹)‘𝑦))
25	22, 23, 24	oveq123d 7289	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) = (((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)))
26	8	oveqd 7285	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝑥(2nd ‘𝑓)𝑦) = (𝑥(2nd ‘𝐹)𝑦))
27	25, 26	coeq12d 5770	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)) = ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))
28	21, 21, 27	mpoeq123dv 7341	. . 3 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦))))
29	7, 28	opeq12d 4817	. 2 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ = ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩)
30		cofuval.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 𝐸))
31	30	elexd 3450	. 2 ⊢ (𝜑 → 𝐺 ∈ V)
32	12	elexd 3450	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
33		opex 5381	. . 3 ⊢ ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩ ∈ V
34	33	a1i 11	. 2 ⊢ (𝜑 → ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩ ∈ V)
35	2, 29, 31, 32, 34	ovmpod 7416	1 ⊢ (𝜑 → (𝐺 ∘func 𝐹) = ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2109  Vcvv 3430  ⟨cop 4572   class class class wbr 5078   × cxp 5586  dom cdm 5588   ∘ ccom 5592  Rel wrel 5593  ‘cfv 6430  (class class class)co 7268   ∈ cmpo 7270  1^st c1st 7815  2^nd c2nd 7816  Basecbs 16893   Func cfunc 17550   ∘_func ccofu 17552

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-ov 7271  df-oprab 7272  df-mpo 7273  df-1st 7817  df-2nd 7818  df-map 8591  df-ixp 8660  df-func 17554  df-cofu 17556

This theorem is referenced by:  cofu1st  17579  cofu2nd  17581  cofuval2  17583  cofucl  17584  cofuass  17585  cofulid  17586  cofurid  17587  prf1st  17902  prf2nd  17903