Theorem bj-endmnd 35416

Description: The monoid of endomorphisms on an object of a category is a monoid. (Contributed by BJ, 5-Apr-2024.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-endval.c	⊢ (𝜑 → 𝐶 ∈ Cat)
bj-endval.x	⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))

Assertion

Ref	Expression
bj-endmnd	⊢ (𝜑 → ((End ‘𝐶)‘𝑋) ∈ Mnd)

Proof of Theorem bj-endmnd

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-endval.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
2		bj-endval.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
3	1, 2	bj-endbase 35414	. . 3 ⊢ (𝜑 → (Base‘((End ‘𝐶)‘𝑋)) = (𝑋(Hom ‘𝐶)𝑋))
4	3	eqcomd 2744	. 2 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑋) = (Base‘((End ‘𝐶)‘𝑋)))
5	1, 2	bj-endcomp 35415	. . 3 ⊢ (𝜑 → (+g‘((End ‘𝐶)‘𝑋)) = (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋))
6	5	eqcomd 2744	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋) = (+g‘((End ‘𝐶)‘𝑋)))
7		eqid 2738	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2738	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9		eqid 2738	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
10	1	3ad2ant1 1131	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
11	2	3ad2ant1 1131	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
12		simp3 1136	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
13		simp2 1135	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
14	7, 8, 9, 10, 11, 11, 11, 12, 13	catcocl 17311	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦) ∈ (𝑋(Hom ‘𝐶)𝑋))
15	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝐶 ∈ Cat)
16	2	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑋 ∈ (Base‘𝐶))
17		simpr 484	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)))
18		simp3 1136	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
19	17, 18	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
20		simp2 1135	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
21	17, 20	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
22		simp1 1134	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
23	17, 22	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
24	7, 8, 9, 15, 16, 16, 16, 19, 21, 16, 23	catass 17312	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → ((𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧) = (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)(𝑦(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧)))
25		eqid 2738	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
26	7, 8, 25, 1, 2	catidcl 17308	. 2 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
27	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
28	2	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
29		simpr 484	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
30	7, 8, 25, 27, 28, 9, 28, 29	catlid 17309	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (((Id‘𝐶)‘𝑋)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑥) = 𝑥)
31	7, 8, 25, 27, 28, 9, 28, 29	catrid 17310	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)((Id‘𝐶)‘𝑋)) = 𝑥)
32	4, 6, 14, 24, 26, 30, 31	ismndd 18322	1 ⊢ (𝜑 → ((End ‘𝐶)‘𝑋) ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   ∈ wcel 2108  ⟨cop 4564  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  +_gcplusg 16888  Hom chom 16899  compcco 16900  Catccat 17290  Idccid 17291  Mndcmnd 18300  End cend 35411

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-slot 16811  df-ndx 16823  df-base 16841  df-plusg 16901  df-cat 17294  df-cid 17295  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-bj-end 35412

This theorem is referenced by: (None)