Theorem evlf2val 18154

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 18153	. 2 ⊢ (𝜑 → 𝐿 = (𝑎 ∈ (𝐹𝑁𝐺), 𝑔 ∈ (𝑋𝐻𝑌) ↦ ((𝑎‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝑔))))
14		simprl 771	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → 𝑎 = 𝐴)
15	14	fveq1d 6844	. . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → (𝑎‘𝑌) = (𝐴‘𝑌))
16		simprr 773	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → 𝑔 = 𝐾)
17	16	fveq2d 6846	. . 3 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → ((𝑋(2nd ‘𝐹)𝑌)‘𝑔) = ((𝑋(2nd ‘𝐹)𝑌)‘𝐾))
18	15, 17	oveq12d 7386	. 2 ⊢ ((𝜑 ∧ (𝑎 = 𝐴 ∧ 𝑔 = 𝐾)) → ((𝑎‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝑔)) = ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)))
19		evlf2val.a	. 2 ⊢ (𝜑 → 𝐴 ∈ (𝐹𝑁𝐺))
20		evlf2val.k	. 2 ⊢ (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))
21		ovexd 7403	. 2 ⊢ (𝜑 → ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)) ∈ V)
22	13, 18, 19, 20, 21	ovmpod 7520	1 ⊢ (𝜑 → (𝐴𝐿𝐾) = ((𝐴‘𝑌)(⟨((1st ‘𝐹)‘𝑋), ((1st ‘𝐹)‘𝑌)⟩ · ((1st ‘𝐺)‘𝑌))((𝑋(2nd ‘𝐹)𝑌)‘𝐾)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3442  ⟨cop 4588  ‘cfv 6500  (class class class)co 7368  1^st c1st 7941  2^nd c2nd 7942  Basecbs 17148  Hom chom 17200  compcco 17201  Catccat 17599   Func cfunc 17790   Nat cnat 17880   eval_F cevlf 18144

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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-evlf 18148

This theorem is referenced by:  evlfcllem  18156  evlfcl  18157  uncf2  18172  yonedalem3b  18214