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

Theorem ringidmlem 12998
Description: Lemma for ringlidm 12999 and ringridm 13000. (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 2175 . . . 4  |-  (mulGrp `  R )  =  (mulGrp `  R )
21ringmgp 12978 . . 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 12930 . . . . 5  |-  ( R  e.  Ring  ->  B  =  ( Base `  (mulGrp `  R ) ) )
65adantr 276 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  B  =  ( Base `  (mulGrp `  R ) ) )
73, 6eleqtrd 2254 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  e.  ( Base `  (mulGrp `  R ) ) )
8 eqid 2175 . . . 4  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
9 eqid 2175 . . . 4  |-  ( +g  `  (mulGrp `  R )
)  =  ( +g  `  (mulGrp `  R )
)
10 eqid 2175 . . . 4  |-  ( 0g
`  (mulGrp `  R )
)  =  ( 0g
`  (mulGrp `  R )
)
118, 9, 10mndlrid 12700 . . 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 595 . 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 12929 . . . . . 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 12937 . . . . . 6  |-  ( R  e.  Ring  ->  .1.  =  ( 0g `  (mulGrp `  R ) ) )
1817adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  .1.  =  ( 0g `  (mulGrp `  R ) ) )
19 eqidd 2176 . . . . 5  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  X  =  X )
2015, 18, 19oveq123d 5886 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (  .1.  .x.  X )  =  ( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X ) )
2120eqeq1d 2184 . . 3  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  <->  ( ( 0g `  (mulGrp `  R
) ) ( +g  `  (mulGrp `  R )
) X )  =  X ) )
2215, 19, 18oveq123d 5886 . . . 4  |-  ( ( R  e.  Ring  /\  X  e.  B )  ->  ( X  .x.  .1.  )  =  ( X ( +g  `  (mulGrp `  R )
) ( 0g `  (mulGrp `  R ) ) ) )
2322eqeq1d 2184 . . 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 1353    e. wcel 2146   ` cfv 5208  (class class class)co 5865   Basecbs 12428   +g cplusg 12492   .rcmulr 12493   0gc0g 12626   Mndcmnd 12682  mulGrpcmgp 12925   1rcur 12935   Ringcrg 12972
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-addcom 7886  ax-addass 7888  ax-i2m1 7891  ax-0lt1 7892  ax-0id 7894  ax-rnegex 7895  ax-pre-ltirr 7898  ax-pre-ltadd 7902
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-pnf 7968  df-mnf 7969  df-ltxr 7971  df-inn 8891  df-2 8949  df-3 8950  df-ndx 12431  df-slot 12432  df-base 12434  df-sets 12435  df-plusg 12505  df-mulr 12506  df-0g 12628  df-mgm 12640  df-sgrp 12673  df-mnd 12683  df-mgp 12926  df-ur 12936  df-ring 12974
This theorem is referenced by:  ringlidm  12999  ringridm  13000  ringid  13002
  Copyright terms: Public domain W3C validator