Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-endmnd Structured version   Visualization version   GIF version

Theorem bj-endmnd 37651
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.
StepHypRef Expression
1 bj-endval.c . . . 4 (𝜑𝐶 ∈ Cat)
2 bj-endval.x . . . 4 (𝜑𝑋 ∈ (Base‘𝐶))
31, 2bj-endbase 37649 . . 3 (𝜑 → (Base‘((End ‘𝐶)‘𝑋)) = (𝑋(Hom ‘𝐶)𝑋))
43eqcomd 2743 . 2 (𝜑 → (𝑋(Hom ‘𝐶)𝑋) = (Base‘((End ‘𝐶)‘𝑋)))
51, 2bj-endcomp 37650 . . 3 (𝜑 → (+g‘((End ‘𝐶)‘𝑋)) = (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋))
65eqcomd 2743 . 2 (𝜑 → (⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋) = (+g‘((End ‘𝐶)‘𝑋)))
7 eqid 2737 . . 3 (Base‘𝐶) = (Base‘𝐶)
8 eqid 2737 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
9 eqid 2737 . . 3 (comp‘𝐶) = (comp‘𝐶)
1013ad2ant1 1134 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
1123ad2ant1 1134 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
12 simp3 1139 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
13 simp2 1138 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
147, 8, 9, 10, 11, 11, 11, 12, 13catcocl 17645 . 2 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦) ∈ (𝑋(Hom ‘𝐶)𝑋))
151adantr 480 . . 3 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝐶 ∈ Cat)
162adantr 480 . . 3 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑋 ∈ (Base‘𝐶))
17 simpr 484 . . . 4 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)))
18 simp3 1139 . . . 4 ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
1917, 18syl 17 . . 3 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))
20 simp2 1138 . . . 4 ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
2117, 20syl 17 . . 3 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋))
22 simp1 1137 . . . 4 ((𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
2317, 22syl 17 . . 3 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
247, 8, 9, 15, 16, 16, 16, 19, 21, 16, 23catass 17646 . 2 ((𝜑 ∧ (𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑦 ∈ (𝑋(Hom ‘𝐶)𝑋) ∧ 𝑧 ∈ (𝑋(Hom ‘𝐶)𝑋))) → ((𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑦)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧) = (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)(𝑦(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑧)))
25 eqid 2737 . . 3 (Id‘𝐶) = (Id‘𝐶)
267, 8, 25, 1, 2catidcl 17642 . 2 (𝜑 → ((Id‘𝐶)‘𝑋) ∈ (𝑋(Hom ‘𝐶)𝑋))
271adantr 480 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝐶 ∈ Cat)
282adantr 480 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑋 ∈ (Base‘𝐶))
29 simpr 484 . . 3 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → 𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋))
307, 8, 25, 27, 28, 9, 28, 29catlid 17643 . 2 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (((Id‘𝐶)‘𝑋)(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)𝑥) = 𝑥)
317, 8, 25, 27, 28, 9, 28, 29catrid 17644 . 2 ((𝜑𝑥 ∈ (𝑋(Hom ‘𝐶)𝑋)) → (𝑥(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑋)((Id‘𝐶)‘𝑋)) = 𝑥)
324, 6, 14, 24, 26, 30, 31ismndd 18718 1 (𝜑 → ((End ‘𝐶)‘𝑋) ∈ Mnd)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087  wcel 2114  cop 4574  cfv 6493  (class class class)co 7361  Basecbs 17173  +gcplusg 17214  Hom chom 17225  compcco 17226  Catccat 17624  Idccid 17625  Mndcmnd 18696  End cend 37646
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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-cnex 11088  ax-resscn 11089  ax-1cn 11090  ax-icn 11091  ax-addcl 11092  ax-addrcl 11093  ax-mulcl 11094  ax-mulrcl 11095  ax-mulcom 11096  ax-addass 11097  ax-mulass 11098  ax-distr 11099  ax-i2m1 11100  ax-1ne0 11101  ax-1rid 11102  ax-rnegex 11103  ax-rrecex 11104  ax-cnre 11105  ax-pre-lttri 11106  ax-pre-lttrn 11107  ax-pre-ltadd 11108  ax-pre-mulgt0 11109
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 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7318  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-pnf 11175  df-mnf 11176  df-xr 11177  df-ltxr 11178  df-le 11179  df-sub 11373  df-neg 11374  df-nn 12169  df-2 12238  df-slot 17146  df-ndx 17158  df-base 17174  df-plusg 17227  df-cat 17628  df-cid 17629  df-mgm 18602  df-sgrp 18681  df-mnd 18697  df-bj-end 37647
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator