| 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 2229 | . . . 4 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 4 | lmodvsubval2.m | . . . 4 ⊢ − = (-g‘𝑊) | |
| 5 | 1, 2, 3, 4 | grpsubval 13600 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 6 | 5 | 3adant1 1039 | . 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 14315 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 12 | 11 | 3adant2 1040 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((𝑁‘ 1 ) · 𝐵) = ((invg‘𝑊)‘𝐵)) |
| 13 | 12 | oveq2d 6026 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + ((𝑁‘ 1 ) · 𝐵)) = (𝐴 + ((invg‘𝑊)‘𝐵))) |
| 14 | 6, 13 | eqtr4d 2265 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + ((𝑁‘ 1 ) · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5321 (class class class)co 6010 Basecbs 13053 +gcplusg 13131 Scalarcsca 13134 ·𝑠 cvsca 13135 invgcminusg 13555 -gcsg 13556 1rcur 13943 LModclmod 14272 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-addass 8117 ax-i2m1 8120 ax-0lt1 8121 ax-0id 8123 ax-rnegex 8124 ax-pre-ltirr 8127 ax-pre-ltadd 8131 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-pnf 8199 df-mnf 8200 df-ltxr 8202 df-inn 9127 df-2 9185 df-3 9186 df-4 9187 df-5 9188 df-6 9189 df-ndx 13056 df-slot 13057 df-base 13059 df-sets 13060 df-plusg 13144 df-mulr 13145 df-sca 13147 df-vsca 13148 df-0g 13312 df-mgm 13410 df-sgrp 13456 df-mnd 13471 df-grp 13557 df-minusg 13558 df-sbg 13559 df-mgp 13905 df-ur 13944 df-ring 13982 df-lmod 14274 |
| This theorem is referenced by: lmodsubvs 14328 lmodsubdi 14329 lmodsubdir 14330 lssvsubcl 14351 |
| Copyright terms: Public domain | W3C validator |