Theorem ranfval 50104

Description: Value of the function generating the set of right Kan extensions. (Contributed by Zhi Wang, 4-Nov-2025.)

Hypotheses

Ref	Expression
lanfval.r	⊢ 𝑅 = (𝐷 FuncCat 𝐸)
lanfval.s	⊢ 𝑆 = (𝐶 FuncCat 𝐸)
lanfval.c	⊢ (𝜑 → 𝐶 ∈ 𝑈)
lanfval.d	⊢ (𝜑 → 𝐷 ∈ 𝑉)
lanfval.e	⊢ (𝜑 → 𝐸 ∈ 𝑊)
ranfval.o	⊢ 𝑂 = (oppCat‘𝑅)
ranfval.p	⊢ 𝑃 = (oppCat‘𝑆)

Assertion

Ref	Expression
ranfval	⊢ (𝜑 → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))

Distinct variable groups:   𝐶,𝑓,𝑥   𝐷,𝑓,𝑥   𝑓,𝐸,𝑥   𝜑,𝑓,𝑥

Allowed substitution hints:   𝑃(𝑥,𝑓)   𝑅(𝑥,𝑓)   𝑆(𝑥,𝑓)   𝑈(𝑥,𝑓)   𝑂(𝑥,𝑓)   𝑉(𝑥,𝑓)   𝑊(𝑥,𝑓)

Proof of Theorem ranfval

Dummy variables 𝑐 𝑑 𝑒 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ran 50098	. . 3 ⊢ Ran = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)))
2	1	a1i 11	. 2 ⊢ (𝜑 → Ran = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥))))
3		fvexd 6850	. . 3 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) ∈ V)
4		simprl 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → 𝑝 = ⟨𝐶, 𝐷⟩)
5	4	fveq2d 6839	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) = (1st ‘⟨𝐶, 𝐷⟩))
6		lanfval.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑈)
7		lanfval.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
8		op1stg 7948	. . . . . 6 ⊢ ((𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
9	6, 7, 8	syl2anc 585	. . . . 5 ⊢ (𝜑 → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
10	9	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
11	5, 10	eqtrd 2772	. . 3 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) = 𝐶)
12		fvexd 6850	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) ∈ V)
13		simplrl 777	. . . . . 6 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → 𝑝 = ⟨𝐶, 𝐷⟩)
14	13	fveq2d 6839	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) = (2nd ‘⟨𝐶, 𝐷⟩))
15		op2ndg 7949	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
16	6, 7, 15	syl2anc 585	. . . . . 6 ⊢ (𝜑 → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
17	16	ad2antrr 727	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
18	14, 17	eqtrd 2772	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) = 𝐷)
19		simplr 769	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑐 = 𝐶)
20		simpr 484	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
21	19, 20	oveq12d 7379	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 Func 𝑑) = (𝐶 Func 𝐷))
22		simpllr 776	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸))
23	22	simprd 495	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑒 = 𝐸)
24	19, 23	oveq12d 7379	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 Func 𝑒) = (𝐶 Func 𝐸))
25	20, 23	oveq12d 7379	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑑 FuncCat 𝑒) = (𝐷 FuncCat 𝐸))
26	25	fveq2d 6839	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑑 FuncCat 𝑒)) = (oppCat‘(𝐷 FuncCat 𝐸)))
27		ranfval.o	. . . . . . . . 9 ⊢ 𝑂 = (oppCat‘𝑅)
28		lanfval.r	. . . . . . . . . 10 ⊢ 𝑅 = (𝐷 FuncCat 𝐸)
29	28	fveq2i 6838	. . . . . . . . 9 ⊢ (oppCat‘𝑅) = (oppCat‘(𝐷 FuncCat 𝐸))
30	27, 29	eqtri 2760	. . . . . . . 8 ⊢ 𝑂 = (oppCat‘(𝐷 FuncCat 𝐸))
31	26, 30	eqtr4di 2790	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑑 FuncCat 𝑒)) = 𝑂)
32	19, 23	oveq12d 7379	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 FuncCat 𝑒) = (𝐶 FuncCat 𝐸))
33	32	fveq2d 6839	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑐 FuncCat 𝑒)) = (oppCat‘(𝐶 FuncCat 𝐸)))
34		ranfval.p	. . . . . . . . 9 ⊢ 𝑃 = (oppCat‘𝑆)
35		lanfval.s	. . . . . . . . . 10 ⊢ 𝑆 = (𝐶 FuncCat 𝐸)
36	35	fveq2i 6838	. . . . . . . . 9 ⊢ (oppCat‘𝑆) = (oppCat‘(𝐶 FuncCat 𝐸))
37	34, 36	eqtri 2760	. . . . . . . 8 ⊢ 𝑃 = (oppCat‘(𝐶 FuncCat 𝐸))
38	33, 37	eqtr4di 2790	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑐 FuncCat 𝑒)) = 𝑃)
39	31, 38	oveq12d 7379	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒))) = (𝑂 UP 𝑃))
40	20, 23	opeq12d 4825	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ⟨𝑑, 𝑒⟩ = ⟨𝐷, 𝐸⟩)
41	40	fvoveq1d 7383	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓)) = ( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓)))
42		eqidd 2738	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑥 = 𝑥)
43	39, 41, 42	oveq123d 7382	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥) = (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥))
44	21, 24, 43	mpoeq123dv 7436	. . . 4 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
45	12, 18, 44	csbied2 3875	. . 3 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → ⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
46	3, 11, 45	csbied2 3875	. 2 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
47	6	elexd 3454	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
48	7	elexd 3454	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
49	47, 48	opelxpd 5664	. 2 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (V × V))
50		lanfval.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑊)
51	50	elexd 3454	. 2 ⊢ (𝜑 → 𝐸 ∈ V)
52		ovex 7394	. . . 4 ⊢ (𝐶 Func 𝐷) ∈ V
53		ovex 7394	. . . 4 ⊢ (𝐶 Func 𝐸) ∈ V
54	52, 53	mpoex 8026	. . 3 ⊢ (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)) ∈ V
55	54	a1i 11	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)) ∈ V)
56	2, 46, 49, 51, 55	ovmpod 7513	1 ⊢ (𝜑 → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3430  ⦋csb 3838  ⟨cop 4574   × cxp 5623  ‘cfv 6493  (class class class)co 7361   ∈ cmpo 7363  1^st c1st 7934  2^nd c2nd 7935  oppCatcoppc 17671   Func cfunc 17815   FuncCat cfuc 17906   oppFunc coppf 49612   UP cup 49663   −∘_F cprcof 49863   Ran cran 50096

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-ran 50098

This theorem is referenced by:  ranpropd  50106  reldmran2  50108  ranval  50110  ranrcl  50112