![]() |
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 1136 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ LMod) | |
2 | lmodgrp 20887 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
3 | 1, 2 | syl 17 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ Grp) |
4 | simp3 1138 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
5 | lmodvsinv2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑊) | |
6 | eqid 2740 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
7 | eqid 2740 | . . . . . . 7 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
8 | lmodvsinv2.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑊) | |
9 | 5, 6, 7, 8 | grprinv 19030 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
10 | 3, 4, 9 | syl2anc 583 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
11 | 10 | oveq2d 7464 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = (𝑅 · (0g‘𝑊))) |
12 | simp2 1137 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ 𝐾) | |
13 | 5, 8 | grpinvcl 19027 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
14 | 3, 4, 13 | syl2anc 583 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
15 | lmodvsinv2.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
16 | lmodvsinv2.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
17 | lmodvsinv2.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
18 | 5, 6, 15, 16, 17 | lmodvsdi 20905 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
19 | 1, 12, 4, 14, 18 | syl13anc 1372 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
20 | 15, 16, 17, 7 | lmodvs0 20916 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
21 | 1, 12, 20 | syl2anc 583 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
22 | 11, 19, 21 | 3eqtr3d 2788 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊)) |
23 | 5, 15, 16, 17 | lmodvscl 20898 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
24 | 5, 15, 16, 17 | lmodvscl 20898 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
25 | 1, 12, 14, 24 | syl3anc 1371 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
26 | 5, 6, 7, 8 | grpinvid1 19031 | . . . 4 ⊢ ((𝑊 ∈ Grp ∧ (𝑅 · 𝑋) ∈ 𝐵 ∧ (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
27 | 3, 23, 25, 26 | syl3anc 1371 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
28 | 22, 27 | mpbird 257 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋))) |
29 | 28 | eqcomd 2746 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 +gcplusg 17311 Scalarcsca 17314 ·𝑠 cvsca 17315 0gc0g 17499 Grpcgrp 18973 invgcminusg 18974 LModclmod 20880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-plusg 17324 df-0g 17501 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-grp 18976 df-minusg 18977 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-lmod 20882 |
This theorem is referenced by: invlmhm 21064 eqgvscpbl 33343 |
Copyright terms: Public domain | W3C validator |