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

Theorem lanpropd 50934
Description: If the categories have the same set of objects, morphisms, and compositions, then they have the same left Kan extensions. (Contributed by Zhi Wang, 21-Nov-2025.)
Hypotheses
Ref Expression
lanpropd.1 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
lanpropd.2 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
lanpropd.3 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
lanpropd.4 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
lanpropd.5 (𝜑 → (Homf ‘𝐸) = (Homf ‘𝐹))
lanpropd.6 (𝜑 → (compf‘𝐸) = (compf‘𝐹))
lanpropd.a (𝜑 → 𝐴 ∈ 𝑉)
lanpropd.b (𝜑 → 𝐵 ∈ 𝑉)
lanpropd.c (𝜑 → 𝐶 ∈ 𝑉)
lanpropd.d (𝜑 → 𝐷 ∈ 𝑉)
lanpropd.e (𝜑 → 𝐸 ∈ 𝑉)
lanpropd.f (𝜑 → 𝐹 ∈ 𝑉)
Assertion
Ref Expression
lanpropd (𝜑 → (⟨𝐴, 𝐶⟩ Lan 𝐸) = (⟨𝐵, 𝐷⟩ Lan 𝐹))

Proof of Theorem lanpropd
Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lanpropd.1 . . . 4 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
2 lanpropd.2 . . . 4 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
3 lanpropd.3 . . . 4 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
4 lanpropd.4 . . . 4 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
5 lanpropd.a . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
6 lanpropd.b . . . 4 (𝜑 → 𝐵 ∈ 𝑉)
7 lanpropd.c . . . 4 (𝜑 → 𝐶 ∈ 𝑉)
8 lanpropd.d . . . 4 (𝜑 → 𝐷 ∈ 𝑉)
91, 2, 3, 4, 5, 6, 7, 8funcpropd 18086 . . 3 (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
10 lanpropd.5 . . . . 5 (𝜑 → (Homf ‘𝐸) = (Homf ‘𝐹))
11 lanpropd.6 . . . . 5 (𝜑 → (compf‘𝐸) = (compf‘𝐹))
12 lanpropd.e . . . . 5 (𝜑 → 𝐸 ∈ 𝑉)
13 lanpropd.f . . . . 5 (𝜑 → 𝐹 ∈ 𝑉)
141, 2, 10, 11, 5, 6, 12, 13funcpropd 18086 . . . 4 (𝜑 → (𝐴 Func 𝐸) = (𝐵 Func 𝐹))
1514adantr 486 . . 3 ((𝜑 ∧ 𝑓 ∈ (𝐴 Func 𝐶)) → (𝐴 Func 𝐸) = (𝐵 Func 𝐹))
163adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf ‘𝐶) = (Homf ‘𝐷))
174adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf‘𝐶) = (compf‘𝐷))
1810adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf ‘𝐸) = (Homf ‘𝐹))
1911adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf‘𝐸) = (compf‘𝐹))
20 funcrcl 18047 . . . . . . . 8 (𝑓 ∈ (𝐴 Func 𝐶) → (𝐴 ∈ Cat ∧ 𝐶 ∈ Cat))
2120ad2antrl 741 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ∧ 𝐶 ∈ Cat))
2221simprd 501 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐶 ∈ Cat)
238adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐷 ∈ 𝑉)
2416, 17, 22, 23catpropd 17892 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐶 ∈ Cat ↔ 𝐷 ∈ Cat))
2522, 24mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐷 ∈ Cat)
26 funcrcl 18047 . . . . . . . 8 (𝑥 ∈ (𝐴 Func 𝐸) → (𝐴 ∈ Cat ∧ 𝐸 ∈ Cat))
2726ad2antll 742 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ∧ 𝐸 ∈ Cat))
2827simprd 501 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐸 ∈ Cat)
2913adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐹 ∈ 𝑉)
3018, 19, 28, 29catpropd 17892 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐸 ∈ Cat ↔ 𝐹 ∈ Cat))
3128, 30mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐹 ∈ Cat)
3216, 17, 18, 19, 22, 25, 28, 31fucpropd 18164 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐶 FuncCat 𝐸) = (𝐷 FuncCat 𝐹))
331adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf ‘𝐴) = (Homf ‘𝐵))
342adantr 486 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf‘𝐴) = (compf‘𝐵))
3521simpld 500 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐴 ∈ Cat)
366adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐵 ∈ 𝑉)
3733, 34, 35, 36catpropd 17892 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ↔ 𝐵 ∈ Cat))
3835, 37mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐵 ∈ Cat)
3933, 34, 18, 19, 35, 38, 28, 31fucpropd 18164 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 FuncCat 𝐸) = (𝐵 FuncCat 𝐹))
4032, 39oveq12d 7442 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → ((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸)) = ((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹)))
41 simprl 783 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝑓 ∈ (𝐴 Func 𝐶))
4216, 17, 18, 19, 22, 25, 28, 31, 41prcofpropd 50650 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (⟨𝐶, 𝐸⟩ −∘F 𝑓) = (⟨𝐷, 𝐹⟩ −∘F 𝑓))
43 eqidd 2761 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝑥 = 𝑥)
4440, 42, 43oveq123d 7445 . . 3 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥) = ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥))
459, 15, 44mpoeq123dva 7498 . 2 (𝜑 → (𝑓 ∈ (𝐴 Func 𝐶), 𝑥 ∈ (𝐴 Func 𝐸) ↦ ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥)) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑥 ∈ (𝐵 Func 𝐹) ↦ ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥)))
46 eqid 2760 . . 3 (𝐶 FuncCat 𝐸) = (𝐶 FuncCat 𝐸)
47 eqid 2760 . . 3 (𝐴 FuncCat 𝐸) = (𝐴 FuncCat 𝐸)
4846, 47, 5, 7, 12lanfval 50932 . 2 (𝜑 → (⟨𝐴, 𝐶⟩ Lan 𝐸) = (𝑓 ∈ (𝐴 Func 𝐶), 𝑥 ∈ (𝐴 Func 𝐸) ↦ ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥)))
49 eqid 2760 . . 3 (𝐷 FuncCat 𝐹) = (𝐷 FuncCat 𝐹)
50 eqid 2760 . . 3 (𝐵 FuncCat 𝐹) = (𝐵 FuncCat 𝐹)
5149, 50, 6, 8, 13lanfval 50932 . 2 (𝜑 → (⟨𝐵, 𝐷⟩ Lan 𝐹) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑥 ∈ (𝐵 Func 𝐹) ↦ ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥)))
5245, 48, 513eqtr4d 2805 1 (𝜑 → (⟨𝐴, 𝐶⟩ Lan 𝐸) = (⟨𝐵, 𝐷⟩ Lan 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ⟨cop 4834  ‘cfv 6543  (class class class)co 7424   ∈ cmpo 7426  Catccat 17847  Homf chomf 17849  compfccomf 17850   Func cfunc 18038   FuncCat cfuc 18129   UP cup 50425   −∘F cprcof 50644   Lan clan 50924
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-map 8857  df-ixp 8934  df-cat 17851  df-cid 17852  df-homf 17853  df-comf 17854  df-func 18042  df-nat 18130  df-fuc 18131  df-prcof 50645  df-lan 50926
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator