Theorem slmdvs0 33652

Description: Anything times the zero vector is the zero vector. Equation 1b of [Kreyszig] p. 51. (hvmul0 31491 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 33634	. . . 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 20347	. . . 4 ⊢ ((𝐹 ∈ SRing ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
7	2, 6	sylan 592	. . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹))
8	7	oveq1d 7431	. 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = ((0g‘𝐹) · 0 ))
9		simpl 488	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑊 ∈ SLMod)
10		simpr 490	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑋 ∈ 𝐾)
11	2	adantr 486	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝐹 ∈ SRing)
12	3, 5	srg0cl 20340	. . . . 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 33648	. . . . 5 ⊢ (𝑊 ∈ SLMod → 0 ∈ (Base‘𝑊))
17	16	adantr 486	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 0 ∈ (Base‘𝑊))
18		slmdvs0.s	. . . . 5 ⊢ · = ( ·𝑠 ‘𝑊)
19	14, 1, 18, 3, 4	slmdvsass 33644	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ (𝑋 ∈ 𝐾 ∧ (0g‘𝐹) ∈ 𝐾 ∧ 0 ∈ (Base‘𝑊))) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
20	9, 10, 13, 17, 19	syl13anc 1399	. . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 )))
21	14, 1, 18, 5, 15	slmd0vs 33651	. . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 0 ∈ (Base‘𝑊)) → ((0g‘𝐹) · 0 ) = 0 )
22	17, 21	syldan 603	. . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((0g‘𝐹) · 0 ) = 0 )
23	22	oveq2d 7432	. . 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 401   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7416  Basecbs 17305  ._rcmulr 17347  Scalarcsca 17349   ·_𝑠 cvsca 17350  0_gc0g 17528  SRingcsrg 20326  SLModcslmd 33627

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7373  df-ov 7419  df-0g 17530  df-mgm 18734  df-sgrp 18823  df-mnd 18839  df-cmn 19910  df-srg 20327  df-slmd 33628

This theorem is used by:  gsumvsca1  33653