Theorem srgmgp 20126

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 2736	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		srgmgp.g	. . 3 ⊢ 𝐺 = (mulGrp‘𝑅)
3		eqid 2736	. . 3 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		eqid 2736	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5		eqid 2736	. . 3 ⊢ (0g‘𝑅) = (0g‘𝑅)
6	1, 2, 3, 4, 5	issrg 20123	. 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 1146	1 ⊢ (𝑅 ∈ SRing → 𝐺 ∈ Mnd)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  +_gcplusg 17177  ._rcmulr 17178  0_gc0g 17359  Mndcmnd 18659  CMndccmn 19709  mulGrpcmgp 20075  SRingcsrg 20121

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 2708  ax-nul 5251

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 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-iota 6448  df-fv 6500  df-ov 7361  df-srg 20122

This theorem is referenced by:  srgcl  20128  srgass  20129  srgideu  20130  srgidcl  20134  srgidmlem  20136  srg1zr  20150  srgpcomp  20153  srgpcompp  20154  srgpcomppsc  20155  srg1expzeq1  20160  srgbinomlem1  20161  srgbinomlem4  20164  srgbinomlem  20165