Theorem opprsubrngg 14519

Description: Being a subring is a symmetric property. (Contributed by AV, 15-Feb-2025.)

Hypothesis

Ref	Expression
opprsubrng.o	|- O = (oppr ` R )

Assertion

Ref	Expression
opprsubrngg	|- ( R e. V -> (SubRng ` R ) = (SubRng ` O ) )

Proof of Theorem opprsubrngg

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

Step	Hyp	Ref	Expression
1		subrngrcl 14511	. . . 4 |- ( x e. (SubRng ` R ) -> R e. Rng )
2	1	a1i 9	. . 3 |- ( R e. V -> ( x e. (SubRng ` R ) -> R e. Rng ) )
3		subrngrcl 14511	. . . 4 |- ( x e. (SubRng ` O ) -> O e. Rng )
4		opprsubrng.o	. . . . 5 |- O = (oppr ` R )
5	4	opprrngbg 14383	. . . 4 |- ( R e. V -> ( R e. Rng <-> O e. Rng ) )
6	3, 5	imbitrrid 156	. . 3 |- ( R e. V -> ( x e. (SubRng ` O ) -> R e. Rng ) )
7	4	opprsubgg 14390	. . . . . . 7 |- ( R e. Rng -> (SubGrp ` R ) = (SubGrp ` O ) )
8	7	eleq2d 2308	. . . . . 6 |- ( R e. Rng -> ( x e. (SubGrp ` R ) <-> x e. (SubGrp ` O ) ) )
9		ralcom 2714	. . . . . . 7 |- ( A. z e. x A. y e. x ( z ( .r ` R ) y ) e. x <-> A. y e. x A. z e. x ( z ( .r ` R ) y ) e. x )
10		vex 2824	. . . . . . . . . 10 |- y e. _V
11		vex 2824	. . . . . . . . . 10 |- z e. _V
12		eqid 2238	. . . . . . . . . . 11 |- ( Base ` R ) = ( Base ` R )
13		eqid 2238	. . . . . . . . . . 11 |- ( .r ` R ) = ( .r ` R )
14		eqid 2238	. . . . . . . . . . 11 |- ( .r ` O ) = ( .r ` O )
15	12, 13, 4, 14	opprmulg 14376	. . . . . . . . . 10 |- ( ( R e. Rng /\ y e. _V /\ z e. _V ) -> ( y ( .r ` O ) z ) = ( z ( .r ` R ) y ) )
16	10, 11, 15	mp3an23 1370	. . . . . . . . 9 |- ( R e. Rng -> ( y ( .r ` O ) z ) = ( z ( .r ` R ) y ) )
17	16	eleq1d 2307	. . . . . . . 8 |- ( R e. Rng -> ( ( y ( .r ` O ) z ) e. x <-> ( z ( .r ` R ) y ) e. x ) )
18	17	2ralbidv 2574	. . . . . . 7 |- ( R e. Rng -> ( A. y e. x A. z e. x ( y ( .r ` O ) z ) e. x <-> A. y e. x A. z e. x ( z ( .r ` R ) y ) e. x ) )
19	9, 18	bitr4id 199	. . . . . 6 |- ( R e. Rng -> ( A. z e. x A. y e. x ( z ( .r ` R ) y ) e. x <-> A. y e. x A. z e. x ( y ( .r ` O ) z ) e. x ) )
20	8, 19	anbi12d 477	. . . . 5 |- ( R e. Rng -> ( ( x e. (SubGrp ` R ) /\ A. z e. x A. y e. x ( z ( .r ` R ) y ) e. x ) <-> ( x e. (SubGrp ` O ) /\ A. y e. x A. z e. x ( y ( .r ` O ) z ) e. x ) ) )
21	12, 13	issubrng2 14518	. . . . 5 |- ( R e. Rng -> ( x e. (SubRng ` R ) <-> ( x e. (SubGrp ` R ) /\ A. z e. x A. y e. x ( z ( .r ` R ) y ) e. x ) ) )
22	4	opprrng 14382	. . . . . 6 |- ( R e. Rng -> O e. Rng )
23		eqid 2238	. . . . . . 7 |- ( Base ` O ) = ( Base ` O )
24	23, 14	issubrng2 14518	. . . . . 6 |- ( O e. Rng -> ( x e. (SubRng ` O ) <-> ( x e. (SubGrp ` O ) /\ A. y e. x A. z e. x ( y ( .r ` O ) z ) e. x ) ) )
25	22, 24	syl 14	. . . . 5 |- ( R e. Rng -> ( x e. (SubRng ` O ) <-> ( x e. (SubGrp ` O ) /\ A. y e. x A. z e. x ( y ( .r ` O ) z ) e. x ) ) )
26	20, 21, 25	3bitr4d 220	. . . 4 |- ( R e. Rng -> ( x e. (SubRng ` R ) <-> x e. (SubRng ` O ) ) )
27	26	a1i 9	. . 3 |- ( R e. V -> ( R e. Rng -> ( x e. (SubRng ` R ) <-> x e. (SubRng ` O ) ) ) )
28	2, 6, 27	pm5.21ndd 717	. 2 |- ( R e. V -> ( x e. (SubRng ` R ) <-> x e. (SubRng ` O ) ) )
29	28	eqrdv 2236	1 |- ( R e. V -> (SubRng ` R ) = (SubRng ` O ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   ` cfv 5377  (class class class)co 6085   Basecbs 13352   .rcmulr 13432  SubGrpcsubg 13970  Rngcrng 14231  opp_rcoppr 14372  SubRngcsubrng 14505

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-iress 13360  df-plusg 13444  df-mulr 13445  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-subg 13973  df-cmn 14089  df-abl 14090  df-mgp 14218  df-rng 14232  df-oppr 14373  df-subrng 14506

This theorem is used by: (None)