Theorem bj-endmnd 38135

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 38133	. . 3 ⊢ (𝜑 → (Base‘((End ‘𝐶)‘𝑋)) = (𝑋(Hom ‘𝐶)𝑋))
4	3	eqcomd 2766	. 2 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑋) = (Base‘((End ‘𝐶)‘𝑋)))
5	1, 2	bj-endcomp 38134	. . 3 ⊢ (𝜑 → (+g‘((End ‘𝐶)‘𝑋)) = (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋))
6	5	eqcomd 2766	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋) = (+g‘((End ‘𝐶)‘𝑋)))
7		eqid 2760	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2760	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9		eqid 2760	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
10	1	3ad2ant1 1151	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
11	2	3ad2ant1 1151	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
12		simp3 1156	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
13		simp2 1155	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
14	7, 8, 9, 10, 11, 11, 11, 12, 13	catcocl 17798	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦) ∈ (𝑋(Hom ‘𝐶)𝑋))
15	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝐶 ∈ Cat)
16	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑋 ∈ (Base‘𝐶))
17		simpr 490	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)))
18		simp3 1156	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
19	17, 18	syl 18	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
20		simp2 1155	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
21	17, 20	syl 18	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
22		simp1 1154	. . . 4 ⊢ ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
23	17, 22	syl 18	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
24	7, 8, 9, 15, 16, 16, 16, 19, 21, 16, 23	catass 17799	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → ((𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧) = (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)(𝑦(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧)))
25		eqid 2760	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
26	7, 8, 25, 1, 2	catidcl 17795	. 2 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
27	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
28	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
29		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
30	7, 8, 25, 27, 28, 9, 28, 29	catlid 17796	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (((Id‘𝐶)‘𝑋)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑥) = 𝑥)
31	7, 8, 25, 27, 28, 9, 28, 29	catrid 17797	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)((Id‘𝐶)‘𝑋)) = 𝑥)
32	4, 6, 14, 24, 26, 30, 31	ismndd 18885	1 ⊢ (𝜑 → ((End ‘𝐶)‘𝑋) ∈ Mnd)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ⟨cop 4590  ‘cfv 6535  (class class class)co 7416  Basecbs 17326  +_gcplusg 17367  Hom chom 17378  compcco 17379  Catccat 17777  Idccid 17778  Mndcmnd 18862  End cend 38130

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 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742  ax-cnex 11205  ax-resscn 11206  ax-1cn 11207  ax-icn 11208  ax-addcl 11209  ax-addrcl 11210  ax-mulcl 11211  ax-mulrcl 11212  ax-mulcom 11213  ax-addass 11214  ax-mulass 11215  ax-distr 11216  ax-i2m1 11217  ax-1ne0 11218  ax-1rid 11219  ax-rnegex 11220  ax-rrecex 11221  ax-cnre 11222  ax-pre-lttri 11223  ax-pre-lttrn 11224  ax-pre-ltadd 11225  ax-pre-mulgt0 11226

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-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6301  df-ord 6362  df-on 6363  df-lim 6364  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7869  df-2nd 7993  df-frecs 8285  df-wrecs 8316  df-recs 8365  df-rdg 8404  df-er 8703  df-en 8960  df-dom 8961  df-sdom 8962  df-pnf 11294  df-mnf 11295  df-xr 11296  df-ltxr 11297  df-le 11298  df-sub 11492  df-neg 11493  df-nn 12283  df-2 12352  df-slot 17299  df-ndx 17311  df-base 17327  df-plusg 17380  df-cat 17781  df-cid 17782  df-mgm 18755  df-sgrp 18847  df-mnd 18863  df-bj-end 38131

This theorem is used by: (None)