Theorem hof2val 18208

Description: The morphism part of the Hom functor, for morphisms ⟨𝑓, 𝑔⟩:⟨𝑋, 𝑌⟩⟶⟨𝑍, 𝑊⟩ (which since the first argument is contravariant means morphisms 𝑓:𝑍⟶𝑋 and 𝑔:𝑌⟶𝑊), yields a function (a morphism of SetCat) mapping ℎ:𝑋⟶𝑌 to 𝑔 ∘ ℎ ∘ 𝑓:𝑍⟶𝑊. (Contributed by Mario Carneiro, 15-Jan-2017.)

Hypotheses

Ref	Expression
hofval.m	⊢ 𝑀 = (HomF‘𝐶)
hofval.c	⊢ (𝜑 → 𝐶 ∈ Cat)
hof1.b	⊢ 𝐵 = (Base‘𝐶)
hof1.h	⊢ 𝐻 = (Hom ‘𝐶)
hof1.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
hof1.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
hof2.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)
hof2.w	⊢ (𝜑 → 𝑊 ∈ 𝐵)
hof2.o	⊢ · = (comp‘𝐶)
hof2.f	⊢ (𝜑 → 𝐹 ∈ (𝑍𝐻𝑋))
hof2.g	⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑊))

Assertion

Ref	Expression
hof2val	⊢ (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(2nd ‘𝑀)⟨𝑍, 𝑊⟩)𝐺) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)))

Distinct variable groups:   𝐵,ℎ   ℎ,𝐹   ℎ,𝐺   𝜑,ℎ   𝐶,ℎ   ℎ,𝐻   ℎ,𝑊   · ,ℎ   ℎ,𝑋   ℎ,𝑌   ℎ,𝑍

Allowed substitution hint:   𝑀(ℎ)

Proof of Theorem hof2val

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

Step	Hyp	Ref	Expression
1		hofval.m	. . 3 ⊢ 𝑀 = (HomF‘𝐶)
2		hofval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
3		hof1.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
4		hof1.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
5		hof1.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		hof1.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
7		hof2.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
8		hof2.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ 𝐵)
9		hof2.o	. . 3 ⊢ · = (comp‘𝐶)
10	1, 2, 3, 4, 5, 6, 7, 8, 9	hof2fval 18207	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(2nd ‘𝑀)⟨𝑍, 𝑊⟩) = (𝑓 ∈ (𝑍𝐻𝑋), 𝑔 ∈ (𝑌𝐻𝑊) ↦ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓))))
11		simplrr 776	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑔 = 𝐺)
12	11	oveq1d 7423	. . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → (𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ))
13		simplrl 775	. . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝐹)
14	12, 13	oveq12d 7426	. . 3 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓) = ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹))
15	14	mpteq2dva 5248	. 2 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓)) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)))
16		hof2.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑍𝐻𝑋))
17		hof2.g	. 2 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑊))
18		ovex 7441	. . . 4 ⊢ (𝑋𝐻𝑌) ∈ V
19	18	mptex 7224	. . 3 ⊢ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)) ∈ V
20	19	a1i 11	. 2 ⊢ (𝜑 → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)) ∈ V)
21	10, 15, 16, 17, 20	ovmpod 7559	1 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(2nd ‘𝑀)⟨𝑍, 𝑊⟩)𝐺) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3474  ⟨cop 4634   ↦ cmpt 5231  ‘cfv 6543  (class class class)co 7408  2^nd c2nd 7973  Basecbs 17143  Hom chom 17207  compcco 17208  Catccat 17607  Hom_Fchof 18200

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7974  df-2nd 7975  df-hof 18202

This theorem is referenced by:  hof2  18209  hofcllem  18210  hofcl  18211  yonedalem3b  18231