hofval - Metamath Proof Explorer

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

Theorem hofval 16892

Description: Value of the Hom functor, which is a bifunctor (a functor of two arguments), contravariant in the first argument and covariant in the second, from (oppCat‘𝐶) × 𝐶 to SetCat, whose object part is the hom-function Hom, and with morphism part given by pre- and post-composition. (Contributed by Mario Carneiro, 15-Jan-2017.)

**Hypotheses**
Ref	Expression
hofval.m	⊢ 𝑀 = (Hom_F‘𝐶)
hofval.c	⊢ (𝜑 → 𝐶 ∈ Cat)
hofval.b	⊢ 𝐵 = (Base‘𝐶)
hofval.h	⊢ 𝐻 = (Hom ‘𝐶)
hofval.o	⊢ · = (comp‘𝐶)

**Assertion**
Ref	Expression
hofval	⊢ (𝜑 → 𝑀 = ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩)

Distinct variable groups: 𝑓,𝑔,ℎ,𝑥,𝑦,𝐵 𝜑,𝑓,𝑔,ℎ,𝑥,𝑦 𝐶,𝑓,𝑔,ℎ,𝑥,𝑦 𝑓,𝐻,𝑔,ℎ,𝑥,𝑦 · ,𝑓,𝑔,ℎ,𝑥,𝑦 Allowed substitution hints: 𝑀(𝑥,𝑦,𝑓,𝑔,ℎ)

Proof of Theorem hofval Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hofval.m	. 2 ⊢ 𝑀 = (Hom_F‘𝐶)
2		df-hof 16890	. . . 4 ⊢ Hom_F = (𝑐 ∈ Cat ↦ ⟨(Hom_f ‘𝑐), ⦋(Base‘𝑐) / 𝑏⦌(𝑥 ∈ (𝑏 × 𝑏), 𝑦 ∈ (𝑏 × 𝑏) ↦ (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓))))⟩)
3	2	a1i 11	. . 3 ⊢ (𝜑 → Hom_F = (𝑐 ∈ Cat ↦ ⟨(Hom_f ‘𝑐), ⦋(Base‘𝑐) / 𝑏⦌(𝑥 ∈ (𝑏 × 𝑏), 𝑦 ∈ (𝑏 × 𝑏) ↦ (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓))))⟩))
4		simpr 477	. . . . 5 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → 𝑐 = 𝐶)
5	4	fveq2d 6195	. . . 4 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → (Hom_f ‘𝑐) = (Hom_f ‘𝐶))
6		fvexd 6203	. . . . 5 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → (Base‘𝑐) ∈ V)
7	4	fveq2d 6195	. . . . . 6 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → (Base‘𝑐) = (Base‘𝐶))
8		hofval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
9	7, 8	syl6eqr 2674	. . . . 5 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → (Base‘𝑐) = 𝐵)
10		simpr 477	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
11	10	sqxpeqd 5141	. . . . . 6 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (𝑏 × 𝑏) = (𝐵 × 𝐵))
12		simplr 792	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
13	12	fveq2d 6195	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = (Hom ‘𝐶))
14		hofval.h	. . . . . . . . 9 ⊢ 𝐻 = (Hom ‘𝐶)
15	13, 14	syl6eqr 2674	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = 𝐻)
16	15	oveqd 6667	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)) = ((1^st ‘𝑦)𝐻(1^st ‘𝑥)))
17	15	oveqd 6667	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) = ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)))
18	15	fveq1d 6193	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → ((Hom ‘𝑐)‘𝑥) = (𝐻‘𝑥))
19	12	fveq2d 6195	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (comp‘𝑐) = (comp‘𝐶))
20		hofval.o	. . . . . . . . . . 11 ⊢ · = (comp‘𝐶)
21	19, 20	syl6eqr 2674	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (comp‘𝑐) = · )
22	21	oveqd 6667	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦)) = (⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦)))
23	21	oveqd 6667	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (𝑥(comp‘𝑐)(2^nd ‘𝑦)) = (𝑥 · (2^nd ‘𝑦)))
24	23	oveqd 6667	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ) = (𝑔(𝑥 · (2^nd ‘𝑦))ℎ))
25		eqidd 2623	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → 𝑓 = 𝑓)
26	22, 24, 25	oveq123d 6671	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓) = ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))
27	18, 26	mpteq12dv 4733	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓)) = (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓)))
28	16, 17, 27	mpt2eq123dv 6717	. . . . . 6 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓))) = (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))
29	11, 11, 28	mpt2eq123dv 6717	. . . . 5 ⊢ (((𝜑 ∧ 𝑐 = 𝐶) ∧ 𝑏 = 𝐵) → (𝑥 ∈ (𝑏 × 𝑏), 𝑦 ∈ (𝑏 × 𝑏) ↦ (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓)))) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓)))))
30	6, 9, 29	csbied2 3561	. . . 4 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → ⦋(Base‘𝑐) / 𝑏⦌(𝑥 ∈ (𝑏 × 𝑏), 𝑦 ∈ (𝑏 × 𝑏) ↦ (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓)))) = (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓)))))
31	5, 30	opeq12d 4410	. . 3 ⊢ ((𝜑 ∧ 𝑐 = 𝐶) → ⟨(Hom_f ‘𝑐), ⦋(Base‘𝑐) / 𝑏⦌(𝑥 ∈ (𝑏 × 𝑏), 𝑦 ∈ (𝑏 × 𝑏) ↦ (𝑓 ∈ ((1^st ‘𝑦)(Hom ‘𝑐)(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)(Hom ‘𝑐)(2^nd ‘𝑦)) ↦ (ℎ ∈ ((Hom ‘𝑐)‘𝑥) ↦ ((𝑔(𝑥(comp‘𝑐)(2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩(comp‘𝑐)(2^nd ‘𝑦))𝑓))))⟩ = ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩)
32		hofval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
33		opex 4932	. . . 4 ⊢ ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩ ∈ V
34	33	a1i 11	. . 3 ⊢ (𝜑 → ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩ ∈ V)
35	3, 31, 32, 34	fvmptd 6288	. 2 ⊢ (𝜑 → (Hom_F‘𝐶) = ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩)
36	1, 35	syl5eq 2668	1 ⊢ (𝜑 → 𝑀 = ⟨(Hom_f ‘𝐶), (𝑥 ∈ (𝐵 × 𝐵), 𝑦 ∈ (𝐵 × 𝐵) ↦ (𝑓 ∈ ((1^st ‘𝑦)𝐻(1^st ‘𝑥)), 𝑔 ∈ ((2^nd ‘𝑥)𝐻(2^nd ‘𝑦)) ↦ (ℎ ∈ (𝐻‘𝑥) ↦ ((𝑔(𝑥 · (2^nd ‘𝑦))ℎ)(⟨(1^st ‘𝑦), (1^st ‘𝑥)⟩ · (2^nd ‘𝑦))𝑓))))⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ⦋csb 3533 ⟨cop 4183 ↦ cmpt 4729 × cxp 5112 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 1^st c1st 7166 2^nd c2nd 7167 Basecbs 15857 Hom chom 15952 compcco 15953 Catccat 16325 Hom_f chomf 16327 Hom_Fchof 16888

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-hof 16890

This theorem is referenced by: hof1fval 16893 hof2fval 16895 hofcl 16899 hofpropd 16907

W3C validator