coccom - Mathbox for Zhi Wang

	Mathbox for Zhi Wang		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > coccom		Structured version Visualization version GIF version

Theorem coccom 50741

Description: A co-cone to a diagram commutes with the diagram. (Contributed by Zhi Wang, 13-Nov-2025.)

**Hypotheses**
Ref	Expression
islmd.l	⊢ 𝐿 = (𝐶Δ_func𝐷)
islmd.a	⊢ 𝐴 = (Base‘𝐶)
islmd.n	⊢ 𝑁 = (𝐷 Nat 𝐶)
islmd.b	⊢ 𝐵 = (Base‘𝐷)
concl.k	⊢ 𝐾 = ((1^st ‘𝐿)‘𝑋)
concl.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)
concl.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
concom.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)
concom.m	⊢ (𝜑 → 𝑀 ∈ (𝑌𝐽𝑍))
concom.j	⊢ 𝐽 = (Hom ‘𝐷)
concom.o	⊢ · = (comp‘𝐶)
coccom.r	⊢ (𝜑 → 𝑅 ∈ (𝐹𝑁𝐾))

**Assertion**
Ref	Expression
coccom	⊢ (𝜑 → (𝑅‘𝑌) = ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋)((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)))

**Proof of Theorem coccom**
Step	Hyp	Ref	Expression
1		islmd.n	. . 3 ⊢ 𝑁 = (𝐷 Nat 𝐶)
2		coccom.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ (𝐹𝑁𝐾))
3	1, 2	nat1st2nd 18122	. . 3 ⊢ (𝜑 → 𝑅 ∈ (⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩𝑁⟨(1^st ‘𝐾), (2^nd ‘𝐾)⟩))
4		islmd.b	. . 3 ⊢ 𝐵 = (Base‘𝐷)
5		concom.j	. . 3 ⊢ 𝐽 = (Hom ‘𝐷)
6		concom.o	. . 3 ⊢ · = (comp‘𝐶)
7		concl.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
8		concom.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
9		concom.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ (𝑌𝐽𝑍))
10	1, 3, 4, 5, 6, 7, 8, 9	nati 18126	. 2 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · ((1^st ‘𝐾)‘𝑍))((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)) = (((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍))(𝑅‘𝑌)))
11		islmd.l	. . . . 5 ⊢ 𝐿 = (𝐶Δ_func𝐷)
12	1, 3	natrcl2 50301	. . . . . 6 ⊢ (𝜑 → (1^st ‘𝐹)(𝐷 Func 𝐶)(2^nd ‘𝐹))
13	12	funcrcl3 50157	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat)
14	12	funcrcl2 50156	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ Cat)
15		islmd.a	. . . . 5 ⊢ 𝐴 = (Base‘𝐶)
16		concl.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
17		concl.k	. . . . 5 ⊢ 𝐾 = ((1^st ‘𝐿)‘𝑋)
18	11, 13, 14, 15, 16, 17, 4, 8	diag11 18410	. . . 4 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑍) = 𝑋)
19	18	oveq2d 7434	. . 3 ⊢ (𝜑 → (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · ((1^st ‘𝐾)‘𝑍)) = (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋))
20	19	oveqd 7435	. 2 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · ((1^st ‘𝐾)‘𝑍))((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)) = ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋)((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)))
21	11, 13, 14, 15, 16, 17, 4, 7	diag11 18410	. . . . . 6 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑌) = 𝑋)
22	21	opeq2d 4840	. . . . 5 ⊢ (𝜑 → ⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ = ⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩)
23	22, 18	oveq12d 7436	. . . 4 ⊢ (𝜑 → (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍)) = (⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋))
24		eqid 2761	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
25	11, 13, 14, 15, 16, 17, 4, 7, 5, 24, 8, 9	diag12 18411	. . . 4 ⊢ (𝜑 → ((𝑌(2^nd ‘𝐾)𝑍)‘𝑀) = ((Id‘𝐶)‘𝑋))
26		eqidd 2762	. . . 4 ⊢ (𝜑 → (𝑅‘𝑌) = (𝑅‘𝑌))
27	23, 25, 26	oveq123d 7439	. . 3 ⊢ (𝜑 → (((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍))(𝑅‘𝑌)) = (((Id‘𝐶)‘𝑋)(⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋)(𝑅‘𝑌)))
28		eqid 2761	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
29	4, 15, 12	funcf1 18034	. . . . 5 ⊢ (𝜑 → (1^st ‘𝐹):𝐵⟶𝐴)
30	29, 7	ffvelcdmd 7083	. . . 4 ⊢ (𝜑 → ((1^st ‘𝐹)‘𝑌) ∈ 𝐴)
31	11, 15, 1, 4, 17, 16, 7, 28, 2	coccl 50739	. . . 4 ⊢ (𝜑 → (𝑅‘𝑌) ∈ (((1^st ‘𝐹)‘𝑌)(Hom ‘𝐶)𝑋))
32	15, 28, 24, 13, 30, 6, 16, 31	catlid 17850	. . 3 ⊢ (𝜑 → (((Id‘𝐶)‘𝑋)(⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋)(𝑅‘𝑌)) = (𝑅‘𝑌))
33	27, 32	eqtrd 2796	. 2 ⊢ (𝜑 → (((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍))(𝑅‘𝑌)) = (𝑅‘𝑌))
34	10, 20, 33	3eqtr3rd 2805	1 ⊢ (𝜑 → (𝑅‘𝑌) = ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋)((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⟨cop 4590 ‘cfv 6537 (class class class)co 7418 1^st c1st 7997 2^nd c2nd 7998 Basecbs 17380 Hom chom 17432 compcco 17433 Idccid 17832 Nat cnat 18112 Δ_funccdiag 18379

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-map 8842 df-ixp 8919 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-dec 12808 df-uz 12959 df-fz 13633 df-struct 17318 df-slot 17353 df-ndx 17365 df-base 17381 df-hom 17445 df-cco 17446 df-cat 17835 df-cid 17836 df-func 18026 df-nat 18114 df-xpc 18339 df-1stf 18340 df-curf 18381 df-diag 18383

This theorem is used by: (None)

W3C validator