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 50052

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 17892	. . 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 17896	. 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 49612	. . . . . 6 ⊢ (𝜑 → (1^st ‘𝐹)(𝐷 Func 𝐶)(2^nd ‘𝐹))
13	12	funcrcl3 49468	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat)
14	12	funcrcl2 49467	. . . . 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 18180	. . . 4 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑍) = 𝑋)
19	18	oveq2d 7386	. . 3 ⊢ (𝜑 → (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · ((1^st ‘𝐾)‘𝑍)) = (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋))
20	19	oveqd 7387	. 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 18180	. . . . . 6 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑌) = 𝑋)
22	21	opeq2d 4838	. . . . 5 ⊢ (𝜑 → ⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ = ⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩)
23	22, 18	oveq12d 7388	. . . 4 ⊢ (𝜑 → (⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍)) = (⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋))
24		eqid 2737	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
25	11, 13, 14, 15, 16, 17, 4, 7, 5, 24, 8, 9	diag12 18181	. . . 4 ⊢ (𝜑 → ((𝑌(2^nd ‘𝐾)𝑍)‘𝑀) = ((Id‘𝐶)‘𝑋))
26		eqidd 2738	. . . 4 ⊢ (𝜑 → (𝑅‘𝑌) = (𝑅‘𝑌))
27	23, 25, 26	oveq123d 7391	. . 3 ⊢ (𝜑 → (((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍))(𝑅‘𝑌)) = (((Id‘𝐶)‘𝑋)(⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋)(𝑅‘𝑌)))
28		eqid 2737	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
29	4, 15, 12	funcf1 17804	. . . . 5 ⊢ (𝜑 → (1^st ‘𝐹):𝐵⟶𝐴)
30	29, 7	ffvelcdmd 7041	. . . 4 ⊢ (𝜑 → ((1^st ‘𝐹)‘𝑌) ∈ 𝐴)
31	11, 15, 1, 4, 17, 16, 7, 28, 2	coccl 50050	. . . 4 ⊢ (𝜑 → (𝑅‘𝑌) ∈ (((1^st ‘𝐹)‘𝑌)(Hom ‘𝐶)𝑋))
32	15, 28, 24, 13, 30, 6, 16, 31	catlid 17620	. . 3 ⊢ (𝜑 → (((Id‘𝐶)‘𝑋)(⟨((1^st ‘𝐹)‘𝑌), 𝑋⟩ · 𝑋)(𝑅‘𝑌)) = (𝑅‘𝑌))
33	27, 32	eqtrd 2772	. 2 ⊢ (𝜑 → (((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐾)‘𝑌)⟩ · ((1^st ‘𝐾)‘𝑍))(𝑅‘𝑌)) = (𝑅‘𝑌))
34	10, 20, 33	3eqtr3rd 2781	1 ⊢ (𝜑 → (𝑅‘𝑌) = ((𝑅‘𝑍)(⟨((1^st ‘𝐹)‘𝑌), ((1^st ‘𝐹)‘𝑍)⟩ · 𝑋)((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ⟨cop 4588 ‘cfv 6502 (class class class)co 7370 1^st c1st 7943 2^nd c2nd 7944 Basecbs 17150 Hom chom 17202 compcco 17203 Idccid 17602 Nat cnat 17882 Δ_funccdiag 18149

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-er 8647 df-map 8779 df-ixp 8850 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-dec 12622 df-uz 12766 df-fz 13438 df-struct 17088 df-slot 17123 df-ndx 17135 df-base 17151 df-hom 17215 df-cco 17216 df-cat 17605 df-cid 17606 df-func 17796 df-nat 17884 df-xpc 18109 df-1stf 18110 df-curf 18151 df-diag 18153

This theorem is referenced by: (None)

W3C validator