Theorem srgmgp 20319

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7419  Basecbs 17293  +_gcplusg 17334  ._rcmulr 17335  0_gc0g 17516  Mndcmnd 18826  CMndccmn 19896  mulGrpcmgp 20262  SRingcsrg 20314

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-nul 5271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-srg 20315

This theorem is used by:  srgcl  20321  srgass  20322  srgideu  20323  srgidcl  20327  srgidmlem  20329  srg1zr  20343  srgpcomp  20346  srgpcompp  20347  srgpcomppsc  20348  srg1expzeq1  20353  srgbinomlem1  20354  srgbinomlem4  20357  srgbinomlem  20358