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

Theorem rspcl 14765
Description: The span of a set of ring elements is an ideal. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
Hypotheses
Ref Expression
rspcl.k  |-  K  =  (RSpan `  R )
rspcl.b  |-  B  =  ( Base `  R
)
rspcl.u  |-  U  =  (LIdeal `  R )
Assertion
Ref Expression
rspcl  |-  ( ( R  e.  Ring  /\  G  C_  B )  ->  ( K `  G )  e.  U )

Proof of Theorem rspcl
StepHypRef Expression
1 rlmlmod 14738 . . 3  |-  ( R  e.  Ring  ->  (ringLMod `  R
)  e.  LMod )
2 rspcl.b . . . . . 6  |-  B  =  ( Base `  R
)
3 rlmbasg 14729 . . . . . 6  |-  ( R  e.  Ring  ->  ( Base `  R )  =  (
Base `  (ringLMod `  R
) ) )
42, 3eqtrid 2279 . . . . 5  |-  ( R  e.  Ring  ->  B  =  ( Base `  (ringLMod `  R ) ) )
54sseq2d 3272 . . . 4  |-  ( R  e.  Ring  ->  ( G 
C_  B  <->  G  C_  ( Base `  (ringLMod `  R
) ) ) )
65biimpa 296 . . 3  |-  ( ( R  e.  Ring  /\  G  C_  B )  ->  G  C_  ( Base `  (ringLMod `  R ) ) )
7 eqid 2234 . . . 4  |-  ( Base `  (ringLMod `  R )
)  =  ( Base `  (ringLMod `  R )
)
8 eqid 2234 . . . 4  |-  ( LSubSp `  (ringLMod `  R )
)  =  ( LSubSp `  (ringLMod `  R )
)
9 eqid 2234 . . . 4  |-  ( LSpan `  (ringLMod `  R )
)  =  ( LSpan `  (ringLMod `  R )
)
107, 8, 9lspcl 14665 . . 3  |-  ( ( (ringLMod `  R )  e.  LMod  /\  G  C_  ( Base `  (ringLMod `  R
) ) )  -> 
( ( LSpan `  (ringLMod `  R ) ) `  G )  e.  (
LSubSp `  (ringLMod `  R
) ) )
111, 6, 10syl2an2r 599 . 2  |-  ( ( R  e.  Ring  /\  G  C_  B )  ->  (
( LSpan `  (ringLMod `  R
) ) `  G
)  e.  ( LSubSp `  (ringLMod `  R )
) )
12 rspcl.k . . . . . 6  |-  K  =  (RSpan `  R )
13 rspvalg 14746 . . . . . 6  |-  ( R  e.  Ring  ->  (RSpan `  R )  =  (
LSpan `  (ringLMod `  R
) ) )
1412, 13eqtrid 2279 . . . . 5  |-  ( R  e.  Ring  ->  K  =  ( LSpan `  (ringLMod `  R
) ) )
1514fveq1d 5677 . . . 4  |-  ( R  e.  Ring  ->  ( K `
 G )  =  ( ( LSpan `  (ringLMod `  R ) ) `  G ) )
16 rspcl.u . . . . 5  |-  U  =  (LIdeal `  R )
17 lidlvalg 14745 . . . . 5  |-  ( R  e.  Ring  ->  (LIdeal `  R )  =  (
LSubSp `  (ringLMod `  R
) ) )
1816, 17eqtrid 2279 . . . 4  |-  ( R  e.  Ring  ->  U  =  ( LSubSp `  (ringLMod `  R
) ) )
1915, 18eleq12d 2305 . . 3  |-  ( R  e.  Ring  ->  ( ( K `  G )  e.  U  <->  ( ( LSpan `  (ringLMod `  R
) ) `  G
)  e.  ( LSubSp `  (ringLMod `  R )
) ) )
2019adantr 276 . 2  |-  ( ( R  e.  Ring  /\  G  C_  B )  ->  (
( K `  G
)  e.  U  <->  ( ( LSpan `  (ringLMod `  R
) ) `  G
)  e.  ( LSubSp `  (ringLMod `  R )
) ) )
2111, 20mpbird 167 1  |-  ( ( R  e.  Ring  /\  G  C_  B )  ->  ( K `  G )  e.  U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205    C_ wss 3214   ` cfv 5357   Basecbs 13296   Ringcrg 14239   LModclmod 14561   LSubSpclss 14626   LSpanclspn 14660  ringLModcrglmod 14708  LIdealclidl 14741  RSpancrsp 14742
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  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-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-mulr 13388  df-sca 13390  df-vsca 13391  df-ip 13392  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-minusg 13759  df-sbg 13760  df-subg 13923  df-mgp 14160  df-ur 14203  df-ring 14241  df-subrg 14465  df-lmod 14563  df-lssm 14627  df-lsp 14661  df-sra 14709  df-rgmod 14710  df-lidl 14743  df-rsp 14744
This theorem is referenced by:  znlidl  14908  zndvds  14923
  Copyright terms: Public domain W3C validator