concom - Mathbox for Zhi Wang

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

Theorem concom 50687

Description: A 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‘𝐶)
concom.r	⊢ (𝜑 → 𝑅 ∈ (𝐾𝑁𝐹))

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

**Proof of Theorem concom**
Step	Hyp	Ref	Expression
1		islmd.n	. . 3 ⊢ 𝑁 = (𝐷 Nat 𝐶)
2		concom.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ (𝐾𝑁𝐹))
3	1, 2	nat1st2nd 18076	. . 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 18080	. 2 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐾)‘𝑍)⟩ · ((1^st ‘𝐹)‘𝑍))((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)) = (((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)(⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍))(𝑅‘𝑌)))
11		islmd.l	. . . . . . 7 ⊢ 𝐿 = (𝐶Δ_func𝐷)
12	1, 3	natrcl3 50249	. . . . . . . 8 ⊢ (𝜑 → (1^st ‘𝐹)(𝐷 Func 𝐶)(2^nd ‘𝐹))
13	12	funcrcl3 50104	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ Cat)
14	12	funcrcl2 50103	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ Cat)
15		islmd.a	. . . . . . 7 ⊢ 𝐴 = (Base‘𝐶)
16		concl.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
17		concl.k	. . . . . . 7 ⊢ 𝐾 = ((1^st ‘𝐿)‘𝑋)
18	11, 13, 14, 15, 16, 17, 4, 7	diag11 18364	. . . . . 6 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑌) = 𝑋)
19	11, 13, 14, 15, 16, 17, 4, 8	diag11 18364	. . . . . 6 ⊢ (𝜑 → ((1^st ‘𝐾)‘𝑍) = 𝑋)
20	18, 19	opeq12d 4841	. . . . 5 ⊢ (𝜑 → ⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐾)‘𝑍)⟩ = ⟨𝑋, 𝑋⟩)
21	20	oveq1d 7424	. . . 4 ⊢ (𝜑 → (⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐾)‘𝑍)⟩ · ((1^st ‘𝐹)‘𝑍)) = (⟨𝑋, 𝑋⟩ · ((1^st ‘𝐹)‘𝑍)))
22		eqidd 2761	. . . 4 ⊢ (𝜑 → (𝑅‘𝑍) = (𝑅‘𝑍))
23		eqid 2760	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
24	11, 13, 14, 15, 16, 17, 4, 7, 5, 23, 8, 9	diag12 18365	. . . 4 ⊢ (𝜑 → ((𝑌(2^nd ‘𝐾)𝑍)‘𝑀) = ((Id‘𝐶)‘𝑋))
25	21, 22, 24	oveq123d 7430	. . 3 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐾)‘𝑍)⟩ · ((1^st ‘𝐹)‘𝑍))((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)) = ((𝑅‘𝑍)(⟨𝑋, 𝑋⟩ · ((1^st ‘𝐹)‘𝑍))((Id‘𝐶)‘𝑋)))
26		eqid 2760	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
27	4, 15, 12	funcf1 17988	. . . . 5 ⊢ (𝜑 → (1^st ‘𝐹):𝐵⟶𝐴)
28	27, 8	ffvelcdmd 7074	. . . 4 ⊢ (𝜑 → ((1^st ‘𝐹)‘𝑍) ∈ 𝐴)
29	11, 15, 1, 4, 17, 16, 8, 26, 2	concl 50685	. . . 4 ⊢ (𝜑 → (𝑅‘𝑍) ∈ (𝑋(Hom ‘𝐶)((1^st ‘𝐹)‘𝑍)))
30	15, 26, 23, 13, 16, 6, 28, 29	catrid 17805	. . 3 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨𝑋, 𝑋⟩ · ((1^st ‘𝐹)‘𝑍))((Id‘𝐶)‘𝑋)) = (𝑅‘𝑍))
31	25, 30	eqtrd 2795	. 2 ⊢ (𝜑 → ((𝑅‘𝑍)(⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐾)‘𝑍)⟩ · ((1^st ‘𝐹)‘𝑍))((𝑌(2^nd ‘𝐾)𝑍)‘𝑀)) = (𝑅‘𝑍))
32	18	opeq1d 4839	. . . 4 ⊢ (𝜑 → ⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐹)‘𝑌)⟩ = ⟨𝑋, ((1^st ‘𝐹)‘𝑌)⟩)
33	32	oveq1d 7424	. . 3 ⊢ (𝜑 → (⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍)) = (⟨𝑋, ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍)))
34	33	oveqd 7426	. 2 ⊢ (𝜑 → (((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)(⟨((1^st ‘𝐾)‘𝑌), ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍))(𝑅‘𝑌)) = (((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)(⟨𝑋, ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍))(𝑅‘𝑌)))
35	10, 31, 34	3eqtr3d 2803	1 ⊢ (𝜑 → (𝑅‘𝑍) = (((𝑌(2^nd ‘𝐹)𝑍)‘𝑀)(⟨𝑋, ((1^st ‘𝐹)‘𝑌)⟩ · ((1^st ‘𝐹)‘𝑍))(𝑅‘𝑌)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⟨cop 4590 ‘cfv 6528 (class class class)co 7409 1^st c1st 7983 2^nd c2nd 7984 Basecbs 17334 Hom chom 17386 compcco 17387 Idccid 17786 Nat cnat 18066 Δ_funccdiag 18333

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 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234

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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-er 8696 df-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-2 12360 df-3 12361 df-4 12362 df-5 12363 df-6 12364 df-7 12365 df-8 12366 df-9 12367 df-n0 12562 df-z 12649 df-dec 12770 df-uz 12921 df-fz 13595 df-struct 17272 df-slot 17307 df-ndx 17319 df-base 17335 df-hom 17399 df-cco 17400 df-cat 17789 df-cid 17790 df-func 17980 df-nat 18068 df-xpc 18293 df-1stf 18294 df-curf 18335 df-diag 18337

This theorem is used by: (None)

W3C validator