Theorem ranrcl 49809

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 4291	. . . . 5 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅)
3		eqid 2734	. . . . . 6 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸)
4		eqid 2734	. . . . . 6 ⊢ (𝐶 FuncCat 𝐸) = (𝐶 FuncCat 𝐸)
5		df-ov 7359	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ Ran 𝐸) = ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩)
6	5	eqeq1i 2739	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ ↔ ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅)
7		oveq 7362	. . . . . . . . . 10 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7393	. . . . . . . . . 10 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2785	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
10	6, 9	sylbir 235	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
11	10	necon3i 2962	. . . . . . 7 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅)
12		fvfundmfvn0 6872	. . . . . . . . 9 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran ∧ Fun ( Ran ↾ {⟨⟨𝐶, 𝐷⟩, 𝐸⟩})))
13	12	simpld 494	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran )
14		ranfn 49797	. . . . . . . . 9 ⊢ Ran Fn ((V × V) × V)
15	14	fndmi 6594	. . . . . . . 8 ⊢ dom Ran = ((V × V) × V)
16	13, 15	eleqtrdi 2844	. . . . . . 7 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V))
17		opelxp1 5664	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → ⟨𝐶, 𝐷⟩ ∈ (V × V))
18		opelxp1 5664	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐶 ∈ V)
19	11, 16, 17, 18	4syl 19	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐶 ∈ V)
20		opelxp2 5665	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐷 ∈ V)
21	11, 16, 17, 20	4syl 19	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐷 ∈ V)
22		opelxp2 5665	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
23	11, 16, 22	3syl 18	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐸 ∈ V)
24		eqid 2734	. . . . . 6 ⊢ (oppCat‘(𝐷 FuncCat 𝐸)) = (oppCat‘(𝐷 FuncCat 𝐸))
25		eqid 2734	. . . . . 6 ⊢ (oppCat‘(𝐶 FuncCat 𝐸)) = (oppCat‘(𝐶 FuncCat 𝐸))
26	3, 4, 19, 21, 23, 24, 25	ranfval 49801	. . . . 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 7373	. . 3 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
29	1, 28	eleqtrd 2836	. 2 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → 𝐿 ∈ (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
30		eqid 2734	. . 3 ⊢ (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))
31	30	elmpocl 7597	. 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 1541   ∈ wcel 2113   ≠ wne 2930  Vcvv 3438  ∅c0 4283  {csn 4578  ⟨cop 4584   × cxp 5620  dom cdm 5622   ↾ cres 5624  Fun wfun 6484  ‘cfv 6490  (class class class)co 7356   ∈ cmpo 7358  oppCatcoppc 17632   Func cfunc 17776   FuncCat cfuc 17867   oppFunc coppf 49309   UP cup 49360   −∘_F cprcof 49560   Ran cran 49793

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-ran 49795

This theorem is referenced by:  relran  49811  isran  49815  ranrcl2  49823  ranrcl3  49824