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 25139

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 1136	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝑊 ∈ ℂMod)
2		eqid 2736	. . . . 5 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
3		eqid 2736	. . . . 5 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
4	2, 3	clmneg1 25116	. . . 4 ⊢ (𝑊 ∈ ℂMod → -1 ∈ (Base‘(Scalar‘𝑊)))
5	4	3ad2ant1 1133	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊)))
6		simp2 1137	. . 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 25122	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
13	7, 8, 9, 12	syl3anc 1372	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
14	13	3adant2 1131	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐵) ∈ 𝑉)
15		clmpm1dir.a	. . . 4 ⊢ + = (+_g‘𝑊)
16	10, 2, 11, 3, 15	clmvsdi 25126	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (-1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐴 ∈ 𝑉 ∧ (-1 · 𝐵) ∈ 𝑉)) → (-1 · (𝐴 + (-1 · 𝐵))) = ((-1 · 𝐴) + (-1 · (-1 · 𝐵))))
17	1, 5, 6, 14, 16	syl13anc 1373	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (𝐴 + (-1 · 𝐵))) = ((-1 · 𝐴) + (-1 · (-1 · 𝐵))))
18	10, 11, 15	clmnegneg 25138	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝑉) → (-1 · (-1 · 𝐵)) = 𝐵)
19	18	3adant2 1131	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (-1 · 𝐵)) = 𝐵)
20	19	oveq2d 7448	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + (-1 · (-1 · 𝐵))) = ((-1 · 𝐴) + 𝐵))
21		clmabl 25103	. . . 4 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ Abel)
22	21	3ad2ant1 1133	. . 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 25122	. . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐴 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
27	23, 24, 25, 26	syl3anc 1372	. . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
28	27	3adant3 1132	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · 𝐴) ∈ 𝑉)
29		simp3 1138	. . 3 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → 𝐵 ∈ 𝑉)
30	10, 15	ablcom 19818	. . 3 ⊢ ((𝑊 ∈ Abel ∧ (-1 · 𝐴) ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + 𝐵) = (𝐵 + (-1 · 𝐴)))
31	22, 28, 29, 30	syl3anc 1372	. 2 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ((-1 · 𝐴) + 𝐵) = (𝐵 + (-1 · 𝐴)))
32	17, 20, 31	3eqtrd 2780	1 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (-1 · (𝐴 + (-1 · 𝐵))) = (𝐵 + (-1 · 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ‘cfv 6560 (class class class)co 7432 1c1 11157 -cneg 11494 Basecbs 17248 +_gcplusg 17298 Scalarcsca 17301 ·_𝑠 cvsca 17302 Abelcabl 19800 ℂModcclm 25096

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 ax-addf 11235 ax-mulf 11236

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-tp 4630 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-1o 8507 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-nn 12268 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12529 df-z 12616 df-dec 12736 df-uz 12880 df-fz 13549 df-seq 14044 df-struct 17185 df-sets 17202 df-slot 17220 df-ndx 17232 df-base 17249 df-ress 17276 df-plusg 17311 df-mulr 17312 df-starv 17313 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-0g 17487 df-mgm 18654 df-sgrp 18733 df-mnd 18749 df-grp 18955 df-minusg 18956 df-mulg 19087 df-subg 19142 df-cmn 19801 df-abl 19802 df-mgp 20139 df-ur 20180 df-ring 20233 df-cring 20234 df-subrg 20571 df-lmod 20861 df-cnfld 21366 df-clm 25097

This theorem is referenced by: (None)

W3C validator