![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > lmodnegadd | 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 13830 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel) | |
3 | 1, 2 | syl 14 | . . 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 13801 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
11 | 1, 4, 5, 10 | syl3anc 1249 | . . 3 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
12 | lmodnegadd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
13 | lmodnegadd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
14 | 6, 7, 8, 9 | lmodvscl 13801 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐵 · 𝑌) ∈ 𝑉) |
15 | 1, 12, 13, 14 | syl3anc 1249 | . . 3 ⊢ (𝜑 → (𝐵 · 𝑌) ∈ 𝑉) |
16 | lmodnegadd.p | . . . 4 ⊢ + = (+g‘𝑊) | |
17 | lmodnegadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
18 | 6, 16, 17 | ablinvadd 13380 | . . 3 ⊢ ((𝑊 ∈ Abel ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐵 · 𝑌) ∈ 𝑉) → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
19 | 3, 11, 15, 18 | syl3anc 1249 | . 2 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
20 | lmodnegadd.i | . . . 4 ⊢ 𝐼 = (invg‘𝑅) | |
21 | 6, 7, 8, 17, 9, 20, 1, 5, 4 | lmodvsneg 13827 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐴 · 𝑋)) = ((𝐼‘𝐴) · 𝑋)) |
22 | 6, 7, 8, 17, 9, 20, 1, 13, 12 | lmodvsneg 13827 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐵 · 𝑌)) = ((𝐼‘𝐵) · 𝑌)) |
23 | 21, 22 | oveq12d 5936 | . 2 ⊢ (𝜑 → ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
24 | 19, 23 | eqtrd 2226 | 1 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2164 ‘cfv 5254 (class class class)co 5918 Basecbs 12618 +gcplusg 12695 Scalarcsca 12698 ·𝑠 cvsca 12699 invgcminusg 13073 Abelcabl 13355 LModclmod 13783 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-ltadd 7988 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-ltxr 8059 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-5 9044 df-6 9045 df-ndx 12621 df-slot 12622 df-base 12624 df-sets 12625 df-plusg 12708 df-mulr 12709 df-sca 12711 df-vsca 12712 df-0g 12869 df-mgm 12939 df-sgrp 12985 df-mnd 12998 df-grp 13075 df-minusg 13076 df-cmn 13356 df-abl 13357 df-mgp 13417 df-ur 13456 df-ring 13494 df-lmod 13785 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |