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

Theorem srgcmn 20207
Description: A semiring is a commutative monoid. (Contributed by Thierry Arnoux, 21-Mar-2018.)
Assertion
Ref Expression
srgcmn (𝑅 ∈ SRing → 𝑅 ∈ CMnd)

Proof of Theorem srgcmn
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2735 . . 3 (Base‘𝑅) = (Base‘𝑅)
2 eqid 2735 . . 3 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3 eqid 2735 . . 3 (+g𝑅) = (+g𝑅)
4 eqid 2735 . . 3 (.r𝑅) = (.r𝑅)
5 eqid 2735 . . 3 (0g𝑅) = (0g𝑅)
61, 2, 3, 4, 5issrg 20206 . 2 (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝑅)(∀𝑦 ∈ (Base‘𝑅)∀𝑧 ∈ (Base‘𝑅)((𝑥(.r𝑅)(𝑦(+g𝑅)𝑧)) = ((𝑥(.r𝑅)𝑦)(+g𝑅)(𝑥(.r𝑅)𝑧)) ∧ ((𝑥(+g𝑅)𝑦)(.r𝑅)𝑧) = ((𝑥(.r𝑅)𝑧)(+g𝑅)(𝑦(.r𝑅)𝑧))) ∧ (((0g𝑅)(.r𝑅)𝑥) = (0g𝑅) ∧ (𝑥(.r𝑅)(0g𝑅)) = (0g𝑅)))))
76simp1bi 1144 1 (𝑅 ∈ SRing → 𝑅 ∈ CMnd)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  wral 3059  cfv 6563  (class class class)co 7431  Basecbs 17245  +gcplusg 17298  .rcmulr 17299  0gc0g 17486  Mndcmnd 18760  CMndccmn 19813  mulGrpcmgp 20152  SRingcsrg 20204
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-nul 5312
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-ral 3060  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-iota 6516  df-fv 6571  df-ov 7434  df-srg 20205
This theorem is referenced by:  srgmnd  20208  srgcom  20224  srgsummulcr  20241  sgsummulcl  20242  srgbinomlem3  20246  srgbinomlem4  20247  srgbinomlem  20248  gsumvsca2  33216
  Copyright terms: Public domain W3C validator