| 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 2231 | . . . 4 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 4 | lmodvsubval2.m | . . . 4 ⊢ − = (-g‘𝑊) | |
| 5 | 1, 2, 3, 4 | grpsubval 13631 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 6 | 5 | 3adant1 1041 | . 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 14347 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 12 | 11 | 3adant2 1042 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 13 | 12 | oveq2d 6034 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + ((𝑁‘ 1 ) · 𝐵)) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 14 | 6, 13 | eqtr4d 2267 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((𝑁‘ 1 ) · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 Basecbs 13084 +gcplusg 13162 Scalarcsca 13165 ·𝑠 cvsca 13166 invgcminusg 13586 -gcsg 13587 1rcur 13975 LModclmod 14304 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-ndx 13087 df-slot 13088 df-base 13090 df-sets 13091 df-plusg 13175 df-mulr 13176 df-sca 13178 df-vsca 13179 df-0g 13343 df-mgm 13441 df-sgrp 13487 df-mnd 13502 df-grp 13588 df-minusg 13589 df-sbg 13590 df-mgp 13937 df-ur 13976 df-ring 14014 df-lmod 14306 |
| This theorem is referenced by: lmodsubvs 14360 lmodsubdi 14361 lmodsubdir 14362 lssvsubcl 14383 |
| Copyright terms: Public domain | W3C validator |