Theorem comfffval2 16746

Description: Value of the functionalized composition operation. (Contributed by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
comfffval2.o	⊢ 𝑂 = (compf‘𝐶)
comfffval2.b	⊢ 𝐵 = (Base‘𝐶)
comfffval2.h	⊢ 𝐻 = (Homf ‘𝐶)
comfffval2.x	⊢ · = (comp‘𝐶)

Assertion

Ref	Expression
comfffval2	⊢ 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑦), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))

Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝐵   𝐶,𝑓,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥

Allowed substitution hints:   · (𝑦)   𝐻(𝑥,𝑦,𝑓,𝑔)   𝑂(𝑥,𝑦,𝑓,𝑔)

Proof of Theorem comfffval2

Step	Hyp	Ref	Expression
1		comfffval2.o	. . 3 ⊢ 𝑂 = (compf‘𝐶)
2		comfffval2.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
3		eqid 2778	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
4		comfffval2.x	. . 3 ⊢ · = (comp‘𝐶)
5	1, 2, 3, 4	comfffval 16743	. 2 ⊢ 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
6		comfffval2.h	. . . . 5 ⊢ 𝐻 = (Homf ‘𝐶)
7		xp2nd 7478	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 × 𝐵) → (2nd ‘𝑥) ∈ 𝐵)
8	7	adantr 474	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (2nd ‘𝑥) ∈ 𝐵)
9		simpr 479	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
10	6, 2, 3, 8, 9	homfval 16737	. . . 4 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → ((2nd ‘𝑥)𝐻𝑦) = ((2nd ‘𝑥)(Hom ‘𝐶)𝑦))
11		xp1st 7477	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 × 𝐵) → (1st ‘𝑥) ∈ 𝐵)
12	11	adantr 474	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (1st ‘𝑥) ∈ 𝐵)
13	6, 2, 3, 12, 8	homfval 16737	. . . . . 6 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → ((1st ‘𝑥)𝐻(2nd ‘𝑥)) = ((1st ‘𝑥)(Hom ‘𝐶)(2nd ‘𝑥)))
14		df-ov 6925	. . . . . 6 ⊢ ((1st ‘𝑥)𝐻(2nd ‘𝑥)) = (𝐻‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
15		df-ov 6925	. . . . . 6 ⊢ ((1st ‘𝑥)(Hom ‘𝐶)(2nd ‘𝑥)) = ((Hom ‘𝐶)‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
16	13, 14, 15	3eqtr3g 2837	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝐻‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩) = ((Hom ‘𝐶)‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩))
17		1st2nd2 7484	. . . . . . 7 ⊢ (𝑥 ∈ (𝐵 × 𝐵) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
18	17	adantr 474	. . . . . 6 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
19	18	fveq2d 6450	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝐻‘𝑥) = (𝐻‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩))
20	18	fveq2d 6450	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → ((Hom ‘𝐶)‘𝑥) = ((Hom ‘𝐶)‘⟨(1st ‘𝑥), (2nd ‘𝑥)⟩))
21	16, 19, 20	3eqtr4d 2824	. . . 4 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝐻‘𝑥) = ((Hom ‘𝐶)‘𝑥))
22		eqidd 2779	. . . 4 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑔(𝑥 · 𝑦)𝑓) = (𝑔(𝑥 · 𝑦)𝑓))
23	10, 21, 22	mpt2eq123dv 6994	. . 3 ⊢ ((𝑥 ∈ (𝐵 × 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑦), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)) = (𝑔 ∈ ((2nd ‘𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
24	23	mpt2eq3ia 6997	. 2 ⊢ (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑦), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓))) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)(Hom ‘𝐶)𝑦), 𝑓 ∈ ((Hom ‘𝐶)‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))
25	5, 24	eqtr4i 2805	1 ⊢ 𝑂 = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ 𝐵 ↦ (𝑔 ∈ ((2nd ‘𝑥)𝐻𝑦), 𝑓 ∈ (𝐻‘𝑥) ↦ (𝑔(𝑥 · 𝑦)𝑓)))

Syntax hints:   ∧ wa 386   = wceq 1601   ∈ wcel 2107  ⟨cop 4404   × cxp 5353  ‘cfv 6135  (class class class)co 6922   ↦ cmpt2 6924  1^st c1st 7443  2^nd c2nd 7444  Basecbs 16255  Hom chom 16349  compcco 16350  Hom_f chomf 16712  comp_fccomf 16713

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5006  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-iun 4755  df-br 4887  df-opab 4949  df-mpt 4966  df-id 5261  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367  df-ima 5368  df-iota 6099  df-fun 6137  df-fn 6138  df-f 6139  df-f1 6140  df-fo 6141  df-f1o 6142  df-fv 6143  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-1st 7445  df-2nd 7446  df-homf 16716  df-comf 16717

This theorem is referenced by: (None)