Theorem ranrcl 50420

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 23	. . 3 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → 𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋))
2		ne0i 4294	. . . . 5 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅)
3		eqid 2763	. . . . . 6 ⊢ (𝐷 FuncCat 𝐸) = (𝐷 FuncCat 𝐸)
4		eqid 2763	. . . . . 6 ⊢ (𝐶 FuncCat 𝐸) = (𝐶 FuncCat 𝐸)
5		df-ov 7413	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ Ran 𝐸) = ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩)
6	5	eqeq1i 2768	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ ↔ ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅)
7		oveq 7416	. . . . . . . . . 10 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹∅𝑋))
8		0ov 7447	. . . . . . . . . 10 ⊢ (𝐹∅𝑋) = ∅
9	7, 8	eqtrdi 2814	. . . . . . . . 9 ⊢ ((⟨𝐶, 𝐷⟩ Ran 𝐸) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
10	6, 9	sylbir 238	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) = ∅ → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = ∅)
11	10	necon3i 2990	. . . . . . 7 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → ( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅)
12		fvfundmfvn0 6921	. . . . . . . . 9 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran ∧ Fun ( Ran ↾ {⟨⟨𝐶, 𝐷⟩, 𝐸⟩})))
13	12	simpld 499	. . . . . . . 8 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ dom Ran )
14		ranfn 50408	. . . . . . . . 9 ⊢ Ran Fn ((V × V) × V)
15	14	fndmi 6639	. . . . . . . 8 ⊢ dom Ran = ((V × V) × V)
16	13, 15	eleqtrdi 2873	. . . . . . 7 ⊢ (( Ran ‘⟨⟨𝐶, 𝐷⟩, 𝐸⟩) ≠ ∅ → ⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V))
17		opelxp1 5703	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → ⟨𝐶, 𝐷⟩ ∈ (V × V))
18		opelxp1 5703	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐶 ∈ V)
19	11, 16, 17, 18	4syl 20	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐶 ∈ V)
20		opelxp2 5704	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ ∈ (V × V) → 𝐷 ∈ V)
21	11, 16, 17, 20	4syl 20	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐷 ∈ V)
22		opelxp2 5704	. . . . . . 7 ⊢ (⟨⟨𝐶, 𝐷⟩, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
23	11, 16, 22	3syl 19	. . . . . 6 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → 𝐸 ∈ V)
24		eqid 2763	. . . . . 6 ⊢ (oppCat‘(𝐷 FuncCat 𝐸)) = (oppCat‘(𝐷 FuncCat 𝐸))
25		eqid 2763	. . . . . 6 ⊢ (oppCat‘(𝐶 FuncCat 𝐸)) = (oppCat‘(𝐶 FuncCat 𝐸))
26	3, 4, 19, 21, 23, 24, 25	ranfval 50412	. . . . 5 ⊢ ((𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) ≠ ∅ → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)))
27	2, 26	syl 18	. . . 4 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (⟨𝐶, 𝐷⟩ Ran 𝐸) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)))
28	27	oveqd 7427	. . 3 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) = (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
29	1, 28	eleqtrd 2865	. 2 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → 𝐿 ∈ (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋))
30		eqid 2763	. . 3 ⊢ (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥)) = (𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))
31	30	elmpocl 7651	. 2 ⊢ (𝐿 ∈ (𝐹(𝑓 ∈ (𝐶 Func 𝐷), 𝑥 ∈ (𝐶 Func 𝐸) ↦ (( oppFunc ‘(⟨𝐷, 𝐸⟩ −∘F 𝑓))((oppCat‘(𝐷 FuncCat 𝐸)) UP (oppCat‘(𝐶 FuncCat 𝐸)))𝑥))𝑋) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))
32	29, 31	syl 18	1 ⊢ (𝐿 ∈ (𝐹(⟨𝐶, 𝐷⟩ Ran 𝐸)𝑋) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝑋 ∈ (𝐶 Func 𝐸)))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  Vcvv 3455  ∅c0 4286  {csn 4589  ⟨cop 4595   × cxp 5659  dom cdm 5661   ↾ cres 5663  Fun wfun 6530  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412  oppCatcoppc 17762   Func cfunc 17906   FuncCat cfuc 17997   oppFunc coppf 49920   UP cup 49971   −∘_F cprcof 50171   Ran cran 50404

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-ran 50406

This theorem is referenced by:  relran  50422  isran  50426  ranrcl2  50434  ranrcl3  50435