Theorem bj-endmnd 37279

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 37277	. . 3 ⊢ (𝜑 → (Base‘((End ‘𝐶)‘𝑋)) = (𝑋(Hom ‘𝐶)𝑋))
4	3	eqcomd 2735	. 2 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑋) = (Base‘((End ‘𝐶)‘𝑋)))
5	1, 2	bj-endcomp 37278	. . 3 ⊢ (𝜑 → (+g‘((End ‘𝐶)‘𝑋)) = (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋))
6	5	eqcomd 2735	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋) = (+g‘((End ‘𝐶)‘𝑋)))
7		eqid 2729	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2729	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9		eqid 2729	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
10	1	3ad2ant1 1133	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
11	2	3ad2ant1 1133	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
12		simp3 1138	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
13		simp2 1137	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
14	7, 8, 9, 10, 11, 11, 11, 12, 13	catcocl 17622	. 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 1138	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
19	17, 18	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
20		simp2 1137	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
21	17, 20	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
22		simp1 1136	. . . 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 17623	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → ((𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧) = (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)(𝑦(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧)))
25		eqid 2729	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
26	7, 8, 25, 1, 2	catidcl 17619	. 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 17620	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (((Id‘𝐶)‘𝑋)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑥) = 𝑥)
31	7, 8, 25, 27, 28, 9, 28, 29	catrid 17621	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)((Id‘𝐶)‘𝑋)) = 𝑥)
32	4, 6, 14, 24, 26, 30, 31	ismndd 18659	1 ⊢ (𝜑 → ((End ‘𝐶)‘𝑋) ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2109  ⟨cop 4591  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  +_gcplusg 17196  Hom chom 17207  compcco 17208  Catccat 17601  Idccid 17602  Mndcmnd 18637  End cend 37274

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 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121

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 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-nn 12163  df-2 12225  df-slot 17128  df-ndx 17140  df-base 17156  df-plusg 17209  df-cat 17605  df-cid 17606  df-mgm 18543  df-sgrp 18622  df-mnd 18638  df-bj-end 37275

This theorem is referenced by: (None)