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

Theorem hof2val 18222
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.
StepHypRef 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‘𝐶)
101, 2, 3, 4, 5, 6, 7, 8, 9hof2fval 18221 . 2 (𝜑 → (⟨𝑋, 𝑌⟩(2nd𝑀)⟨𝑍, 𝑊⟩) = (𝑓 ∈ (𝑍𝐻𝑋), 𝑔 ∈ (𝑌𝐻𝑊) ↦ ( ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓))))
11 simplrr 778 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → 𝑔 = 𝐺)
1211oveq1d 7382 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → (𝑔(⟨𝑋, 𝑌· 𝑊)) = (𝐺(⟨𝑋, 𝑌· 𝑊)))
13 simplrl 777 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝐹)
1412, 13oveq12d 7385 . . 3 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓) = ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹))
1514mpteq2dva 5178 . 2 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → ( ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓)) = ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)))
16 hof2.f . 2 (𝜑𝐹 ∈ (𝑍𝐻𝑋))
17 hof2.g . 2 (𝜑𝐺 ∈ (𝑌𝐻𝑊))
18 ovex 7400 . . . 4 (𝑋𝐻𝑌) ∈ V
1918mptex 7178 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)) ∈ V
2019a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)) ∈ V)
2110, 15, 16, 17, 20ovmpod 7519 1 (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(2nd𝑀)⟨𝑍, 𝑊⟩)𝐺) = ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3429  cop 4573  cmpt 5166  cfv 6498  (class class class)co 7367  2nd c2nd 7941  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17630  HomFchof 18214
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-hof 18216
This theorem is referenced by:  hof2  18223  hofcllem  18224  hofcl  18225  yonedalem3b  18245
  Copyright terms: Public domain W3C validator