Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  slmdvs0 Structured version   Visualization version   GIF version

Theorem slmdvs0 33886
Description: Anything times the zero vector is the zero vector. Equation 1b of [Kreyszig] p. 51. (hvmul0 31685 analog.) (Contributed by NM, 12-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
slmdvs0.f 𝐹 = (Scalar‘𝑊)
slmdvs0.s · = ( ·𝑠 ‘𝑊)
slmdvs0.k 𝐾 = (Base‘𝐹)
slmdvs0.z 0 = (0g‘𝑊)
Assertion
Ref Expression
slmdvs0 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 )

Proof of Theorem slmdvs0
StepHypRef Expression
1 slmdvs0.f . . . . 5 𝐹 = (Scalar‘𝑊)
21slmdsrg 33868 . . . 4 (𝑊 ∈ SLMod → 𝐹 ∈ SRing)
3 slmdvs0.k . . . . 5 𝐾 = (Base‘𝐹)
4 eqid 2766 . . . . 5 (.r‘𝐹) = (.r‘𝐹)
5 eqid 2766 . . . . 5 (0g‘𝐹) = (0g‘𝐹)
63, 4, 5srgrz 20486 . . . 4 ((𝐹 ∈ SRing ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
72, 6sylan 592 . . 3 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
87oveq1d 7465 . 2 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = ((0g‘𝐹) · 0 ))
9 simpl 488 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑊 ∈ SLMod)
10 simpr 490 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑋 ∈ 𝐾)
112adantr 486 . . . . 5 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝐹 ∈ SRing)
123, 5srg0cl 20479 . . . . 5 (𝐹 ∈ SRing → (0g‘𝐹) ∈ 𝐾)
1311, 12syl 18 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (0g‘𝐹) ∈ 𝐾)
14 eqid 2766 . . . . . 6 (Base‘𝑊) = (Base‘𝑊)
15 slmdvs0.z . . . . . 6 0 = (0g‘𝑊)
1614, 15slmd0vcl 33882 . . . . 5 (𝑊 ∈ SLMod → 0 ∈ (Base‘𝑊))
1716adantr 486 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 0 ∈ (Base‘𝑊))
18 slmdvs0.s . . . . 5 · = ( ·𝑠 ‘𝑊)
1914, 1, 18, 3, 4slmdvsass 33878 . . . 4 ((𝑊 ∈ SLMod ∧ (𝑋 ∈ 𝐾 ∧ (0g‘𝐹) ∈ 𝐾 ∧ 0 ∈ (Base‘𝑊))) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
209, 10, 13, 17, 19syl13anc 1402 . . 3 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
2114, 1, 18, 5, 15slmd0vs 33885 . . . . 5 ((𝑊 ∈ SLMod ∧ 0 ∈ (Base‘𝑊)) → ((0g‘𝐹) · 0 ) = 0 )
2217, 21syldan 603 . . . 4 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((0g‘𝐹) · 0 ) = 0 )
2322oveq2d 7466 . . 3 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · ((0g‘𝐹) · 0 )) = (𝑋 · 0 ))
2420, 23eqtrd 2801 . 2 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · 0 ))
258, 24, 223eqtr3d 2809 1 ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  .rcmulr 17475  Scalarcsca 17477   ·𝑠 cvsca 17478  0gc0g 17662  SRingcsrg 20465  SLModcslmd 33861
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-iota 6519  df-fun 6567  df-fv 6573  df-riota 7407  df-ov 7453  df-0g 17664  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-cmn 20049  df-srg 20466  df-slmd 33862
This theorem is used by:  gsumvsca1  33887
  Copyright terms: Public domain W3C validator