Theorem ranfval 51128

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 51122	. . 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 6931	. . 3 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) ∈ V)
4		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → 𝑝 = ⟨𝐶, 𝐷⟩)
5	4	fveq2d 6920	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) = (1st ‘⟨𝐶, 𝐷⟩))
6		lanfval.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑈)
7		lanfval.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
8		op1stg 8047	. . . . . 6 ⊢ ((𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
9	6, 7, 8	syl2anc 596	. . . . 5 ⊢ (𝜑 → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
10	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
11	5, 10	eqtrd 2798	. . 3 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → (1st ‘𝑝) = 𝐶)
12		fvexd 6931	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) ∈ V)
13		simplrl 789	. . . . . 6 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → 𝑝 = ⟨𝐶, 𝐷⟩)
14	13	fveq2d 6920	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) = (2nd ‘⟨𝐶, 𝐷⟩))
15		op2ndg 8048	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
16	6, 7, 15	syl2anc 596	. . . . . 6 ⊢ (𝜑 → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
17	16	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
18	14, 17	eqtrd 2798	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → (2nd ‘𝑝) = 𝐷)
19		simplr 781	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑐 = 𝐶)
20		simpr 490	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑑 = 𝐷)
21	19, 20	oveq12d 7469	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 Func 𝑑) = (𝐶 Func 𝐷))
22		simpllr 788	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸))
23	22	simprd 501	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑒 = 𝐸)
24	19, 23	oveq12d 7469	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 Func 𝑒) = (𝐶 Func 𝐸))
25	20, 23	oveq12d 7469	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑑 FuncCat 𝑒) = (𝐷 FuncCat 𝐸))
26	25	fveq2d 6920	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑑 FuncCat 𝑒)) = (oppCat‘(𝐷 FuncCat 𝐸)))
27		ranfval.o	. . . . . . . . 9 ⊢ 𝑂 = (oppCat‘𝑅)
28		lanfval.r	. . . . . . . . . 10 ⊢ 𝑅 = (𝐷 FuncCat 𝐸)
29	28	fveq2i 6919	. . . . . . . . 9 ⊢ (oppCat‘𝑅) = (oppCat‘(𝐷 FuncCat 𝐸))
30	27, 29	eqtri 2786	. . . . . . . 8 ⊢ 𝑂 = (oppCat‘(𝐷 FuncCat 𝐸))
31	26, 30	eqtr4di 2816	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑑 FuncCat 𝑒)) = 𝑂)
32	19, 23	oveq12d 7469	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑐 FuncCat 𝑒) = (𝐶 FuncCat 𝐸))
33	32	fveq2d 6920	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑐 FuncCat 𝑒)) = (oppCat‘(𝐶 FuncCat 𝐸)))
34		ranfval.p	. . . . . . . . 9 ⊢ 𝑃 = (oppCat‘𝑆)
35		lanfval.s	. . . . . . . . . 10 ⊢ 𝑆 = (𝐶 FuncCat 𝐸)
36	35	fveq2i 6919	. . . . . . . . 9 ⊢ (oppCat‘𝑆) = (oppCat‘(𝐶 FuncCat 𝐸))
37	34, 36	eqtri 2786	. . . . . . . 8 ⊢ 𝑃 = (oppCat‘(𝐶 FuncCat 𝐸))
38	33, 37	eqtr4di 2816	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (oppCat‘(𝑐 FuncCat 𝑒)) = 𝑃)
39	31, 38	oveq12d 7469	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒))) = (𝑂 UP 𝑃))
40	20, 23	opeq12d 4853	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ⟨𝑑, 𝑒⟩ = ⟨𝐷, 𝐸⟩)
41	40	fvoveq1d 7473	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → ( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓)) = ( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓)))
42		eqidd 2764	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → 𝑥 = 𝑥)
43	39, 41, 42	oveq123d 7472	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥) = (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥))
44	21, 24, 43	mpoeq123dv 7526	. . . 4 ⊢ ((((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) ∧ 𝑑 = 𝐷) → (𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
45	12, 18, 44	csbied2 3888	. . 3 ⊢ (((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) ∧ 𝑐 = 𝐶) → ⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
46	3, 11, 45	csbied2 3888	. 2 ⊢ ((𝜑 ∧ (𝑝 = ⟨𝐶, 𝐷⟩ ∧ 𝑒 = 𝐸)) → ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))
47	6	elexd 3477	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
48	7	elexd 3477	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
49	47, 48	opelxpd 5697	. 2 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (V × V))
50		lanfval.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑊)
51	50	elexd 3477	. 2 ⊢ (𝜑 → 𝐸 ∈ V)
52		ovex 7484	. . . 4 ⊢ (𝐶 Func 𝐷) ∈ V
53		ovex 7484	. . . 4 ⊢ (𝐶 Func 𝐸) ∈ V
54	52, 53	mpoex 8127	. . 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 7604	1 ⊢ (𝜑 → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))(𝑂 UP 𝑃)𝑥)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⦋csb 3851  ⟨cop 4840   × cxp 5656  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1^st c1st 8033  2^nd c2nd 8034  oppCatcoppc 17935   Func cfunc 18079   FuncCat cfuc 18170   oppFunc coppf 50569   UP cup 50620   −∘_F cprcof 50839   Ran cran 51120

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  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-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  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-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-ran 51122

This theorem is used by:  ranpropd  51130  reldmran2  51132  ranval  51134  ranrcl  51136