Theorem rnglidlrng 21214

Description: A (left) ideal of a non-unital ring is a non-unital ring. (Contributed by AV, 17-Feb-2020.) Generalization for non-unital rings. The assumption 𝑈 ∈ (SubGrp‘𝑅) is required because a left ideal of a non-unital ring does not have to be a subgroup. (Revised by AV, 11-Mar-2025.)

Hypotheses

Ref	Expression
rnglidlabl.l	⊢ 𝐿 = (LIdeal‘𝑅)
rnglidlabl.i	⊢ 𝐼 = (𝑅 ↾s 𝑈)

Assertion

Ref	Expression
rnglidlrng	⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ Rng)

Proof of Theorem rnglidlrng

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngabl 20102	. . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
2	1	3ad2ant1 1134	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel)
3		simp3 1139	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝑈 ∈ (SubGrp‘𝑅))
4		rnglidlabl.i	. . . 4 ⊢ 𝐼 = (𝑅 ↾s 𝑈)
5	4	subgabl 19777	. . 3 ⊢ ((𝑅 ∈ Abel ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ Abel)
6	2, 3, 5	syl2anc 585	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ Abel)
7		eqid 2737	. . . 4 ⊢ (0g‘𝑅) = (0g‘𝑅)
8	7	subg0cl 19076	. . 3 ⊢ (𝑈 ∈ (SubGrp‘𝑅) → (0g‘𝑅) ∈ 𝑈)
9		rnglidlabl.l	. . . 4 ⊢ 𝐿 = (LIdeal‘𝑅)
10	9, 4, 7	rnglidlmsgrp 21213	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ (0g‘𝑅) ∈ 𝑈) → (mulGrp‘𝐼) ∈ Smgrp)
11	8, 10	syl3an3 1166	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → (mulGrp‘𝐼) ∈ Smgrp)
12		simpl1 1193	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑅 ∈ Rng)
13	9, 4	lidlssbas 21180	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (Base‘𝐼) ⊆ (Base‘𝑅))
14	13	sseld 3934	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (𝑎 ∈ (Base‘𝐼) → 𝑎 ∈ (Base‘𝑅)))
15	13	sseld 3934	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (𝑏 ∈ (Base‘𝐼) → 𝑏 ∈ (Base‘𝑅)))
16	13	sseld 3934	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (𝑐 ∈ (Base‘𝐼) → 𝑐 ∈ (Base‘𝑅)))
17	14, 15, 16	3anim123d 1446	. . . . . . 7 ⊢ (𝑈 ∈ 𝐿 → ((𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))))
18	17	3ad2ant2 1135	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → ((𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))))
19	18	imp 406	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅)))
20		eqid 2737	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
21		eqid 2737	. . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅)
22		eqid 2737	. . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅)
23	20, 21, 22	rngdi 20107	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))) → (𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)))
24	12, 19, 23	syl2anc 585	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)))
25	20, 21, 22	rngdir 20108	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))) → ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))
26	12, 19, 25	syl2anc 585	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))
27	4, 22	ressmulr 17239	. . . . . . . . . 10 ⊢ (𝑈 ∈ 𝐿 → (.r‘𝑅) = (.r‘𝐼))
28	27	eqcomd 2743	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (.r‘𝐼) = (.r‘𝑅))
29		eqidd 2738	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → 𝑎 = 𝑎)
30	4, 21	ressplusg 17223	. . . . . . . . . . 11 ⊢ (𝑈 ∈ 𝐿 → (+g‘𝑅) = (+g‘𝐼))
31	30	eqcomd 2743	. . . . . . . . . 10 ⊢ (𝑈 ∈ 𝐿 → (+g‘𝐼) = (+g‘𝑅))
32	31	oveqd 7385	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (𝑏(+g‘𝐼)𝑐) = (𝑏(+g‘𝑅)𝑐))
33	28, 29, 32	oveq123d 7389	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = (𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)))
34	28	oveqd 7385	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (𝑎(.r‘𝐼)𝑏) = (𝑎(.r‘𝑅)𝑏))
35	28	oveqd 7385	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (𝑎(.r‘𝐼)𝑐) = (𝑎(.r‘𝑅)𝑐))
36	31, 34, 35	oveq123d 7389	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)))
37	33, 36	eqeq12d 2753	. . . . . . 7 ⊢ (𝑈 ∈ 𝐿 → ((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ↔ (𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐))))
38	31	oveqd 7385	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (𝑎(+g‘𝐼)𝑏) = (𝑎(+g‘𝑅)𝑏))
39		eqidd 2738	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → 𝑐 = 𝑐)
40	28, 38, 39	oveq123d 7389	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐))
41	28	oveqd 7385	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (𝑏(.r‘𝐼)𝑐) = (𝑏(.r‘𝑅)𝑐))
42	31, 35, 41	oveq123d 7389	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐)) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))
43	40, 42	eqeq12d 2753	. . . . . . 7 ⊢ (𝑈 ∈ 𝐿 → (((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐))))
44	37, 43	anbi12d 633	. . . . . 6 ⊢ (𝑈 ∈ 𝐿 → (((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐))) ↔ ((𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)) ∧ ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))))
45	44	3ad2ant2 1135	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → (((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐))) ↔ ((𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)) ∧ ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))))
46	45	adantr 480	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐))) ↔ ((𝑎(.r‘𝑅)(𝑏(+g‘𝑅)𝑐)) = ((𝑎(.r‘𝑅)𝑏)(+g‘𝑅)(𝑎(.r‘𝑅)𝑐)) ∧ ((𝑎(+g‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(.r‘𝑅)𝑐)(+g‘𝑅)(𝑏(.r‘𝑅)𝑐)))))
47	24, 26, 46	mpbir2and 714	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐))))
48	47	ralrimivvva 3184	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → ∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐))))
49		eqid 2737	. . 3 ⊢ (Base‘𝐼) = (Base‘𝐼)
50		eqid 2737	. . 3 ⊢ (mulGrp‘𝐼) = (mulGrp‘𝐼)
51		eqid 2737	. . 3 ⊢ (+g‘𝐼) = (+g‘𝐼)
52		eqid 2737	. . 3 ⊢ (.r‘𝐼) = (.r‘𝐼)
53	49, 50, 51, 52	isrng 20101	. 2 ⊢ (𝐼 ∈ Rng ↔ (𝐼 ∈ Abel ∧ (mulGrp‘𝐼) ∈ Smgrp ∧ ∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)(𝑏(+g‘𝐼)𝑐)) = ((𝑎(.r‘𝐼)𝑏)(+g‘𝐼)(𝑎(.r‘𝐼)𝑐)) ∧ ((𝑎(+g‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝐼)𝑐)(+g‘𝐼)(𝑏(.r‘𝐼)𝑐)))))
54	6, 11, 48, 53	syl3anbrc 1345	1 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 𝑈 ∈ (SubGrp‘𝑅)) → 𝐼 ∈ Rng)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ‘cfv 6500  (class class class)co 7368  Basecbs 17148   ↾_s cress 17169  +_gcplusg 17189  ._rcmulr 17190  0_gc0g 17371  Smgrpcsgrp 18655  SubGrpcsubg 19062  Abelcabl 19722  mulGrpcmgp 20087  Rngcrng 20099  LIdealclidl 21173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-3 12221  df-4 12222  df-5 12223  df-6 12224  df-7 12225  df-8 12226  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-mulr 17203  df-sca 17205  df-vsca 17206  df-ip 17207  df-0g 17373  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-grp 18878  df-subg 19065  df-cmn 19723  df-abl 19724  df-mgp 20088  df-rng 20100  df-lss 20895  df-sra 21137  df-rgmod 21138  df-lidl 21175

This theorem is referenced by:  rng2idlsubgsubrng  21235  lidlrng  48590