ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subrgcrng GIF version

Theorem subrgcrng 14533
Description: A subring of a commutative ring is a commutative ring. (Contributed by Mario Carneiro, 10-Jan-2015.)
Hypothesis
Ref Expression
subrgring.1 𝑆 = (𝑅s 𝐴)
Assertion
Ref Expression
subrgcrng ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → 𝑆 ∈ CRing)

Proof of Theorem subrgcrng
StepHypRef Expression
1 subrgring.1 . . . 4 𝑆 = (𝑅s 𝐴)
21subrgring 14532 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
32adantl 277 . 2 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → 𝑆 ∈ Ring)
4 eqid 2238 . . . 4 (mulGrp‘𝑅) = (mulGrp‘𝑅)
51, 4mgpress 14230 . . 3 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → ((mulGrp‘𝑅) ↾s 𝐴) = (mulGrp‘𝑆))
6 eqidd 2239 . . . 4 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → ((mulGrp‘𝑅) ↾s 𝐴) = ((mulGrp‘𝑅) ↾s 𝐴))
74crngmgp 14308 . . . . 5 (𝑅 ∈ CRing → (mulGrp‘𝑅) ∈ CMnd)
87adantr 276 . . . 4 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → (mulGrp‘𝑅) ∈ CMnd)
9 eqid 2238 . . . . . . 7 (mulGrp‘𝑆) = (mulGrp‘𝑆)
109ringmgp 14306 . . . . . 6 (𝑆 ∈ Ring → (mulGrp‘𝑆) ∈ Mnd)
113, 10syl 14 . . . . 5 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → (mulGrp‘𝑆) ∈ Mnd)
125, 11eqeltrd 2315 . . . 4 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → ((mulGrp‘𝑅) ↾s 𝐴) ∈ Mnd)
13 simpr 110 . . . 4 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → 𝐴 ∈ (SubRing‘𝑅))
146, 8, 12, 13subcmnd 14137 . . 3 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → ((mulGrp‘𝑅) ↾s 𝐴) ∈ CMnd)
155, 14eqeltrrd 2316 . 2 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → (mulGrp‘𝑆) ∈ CMnd)
169iscrng 14307 . 2 (𝑆 ∈ CRing ↔ (𝑆 ∈ Ring ∧ (mulGrp‘𝑆) ∈ CMnd))
173, 15, 16sylanbrc 421 1 ((𝑅 ∈ CRing ∧ 𝐴 ∈ (SubRing‘𝑅)) → 𝑆 ∈ CRing)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  cfv 5377  (class class class)co 6085  s cress 13353  Mndcmnd 13729  CMndccmn 14087  mulGrpcmgp 14217  Ringcrg 14300  CRingccrg 14301  SubRingcsubrg 14525
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-mulr 13445  df-cmn 14089  df-mgp 14218  df-ring 14302  df-cring 14303  df-subrg 14527
This theorem is used by:  zringcrng  14927
  Copyright terms: Public domain W3C validator