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

Theorem lmodring 14374
Description: The scalar component of a left module is a ring. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)
Hypothesis
Ref Expression
lmodring.1  |-  F  =  (Scalar `  W )
Assertion
Ref Expression
lmodring  |-  ( W  e.  LMod  ->  F  e. 
Ring )

Proof of Theorem lmodring
Dummy variables  r  q  w  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2231 . . 3  |-  ( Base `  W )  =  (
Base `  W )
2 eqid 2231 . . 3  |-  ( +g  `  W )  =  ( +g  `  W )
3 eqid 2231 . . 3  |-  ( .s
`  W )  =  ( .s `  W
)
4 lmodring.1 . . 3  |-  F  =  (Scalar `  W )
5 eqid 2231 . . 3  |-  ( Base `  F )  =  (
Base `  F )
6 eqid 2231 . . 3  |-  ( +g  `  F )  =  ( +g  `  F )
7 eqid 2231 . . 3  |-  ( .r
`  F )  =  ( .r `  F
)
8 eqid 2231 . . 3  |-  ( 1r
`  F )  =  ( 1r `  F
)
91, 2, 3, 4, 5, 6, 7, 8islmod 14370 . 2  |-  ( W  e.  LMod  <->  ( W  e. 
Grp  /\  F  e.  Ring  /\  A. q  e.  (
Base `  F ) A. r  e.  ( Base `  F ) A. x  e.  ( Base `  W ) A. w  e.  ( Base `  W
) ( ( ( r ( .s `  W ) w )  e.  ( Base `  W
)  /\  ( r
( .s `  W
) ( w ( +g  `  W ) x ) )  =  ( ( r ( .s `  W ) w ) ( +g  `  W ) ( r ( .s `  W
) x ) )  /\  ( ( q ( +g  `  F
) r ) ( .s `  W ) w )  =  ( ( q ( .s
`  W ) w ) ( +g  `  W
) ( r ( .s `  W ) w ) ) )  /\  ( ( ( q ( .r `  F ) r ) ( .s `  W
) w )  =  ( q ( .s
`  W ) ( r ( .s `  W ) w ) )  /\  ( ( 1r `  F ) ( .s `  W
) w )  =  w ) ) ) )
109simp2bi 1040 1  |-  ( W  e.  LMod  ->  F  e. 
Ring )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2202   A.wral 2511   ` cfv 5333  (class class class)co 6028   Basecbs 13145   +g cplusg 13223   .rcmulr 13224  Scalarcsca 13226   .scvsca 13227   Grpcgrp 13646   1rcur 14036   Ringcrg 14073   LModclmod 14366
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-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-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  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-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mulr 13237  df-sca 13239  df-vsca 13240  df-lmod 14368
This theorem is referenced by:  lmodfgrp  14375  lmodmcl  14379  lmod0cl  14393  lmod1cl  14394  lmod0vs  14400  lmodvs0  14401  lmodvsmmulgdi  14402  lmodvsneg  14410  lmodsubvs  14422  lmodsubdi  14423  lmodsubdir  14424  lssvnegcl  14455  islss3  14458
  Copyright terms: Public domain W3C validator