Theorem lmdran 50996

Description: To each limit of a diagram there is a corresponding right Kan extention of the diagram along a functor to a terminal category. The morphism parts coincide, while the object parts are one-to-one correspondent (diag1f1o 50811). (Contributed by Zhi Wang, 26-Nov-2025.)

Hypotheses

Ref	Expression
lmdran.1	⊢ (𝜑 → 1 ∈ TermCat)
lmdran.g	⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 1 ))
lmdran.l	⊢ 𝐿 = (𝐶Δfunc 1 )
lmdran.y	⊢ (𝜑 → 𝑌 = ((1st ‘𝐿)‘𝑋))

Assertion

Ref	Expression
lmdran	⊢ (𝜑 → (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹)𝑀))

Proof of Theorem lmdran

Step	Hyp	Ref	Expression
1		lmdfval2 50980	. . 3 ⊢ ((𝐶 Limit 𝐷)‘𝐹) = (( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)
2	1	breqi 5112	. 2 ⊢ (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑀 ↔ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀)
3		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀)
4	3	up1st2nd 50443	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑋(⟨(1st ‘( oppFunc ‘(𝐶Δfunc𝐷))), (2nd ‘( oppFunc ‘(𝐶Δfunc𝐷)))⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀)
5		eqid 2763	. . . . . 6 ⊢ (oppCat‘(𝐷 FuncCat 𝐶)) = (oppCat‘(𝐷 FuncCat 𝐶))
6		eqid 2763	. . . . . . 7 ⊢ (𝐷 FuncCat 𝐶) = (𝐷 FuncCat 𝐶)
7	6	fucbas 18153	. . . . . 6 ⊢ (𝐷 Func 𝐶) = (Base‘(𝐷 FuncCat 𝐶))
8	4, 5, 7	oppcuprcl3 50458	. . . . 5 ⊢ ((𝜑 ∧ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
9		eqid 2763	. . . . . 6 ⊢ (oppCat‘𝐶) = (oppCat‘𝐶)
10		eqid 2763	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
11	4, 9, 10	oppcuprcl4 50457	. . . . 5 ⊢ ((𝜑 ∧ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
12	8, 11	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
13		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀)
14	13	up1st2nd 50443	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑌(⟨(1st ‘( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))), (2nd ‘( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺)))⟩((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀)
15	14, 5, 7	oppcuprcl3 50458	. . . . 5 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝐹 ∈ (𝐷 Func 𝐶))
16		lmdran.y	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 = ((1st ‘𝐿)‘𝑋))
17	16	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑌 = ((1st ‘𝐿)‘𝑋))
18		eqid 2763	. . . . . . . . . 10 ⊢ (oppCat‘( 1 FuncCat 𝐶)) = (oppCat‘( 1 FuncCat 𝐶))
19		eqid 2763	. . . . . . . . . . 11 ⊢ ( 1 FuncCat 𝐶) = ( 1 FuncCat 𝐶)
20	19	fucbas 18153	. . . . . . . . . 10 ⊢ ( 1 Func 𝐶) = (Base‘( 1 FuncCat 𝐶))
21	14, 18, 20	oppcuprcl4 50457	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑌 ∈ ( 1 Func 𝐶))
22		relfunc 18052	. . . . . . . . 9 ⊢ Rel ( 1 Func 𝐶)
23	21, 22	oppfrcllem 50385	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑌 ≠ ∅)
24	17, 23	eqnetrrd 3027	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → ((1st ‘𝐿)‘𝑋) ≠ ∅)
25		fvfundmfvn0 6936	. . . . . . . 8 ⊢ (((1st ‘𝐿)‘𝑋) ≠ ∅ → (𝑋 ∈ dom (1st ‘𝐿) ∧ Fun ((1st ‘𝐿) ↾ {𝑋})))
26	25	simpld 500	. . . . . . 7 ⊢ (((1st ‘𝐿)‘𝑋) ≠ ∅ → 𝑋 ∈ dom (1st ‘𝐿))
27	24, 26	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑋 ∈ dom (1st ‘𝐿))
28		lmdran.1	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ TermCat)
29	28	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 1 ∈ TermCat)
30		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐹 ∈ (𝐷 Func 𝐶))
31	30	func1st2nd 50332	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐹)(𝐷 Func 𝐶)(2nd ‘𝐹))
32	31	funcrcl3 50336	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐶 ∈ Cat)
33		lmdran.l	. . . . . . . . . 10 ⊢ 𝐿 = (𝐶Δfunc 1 )
34	10, 29, 32, 33	diag1f1o 50811	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶))
35		f1of 6835	. . . . . . . . 9 ⊢ ((1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
36	34, 35	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐿):(Base‘𝐶)⟶( 1 Func 𝐶))
37	36	fdmd 6731	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → dom (1st ‘𝐿) = (Base‘𝐶))
38	15, 37	syldan 603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → dom (1st ‘𝐿) = (Base‘𝐶))
39	27, 38	eleqtrd 2866	. . . . 5 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → 𝑋 ∈ (Base‘𝐶))
40	15, 39	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀) → (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶)))
41	9, 10	oppcbas 17907	. . . . 5 ⊢ (Base‘𝐶) = (Base‘(oppCat‘𝐶))
42	18, 20	oppcbas 17907	. . . . 5 ⊢ ( 1 Func 𝐶) = (Base‘(oppCat‘( 1 FuncCat 𝐶)))
43	16	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑌 = ((1st ‘𝐿)‘𝑋))
44	32	adantrr 730	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐶 ∈ Cat)
45	28	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 1 ∈ TermCat)
46	45	termccatd 50756	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 1 ∈ Cat)
47	33, 44, 46, 19	diagcl 18430	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐿 ∈ (𝐶 Func ( 1 FuncCat 𝐶)))
48	47	oppf1 50397	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘( oppFunc ‘𝐿)) = (1st ‘𝐿))
49	48	fveq1d 6898	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ((1st ‘( oppFunc ‘𝐿))‘𝑋) = ((1st ‘𝐿)‘𝑋))
50	43, 49	eqtr4d 2801	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑌 = ((1st ‘( oppFunc ‘𝐿))‘𝑋))
51		eqid 2763	. . . . . . 7 ⊢ (𝐶Δfunc𝐷) = (𝐶Δfunc𝐷)
52		lmdran.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ (𝐷 Func 1 ))
53	52	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐺 ∈ (𝐷 Func 1 ))
54		eqidd 2764	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺))
55	33, 51, 53, 44, 54	prcofdiag 50671	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ((⟨ 1 , 𝐶⟩ −∘F 𝐺) ∘func 𝐿) = (𝐶Δfunc𝐷))
56	19, 44, 6, 53	prcoffunca 50663	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (⟨ 1 , 𝐶⟩ −∘F 𝐺) ∈ (( 1 FuncCat 𝐶) Func (𝐷 FuncCat 𝐶)))
57	55, 47, 56	cofuoppf 50408	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺)) ∘func ( oppFunc ‘𝐿)) = ( oppFunc ‘(𝐶Δfunc𝐷)))
58		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝑋 ∈ (Base‘𝐶))
59	18, 5, 56	oppfoppc2 50400	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺)) ∈ ((oppCat‘( 1 FuncCat 𝐶)) Func (oppCat‘(𝐷 FuncCat 𝐶))))
60	44, 45, 19, 33	diagffth 50818	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → 𝐿 ∈ ((𝐶 Full ( 1 FuncCat 𝐶)) ∩ (𝐶 Faith ( 1 FuncCat 𝐶))))
61	9, 18, 60	ffthoppf 50423	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ( oppFunc ‘𝐿) ∈ (((oppCat‘𝐶) Full (oppCat‘( 1 FuncCat 𝐶))) ∩ ((oppCat‘𝐶) Faith (oppCat‘( 1 FuncCat 𝐶)))))
62	34	adantrr 730	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶))
63	48	f1oeq1d 6830	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → ((1st ‘( oppFunc ‘𝐿)):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶) ↔ (1st ‘𝐿):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶)))
64	62, 63	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘( oppFunc ‘𝐿)):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶))
65		f1ofo 6843	. . . . . 6 ⊢ ((1st ‘( oppFunc ‘𝐿)):(Base‘𝐶)–1-1-onto→( 1 Func 𝐶) → (1st ‘( oppFunc ‘𝐿)):(Base‘𝐶)–onto→( 1 Func 𝐶))
66	64, 65	syl 18	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (1st ‘( oppFunc ‘𝐿)):(Base‘𝐶)–onto→( 1 Func 𝐶))
67	41, 42, 50, 57, 58, 59, 61, 66	uptr2a 50480	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝐷 Func 𝐶) ∧ 𝑋 ∈ (Base‘𝐶))) → (𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀 ↔ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀))
68	12, 40, 67	bibiad 853	. . 3 ⊢ (𝜑 → (𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀 ↔ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀))
69		eqid 2763	. . . . . 6 ⊢ (⟨ 1 , 𝐶⟩ −∘F 𝐺) = (⟨ 1 , 𝐶⟩ −∘F 𝐺)
70	18, 5, 69	ranval3 50956	. . . . 5 ⊢ (𝐺 ∈ (𝐷 Func 1 ) → (𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹) = (( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹))
71	52, 70	syl 18	. . . 4 ⊢ (𝜑 → (𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹) = (( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹))
72	71	breqd 5117	. . 3 ⊢ (𝜑 → (𝑌(𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹)𝑀 ↔ 𝑌(( oppFunc ‘(⟨ 1 , 𝐶⟩ −∘F 𝐺))((oppCat‘( 1 FuncCat 𝐶)) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀))
73	68, 72	bitr4d 285	. 2 ⊢ (𝜑 → (𝑋(( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹)𝑀))
74	2, 73	bitrid 286	1 ⊢ (𝜑 → (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑀 ↔ 𝑌(𝐺(⟨𝐷, 1 ⟩ Ran 𝐶)𝐹)𝑀))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ≠ wne 2959  ∅c0 4281  {csn 4588  ⟨cop 4838   class class class wbr 5106  dom cdm 5655   ↾ cres 5657  Fun wfun 6541  ⟶wf 6543  –onto→wfo 6545  –1-1-onto→wf1o 6546  ‘cfv 6547  (class class class)co 7430  1^st c1st 8009  2^nd c2nd 8010  Basecbs 17402  Catccat 17853  oppCatcoppc 17900   Func cfunc 18044   FuncCat cfuc 18135  Δ_funccdiag 18401   oppFunc coppf 50380   UP cup 50431   −∘_F cprcof 50650  TermCatctermc 50749   Ran cran 50931   Limit clmd 50968

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761  ax-cnex 11269  ax-resscn 11270  ax-1cn 11271  ax-icn 11272  ax-addcl 11273  ax-addrcl 11274  ax-mulcl 11275  ax-mulrcl 11276  ax-mulcom 11277  ax-addass 11278  ax-mulass 11279  ax-distr 11280  ax-i2m1 11281  ax-1ne0 11282  ax-1rid 11283  ax-rnegex 11284  ax-rrecex 11285  ax-cnre 11286  ax-pre-lttri 11287  ax-pre-lttrn 11288  ax-pre-ltadd 11289  ax-pre-mulgt0 11290

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-tpos 8257  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-er 8731  df-map 8863  df-ixp 8940  df-en 8988  df-dom 8989  df-sdom 8990  df-fin 8991  df-pnf 11358  df-mnf 11359  df-xr 11360  df-ltxr 11361  df-le 11362  df-sub 11556  df-neg 11557  df-nn 12349  df-2 12418  df-3 12419  df-4 12420  df-5 12421  df-6 12422  df-7 12423  df-8 12424  df-9 12425  df-n0 12620  df-z 12707  df-dec 12828  df-uz 12979  df-fz 13653  df-struct 17340  df-sets 17357  df-slot 17375  df-ndx 17387  df-base 17403  df-hom 17467  df-cco 17468  df-cat 17857  df-cid 17858  df-oppc 17901  df-func 18048  df-cofu 18050  df-full 18096  df-fth 18097  df-nat 18136  df-fuc 18137  df-xpc 18361  df-1stf 18362  df-curf 18403  df-diag 18405  df-oppf 50381  df-up 50432  df-swapf 50524  df-fuco 50581  df-prcof 50651  df-thinc 50695  df-termc 50750  df-ran 50933  df-lmd 50970

This theorem is used by: (None)