Theorem iscrng 14015

Description: A commutative ring is a ring whose multiplication is a commutative monoid. (Contributed by Mario Carneiro, 7-Jan-2015.)

Hypothesis

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

Assertion

Ref	Expression
iscrng	⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ 𝐺 ∈ CMnd))

Proof of Theorem iscrng

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 5639	. . . 4 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅))
2		ringmgp.g	. . . 4 ⊢ 𝐺 = (mulGrp‘𝑅)
3	1, 2	eqtr4di 2282	. . 3 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = 𝐺)
4	3	eleq1d 2300	. 2 ⊢ (𝑟 = 𝑅 → ((mulGrp‘𝑟) ∈ CMnd ↔ 𝐺 ∈ CMnd))
5		df-cring 14011	. 2 ⊢ CRing = {𝑟 ∈ Ring ∣ (mulGrp‘𝑟) ∈ CMnd}
6	4, 5	elrab2 2965	1 ⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ 𝐺 ∈ CMnd))

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  ‘cfv 5326  CMndccmn 13870  mulGrpcmgp 13932  Ringcrg 14008  CRingccrg 14009

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-rab 2519  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-cring 14011

This theorem is referenced by:  crngmgp  14016  crngring  14020  iscrng2  14027  crngpropd  14051  iscrngd  14054  subrgcrng  14238