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 50105
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 17860 . . 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 17860 . . . 4 (𝜑 → (𝐴 Func 𝐸) = (𝐵 Func 𝐹))
1514adantr 481 . . 3 ((𝜑𝑓 ∈ (𝐴 Func 𝐶)) → (𝐴 Func 𝐸) = (𝐵 Func 𝐹))
163adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf𝐶) = (Homf𝐷))
174adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf𝐶) = (compf𝐷))
1810adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf𝐸) = (Homf𝐹))
1911adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf𝐸) = (compf𝐹))
20 funcrcl 17821 . . . . . . . 8 (𝑓 ∈ (𝐴 Func 𝐶) → (𝐴 ∈ Cat ∧ 𝐶 ∈ Cat))
2120ad2antrl 734 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ∧ 𝐶 ∈ Cat))
2221simprd 496 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐶 ∈ Cat)
238adantr 481 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐷𝑉)
2416, 17, 22, 23catpropd 17666 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐶 ∈ Cat ↔ 𝐷 ∈ Cat))
2522, 24mpbid 233 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐷 ∈ Cat)
26 funcrcl 17821 . . . . . . . 8 (𝑥 ∈ (𝐴 Func 𝐸) → (𝐴 ∈ Cat ∧ 𝐸 ∈ Cat))
2726ad2antll 735 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ∧ 𝐸 ∈ Cat))
2827simprd 496 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐸 ∈ Cat)
2913adantr 481 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐹𝑉)
3018, 19, 28, 29catpropd 17666 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐸 ∈ Cat ↔ 𝐹 ∈ Cat))
3128, 30mpbid 233 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐹 ∈ Cat)
3216, 17, 18, 19, 22, 25, 28, 31fucpropd 17938 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐶 FuncCat 𝐸) = (𝐷 FuncCat 𝐹))
331adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (Homf𝐴) = (Homf𝐵))
342adantr 481 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (compf𝐴) = (compf𝐵))
3521simpld 495 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐴 ∈ Cat)
366adantr 481 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐵𝑉)
3733, 34, 35, 36catpropd 17666 . . . . . . 7 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 ∈ Cat ↔ 𝐵 ∈ Cat))
3835, 37mpbid 233 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝐵 ∈ Cat)
3933, 34, 18, 19, 35, 38, 28, 31fucpropd 17938 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (𝐴 FuncCat 𝐸) = (𝐵 FuncCat 𝐹))
4032, 39oveq12d 7374 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → ((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸)) = ((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹)))
41 simprl 776 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝑓 ∈ (𝐴 Func 𝐶))
4216, 17, 18, 19, 22, 25, 28, 31, 41prcofpropd 49869 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → (⟨𝐶, 𝐸⟩ −∘F 𝑓) = (⟨𝐷, 𝐹⟩ −∘F 𝑓))
43 eqidd 2740 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → 𝑥 = 𝑥)
4440, 42, 43oveq123d 7377 . . 3 ((𝜑 ∧ (𝑓 ∈ (𝐴 Func 𝐶) ∧ 𝑥 ∈ (𝐴 Func 𝐸))) → ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥) = ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥))
459, 15, 44mpoeq123dva 7430 . 2 (𝜑 → (𝑓 ∈ (𝐴 Func 𝐶), 𝑥 ∈ (𝐴 Func 𝐸) ↦ ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥)) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑥 ∈ (𝐵 Func 𝐹) ↦ ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥)))
46 eqid 2739 . . 3 (𝐶 FuncCat 𝐸) = (𝐶 FuncCat 𝐸)
47 eqid 2739 . . 3 (𝐴 FuncCat 𝐸) = (𝐴 FuncCat 𝐸)
4846, 47, 5, 7, 12lanfval 50103 . 2 (𝜑 → (⟨𝐴, 𝐶⟩ Lan 𝐸) = (𝑓 ∈ (𝐴 Func 𝐶), 𝑥 ∈ (𝐴 Func 𝐸) ↦ ((⟨𝐶, 𝐸⟩ −∘F 𝑓)((𝐶 FuncCat 𝐸) UP (𝐴 FuncCat 𝐸))𝑥)))
49 eqid 2739 . . 3 (𝐷 FuncCat 𝐹) = (𝐷 FuncCat 𝐹)
50 eqid 2739 . . 3 (𝐵 FuncCat 𝐹) = (𝐵 FuncCat 𝐹)
5149, 50, 6, 8, 13lanfval 50103 . 2 (𝜑 → (⟨𝐵, 𝐷⟩ Lan 𝐹) = (𝑓 ∈ (𝐵 Func 𝐷), 𝑥 ∈ (𝐵 Func 𝐹) ↦ ((⟨𝐷, 𝐹⟩ −∘F 𝑓)((𝐷 FuncCat 𝐹) UP (𝐵 FuncCat 𝐹))𝑥)))
5245, 48, 513eqtr4d 2784 1 (𝜑 → (⟨𝐴, 𝐶⟩ Lan 𝐸) = (⟨𝐵, 𝐷⟩ Lan 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  cop 4561  cfv 6485  (class class class)co 7356  cmpo 7358  Catccat 17621  Homf chomf 17623  compfccomf 17624   Func cfunc 17812   FuncCat cfuc 17903   UP cup 49663   −∘F cprcof 49863   Lan clan 50095
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-map 8765  df-ixp 8836  df-cat 17625  df-cid 17626  df-homf 17627  df-comf 17628  df-func 17816  df-nat 17904  df-fuc 17905  df-prcof 49864  df-lan 50097
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator