Theorem iscrng 13139

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

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1353   ∈ wcel 2148  ‘cfv 5216  CMndccmn 13041  mulGrpcmgp 13083  Ringcrg 13132  CRingccrg 13133

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-rab 2464  df-v 2739  df-un 3133  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-br 4004  df-iota 5178  df-fv 5224  df-cring 13135

This theorem is referenced by:  crngmgp  13140  crngring  13144  iscrng2  13151  crngpropd  13171  iscrngd  13174  subrgcrng  13306