Theorem ringnegr 14064

Description: Negation in a ring is the same as right 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
ringnegr	|- ( ph -> ( X .x. ( N ` .1. ) ) = ( N ` X ) )

Proof of Theorem ringnegr

Step	Hyp	Ref	Expression
1		ringnegl.r	. . . . 5 |- ( ph -> R e. Ring )
2		ringnegl.x	. . . . 5 |- ( ph -> X e. B )
3		ringgrp 14013	. . . . . . 7 |- ( R e. Ring -> R e. Grp )
4	1, 3	syl 14	. . . . . 6 |- ( ph -> R e. Grp )
5		ringnegl.b	. . . . . . . 8 |- B = ( Base ` R )
6		ringnegl.u	. . . . . . . 8 |- .1. = ( 1r ` R )
7	5, 6	ringidcl 14032	. . . . . . 7 |- ( R e. Ring -> .1. e. B )
8	1, 7	syl 14	. . . . . 6 |- ( ph -> .1. e. B )
9		ringnegl.n	. . . . . . 7 |- N = ( invg ` R )
10	5, 9	grpinvcl 13630	. . . . . 6 |- ( ( R e. Grp /\ .1. e. B ) -> ( N ` .1. ) e. B )
11	4, 8, 10	syl2anc 411	. . . . 5 |- ( ph -> ( N ` .1. ) e. B )
12		eqid 2231	. . . . . 6 |- ( +g ` R ) = ( +g ` R )
13		ringnegl.t	. . . . . 6 |- .x. = ( .r ` R )
14	5, 12, 13	ringdi 14030	. . . . 5 |- ( ( R e. Ring /\ ( X e. B /\ ( N ` .1. ) e. B /\ .1. e. B ) ) -> ( X .x. ( ( N ` .1. ) ( +g ` R ) .1. ) ) = ( ( X .x. ( N ` .1. ) ) ( +g ` R ) ( X .x. .1. ) ) )
15	1, 2, 11, 8, 14	syl13anc 1275	. . . 4 |- ( ph -> ( X .x. ( ( N ` .1. ) ( +g ` R ) .1. ) ) = ( ( X .x. ( N ` .1. ) ) ( +g ` R ) ( X .x. .1. ) ) )
16		eqid 2231	. . . . . . . 8 |- ( 0g ` R ) = ( 0g ` R )
17	5, 12, 16, 9	grplinv 13632	. . . . . . 7 |- ( ( R e. Grp /\ .1. e. B ) -> ( ( N ` .1. ) ( +g ` R ) .1. ) = ( 0g ` R ) )
18	4, 8, 17	syl2anc 411	. . . . . 6 |- ( ph -> ( ( N ` .1. ) ( +g ` R ) .1. ) = ( 0g ` R ) )
19	18	oveq2d 6033	. . . . 5 |- ( ph -> ( X .x. ( ( N ` .1. ) ( +g ` R ) .1. ) ) = ( X .x. ( 0g ` R ) ) )
20	5, 13, 16	ringrz 14056	. . . . . 6 |- ( ( R e. Ring /\ X e. B ) -> ( X .x. ( 0g ` R ) ) = ( 0g ` R ) )
21	1, 2, 20	syl2anc 411	. . . . 5 |- ( ph -> ( X .x. ( 0g ` R ) ) = ( 0g ` R ) )
22	19, 21	eqtrd 2264	. . . 4 |- ( ph -> ( X .x. ( ( N ` .1. ) ( +g ` R ) .1. ) ) = ( 0g ` R ) )
23	5, 13, 6	ringridm 14036	. . . . . 6 |- ( ( R e. Ring /\ X e. B ) -> ( X .x. .1. ) = X )
24	1, 2, 23	syl2anc 411	. . . . 5 |- ( ph -> ( X .x. .1. ) = X )
25	24	oveq2d 6033	. . . 4 |- ( ph -> ( ( X .x. ( N ` .1. ) ) ( +g ` R ) ( X .x. .1. ) ) = ( ( X .x. ( N ` .1. ) ) ( +g ` R ) X ) )
26	15, 22, 25	3eqtr3rd 2273	. . 3 |- ( ph -> ( ( X .x. ( N ` .1. ) ) ( +g ` R ) X ) = ( 0g ` R ) )
27	5, 13	ringcl 14025	. . . . 5 |- ( ( R e. Ring /\ X e. B /\ ( N ` .1. ) e. B ) -> ( X .x. ( N ` .1. ) ) e. B )
28	1, 2, 11, 27	syl3anc 1273	. . . 4 |- ( ph -> ( X .x. ( N ` .1. ) ) e. B )
29	5, 12, 16, 9	grpinvid2 13635	. . . 4 |- ( ( R e. Grp /\ X e. B /\ ( X .x. ( N ` .1. ) ) e. B ) -> ( ( N ` X ) = ( X .x. ( N ` .1. ) ) <-> ( ( X .x. ( N ` .1. ) ) ( +g ` R ) X ) = ( 0g ` R ) ) )
30	4, 2, 28, 29	syl3anc 1273	. . 3 |- ( ph -> ( ( N ` X ) = ( X .x. ( N ` .1. ) ) <-> ( ( X .x. ( N ` .1. ) ) ( +g ` R ) X ) = ( 0g ` R ) ) )
31	26, 30	mpbird 167	. 2 |- ( ph -> ( N ` X ) = ( X .x. ( N ` .1. ) ) )
32	31	eqcomd 2237	1 |- ( ph -> ( X .x. ( N ` .1. ) ) = ( N ` X ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1397   e. wcel 2202   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   .rcmulr 13160   0gc0g 13338   Grpcgrp 13582   invgcminusg 13583   1rcur 13971   Ringcrg 14008

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586  df-mgp 13933  df-ur 13972  df-ring 14010

This theorem is referenced by:  ringmneg2  14066  lmodsubdi  14357