Theorem subrngringnsg 20721

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 20720	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2		subrngrcl 20719	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
3		rngabl 20296	. . . . . . . . 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 2762	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅)
8		eqid 2762	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
9	7, 8	ablcom 19932	. . . . . 6 ⊢ ((𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥))
10	6, 9	syl 18	. . . . 5 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥))
11	10	eleq1d 2847	. . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 ↔ (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
12	11	biimpd 232	. . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
13	12	ralrimivva 3207	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))
14	7, 8	isnsg2 19285	. 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 1570   ∈ wcel 2145  ∀wral 3078  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  +_gcplusg 17348  SubGrpcsubg 19249  NrmSGrpcnsg 19250  Abelcabl 19914  Rngcrng 20293  SubRngcsubrng 20713

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-subg 19252  df-nsg 19253  df-cmn 19915  df-abl 19916  df-rng 20294  df-subrng 20714

This theorem is used by:  rng2idlnsg  21474  rng2idlsubgnsg  21477