clmnegsubdi2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > clmnegsubdi2		Structured version Visualization version GIF version

Theorem clmnegsubdi2 25060

Description: Distribution of negative over vector subtraction. (Contributed by NM, 6-Aug-2007.) (Revised by AV, 29-Sep-2021.)

**Hypotheses**
Ref	Expression
clmpm1dir.v	⊢ 𝑉 = (Base‘𝑊)
clmpm1dir.s	⊢ · = ( ·_𝑠 ‘𝑊)
clmpm1dir.a	⊢ + = (+_g‘𝑊)

**Assertion**
Ref	Expression
clmnegsubdi2	⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (𝐴 + (-1 · 𝐵))) = (𝐵 + (-1 · 𝐴)))

**Proof of Theorem clmnegsubdi2**
Step	Hyp	Ref	Expression
1		simp1 1137	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝑊 ∈ ℂMod)
2		eqid 2735	. . . . 5 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
3		eqid 2735	. . . . 5 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
4	2, 3	clmneg1 25037	. . . 4 ⊢ (𝑊 ∈ ℂMod → -1 ∈ (Base‘(Scalar‘𝑊)))
5	4	3ad2ant1 1134	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊)))
6		simp2 1138	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐴 ∈ 𝑉)
7		simpl 482	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → 𝑊 ∈ ℂMod)
8	4	adantr 480	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊)))
9		simpr 484	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ 𝑉)
10		clmpm1dir.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
11		clmpm1dir.s	. . . . . 6 ⊢ · = ( ·_𝑠 ‘𝑊)
12	10, 2, 11, 3	clmvscl 25043	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
13	7, 8, 9, 12	syl3anc 1374	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
14	13	3adant2 1132	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
15		clmpm1dir.a	. . . 4 ⊢ + = (+_g‘𝑊)
16	10, 2, 11, 3, 15	clmvsdi 25047	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (-1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐴 ∈ 𝑉 ∧ (-1 · 𝐵) ∈ 𝑉)) → (-1 · (𝐴 + (-1 · 𝐵))) = ((-1 · 𝐴) + (-1 · (-1 · 𝐵))))
17	1, 5, 6, 14, 16	syl13anc 1375	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (𝐴 + (-1 · 𝐵))) = ((-1 · 𝐴) + (-1 · (-1 · 𝐵))))
18	10, 11, 15	clmnegneg 25059	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → (-1 · (-1 · 𝐵)) = 𝐵)
19	18	3adant2 1132	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (-1 · 𝐵)) = 𝐵)
20	19	oveq2d 7372	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + (-1 · (-1 · 𝐵))) = ((-1 · 𝐴) + 𝐵))
21		clmabl 25024	. . . 4 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ Abel)
22	21	3ad2ant1 1134	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝑊 ∈ Abel)
23		simpl 482	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉) → 𝑊 ∈ ℂMod)
24	4	adantr 480	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊)))
25		simpr 484	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ 𝑉)
26	10, 2, 11, 3	clmvscl 25043	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐴 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
27	23, 24, 25, 26	syl3anc 1374	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
28	27	3adant3 1133	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
29		simp3 1139	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ 𝑉)
30	10, 15	ablcom 19763	. . 3 ⊢ ((𝑊 ∈ Abel ∧ (-1 · 𝐴) ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + 𝐵) = (𝐵 + (-1 · 𝐴)))
31	22, 28, 29, 30	syl3anc 1374	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + 𝐵) = (𝐵 + (-1 · 𝐴)))
32	17, 20, 31	3eqtrd 2774	1 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (𝐴 + (-1 · 𝐵))) = (𝐵 + (-1 · 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6487 (class class class)co 7356 1c1 11028 -cneg 11367 Basecbs 17168 +_gcplusg 17209 Scalarcsca 17212 ·_𝑠 cvsca 17213 Abelcabl 19745 ℂModcclm 25017

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-addf 11106 ax-mulf 11107

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-3 12234 df-4 12235 df-5 12236 df-6 12237 df-7 12238 df-8 12239 df-9 12240 df-n0 12427 df-z 12514 df-dec 12634 df-uz 12778 df-fz 13451 df-seq 13953 df-struct 17106 df-sets 17123 df-slot 17141 df-ndx 17153 df-base 17169 df-ress 17190 df-plusg 17222 df-mulr 17223 df-starv 17224 df-tset 17228 df-ple 17229 df-ds 17231 df-unif 17232 df-0g 17393 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-grp 18901 df-minusg 18902 df-mulg 19033 df-subg 19088 df-cmn 19746 df-abl 19747 df-mgp 20111 df-ur 20152 df-ring 20205 df-cring 20206 df-subrg 20536 df-lmod 20846 df-cnfld 21342 df-clm 25018

This theorem is referenced by: (None)

W3C validator