| 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 21058 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 4 | 1, 3 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 5 | ringgrp 20383 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
| 7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 8 | eqid 2762 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 7, 8 | ringidcl 20412 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 10 | 4, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
| 12 | 7, 11 | grpinvcl 19117 | . . . 4 ⊢ ((𝐹 ∈ Grp ∧ (1r‘𝐹) ∈ 𝐾) → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 13 | 6, 10, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑀‘(1r‘𝐹)) ∈ 𝐾) |
| 14 | lmodvsneg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐾) | |
| 15 | lmodvsneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 16 | lmodvsneg.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 17 | lmodvsneg.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 18 | eqid 2762 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 19 | 16, 2, 17, 7, 18 | lmodvsass 21077 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ ((𝑀‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵)) → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 20 | 1, 13, 14, 15, 19 | syl13anc 1399 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋))) |
| 21 | 7, 18, 8, 11, 4, 14 | ringnegl 20450 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
| 22 | 21 | oveq1d 7432 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
| 23 | 16, 2, 17, 7 | lmodvscl 21068 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 1, 14, 15, 23 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
| 25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 21095 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 27 | 1, 24, 26 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 28 | 20, 22, 27 | 3eqtr3rd 2806 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 .rcmulr 17349 Scalarcsca 17351 ·𝑠 cvsca 17352 Grpcgrp 19063 invgcminusg 19064 1rcur 20326 Ringcrg 20378 LModclmod 21050 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-plusg 17361 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-cmn 19915 df-abl 19916 df-mgp 20280 df-rng 20294 df-ur 20327 df-ring 20380 df-lmod 21052 |
| This theorem is used by: lmodnegadd 21101 clmvsneg 25334 linds2eq 33822 vietalem 34097 baerlem5alem1 42589 lincext3 49394 lindslinindimp2lem4 49399 lincresunit3 49419 |
| Copyright terms: Public domain | W3C validator |