| 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 20818 | . . . . . . 7 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
| 3 | 1, 2 | syl 17 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑊 ∈ Grp) |
| 4 | simp3 1138 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | lmodvsinv2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑊) | |
| 6 | eqid 2736 | . . . . . . 7 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 7 | eqid 2736 | . . . . . . 7 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 8 | lmodvsinv2.n | . . . . . . 7 ⊢ 𝑁 = (invg‘𝑊) | |
| 9 | 5, 6, 7, 8 | grprinv 18920 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
| 10 | 3, 4, 9 | syl2anc 584 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝑊)(𝑁‘𝑋)) = (0g‘𝑊)) |
| 11 | 10 | oveq2d 7374 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = (𝑅 · (0g‘𝑊))) |
| 12 | simp2 1137 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ 𝐾) | |
| 13 | 5, 8 | grpinvcl 18917 | . . . . . 6 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 14 | 3, 4, 13 | syl2anc 584 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 15 | lmodvsinv2.f | . . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 16 | lmodvsinv2.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 17 | lmodvsinv2.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 18 | 5, 6, 15, 16, 17 | lmodvsdi 20836 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
| 19 | 1, 12, 4, 14, 18 | syl13anc 1374 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑋(+g‘𝑊)(𝑁‘𝑋))) = ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋)))) |
| 20 | 15, 16, 17, 7 | lmodvs0 20847 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
| 21 | 1, 12, 20 | syl2anc 584 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (0g‘𝑊)) = (0g‘𝑊)) |
| 22 | 11, 19, 21 | 3eqtr3d 2779 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊)) |
| 23 | 5, 15, 16, 17 | lmodvscl 20829 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 5, 15, 16, 17 | lmodvscl 20829 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
| 25 | 1, 12, 14, 24 | syl3anc 1373 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) |
| 26 | 5, 6, 7, 8 | grpinvid1 18921 | . . . 4 ⊢ ((𝑊 ∈ Grp ∧ (𝑅 · 𝑋) ∈ 𝐵 ∧ (𝑅 · (𝑁‘𝑋)) ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
| 27 | 3, 23, 25, 26 | syl3anc 1373 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → ((𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋)) ↔ ((𝑅 · 𝑋)(+g‘𝑊)(𝑅 · (𝑁‘𝑋))) = (0g‘𝑊))) |
| 28 | 22, 27 | mpbird 257 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑅 · 𝑋)) = (𝑅 · (𝑁‘𝑋))) |
| 29 | 28 | eqcomd 2742 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · (𝑁‘𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 Scalarcsca 17180 ·𝑠 cvsca 17181 0gc0g 17359 Grpcgrp 18863 invgcminusg 18864 LModclmod 20811 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-lmod 20813 |
| This theorem is referenced by: invlmhm 20994 eqgvscpbl 33431 |
| Copyright terms: Public domain | W3C validator |