Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lanval Structured version   Visualization version   GIF version

Theorem lanval 50456
Description: Value of the set of left Kan extensions. (Contributed by Zhi Wang, 3-Nov-2025.)
Hypotheses
Ref Expression
lanval.r 𝑅 = (𝐷 FuncCat 𝐸)
lanval.s 𝑆 = (𝐶 FuncCat 𝐸)
lanval.f (𝜑𝐹 ∈ (𝐶 Func 𝐷))
lanval.x (𝜑𝑋 ∈ (𝐶 Func 𝐸))
lanval.k (𝜑 → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = 𝐾)
Assertion
Ref Expression
lanval (𝜑 → (𝐹(⟨𝐶, 𝐷⟩ Lan 𝐸)𝑋) = (𝐾(𝑅 UP 𝑆)𝑋))

Proof of Theorem lanval
Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lanval.r . . 3 𝑅 = (𝐷 FuncCat 𝐸)
2 lanval.s . . 3 𝑆 = (𝐶 FuncCat 𝐸)
3 lanval.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
43func1st2nd 49913 . . . 4 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
54funcrcl2 49916 . . 3 (𝜑𝐶 ∈ Cat)
64funcrcl3 49917 . . 3 (𝜑𝐷 ∈ Cat)
7 lanval.x . . . . 5 (𝜑𝑋 ∈ (𝐶 Func 𝐸))
87func1st2nd 49913 . . . 4 (𝜑 → (1st𝑋)(𝐶 Func 𝐸)(2nd𝑋))
98funcrcl3 49917 . . 3 (𝜑𝐸 ∈ Cat)
101, 2, 5, 6, 9lanfval 50450 . 2 (𝜑 → (⟨𝐶, 𝐷⟩ Lan 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ ((⟨𝐷, 𝐸⟩ −∘F 𝑓)(𝑅 UP 𝑆)𝑥)))
11 simprl 783 . . . . 5 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → 𝑓 = 𝐹)
1211oveq2d 7435 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → (⟨𝐷, 𝐸⟩ −∘F 𝑓) = (⟨𝐷, 𝐸⟩ −∘F 𝐹))
13 lanval.k . . . . 5 (𝜑 → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = 𝐾)
1413adantr 486 . . . 4 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = 𝐾)
1512, 14eqtrd 2800 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → (⟨𝐷, 𝐸⟩ −∘F 𝑓) = 𝐾)
16 simprr 785 . . 3 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → 𝑥 = 𝑋)
1715, 16oveq12d 7437 . 2 ((𝜑 ∧ (𝑓 = 𝐹𝑥 = 𝑋)) → ((⟨𝐷, 𝐸⟩ −∘F 𝑓)(𝑅 UP 𝑆)𝑥) = (𝐾(𝑅 UP 𝑆)𝑋))
18 ovexd 7454 . 2 (𝜑 → (𝐾(𝑅 UP 𝑆)𝑋) ∈ V)
1910, 17, 3, 7, 18ovmpod 7571 1 (𝜑 → (𝐹(⟨𝐶, 𝐷⟩ Lan 𝐸)𝑋) = (𝐾(𝑅 UP 𝑆)𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  cop 4597  cfv 6540  (class class class)co 7419  1st c1st 7990  2nd c2nd 7991  Catccat 17744   Func cfunc 17935   FuncCat cfuc 18026   UP cup 50010   −∘F cprcof 50210   Lan clan 50442
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-func 17939  df-lan 50444
This theorem is used by:  rellan  50460  islan  50462  lanval2  50464  lanup  50478
  Copyright terms: Public domain W3C validator