Theorem subrngringnsg 14283

Description: A subring is a normal subgroup. (Contributed by AV, 25-Feb-2025.)

Assertion

Ref	Expression
subrngringnsg	|- ( A e. (SubRng ` R ) -> A e. (NrmSGrp ` R ) )

Proof of Theorem subrngringnsg

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

Step	Hyp	Ref	Expression
1		subrngsubg 14282	. 2 |- ( A e. (SubRng ` R ) -> A e. (SubGrp ` R ) )
2		subrngrcl 14281	. . . . . . . . 9 |- ( A e. (SubRng ` R ) -> R e. Rng )
3		rngabl 14012	. . . . . . . . 9 |- ( R e. Rng -> R e. Abel )
4	2, 3	syl 14	. . . . . . . 8 |- ( A e. (SubRng ` R ) -> R e. Abel )
5	4	3anim1i 1212	. . . . . . 7 |- ( ( A e. (SubRng ` R ) /\ x e. ( Base ` R ) /\ y e. ( Base ` R ) ) -> ( R e. Abel /\ x e. ( Base ` R ) /\ y e. ( Base ` R ) ) )
6	5	3expb 1231	. . . . . 6 |- ( ( A e. (SubRng ` R ) /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( R e. Abel /\ x e. ( Base ` R ) /\ y e. ( Base ` R ) ) )
7		eqid 2231	. . . . . . 7 |- ( Base ` R ) = ( Base ` R )
8		eqid 2231	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
9	7, 8	ablcom 13953	. . . . . 6 |- ( ( R e. Abel /\ x e. ( Base ` R ) /\ y e. ( Base ` R ) ) -> ( x ( +g ` R ) y ) = ( y ( +g ` R ) x ) )
10	6, 9	syl 14	. . . . 5 |- ( ( A e. (SubRng ` R ) /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( x ( +g ` R ) y ) = ( y ( +g ` R ) x ) )
11	10	eleq1d 2300	. . . 4 |- ( ( A e. (SubRng ` R ) /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( ( x ( +g ` R ) y ) e. A <-> ( y ( +g ` R ) x ) e. A ) )
12	11	biimpd 144	. . 3 |- ( ( A e. (SubRng ` R ) /\ ( x e. ( Base ` R ) /\ y e. ( Base ` R ) ) ) -> ( ( x ( +g ` R ) y ) e. A -> ( y ( +g ` R ) x ) e. A ) )
13	12	ralrimivva 2615	. 2 |- ( A e. (SubRng ` R ) -> A. x e. ( Base ` R ) A. y e. ( Base ` R ) ( ( x ( +g ` R ) y ) e. A -> ( y ( +g ` R ) x ) e. A ) )
14	7, 8	isnsg2 13853	. 2 |- ( A e. (NrmSGrp ` R ) <-> ( A e. (SubGrp ` R ) /\ A. x e. ( Base ` R ) A. y e. ( Base ` R ) ( ( x ( +g ` R ) y ) e. A -> ( y ( +g ` R ) x ) e. A ) ) )
15	1, 13, 14	sylanbrc 417	1 |- ( A e. (SubRng ` R ) -> A e. (NrmSGrp ` R ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2202   A.wral 2511   ` cfv 5333  (class class class)co 6028   Basecbs 13145   +g cplusg 13223  SubGrpcsubg 13817  NrmSGrpcnsg 13818   Abelcabl 13935  Rngcrng 14009  SubRngcsubrng 14275

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-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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mulr 13237  df-subg 13820  df-nsg 13821  df-cmn 13936  df-abl 13937  df-rng 14010  df-subrng 14276

This theorem is referenced by:  rng2idlnsg  14597  rng2idlsubgnsg  14600