Theorem srgmgp 20163

Description: A semiring is a monoid under multiplication. (Contributed by Thierry Arnoux, 21-Mar-2018.)

Hypothesis

Ref	Expression
srgmgp.g	⊢ 𝐺 = (mulGrp‘𝑅)

Assertion

Ref	Expression
srgmgp	⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd)

Proof of Theorem srgmgp

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2739	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		srgmgp.g	. . 3 ⊢ 𝐺 = (mulGrp‘𝑅)
3		eqid 2739	. . 3 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		eqid 2739	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5		eqid 2739	. . 3 ⊢ (0g‘𝑅) = (0g‘𝑅)
6	1, 2, 3, 4, 5	issrg 20160	. 2 ⊢ (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ 𝐺 ∈ Mnd ∧ ∀𝑥 ∈ (Base‘𝑅)(∀𝑦 ∈ (Base‘𝑅)∀𝑧 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)(𝑦(+g‘𝑅)𝑧)) = ((𝑥(.r‘𝑅)𝑦)(+g‘𝑅)(𝑥(.r‘𝑅)𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦)(.r‘𝑅)𝑧) = ((𝑥(.r‘𝑅)𝑧)(+g‘𝑅)(𝑦(.r‘𝑅)𝑧))) ∧ (((0g‘𝑅)(.r‘𝑅)𝑥) = (0g‘𝑅) ∧ (𝑥(.r‘𝑅)(0g‘𝑅)) = (0g‘𝑅)))))
7	6	simp2bi 1152	1 ⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  ∀wral 3053  ‘cfv 6485  (class class class)co 7356  Basecbs 17170  +_gcplusg 17211  ._rcmulr 17212  0_gc0g 17393  Mndcmnd 18693  CMndccmn 19746  mulGrpcmgp 20112  SRingcsrg 20158

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-nul 5228

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-iota 6441  df-fv 6493  df-ov 7359  df-srg 20159

This theorem is referenced by:  srgcl  20165  srgass  20166  srgideu  20167  srgidcl  20171  srgidmlem  20173  srg1zr  20187  srgpcomp  20190  srgpcompp  20191  srgpcomppsc  20192  srg1expzeq1  20197  srgbinomlem1  20198  srgbinomlem4  20201  srgbinomlem  20202