| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clmvsubval | Structured version Visualization version GIF version | ||
| Description: Value of vector subtraction in terms of addition in a subcomplex module. Analogue of lmodvsubval2 20804. (Contributed by NM, 31-Mar-2014.) (Revised by AV, 7-Oct-2021.) |
| Ref | Expression |
|---|---|
| clmvsubval.v | ⊢ 𝑉 = (Base‘𝑊) |
| clmvsubval.p | ⊢ + = (+g‘𝑊) |
| clmvsubval.m | ⊢ − = (-g‘𝑊) |
| clmvsubval.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| clmvsubval.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| Ref | Expression |
|---|---|
| clmvsubval | ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + (-1 · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clmlmod 24948 | . . 3 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ LMod) | |
| 2 | clmvsubval.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 3 | clmvsubval.p | . . . 4 ⊢ + = (+g‘𝑊) | |
| 4 | clmvsubval.m | . . . 4 ⊢ − = (-g‘𝑊) | |
| 5 | clmvsubval.f | . . . 4 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 6 | clmvsubval.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 7 | eqid 2729 | . . . 4 ⊢ (invg‘𝐹) = (invg‘𝐹) | |
| 8 | eqid 2729 | . . . 4 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 9 | 2, 3, 4, 5, 6, 7, 8 | lmodvsubval2 20804 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + (((invg‘𝐹)‘(1r‘𝐹)) · 𝐵))) |
| 10 | 1, 9 | syl3an1 1163 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + (((invg‘𝐹)‘(1r‘𝐹)) · 𝐵))) |
| 11 | 5 | clm1 24954 | . . . . . . . 8 ⊢ (𝑊 ∈ ℂMod → 1 = (1r‘𝐹)) |
| 12 | 11 | eqcomd 2735 | . . . . . . 7 ⊢ (𝑊 ∈ ℂMod → (1r‘𝐹) = 1) |
| 13 | 12 | fveq2d 6820 | . . . . . 6 ⊢ (𝑊 ∈ ℂMod → ((invg‘𝐹)‘(1r‘𝐹)) = ((invg‘𝐹)‘1)) |
| 14 | 5 | clmring 24951 | . . . . . . . . 9 ⊢ (𝑊 ∈ ℂMod → 𝐹 ∈ Ring) |
| 15 | eqid 2729 | . . . . . . . . . 10 ⊢ (Base‘𝐹) = (Base‘𝐹) | |
| 16 | 15, 8 | ringidcl 20137 | . . . . . . . . 9 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ (Base‘𝐹)) |
| 17 | 14, 16 | syl 17 | . . . . . . . 8 ⊢ (𝑊 ∈ ℂMod → (1r‘𝐹) ∈ (Base‘𝐹)) |
| 18 | 11, 17 | eqeltrd 2828 | . . . . . . 7 ⊢ (𝑊 ∈ ℂMod → 1 ∈ (Base‘𝐹)) |
| 19 | 5, 15 | clmneg 24962 | . . . . . . 7 ⊢ ((𝑊 ∈ ℂMod ∧ 1 ∈ (Base‘𝐹)) → -1 = ((invg‘𝐹)‘1)) |
| 20 | 18, 19 | mpdan 687 | . . . . . 6 ⊢ (𝑊 ∈ ℂMod → -1 = ((invg‘𝐹)‘1)) |
| 21 | 13, 20 | eqtr4d 2767 | . . . . 5 ⊢ (𝑊 ∈ ℂMod → ((invg‘𝐹)‘(1r‘𝐹)) = -1) |
| 22 | 21 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((invg‘𝐹)‘(1r‘𝐹)) = -1) |
| 23 | 22 | oveq1d 7355 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (((invg‘𝐹)‘(1r‘𝐹)) · 𝐵) = (-1 · 𝐵)) |
| 24 | 23 | oveq2d 7356 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 + (((invg‘𝐹)‘(1r‘𝐹)) · 𝐵)) = (𝐴 + (-1 · 𝐵))) |
| 25 | 10, 24 | eqtrd 2764 | 1 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 − 𝐵) = (𝐴 + (-1 · 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6476 (class class class)co 7340 1c1 10998 -cneg 11336 Basecbs 17107 +gcplusg 17148 Scalarcsca 17151 ·𝑠 cvsca 17152 invgcminusg 18800 -gcsg 18801 1rcur 20053 Ringcrg 20105 LModclmod 20747 ℂModcclm 24943 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5367 ax-un 7662 ax-cnex 11053 ax-resscn 11054 ax-1cn 11055 ax-icn 11056 ax-addcl 11057 ax-addrcl 11058 ax-mulcl 11059 ax-mulrcl 11060 ax-mulcom 11061 ax-addass 11062 ax-mulass 11063 ax-distr 11064 ax-i2m1 11065 ax-1ne0 11066 ax-1rid 11067 ax-rnegex 11068 ax-rrecex 11069 ax-cnre 11070 ax-pre-lttri 11071 ax-pre-lttrn 11072 ax-pre-ltadd 11073 ax-pre-mulgt0 11074 ax-addf 11076 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-tp 4578 df-op 4580 df-uni 4857 df-iun 4940 df-br 5089 df-opab 5151 df-mpt 5170 df-tr 5196 df-id 5508 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5566 df-we 5568 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-res 5625 df-ima 5626 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-riota 7297 df-ov 7343 df-oprab 7344 df-mpo 7345 df-om 7791 df-1st 7915 df-2nd 7916 df-frecs 8205 df-wrecs 8236 df-recs 8285 df-rdg 8323 df-1o 8379 df-er 8616 df-en 8864 df-dom 8865 df-sdom 8866 df-fin 8867 df-pnf 11139 df-mnf 11140 df-xr 11141 df-ltxr 11142 df-le 11143 df-sub 11337 df-neg 11338 df-nn 12117 df-2 12179 df-3 12180 df-4 12181 df-5 12182 df-6 12183 df-7 12184 df-8 12185 df-9 12186 df-n0 12373 df-z 12460 df-dec 12580 df-uz 12724 df-fz 13399 df-struct 17045 df-sets 17062 df-slot 17080 df-ndx 17092 df-base 17108 df-ress 17129 df-plusg 17161 df-mulr 17162 df-starv 17163 df-tset 17167 df-ple 17168 df-ds 17170 df-unif 17171 df-0g 17332 df-mgm 18501 df-sgrp 18580 df-mnd 18596 df-grp 18802 df-minusg 18803 df-sbg 18804 df-subg 18989 df-cmn 19648 df-mgp 20013 df-ur 20054 df-ring 20107 df-cring 20108 df-subrg 20439 df-lmod 20749 df-cnfld 21246 df-clm 24944 |
| This theorem is referenced by: clmvsubval2 24991 ncvsdif 25036 ncvspds 25042 cphipval 25124 |
| Copyright terms: Public domain | W3C validator |