| 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 14474 | . . . 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 14445 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 11 | 1, 4, 5, 10 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
| 12 | lmodnegadd.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
| 13 | lmodnegadd.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 14 | 6, 7, 8, 9 | lmodvscl 14445 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐵 · 𝑌) ∈ 𝑉) |
| 15 | 1, 12, 13, 14 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐵 · 𝑌) ∈ 𝑉) |
| 16 | lmodnegadd.p | . . . 4 ⊢ + = (+g‘𝑊) | |
| 17 | lmodnegadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝑊) | |
| 18 | 6, 16, 17 | ablinvadd 14019 | . . 3 ⊢ ((𝑊 ∈ Abel ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐵 · 𝑌) ∈ 𝑉) → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
| 19 | 3, 11, 15, 18 | syl3anc 1274 | . 2 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌)))) |
| 20 | lmodnegadd.i | . . . 4 ⊢ 𝐼 = (invg‘𝑅) | |
| 21 | 6, 7, 8, 17, 9, 20, 1, 5, 4 | lmodvsneg 14471 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐴 · 𝑋)) = ((𝐼‘𝐴) · 𝑋)) |
| 22 | 6, 7, 8, 17, 9, 20, 1, 13, 12 | lmodvsneg 14471 | . . 3 ⊢ (𝜑 → (𝑁‘(𝐵 · 𝑌)) = ((𝐼‘𝐵) · 𝑌)) |
| 23 | 21, 22 | oveq12d 6067 | . 2 ⊢ (𝜑 → ((𝑁‘(𝐴 · 𝑋)) + (𝑁‘(𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
| 24 | 19, 23 | eqtrd 2265 | 1 ⊢ (𝜑 → (𝑁‘((𝐴 · 𝑋) + (𝐵 · 𝑌))) = (((𝐼‘𝐴) · 𝑋) + ((𝐼‘𝐵) · 𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 ‘cfv 5351 (class class class)co 6049 Basecbs 13204 +gcplusg 13282 Scalarcsca 13285 ·𝑠 cvsca 13286 invgcminusg 13706 Abelcabl 13994 LModclmod 14427 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-addass 8228 ax-i2m1 8231 ax-0lt1 8232 ax-0id 8234 ax-rnegex 8235 ax-pre-ltirr 8238 ax-pre-ltadd 8242 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-pnf 8309 df-mnf 8310 df-ltxr 8312 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-5 9298 df-6 9299 df-ndx 13207 df-slot 13208 df-base 13210 df-sets 13211 df-plusg 13295 df-mulr 13296 df-sca 13298 df-vsca 13299 df-0g 13463 df-mgm 13561 df-sgrp 13607 df-mnd 13622 df-grp 13708 df-minusg 13709 df-cmn 13995 df-abl 13996 df-mgp 14057 df-ur 14096 df-ring 14134 df-lmod 14429 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |