Theorem unitnegcl 13686

Description: The negative of a unit is a unit. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
unitnegcl.1	|- U = (Unit ` R )
unitnegcl.2	|- N = ( invg ` R )

Assertion

Ref	Expression
unitnegcl	|- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) e. U )

Proof of Theorem unitnegcl

Step	Hyp	Ref	Expression
1		simpl 109	. . 3 |- ( ( R e. Ring /\ X e. U ) -> R e. Ring )
2		ringgrp 13557	. . . . . 6 |- ( R e. Ring -> R e. Grp )
3		eqidd 2197	. . . . . . 7 |- ( ( R e. Ring /\ X e. U ) -> ( Base ` R ) = ( Base ` R ) )
4		unitnegcl.1	. . . . . . . 8 |- U = (Unit ` R )
5	4	a1i 9	. . . . . . 7 |- ( ( R e. Ring /\ X e. U ) -> U = (Unit ` R ) )
6		ringsrg 13603	. . . . . . . 8 |- ( R e. Ring -> R e. SRing )
7	6	adantr 276	. . . . . . 7 |- ( ( R e. Ring /\ X e. U ) -> R e. SRing )
8		simpr 110	. . . . . . 7 |- ( ( R e. Ring /\ X e. U ) -> X e. U )
9	3, 5, 7, 8	unitcld 13664	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> X e. ( Base ` R ) )
10		eqid 2196	. . . . . . 7 |- ( Base ` R ) = ( Base ` R )
11		unitnegcl.2	. . . . . . 7 |- N = ( invg ` R )
12	10, 11	grpinvcl 13180	. . . . . 6 |- ( ( R e. Grp /\ X e. ( Base ` R ) ) -> ( N ` X ) e. ( Base ` R ) )
13	2, 9, 12	syl2an2r 595	. . . . 5 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) e. ( Base ` R ) )
14		eqid 2196	. . . . . 6 |- ( ||r ` R ) = ( ||r ` R )
15	10, 14, 11	dvdsrneg 13659	. . . . 5 |- ( ( R e. Ring /\ ( N ` X ) e. ( Base ` R ) ) -> ( N ` X ) ( ||r ` R ) ( N ` ( N ` X ) ) )
16	13, 15	syldan 282	. . . 4 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` R ) ( N ` ( N ` X ) ) )
17	10, 11	grpinvinv 13199	. . . . 5 |- ( ( R e. Grp /\ X e. ( Base ` R ) ) -> ( N ` ( N ` X ) ) = X )
18	2, 9, 17	syl2an2r 595	. . . 4 |- ( ( R e. Ring /\ X e. U ) -> ( N ` ( N ` X ) ) = X )
19	16, 18	breqtrd 4059	. . 3 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` R ) X )
20		eqidd 2197	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> ( 1r ` R ) = ( 1r ` R ) )
21		eqidd 2197	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> ( ||r ` R ) = ( ||r ` R ) )
22		eqidd 2197	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> (oppr ` R ) = (oppr ` R ) )
23		eqidd 2197	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> ( ||r ` (oppr ` R ) ) = ( ||r ` (oppr ` R ) ) )
24	5, 20, 21, 22, 23, 7	isunitd 13662	. . . . 5 |- ( ( R e. Ring /\ X e. U ) -> ( X e. U <-> ( X ( ||r ` R ) ( 1r ` R ) /\ X ( ||r ` (oppr ` R ) ) ( 1r ` R ) ) ) )
25	8, 24	mpbid 147	. . . 4 |- ( ( R e. Ring /\ X e. U ) -> ( X ( ||r ` R ) ( 1r ` R ) /\ X ( ||r ` (oppr ` R ) ) ( 1r ` R ) ) )
26	25	simpld 112	. . 3 |- ( ( R e. Ring /\ X e. U ) -> X ( ||r ` R ) ( 1r ` R ) )
27	10, 14	dvdsrtr 13657	. . 3 |- ( ( R e. Ring /\ ( N ` X ) ( ||r ` R ) X /\ X ( ||r ` R ) ( 1r ` R ) ) -> ( N ` X ) ( ||r ` R ) ( 1r ` R ) )
28	1, 19, 26, 27	syl3anc 1249	. 2 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` R ) ( 1r ` R ) )
29		eqid 2196	. . . . 5 |- (oppr ` R ) = (oppr ` R )
30	29	opprring 13635	. . . 4 |- ( R e. Ring -> (oppr ` R ) e. Ring )
31	30	adantr 276	. . 3 |- ( ( R e. Ring /\ X e. U ) -> (oppr ` R ) e. Ring )
32	29, 10	opprbasg 13631	. . . . . . . . 9 |- ( R e. Ring -> ( Base ` R ) = ( Base ` (oppr ` R ) ) )
33	32	eleq2d 2266	. . . . . . . 8 |- ( R e. Ring -> ( ( N ` X ) e. ( Base ` R ) <-> ( N ` X ) e. ( Base ` (oppr ` R ) ) ) )
34	33	adantr 276	. . . . . . 7 |- ( ( R e. Ring /\ X e. U ) -> ( ( N ` X ) e. ( Base ` R ) <-> ( N ` X ) e. ( Base ` (oppr ` R ) ) ) )
35	13, 34	mpbid 147	. . . . . 6 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) e. ( Base ` (oppr ` R ) ) )
36		eqid 2196	. . . . . . 7 |- ( Base ` (oppr ` R ) ) = ( Base ` (oppr ` R ) )
37		eqid 2196	. . . . . . 7 |- ( ||r ` (oppr ` R ) ) = ( ||r ` (oppr ` R ) )
38		eqid 2196	. . . . . . 7 |- ( invg ` (oppr ` R ) ) = ( invg ` (oppr ` R ) )
39	36, 37, 38	dvdsrneg 13659	. . . . . 6 |- ( ( (oppr ` R ) e. Ring /\ ( N ` X ) e. ( Base ` (oppr ` R ) ) ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) ( ( invg ` (oppr ` R ) ) ` ( N ` X ) ) )
40	30, 35, 39	syl2an2r 595	. . . . 5 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) ( ( invg ` (oppr ` R ) ) ` ( N ` X ) ) )
41	29, 11	opprnegg 13639	. . . . . . . 8 |- ( R e. Ring -> N = ( invg ` (oppr ` R ) ) )
42	41	fveq1d 5560	. . . . . . 7 |- ( R e. Ring -> ( N ` ( N ` X ) ) = ( ( invg ` (oppr ` R ) ) ` ( N ` X ) ) )
43	42	breq2d 4045	. . . . . 6 |- ( R e. Ring -> ( ( N ` X ) ( ||r ` (oppr ` R ) ) ( N ` ( N ` X ) ) <-> ( N ` X ) ( ||r ` (oppr ` R ) ) ( ( invg ` (oppr ` R ) ) ` ( N ` X ) ) ) )
44	43	adantr 276	. . . . 5 |- ( ( R e. Ring /\ X e. U ) -> ( ( N ` X ) ( ||r ` (oppr ` R ) ) ( N ` ( N ` X ) ) <-> ( N ` X ) ( ||r ` (oppr ` R ) ) ( ( invg ` (oppr ` R ) ) ` ( N ` X ) ) ) )
45	40, 44	mpbird 167	. . . 4 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) ( N ` ( N ` X ) ) )
46	45, 18	breqtrd 4059	. . 3 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) X )
47	25	simprd 114	. . 3 |- ( ( R e. Ring /\ X e. U ) -> X ( ||r ` (oppr ` R ) ) ( 1r ` R ) )
48	36, 37	dvdsrtr 13657	. . 3 |- ( ( (oppr ` R ) e. Ring /\ ( N ` X ) ( ||r ` (oppr ` R ) ) X /\ X ( ||r ` (oppr ` R ) ) ( 1r ` R ) ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) ( 1r ` R ) )
49	31, 46, 47, 48	syl3anc 1249	. 2 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) ( ||r ` (oppr ` R ) ) ( 1r ` R ) )
50	5, 20, 21, 22, 23, 7	isunitd 13662	. 2 |- ( ( R e. Ring /\ X e. U ) -> ( ( N ` X ) e. U <-> ( ( N ` X ) ( ||r ` R ) ( 1r ` R ) /\ ( N ` X ) ( ||r ` (oppr ` R ) ) ( 1r ` R ) ) ) )
51	28, 49, 50	mpbir2and 946	1 |- ( ( R e. Ring /\ X e. U ) -> ( N ` X ) e. U )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2167   class class class wbr 4033   ` cfv 5258   Basecbs 12678   Grpcgrp 13132   invgcminusg 13133   1rcur 13515  SRingcsrg 13519   Ringcrg 13552  opp_rcoppr 13623   ||_rcdsr 13642  Unitcui 13643

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-pre-ltirr 7991  ax-pre-lttrn 7993  ax-pre-ltadd 7995

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-tpos 6303  df-pnf 8063  df-mnf 8064  df-ltxr 8066  df-inn 8991  df-2 9049  df-3 9050  df-ndx 12681  df-slot 12682  df-base 12684  df-sets 12685  df-plusg 12768  df-mulr 12769  df-0g 12929  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-grp 13135  df-minusg 13136  df-cmn 13416  df-abl 13417  df-mgp 13477  df-ur 13516  df-srg 13520  df-ring 13554  df-oppr 13624  df-dvdsr 13645  df-unit 13646

This theorem is referenced by:  aprsym  13840