Theorem opprrngbg 14383

Description: A set is a non-unital ring if and only if its opposite is a non-unital ring. Bidirectional form of opprrng 14382. (Contributed by AV, 15-Feb-2025.)

Hypothesis

Ref	Expression
opprbas.1	|- O = (oppr ` R )

Assertion

Ref	Expression
opprrngbg	|- ( R e. V -> ( R e. Rng <-> O e. Rng ) )

Proof of Theorem opprrngbg

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opprbas.1	. . 3 |- O = (oppr ` R )
2	1	opprrng 14382	. 2 |- ( R e. Rng -> O e. Rng )
3		eqid 2238	. . . 4 |- (oppr ` O ) = (oppr ` O )
4	3	opprrng 14382	. . 3 |- ( O e. Rng -> (oppr ` O ) e. Rng )
5		eqid 2238	. . . . 5 |- ( Base ` R ) = ( Base ` R )
6	5	a1i 9	. . . 4 |- ( R e. V -> ( Base ` R ) = ( Base ` R ) )
7	1, 5	opprbasg 14380	. . . . 5 |- ( R e. V -> ( Base ` R ) = ( Base ` O ) )
8	1	opprex 14378	. . . . . 6 |- ( R e. V -> O e. _V )
9		eqid 2238	. . . . . . 7 |- ( Base ` O ) = ( Base ` O )
10	3, 9	opprbasg 14380	. . . . . 6 |- ( O e. _V -> ( Base ` O ) = ( Base ` (oppr ` O ) ) )
11	8, 10	syl 14	. . . . 5 |- ( R e. V -> ( Base ` O ) = ( Base ` (oppr ` O ) ) )
12	7, 11	eqtrd 2271	. . . 4 |- ( R e. V -> ( Base ` R ) = ( Base ` (oppr ` O ) ) )
13		eqid 2238	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
14	1, 13	oppraddg 14381	. . . . . 6 |- ( R e. V -> ( +g ` R ) = ( +g ` O ) )
15		eqid 2238	. . . . . . . 8 |- ( +g ` O ) = ( +g ` O )
16	3, 15	oppraddg 14381	. . . . . . 7 |- ( O e. _V -> ( +g ` O ) = ( +g ` (oppr ` O ) ) )
17	8, 16	syl 14	. . . . . 6 |- ( R e. V -> ( +g ` O ) = ( +g ` (oppr ` O ) ) )
18	14, 17	eqtrd 2271	. . . . 5 |- ( R e. V -> ( +g ` R ) = ( +g ` (oppr ` O ) ) )
19	18	oveqdr 6113	. . . 4 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( +g ` R ) y ) = ( x ( +g ` (oppr ` O ) ) y ) )
20		vex 2824	. . . . . . . 8 |- x e. _V
21	20	a1i 9	. . . . . . 7 |- ( R e. V -> x e. _V )
22		vex 2824	. . . . . . . 8 |- y e. _V
23	22	a1i 9	. . . . . . 7 |- ( R e. V -> y e. _V )
24		eqid 2238	. . . . . . . 8 |- ( .r ` O ) = ( .r ` O )
25		eqid 2238	. . . . . . . 8 |- ( .r ` (oppr ` O ) ) = ( .r ` (oppr ` O ) )
26	9, 24, 3, 25	opprmulg 14376	. . . . . . 7 |- ( ( O e. _V /\ x e. _V /\ y e. _V ) -> ( x ( .r ` (oppr ` O ) ) y ) = ( y ( .r ` O ) x ) )
27	8, 21, 23, 26	syl3anc 1278	. . . . . 6 |- ( R e. V -> ( x ( .r ` (oppr ` O ) ) y ) = ( y ( .r ` O ) x ) )
28	27	adantr 276	. . . . 5 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( .r ` (oppr ` O ) ) y ) = ( y ( .r ` O ) x ) )
29		simpl 109	. . . . . 6 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> R e. V )
30		simprr 537	. . . . . 6 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> y e. ( Base ` R ) )
31		simprl 535	. . . . . 6 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> x e. ( Base ` R ) )
32		eqid 2238	. . . . . . 7 |- ( .r ` R ) = ( .r ` R )
33	5, 32, 1, 24	opprmulg 14376	. . . . . 6 |- ( ( R e. V /\ y e. ( Base ` R ) /\ x e. ( Base ` R ) ) -> ( y ( .r ` O ) x ) = ( x ( .r ` R ) y ) )
34	29, 30, 31, 33	syl3anc 1278	. . . . 5 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( y ( .r ` O ) x ) = ( x ( .r ` R ) y ) )
35	28, 34	eqtr2d 2272	. . . 4 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( .r ` R ) y ) = ( x ( .r ` (oppr ` O ) ) y ) )
36	6, 12, 19, 35	rngpropd 14254	. . 3 |- ( R e. V -> ( R e. Rng <-> (oppr ` O ) e. Rng ) )
37	4, 36	imbitrrid 156	. 2 |- ( R e. V -> ( O e. Rng -> R e. Rng ) )
38	2, 37	impbid2 143	1 |- ( R e. V -> ( R e. Rng <-> O e. Rng ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   _Vcvv 2821   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   .rcmulr 13432  Rngcrng 14231  opp_rcoppr 14372

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-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  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-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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-tpos 6516  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-cmn 14089  df-abl 14090  df-mgp 14218  df-rng 14232  df-oppr 14373

This theorem is used by:  opprsubrngg  14519