![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > hof2val | Structured version Visualization version GIF version |
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.) |
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 | ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑊)) |
Ref | Expression |
---|---|
hof2val | ⊢ (𝜑 → (𝐹(〈𝑋, 𝑌〉(2nd ‘𝑀)〈𝑍, 𝑊〉)𝐺) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹))) |
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 18282 | . 2 ⊢ (𝜑 → (〈𝑋, 𝑌〉(2nd ‘𝑀)〈𝑍, 𝑊〉) = (𝑓 ∈ (𝑍𝐻𝑋), 𝑔 ∈ (𝑌𝐻𝑊) ↦ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝑓)))) |
11 | simplrr 776 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑔 = 𝐺) | |
12 | 11 | oveq1d 7441 | . . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → (𝑔(〈𝑋, 𝑌〉 · 𝑊)ℎ) = (𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)) |
13 | simplrl 775 | . . . 4 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝐹) | |
14 | 12, 13 | oveq12d 7444 | . . 3 ⊢ (((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) ∧ ℎ ∈ (𝑋𝐻𝑌)) → ((𝑔(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝑓) = ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹)) |
15 | 14 | mpteq2dva 5255 | . 2 ⊢ ((𝜑 ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝑔(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝑓)) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹))) |
16 | hof2.f | . 2 ⊢ (𝜑 → 𝐹 ∈ (𝑍𝐻𝑋)) | |
17 | hof2.g | . 2 ⊢ (𝜑 → 𝐺 ∈ (𝑌𝐻𝑊)) | |
18 | ovex 7459 | . . . 4 ⊢ (𝑋𝐻𝑌) ∈ V | |
19 | 18 | mptex 7242 | . . 3 ⊢ (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹)) ∈ V |
20 | 19 | a1i 11 | . 2 ⊢ (𝜑 → (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹)) ∈ V) |
21 | 10, 15, 16, 17, 20 | ovmpod 7580 | 1 ⊢ (𝜑 → (𝐹(〈𝑋, 𝑌〉(2nd ‘𝑀)〈𝑍, 𝑊〉)𝐺) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ((𝐺(〈𝑋, 𝑌〉 · 𝑊)ℎ)(〈𝑍, 𝑋〉 · 𝑊)𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1534 ∈ wcel 2099 Vcvv 3462 〈cop 4639 ↦ cmpt 5238 ‘cfv 6556 (class class class)co 7426 2nd c2nd 8004 Basecbs 17215 Hom chom 17279 compcco 17280 Catccat 17679 HomFchof 18275 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5292 ax-sep 5306 ax-nul 5313 ax-pow 5371 ax-pr 5435 ax-un 7748 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4916 df-iun 5005 df-br 5156 df-opab 5218 df-mpt 5239 df-id 5582 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6508 df-fun 6558 df-fn 6559 df-f 6560 df-f1 6561 df-fo 6562 df-f1o 6563 df-fv 6564 df-ov 7429 df-oprab 7430 df-mpo 7431 df-1st 8005 df-2nd 8006 df-hof 18277 |
This theorem is referenced by: hof2 18284 hofcllem 18285 hofcl 18286 yonedalem3b 18306 |
Copyright terms: Public domain | W3C validator |