Theorem evlf2val 18443

Description: Value of the evaluation natural transformation at an object. (Contributed by Mario Carneiro, 12-Jan-2017.)

Hypotheses

Ref	Expression
evlfval.e	⊢ 𝐸 = (𝐶 evalF 𝐷)
evlfval.c	⊢ (𝜑 → 𝐶 ∈ Cat)
evlfval.d	⊢ (𝜑 → 𝐷 ∈ Cat)
evlfval.b	⊢ 𝐵 = (Base‘𝐶)
evlfval.h	⊢ 𝐻 = (Hom ‘𝐶)
evlfval.o	⊢ · = (comp‘𝐷)
evlfval.n	⊢ 𝑁 = (𝐶 Nat 𝐷)
evlf2.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
evlf2.g	⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐷))
evlf2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
evlf2.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
evlf2.l	⊢ 𝐿 = (⟨𝐹, 𝑋⟩(2nd ‘𝐸)⟨𝐺, 𝑌⟩)
evlf2val.a	⊢ (𝜑 → 𝐴 ∈ (𝐹𝑁𝐺))
evlf2val.k	⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))

Assertion

Ref	Expression
evlf2val	⊢ (𝜑 → (𝐴𝐿𝐾) = ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)))

Proof of Theorem evlf2val

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

Step	Hyp	Ref	Expression
1		evlfval.e	. . 3 ⊢ 𝐸 = (𝐶 evalF 𝐷)
2		evlfval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
3		evlfval.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
4		evlfval.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
5		evlfval.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
6		evlfval.o	. . 3 ⊢ · = (comp‘𝐷)
7		evlfval.n	. . 3 ⊢ 𝑁 = (𝐶 Nat 𝐷)
8		evlf2.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
9		evlf2.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ (𝐶 Func 𝐷))
10		evlf2.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11		evlf2.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
12		evlf2.l	. . 3 ⊢ 𝐿 = (⟨𝐹, 𝑋⟩(2nd ‘𝐸)⟨𝐺, 𝑌⟩)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	evlf2 18442	. 2 ⊢ (𝜑 → 𝐿 = (𝑎 ∈ (𝐹𝑁𝐺), 𝑔 ∈ (𝑋𝐻𝑌) ↦ ((𝑎‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝑔))))
14		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → 𝑎 = 𝐴)
15	14	fveq1d 6918	. . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → (𝑎‘𝑌) = (𝐴‘𝑌))
16		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → 𝑔 = 𝐾)
17	16	fveq2d 6920	. . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → ((𝑋(2nd ‘𝐹)𝑌)‘𝑔) = ((𝑋(2nd ‘𝐹)𝑌)‘𝐾))
18	15, 17	oveq12d 7469	. 2 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → ((𝑎‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝑔)) = ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)))
19		evlf2val.a	. 2 ⊢ (𝜑 → 𝐴 ∈ (𝐹𝑁𝐺))
20		evlf2val.k	. 2 ⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))
21		ovexd 7486	. 2 ⊢ (𝜑 → ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)) ∈ V)
22	13, 18, 19, 20, 21	ovmpod 7604	1 ⊢ (𝜑 → (𝐴𝐿𝐾) = ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840  ‘cfv 6566  (class class class)co 7451  1^st c1st 8033  2^nd c2nd 8034  Basecbs 17431  Hom chom 17483  compcco 17484  Catccat 17888   Func cfunc 18079   Nat cnat 18169   eval_F cevlf 18433

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-evlf 18437

This theorem is used by:  evlfcllem  18445  evlfcl  18446  uncf2  18461  yonedalem3b  18503