Theorem cmdlan 50601

Description: To each colimit of a diagram there is a corresponding left Kan extention of the diagram along a functor to a terminal category. The morphism parts coincide, while the object parts are one-to-one correspondent (diag1f1o 50463). (Contributed by Zhi Wang, 26-Nov-2025.)

Hypotheses

Ref	Expression
lmdran.1	⊢ (𝜑 → 1 ∈ TermCat)
lmdran.g	⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 1 ))
lmdran.l	⊢ 𝐿 = (𝐶Δfunc 1 )
lmdran.y	⊢ (𝜑 → 𝑌 = ((1st ‘𝐿)‘𝑋))

Assertion

Ref	Expression
cmdlan	⊢ (𝜑 → (𝑋((𝐶 Colimit 𝐷)‘𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀))

Proof of Theorem cmdlan

Step	Hyp	Ref	Expression
1		cmdfval2 50585	. . 3 ⊢ ((𝐶 Colimit 𝐷)‘𝐹) = ((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)
2	1	breqi 5109	. 2 ⊢ (𝑋((𝐶 Colimit 𝐷)‘𝐹)𝑀 ↔ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
3		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
4	3	up1st2nd 50114	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋(⟨(1st ‘(𝐶Δfunc𝐷)), (2nd ‘(𝐶Δfunc𝐷))⟩(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
5		eqid 2760	. . . . . . 7 ⊢ (𝐷 FuncCat 𝐶) = (𝐷 FuncCat 𝐶)
6	5	fucbas 18055	. . . . . 6 ⊢ (𝐷 Func 𝐶) = (Base‘(𝐷 FuncCat 𝐶))
7	4, 6	uprcl3 50119	. . . . 5 ⊢ ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
8		eqid 2760	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
9	4, 8	uprcl4 50120	. . . . 5 ⊢ ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
10	7, 9	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
11		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
12	11	up1st2nd 50114	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌(⟨(1st ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺)), (2nd ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))⟩(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
13	12, 6	uprcl3 50119	. . . . 5 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
14		lmdran.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 = ((1st ‘𝐿)‘𝑋))
15	14	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 = ((1st ‘𝐿)‘𝑋))
16		eqid 2760	. . . . . . . . . . 11 ⊢ ( 1 FuncCat 𝐶) = ( 1 FuncCat 𝐶)
17	16	fucbas 18055	. . . . . . . . . 10 ⊢ ( 1 Func 𝐶) = (Base‘( 1 FuncCat 𝐶))
18	12, 17	uprcl4 50120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 ∈ ( 1 Func 𝐶))
19		relfunc 17954	. . . . . . . . 9 ⊢ Rel ( 1 Func 𝐶)
20	18, 19	oppfrcllem 50056	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 ≠ ∅)
21	15, 20	eqnetrrd 3023	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → ((1st ‘𝐿)‘𝑋) ≠ ∅)
22		fvfundmfvn0 6919	. . . . . . . 8 ⊢ (((1st ‘𝐿)‘𝑋) ≠ ∅ → (𝑋 ∈ dom (1st ‘𝐿) ∧ Fun ((1st ‘𝐿) ↾ {𝑋})))
23	22	simpld 500	. . . . . . 7 ⊢ (((1st ‘𝐿)‘𝑋) ≠ ∅ → 𝑋 ∈ dom (1st ‘𝐿))
24	21, 23	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ dom (1st ‘𝐿))
25		lmdran.1	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ TermCat)
26	25	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 1 ∈ TermCat)
27		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐹 ∈ (𝐷 Func 𝐶))
28	27	func1st2nd 50005	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐹)(𝐷 Func 𝐶)(2nd ‘𝐹))
29	28	funcrcl3 50009	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐶 ∈ Cat)
30		lmdran.l	. . . . . . . . . 10 ⊢ 𝐿 = (𝐶Δfunc 1 )
31	8, 26, 29, 30	diag1f1o 50463	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶))
32		f1of 6818	. . . . . . . . 9 ⊢ ((1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
33	31, 32	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
34	33	fdmd 6714	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → dom (1st ‘𝐿) = (Base‘𝐶))
35	13, 34	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → dom (1st ‘𝐿) = (Base‘𝐶))
36	24, 35	eleqtrd 2862	. . . . 5 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
37	13, 36	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
38	14	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑌 = ((1st ‘𝐿)‘𝑋))
39		eqid 2760	. . . . . 6 ⊢ (𝐶Δfunc𝐷) = (𝐶Δfunc𝐷)
40		lmdran.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 1 ))
41	40	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Func 1 ))
42	29	adantrr 730	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐶 ∈ Cat)
43		eqidd 2761	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺))
44	30, 39, 41, 42, 43	prcofdiag 50323	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ((⟨ 1 , 𝐶⟩ −∘F 𝐺) ∘func 𝐿) = (𝐶Δfunc𝐷))
45		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑋 ∈ (Base‘𝐶))
46	16, 42, 5, 41	prcoffunca 50315	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) ∈ (( 1 FuncCat 𝐶) Func (𝐷 FuncCat 𝐶)))
47	29, 26, 16, 30	diagffth 50467	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐿 ∈ ((𝐶 Full ( 1 FuncCat 𝐶)) ∩ (𝐶 Faith ( 1 FuncCat 𝐶))))
48	47	adantrr 730	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐿 ∈ ((𝐶 Full ( 1 FuncCat 𝐶)) ∩ (𝐶 Faith ( 1 FuncCat 𝐶))))
49		f1ofo 6826	. . . . . . 7 ⊢ ((1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶) → (1st ‘𝐿):(Base‘𝐶)–onto→( 1 Func 𝐶))
50	31, 49	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)–onto→( 1 Func 𝐶))
51	50	adantrr 730	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘𝐿):(Base‘𝐶)–onto→( 1 Func 𝐶))
52	8, 17, 38, 44, 45, 46, 48, 51	uptr2a 50151	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
53	10, 37, 52	bibiad 853	. . 3 ⊢ (𝜑 → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
54		eqid 2760	. . . . . 6 ⊢ (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺)
55	16, 5, 54	lanval2 50556	. . . . 5 ⊢ (𝐺 ∈ (𝐷 Func 1 ) → (𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹) = ((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹))
56	40, 55	syl 18	. . . 4 ⊢ (𝜑 → (𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹) = ((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹))
57	56	breqd 5114	. . 3 ⊢ (𝜑 → (𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
58	53, 57	bitr4d 285	. 2 ⊢ (𝜑 → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀))
59	2, 58	bitrid 286	1 ⊢ (𝜑 → (𝑋((𝐶 Colimit 𝐷)‘𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955   ∩ cin 3898  ∅c0 4279  {csn 4584  ⟨cop 4590   class class class wbr 5103  dom cdm 5655   ↾ cres 5657  Fun wfun 6527  ⟶wf 6529  –onto→wfo 6531  –1-1-onto→wf1o 6532  ‘cfv 6533  (class class class)co 7414  1^st c1st 7985  2^nd c2nd 7986  Basecbs 17304  Catccat 17755   Func cfunc 17946   Full cful 17996   Faith cfth 17997   FuncCat cfuc 18037  Δ_funccdiag 18303   UP cup 50102   −∘_F cprcof 50302  TermCatctermc 50401   Lan clan 50534   Colimit ccmd 50573

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-er 8699  df-map 8831  df-ixp 8908  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12532  df-z 12619  df-dec 12740  df-uz 12891  df-fz 13565  df-struct 17242  df-slot 17277  df-ndx 17289  df-base 17305  df-hom 17369  df-cco 17370  df-cat 17759  df-cid 17760  df-func 17950  df-cofu 17952  df-full 17998  df-fth 17999  df-nat 18038  df-fuc 18039  df-xpc 18263  df-1stf 18264  df-curf 18305  df-diag 18307  df-up 50103  df-swapf 50189  df-fuco 50246  df-prcof 50303  df-thinc 50347  df-termc 50402  df-lan 50536  df-cmd 50575

This theorem is used by: (None)