Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lmodvsneg | Structured version Visualization version GIF version |
Description: Multiplication of a vector by a negated scalar. (Contributed by Stefan O'Rear, 28-Feb-2015.) |
Ref | Expression |
---|---|
lmodvsneg.b | ⊢ 𝐵 = (Base‘𝑊) |
lmodvsneg.f | ⊢ 𝐹 = (Scalar‘𝑊) |
lmodvsneg.s | ⊢ · = ( ·𝑠 ‘𝑊) |
lmodvsneg.n | ⊢ 𝑁 = (invg‘𝑊) |
lmodvsneg.k | ⊢ 𝐾 = (Base‘𝐹) |
lmodvsneg.m | ⊢ 𝑀 = (invg‘𝐹) |
lmodvsneg.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
lmodvsneg.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
lmodvsneg.r | ⊢ (𝜑 → 𝑅 ∈ 𝐾) |
Ref | Expression |
---|---|
lmodvsneg | ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lmodvsneg.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
2 | lmodvsneg.f | . . . . . . 7 ⊢ 𝐹 = (Scalar‘𝑊) | |
3 | 2 | lmodring 20046 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
5 | ringgrp 19703 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
6 | 4, 5 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
8 | eqid 2738 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
9 | 7, 8 | ringidcl 19722 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
10 | 4, 9 | syl 17 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
12 | 7, 11 | grpinvcl 18542 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ (1r‘𝐹) ∈ 𝐾) → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
13 | 6, 10, 12 | syl2anc 583 | . . 3 ⊢ (𝜑 → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
14 | lmodvsneg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐾) | |
15 | lmodvsneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
16 | lmodvsneg.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
17 | lmodvsneg.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
18 | eqid 2738 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
19 | 16, 2, 17, 7, 18 | lmodvsass 20063 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
20 | 1, 13, 14, 15, 19 | syl13anc 1370 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
21 | 7, 18, 8, 11, 4, 14 | ringnegl 19748 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
22 | 21 | oveq1d 7270 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
23 | 16, 2, 17, 7 | lmodvscl 20055 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
24 | 1, 14, 15, 23 | syl3anc 1369 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 20081 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
27 | 1, 24, 26 | syl2anc 583 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
28 | 20, 22, 27 | 3eqtr3rd 2787 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 .rcmulr 16889 Scalarcsca 16891 ·𝑠 cvsca 16892 Grpcgrp 18492 invgcminusg 18493 1rcur 19652 Ringcrg 19698 LModclmod 20038 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-mgp 19636 df-ur 19653 df-ring 19700 df-lmod 20040 |
This theorem is referenced by: lmodnegadd 20087 clmvsneg 24169 linds2eq 31477 baerlem5alem1 39649 lincext3 45685 lindslinindimp2lem4 45690 lincresunit3 45710 |
Copyright terms: Public domain | W3C validator |