![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lmodnegadd | Structured version Visualization version GIF version |
Description: Distribute negation through addition of scalar products. (Contributed by NM, 9-Apr-2015.) |
Ref | Expression |
---|---|
lmodnegadd.v | ⊢ 𝑉 = (Base‘𝑊) |
lmodnegadd.p | ⊢ + = (+g‘𝑊) |
lmodnegadd.t | ⊢ · = ( ·𝑠 ‘𝑊) |
lmodnegadd.n | ⊢ 𝑁 = (invg‘𝑊) |
lmodnegadd.r | ⊢ 𝑅 = (Scalar‘𝑊) |
lmodnegadd.k | ⊢ 𝐾 = (Base‘𝑅) |
lmodnegadd.i | ⊢ 𝐼 = (invg‘𝑅) |
lmodnegadd.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
lmodnegadd.a | ⊢ (𝜑 → 𝐴 ∈ 𝐾) |
lmodnegadd.b | ⊢ (𝜑 → 𝐵 ∈ 𝐾) |
lmodnegadd.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
lmodnegadd.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
Ref | Expression |
---|---|
lmodnegadd | ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lmodnegadd.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
2 | lmodabl 18910 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝜑 → 𝑊 ∈ Abel) |
4 | lmodnegadd.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐾) | |
5 | lmodnegadd.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
6 | lmodnegadd.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
7 | lmodnegadd.r | . . . . 5 ⊢ 𝑅 = (Scalar‘𝑊) | |
8 | lmodnegadd.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
9 | lmodnegadd.k | . . . . 5 ⊢ 𝐾 = (Base‘𝑅) | |
10 | 6, 7, 8, 9 | lmodvscl 18880 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
11 | 1, 4, 5, 10 | syl3anc 1326 | . . 3 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
12 | lmodnegadd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
13 | lmodnegadd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
14 | 6, 7, 8, 9 | lmodvscl 18880 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐵 · 𝑌) ∈ 𝑉) |
15 | 1, 12, 13, 14 | syl3anc 1326 | . . 3 ⊢ (𝜑 → (𝐵 · 𝑌) ∈ 𝑉) |
16 | lmodnegadd.p | . . . 4 ⊢ + = (+g‘𝑊) | |
17 | lmodnegadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
18 | 6, 16, 17 | ablinvadd 18215 | . . 3 ⊢ ((𝑊 ∈ Abel ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐵 · 𝑌) ∈ 𝑉) → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
19 | 3, 11, 15, 18 | syl3anc 1326 | . 2 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
20 | lmodnegadd.i | . . . 4 ⊢ 𝐼 = (invg‘𝑅) | |
21 | 6, 7, 8, 17, 9, 20, 1, 5, 4 | lmodvsneg 18907 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐴 · 𝑋)) = ((𝐼‘𝐴) · 𝑋)) |
22 | 6, 7, 8, 17, 9, 20, 1, 13, 12 | lmodvsneg 18907 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐵 · 𝑌)) = ((𝐼‘𝐵) · 𝑌)) |
23 | 21, 22 | oveq12d 6668 | . 2 ⊢ (𝜑 → ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
24 | 19, 23 | eqtrd 2656 | 1 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 +gcplusg 15941 Scalarcsca 15944 ·𝑠 cvsca 15945 invgcminusg 17423 Abelcabl 18194 LModclmod 18863 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-plusg 15954 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-grp 17425 df-minusg 17426 df-cmn 18195 df-abl 18196 df-mgp 18490 df-ur 18502 df-ring 18549 df-lmod 18865 |
This theorem is referenced by: baerlem3lem1 36996 |
Copyright terms: Public domain | W3C validator |