Theorem iscrng 20379

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 6878	. . . 4 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = (mulGrp‘𝑅))
2		ringmgp.g	. . . 4 ⊢ 𝐺 = (mulGrp‘𝑅)
3	1, 2	eqtr4di 2813	. . 3 ⊢ (𝑟 = 𝑅 → (mulGrp‘𝑟) = 𝐺)
4	3	eleq1d 2845	. 2 ⊢ (𝑟 = 𝑅 → ((mulGrp‘𝑟) ∈ CMnd ↔ 𝐺 ∈ CMnd))
5		df-cring 20375	. 2 ⊢ CRing = {𝑟 ∈ Ring ∣ (mulGrp‘𝑟) ∈ CMnd}
6	4, 5	elrab2 3649	1 ⊢ (𝑅 ∈ CRing ↔ (𝑅 ∈ Ring ∧ 𝐺 ∈ CMnd))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ‘cfv 6533  CMndccmn 19907  mulGrpcmgp 20273  Ringcrg 20372  CRingccrg 20373

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 2147  ax-9 2155  ax-ext 2732

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 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541  df-cring 20375

This theorem is used by:  crngmgp  20380  crngring  20384  iscrng2  20391  crngpropd  20431  iscrngd  20434  prdscrngd  20462  subrgcrng  20737  psrcrng  22186  cntrcrng  33521  0ringcring  33692