Theorem ringnegl 14014

Description: Negation in a ring is the same as left multiplication by -1. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 2-Jul-2014.)

Hypotheses

Ref	Expression
ringnegl.b	|- B = ( Base ` R )
ringnegl.t	|- .x. = ( .r ` R )
ringnegl.u	|- .1. = ( 1r ` R )
ringnegl.n	|- N = ( invg ` R )
ringnegl.r	|- ( ph -> R e. Ring )
ringnegl.x	|- ( ph -> X e. B )

Assertion

Ref	Expression
ringnegl	|- ( ph -> ( ( N ` .1. ) .x. X ) = ( N ` X ) )

Proof of Theorem ringnegl

Step	Hyp	Ref	Expression
1		ringnegl.r	. . . . 5 |- ( ph -> R e. Ring )
2		ringnegl.b	. . . . . . 7 |- B = ( Base ` R )
3		ringnegl.u	. . . . . . 7 |- .1. = ( 1r ` R )
4	2, 3	ringidcl 13983	. . . . . 6 |- ( R e. Ring -> .1. e. B )
5	1, 4	syl 14	. . . . 5 |- ( ph -> .1. e. B )
6		ringgrp 13964	. . . . . . 7 |- ( R e. Ring -> R e. Grp )
7	1, 6	syl 14	. . . . . 6 |- ( ph -> R e. Grp )
8		ringnegl.n	. . . . . . 7 |- N = ( invg ` R )
9	2, 8	grpinvcl 13581	. . . . . 6 |- ( ( R e. Grp /\ .1. e. B ) -> ( N ` .1. ) e. B )
10	7, 5, 9	syl2anc 411	. . . . 5 |- ( ph -> ( N ` .1. ) e. B )
11		ringnegl.x	. . . . 5 |- ( ph -> X e. B )
12		eqid 2229	. . . . . 6 |- ( +g ` R ) = ( +g ` R )
13		ringnegl.t	. . . . . 6 |- .x. = ( .r ` R )
14	2, 12, 13	ringdir 13982	. . . . 5 |- ( ( R e. Ring /\ ( .1. e. B /\ ( N ` .1. ) e. B /\ X e. B ) ) -> ( ( .1. ( +g ` R ) ( N ` .1. ) ) .x. X ) = ( ( .1. .x. X ) ( +g ` R ) ( ( N ` .1. ) .x. X ) ) )
15	1, 5, 10, 11, 14	syl13anc 1273	. . . 4 |- ( ph -> ( ( .1. ( +g ` R ) ( N ` .1. ) ) .x. X ) = ( ( .1. .x. X ) ( +g ` R ) ( ( N ` .1. ) .x. X ) ) )
16		eqid 2229	. . . . . . . 8 |- ( 0g ` R ) = ( 0g ` R )
17	2, 12, 16, 8	grprinv 13584	. . . . . . 7 |- ( ( R e. Grp /\ .1. e. B ) -> ( .1. ( +g ` R ) ( N ` .1. ) ) = ( 0g ` R ) )
18	7, 5, 17	syl2anc 411	. . . . . 6 |- ( ph -> ( .1. ( +g ` R ) ( N ` .1. ) ) = ( 0g ` R ) )
19	18	oveq1d 6016	. . . . 5 |- ( ph -> ( ( .1. ( +g ` R ) ( N ` .1. ) ) .x. X ) = ( ( 0g ` R ) .x. X ) )
20	2, 13, 16	ringlz 14006	. . . . . 6 |- ( ( R e. Ring /\ X e. B ) -> ( ( 0g ` R ) .x. X ) = ( 0g ` R ) )
21	1, 11, 20	syl2anc 411	. . . . 5 |- ( ph -> ( ( 0g ` R ) .x. X ) = ( 0g ` R ) )
22	19, 21	eqtrd 2262	. . . 4 |- ( ph -> ( ( .1. ( +g ` R ) ( N ` .1. ) ) .x. X ) = ( 0g ` R ) )
23	2, 13, 3	ringlidm 13986	. . . . . 6 |- ( ( R e. Ring /\ X e. B ) -> ( .1. .x. X ) = X )
24	1, 11, 23	syl2anc 411	. . . . 5 |- ( ph -> ( .1. .x. X ) = X )
25	24	oveq1d 6016	. . . 4 |- ( ph -> ( ( .1. .x. X ) ( +g ` R ) ( ( N ` .1. ) .x. X ) ) = ( X ( +g ` R ) ( ( N ` .1. ) .x. X ) ) )
26	15, 22, 25	3eqtr3rd 2271	. . 3 |- ( ph -> ( X ( +g ` R ) ( ( N ` .1. ) .x. X ) ) = ( 0g ` R ) )
27	2, 13	ringcl 13976	. . . . 5 |- ( ( R e. Ring /\ ( N ` .1. ) e. B /\ X e. B ) -> ( ( N ` .1. ) .x. X ) e. B )
28	1, 10, 11, 27	syl3anc 1271	. . . 4 |- ( ph -> ( ( N ` .1. ) .x. X ) e. B )
29	2, 12, 16, 8	grpinvid1 13585	. . . 4 |- ( ( R e. Grp /\ X e. B /\ ( ( N ` .1. ) .x. X ) e. B ) -> ( ( N ` X ) = ( ( N ` .1. ) .x. X ) <-> ( X ( +g ` R ) ( ( N ` .1. ) .x. X ) ) = ( 0g ` R ) ) )
30	7, 11, 28, 29	syl3anc 1271	. . 3 |- ( ph -> ( ( N ` X ) = ( ( N ` .1. ) .x. X ) <-> ( X ( +g ` R ) ( ( N ` .1. ) .x. X ) ) = ( 0g ` R ) ) )
31	26, 30	mpbird 167	. 2 |- ( ph -> ( N ` X ) = ( ( N ` .1. ) .x. X ) )
32	31	eqcomd 2235	1 |- ( ph -> ( ( N ` .1. ) .x. X ) = ( N ` X ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1395   e. wcel 2200   ` cfv 5318  (class class class)co 6001   Basecbs 13032   +g cplusg 13110   .rcmulr 13111   0gc0g 13289   Grpcgrp 13533   invgcminusg 13534   1rcur 13922   Ringcrg 13959

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-pre-ltirr 8111  ax-pre-ltadd 8115

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-ltxr 8186  df-inn 9111  df-2 9169  df-3 9170  df-ndx 13035  df-slot 13036  df-base 13038  df-sets 13039  df-plusg 13123  df-mulr 13124  df-0g 13291  df-mgm 13389  df-sgrp 13435  df-mnd 13450  df-grp 13536  df-minusg 13537  df-mgp 13884  df-ur 13923  df-ring 13961

This theorem is referenced by:  ringmneg1  14016  dvdsrneg  14067  lmodvsneg  14295  lmodsubvs  14307  lmodsubdi  14308  lmodsubdir  14309