MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  srgmnd Structured version   Visualization version   GIF version

Theorem srgmnd 20116
Description: A semiring is a monoid. (Contributed by Thierry Arnoux, 21-Mar-2018.)
Assertion
Ref Expression
srgmnd (𝑅 ∈ SRing → 𝑅 ∈ Mnd)

Proof of Theorem srgmnd
StepHypRef Expression
1 srgcmn 20115 . 2 (𝑅 ∈ SRing → 𝑅 ∈ CMnd)
2 cmnmnd 19717 . 2 (𝑅 ∈ CMnd → 𝑅 ∈ Mnd)
31, 2syl 17 1 (𝑅 ∈ SRing → 𝑅 ∈ Mnd)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2113  Mndcmnd 18650  CMndccmn 19700  SRingcsrg 20112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-nul 5248
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-iota 6445  df-fv 6497  df-ov 7358  df-cmn 19702  df-srg 20113
This theorem is referenced by:  srg0cl  20126  srgacl  20131  srgcom4  20140  srg1zr  20141  srgmulgass  20143  srgpcomppsc  20146  srglmhm  20147  srgrmhm  20148  srgsummulcr  20149  sgsummulcl  20150  srgbinomlem2  20153  srgbinomlem3  20154  srgbinomlem4  20155  srgbinomlem  20156  srgbinom  20157  slmdacl  33219  slmdsn0  33221
  Copyright terms: Public domain W3C validator