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

Theorem hof2val 18270
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 18269 . 2 (𝜑 → (⟨𝑋, 𝑌⟩(2nd𝑀)⟨𝑍, 𝑊⟩) = (𝑓 ∈ (𝑍𝐻𝑋), 𝑔 ∈ (𝑌𝐻𝑊) ↦ ( ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓))))
11 simplrr 777 . . . . 5 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → 𝑔 = 𝐺)
1211oveq1d 7427 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → (𝑔(⟨𝑋, 𝑌· 𝑊)) = (𝐺(⟨𝑋, 𝑌· 𝑊)))
13 simplrl 776 . . . 4 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝐹)
1412, 13oveq12d 7430 . . 3 (((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) ∧ ∈ (𝑋𝐻𝑌)) → ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓) = ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹))
1514mpteq2dva 5222 . 2 ((𝜑 ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → ( ∈ (𝑋𝐻𝑌) ↦ ((𝑔(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝑓)) = ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)))
16 hof2.f . 2 (𝜑𝐹 ∈ (𝑍𝐻𝑋))
17 hof2.g . 2 (𝜑𝐺 ∈ (𝑌𝐻𝑊))
18 ovex 7445 . . . 4 (𝑋𝐻𝑌) ∈ V
1918mptex 7224 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)) ∈ V
2019a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)) ∈ V)
2110, 15, 16, 17, 20ovmpod 7566 1 (𝜑 → (𝐹(⟨𝑋, 𝑌⟩(2nd𝑀)⟨𝑍, 𝑊⟩)𝐺) = ( ∈ (𝑋𝐻𝑌) ↦ ((𝐺(⟨𝑋, 𝑌· 𝑊))(⟨𝑍, 𝑋· 𝑊)𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  Vcvv 3463  cop 4612  cmpt 5205  cfv 6540  (class class class)co 7412  2nd c2nd 7994  Basecbs 17228  Hom chom 17283  compcco 17284  Catccat 17677  HomFchof 18262
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412  ax-un 7736
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-id 5558  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6493  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7995  df-2nd 7996  df-hof 18264
This theorem is referenced by:  hof2  18271  hofcllem  18272  hofcl  18273  yonedalem3b  18293
  Copyright terms: Public domain W3C validator