![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clmsub4 | Structured version Visualization version GIF version |
Description: Rearrangement of 4 terms in a mixed vector addition and subtraction. (Contributed by NM, 5-Aug-2007.) (Revised by AV, 29-Sep-2021.) |
Ref | Expression |
---|---|
clmpm1dir.v | ⊢ 𝑉 = (Base‘𝑊) |
clmpm1dir.s | ⊢ · = ( ·𝑠 ‘𝑊) |
clmpm1dir.a | ⊢ + = (+g‘𝑊) |
Ref | Expression |
---|---|
clmsub4 | ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) + (-1 · (𝐶 + 𝐷))) = ((𝐴 + (-1 · 𝐶)) + (𝐵 + (-1 · 𝐷)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 486 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → 𝑊 ∈ ℂMod) | |
2 | eqid 2798 | . . . . . . 7 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
3 | eqid 2798 | . . . . . . 7 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)) | |
4 | 2, 3 | clmneg1 23687 | . . . . . 6 ⊢ (𝑊 ∈ ℂMod → -1 ∈ (Base‘(Scalar‘𝑊))) |
5 | 4 | adantr 484 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → -1 ∈ (Base‘(Scalar‘𝑊))) |
6 | simpl 486 | . . . . . 6 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → 𝐶 ∈ 𝑉) | |
7 | 6 | adantl 485 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → 𝐶 ∈ 𝑉) |
8 | simpr 488 | . . . . . 6 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉) → 𝐷 ∈ 𝑉) | |
9 | 8 | adantl 485 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → 𝐷 ∈ 𝑉) |
10 | clmpm1dir.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
11 | clmpm1dir.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝑊) | |
12 | clmpm1dir.a | . . . . . 6 ⊢ + = (+g‘𝑊) | |
13 | 10, 2, 11, 3, 12 | clmvsdi 23697 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (-1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (-1 · (𝐶 + 𝐷)) = ((-1 · 𝐶) + (-1 · 𝐷))) |
14 | 1, 5, 7, 9, 13 | syl13anc 1369 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (-1 · (𝐶 + 𝐷)) = ((-1 · 𝐶) + (-1 · 𝐷))) |
15 | 14 | 3adant2 1128 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (-1 · (𝐶 + 𝐷)) = ((-1 · 𝐶) + (-1 · 𝐷))) |
16 | 15 | oveq2d 7151 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) + (-1 · (𝐶 + 𝐷))) = ((𝐴 + 𝐵) + ((-1 · 𝐶) + (-1 · 𝐷)))) |
17 | clmabl 23674 | . . . . 5 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ Abel) | |
18 | ablcmn 18905 | . . . . 5 ⊢ (𝑊 ∈ Abel → 𝑊 ∈ CMnd) | |
19 | 17, 18 | syl 17 | . . . 4 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ CMnd) |
20 | 19 | 3ad2ant1 1130 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → 𝑊 ∈ CMnd) |
21 | simp2 1134 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) | |
22 | simpl 486 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐶 ∈ 𝑉) → 𝑊 ∈ ℂMod) | |
23 | 4 | adantr 484 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐶 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊))) |
24 | simpr 488 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ 𝑉) | |
25 | 10, 2, 11, 3 | clmvscl 23693 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐶 ∈ 𝑉) → (-1 · 𝐶) ∈ 𝑉) |
26 | 22, 23, 24, 25 | syl3anc 1368 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐶 ∈ 𝑉) → (-1 · 𝐶) ∈ 𝑉) |
27 | simpl 486 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐷 ∈ 𝑉) → 𝑊 ∈ ℂMod) | |
28 | 4 | adantr 484 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐷 ∈ 𝑉) → -1 ∈ (Base‘(Scalar‘𝑊))) |
29 | simpr 488 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐷 ∈ 𝑉) → 𝐷 ∈ 𝑉) | |
30 | 10, 2, 11, 3 | clmvscl 23693 | . . . . . 6 ⊢ ((𝑊 ∈ ℂMod ∧ -1 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝐷 ∈ 𝑉) → (-1 · 𝐷) ∈ 𝑉) |
31 | 27, 28, 29, 30 | syl3anc 1368 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐷 ∈ 𝑉) → (-1 · 𝐷) ∈ 𝑉) |
32 | 26, 31 | anim12dan 621 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((-1 · 𝐶) ∈ 𝑉 ∧ (-1 · 𝐷) ∈ 𝑉)) |
33 | 32 | 3adant2 1128 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((-1 · 𝐶) ∈ 𝑉 ∧ (-1 · 𝐷) ∈ 𝑉)) |
34 | 10, 12 | cmn4 18918 | . . 3 ⊢ ((𝑊 ∈ CMnd ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ ((-1 · 𝐶) ∈ 𝑉 ∧ (-1 · 𝐷) ∈ 𝑉)) → ((𝐴 + 𝐵) + ((-1 · 𝐶) + (-1 · 𝐷))) = ((𝐴 + (-1 · 𝐶)) + (𝐵 + (-1 · 𝐷)))) |
35 | 20, 21, 33, 34 | syl3anc 1368 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) + ((-1 · 𝐶) + (-1 · 𝐷))) = ((𝐴 + (-1 · 𝐶)) + (𝐵 + (-1 · 𝐷)))) |
36 | 16, 35 | eqtrd 2833 | 1 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) + (-1 · (𝐶 + 𝐷))) = ((𝐴 + (-1 · 𝐶)) + (𝐵 + (-1 · 𝐷)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ‘cfv 6324 (class class class)co 7135 1c1 10527 -cneg 10860 Basecbs 16475 +gcplusg 16557 Scalarcsca 16560 ·𝑠 cvsca 16561 CMndccmn 18898 Abelcabl 18899 ℂModcclm 23667 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-addf 10605 ax-mulf 10606 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12886 df-seq 13365 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-starv 16572 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-mulg 18217 df-subg 18268 df-cmn 18900 df-abl 18901 df-mgp 19233 df-ur 19245 df-ring 19292 df-cring 19293 df-subrg 19526 df-lmod 19629 df-cnfld 20092 df-clm 23668 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |