Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clmvsneg | Structured version Visualization version GIF version |
Description: Multiplication of a vector by a negated scalar. (lmodvsneg 20155 analog.) (Contributed by Mario Carneiro, 16-Oct-2015.) |
Ref | Expression |
---|---|
clmvsneg.b | ⊢ 𝐵 = (Base‘𝑊) |
clmvsneg.f | ⊢ 𝐹 = (Scalar‘𝑊) |
clmvsneg.s | ⊢ · = ( ·𝑠 ‘𝑊) |
clmvsneg.n | ⊢ 𝑁 = (invg‘𝑊) |
clmvsneg.k | ⊢ 𝐾 = (Base‘𝐹) |
clmvsneg.w | ⊢ (𝜑 → 𝑊 ∈ ℂMod) |
clmvsneg.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
clmvsneg.r | ⊢ (𝜑 → 𝑅 ∈ 𝐾) |
Ref | Expression |
---|---|
clmvsneg | ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = (-𝑅 · 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clmvsneg.b | . . 3 ⊢ 𝐵 = (Base‘𝑊) | |
2 | clmvsneg.f | . . 3 ⊢ 𝐹 = (Scalar‘𝑊) | |
3 | clmvsneg.s | . . 3 ⊢ · = ( ·𝑠 ‘𝑊) | |
4 | clmvsneg.n | . . 3 ⊢ 𝑁 = (invg‘𝑊) | |
5 | clmvsneg.k | . . 3 ⊢ 𝐾 = (Base‘𝐹) | |
6 | eqid 2738 | . . 3 ⊢ (invg‘𝐹) = (invg‘𝐹) | |
7 | clmvsneg.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ ℂMod) | |
8 | clmlmod 24218 | . . . 4 ⊢ (𝑊 ∈ ℂMod → 𝑊 ∈ LMod) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) |
10 | clmvsneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
11 | clmvsneg.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐾) | |
12 | 1, 2, 3, 4, 5, 6, 9, 10, 11 | lmodvsneg 20155 | . 2 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = (((invg‘𝐹)‘𝑅) · 𝑋)) |
13 | 2, 5 | clmneg 24232 | . . . 4 ⊢ ((𝑊 ∈ ℂMod ∧ 𝑅 ∈ 𝐾) → -𝑅 = ((invg‘𝐹)‘𝑅)) |
14 | 7, 11, 13 | syl2anc 584 | . . 3 ⊢ (𝜑 → -𝑅 = ((invg‘𝐹)‘𝑅)) |
15 | 14 | oveq1d 7283 | . 2 ⊢ (𝜑 → (-𝑅 · 𝑋) = (((invg‘𝐹)‘𝑅) · 𝑋)) |
16 | 12, 15 | eqtr4d 2781 | 1 ⊢ (𝜑 → (𝑁‘(𝑅 · 𝑋)) = (-𝑅 · 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 ‘cfv 6427 (class class class)co 7268 -cneg 11194 Basecbs 16900 Scalarcsca 16953 ·𝑠 cvsca 16954 invgcminusg 18566 LModclmod 20111 ℂModcclm 24213 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5222 ax-nul 5229 ax-pow 5287 ax-pr 5351 ax-un 7579 ax-cnex 10915 ax-resscn 10916 ax-1cn 10917 ax-icn 10918 ax-addcl 10919 ax-addrcl 10920 ax-mulcl 10921 ax-mulrcl 10922 ax-mulcom 10923 ax-addass 10924 ax-mulass 10925 ax-distr 10926 ax-i2m1 10927 ax-1ne0 10928 ax-1rid 10929 ax-rnegex 10930 ax-rrecex 10931 ax-cnre 10932 ax-pre-lttri 10933 ax-pre-lttrn 10934 ax-pre-ltadd 10935 ax-pre-mulgt0 10936 ax-addf 10938 ax-mulf 10939 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3071 df-rmo 3072 df-rab 3073 df-v 3432 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4258 df-if 4461 df-pw 4536 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4841 df-iun 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5485 df-eprel 5491 df-po 5499 df-so 5500 df-fr 5540 df-we 5542 df-xp 5591 df-rel 5592 df-cnv 5593 df-co 5594 df-dm 5595 df-rn 5596 df-res 5597 df-ima 5598 df-pred 6196 df-ord 6263 df-on 6264 df-lim 6265 df-suc 6266 df-iota 6385 df-fun 6429 df-fn 6430 df-f 6431 df-f1 6432 df-fo 6433 df-f1o 6434 df-fv 6435 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7704 df-1st 7821 df-2nd 7822 df-frecs 8085 df-wrecs 8116 df-recs 8190 df-rdg 8229 df-1o 8285 df-er 8486 df-en 8722 df-dom 8723 df-sdom 8724 df-fin 8725 df-pnf 10999 df-mnf 11000 df-xr 11001 df-ltxr 11002 df-le 11003 df-sub 11195 df-neg 11196 df-nn 11962 df-2 12024 df-3 12025 df-4 12026 df-5 12027 df-6 12028 df-7 12029 df-8 12030 df-9 12031 df-n0 12222 df-z 12308 df-dec 12426 df-uz 12571 df-fz 13228 df-struct 16836 df-sets 16853 df-slot 16871 df-ndx 16883 df-base 16901 df-ress 16930 df-plusg 16963 df-mulr 16964 df-starv 16965 df-tset 16969 df-ple 16970 df-ds 16972 df-unif 16973 df-0g 17140 df-mgm 18314 df-sgrp 18363 df-mnd 18374 df-grp 18568 df-minusg 18569 df-subg 18740 df-cmn 19376 df-mgp 19709 df-ur 19726 df-ring 19773 df-cring 19774 df-subrg 20010 df-lmod 20113 df-cnfld 20586 df-clm 24214 |
This theorem is referenced by: clmmulg 24252 cphipval 24395 |
Copyright terms: Public domain | W3C validator |