Theorem lmodvneg1 13420

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 13386	. . . . 5 |- ( W e. LMod -> F e. Grp )
4		eqid 2177	. . . . . . 7 |- ( Base ` F ) = ( Base ` F )
5		lmodvneg1.u	. . . . . . 7 |- .1. = ( 1r ` F )
6	2, 4, 5	lmod1cl 13405	. . . . . 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 12921	. . . . 5 |- ( ( F e. Grp /\ .1. e. ( Base ` F ) ) -> ( M ` .1. ) e. ( Base ` F ) )
10	3, 7, 9	syl2an2r 595	. . . 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 13395	. . . 4 |- ( ( W e. LMod /\ ( M ` .1. ) e. ( Base ` F ) /\ X e. V ) -> ( ( M ` .1. ) .x. X ) e. V )
15	1, 10, 11, 14	syl3anc 1238	. . 3 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) .x. X ) e. V )
16		eqid 2177	. . . 4 |- ( +g ` W ) = ( +g ` W )
17		eqid 2177	. . . 4 |- ( 0g ` W ) = ( 0g ` W )
18	12, 16, 17	lmod0vrid 13409	. . 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 13418	. . . . 5 |- ( ( W e. LMod /\ X e. V ) -> ( N ` X ) e. V )
22	12, 16	lmodass 13393	. . . . 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 1240	. . . 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 13406	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( .1. .x. X ) = X )
25	24	oveq2d 5891	. . . . . 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 2177	. . . . . . . . . 10 |- ( +g ` F ) = ( +g ` F )
27		eqid 2177	. . . . . . . . . 10 |- ( 0g ` F ) = ( 0g ` F )
28	4, 26, 27, 8	grplinv 12922	. . . . . . . . 9 |- ( ( F e. Grp /\ .1. e. ( Base ` F ) ) -> ( ( M ` .1. ) ( +g ` F ) .1. ) = ( 0g ` F ) )
29	3, 7, 28	syl2an2r 595	. . . . . . . 8 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) ( +g ` F ) .1. ) = ( 0g ` F ) )
30	29	oveq1d 5890	. . . . . . 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 13402	. . . . . . . 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 1240	. . . . . . 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 13411	. . . . . . 7 |- ( ( W e. LMod /\ X e. V ) -> ( ( 0g ` F ) .x. X ) = ( 0g ` W ) )
34	30, 32, 33	3eqtr3d 2218	. . . . . 6 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( .1. .x. X ) ) = ( 0g ` W ) )
35	25, 34	eqtr3d 2212	. . . . 5 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) X ) = ( 0g ` W ) )
36	35	oveq1d 5890	. . . 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 2212	. . 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 13419	. . . 4 |- ( ( W e. LMod /\ X e. V ) -> ( X ( +g ` W ) ( N ` X ) ) = ( 0g ` W ) )
39	38	oveq2d 5891	. . 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 13408	. . . 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 2218	. 2 |- ( ( W e. LMod /\ X e. V ) -> ( ( ( M ` .1. ) .x. X ) ( +g ` W ) ( 0g ` W ) ) = ( N ` X ) )
43	19, 42	eqtr3d 2212	1 |- ( ( W e. LMod /\ X e. V ) -> ( ( M ` .1. ) .x. X ) = ( N ` X ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   ` cfv 5217  (class class class)co 5875   Basecbs 12462   +g cplusg 12536  Scalarcsca 12539   .scvsca 12540   0gc0g 12705   Grpcgrp 12877   invgcminusg 12878   1rcur 13142   LModclmod 13377

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537  ax-cnex 7902  ax-resscn 7903  ax-1cn 7904  ax-1re 7905  ax-icn 7906  ax-addcl 7907  ax-addrcl 7908  ax-mulcl 7909  ax-addcom 7911  ax-addass 7913  ax-i2m1 7916  ax-0lt1 7917  ax-0id 7919  ax-rnegex 7920  ax-pre-ltirr 7923  ax-pre-ltadd 7927

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-riota 5831  df-ov 5878  df-oprab 5879  df-mpo 5880  df-pnf 7994  df-mnf 7995  df-ltxr 7997  df-inn 8920  df-2 8978  df-3 8979  df-4 8980  df-5 8981  df-6 8982  df-ndx 12465  df-slot 12466  df-base 12468  df-sets 12469  df-plusg 12549  df-mulr 12550  df-sca 12552  df-vsca 12553  df-0g 12707  df-mgm 12775  df-sgrp 12808  df-mnd 12818  df-grp 12880  df-minusg 12881  df-mgp 13131  df-ur 13143  df-ring 13181  df-lmod 13379

This theorem is referenced by:  lmodvsneg  13421  lmodvsubval2  13432