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 29386 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 31460 | . . . 4 ⊢ (𝑊 ∈ SLMod → 𝐹 ∈ SRing) |
3 | slmdvs0.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
4 | eqid 2738 | . . . . 5 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
5 | eqid 2738 | . . . . 5 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
6 | 3, 4, 5 | srgrz 19762 | . . . 4 ⊢ ((𝐹 ∈ SRing ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹)) |
7 | 2, 6 | sylan 580 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋(.r‘𝐹)(0g‘𝐹)) = (0g‘𝐹)) |
8 | 7 | oveq1d 7290 | . 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 19755 | . . . . 5 ⊢ (𝐹 ∈ SRing → (0g‘𝐹) ∈ 𝐾) |
13 | 11, 12 | syl 17 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (0g‘𝐹) ∈ 𝐾) |
14 | eqid 2738 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | slmdvs0.z | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
16 | 14, 15 | slmd0vcl 31474 | . . . . 5 ⊢ (𝑊 ∈ SLMod → 0 ∈ (Base‘𝑊)) |
17 | 16 | adantr 481 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → 0 ∈ (Base‘𝑊)) |
18 | slmdvs0.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
19 | 14, 1, 18, 3, 4 | slmdvsass 31470 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ (𝑋 ∈ 𝐾 ∧ (0g‘𝐹) ∈ 𝐾 ∧ 0 ∈ (Base‘𝑊))) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 ))) |
20 | 9, 10, 13, 17, 19 | syl13anc 1371 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · ((0g‘𝐹) · 0 ))) |
21 | 14, 1, 18, 5, 15 | slmd0vs 31477 | . . . . 5 ⊢ ((𝑊 ∈ SLMod ∧ 0 ∈ (Base‘𝑊)) → ((0g‘𝐹) · 0 ) = 0 ) |
22 | 17, 21 | syldan 591 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((0g‘𝐹) · 0 ) = 0 ) |
23 | 22 | oveq2d 7291 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · ((0g‘𝐹) · 0 )) = (𝑋 · 0 )) |
24 | 20, 23 | eqtrd 2778 | . 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → ((𝑋(.r‘𝐹)(0g‘𝐹)) · 0 ) = (𝑋 · 0 )) |
25 | 8, 24, 22 | 3eqtr3d 2786 | 1 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝐾) → (𝑋 · 0 ) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 .rcmulr 16963 Scalarcsca 16965 ·𝑠 cvsca 16966 0gc0g 17150 SRingcsrg 19741 SLModcslmd 31453 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-riota 7232 df-ov 7278 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-cmn 19388 df-srg 19742 df-slmd 31454 |
This theorem is referenced by: gsumvsca1 31479 |
Copyright terms: Public domain | W3C validator |