Theorem rellan 50552

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 5779	. . 3 ⊢ Rel ∅
2		releq 5757	. . 3 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) = ∅ → (Rel (𝐹(𝑃 Lan 𝐸)𝑋) ↔ Rel ∅))
3	1, 2	mpbiri 261	. 2 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) = ∅ → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
4		n0 4300	. . 3 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋))
5		relup 50112	. . . . 5 ⊢ Rel ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋)
6		ne0i 4287	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅)
7		oveq 7420	. . . . . . . . . . . 12 ⊢ ((𝑃 Lan 𝐸) = ∅ → (𝐹(𝑃 Lan 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7451	. . . . . . . . . . . 12 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2811	. . . . . . . . . . 11 ⊢ ((𝑃 Lan 𝐸) = ∅ → (𝐹(𝑃 Lan 𝐸)𝑋) = ∅)
10	9	necon3i 2987	. . . . . . . . . 10 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ → (𝑃 Lan 𝐸) ≠ ∅)
11		n0 4300	. . . . . . . . . . 11 ⊢ ((𝑃 Lan 𝐸) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝑃 Lan 𝐸))
12		df-lan 50536	. . . . . . . . . . . . . 14 ⊢ Lan = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ ((⟨𝑑, 𝑒⟩ −∘F 𝑓)((𝑑 FuncCat 𝑒) UP (𝑐 FuncCat 𝑒))𝑥)))
13	12	elmpocl1 7657	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 ∈ (V × V))
14		1st2nd2 8026	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
15	13, 14	syl 18	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
16	15	exlimiv 1963	. . . . . . . . . . 11 ⊢ (∃𝑥 𝑥 ∈ (𝑃 Lan 𝐸) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
17	11, 16	sylbi 220	. . . . . . . . . 10 ⊢ ((𝑃 Lan 𝐸) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
18	6, 10, 17	3syl 19	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
19	18	oveq1d 7429	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝑃 Lan 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸))
20	19	oveqd 7431	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) = (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋))
21		eqid 2760	. . . . . . . 8 ⊢ ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22		eqid 2760	. . . . . . . 8 ⊢ ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23		id 23	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋))
24	23, 20	eleqtrd 2862	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋))
25		lanrcl 50550	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
26	24, 25	syl 18	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ∧ 𝑋 ∈ ((1st ‘𝑃) Func 𝐸)))
27	26	simpld 500	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝐹 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)))
28	26	simprd 501	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → 𝑋 ∈ ((1st ‘𝑃) Func 𝐸))
29		eqidd 2761	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹) = (⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹))
30	21, 22, 27, 28, 29	lanval 50548	. . . . . . 7 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸)𝑋) = ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋))
31	20, 30	eqtrd 2795	. . . . . 6 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (𝐹(𝑃 Lan 𝐸)𝑋) = ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋))
32	31	releqd 5759	. . . . 5 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → (Rel (𝐹(𝑃 Lan 𝐸)𝑋) ↔ Rel ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝐹)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑋)))
33	5, 32	mpbiri 261	. . . 4 ⊢ (𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
34	33	exlimiv 1963	. . 3 ⊢ (∃𝑥 𝑥 ∈ (𝐹(𝑃 Lan 𝐸)𝑋) → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
35	4, 34	sylbi 220	. 2 ⊢ ((𝐹(𝑃 Lan 𝐸)𝑋) ≠ ∅ → Rel (𝐹(𝑃 Lan 𝐸)𝑋))
36	3, 35	pm2.61ine 3038	1 ⊢ Rel (𝐹(𝑃 Lan 𝐸)𝑋)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2955  Vcvv 3450  ⦋csb 3847  ∅c0 4279  ⟨cop 4590   × cxp 5653  Rel wrel 5660  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416  1^st c1st 7985  2^nd c2nd 7986   Func cfunc 17946   FuncCat cfuc 18037   UP cup 50102   −∘_F cprcof 50302   Lan clan 50534

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-func 17950  df-up 50103  df-lan 50536

This theorem is used by: (None)