Theorem evlf2val 17681

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

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1543   ∈ wcel 2112  Vcvv 3398  ⟨cop 4533  ‘cfv 6358  (class class class)co 7191  1^st c1st 7737  2^nd c2nd 7738  Basecbs 16666  Hom chom 16760  compcco 16761  Catccat 17121   Func cfunc 17314   Nat cnat 17402   eval_F cevlf 17671

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-1st 7739  df-2nd 7740  df-evlf 17675

This theorem is referenced by:  evlfcllem  17683  evlfcl  17684  uncf2  17699  yonedalem3b  17741