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

Theorem subrgsubm 14542
Description: A subring is a submonoid of the multiplicative monoid. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypothesis
Ref Expression
subrgsubm.1 𝑀 = (mulGrp‘𝑅)
Assertion
Ref Expression
subrgsubm (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀))

Proof of Theorem subrgsubm
StepHypRef Expression
1 eqid 2238 . . 3 (Base‘𝑅) = (Base‘𝑅)
21subrgss 14530 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
3 eqid 2238 . . 3 (1r𝑅) = (1r𝑅)
43subrg1cl 14537 . 2 (𝐴 ∈ (SubRing‘𝑅) → (1r𝑅) ∈ 𝐴)
5 subrgrcl 14534 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
6 eqid 2238 . . . . 5 (𝑅s 𝐴) = (𝑅s 𝐴)
7 subrgsubm.1 . . . . 5 𝑀 = (mulGrp‘𝑅)
86, 7mgpress 14230 . . . 4 ((𝑅 ∈ Ring ∧ 𝐴 ∈ (SubRing‘𝑅)) → (𝑀s 𝐴) = (mulGrp‘(𝑅s 𝐴)))
95, 8mpancom 426 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (𝑀s 𝐴) = (mulGrp‘(𝑅s 𝐴)))
106subrgring 14532 . . . 4 (𝐴 ∈ (SubRing‘𝑅) → (𝑅s 𝐴) ∈ Ring)
11 eqid 2238 . . . . 5 (mulGrp‘(𝑅s 𝐴)) = (mulGrp‘(𝑅s 𝐴))
1211ringmgp 14306 . . . 4 ((𝑅s 𝐴) ∈ Ring → (mulGrp‘(𝑅s 𝐴)) ∈ Mnd)
1310, 12syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (mulGrp‘(𝑅s 𝐴)) ∈ Mnd)
149, 13eqeltrd 2315 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝑀s 𝐴) ∈ Mnd)
157ringmgp 14306 . . . . 5 (𝑅 ∈ Ring → 𝑀 ∈ Mnd)
16 eqid 2238 . . . . . 6 (Base‘𝑀) = (Base‘𝑀)
17 eqid 2238 . . . . . 6 (0g𝑀) = (0g𝑀)
18 eqid 2238 . . . . . 6 (𝑀s 𝐴) = (𝑀s 𝐴)
1916, 17, 18issubm2 13780 . . . . 5 (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)))
2015, 19syl 14 . . . 4 (𝑅 ∈ Ring → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)))
215, 20syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)))
227, 1mgpbasg 14224 . . . . . . 7 (𝑅 ∈ Ring → (Base‘𝑅) = (Base‘𝑀))
2322sseq2d 3278 . . . . . 6 (𝑅 ∈ Ring → (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑀)))
247, 3ringidvalg 14264 . . . . . . 7 (𝑅 ∈ Ring → (1r𝑅) = (0g𝑀))
2524eleq1d 2307 . . . . . 6 (𝑅 ∈ Ring → ((1r𝑅) ∈ 𝐴 ↔ (0g𝑀) ∈ 𝐴))
2623, 253anbi12d 1354 . . . . 5 (𝑅 ∈ Ring → ((𝐴 ⊆ (Base‘𝑅) ∧ (1r𝑅) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)))
2726bibi2d 232 . . . 4 (𝑅 ∈ Ring → ((𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r𝑅) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)) ↔ (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd))))
285, 27syl 14 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ((𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r𝑅) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)) ↔ (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd))))
2921, 28mpbird 167 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑅) ∧ (1r𝑅) ∈ 𝐴 ∧ (𝑀s 𝐴) ∈ Mnd)))
302, 4, 14, 29mpbir3and 1211 1 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubMnd‘𝑀))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wb 105  w3a 1009   = wceq 1402  wcel 2209  wss 3220  cfv 5377  (class class class)co 6085  Basecbs 13352  s cress 13353  0gc0g 13610  Mndcmnd 13729  SubMndcsubmnd 13765  mulGrpcmgp 14217  1rcur 14262  Ringcrg 14300  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-reu 2535  df-rmo 2536  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-riota 6038  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-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-submnd 13767  df-mgp 14218  df-ur 14263  df-ring 14302  df-subrg 14527
This theorem is used by:  resrhm  14556  resrhm2b  14557  rhmima  14559  lgseisenlem4  16192
  Copyright terms: Public domain W3C validator