Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clmpm1dir | Structured version Visualization version GIF version |
Description: Subtractive distributive law for the scalar product of a subcomplex module. (Contributed by NM, 31-Jul-2007.) (Revised by AV, 21-Sep-2021.) |
Ref | Expression |
---|---|
clmpm1dir.v | ⊢ 𝑉 = (Base‘𝑊) |
clmpm1dir.s | ⊢ · = ( ·𝑠 ‘𝑊) |
clmpm1dir.a | ⊢ + = (+g‘𝑊) |
clmpm1dir.k | ⊢ 𝐾 = (Base‘(Scalar‘𝑊)) |
Ref | Expression |
---|---|
clmpm1dir | ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) · 𝐶) = ((𝐴 · 𝐶) + (-1 · (𝐵 · 𝐶)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clmpm1dir.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
2 | clmpm1dir.s | . . 3 ⊢ · = ( ·𝑠 ‘𝑊) | |
3 | eqid 2821 | . . 3 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
4 | clmpm1dir.k | . . 3 ⊢ 𝐾 = (Base‘(Scalar‘𝑊)) | |
5 | eqid 2821 | . . 3 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
6 | simpl 485 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → 𝑊 ∈ ℂMod) | |
7 | simpr1 1190 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → 𝐴 ∈ 𝐾) | |
8 | simpr2 1191 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝐾) | |
9 | simpr3 1192 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | clmsubdir 23706 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) · 𝐶) = ((𝐴 · 𝐶)(-g‘𝑊)(𝐵 · 𝐶))) |
11 | 1, 3, 2, 4 | clmvscl 23692 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐴 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉) → (𝐴 · 𝐶) ∈ 𝑉) |
12 | 6, 7, 9, 11 | syl3anc 1367 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → (𝐴 · 𝐶) ∈ 𝑉) |
13 | 1, 3, 2, 4 | clmvscl 23692 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉) → (𝐵 · 𝐶) ∈ 𝑉) |
14 | 6, 8, 9, 13 | syl3anc 1367 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → (𝐵 · 𝐶) ∈ 𝑉) |
15 | clmpm1dir.a | . . . 4 ⊢ + = (+g‘𝑊) | |
16 | eqid 2821 | . . . 4 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
17 | 1, 15, 16, 5 | grpsubval 18149 | . . 3 ⊢ (((𝐴 · 𝐶) ∈ 𝑉 ∧ (𝐵 · 𝐶) ∈ 𝑉) → ((𝐴 · 𝐶)(-g‘𝑊)(𝐵 · 𝐶)) = ((𝐴 · 𝐶) + ((invg‘𝑊)‘(𝐵 · 𝐶)))) |
18 | 12, 14, 17 | syl2anc 586 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐶)(-g‘𝑊)(𝐵 · 𝐶)) = ((𝐴 · 𝐶) + ((invg‘𝑊)‘(𝐵 · 𝐶)))) |
19 | 1, 16, 3, 2 | clmvneg1 23703 | . . . . 5 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐵 · 𝐶) ∈ 𝑉) → (-1 · (𝐵 · 𝐶)) = ((invg‘𝑊)‘(𝐵 · 𝐶))) |
20 | 19 | eqcomd 2827 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐵 · 𝐶) ∈ 𝑉) → ((invg‘𝑊)‘(𝐵 · 𝐶)) = (-1 · (𝐵 · 𝐶))) |
21 | 6, 14, 20 | syl2anc 586 | . . 3 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((invg‘𝑊)‘(𝐵 · 𝐶)) = (-1 · (𝐵 · 𝐶))) |
22 | 21 | oveq2d 7172 | . 2 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 · 𝐶) + ((invg‘𝑊)‘(𝐵 · 𝐶))) = ((𝐴 · 𝐶) + (-1 · (𝐵 · 𝐶)))) |
23 | 10, 18, 22 | 3eqtrd 2860 | 1 ⊢ ((𝑊 ∈ ℂMod ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) · 𝐶) = ((𝐴 · 𝐶) + (-1 · (𝐵 · 𝐶)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ‘cfv 6355 (class class class)co 7156 1c1 10538 − cmin 10870 -cneg 10871 Basecbs 16483 +gcplusg 16565 Scalarcsca 16568 ·𝑠 cvsca 16569 invgcminusg 18104 -gcsg 18105 ℂModcclm 23666 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-addf 10616 ax-mulf 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-3 11702 df-4 11703 df-5 11704 df-6 11705 df-7 11706 df-8 11707 df-9 11708 df-n0 11899 df-z 11983 df-dec 12100 df-uz 12245 df-fz 12894 df-seq 13371 df-struct 16485 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 df-plusg 16578 df-mulr 16579 df-starv 16580 df-tset 16584 df-ple 16585 df-ds 16587 df-unif 16588 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-grp 18106 df-minusg 18107 df-sbg 18108 df-mulg 18225 df-subg 18276 df-cmn 18908 df-mgp 19240 df-ur 19252 df-ring 19299 df-cring 19300 df-subrg 19533 df-lmod 19636 df-cnfld 20546 df-clm 23667 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |