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

Theorem subrgsubm 14214
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 2229 . . 3  |-  ( Base `  R )  =  (
Base `  R )
21subrgss 14202 . 2  |-  ( A  e.  (SubRing `  R
)  ->  A  C_  ( Base `  R ) )
3 eqid 2229 . . 3  |-  ( 1r
`  R )  =  ( 1r `  R
)
43subrg1cl 14209 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( 1r `  R )  e.  A
)
5 subrgrcl 14206 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  R  e.  Ring )
6 eqid 2229 . . . . 5  |-  ( Rs  A )  =  ( Rs  A )
7 subrgsubm.1 . . . . 5  |-  M  =  (mulGrp `  R )
86, 7mgpress 13910 . . . 4  |-  ( ( R  e.  Ring  /\  A  e.  (SubRing `  R )
)  ->  ( Ms  A
)  =  (mulGrp `  ( Rs  A ) ) )
95, 8mpancom 422 . . 3  |-  ( A  e.  (SubRing `  R
)  ->  ( Ms  A
)  =  (mulGrp `  ( Rs  A ) ) )
106subrgring 14204 . . . 4  |-  ( A  e.  (SubRing `  R
)  ->  ( Rs  A
)  e.  Ring )
11 eqid 2229 . . . . 5  |-  (mulGrp `  ( Rs  A ) )  =  (mulGrp `  ( Rs  A
) )
1211ringmgp 13981 . . . 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 2306 . 2  |-  ( A  e.  (SubRing `  R
)  ->  ( Ms  A
)  e.  Mnd )
157ringmgp 13981 . . . . 5  |-  ( R  e.  Ring  ->  M  e. 
Mnd )
16 eqid 2229 . . . . . 6  |-  ( Base `  M )  =  (
Base `  M )
17 eqid 2229 . . . . . 6  |-  ( 0g
`  M )  =  ( 0g `  M
)
18 eqid 2229 . . . . . 6  |-  ( Ms  A )  =  ( Ms  A )
1916, 17, 18issubm2 13522 . . . . 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 13905 . . . . . . 7  |-  ( R  e.  Ring  ->  ( Base `  R )  =  (
Base `  M )
)
2322sseq2d 3254 . . . . . 6  |-  ( R  e.  Ring  ->  ( A 
C_  ( Base `  R
)  <->  A  C_  ( Base `  M ) ) )
247, 3ringidvalg 13940 . . . . . . 7  |-  ( R  e.  Ring  ->  ( 1r
`  R )  =  ( 0g `  M
) )
2524eleq1d 2298 . . . . . 6  |-  ( R  e.  Ring  ->  ( ( 1r `  R )  e.  A  <->  ( 0g `  M )  e.  A
) )
2623, 253anbi12d 1347 . . . . 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 1204 1  |-  ( A  e.  (SubRing `  R
)  ->  A  e.  (SubMnd `  M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200    C_ wss 3197   ` cfv 5318  (class class class)co 6007   Basecbs 13048   ↾s cress 13049   0gc0g 13305   Mndcmnd 13465  SubMndcsubmnd 13507  mulGrpcmgp 13899   1rcur 13938   Ringcrg 13975  SubRingcsubrg 14197
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-lttrn 8124  ax-pre-ltadd 8126
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-pnf 8194  df-mnf 8195  df-ltxr 8197  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13051  df-slot 13052  df-base 13054  df-sets 13055  df-iress 13056  df-plusg 13139  df-mulr 13140  df-0g 13307  df-mgm 13405  df-sgrp 13451  df-mnd 13466  df-submnd 13509  df-mgp 13900  df-ur 13939  df-ring 13977  df-subrg 14199
This theorem is referenced by:  resrhm  14228  resrhm2b  14229  rhmima  14231  lgseisenlem4  15768
  Copyright terms: Public domain W3C validator