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

Theorem rspsn 14873
Description: Membership in principal ideals is closely related to divisibility. (Contributed by Stefan O'Rear, 3-Jan-2015.) (Revised by Mario Carneiro, 6-May-2015.)
Hypotheses
Ref Expression
rspsn.b  |-  B  =  ( Base `  R
)
rspsn.k  |-  K  =  (RSpan `  R )
rspsn.d  |-  .||  =  (
||r `  R )
Assertion
Ref Expression
rspsn  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( K `  { G } )  =  {
x  |  G  .||  x } )
Distinct variable groups:    x, R    x, G    x, B    x, K    x,  .||

Proof of Theorem rspsn
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 eqcom 2240 . . . . 5  |-  ( x  =  ( a ( .r `  R ) G )  <->  ( a
( .r `  R
) G )  =  x )
21a1i 9 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  =  ( a ( .r `  R
) G )  <->  ( a
( .r `  R
) G )  =  x ) )
32rexbidv 2551 . . 3  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( E. a  e.  B  x  =  ( a
( .r `  R
) G )  <->  E. a  e.  B  ( a
( .r `  R
) G )  =  x ) )
4 rlmlmod 14803 . . . . 5  |-  ( R  e.  Ring  ->  (ringLMod `  R
)  e.  LMod )
5 simpr 110 . . . . . 6  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  G  e.  B )
6 rspsn.b . . . . . . . 8  |-  B  =  ( Base `  R
)
7 rlmbasg 14794 . . . . . . . 8  |-  ( R  e.  Ring  ->  ( Base `  R )  =  (
Base `  (ringLMod `  R
) ) )
86, 7eqtrid 2283 . . . . . . 7  |-  ( R  e.  Ring  ->  B  =  ( Base `  (ringLMod `  R ) ) )
98adantr 276 . . . . . 6  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  B  =  ( Base `  (ringLMod `  R ) ) )
105, 9eleqtrd 2317 . . . . 5  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  G  e.  ( Base `  (ringLMod `  R ) ) )
11 eqid 2238 . . . . . 6  |-  (Scalar `  (ringLMod `  R ) )  =  (Scalar `  (ringLMod `  R ) )
12 eqid 2238 . . . . . 6  |-  ( Base `  (Scalar `  (ringLMod `  R
) ) )  =  ( Base `  (Scalar `  (ringLMod `  R )
) )
13 eqid 2238 . . . . . 6  |-  ( Base `  (ringLMod `  R )
)  =  ( Base `  (ringLMod `  R )
)
14 eqid 2238 . . . . . 6  |-  ( .s
`  (ringLMod `  R )
)  =  ( .s
`  (ringLMod `  R )
)
15 eqid 2238 . . . . . 6  |-  ( LSpan `  (ringLMod `  R )
)  =  ( LSpan `  (ringLMod `  R )
)
1611, 12, 13, 14, 15ellspsn 14756 . . . . 5  |-  ( ( (ringLMod `  R )  e.  LMod  /\  G  e.  ( Base `  (ringLMod `  R
) ) )  -> 
( x  e.  ( ( LSpan `  (ringLMod `  R
) ) `  { G } )  <->  E. a  e.  ( Base `  (Scalar `  (ringLMod `  R )
) ) x  =  ( a ( .s
`  (ringLMod `  R )
) G ) ) )
174, 10, 16syl2an2r 603 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  e.  ( (
LSpan `  (ringLMod `  R
) ) `  { G } )  <->  E. a  e.  ( Base `  (Scalar `  (ringLMod `  R )
) ) x  =  ( a ( .s
`  (ringLMod `  R )
) G ) ) )
18 rspsn.k . . . . . . . 8  |-  K  =  (RSpan `  R )
19 rspvalg 14811 . . . . . . . 8  |-  ( R  e.  Ring  ->  (RSpan `  R )  =  (
LSpan `  (ringLMod `  R
) ) )
2018, 19eqtrid 2283 . . . . . . 7  |-  ( R  e.  Ring  ->  K  =  ( LSpan `  (ringLMod `  R
) ) )
2120adantr 276 . . . . . 6  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  K  =  ( LSpan `  (ringLMod `  R ) ) )
2221fveq1d 5697 . . . . 5  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( K `  { G } )  =  ( ( LSpan `  (ringLMod `  R
) ) `  { G } ) )
2322eleq2d 2308 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  e.  ( K `
 { G }
)  <->  x  e.  (
( LSpan `  (ringLMod `  R
) ) `  { G } ) ) )
24 rlmscabas 14799 . . . . . . 7  |-  ( R  e.  Ring  ->  ( Base `  R )  =  (
Base `  (Scalar `  (ringLMod `  R ) ) ) )
256, 24eqtrid 2283 . . . . . 6  |-  ( R  e.  Ring  ->  B  =  ( Base `  (Scalar `  (ringLMod `  R )
) ) )
2625adantr 276 . . . . 5  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  B  =  ( Base `  (Scalar `  (ringLMod `  R )
) ) )
27 rlmvscag 14800 . . . . . . . 8  |-  ( R  e.  Ring  ->  ( .r
`  R )  =  ( .s `  (ringLMod `  R ) ) )
2827adantr 276 . . . . . . 7  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( .r `  R )  =  ( .s `  (ringLMod `  R ) ) )
2928oveqd 6102 . . . . . 6  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
a ( .r `  R ) G )  =  ( a ( .s `  (ringLMod `  R
) ) G ) )
3029eqeq2d 2250 . . . . 5  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  =  ( a ( .r `  R
) G )  <->  x  =  ( a ( .s
`  (ringLMod `  R )
) G ) ) )
3126, 30rexeqbidv 2766 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( E. a  e.  B  x  =  ( a
( .r `  R
) G )  <->  E. a  e.  ( Base `  (Scalar `  (ringLMod `  R )
) ) x  =  ( a ( .s
`  (ringLMod `  R )
) G ) ) )
3217, 23, 313bitr4d 220 . . 3  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  e.  ( K `
 { G }
)  <->  E. a  e.  B  x  =  ( a
( .r `  R
) G ) ) )
336a1i 9 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  B  =  ( Base `  R
) )
34 rspsn.d . . . . 5  |-  .||  =  (
||r `  R )
3534a1i 9 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  .||  =  (
||r `  R ) )
36 ringsrg 14354 . . . . 5  |-  ( R  e.  Ring  ->  R  e. SRing
)
3736adantr 276 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  R  e. SRing )
38 eqid 2238 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
3938a1i 9 . . . 4  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( .r `  R )  =  ( .r `  R
) )
4033, 35, 37, 39, 5dvdsr2d 14404 . . 3  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( G  .||  x  <->  E. a  e.  B  ( a
( .r `  R
) G )  =  x ) )
413, 32, 403bitr4d 220 . 2  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  (
x  e.  ( K `
 { G }
)  <->  G  .||  x ) )
4241eqabdv 2369 1  |-  ( ( R  e.  Ring  /\  G  e.  B )  ->  ( K `  { G } )  =  {
x  |  G  .||  x } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {cab 2224   E.wrex 2529   {csn 3709   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   Basecbs 13354   .rcmulr 13434  Scalarcsca 13436   .scvsca 13437  SRingcsrg 14269   Ringcrg 14302   ||rcdsr 14394   LModclmod 14625   LSpanclspn 14725  ringLModcrglmod 14773  RSpancrsp 14807
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-iress 13362  df-plusg 13446  df-mulr 13447  df-sca 13449  df-vsca 13450  df-ip 13451  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-minusg 13811  df-sbg 13812  df-subg 13975  df-cmn 14091  df-abl 14092  df-mgp 14220  df-ur 14265  df-srg 14270  df-ring 14304  df-dvdsr 14397  df-subrg 14529  df-lmod 14627  df-lssm 14692  df-lsp 14726  df-sra 14774  df-rgmod 14775  df-rsp 14809
This theorem is used by:  zndvds  14986
  Copyright terms: Public domain W3C validator