Theorem cofuval 17642

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 17620	. . 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 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑔 = 𝐺)
4	3	fveq2d 6808	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1st ‘𝑔) = (1st ‘𝐺))
5		simprr 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
6	5	fveq2d 6808	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (1st ‘𝑓) = (1st ‘𝐹))
7	4, 6	coeq12d 5786	. . 3 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑔) ∘ (1st ‘𝑓)) = ((1st ‘𝐺) ∘ (1st ‘𝐹)))
8	5	fveq2d 6808	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑓) = (2nd ‘𝐹))
9	8	dmeqd 5827	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝑓) = dom (2nd ‘𝐹))
10		cofuval.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐶)
11		relfunc 17622	. . . . . . . . . . 11 ⊢ Rel (𝐶 Func 𝐷)
12		cofuval.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
13		1st2ndbr 7915	. . . . . . . . . . 11 ⊢ ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
14	11, 12, 13	sylancr 588	. . . . . . . . . 10 ⊢ (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
15	10, 14	funcfn2 17629	. . . . . . . . 9 ⊢ (𝜑 → (2nd ‘𝐹) Fn (𝐵 × 𝐵))
16	15	fndmd 6569	. . . . . . . 8 ⊢ (𝜑 → dom (2nd ‘𝐹) = (𝐵 × 𝐵))
17	16	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝐹) = (𝐵 × 𝐵))
18	9, 17	eqtrd 2776	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom (2nd ‘𝑓) = (𝐵 × 𝐵))
19	18	dmeqd 5827	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom dom (2nd ‘𝑓) = dom (𝐵 × 𝐵))
20		dmxpid 5851	. . . . 5 ⊢ dom (𝐵 × 𝐵) = 𝐵
21	19, 20	eqtrdi 2792	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → dom dom (2nd ‘𝑓) = 𝐵)
22	3	fveq2d 6808	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (2nd ‘𝑔) = (2nd ‘𝐺))
23	6	fveq1d 6806	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
24	6	fveq1d 6806	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((1st ‘𝑓)‘𝑦) = ((1st ‘𝐹)‘𝑦))
25	22, 23, 24	oveq123d 7328	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) = (((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)))
26	8	oveqd 7324	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝑥(2nd ‘𝑓)𝑦) = (𝑥(2nd ‘𝐹)𝑦))
27	25, 26	coeq12d 5786	. . . 4 ⊢ ((𝜑 ∧ (𝑔 = 𝐺 ∧ 𝑓 = 𝐹)) → ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)) = ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))
28	21, 21, 27	mpoeq123dv 7382	. . 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 3457	. 2 ⊢ (𝜑 → 𝐺 ∈ V)
32	12	elexd 3457	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
33		opex 5392	. . 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 7457	1 ⊢ (𝜑 → (𝐺 ∘func 𝐹) = ⟨((1st ‘𝐺) ∘ (1st ‘𝐹)), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((((1st ‘𝐹)‘𝑥)(2nd ‘𝐺)((1st ‘𝐹)‘𝑦)) ∘ (𝑥(2nd ‘𝐹)𝑦)))⟩)

Syntax hints:   → wi 4   ∧ wa 397   = wceq 1539   ∈ wcel 2104  Vcvv 3437  ⟨cop 4571   class class class wbr 5081   × cxp 5598  dom cdm 5600   ∘ ccom 5604  Rel wrel 5605  ‘cfv 6458  (class class class)co 7307   ∈ cmpo 7309  1^st c1st 7861  2^nd c2nd 7862  Basecbs 16957   Func cfunc 17614   ∘_func ccofu 17616

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-rep 5218  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3287  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-iun 4933  df-br 5082  df-opab 5144  df-mpt 5165  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-fv 6466  df-ov 7310  df-oprab 7311  df-mpo 7312  df-1st 7863  df-2nd 7864  df-map 8648  df-ixp 8717  df-func 17618  df-cofu 17620

This theorem is referenced by:  cofu1st  17643  cofu2nd  17645  cofuval2  17647  cofucl  17648  cofuass  17649  cofulid  17650  cofurid  17651  prf1st  17966  prf2nd  17967