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

Theorem ringidmlem 14034
Description: Lemma for ringlidm 14035 and ringridm 14036. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 27-Dec-2014.)
Hypotheses
Ref Expression
rngidm.b  |-  B  =  ( Base `  R
)
rngidm.t  |-  .x.  =  ( .r `  R )
rngidm.u  |-  .1.  =  ( 1r `  R )
Assertion
Ref Expression
ringidmlem  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  /\  ( X  .x.  .1.  )  =  X ) )

Proof of Theorem ringidmlem
StepHypRef Expression
1 eqid 2231 . . . 4  |-  (mulGrp `  R )  =  (mulGrp `  R )
21ringmgp 14014 . . 3  |-  ( R  e.  Ring  ->  (mulGrp `  R )  e.  Mnd )
3 simpr 110 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  e.  B )
4 rngidm.b . . . . . 6  |-  B  =  ( Base `  R
)
51, 4mgpbasg 13938 . . . . 5  |-  ( R  e.  Ring  ->  B  =  ( Base `  (mulGrp `  R ) ) )
65adantr 276 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  B  =  ( Base `  (mulGrp `  R ) ) )
73, 6eleqtrd 2310 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  e.  ( Base `  (mulGrp `  R ) ) )
8 eqid 2231 . . . 4  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
9 eqid 2231 . . . 4  |-  ( +g  `  (mulGrp `  R )
)  =  ( +g  `  (mulGrp `  R )
)
10 eqid 2231 . . . 4  |-  ( 0g
`  (mulGrp `  R )
)  =  ( 0g
`  (mulGrp `  R )
)
118, 9, 10mndlrid 13516 . . 3  |-  ( ( (mulGrp `  R )  e.  Mnd  /\  X  e.  ( Base `  (mulGrp `  R ) ) )  ->  ( ( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X )  =  X  /\  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) )
122, 7, 11syl2an2r 599 . 2  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X )  =  X  /\  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) )
13 rngidm.t . . . . . . 7  |-  .x.  =  ( .r `  R )
141, 13mgpplusgg 13936 . . . . . 6  |-  ( R  e.  Ring  ->  .x.  =  ( +g  `  (mulGrp `  R ) ) )
1514adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  .x.  =  ( +g  `  (mulGrp `  R ) ) )
16 rngidm.u . . . . . . 7  |-  .1.  =  ( 1r `  R )
171, 16ringidvalg 13973 . . . . . 6  |-  ( R  e.  Ring  ->  .1.  =  ( 0g `  (mulGrp `  R ) ) )
1817adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  .1.  =  ( 0g `  (mulGrp `  R ) ) )
19 eqidd 2232 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  =  X )
2015, 18, 19oveq123d 6038 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (  .1.  .x.  X )  =  ( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X ) )
2120eqeq1d 2240 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  <->  ( ( 0g `  (mulGrp `  R
) ) ( +g  `  (mulGrp `  R )
) X )  =  X ) )
2215, 19, 18oveq123d 6038 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .1.  )  =  ( X ( +g  `  (mulGrp `  R )
) ( 0g `  (mulGrp `  R ) ) ) )
2322eqeq1d 2240 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( X  .x.  .1.  )  =  X  <->  ( X
( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) )
2421, 23anbi12d 473 . 2  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
( (  .1.  .x.  X )  =  X  /\  ( X  .x.  .1.  )  =  X
)  <->  ( ( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X )  =  X  /\  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) ) )
2512, 24mpbird 167 1  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  /\  ( X  .x.  .1.  )  =  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   .rcmulr 13160   0gc0g 13338   Mndcmnd 13498  mulGrpcmgp 13932   1rcur 13971   Ringcrg 14008
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-mgp 13933  df-ur 13972  df-ring 14010
This theorem is referenced by:  ringlidm  14035  ringridm  14036  ringid  14038  subrg1  14244
  Copyright terms: Public domain W3C validator