Theorem lmodvneg1 14776

Description: Minus 1 times a vector is the negative of the vector. Equation 2 of [Kreyszig] p. 51. (Contributed by NM, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Jun-2014.)

Hypotheses

Ref	Expression
lmodvneg1.v	|- V = ( Base ` W )
lmodvneg1.n	|- N = ( invg ` W )
lmodvneg1.f	|- F = (Scalar ` W )
lmodvneg1.s	|- .x. = ( .s ` W )
lmodvneg1.u	|- .1. = ( 1r ` F )
lmodvneg1.m	|- M = ( invg ` F )

Assertion

Ref	Expression
lmodvneg1	|- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) .x. X ) = ( N ` X ) )

Proof of Theorem lmodvneg1

Step	Hyp	Ref	Expression
1		simpl 109	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> W e. LMod )
2		lmodvneg1.f	. . . . . 6 |- F = (Scalar ` W )
3	2	lmodfgrp 14741	. . . . 5 |- ( W e. LMod -> F e. Grp )
4		eqid 2238	. . . . . . 7 |- ( Base ` F ) = ( Base ` F )
5		lmodvneg1.u	. . . . . . 7 |- .1. = ( 1r ` F )
6	2, 4, 5	lmod1cl 14761	. . . . . 6 |- ( W e. LMod -> .1. e. ( Base ` F ) )
7	6	adantr 276	. . . . 5 |- ( ( W e. LMod /\ X e. V ) -> .1. e. ( Base ` F ) )
8		lmodvneg1.m	. . . . . 6 |- M = ( invg ` F )
9	4, 8	grpinvcl 13912	. . . . 5 |- ( ( F e. Grp /\ .1. e. ( Base ` F ) ) -> ( M ` .1. ) e. ( Base ` F ) )
10	3, 7, 9	syl2an2r 603	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> ( M ` .1. ) e. ( Base ` F ) )
11		simpr 110	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> X e. V )
12		lmodvneg1.v	. . . . 5 |- V = ( Base ` W )
13		lmodvneg1.s	. . . . 5 |- .x. = ( .s ` W )
14	12, 2, 13, 4	lmodvscl 14750	. . . 4 |- ( ( W e. LMod /\ ( M ` .1. ) e. ( Base ` F ) /\ X e. V ) -> ( ( M ` .1. ) .x. X ) e. V )
15	1, 10, 11, 14	syl3anc 1278	. . 3 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) .x. X ) e. V )
16		eqid 2238	. . . 4 |- ( +g ` W ) = ( +g ` W )
17		eqid 2238	. . . 4 |- ( 0g ` W ) = ( 0g ` W )
18	12, 16, 17	lmod0vrid 14765	. . 3 |- ( ( W e. LMod /\ ( ( M ` .1. ) .x. X ) e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( 0g ` W ) ) = ( ( M ` .1. ) .x. X ) )
19	15, 18	syldan 282	. 2 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( 0g ` W ) ) = ( ( M ` .1. ) .x. X ) )
20		lmodvneg1.n	. . . . . 6 |- N = ( invg ` W )
21	12, 20	lmodvnegcl 14774	. . . . 5 |- ( ( W e. LMod /\ X e. V ) -> ( N ` X ) e. V )
22	12, 16	lmodass 14748	. . . . 5 |- ( ( W e. LMod /\ ( ( ( M ` .1. ) .x. X ) e. V /\ X e. V /\ ( N ` X ) e. V ) ) -> ( ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) ( +g ` W ) ( N ` X ) ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( X ( +g ` W ) ( N ` X ) ) ) )
23	1, 15, 11, 21, 22	syl13anc 1280	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) ( +g ` W ) ( N ` X ) ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( X ( +g ` W ) ( N ` X ) ) ) )
24	12, 2, 13, 5	lmodvs1 14762	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( .1. .x. X ) = X )
25	24	oveq2d 6104	. . . . . 6 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( .1. .x. X ) ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) )
26		eqid 2238	. . . . . . . . . 10 |- ( +g ` F ) = ( +g ` F )
27		eqid 2238	. . . . . . . . . 10 |- ( 0g ` F ) = ( 0g ` F )
28	4, 26, 27, 8	grplinv 13914	. . . . . . . . 9 |- ( ( F e. Grp /\ .1. e. ( Base ` F ) ) -> ( ( M ` .1. ) ( +g ` F ) .1. ) = ( 0g ` F ) )
29	3, 7, 28	syl2an2r 603	. . . . . . . 8 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) ( +g ` F ) .1. ) = ( 0g ` F ) )
30	29	oveq1d 6103	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) ( +g ` F ) .1. ) .x. X ) = ( ( 0g ` F ) .x. X ) )
31	12, 16, 2, 13, 4, 26	lmodvsdir 14758	. . . . . . . 8 |- ( ( W e. LMod /\ ( ( M ` .1. ) e. ( Base ` F ) /\ .1. e. ( Base ` F ) /\ X e. V ) ) -> ( ( ( M ` .1. ) ( +g ` F ) .1. ) .x. X ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( .1. .x. X ) ) )
32	1, 10, 7, 11, 31	syl13anc 1280	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) ( +g ` F ) .1. ) .x. X ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( .1. .x. X ) ) )
33	12, 2, 13, 27, 17	lmod0vs 14767	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( ( 0g ` F ) .x. X ) = ( 0g ` W ) )
34	30, 32, 33	3eqtr3d 2279	. . . . . 6 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( .1. .x. X ) ) = ( 0g ` W ) )
35	25, 34	eqtr3d 2273	. . . . 5 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) = ( 0g ` W ) )
36	35	oveq1d 6103	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) ( +g ` W ) ( N ` X ) ) = ( ( 0g ` W ) ( +g ` W ) ( N ` X ) ) )
37	23, 36	eqtr3d 2273	. . 3 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( X ( +g ` W ) ( N ` X ) ) ) = ( ( 0g ` W ) ( +g ` W ) ( N ` X ) ) )
38	12, 16, 17, 20	lmodvnegid 14775	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> ( X ( +g ` W ) ( N ` X ) ) = ( 0g ` W ) )
39	38	oveq2d 6104	. . 3 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( X ( +g ` W ) ( N ` X ) ) ) = ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( 0g ` W ) ) )
40	12, 16, 17	lmod0vlid 14764	. . . 4 |- ( ( W e. LMod /\ ( N ` X ) e. V ) -> ( ( 0g ` W ) ( +g ` W ) ( N ` X ) ) = ( N ` X ) )
41	21, 40	syldan 282	. . 3 |- ( ( W e. LMod /\ X e. V ) -> ( ( 0g ` W ) ( +g ` W ) ( N ` X ) ) = ( N ` X ) )
42	37, 39, 41	3eqtr3d 2279	. 2 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( 0g ` W ) ) = ( N ` X ) )
43	19, 42	eqtr3d 2273	1 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) .x. X ) = ( N ` X ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   ` cfv 5380  (class class class)co 6088   Basecbs 13410   +g cplusg 13490  Scalarcsca 13493   .scvsca 13494   0gc0g 13669   Grpcgrp 13864   invgcminusg 13865   1rcur 14369   LModclmod 14732

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-plusg 13503  df-mulr 13504  df-sca 13506  df-vsca 13507  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-mgp 14325  df-ur 14370  df-ring 14409  df-lmod 14734

This theorem is used by:  lmodvsneg  14777  lmodvsubval2  14788  lssvnegcl  14822  lspsnneg  14866