Theorem rellan 49602

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

Assertion

Ref	Expression
rellan	⊢ Rel (𝐹(𝑃 Lan 𝐸)𝑋)

Proof of Theorem rellan

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

Step	Hyp	Ref	Expression
1		rel0 5764	. . 3 ⊢ Rel ∅
2		releq 5741	. . 3 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) = ∅ → (Rel (𝐹(𝑃 Lan 𝐸)𝑋) ↔ Rel ∅))
3	1, 2	mpbiri 258	. 2 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) = ∅ → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
4		n0 4318	. . 3 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋))
5		relup 49162	. . . . 5 ⊢ Rel ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋)
6		ne0i 4306	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅)
7		oveq 7395	. . . . . . . . . . . 12 ⊢ ((𝑃 Lan 𝐸) = ∅ → (𝐹(𝑃 Lan 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7426	. . . . . . . . . . . 12 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2781	. . . . . . . . . . 11 ⊢ ((𝑃 Lan 𝐸) = ∅ → (𝐹(𝑃 Lan 𝐸)𝑋) = ∅)
10	9	necon3i 2958	. . . . . . . . . 10 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ → (𝑃 Lan 𝐸) ≠ ∅)
11		n0 4318	. . . . . . . . . . 11 ⊢ ((𝑃 Lan 𝐸) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝑃 Lan 𝐸))
12		df-lan 49586	. . . . . . . . . . . . . 14 ⊢ Lan = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ ((⟨𝑑, 𝑒⟩ −∘F 𝑓)((𝑑 FuncCat 𝑒) UP (𝑐 FuncCat 𝑒))𝑥)))
13	12	elmpocl1 7633	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 ∈ (V × V))
14		1st2nd2 8009	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
15	13, 14	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
16	15	exlimiv 1930	. . . . . . . . . . 11 ⊢ (∃𝑥 𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
17	11, 16	sylbi 217	. . . . . . . . . 10 ⊢ ((𝑃 Lan 𝐸) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
18	6, 10, 17	3syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
19	18	oveq1d 7404	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝑃 Lan 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸))
20	19	oveqd 7406	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) = (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋))
21		eqid 2730	. . . . . . . 8 ⊢ ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22		eqid 2730	. . . . . . . 8 ⊢ ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23		id 22	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋))
24	23, 20	eleqtrd 2831	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋))
25		lanrcl 49600	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
26	24, 25	syl 17	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
27	26	simpld 494	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)))
28	26	simprd 495	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑋 ∈ ((1st ‘𝑃) Func 𝐸))
29		eqidd 2731	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) = (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))
30	21, 22, 27, 28, 29	lanval 49598	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋) = ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋))
31	20, 30	eqtrd 2765	. . . . . 6 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) = ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋))
32	31	releqd 5743	. . . . 5 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (Rel (𝐹(𝑃 Lan 𝐸)𝑋) ↔ Rel ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋)))
33	5, 32	mpbiri 258	. . . 4 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
34	33	exlimiv 1930	. . 3 ⊢ (∃𝑥 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
35	4, 34	sylbi 217	. 2 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
36	3, 35	pm2.61ine 3009	1 ⊢ Rel (𝐹(𝑃 Lan 𝐸)𝑋)

Syntax hints:   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109   ≠ wne 2926  Vcvv 3450  ⦋csb 3864  ∅c0 4298  ⟨cop 4597   × cxp 5638  Rel wrel 5645  ‘cfv 6513  (class class class)co 7389   ∈ cmpo 7391  1^st c1st 7968  2^nd c2nd 7969   Func cfunc 17822   FuncCat cfuc 17913   UP cup 49152   −∘_F cprcof 49352   Lan clan 49584

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-ov 7392  df-oprab 7393  df-mpo 7394  df-1st 7970  df-2nd 7971  df-func 17826  df-up 49153  df-lan 49586

This theorem is referenced by: (None)