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

Theorem subrgsubm 14515
Description: A subring is a submonoid of the multiplicative monoid. (Contributed by Mario Carneiro, 15-Jun-2015.)
Hypothesis
Ref Expression
subrgsubm.1  |-  M  =  (mulGrp `  R )
Assertion
Ref Expression
subrgsubm  |-  ( A  e.  (SubRing `  R
)  ->  A  e.  (SubMnd `  M ) )

Proof of Theorem subrgsubm
StepHypRef Expression
1 eqid 2238 . . 3  |-  ( Base `  R )  =  (
Base `  R )
21subrgss 14503 . 2  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
3 eqid 2238 . . 3  |-  ( 1r
`  R )  =  ( 1r `  R
)
43subrg1cl 14510 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  A
)
5 subrgrcl 14507 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
6 eqid 2238 . . . . 5  |-  ( Rs  A )  =  ( Rs  A )
7 subrgsubm.1 . . . . 5  |-  M  =  (mulGrp `  R )
86, 7mgpress 14205 . . . 4  |-  ( ( R  e.  Ring  /\  A  e.  (SubRing `  R )
)  ->  ( Ms  A
)  =  (mulGrp `  ( Rs  A ) ) )
95, 8mpancom 426 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( Ms  A
)  =  (mulGrp `  ( Rs  A ) ) )
106subrgring 14505 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  ( Rs  A
)  e.  Ring )
11 eqid 2238 . . . . 5  |-  (mulGrp `  ( Rs  A ) )  =  (mulGrp `  ( Rs  A
) )
1211ringmgp 14280 . . . 4  |-  ( ( Rs  A )  e.  Ring  -> 
(mulGrp `  ( Rs  A
) )  e.  Mnd )
1310, 12syl 14 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  (mulGrp `  ( Rs  A ) )  e. 
Mnd )
149, 13eqeltrd 2315 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( Ms  A
)  e.  Mnd )
157ringmgp 14280 . . . . 5  |-  ( R  e.  Ring  ->  M  e. 
Mnd )
16 eqid 2238 . . . . . 6  |-  ( Base `  M )  =  (
Base `  M )
17 eqid 2238 . . . . . 6  |-  ( 0g
`  M )  =  ( 0g `  M
)
18 eqid 2238 . . . . . 6  |-  ( Ms  A )  =  ( Ms  A )
1916, 17, 18issubm2 13757 . . . . 5  |-  ( M  e.  Mnd  ->  ( A  e.  (SubMnd `  M
)  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M
)  e.  A  /\  ( Ms  A )  e.  Mnd ) ) )
2015, 19syl 14 . . . 4  |-  ( R  e.  Ring  ->  ( A  e.  (SubMnd `  M
)  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M
)  e.  A  /\  ( Ms  A )  e.  Mnd ) ) )
215, 20syl 14 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( A  e.  (SubMnd `  M )  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M )  e.  A  /\  ( Ms  A )  e.  Mnd )
) )
227, 1mgpbasg 14200 . . . . . . 7  |-  ( R  e.  Ring  ->  ( Base `  R )  =  (
Base `  M )
)
2322sseq2d 3278 . . . . . 6  |-  ( R  e.  Ring  ->  ( A 
C_  ( Base `  R
)  <->  A  C_  ( Base `  M ) ) )
247, 3ringidvalg 14239 . . . . . . 7  |-  ( R  e.  Ring  ->  ( 1r
`  R )  =  ( 0g `  M
) )
2524eleq1d 2307 . . . . . 6  |-  ( R  e.  Ring  ->  ( ( 1r `  R )  e.  A  <->  ( 0g `  M )  e.  A
) )
2623, 253anbi12d 1354 . . . . 5  |-  ( R  e.  Ring  ->  ( ( A  C_  ( Base `  R )  /\  ( 1r `  R )  e.  A  /\  ( Ms  A )  e.  Mnd )  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M )  e.  A  /\  ( Ms  A )  e.  Mnd )
) )
2726bibi2d 232 . . . 4  |-  ( R  e.  Ring  ->  ( ( A  e.  (SubMnd `  M )  <->  ( A  C_  ( Base `  R
)  /\  ( 1r `  R )  e.  A  /\  ( Ms  A )  e.  Mnd ) )  <->  ( A  e.  (SubMnd `  M )  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M )  e.  A  /\  ( Ms  A )  e.  Mnd )
) ) )
285, 27syl 14 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( ( A  e.  (SubMnd `  M
)  <->  ( A  C_  ( Base `  R )  /\  ( 1r `  R
)  e.  A  /\  ( Ms  A )  e.  Mnd ) )  <->  ( A  e.  (SubMnd `  M )  <->  ( A  C_  ( Base `  M )  /\  ( 0g `  M )  e.  A  /\  ( Ms  A )  e.  Mnd )
) ) )
2921, 28mpbird 167 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( A  e.  (SubMnd `  M )  <->  ( A  C_  ( Base `  R )  /\  ( 1r `  R )  e.  A  /\  ( Ms  A )  e.  Mnd )
) )
302, 4, 14, 29mpbir3and 1211 1  |-  ( A  e.  (SubRing `  R
)  ->  A  e.  (SubMnd `  M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5372  (class class class)co 6075   Basecbs 13330   ↾s cress 13331   0gc0g 13587   Mndcmnd 13706  SubMndcsubmnd 13742  mulGrpcmgp 14194   1rcur 14237   Ringcrg 14274  SubRingcsubrg 14498
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-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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-submnd 13744  df-mgp 14195  df-ur 14238  df-ring 14276  df-subrg 14500
This theorem is referenced by:  resrhm  14529  resrhm2b  14530  rhmima  14532  lgseisenlem4  16106
  Copyright terms: Public domain W3C validator