![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > slmdvs0 | Structured version Visualization version GIF version |
Description: Anything times the zero vector is the zero vector. Equation 1b of [Kreyszig] p. 51. (hvmul0 29966 analog.) (Contributed by NM, 12-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
Ref | Expression |
---|---|
slmdvs0.f | ⊢ 𝐹 = (Scalar‘𝑊) |
slmdvs0.s | ⊢ · = ( ·𝑠 ‘𝑊) |
slmdvs0.k | ⊢ 𝐾 = (Base‘𝐹) |
slmdvs0.z | ⊢ 0 = (0g‘𝑊) |
Ref | Expression |
---|---|
slmdvs0 | ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | slmdvs0.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
2 | 1 | slmdsrg 32042 | . . . 4 ⊢ (𝑊 ∈ SLMod → 𝐹 ∈ SRing) |
3 | slmdvs0.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
4 | eqid 2736 | . . . . 5 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
5 | eqid 2736 | . . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
6 | 3, 4, 5 | srgrz 19938 | . . . 4 ⊢ ((𝐹 ∈ SRing ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹)) |
7 | 2, 6 | sylan 580 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹)) |
8 | 7 | oveq1d 7372 | . 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = ((0g‘𝐹) · 0 )) |
9 | simpl 483 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑊 ∈ SLMod) | |
10 | simpr 485 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝑋 ∈ 𝐾) | |
11 | 2 | adantr 481 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 𝐹 ∈ SRing) |
12 | 3, 5 | srg0cl 19931 | . . . . 5 ⊢ (𝐹 ∈ SRing → (0g‘𝐹) ∈ 𝐾) |
13 | 11, 12 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (0g‘𝐹) ∈ 𝐾) |
14 | eqid 2736 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | slmdvs0.z | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
16 | 14, 15 | slmd0vcl 32056 | . . . . 5 ⊢ (𝑊 ∈ SLMod → 0 ∈ (Base‘𝑊)) |
17 | 16 | adantr 481 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 0 ∈ (Base‘𝑊)) |
18 | slmdvs0.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
19 | 14, 1, 18, 3, 4 | slmdvsass 32052 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ (𝑋 ∈ 𝐾 ∧ (0g‘𝐹) ∈ 𝐾 ∧ 0 ∈ (Base‘𝑊))) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 ))) |
20 | 9, 10, 13, 17, 19 | syl13anc 1372 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 ))) |
21 | 14, 1, 18, 5, 15 | slmd0vs 32059 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 0 ∈ (Base‘𝑊)) → ((0g‘𝐹) · 0 ) = 0 ) |
22 | 17, 21 | syldan 591 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((0g‘𝐹) · 0 ) = 0 ) |
23 | 22 | oveq2d 7373 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · ((0g‘𝐹) · 0 )) = (𝑋 · 0 )) |
24 | 20, 23 | eqtrd 2776 | . 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · 0 )) |
25 | 8, 24, 22 | 3eqtr3d 2784 | 1 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ‘cfv 6496 (class class class)co 7357 Basecbs 17083 .rcmulr 17134 Scalarcsca 17136 ·𝑠 cvsca 17137 0gc0g 17321 SRingcsrg 19917 SLModcslmd 32035 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pr 5384 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-iota 6448 df-fun 6498 df-fv 6504 df-riota 7313 df-ov 7360 df-0g 17323 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-cmn 19564 df-srg 19918 df-slmd 32036 |
This theorem is referenced by: gsumvsca1 32061 |
Copyright terms: Public domain | W3C validator |