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

Theorem cmdlan 51247
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 51061). (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
StepHypRef Expression
1 cmdfval2 51231 . . 3 ((𝐶 Colimit 𝐷)‘𝐹) = ((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)
21breqi 5114 . 2 (𝑋((𝐶 Colimit 𝐷)‘𝐹)𝑀 ↔ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
3 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
43up1st2nd 50693 . . . . . 6 ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋(⟨(1st ‘(𝐶Δfunc𝐷)), (2nd ‘(𝐶Δfunc𝐷))⟩(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
5 eqid 2763 . . . . . . 7 (𝐷 FuncCat 𝐶) = (𝐷 FuncCat 𝐶)
65fucbas 18188 . . . . . 6 (𝐷 Func 𝐶) = (Base‘(𝐷 FuncCat 𝐶))
74, 6uprcl3 50698 . . . . 5 ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
8 eqid 2763 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
94, 8uprcl4 50699 . . . . 5 ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
107, 9jca 521 . . . 4 ((𝜑 ∧ 𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
11 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
1211up1st2nd 50693 . . . . . 6 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌(⟨(1st ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺)), (2nd ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))⟩(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀)
1312, 6uprcl3 50698 . . . . 5 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
14 lmdran.y . . . . . . . . 9 (𝜑 → 𝑌 = ((1st ‘𝐿)‘𝑋))
1514adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 = ((1st ‘𝐿)‘𝑋))
16 eqid 2763 . . . . . . . . . . 11 ( 1 FuncCat 𝐶) = ( 1 FuncCat 𝐶)
1716fucbas 18188 . . . . . . . . . 10 ( 1 Func 𝐶) = (Base‘( 1 FuncCat 𝐶))
1812, 17uprcl4 50699 . . . . . . . . 9 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 ∈ ( 1 Func 𝐶))
19 relfunc 18087 . . . . . . . . 9 Rel ( 1 Func 𝐶)
2018, 19oppfrcllem 50635 . . . . . . . 8 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑌 ≠ ∅)
2115, 20eqnetrrd 3027 . . . . . . 7 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → ((1st ‘𝐿)‘𝑋) ≠ ∅)
22 fvfundmfvn0 6956 . . . . . . . 8 (((1st ‘𝐿)‘𝑋) ≠ ∅ → (𝑋 ∈ dom (1st ‘𝐿) ∧ Fun ((1st ‘𝐿) ↾ {𝑋})))
2322simpld 500 . . . . . . 7 (((1st ‘𝐿)‘𝑋) ≠ ∅ → 𝑋 ∈ dom (1st ‘𝐿))
2421, 23syl 18 . . . . . 6 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ dom (1st ‘𝐿))
25 lmdran.1 . . . . . . . . . . 11 (𝜑 → 1 ∈ TermCat)
2625adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 1 ∈ TermCat)
27 simpr 490 . . . . . . . . . . . 12 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐹 ∈ (𝐷 Func 𝐶))
2827func1st2nd 50582 . . . . . . . . . . 11 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐹)(𝐷 Func 𝐶)(2nd ‘𝐹))
2928funcrcl3 50586 . . . . . . . . . 10 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐶 ∈ Cat)
30 lmdran.l . . . . . . . . . 10 𝐿 = (𝐶Δfunc 1 )
318, 26, 29, 30diag1f1o 51061 . . . . . . . . 9 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)⟶1-1onto( 1 Func 𝐶))
32 f1of 6854 . . . . . . . . 9 ((1st ‘𝐿):(Base‘𝐶)⟶1-1onto( 1 Func 𝐶) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
3331, 32syl 18 . . . . . . . 8 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
3433fdmd 6750 . . . . . . 7 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → dom (1st ‘𝐿) = (Base‘𝐶))
3513, 34syldan 603 . . . . . 6 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → dom (1st ‘𝐿) = (Base‘𝐶))
3624, 35eleqtrd 2866 . . . . 5 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
3713, 36jca 521 . . . 4 ((𝜑 ∧ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
3814adantr 486 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑌 = ((1st ‘𝐿)‘𝑋))
39 eqid 2763 . . . . . 6 (𝐶Δfunc𝐷) = (𝐶Δfunc𝐷)
40 lmdran.g . . . . . . 7 (𝜑 → 𝐺 ∈ (𝐷 Func 1 ))
4140adantr 486 . . . . . 6 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Func 1 ))
4229adantrr 730 . . . . . 6 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐶 ∈ Cat)
43 eqidd 2764 . . . . . 6 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺))
4430, 39, 41, 42, 43prcofdiag 50921 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ((⟨ 1 , 𝐶⟩ −∘F 𝐺) ∘func 𝐿) = (𝐶Δfunc𝐷))
45 simprr 785 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑋 ∈ (Base‘𝐶))
4616, 42, 5, 41prcoffunca 50913 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) ∈ (( 1 FuncCat 𝐶) Func (𝐷 FuncCat 𝐶)))
4729, 26, 16, 30diagffth 51068 . . . . . 6 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐿 ∈ ((𝐶 Full ( 1 FuncCat 𝐶)) ∩ (𝐶 Faith ( 1 FuncCat 𝐶))))
4847adantrr 730 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐿 ∈ ((𝐶 Full ( 1 FuncCat 𝐶)) ∩ (𝐶 Faith ( 1 FuncCat 𝐶))))
49 f1ofo 6862 . . . . . . 7 ((1st ‘𝐿):(Base‘𝐶)⟶1-1onto( 1 Func 𝐶) → (1st ‘𝐿):(Base‘𝐶)⟶onto( 1 Func 𝐶))
5031, 49syl 18 . . . . . 6 ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)⟶onto( 1 Func 𝐶))
5150adantrr 730 . . . . 5 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘𝐿):(Base‘𝐶)⟶onto( 1 Func 𝐶))
528, 17, 38, 44, 45, 46, 48, 51uptr2a 50730 . . . 4 ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
5310, 37, 52bibiad 853 . . 3 (𝜑 → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
54 eqid 2763 . . . . . 6 (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺)
5516, 5, 54lanval2 51202 . . . . 5 (𝐺 ∈ (𝐷 Func 1 ) → (𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹) = ((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹))
5640, 55syl 18 . . . 4 (𝜑 → (𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹) = ((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹))
5756breqd 5119 . . 3 (𝜑 → (𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀 ↔ 𝑌((⟨ 1 , 𝐶⟩ −∘F 𝐺)(( 1 FuncCat 𝐶) UP (𝐷 FuncCat 𝐶))𝐹)𝑀))
5853, 57bitr4d 285 . 2 (𝜑 → (𝑋((𝐶Δfunc𝐷)(𝐶 UP (𝐷 FuncCat 𝐶))𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀))
592, 58bitrid 286 1 (𝜑 → (𝑋((𝐶 Colimit 𝐷)‘𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Lan 𝐶)𝐹)𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   ∩ cin 4092  ∅c0 4281  {csn 4588  ⟨cop 4840   class class class wbr 5108  dom cdm 5658   ↾ cres 5660  Fun wfun 6560  ⟶wf 6562  ⟶ontowfo 6564  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  Basecbs 17431  Catccat 17888   Func cfunc 18079   Full cful 18129   Faith cfth 18130   FuncCat cfuc 18170  Δfunccdiag 18436   UP cup 50681   −∘F cprcof 50900  TermCatctermc 50999   Lan clan 51180   Colimit ccmd 51219
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  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  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-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  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-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-map 8887  df-ixp 8964  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-struct 17369  df-slot 17404  df-ndx 17416  df-base 17432  df-hom 17497  df-cco 17498  df-cat 17892  df-cid 17893  df-func 18083  df-cofu 18085  df-full 18131  df-fth 18132  df-nat 18171  df-fuc 18172  df-xpc 18396  df-1stf 18397  df-curf 18438  df-diag 18440  df-up 50682  df-swapf 50774  df-fuco 50831  df-prcof 50901  df-thinc 50945  df-termc 51000  df-lan 51182  df-cmd 51221
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator