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

Theorem lmodring 14569
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 2234 . . 3  |-  ( Base `  W )  =  (
Base `  W )
2 eqid 2234 . . 3  |-  ( +g  `  W )  =  ( +g  `  W )
3 eqid 2234 . . 3  |-  ( .s
`  W )  =  ( .s `  W
)
4 lmodring.1 . . 3  |-  F  =  (Scalar `  W )
5 eqid 2234 . . 3  |-  ( Base `  F )  =  (
Base `  F )
6 eqid 2234 . . 3  |-  ( +g  `  F )  =  ( +g  `  F )
7 eqid 2234 . . 3  |-  ( .r
`  F )  =  ( .r `  F
)
8 eqid 2234 . . 3  |-  ( 1r
`  F )  =  ( 1r `  F
)
91, 2, 3, 4, 5, 6, 7, 8islmod 14565 . 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 2205   A.wral 2522   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   .rcmulr 13375  Scalarcsca 13377   .scvsca 13378   Grpcgrp 13755   1rcur 14202   Ringcrg 14239   LModclmod 14561
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-ov 6061  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-mulr 13388  df-sca 13390  df-vsca 13391  df-lmod 14563
This theorem is referenced by:  lmodfgrp  14570  lmodmcl  14574  lmod0cl  14588  lmod1cl  14589  lmod0vs  14595  lmodvs0  14596  lmodvsmmulgdi  14597  lmodvsneg  14605  lmodsubvs  14617  lmodsubdi  14618  lmodsubdir  14619  lssvnegcl  14650  islss3  14653
  Copyright terms: Public domain W3C validator