Theorem rnglidlmmgm 14575

Description: The multiplicative group of a (left) ideal of a non-unital ring is a magma. (Contributed by AV, 17-Feb-2020.) Generalization for non-unital rings. The assumption 0 ∈ 𝑈 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 𝑈)
rnglidlabl.z	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
rnglidlmmgm	⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝐼) ∈ Mgm)

Proof of Theorem rnglidlmmgm

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

Step	Hyp	Ref	Expression
1		simp1 1024	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑅 ∈ Rng)
2		rnglidlabl.l	. . . . . . . . 9 ⊢ 𝐿 = (LIdeal‘𝑅)
3		rnglidlabl.i	. . . . . . . . 9 ⊢ 𝐼 = (𝑅 ↾s 𝑈)
4	2, 3	lidlbas 14557	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (Base‘𝐼) = 𝑈)
5		eleq1a 2303	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → ((Base‘𝐼) = 𝑈 → (Base‘𝐼) ∈ 𝐿))
6	4, 5	mpd 13	. . . . . . 7 ⊢ (𝑈 ∈ 𝐿 → (Base‘𝐼) ∈ 𝐿)
7	6	3ad2ant2 1046	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (Base‘𝐼) ∈ 𝐿)
8	4	eqcomd 2237	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → 𝑈 = (Base‘𝐼))
9	8	eleq2d 2301	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → ( 0 ∈ 𝑈 ↔ 0 ∈ (Base‘𝐼)))
10	9	biimpa 296	. . . . . . 7 ⊢ ((𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 0 ∈ (Base‘𝐼))
11	10	3adant1 1042	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 0 ∈ (Base‘𝐼))
12	1, 7, 11	3jca 1204	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑅 ∈ Rng ∧ (Base‘𝐼) ∈ 𝐿 ∧ 0 ∈ (Base‘𝐼)))
13	2, 3	lidlssbas 14556	. . . . . . . . 9 ⊢ (𝑈 ∈ 𝐿 → (Base‘𝐼) ⊆ (Base‘𝑅))
14	13	sseld 3227	. . . . . . . 8 ⊢ (𝑈 ∈ 𝐿 → (𝑎 ∈ (Base‘𝐼) → 𝑎 ∈ (Base‘𝑅)))
15	14	3ad2ant2 1046	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑎 ∈ (Base‘𝐼) → 𝑎 ∈ (Base‘𝑅)))
16	15	anim1d 336	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝐼))))
17	16	imp 124	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼))) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝐼)))
18		rnglidlabl.z	. . . . . 6 ⊢ 0 = (0g‘𝑅)
19		eqid 2231	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
20		eqid 2231	. . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅)
21	18, 19, 20, 2	rnglidlmcl 14559	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ (Base‘𝐼) ∈ 𝐿 ∧ 0 ∈ (Base‘𝐼)) ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝐼))) → (𝑎(.r‘𝑅)𝑏) ∈ (Base‘𝐼))
22	12, 17, 21	syl2an2r 599	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼))) → (𝑎(.r‘𝑅)𝑏) ∈ (Base‘𝐼))
23		simp2 1025	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑈 ∈ 𝐿)
24	3, 20	ressmulrg 13291	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (.r‘𝑅) = (.r‘𝐼))
25	23, 1, 24	syl2anc 411	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝐼))
26	25	eqcomd 2237	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (.r‘𝐼) = (.r‘𝑅))
27	26	oveqd 6045	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑎(.r‘𝐼)𝑏) = (𝑎(.r‘𝑅)𝑏))
28	27	eleq1d 2300	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼) ↔ (𝑎(.r‘𝑅)𝑏) ∈ (Base‘𝐼)))
29	28	adantr 276	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼))) → ((𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼) ↔ (𝑎(.r‘𝑅)𝑏) ∈ (Base‘𝐼)))
30	22, 29	mpbird 167	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼))) → (𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼))
31	30	ralrimivva 2615	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)(𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼))
32		ressex 13211	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿) → (𝑅 ↾s 𝑈) ∈ V)
33	3, 32	eqeltrid 2318	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿) → 𝐼 ∈ V)
34	1, 23, 33	syl2anc 411	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝐼 ∈ V)
35		eqid 2231	. . . . 5 ⊢ (mulGrp‘𝐼) = (mulGrp‘𝐼)
36	35	mgpex 14002	. . . 4 ⊢ (𝐼 ∈ V → (mulGrp‘𝐼) ∈ V)
37		eqid 2231	. . . . 5 ⊢ (Base‘(mulGrp‘𝐼)) = (Base‘(mulGrp‘𝐼))
38		eqid 2231	. . . . 5 ⊢ (+g‘(mulGrp‘𝐼)) = (+g‘(mulGrp‘𝐼))
39	37, 38	ismgm 13503	. . . 4 ⊢ ((mulGrp‘𝐼) ∈ V → ((mulGrp‘𝐼) ∈ Mgm ↔ ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))(𝑎(+g‘(mulGrp‘𝐼))𝑏) ∈ (Base‘(mulGrp‘𝐼))))
40	34, 36, 39	3syl 17	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((mulGrp‘𝐼) ∈ Mgm ↔ ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))(𝑎(+g‘(mulGrp‘𝐼))𝑏) ∈ (Base‘(mulGrp‘𝐼))))
41		eqid 2231	. . . . . 6 ⊢ (Base‘𝐼) = (Base‘𝐼)
42	35, 41	mgpbasg 14003	. . . . 5 ⊢ (𝐼 ∈ V → (Base‘𝐼) = (Base‘(mulGrp‘𝐼)))
43	34, 42	syl 14	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (Base‘𝐼) = (Base‘(mulGrp‘𝐼)))
44		eqid 2231	. . . . . . . . 9 ⊢ (.r‘𝐼) = (.r‘𝐼)
45	35, 44	mgpplusgg 14001	. . . . . . . 8 ⊢ (𝐼 ∈ V → (.r‘𝐼) = (+g‘(mulGrp‘𝐼)))
46	34, 45	syl 14	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (.r‘𝐼) = (+g‘(mulGrp‘𝐼)))
47	46	oveqd 6045	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑎(.r‘𝐼)𝑏) = (𝑎(+g‘(mulGrp‘𝐼))𝑏))
48	47, 43	eleq12d 2302	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼) ↔ (𝑎(+g‘(mulGrp‘𝐼))𝑏) ∈ (Base‘(mulGrp‘𝐼))))
49	43, 48	raleqbidv 2747	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (∀𝑏 ∈ (Base‘𝐼)(𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼) ↔ ∀𝑏 ∈ (Base‘(mulGrp‘𝐼))(𝑎(+g‘(mulGrp‘𝐼))𝑏) ∈ (Base‘(mulGrp‘𝐼))))
50	43, 49	raleqbidv 2747	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)(𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼) ↔ ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))(𝑎(+g‘(mulGrp‘𝐼))𝑏) ∈ (Base‘(mulGrp‘𝐼))))
51	40, 50	bitr4d 191	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((mulGrp‘𝐼) ∈ Mgm ↔ ∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)(𝑎(.r‘𝐼)𝑏) ∈ (Base‘𝐼)))
52	31, 51	mpbird 167	1 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝐼) ∈ Mgm)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1005   = wceq 1398   ∈ wcel 2202  ∀wral 2511  Vcvv 2803  ‘cfv 5333  (class class class)co 6028  Basecbs 13145   ↾_s cress 13146  +_gcplusg 13223  ._rcmulr 13224  0_gc0g 13402  Mgmcmgm 13500  mulGrpcmgp 13997  Rngcrng 14009  LIdealclidl 14546

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-in1 619  ax-in2 620  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-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  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-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-sca 13239  df-vsca 13240  df-ip 13241  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-abl 13937  df-mgp 13998  df-rng 14010  df-lssm 14432  df-sra 14514  df-rgmod 14515  df-lidl 14548

This theorem is referenced by:  rnglidlmsgrp  14576