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

Theorem srgidmlem 14072
Description: Lemma for srglidm 14073 and srgridm 14074. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 27-Dec-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgidm.b  |-  B  =  ( Base `  R
)
srgidm.t  |-  .x.  =  ( .r `  R )
srgidm.u  |-  .1.  =  ( 1r `  R )
Assertion
Ref Expression
srgidmlem  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  /\  ( X  .x.  .1.  )  =  X ) )

Proof of Theorem srgidmlem
StepHypRef Expression
1 eqid 2231 . . . 4  |-  (mulGrp `  R )  =  (mulGrp `  R )
21srgmgp 14062 . . 3  |-  ( R  e. SRing  ->  (mulGrp `  R )  e.  Mnd )
3 srgidm.b . . . . . 6  |-  B  =  ( Base `  R
)
41, 3mgpbasg 14020 . . . . 5  |-  ( R  e. SRing  ->  B  =  (
Base `  (mulGrp `  R
) ) )
54eleq2d 2301 . . . 4  |-  ( R  e. SRing  ->  ( X  e.  B  <->  X  e.  ( Base `  (mulGrp `  R
) ) ) )
65biimpa 296 . . 3  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  X  e.  ( Base `  (mulGrp `  R ) ) )
7 eqid 2231 . . . 4  |-  ( Base `  (mulGrp `  R )
)  =  ( Base `  (mulGrp `  R )
)
8 eqid 2231 . . . 4  |-  ( +g  `  (mulGrp `  R )
)  =  ( +g  `  (mulGrp `  R )
)
9 eqid 2231 . . . 4  |-  ( 0g
`  (mulGrp `  R )
)  =  ( 0g
`  (mulGrp `  R )
)
107, 8, 9mndlrid 13597 . . 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 ) )
112, 6, 10syl2an2r 599 . 2  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  (
( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X )  =  X  /\  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) )
12 srgidm.t . . . . . . 7  |-  .x.  =  ( .r `  R )
131, 12mgpplusgg 14018 . . . . . 6  |-  ( R  e. SRing  ->  .x.  =  ( +g  `  (mulGrp `  R
) ) )
14 srgidm.u . . . . . . 7  |-  .1.  =  ( 1r `  R )
151, 14ringidvalg 14055 . . . . . 6  |-  ( R  e. SRing  ->  .1.  =  ( 0g `  (mulGrp `  R
) ) )
16 eqidd 2232 . . . . . 6  |-  ( R  e. SRing  ->  X  =  X )
1713, 15, 16oveq123d 6049 . . . . 5  |-  ( R  e. SRing  ->  (  .1.  .x.  X )  =  ( ( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X ) )
1817eqeq1d 2240 . . . 4  |-  ( R  e. SRing  ->  ( (  .1. 
.x.  X )  =  X  <->  ( ( 0g
`  (mulGrp `  R )
) ( +g  `  (mulGrp `  R ) ) X )  =  X ) )
1913, 16, 15oveq123d 6049 . . . . 5  |-  ( R  e. SRing  ->  ( X  .x.  .1.  )  =  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) ) )
2019eqeq1d 2240 . . . 4  |-  ( R  e. SRing  ->  ( ( X 
.x.  .1.  )  =  X 
<->  ( X ( +g  `  (mulGrp `  R )
) ( 0g `  (mulGrp `  R ) ) )  =  X ) )
2118, 20anbi12d 473 . . 3  |-  ( R  e. SRing  ->  ( ( (  .1.  .x.  X )  =  X  /\  ( X  .x.  .1.  )  =  X )  <->  ( (
( 0g `  (mulGrp `  R ) ) ( +g  `  (mulGrp `  R ) ) X )  =  X  /\  ( X ( +g  `  (mulGrp `  R ) ) ( 0g `  (mulGrp `  R ) ) )  =  X ) ) )
2221adantr 276 . 2  |-  ( ( R  e. SRing  /\  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 ) ) )
2311, 22mpbird 167 1  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  (
(  .1.  .x.  X
)  =  X  /\  ( X  .x.  .1.  )  =  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   ` cfv 5333  (class class class)co 6028   Basecbs 13162   +g cplusg 13240   .rcmulr 13241   0gc0g 13419   Mndcmnd 13579  mulGrpcmgp 14014   1rcur 14053  SRingcsrg 14057
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-pre-ltirr 8204  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-2 9261  df-3 9262  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-plusg 13253  df-mulr 13254  df-0g 13421  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-mgp 14015  df-ur 14054  df-srg 14058
This theorem is referenced by:  srglidm  14073  srgridm  14074
  Copyright terms: Public domain W3C validator