Theorem ranrcl 49981

Description: Reverse closure for right Kan extensions. (Contributed by Zhi Wang, 4-Nov-2025.)

Assertion

Ref	Expression
ranrcl	⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))

Proof of Theorem ranrcl

Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . 3 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → 𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋))
2		ne0i 4295	. . . . 5 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅)
3		eqid 2737	. . . . . 6 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸)
4		eqid 2737	. . . . . 6 ⊢ (𝐶 FuncCat 𝐸) = (𝐶 FuncCat 𝐸)
5		df-ov 7371	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ Ran 𝐸) = ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩)
6	5	eqeq1i 2742	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ ↔ ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅)
7		oveq 7374	. . . . . . . . . 10 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7405	. . . . . . . . . 10 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2788	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
10	6, 9	sylbir 235	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
11	10	necon3i 2965	. . . . . . 7 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅)
12		fvfundmfvn0 6882	. . . . . . . . 9 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran ∧ Fun ( Ran ↾ {⟨⟨𝐶, 𝐷⟩, 𝐸⟩})))
13	12	simpld 494	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran )
14		ranfn 49969	. . . . . . . . 9 ⊢ Ran Fn ((V × V) × V)
15	14	fndmi 6604	. . . . . . . 8 ⊢ dom Ran = ((V × V) × V)
16	13, 15	eleqtrdi 2847	. . . . . . 7 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V))
17		opelxp1 5674	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → ⟨𝐶, 𝐷⟩ ∈ (V × V))
18		opelxp1 5674	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐶 ∈ V)
19	11, 16, 17, 18	4syl 19	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐶 ∈ V)
20		opelxp2 5675	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐷 ∈ V)
21	11, 16, 17, 20	4syl 19	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐷 ∈ V)
22		opelxp2 5675	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
23	11, 16, 22	3syl 18	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐸 ∈ V)
24		eqid 2737	. . . . . 6 ⊢ (oppCat‘(𝐷 FuncCat 𝐸)) = (oppCat‘(𝐷 FuncCat 𝐸))
25		eqid 2737	. . . . . 6 ⊢ (oppCat‘(𝐶 FuncCat 𝐸)) = (oppCat‘(𝐶 FuncCat 𝐸))
26	3, 4, 19, 21, 23, 24, 25	ranfval 49973	. . . . 5 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)))
27	2, 26	syl 17	. . . 4 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)))
28	27	oveqd 7385	. . 3 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
29	1, 28	eleqtrd 2839	. 2 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → 𝐿 ∈ (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
30		eqid 2737	. . 3 ⊢ (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))
31	30	elmpocl 7609	. 2 ⊢ (𝐿 ∈ (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))
32	29, 31	syl 17	1 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  Vcvv 3442  ∅c0 4287  {csn 4582  ⟨cop 4588   × cxp 5630  dom cdm 5632   ↾ cres 5634  Fun wfun 6494  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370  oppCatcoppc 17646   Func cfunc 17790   FuncCat cfuc 17881   oppFunc coppf 49481   UP cup 49532   −∘_F cprcof 49732   Ran cran 49965

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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-ran 49967

This theorem is referenced by:  relran  49983  isran  49987  ranrcl2  49995  ranrcl3  49996