Theorem islmd 49654

Description: The universal property of limits of a diagram. (Contributed by Zhi Wang, 14-Nov-2025.)

Hypotheses

Ref	Expression
islmd.l	⊢ 𝐿 = (𝐶Δfunc𝐷)
islmd.a	⊢ 𝐴 = (Base‘𝐶)
islmd.n	⊢ 𝑁 = (𝐷 Nat 𝐶)
islmd.b	⊢ 𝐵 = (Base‘𝐷)
islmd.h	⊢ 𝐻 = (Hom ‘𝐶)
islmd.x	⊢ · = (comp‘𝐶)

Assertion

Ref	Expression
islmd	⊢ (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑅 ↔ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))

Distinct variable groups:   · ,𝑗   𝐴,𝑎,𝑗,𝑚,𝑥   𝐵,𝑗   𝐶,𝑎,𝑗,𝑚,𝑥   𝐷,𝑎,𝑗,𝑚,𝑥   𝐹,𝑎,𝑗,𝑚,𝑥   𝑗,𝐻,𝑚   𝐿,𝑎,𝑗,𝑚,𝑥   𝑁,𝑎,𝑗,𝑚,𝑥   𝑅,𝑎,𝑗,𝑚,𝑥   𝑋,𝑎,𝑗,𝑚,𝑥

Allowed substitution hints:   𝐵(𝑥,𝑚,𝑎)   · (𝑥,𝑚,𝑎)   𝐻(𝑥,𝑎)

Proof of Theorem islmd

Step	Hyp	Ref	Expression
1		lmdfval2 49644	. . . 4 ⊢ ((𝐶 Limit 𝐷)‘𝐹) = (( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)
2		islmd.l	. . . . . 6 ⊢ 𝐿 = (𝐶Δfunc𝐷)
3	2	fveq2i 6861	. . . . 5 ⊢ ( oppFunc ‘𝐿) = ( oppFunc ‘(𝐶Δfunc𝐷))
4	3	oveq1i 7397	. . . 4 ⊢ (( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹) = (( oppFunc ‘(𝐶Δfunc𝐷))((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)
5	1, 4	eqtr4i 2755	. . 3 ⊢ ((𝐶 Limit 𝐷)‘𝐹) = (( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)
6	5	breqi 5113	. 2 ⊢ (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑅 ↔ 𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅)
7		id 22	. . . . . 6 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅)
8	7	up1st2nd 49174	. . . . 5 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝑋(⟨(1st ‘( oppFunc ‘𝐿)), (2nd ‘( oppFunc ‘𝐿))⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅)
9		eqid 2729	. . . . 5 ⊢ (oppCat‘𝐶) = (oppCat‘𝐶)
10		islmd.a	. . . . 5 ⊢ 𝐴 = (Base‘𝐶)
11	8, 9, 10	oppcuprcl4 49188	. . . 4 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝑋 ∈ 𝐴)
12		eqid 2729	. . . . . . . 8 ⊢ (oppCat‘(𝐷 FuncCat 𝐶)) = (oppCat‘(𝐷 FuncCat 𝐶))
13		eqid 2729	. . . . . . . . 9 ⊢ (𝐷 FuncCat 𝐶) = (𝐷 FuncCat 𝐶)
14	13	fucbas 17925	. . . . . . . 8 ⊢ (𝐷 Func 𝐶) = (Base‘(𝐷 FuncCat 𝐶))
15	8, 12, 14	oppcuprcl3 49189	. . . . . . 7 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝐹 ∈ (𝐷 Func 𝐶))
16		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐹 ∈ (𝐷 Func 𝐶))
17	16	func1st2nd 49065	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (1st ‘𝐹)(𝐷 Func 𝐶)(2nd ‘𝐹))
18	17	funcrcl3 49069	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐶 ∈ Cat)
19	17	funcrcl2 49068	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐷 ∈ Cat)
20	2, 18, 19, 13	diagcl 18202	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → 𝐿 ∈ (𝐶 Func (𝐷 FuncCat 𝐶)))
21		oppfval2 49126	. . . . . . . . . 10 ⊢ (𝐿 ∈ (𝐶 Func (𝐷 FuncCat 𝐶)) → ( oppFunc ‘𝐿) = ⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩)
22	20, 21	syl 17	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → ( oppFunc ‘𝐿) = ⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩)
23	22	oveq1d 7402	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹) = (⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹))
24	23	breqd 5118	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐹 ∈ (𝐷 Func 𝐶)) → (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ 𝑋(⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅))
25	11, 15, 24	syl2anc 584	. . . . . 6 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ 𝑋(⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅))
26	25	ibi 267	. . . . 5 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝑋(⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅)
27		islmd.n	. . . . . 6 ⊢ 𝑁 = (𝐷 Nat 𝐶)
28	13, 27	fuchom 17926	. . . . 5 ⊢ 𝑁 = (Hom ‘(𝐷 FuncCat 𝐶))
29	26, 12, 28	oppcuprcl5 49190	. . . 4 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹))
30	11, 29	jca 511	. . 3 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 → (𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)))
31	27	natrcl 17915	. . . . . 6 ⊢ (𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹) → (((1st ‘𝐿)‘𝑋) ∈ (𝐷 Func 𝐶) ∧ 𝐹 ∈ (𝐷 Func 𝐶)))
32	31	simprd 495	. . . . 5 ⊢ (𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹) → 𝐹 ∈ (𝐷 Func 𝐶))
33	32, 24	sylan2 593	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ 𝑋(⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅))
34		islmd.h	. . . . 5 ⊢ 𝐻 = (Hom ‘𝐶)
35		eqid 2729	. . . . 5 ⊢ (comp‘(𝐷 FuncCat 𝐶)) = (comp‘(𝐷 FuncCat 𝐶))
36	32	adantl 481	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝐹 ∈ (𝐷 Func 𝐶))
37	32, 20	sylan2 593	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝐿 ∈ (𝐶 Func (𝐷 FuncCat 𝐶)))
38	37	func1st2nd 49065	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → (1st ‘𝐿)(𝐶 Func (𝐷 FuncCat 𝐶))(2nd ‘𝐿))
39		simpl 482	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝑋 ∈ 𝐴)
40		simpr 484	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹))
41	10, 14, 34, 28, 35, 36, 38, 39, 40, 9, 12	oppcup 49196	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → (𝑋(⟨(1st ‘𝐿), tpos (2nd ‘𝐿)⟩((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚))))
42		islmd.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐷)
43	32, 18	sylan2 593	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝐶 ∈ Cat)
44	43	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝐶 ∈ Cat)
45	32, 19	sylan2 593	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → 𝐷 ∈ Cat)
46	45	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝐷 ∈ Cat)
47		simplrl 776	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝑥 ∈ 𝐴)
48	39	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝑋 ∈ 𝐴)
49		simpr 484	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝑚 ∈ (𝑥𝐻𝑋))
50	2, 10, 42, 34, 44, 46, 47, 48, 49	diag2 18206	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → ((𝑥(2nd ‘𝐿)𝑋)‘𝑚) = (𝐵 × {𝑚}))
51	50	oveq2d 7403	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚)) = (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)(𝐵 × {𝑚})))
52		islmd.x	. . . . . . . . 9 ⊢ · = (comp‘𝐶)
53	2, 10, 42, 34, 44, 46, 47, 48, 49, 27	diag2cl 18207	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝐵 × {𝑚}) ∈ (((1st ‘𝐿)‘𝑥)𝑁((1st ‘𝐿)‘𝑋)))
54	40	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹))
55	13, 27, 42, 52, 35, 53, 54	fucco 17927	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)(𝐵 × {𝑚})) = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗), ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗)⟩ · ((1st ‘𝐹)‘𝑗))((𝐵 × {𝑚})‘𝑗))))
56	44	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → 𝐶 ∈ Cat)
57	46	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → 𝐷 ∈ Cat)
58	47	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → 𝑥 ∈ 𝐴)
59		eqid 2729	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝐿)‘𝑥) = ((1st ‘𝐿)‘𝑥)
60		simpr 484	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → 𝑗 ∈ 𝐵)
61	2, 56, 57, 10, 58, 59, 42, 60	diag11 18204	. . . . . . . . . . . 12 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → ((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗) = 𝑥)
62	48	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → 𝑋 ∈ 𝐴)
63		eqid 2729	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝐿)‘𝑋) = ((1st ‘𝐿)‘𝑋)
64	2, 56, 57, 10, 62, 63, 42, 60	diag11 18204	. . . . . . . . . . . 12 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗) = 𝑋)
65	61, 64	opeq12d 4845	. . . . . . . . . . 11 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → ⟨((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗), ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗)⟩ = ⟨𝑥, 𝑋⟩)
66	65	oveq1d 7402	. . . . . . . . . 10 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → (⟨((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗), ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗)⟩ · ((1st ‘𝐹)‘𝑗)) = (⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗)))
67		eqidd 2730	. . . . . . . . . 10 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → (𝑅‘𝑗) = (𝑅‘𝑗))
68		vex 3451	. . . . . . . . . . . 12 ⊢ 𝑚 ∈ V
69	68	fvconst2 7178	. . . . . . . . . . 11 ⊢ (𝑗 ∈ 𝐵 → ((𝐵 × {𝑚})‘𝑗) = 𝑚)
70	69	adantl 481	. . . . . . . . . 10 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → ((𝐵 × {𝑚})‘𝑗) = 𝑚)
71	66, 67, 70	oveq123d 7408	. . . . . . . . 9 ⊢ (((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) ∧ 𝑗 ∈ 𝐵) → ((𝑅‘𝑗)(⟨((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗), ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗)⟩ · ((1st ‘𝐹)‘𝑗))((𝐵 × {𝑚})‘𝑗)) = ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))
72	71	mpteq2dva 5200	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨((1st ‘((1st ‘𝐿)‘𝑥))‘𝑗), ((1st ‘((1st ‘𝐿)‘𝑋))‘𝑗)⟩ · ((1st ‘𝐹)‘𝑗))((𝐵 × {𝑚})‘𝑗))) = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚)))
73	51, 55, 72	3eqtrd 2768	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚)) = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚)))
74	73	eqeq2d 2740	. . . . . 6 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) ∧ 𝑚 ∈ (𝑥𝐻𝑋)) → (𝑎 = (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚)) ↔ 𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))
75	74	reubidva 3370	. . . . 5 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹))) → (∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚)) ↔ ∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))
76	75	2ralbidva 3199	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → (∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑅(⟨((1st ‘𝐿)‘𝑥), ((1st ‘𝐿)‘𝑋)⟩(comp‘(𝐷 FuncCat 𝐶))𝐹)((𝑥(2nd ‘𝐿)𝑋)‘𝑚)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))
77	33, 41, 76	3bitrd 305	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) → (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))
78	30, 77	biadanii 821	. 2 ⊢ (𝑋(( oppFunc ‘𝐿)((oppCat‘𝐶) UP (oppCat‘(𝐷 FuncCat 𝐶)))𝐹)𝑅 ↔ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))
79	6, 78	bitri 275	1 ⊢ (𝑋((𝐶 Limit 𝐷)‘𝐹)𝑅 ↔ ((𝑋 ∈ 𝐴 ∧ 𝑅 ∈ (((1st ‘𝐿)‘𝑋)𝑁𝐹)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑎 ∈ (((1st ‘𝐿)‘𝑥)𝑁𝐹)∃!𝑚 ∈ (𝑥𝐻𝑋)𝑎 = (𝑗 ∈ 𝐵 ↦ ((𝑅‘𝑗)(⟨𝑥, 𝑋⟩ · ((1st ‘𝐹)‘𝑗))𝑚))))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃!wreu 3352  {csn 4589  ⟨cop 4595   class class class wbr 5107   ↦ cmpt 5188   × cxp 5636  ‘cfv 6511  (class class class)co 7387  1^st c1st 7966  2^nd c2nd 7967  tpos ctpos 8204  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17625  oppCatcoppc 17672   Func cfunc 17816   Nat cnat 17906   FuncCat cfuc 17907  Δ_funccdiag 18173   oppFunc coppf 49111   UP cup 49162   Limit clmd 49632

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-tpos 8205  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-er 8671  df-map 8801  df-ixp 8871  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-3 12250  df-4 12251  df-5 12252  df-6 12253  df-7 12254  df-8 12255  df-9 12256  df-n0 12443  df-z 12530  df-dec 12650  df-uz 12794  df-fz 13469  df-struct 17117  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-hom 17244  df-cco 17245  df-cat 17629  df-cid 17630  df-oppc 17673  df-func 17820  df-nat 17908  df-fuc 17909  df-xpc 18133  df-1stf 18134  df-curf 18175  df-diag 18177  df-oppf 49112  df-up 49163  df-lmd 49634

This theorem is referenced by: (None)