Theorem mulgneg 14002

Description: Group multiple (exponentiation) operation at a negative integer. (Contributed by Paul Chapman, 17-Apr-2009.) (Revised by Mario Carneiro, 11-Dec-2014.)

Hypotheses

Ref	Expression
mulgnncl.b	|- B = ( Base ` G )
mulgnncl.t	|- .x. = (.g ` G )
mulgneg.i	|- I = ( invg ` G )

Assertion

Ref	Expression
mulgneg	|- ( ( G e. Grp /\ N e. ZZ /\ X e. B ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )

Proof of Theorem mulgneg

Step	Hyp	Ref	Expression
1		elnn0 9576	. . 3 |- ( N e. NN0 <-> ( N e. NN \/ N = 0 ) )
2		simpr 110	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N e. NN ) -> N e. NN )
3		simpl3 1033	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N e. NN ) -> X e. B )
4		mulgnncl.b	. . . . . 6 |- B = ( Base ` G )
5		mulgnncl.t	. . . . . 6 |- .x. = (.g ` G )
6		mulgneg.i	. . . . . 6 |- I = ( invg ` G )
7	4, 5, 6	mulgnegnn 13994	. . . . 5 |- ( ( N e. NN /\ X e. B ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
8	2, 3, 7	syl2anc 415	. . . 4 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N e. NN ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
9		simpl1 1031	. . . . . 6 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> G e. Grp )
10		eqid 2238	. . . . . . 7 |- ( 0g ` G ) = ( 0g ` G )
11	10, 6	grpinvid 13924	. . . . . 6 |- ( G e. Grp -> ( I ` ( 0g ` G ) ) = ( 0g ` G ) )
12	9, 11	syl 14	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( I ` ( 0g ` G ) ) = ( 0g ` G ) )
13		simpr 110	. . . . . . . 8 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> N = 0 )
14	13	oveq1d 6103	. . . . . . 7 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( N .x. X ) = ( 0 .x. X ) )
15		simpl3 1033	. . . . . . . 8 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> X e. B )
16	4, 10, 5	mulg0 13987	. . . . . . . 8 |- ( X e. B -> ( 0 .x. X ) = ( 0g ` G ) )
17	15, 16	syl 14	. . . . . . 7 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( 0 .x. X ) = ( 0g ` G ) )
18	14, 17	eqtrd 2271	. . . . . 6 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( N .x. X ) = ( 0g ` G ) )
19	18	fveq2d 5702	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( I ` ( N .x. X ) ) = ( I ` ( 0g ` G ) ) )
20	13	negeqd 8528	. . . . . . . 8 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> -u N = -u 0 )
21		neg0 8579	. . . . . . . 8 |- -u 0 = 0
22	20, 21	eqtrdi 2287	. . . . . . 7 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> -u N = 0 )
23	22	oveq1d 6103	. . . . . 6 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( -u N .x. X ) = ( 0 .x. X ) )
24	23, 17	eqtrd 2271	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( -u N .x. X ) = ( 0g ` G ) )
25	12, 19, 24	3eqtr4rd 2282	. . . 4 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N = 0 ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
26	8, 25	jaodan 809	. . 3 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. NN \/ N = 0 ) ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
27	1, 26	sylan2b 287	. 2 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ N e. NN0 ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
28		simpl1 1031	. . . 4 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> G e. Grp )
29		simprr 537	. . . . . 6 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> -u N e. NN )
30	29	nnzd 9778	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> -u N e. ZZ )
31		simpl3 1033	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> X e. B )
32	4, 5	mulgcl 14001	. . . . 5 |- ( ( G e. Grp /\ -u N e. ZZ /\ X e. B ) -> ( -u N .x. X ) e. B )
33	28, 30, 31, 32	syl3anc 1278	. . . 4 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( -u N .x. X ) e. B )
34	4, 6	grpinvinv 13931	. . . 4 |- ( ( G e. Grp /\ ( -u N .x. X ) e. B ) -> ( I ` ( I ` ( -u N .x. X ) ) ) = ( -u N .x. X ) )
35	28, 33, 34	syl2anc 415	. . 3 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( I ` ( I ` ( -u N .x. X ) ) ) = ( -u N .x. X ) )
36	4, 5, 6	mulgnegnn 13994	. . . . . 6 |- ( ( -u N e. NN /\ X e. B ) -> ( -u -u N .x. X ) = ( I ` ( -u N .x. X ) ) )
37	29, 31, 36	syl2anc 415	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( -u -u N .x. X ) = ( I ` ( -u N .x. X ) ) )
38		simprl 535	. . . . . . . 8 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> N e. RR )
39	38	recnd 8360	. . . . . . 7 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> N e. CC )
40	39	negnegd 8635	. . . . . 6 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> -u -u N = N )
41	40	oveq1d 6103	. . . . 5 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( -u -u N .x. X ) = ( N .x. X ) )
42	37, 41	eqtr3d 2273	. . . 4 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( I ` ( -u N .x. X ) ) = ( N .x. X ) )
43	42	fveq2d 5702	. . 3 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( I ` ( I ` ( -u N .x. X ) ) ) = ( I ` ( N .x. X ) ) )
44	35, 43	eqtr3d 2273	. 2 |- ( ( ( G e. Grp /\ N e. ZZ /\ X e. B ) /\ ( N e. RR /\ -u N e. NN ) ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )
45		simp2 1029	. . 3 |- ( ( G e. Grp /\ N e. ZZ /\ X e. B ) -> N e. ZZ )
46		elznn0nn 9669	. . 3 |- ( N e. ZZ <-> ( N e. NN0 \/ ( N e. RR /\ -u N e. NN ) ) )
47	45, 46	sylib 122	. 2 |- ( ( G e. Grp /\ N e. ZZ /\ X e. B ) -> ( N e. NN0 \/ ( N e. RR /\ -u N e. NN ) ) )
48	27, 44, 47	mpjaodan 810	1 |- ( ( G e. Grp /\ N e. ZZ /\ X e. B ) -> ( -u N .x. X ) = ( I ` ( N .x. X ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   \/ wo 720   /\ w3a 1009   = wceq 1402   e. wcel 2209   ` cfv 5380  (class class class)co 6088   RRcr 8184   0cc0 8185   -ucneg 8505   NNcn 9313   NN0cn0 9574   ZZcz 9655   Basecbs 13410   0gc0g 13669   Grpcgrp 13864   invgcminusg 13865  ._gcmg 13981

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-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  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-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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-if 3639  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-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  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-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-2 9372  df-n0 9575  df-z 9656  df-uz 9938  df-seqfrec 10906  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-mulg 13982

This theorem is used by:  mulgnegneg  14003  mulgm1  14004  mulgaddcomlem  14007  mulginvcom  14009  mulgz  14012  mulgdirlem  14015  mulgdir  14016  mulgneg2  14018  mulgass  14021  mulgsubdir  14024  ghmmulg  14118  mulgass2  14470