| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > slmd0vs | Structured version Visualization version GIF version | ||
| Description: Zero times a vector is the zero vector. Equation 1a of [Kreyszig] p. 51. (ax-hvmul0 31103 analog.) (Contributed by NM, 12-Jan-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) (Revised by Thierry Arnoux, 1-Apr-2018.) |
| Ref | Expression |
|---|---|
| slmd0vs.v | ⊢ 𝑉 = (Base‘𝑊) |
| slmd0vs.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| slmd0vs.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| slmd0vs.o | ⊢ 𝑂 = (0g‘𝐹) |
| slmd0vs.z | ⊢ 0 = (0g‘𝑊) |
| Ref | Expression |
|---|---|
| slmd0vs | ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → (𝑂 · 𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 484 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → 𝑊 ∈ SLMod) | |
| 2 | slmd0vs.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 3 | eqid 2741 | . . . . . 6 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
| 4 | slmd0vs.o | . . . . . 6 ⊢ 𝑂 = (0g‘𝐹) | |
| 5 | 2, 3, 4 | slmd0cl 33303 | . . . . 5 ⊢ (𝑊 ∈ SLMod → 𝑂 ∈ (Base‘𝐹)) |
| 6 | 5 | adantr 482 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → 𝑂 ∈ (Base‘𝐹)) |
| 7 | simpr 486 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑉) | |
| 8 | slmd0vs.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 9 | eqid 2741 | . . . . 5 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 10 | slmd0vs.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 11 | slmd0vs.z | . . . . 5 ⊢ 0 = (0g‘𝑊) | |
| 12 | eqid 2741 | . . . . 5 ⊢ (+g‘𝐹) = (+g‘𝐹) | |
| 13 | eqid 2741 | . . . . 5 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 14 | eqid 2741 | . . . . 5 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 15 | 8, 9, 10, 11, 2, 3, 12, 13, 14, 4 | slmdlema 33288 | . . . 4 ⊢ ((𝑊 ∈ SLMod ∧ (𝑂 ∈ (Base‘𝐹) ∧ 𝑂 ∈ (Base‘𝐹)) ∧ (𝑋 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) → (((𝑂 · 𝑋) ∈ 𝑉 ∧ (𝑂 · (𝑋(+g‘𝑊)𝑋)) = ((𝑂 · 𝑋)(+g‘𝑊)(𝑂 · 𝑋)) ∧ ((𝑂(+g‘𝐹)𝑂) · 𝑋) = ((𝑂 · 𝑋)(+g‘𝑊)(𝑂 · 𝑋))) ∧ (((𝑂(.r‘𝐹)𝑂) · 𝑋) = (𝑂 · (𝑂 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ (𝑂 · 𝑋) = 0 ))) |
| 16 | 1, 6, 6, 7, 7, 15 | syl122anc 1388 | . . 3 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → (((𝑂 · 𝑋) ∈ 𝑉 ∧ (𝑂 · (𝑋(+g‘𝑊)𝑋)) = ((𝑂 · 𝑋)(+g‘𝑊)(𝑂 · 𝑋)) ∧ ((𝑂(+g‘𝐹)𝑂) · 𝑋) = ((𝑂 · 𝑋)(+g‘𝑊)(𝑂 · 𝑋))) ∧ (((𝑂(.r‘𝐹)𝑂) · 𝑋) = (𝑂 · (𝑂 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ (𝑂 · 𝑋) = 0 ))) |
| 17 | 16 | simprd 497 | . 2 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → (((𝑂(.r‘𝐹)𝑂) · 𝑋) = (𝑂 · (𝑂 · 𝑋)) ∧ ((1r‘𝐹) · 𝑋) = 𝑋 ∧ (𝑂 · 𝑋) = 0 )) |
| 18 | 17 | simp3d 1151 | 1 ⊢ ((𝑊 ∈ SLMod ∧ 𝑋 ∈ 𝑉) → (𝑂 · 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ‘cfv 6489 (class class class)co 7360 Basecbs 17174 +gcplusg 17215 .rcmulr 17216 Scalarcsca 17218 ·𝑠 cvsca 17219 0gc0g 17397 1rcur 20157 SLModcslmd 33285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-iota 6445 df-fun 6491 df-fv 6497 df-riota 7317 df-ov 7363 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-cmn 19752 df-srg 20163 df-slmd 33286 |
| This theorem is referenced by: slmdvs0 33310 gsumvsca2 33312 |
| Copyright terms: Public domain | W3C validator |