Theorem relran 50099

Description: The set of right Kan extensions is a relation. (Contributed by Zhi Wang, 4-Nov-2025.)

Assertion

Ref	Expression
relran	⊢ Rel (𝐹(𝑃 Ran 𝐸)𝑋)

Proof of Theorem relran

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

Step	Hyp	Ref	Expression
1		rel0 5755	. . 3 ⊢ Rel ∅
2		releq 5733	. . 3 ⊢ ((𝐹(𝑃 Ran 𝐸)𝑋) = ∅ → (Rel (𝐹(𝑃 Ran 𝐸)𝑋) ↔ Rel ∅))
3	1, 2	mpbiri 258	. 2 ⊢ ((𝐹(𝑃 Ran 𝐸)𝑋) = ∅ → Rel (𝐹(𝑃 Ran 𝐸)𝑋))
4		n0 4293	. . 3 ⊢ ((𝐹(𝑃 Ran 𝐸)𝑋) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋))
5		relup 49658	. . . . 5 ⊢ Rel (⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑋)
6		ne0i 4281	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝐹(𝑃 Ran 𝐸)𝑋) ≠ ∅)
7		oveq 7373	. . . . . . . . . . . 12 ⊢ ((𝑃 Ran 𝐸) = ∅ → (𝐹(𝑃 Ran 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7404	. . . . . . . . . . . 12 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2787	. . . . . . . . . . 11 ⊢ ((𝑃 Ran 𝐸) = ∅ → (𝐹(𝑃 Ran 𝐸)𝑋) = ∅)
10	9	necon3i 2964	. . . . . . . . . 10 ⊢ ((𝐹(𝑃 Ran 𝐸)𝑋) ≠ ∅ → (𝑃 Ran 𝐸) ≠ ∅)
11		n0 4293	. . . . . . . . . . 11 ⊢ ((𝑃 Ran 𝐸) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝑃 Ran 𝐸))
12		df-ran 50083	. . . . . . . . . . . . . 14 ⊢ Ran = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)))
13	12	elmpocl1 7609	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝑃 Ran 𝐸) → 𝑃 ∈ (V × V))
14		1st2nd2 7981	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
15	13, 14	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑃 Ran 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
16	15	exlimiv 1932	. . . . . . . . . . 11 ⊢ (∃𝑥 𝑥 ∈ (𝑃 Ran 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
17	11, 16	sylbi 217	. . . . . . . . . 10 ⊢ ((𝑃 Ran 𝐸) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
18	6, 10, 17	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
19	18	oveq1d 7382	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝑃 Ran 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸))
20	19	oveqd 7384	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝐹(𝑃 Ran 𝐸)𝑋) = (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸)𝑋))
21		eqid 2736	. . . . . . . 8 ⊢ ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22		eqid 2736	. . . . . . . 8 ⊢ ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23		id 22	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → 𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋))
24	23, 20	eleqtrd 2838	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → 𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸)𝑋))
25		ranrcl 50097	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
26	24, 25	syl 17	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
27	26	simpld 494	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → 𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)))
28	26	simprd 495	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → 𝑋 ∈ ((1st ‘𝑃) Func 𝐸))
29		opex 5416	. . . . . . . . . . 11 ⊢ ⟨(2nd ‘𝑃), 𝐸⟩ ∈ V
30	29	a1i 11	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → ⟨(2nd ‘𝑃), 𝐸⟩ ∈ V)
31	27, 30	prcofelvv 49855	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) ∈ (V × V))
32		1st2nd2 7981	. . . . . . . . 9 ⊢ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) ∈ (V × V) → (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) = ⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩)
33	31, 32	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) = ⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩)
34		eqid 2736	. . . . . . . 8 ⊢ (oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) = (oppCat‘((2nd ‘𝑃) FuncCat 𝐸))
35		eqid 2736	. . . . . . . 8 ⊢ (oppCat‘((1st ‘𝑃) FuncCat 𝐸)) = (oppCat‘((1st ‘𝑃) FuncCat 𝐸))
36	21, 22, 27, 28, 33, 34, 35	ranval 50095	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸)𝑋) = (⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑋))
37	20, 36	eqtrd 2771	. . . . . 6 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (𝐹(𝑃 Ran 𝐸)𝑋) = (⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑋))
38	37	releqd 5735	. . . . 5 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → (Rel (𝐹(𝑃 Ran 𝐸)𝑋) ↔ Rel (⟨(1st ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)), tpos (2nd ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))⟩((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑋)))
39	5, 38	mpbiri 258	. . . 4 ⊢ (𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → Rel (𝐹(𝑃 Ran 𝐸)𝑋))
40	39	exlimiv 1932	. . 3 ⊢ (∃𝑥 𝑥 ∈ (𝐹(𝑃 Ran 𝐸)𝑋) → Rel (𝐹(𝑃 Ran 𝐸)𝑋))
41	4, 40	sylbi 217	. 2 ⊢ ((𝐹(𝑃 Ran 𝐸)𝑋) ≠ ∅ → Rel (𝐹(𝑃 Ran 𝐸)𝑋))
42	3, 41	pm2.61ine 3015	1 ⊢ Rel (𝐹(𝑃 Ran 𝐸)𝑋)

Syntax hints:   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2932  Vcvv 3429  ⦋csb 3837  ∅c0 4273  ⟨cop 4573   × cxp 5629  Rel wrel 5636  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  1^st c1st 7940  2^nd c2nd 7941  tpos ctpos 8175  oppCatcoppc 17677   Func cfunc 17821   FuncCat cfuc 17912   oppFunc coppf 49597   UP cup 49648   −∘_F cprcof 49848   Ran cran 50081

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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-tpos 8176  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-ixp 8846  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-3 12245  df-4 12246  df-5 12247  df-6 12248  df-7 12249  df-8 12250  df-9 12251  df-n0 12438  df-z 12525  df-dec 12645  df-uz 12789  df-fz 13462  df-struct 17117  df-slot 17152  df-ndx 17164  df-base 17180  df-hom 17244  df-cco 17245  df-cat 17634  df-cid 17635  df-func 17825  df-cofu 17827  df-nat 17913  df-fuc 17914  df-xpc 18138  df-curf 18180  df-oppf 49598  df-up 49649  df-swapf 49735  df-fuco 49792  df-prcof 49849  df-ran 50083

This theorem is referenced by: (None)