Theorem opprrngbg 14321

Description: A set is a non-unital ring if and only if its opposite is a non-unital ring. Bidirectional form of opprrng 14320. (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 14320	. 2 |- ( R e. Rng -> O e. Rng )
3		eqid 2234	. . . 4 |- (oppr ` O ) = (oppr ` O )
4	3	opprrng 14320	. . 3 |- ( O e. Rng -> (oppr ` O ) e. Rng )
5		eqid 2234	. . . . 5 |- ( Base ` R ) = ( Base ` R )
6	5	a1i 9	. . . 4 |- ( R e. V -> ( Base ` R ) = ( Base ` R ) )
7	1, 5	opprbasg 14318	. . . . 5 |- ( R e. V -> ( Base ` R ) = ( Base ` O ) )
8	1	opprex 14316	. . . . . 6 |- ( R e. V -> O e. _V )
9		eqid 2234	. . . . . . 7 |- ( Base ` O ) = ( Base ` O )
10	3, 9	opprbasg 14318	. . . . . 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 2267	. . . 4 |- ( R e. V -> ( Base ` R ) = ( Base ` (oppr ` O ) ) )
13		eqid 2234	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
14	1, 13	oppraddg 14319	. . . . . 6 |- ( R e. V -> ( +g ` R ) = ( +g ` O ) )
15		eqid 2234	. . . . . . . 8 |- ( +g ` O ) = ( +g ` O )
16	3, 15	oppraddg 14319	. . . . . . 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 2267	. . . . 5 |- ( R e. V -> ( +g ` R ) = ( +g ` (oppr ` O ) ) )
19	18	oveqdr 6086	. . . 4 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( +g ` R ) y ) = ( x ( +g ` (oppr ` O ) ) y ) )
20		vex 2818	. . . . . . . 8 |- x e. _V
21	20	a1i 9	. . . . . . 7 |- ( R e. V -> x e. _V )
22		vex 2818	. . . . . . . 8 |- y e. _V
23	22	a1i 9	. . . . . . 7 |- ( R e. V -> y e. _V )
24		eqid 2234	. . . . . . . 8 |- ( .r ` O ) = ( .r ` O )
25		eqid 2234	. . . . . . . 8 |- ( .r ` (oppr ` O ) ) = ( .r ` (oppr ` O ) )
26	9, 24, 3, 25	opprmulg 14314	. . . . . . 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 1274	. . . . . 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 533	. . . . . 6 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> y e. ( Base ` R ) )
31		simprl 531	. . . . . 6 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> x e. ( Base ` R ) )
32		eqid 2234	. . . . . . 7 |- ( .r ` R ) = ( .r ` R )
33	5, 32, 1, 24	opprmulg 14314	. . . . . 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 1274	. . . . 5 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( y ( .r ` O ) x ) = ( x ( .r ` R ) y ) )
35	28, 34	eqtr2d 2268	. . . 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 14194	. . 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 ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   _Vcvv 2815   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   .rcmulr 13375  Rngcrng 14171  opp_rcoppr 14310

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-tpos 6489  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-cmn 14039  df-abl 14040  df-mgp 14160  df-rng 14172  df-oppr 14311

This theorem is referenced by:  opprsubrngg  14457