| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lmodvsinv2 | Structured version Visualization version GIF version | ||
| Description: Multiplying a negated vector by a scalar. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| lmodvsinv2.b | ⊢ 𝐵 = (Base‘𝑊) |
| lmodvsinv2.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsinv2.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsinv2.n | ⊢ 𝑁 = (invg‘𝑊) |
| lmodvsinv2.k | ⊢ 𝐾 = (Base‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvsinv2 | ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1148 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ LMod) | |
| 2 | lmodgrp 20914 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
| 3 | 1, 2 | syl 17 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ Grp) |
| 4 | simp3 1150 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | lmodvsinv2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑊) | |
| 6 | eqid 2761 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 7 | eqid 2761 | . . . . . . 7 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 8 | lmodvsinv2.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑊) | |
| 9 | 5, 6, 7, 8 | grprinv 19015 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
| 10 | 3, 4, 9 | syl2anc 593 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
| 11 | 10 | oveq2d 7408 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = (𝑅 · (0g‘𝑊))) |
| 12 | simp2 1149 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ 𝐾) | |
| 13 | 5, 8 | grpinvcl 19012 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 14 | 3, 4, 13 | syl2anc 593 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 15 | lmodvsinv2.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 16 | lmodvsinv2.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 17 | lmodvsinv2.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 18 | 5, 6, 15, 16, 17 | lmodvsdi 20932 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
| 19 | 1, 12, 4, 14, 18 | syl13anc 1390 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
| 20 | 15, 16, 17, 7 | lmodvs0 20943 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
| 21 | 1, 12, 20 | syl2anc 593 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
| 22 | 11, 19, 21 | 3eqtr3d 2804 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊)) |
| 23 | 5, 15, 16, 17 | lmodvscl 20925 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 5, 15, 16, 17 | lmodvscl 20925 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
| 25 | 1, 12, 14, 24 | syl3anc 1389 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
| 26 | 5, 6, 7, 8 | grpinvid1 19016 | . . . 4 ⊢ ((𝑊 ∈ Grp ∧ (𝑅 · 𝑋) ∈ 𝐵 ∧ (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
| 27 | 3, 23, 25, 26 | syl3anc 1389 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
| 28 | 22, 27 | mpbird 259 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋))) |
| 29 | 28 | eqcomd 2767 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ‘cfv 6517 (class class class)co 7392 Basecbs 17228 +gcplusg 17269 Scalarcsca 17272 ·𝑠 cvsca 17273 0gc0g 17451 Grpcgrp 18958 invgcminusg 18959 LModclmod 20907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-plusg 17282 df-0g 17453 df-mgm 18657 df-sgrp 18736 df-mnd 18752 df-grp 18961 df-minusg 18962 df-cmn 19805 df-abl 19806 df-mgp 20170 df-rng 20182 df-ur 20211 df-ring 20264 df-lmod 20909 |
| This theorem is referenced by: invlmhm 21089 eqgvscpbl 33497 |
| Copyright terms: Public domain | W3C validator |