| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvsubval2 | GIF version | ||
| Description: Value of vector subtraction in terms of addition. (Contributed by NM, 31-Mar-2014.) (Proof shortened by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lmodvsubval2.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodvsubval2.p | ⊢ + = (+g‘𝑊) |
| lmodvsubval2.m | ⊢ − = (-g‘𝑊) |
| lmodvsubval2.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodvsubval2.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodvsubval2.n | ⊢ 𝑁 = (invg‘𝐹) |
| lmodvsubval2.u | ⊢ 1 = (1r‘𝐹) |
| Ref | Expression |
|---|---|
| lmodvsubval2 | ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((𝑁‘ 1 ) · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodvsubval2.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | lmodvsubval2.p | . . . 4 ⊢ + = (+g‘𝑊) | |
| 3 | eqid 2234 | . . . 4 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 4 | lmodvsubval2.m | . . . 4 ⊢ − = (-g‘𝑊) | |
| 5 | 1, 2, 3, 4 | grpsubval 13805 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 6 | 5 | 3adant1 1042 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 7 | lmodvsubval2.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 8 | lmodvsubval2.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 9 | lmodvsubval2.u | . . . . 5 ⊢ 1 = (1r‘𝐹) | |
| 10 | lmodvsubval2.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐹) | |
| 11 | 1, 3, 7, 8, 9, 10 | lmodvneg1 14608 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 12 | 11 | 3adant2 1043 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 13 | 12 | oveq2d 6074 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + ((𝑁‘ 1 ) · 𝐵)) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 14 | 6, 13 | eqtr4d 2270 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((𝑁‘ 1 ) · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ‘cfv 5357 (class class class)co 6058 Basecbs 13300 +gcplusg 13378 Scalarcsca 13381 ·𝑠 cvsca 13382 invgcminusg 13760 -gcsg 13761 1rcur 14206 LModclmod 14565 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-pre-ltirr 8255 ax-pre-ltadd 8259 |
| 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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-pnf 8326 df-mnf 8327 df-ltxr 8329 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-5 9319 df-6 9320 df-ndx 13303 df-slot 13304 df-base 13306 df-sets 13307 df-plusg 13391 df-mulr 13392 df-sca 13394 df-vsca 13395 df-0g 13559 df-mgm 13623 df-sgrp 13669 df-mnd 13682 df-grp 13762 df-minusg 13763 df-sbg 13764 df-mgp 14164 df-ur 14207 df-ring 14245 df-lmod 14567 |
| This theorem is referenced by: lmodsubvs 14621 lmodsubdi 14622 lmodsubdir 14623 lssvsubcl 14644 |
| Copyright terms: Public domain | W3C validator |