Theorem slmdvs0 33554

Description: Anything times the zero vector is the zero vector. Equation 1b of [Kreyszig] p. 51. (hvmul0 31387 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

Step	Hyp	Ref	Expression
1		slmdvs0.f	. . . . 5 ⊢ 𝐹 = (Scalar‘𝑊)
2	1	slmdsrg 33536	. . . 4 ⊢ (𝑊 ∈ SLMod → 𝐹 ∈ SRing)
3		slmdvs0.k	. . . . 5 ⊢ 𝐾 = (Base‘𝐹)
4		eqid 2762	. . . . 5 ⊢ (.r‘𝐹) = (.r‘𝐹)
5		eqid 2762	. . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹)
6	3, 4, 5	srgrz 20295	. . . 4 ⊢ ((𝐹 ∈ SRing ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
7	2, 6	sylan 591	. . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
8	7	oveq1d 7427	. 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = ((0g‘𝐹) · 0 ))
9		simpl 487	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑊 ∈ SLMod)
10		simpr 489	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑋 ∈ 𝐾)
11	2	adantr 485	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝐹 ∈ SRing)
12	3, 5	srg0cl 20288	. . . . 5 ⊢ (𝐹 ∈ SRing → (0g‘𝐹) ∈ 𝐾)
13	11, 12	syl 18	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (0g‘𝐹) ∈ 𝐾)
14		eqid 2762	. . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊)
15		slmdvs0.z	. . . . . 6 ⊢ 0 = (0g‘𝑊)
16	14, 15	slmd0vcl 33550	. . . . 5 ⊢ (𝑊 ∈ SLMod → 0 ∈ (Base‘𝑊))
17	16	adantr 485	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 0 ∈ (Base‘𝑊))
18		slmdvs0.s	. . . . 5 ⊢ · = ( ·𝑠 ‘𝑊)
19	14, 1, 18, 3, 4	slmdvsass 33546	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ (𝑋 ∈ 𝐾 ∧ (0g‘𝐹) ∈ 𝐾 ∧ 0 ∈ (Base‘𝑊))) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
20	9, 10, 13, 17, 19	syl13anc 1398	. . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
21	14, 1, 18, 5, 15	slmd0vs 33553	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 0 ∈ (Base‘𝑊)) → ((0g‘𝐹) · 0 ) = 0 )
22	17, 21	syldan 602	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((0g‘𝐹) · 0 ) = 0 )
23	22	oveq2d 7428	. . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · ((0g‘𝐹) · 0 )) = (𝑋 · 0 ))
24	20, 23	eqtrd 2797	. 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · 0 ))
25	8, 24, 22	3eqtr3d 2805	1 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 )

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ‘cfv 6536  (class class class)co 7412  Basecbs 17275  ._rcmulr 17317  Scalarcsca 17319   ·_𝑠 cvsca 17320  0_gc0g 17498  SRingcsrg 20274  SLModcslmd 33529

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-iota 6492  df-fun 6538  df-fv 6544  df-riota 7369  df-ov 7415  df-0g 17500  df-mgm 18704  df-sgrp 18783  df-mnd 18799  df-cmn 19858  df-srg 20275  df-slmd 33530

This theorem is used by:  gsumvsca1  33555