Theorem subrngringnsg 14367

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 14366	. 2 |- ( A e. (SubRng ` R ) -> A e. (SubGrp ` R ) )
2		subrngrcl 14365	. . . . . . . . 9 |- ( A e. (SubRng ` R ) -> R e. Rng )
3		rngabl 14096	. . . . . . . . 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 2234	. . . . . . 7 |- ( Base ` R ) = ( Base ` R )
8		eqid 2234	. . . . . . 7 |- ( +g ` R ) = ( +g ` R )
9	7, 8	ablcom 14037	. . . . . 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 2303	. . . 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 2626	. 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 13937	. 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 2205   A.wral 2522   ` cfv 5354  (class class class)co 6052   Basecbs 13229   +g cplusg 13307  SubGrpcsubg 13901  NrmSGrpcnsg 13902   Abelcabl 14019  Rngcrng 14093  SubRngcsubrng 14359

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-cnex 8220  ax-resscn 8221  ax-1re 8223  ax-addrcl 8226

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-fv 5362  df-ov 6055  df-inn 9240  df-2 9298  df-3 9299  df-ndx 13232  df-slot 13233  df-base 13235  df-plusg 13320  df-mulr 13321  df-subg 13904  df-nsg 13905  df-cmn 14020  df-abl 14021  df-rng 14094  df-subrng 14360

This theorem is referenced by:  rng2idlnsg  14683  rng2idlsubgnsg  14686