Theorem subrngringnsg 20811

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

Assertion

Ref	Expression
subrngringnsg	⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (NrmSGrp‘𝑅))

Proof of Theorem subrngringnsg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrngsubg 20810	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2		subrngrcl 20809	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
3		rngabl 20383	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
4	2, 3	syl 18	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Abel)
5	4	3anim1i 1170	. . . . . . 7 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)))
6	5	3expb 1138	. . . . . 6 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)))
7		eqid 2760	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅)
8		eqid 2760	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
9	7, 8	ablcom 20019	. . . . . 6 ⊢ ((𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥))
10	6, 9	syl 18	. . . . 5 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥))
11	10	eleq1d 2845	. . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 ↔ (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
12	11	biimpd 232	. . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
13	12	ralrimivva 3205	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
14	7, 8	isnsg2 19372	. 2 ⊢ (𝐴 ∈ (NrmSGrp‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴)))
15	1, 13, 14	sylanbrc 595	1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (NrmSGrp‘𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  +_gcplusg 17434  SubGrpcsubg 19336  NrmSGrpcnsg 19337  Abelcabl 20001  Rngcrng 20380  SubRngcsubrng 20803

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-subg 19339  df-nsg 19340  df-cmn 20002  df-abl 20003  df-rng 20381  df-subrng 20804

This theorem is used by:  rng2idlnsg  21566  rng2idlsubgnsg  21569