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 19683 | . . . 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 19653 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
11 | 1, 4, 5, 10 | syl3anc 1367 | . . 3 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
12 | lmodnegadd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
13 | lmodnegadd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
14 | 6, 7, 8, 9 | lmodvscl 19653 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐵 · 𝑌) ∈ 𝑉) |
15 | 1, 12, 13, 14 | syl3anc 1367 | . . 3 ⊢ (𝜑 → (𝐵 · 𝑌) ∈ 𝑉) |
16 | lmodnegadd.p | . . . 4 ⊢ + = (+g‘𝑊) | |
17 | lmodnegadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
18 | 6, 16, 17 | ablinvadd 18932 | . . 3 ⊢ ((𝑊 ∈ Abel ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐵 · 𝑌) ∈ 𝑉) → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
19 | 3, 11, 15, 18 | syl3anc 1367 | . 2 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
20 | lmodnegadd.i | . . . 4 ⊢ 𝐼 = (invg‘𝑅) | |
21 | 6, 7, 8, 17, 9, 20, 1, 5, 4 | lmodvsneg 19680 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐴 · 𝑋)) = ((𝐼‘𝐴) · 𝑋)) |
22 | 6, 7, 8, 17, 9, 20, 1, 13, 12 | lmodvsneg 19680 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐵 · 𝑌)) = ((𝐼‘𝐵) · 𝑌)) |
23 | 21, 22 | oveq12d 7176 | . 2 ⊢ (𝜑 → ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
24 | 19, 23 | eqtrd 2858 | 1 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 +gcplusg 16567 Scalarcsca 16570 ·𝑠 cvsca 16571 invgcminusg 18106 Abelcabl 18909 LModclmod 19636 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-plusg 16580 df-0g 16717 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-grp 18108 df-minusg 18109 df-cmn 18910 df-abl 18911 df-mgp 19242 df-ur 19254 df-ring 19301 df-lmod 19638 |
This theorem is referenced by: baerlem3lem1 38845 |
Copyright terms: Public domain | W3C validator |