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

Theorem lmodvs0 14659
Description: Anything times the zero vector is the zero vector. Equation 1b of [Kreyszig] p. 51. (Contributed by NM, 12-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.)
Hypotheses
Ref Expression
lmodvs0.f  |-  F  =  (Scalar `  W )
lmodvs0.s  |-  .x.  =  ( .s `  W )
lmodvs0.k  |-  K  =  ( Base `  F
)
lmodvs0.z  |-  .0.  =  ( 0g `  W )
Assertion
Ref Expression
lmodvs0  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  ( X  .x.  .0.  )  =  .0.  )

Proof of Theorem lmodvs0
StepHypRef Expression
1 lmodvs0.f . . . . 5  |-  F  =  (Scalar `  W )
21lmodring 14631 . . . 4  |-  ( W  e.  LMod  ->  F  e. 
Ring )
3 lmodvs0.k . . . . 5  |-  K  =  ( Base `  F
)
4 eqid 2238 . . . . 5  |-  ( .r
`  F )  =  ( .r `  F
)
5 eqid 2238 . . . . 5  |-  ( 0g
`  F )  =  ( 0g `  F
)
63, 4, 5ringrz 14349 . . . 4  |-  ( ( F  e.  Ring  /\  X  e.  K )  ->  ( X ( .r `  F ) ( 0g
`  F ) )  =  ( 0g `  F ) )
72, 6sylan 283 . . 3  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  ( X ( .r `  F ) ( 0g
`  F ) )  =  ( 0g `  F ) )
87oveq1d 6100 . 2  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  (
( X ( .r
`  F ) ( 0g `  F ) )  .x.  .0.  )  =  ( ( 0g
`  F )  .x.  .0.  ) )
9 simpl 109 . . . 4  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  W  e.  LMod )
10 simpr 110 . . . 4  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  X  e.  K )
112adantr 276 . . . . 5  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  F  e.  Ring )
123, 5ring0cl 14326 . . . . 5  |-  ( F  e.  Ring  ->  ( 0g
`  F )  e.  K )
1311, 12syl 14 . . . 4  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  ( 0g `  F )  e.  K )
14 eqid 2238 . . . . . 6  |-  ( Base `  W )  =  (
Base `  W )
15 lmodvs0.z . . . . . 6  |-  .0.  =  ( 0g `  W )
1614, 15lmod0vcl 14654 . . . . 5  |-  ( W  e.  LMod  ->  .0.  e.  ( Base `  W )
)
1716adantr 276 . . . 4  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  .0.  e.  ( Base `  W
) )
18 lmodvs0.s . . . . 5  |-  .x.  =  ( .s `  W )
1914, 1, 18, 3, 4lmodvsass 14650 . . . 4  |-  ( ( W  e.  LMod  /\  ( X  e.  K  /\  ( 0g `  F )  e.  K  /\  .0.  e.  ( Base `  W
) ) )  -> 
( ( X ( .r `  F ) ( 0g `  F
) )  .x.  .0.  )  =  ( X  .x.  ( ( 0g `  F )  .x.  .0.  ) ) )
209, 10, 13, 17, 19syl13anc 1280 . . 3  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  (
( X ( .r
`  F ) ( 0g `  F ) )  .x.  .0.  )  =  ( X  .x.  ( ( 0g `  F )  .x.  .0.  ) ) )
2114, 1, 18, 5, 15lmod0vs 14658 . . . . 5  |-  ( ( W  e.  LMod  /\  .0.  e.  ( Base `  W
) )  ->  (
( 0g `  F
)  .x.  .0.  )  =  .0.  )
2217, 21syldan 282 . . . 4  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  (
( 0g `  F
)  .x.  .0.  )  =  .0.  )
2322oveq2d 6101 . . 3  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  ( X  .x.  ( ( 0g
`  F )  .x.  .0.  ) )  =  ( X  .x.  .0.  )
)
2420, 23eqtrd 2271 . 2  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  (
( X ( .r
`  F ) ( 0g `  F ) )  .x.  .0.  )  =  ( X  .x.  .0.  ) )
258, 24, 223eqtr3d 2279 1  |-  ( ( W  e.  LMod  /\  X  e.  K )  ->  ( X  .x.  .0.  )  =  .0.  )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   ` cfv 5377  (class class class)co 6085   Basecbs 13352   .rcmulr 13432  Scalarcsca 13434   .scvsca 13435   0gc0g 13610   Ringcrg 14300   LModclmod 14623
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-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-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-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-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-sca 13447  df-vsca 13448  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-mgp 14218  df-ring 14302  df-lmod 14625
This theorem is used by:  lmodfopne  14663  lsssn0  14707
  Copyright terms: Public domain W3C validator