Theorem hof2val 18445

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 18444	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩(2nd ‘𝑀)⟨𝑍, 𝑊⟩) = (𝑓 ∈ (𝑍𝐻𝑋), 𝑔 ∈ (𝑌𝐻𝑊) ↦ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓))))
11		simplrr 790	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑔 = 𝐺)
12	11	oveq1d 7445	. . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → (𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ))
13		simplrl 789	. . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝐹)
14	12, 13	oveq12d 7448	. . 3 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓) = ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹))
15	14	mpteq2dva 5201	. 2 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝑓)) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)))
16		hof2.f	. 2 ⊢ (𝜑 → 𝐹 ∈ (𝑍𝐻𝑋))
17		hof2.g	. 2 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑊))
18		ovex 7463	. . . 4 ⊢ (𝑋𝐻𝑌) ∈ V
19	18	mptex 7239	. . 3 ⊢ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)) ∈ V
20	19	a1i 11	. 2 ⊢ (𝜑 → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)) ∈ V)
21	10, 15, 16, 17, 20	ovmpod 7582	1 ⊢ (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(2nd ‘𝑀)⟨𝑍, 𝑊⟩)𝐺) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌⟩ · 𝑊)ℎ)(⟨𝑍, 𝑋⟩ · 𝑊)𝐹)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838   ↦ cmpt 5189  ‘cfv 6547  (class class class)co 7430  2^nd c2nd 8010  Basecbs 17402  Hom chom 17454  compcco 17455  Catccat 17853  Hom_Fchof 18437

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8011  df-2nd 8012  df-hof 18439

This theorem is used by:  hof2  18446  hofcllem  18447  hofcl  18448  yonedalem3b  18468