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

Theorem ranup 50144
Description: The universal property of the right Kan extension; expressed explicitly. (Contributed by Zhi Wang, 5-Nov-2025.)
Hypotheses
Ref Expression
lanup.s 𝑆 = (𝐶 FuncCat 𝐸)
lanup.m 𝑀 = (𝐷 Nat 𝐸)
lanup.n 𝑁 = (𝐶 Nat 𝐸)
lanup.x = (comp‘𝑆)
lanup.f (𝜑𝐹 ∈ (𝐶 Func 𝐷))
lanup.l (𝜑𝐿 ∈ (𝐷 Func 𝐸))
ranup.a (𝜑𝐴 ∈ ((𝐿func 𝐹)𝑁𝑋))
Assertion
Ref Expression
ranup (𝜑 → (𝐿(𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋)𝐴 ↔ ∀𝑙 ∈ (𝐷 Func 𝐸)∀𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹)))))
Distinct variable groups:   𝐴,𝑎,𝑏,𝑙   𝐶,𝑎,𝑏,𝑙   𝐷,𝑎,𝑏,𝑙   𝐸,𝑎,𝑏,𝑙   𝐹,𝑎,𝑏,𝑙   𝐿,𝑎,𝑏,𝑙   𝑀,𝑏   𝑁,𝑎,𝑏   𝑆,𝑎,𝑏,𝑙   𝑋,𝑎,𝑏,𝑙   𝜑,𝑎,𝑏,𝑙
Allowed substitution hints:   (𝑎,𝑏,𝑙)   𝑀(𝑎,𝑙)   𝑁(𝑙)

Proof of Theorem ranup
StepHypRef Expression
1 eqid 2741 . . . 4 (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸)
21fucbas 17925 . . 3 (𝐷 Func 𝐸) = (Base‘(𝐷 FuncCat 𝐸))
3 lanup.s . . . 4 𝑆 = (𝐶 FuncCat 𝐸)
43fucbas 17925 . . 3 (𝐶 Func 𝐸) = (Base‘𝑆)
5 lanup.m . . . 4 𝑀 = (𝐷 Nat 𝐸)
61, 5fuchom 17926 . . 3 𝑀 = (Hom ‘(𝐷 FuncCat 𝐸))
7 lanup.n . . . 4 𝑁 = (𝐶 Nat 𝐸)
83, 7fuchom 17926 . . 3 𝑁 = (Hom ‘𝑆)
9 lanup.x . . 3 = (comp‘𝑆)
10 ranup.a . . . . 5 (𝜑𝐴 ∈ ((𝐿func 𝐹)𝑁𝑋))
117natrcl 17915 . . . . 5 (𝐴 ∈ ((𝐿func 𝐹)𝑁𝑋) → ((𝐿func 𝐹) ∈ (𝐶 Func 𝐸) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))
1210, 11syl 17 . . . 4 (𝜑 → ((𝐿func 𝐹) ∈ (𝐶 Func 𝐸) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))
1312simprd 497 . . 3 (𝜑𝑋 ∈ (𝐶 Func 𝐸))
1413func1st2nd 49578 . . . . 5 (𝜑 → (1st𝑋)(𝐶 Func 𝐸)(2nd𝑋))
1514funcrcl3 49582 . . . 4 (𝜑𝐸 ∈ Cat)
16 lanup.f . . . 4 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
17 opex 5405 . . . . . . 7 𝐷, 𝐸⟩ ∈ V
1817a1i 11 . . . . . 6 (𝜑 → ⟨𝐷, 𝐸⟩ ∈ V)
1916, 18prcofelvv 49882 . . . . 5 (𝜑 → (⟨𝐷, 𝐸⟩ −∘F 𝐹) ∈ (V × V))
20 1st2nd2 7972 . . . . 5 ((⟨𝐷, 𝐸⟩ −∘F 𝐹) ∈ (V × V) → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ⟨(1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)), (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))⟩)
2119, 20syl 17 . . . 4 (𝜑 → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ⟨(1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)), (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))⟩)
221, 15, 3, 16, 21prcoffunca2 49889 . . 3 (𝜑 → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))((𝐷 FuncCat 𝐸) Func 𝑆)(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)))
23 lanup.l . . 3 (𝜑𝐿 ∈ (𝐷 Func 𝐸))
24 eqidd 2742 . . . . . 6 (𝜑 → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)))
2523, 24prcof1 49890 . . . . 5 (𝜑 → ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿) = (𝐿func 𝐹))
2625oveq1d 7374 . . . 4 (𝜑 → (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)𝑁𝑋) = ((𝐿func 𝐹)𝑁𝑋))
2710, 26eleqtrrd 2844 . . 3 (𝜑𝐴 ∈ (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)𝑁𝑋))
28 eqid 2741 . . 3 (oppCat‘(𝐷 FuncCat 𝐸)) = (oppCat‘(𝐷 FuncCat 𝐸))
29 eqid 2741 . . 3 (oppCat‘𝑆) = (oppCat‘𝑆)
302, 4, 6, 8, 9, 13, 22, 23, 27, 28, 29oppcup 49709 . 2 (𝜑 → (𝐿(⟨(1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))⟩((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘𝑆))𝑋)𝐴 ↔ ∀𝑙 ∈ (𝐷 Func 𝐸)∀𝑎 ∈ (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏))))
313fveq2i 6833 . . . 4 (oppCat‘𝑆) = (oppCat‘(𝐶 FuncCat 𝐸))
3228, 31, 21, 16ranval2 50132 . . 3 (𝜑 → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (⟨(1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))⟩((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘𝑆))𝑋))
3332breqd 5085 . 2 (𝜑 → (𝐿(𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋)𝐴𝐿(⟨(1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))⟩((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘𝑆))𝑋)𝐴))
34 simpr 486 . . . . . . 7 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → 𝑙 ∈ (𝐷 Func 𝐸))
35 eqidd 2742 . . . . . . 7 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)))
3634, 35prcof1 49890 . . . . . 6 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙) = (𝑙func 𝐹))
3736eqcomd 2747 . . . . 5 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → (𝑙func 𝐹) = ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙))
3837oveq1d 7374 . . . 4 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → ((𝑙func 𝐹)𝑁𝑋) = (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙)𝑁𝑋))
3936ad2antrr 733 . . . . . . . . . 10 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙) = (𝑙func 𝐹))
4025ad3antrrr 737 . . . . . . . . . 10 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿) = (𝐿func 𝐹))
4139, 40opeq12d 4814 . . . . . . . . 9 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → ⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ = ⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩)
4241oveq1d 7374 . . . . . . . 8 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → (⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋) = (⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋))
43 eqidd 2742 . . . . . . . 8 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → 𝐴 = 𝐴)
44 simpr 486 . . . . . . . . 9 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → 𝑏 ∈ (𝑙𝑀𝐿))
45 eqidd 2742 . . . . . . . . 9 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)))
4616ad3antrrr 737 . . . . . . . . 9 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → 𝐹 ∈ (𝐶 Func 𝐷))
475, 44, 45, 46prcof21a 49893 . . . . . . . 8 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → ((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏) = (𝑏 ∘ (1st𝐹)))
4842, 43, 47oveq123d 7380 . . . . . . 7 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏)) = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))))
4948eqcomd 2747 . . . . . 6 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))) = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏)))
5049eqeq2d 2752 . . . . 5 ((((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) ∧ 𝑏 ∈ (𝑙𝑀𝐿)) → (𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))) ↔ 𝑎 = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏))))
5150reubidva 3360 . . . 4 (((𝜑𝑙 ∈ (𝐷 Func 𝐸)) ∧ 𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)) → (∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))) ↔ ∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏))))
5238, 51raleqbidva 3305 . . 3 ((𝜑𝑙 ∈ (𝐷 Func 𝐸)) → (∀𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))) ↔ ∀𝑎 ∈ (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏))))
5352ralbidva 3162 . 2 (𝜑 → (∀𝑙 ∈ (𝐷 Func 𝐸)∀𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹))) ↔ ∀𝑙 ∈ (𝐷 Func 𝐸)∀𝑎 ∈ (((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝑙), ((1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))‘𝐿)⟩ 𝑋)((𝑙(2nd ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹))𝐿)‘𝑏))))
5430, 33, 533bitr4d 313 1 (𝜑 → (𝐿(𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋)𝐴 ↔ ∀𝑙 ∈ (𝐷 Func 𝐸)∀𝑎 ∈ ((𝑙func 𝐹)𝑁𝑋)∃!𝑏 ∈ (𝑙𝑀𝐿)𝑎 = (𝐴(⟨(𝑙func 𝐹), (𝐿func 𝐹)⟩ 𝑋)(𝑏 ∘ (1st𝐹)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wral 3055  ∃!wreu 3344  Vcvv 3433  cop 4563   class class class wbr 5074   × cxp 5618  ccom 5624  cfv 6488  (class class class)co 7359  1st c1st 7931  2nd c2nd 7932  tpos ctpos 8167  compcco 17227  oppCatcoppc 17672   Func cfunc 17816  func ccofu 17818   Nat cnat 17906   FuncCat cfuc 17907   UP cup 49675   −∘F cprcof 49875   Ran cran 50108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681  ax-cnex 11090  ax-resscn 11091  ax-1cn 11092  ax-icn 11093  ax-addcl 11094  ax-addrcl 11095  ax-mulcl 11096  ax-mulrcl 11097  ax-mulcom 11098  ax-addass 11099  ax-mulass 11100  ax-distr 11101  ax-i2m1 11102  ax-1ne0 11103  ax-1rid 11104  ax-rnegex 11105  ax-rrecex 11106  ax-cnre 11107  ax-pre-lttri 11108  ax-pre-lttrn 11109  ax-pre-ltadd 11110  ax-pre-mulgt0 11111
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7316  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-1st 7933  df-2nd 7934  df-tpos 8168  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-1o 8399  df-er 8637  df-map 8769  df-ixp 8840  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-pnf 11177  df-mnf 11178  df-xr 11179  df-ltxr 11180  df-le 11181  df-sub 11375  df-neg 11376  df-nn 12170  df-2 12239  df-3 12240  df-4 12241  df-5 12242  df-6 12243  df-7 12244  df-8 12245  df-9 12246  df-n0 12433  df-z 12520  df-dec 12640  df-uz 12784  df-fz 13457  df-struct 17112  df-sets 17129  df-slot 17147  df-ndx 17159  df-base 17175  df-hom 17239  df-cco 17240  df-cat 17629  df-cid 17630  df-oppc 17673  df-func 17820  df-cofu 17822  df-nat 17908  df-fuc 17909  df-xpc 18133  df-curf 18175  df-oppf 49625  df-up 49676  df-swapf 49762  df-fuco 49819  df-prcof 49876  df-ran 50110
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator