| 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 21123 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 4 | 1, 3 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 5 | ringgrp 20444 | . . . . 5 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
| 6 | 4, 5 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Grp) |
| 7 | lmodvsneg.k | . . . . . 6 ⊢ 𝐾 = (Base‘𝐹) | |
| 8 | eqid 2761 | . . . . . 6 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 7, 8 | ringidcl 20474 | . . . . 5 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 10 | 4, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 11 | lmodvsneg.m | . . . . 5 ⊢ 𝑀 = (invg‘𝐹) | |
| 12 | 7, 11 | grpinvcl 19178 | . . . 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 2761 | . . . 4 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 19 | 16, 2, 17, 7, 18 | lmodvsass 21142 | . . 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 20513 | . . 3 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) = (𝑀‘𝑅)) |
| 22 | 21 | oveq1d 7427 | . 2 ⊢ (𝜑 → (((𝑀‘(1r‘𝐹))(.r‘𝐹)𝑅) · 𝑋) = ((𝑀‘𝑅) · 𝑋)) |
| 23 | 16, 2, 17, 7 | lmodvscl 21133 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑅 ∈ 𝐾 ∧ 𝑋 ∈ 𝐵) → (𝑅 · 𝑋) ∈ 𝐵) |
| 24 | 1, 14, 15, 23 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑅 · 𝑋) ∈ 𝐵) |
| 25 | lmodvsneg.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 26 | 16, 25, 2, 17, 8, 11 | lmodvneg1 21160 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑅 · 𝑋) ∈ 𝐵) → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 27 | 1, 24, 26 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑀‘(1r‘𝐹)) · (𝑅 · 𝑋)) = (𝑁‘(𝑅 · 𝑋))) |
| 28 | 20, 22, 27 | 3eqtr3rd 2805 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = ((𝑀‘𝑅) · 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 .rcmulr 17409 Scalarcsca 17411 ·𝑠 cvsca 17412 Grpcgrp 19124 invgcminusg 19125 1rcur 20387 Ringcrg 20439 LModclmod 21115 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-plusg 17421 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-cmn 19976 df-abl 19977 df-mgp 20341 df-rng 20355 df-ur 20388 df-ring 20441 df-lmod 21117 |
| This theorem is used by: lmodnegadd 21166 clmvsneg 25401 linds2eq 33918 vietalem 34193 baerlem5alem1 42733 lincext3 49512 lindslinindimp2lem4 49517 lincresunit3 49537 |
| Copyright terms: Public domain | W3C validator |