Theorem opprsubgg 14392

Description: Being a subgroup is a symmetric property. (Contributed by Mario Carneiro, 6-Dec-2014.)

Hypothesis

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

Assertion

Ref	Expression
opprsubgg	|- ( R e. V -> (SubGrp ` R ) = (SubGrp ` O ) )

Proof of Theorem opprsubgg

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

Step	Hyp	Ref	Expression
1		eqidd 2239	. . . . 5 |- ( R e. V -> ( Base ` R ) = ( Base ` R ) )
2		opprbas.1	. . . . . 6 |- O = (oppr ` R )
3		eqid 2238	. . . . . 6 |- ( Base ` R ) = ( Base ` R )
4	2, 3	opprbasg 14382	. . . . 5 |- ( R e. V -> ( Base ` R ) = ( Base ` O ) )
5		eqid 2238	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
6	2, 5	oppraddg 14383	. . . . . 6 |- ( R e. V -> ( +g ` R ) = ( +g ` O ) )
7	6	oveqdr 6113	. . . . 5 |- ( ( R e. V /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( +g ` R ) y ) = ( x ( +g ` O ) y ) )
8	1, 4, 7	grppropd 13824	. . . 4 |- ( R e. V -> ( R e. Grp <-> O e. Grp ) )
9		eqidd 2239	. . . . 5 |- ( R e. V -> ( Base ` ( R ↾s x ) ) = ( Base ` ( R ↾s x ) ) )
10		eqidd 2239	. . . . . . 7 |- ( R e. V -> ( R ↾s x ) = ( R ↾s x ) )
11		id 19	. . . . . . 7 |- ( R e. V -> R e. V )
12		vex 2824	. . . . . . . 8 |- x e. _V
13	12	a1i 9	. . . . . . 7 |- ( R e. V -> x e. _V )
14	10, 1, 11, 13	ressbasd 13423	. . . . . 6 |- ( R e. V -> ( x i^i ( Base ` R ) ) = ( Base ` ( R ↾s x ) ) )
15		eqidd 2239	. . . . . . 7 |- ( R e. V -> ( O ↾s x ) = ( O ↾s x ) )
16	2	opprex 14380	. . . . . . 7 |- ( R e. V -> O e. _V )
17	15, 4, 16, 13	ressbasd 13423	. . . . . 6 |- ( R e. V -> ( x i^i ( Base ` R ) ) = ( Base ` ( O ↾s x ) ) )
18	14, 17	eqtr3d 2273	. . . . 5 |- ( R e. V -> ( Base ` ( R ↾s x ) ) = ( Base ` ( O ↾s x ) ) )
19		eqidd 2239	. . . . . . . 8 |- ( R e. V -> ( +g ` R ) = ( +g ` R ) )
20	10, 19, 13, 11	ressplusgd 13485	. . . . . . 7 |- ( R e. V -> ( +g ` R ) = ( +g ` ( R ↾s x ) ) )
21	15, 6, 13, 16	ressplusgd 13485	. . . . . . 7 |- ( R e. V -> ( +g ` R ) = ( +g ` ( O ↾s x ) ) )
22	20, 21	eqtr3d 2273	. . . . . 6 |- ( R e. V -> ( +g ` ( R ↾s x ) ) = ( +g ` ( O ↾s x ) ) )
23	22	oveqdr 6113	. . . . 5 |- ( ( R e. V /\ ( z e. ( Base ` ( R ↾s x ) ) /\ w e. ( Base ` ( R ↾s x ) ) ) ) -> ( z ( +g ` ( R ↾s x ) ) w ) = ( z ( +g ` ( O ↾s x ) ) w ) )
24	9, 18, 23	grppropd 13824	. . . 4 |- ( R e. V -> ( ( R ↾s x ) e. Grp <-> ( O ↾s x ) e. Grp ) )
25	8, 24	3anbi13d 1355	. . 3 |- ( R e. V -> ( ( R e. Grp /\ x C_ ( Base ` R ) /\ ( R ↾s x ) e. Grp ) <-> ( O e. Grp /\ x C_ ( Base ` R ) /\ ( O ↾s x ) e. Grp ) ) )
26	3	issubg 13978	. . . 4 |- ( x e. (SubGrp ` R ) <-> ( R e. Grp /\ x C_ ( Base ` R ) /\ ( R ↾s x ) e. Grp ) )
27	26	a1i 9	. . 3 |- ( R e. V -> ( x e. (SubGrp ` R ) <-> ( R e. Grp /\ x C_ ( Base ` R ) /\ ( R ↾s x ) e. Grp ) ) )
28		eqid 2238	. . . . 5 |- ( Base ` O ) = ( Base ` O )
29	28	issubg 13978	. . . 4 |- ( x e. (SubGrp ` O ) <-> ( O e. Grp /\ x C_ ( Base ` O ) /\ ( O ↾s x ) e. Grp ) )
30	4	sseq2d 3278	. . . . 5 |- ( R e. V -> ( x C_ ( Base ` R ) <-> x C_ ( Base ` O ) ) )
31	30	3anbi2d 1358	. . . 4 |- ( R e. V -> ( ( O e. Grp /\ x C_ ( Base ` R ) /\ ( O ↾s x ) e. Grp ) <-> ( O e. Grp /\ x C_ ( Base ` O ) /\ ( O ↾s x ) e. Grp ) ) )
32	29, 31	bitr4id 199	. . 3 |- ( R e. V -> ( x e. (SubGrp ` O ) <-> ( O e. Grp /\ x C_ ( Base ` R ) /\ ( O ↾s x ) e. Grp ) ) )
33	25, 27, 32	3bitr4d 220	. 2 |- ( R e. V -> ( x e. (SubGrp ` R ) <-> x e. (SubGrp ` O ) ) )
34	33	eqrdv 2236	1 |- ( R e. V -> (SubGrp ` R ) = (SubGrp ` O ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   i^i cin 3219   C_ wss 3220   ` cfv 5377  (class class class)co 6085   Basecbs 13354   ↾_s cress 13355   +g cplusg 13433   Grpcgrp 13807  SubGrpcsubg 13972  opp_rcoppr 14374

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 9306  df-2 9364  df-3 9365  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-iress 13362  df-plusg 13446  df-mulr 13447  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-subg 13975  df-oppr 14375

This theorem is used by:  opprsubrngg  14521  isridlrng  14821  isridl  14843