Theorem rnglidlmsgrp 14426

Description: The multiplicative group of a (left) ideal of a non-unital ring is a semigroup. (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
rnglidlmsgrp	⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝐼) ∈ Smgrp)

Proof of Theorem rnglidlmsgrp

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

Step	Hyp	Ref	Expression
1		rnglidlabl.l	. . 3 ⊢ 𝐿 = (LIdeal‘𝑅)
2		rnglidlabl.i	. . 3 ⊢ 𝐼 = (𝑅 ↾s 𝑈)
3		rnglidlabl.z	. . 3 ⊢ 0 = (0g‘𝑅)
4	1, 2, 3	rnglidlmmgm 14425	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝐼) ∈ Mgm)
5		eqid 2209	. . . . . . . . . 10 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
6	5	rngmgp 13865	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Smgrp)
7	6	3ad2ant1 1023	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝑅) ∈ Smgrp)
8	7	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (mulGrp‘𝑅) ∈ Smgrp)
9	1, 2	lidlssbas 14406	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ 𝐿 → (Base‘𝐼) ⊆ (Base‘𝑅))
10	9	sseld 3203	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ 𝐿 → (𝑎 ∈ (Base‘𝐼) → 𝑎 ∈ (Base‘𝑅)))
11	9	sseld 3203	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ 𝐿 → (𝑏 ∈ (Base‘𝐼) → 𝑏 ∈ (Base‘𝑅)))
12	9	sseld 3203	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ 𝐿 → (𝑐 ∈ (Base‘𝐼) → 𝑐 ∈ (Base‘𝑅)))
13	10, 11, 12	3anim123d 1334	. . . . . . . . . . 11 ⊢ (𝑈 ∈ 𝐿 → ((𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))))
14	13	3ad2ant2 1024	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅))))
15	14	imp 124	. . . . . . . . 9 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑐 ∈ (Base‘𝑅)))
16	15	simp1d 1014	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑎 ∈ (Base‘𝑅))
17		eqid 2209	. . . . . . . . . . 11 ⊢ (Base‘𝑅) = (Base‘𝑅)
18	5, 17	mgpbasg 13855	. . . . . . . . . 10 ⊢ (𝑅 ∈ Rng → (Base‘𝑅) = (Base‘(mulGrp‘𝑅)))
19	18	3ad2ant1 1023	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (Base‘𝑅) = (Base‘(mulGrp‘𝑅)))
20	19	adantr 276	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (Base‘𝑅) = (Base‘(mulGrp‘𝑅)))
21	16, 20	eleqtrd 2288	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑎 ∈ (Base‘(mulGrp‘𝑅)))
22	15	simp2d 1015	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑏 ∈ (Base‘𝑅))
23	22, 20	eleqtrd 2288	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑏 ∈ (Base‘(mulGrp‘𝑅)))
24	15	simp3d 1016	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑐 ∈ (Base‘𝑅))
25	24, 20	eleqtrd 2288	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑐 ∈ (Base‘(mulGrp‘𝑅)))
26		eqid 2209	. . . . . . . 8 ⊢ (Base‘(mulGrp‘𝑅)) = (Base‘(mulGrp‘𝑅))
27		eqid 2209	. . . . . . . 8 ⊢ (+g‘(mulGrp‘𝑅)) = (+g‘(mulGrp‘𝑅))
28	26, 27	sgrpass 13407	. . . . . . 7 ⊢ (((mulGrp‘𝑅) ∈ Smgrp ∧ (𝑎 ∈ (Base‘(mulGrp‘𝑅)) ∧ 𝑏 ∈ (Base‘(mulGrp‘𝑅)) ∧ 𝑐 ∈ (Base‘(mulGrp‘𝑅)))) → ((𝑎(+g‘(mulGrp‘𝑅))𝑏)(+g‘(mulGrp‘𝑅))𝑐) = (𝑎(+g‘(mulGrp‘𝑅))(𝑏(+g‘(mulGrp‘𝑅))𝑐)))
29	8, 21, 23, 25, 28	syl13anc 1254	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(+g‘(mulGrp‘𝑅))𝑏)(+g‘(mulGrp‘𝑅))𝑐) = (𝑎(+g‘(mulGrp‘𝑅))(𝑏(+g‘(mulGrp‘𝑅))𝑐)))
30		eqid 2209	. . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅)
31	5, 30	mgpplusgg 13853	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (.r‘𝑅) = (+g‘(mulGrp‘𝑅)))
32	31	3ad2ant1 1023	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (.r‘𝑅) = (+g‘(mulGrp‘𝑅)))
33	32	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (.r‘𝑅) = (+g‘(mulGrp‘𝑅)))
34	33	oveqd 5991	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑎(.r‘𝑅)𝑏) = (𝑎(+g‘(mulGrp‘𝑅))𝑏))
35		eqidd 2210	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑐 = 𝑐)
36	33, 34, 35	oveq123d 5995	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐) = ((𝑎(+g‘(mulGrp‘𝑅))𝑏)(+g‘(mulGrp‘𝑅))𝑐))
37		eqidd 2210	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → 𝑎 = 𝑎)
38	33	oveqd 5991	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑏(.r‘𝑅)𝑐) = (𝑏(+g‘(mulGrp‘𝑅))𝑐))
39	33, 37, 38	oveq123d 5995	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐)) = (𝑎(+g‘(mulGrp‘𝑅))(𝑏(+g‘(mulGrp‘𝑅))𝑐)))
40	29, 36, 39	3eqtr4d 2252	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐) = (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐)))
41		simp2 1003	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑈 ∈ 𝐿)
42		simp1 1002	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑅 ∈ Rng)
43	2, 30	ressmulrg 13144	. . . . . . . . . 10 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (.r‘𝑅) = (.r‘𝐼))
44	43	eqcomd 2215	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (.r‘𝐼) = (.r‘𝑅))
45	44	oveqd 5991	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (𝑎(.r‘𝐼)𝑏) = (𝑎(.r‘𝑅)𝑏))
46		eqidd 2210	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → 𝑐 = 𝑐)
47	44, 45, 46	oveq123d 5995	. . . . . . . 8 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → ((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐))
48		eqidd 2210	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → 𝑎 = 𝑎)
49	44	oveqd 5991	. . . . . . . . 9 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (𝑏(.r‘𝐼)𝑐) = (𝑏(.r‘𝑅)𝑐))
50	44, 48, 49	oveq123d 5995	. . . . . . . 8 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) = (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐)))
51	47, 50	eqeq12d 2224	. . . . . . 7 ⊢ ((𝑈 ∈ 𝐿 ∧ 𝑅 ∈ Rng) → (((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐) = (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐))))
52	41, 42, 51	syl2anc 411	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐) = (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐))))
53	52	adantr 276	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → (((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ((𝑎(.r‘𝑅)𝑏)(.r‘𝑅)𝑐) = (𝑎(.r‘𝑅)(𝑏(.r‘𝑅)𝑐))))
54	40, 53	mpbird 167	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) ∧ (𝑎 ∈ (Base‘𝐼) ∧ 𝑏 ∈ (Base‘𝐼) ∧ 𝑐 ∈ (Base‘𝐼))) → ((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)))
55	54	ralrimivvva 2593	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)))
56		ressex 13064	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿) → (𝑅 ↾s 𝑈) ∈ V)
57	42, 41, 56	syl2anc 411	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑅 ↾s 𝑈) ∈ V)
58	2, 57	eqeltrid 2296	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝐼 ∈ V)
59		eqid 2209	. . . . . 6 ⊢ (mulGrp‘𝐼) = (mulGrp‘𝐼)
60		eqid 2209	. . . . . 6 ⊢ (Base‘𝐼) = (Base‘𝐼)
61	59, 60	mgpbasg 13855	. . . . 5 ⊢ (𝐼 ∈ V → (Base‘𝐼) = (Base‘(mulGrp‘𝐼)))
62	58, 61	syl 14	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (Base‘𝐼) = (Base‘(mulGrp‘𝐼)))
63		eqid 2209	. . . . . . . . . 10 ⊢ (.r‘𝐼) = (.r‘𝐼)
64	59, 63	mgpplusgg 13853	. . . . . . . . 9 ⊢ (𝐼 ∈ V → (.r‘𝐼) = (+g‘(mulGrp‘𝐼)))
65	58, 64	syl 14	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (.r‘𝐼) = (+g‘(mulGrp‘𝐼)))
66	65	oveqd 5991	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑎(.r‘𝐼)𝑏) = (𝑎(+g‘(mulGrp‘𝐼))𝑏))
67		eqidd 2210	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑐 = 𝑐)
68	65, 66, 67	oveq123d 5995	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = ((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐))
69		eqidd 2210	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → 𝑎 = 𝑎)
70	65	oveqd 5991	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑏(.r‘𝐼)𝑐) = (𝑏(+g‘(mulGrp‘𝐼))𝑐))
71	65, 69, 70	oveq123d 5995	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐)))
72	68, 71	eqeq12d 2224	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐))))
73	62, 72	raleqbidv 2724	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ∀𝑐 ∈ (Base‘(mulGrp‘𝐼))((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐))))
74	62, 73	raleqbidv 2724	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (∀𝑏 ∈ (Base‘𝐼)∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ∀𝑏 ∈ (Base‘(mulGrp‘𝐼))∀𝑐 ∈ (Base‘(mulGrp‘𝐼))((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐))))
75	62, 74	raleqbidv 2724	. . 3 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (∀𝑎 ∈ (Base‘𝐼)∀𝑏 ∈ (Base‘𝐼)∀𝑐 ∈ (Base‘𝐼)((𝑎(.r‘𝐼)𝑏)(.r‘𝐼)𝑐) = (𝑎(.r‘𝐼)(𝑏(.r‘𝐼)𝑐)) ↔ ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))∀𝑐 ∈ (Base‘(mulGrp‘𝐼))((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐))))
76	55, 75	mpbid 147	. 2 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))∀𝑐 ∈ (Base‘(mulGrp‘𝐼))((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐)))
77		eqid 2209	. . 3 ⊢ (Base‘(mulGrp‘𝐼)) = (Base‘(mulGrp‘𝐼))
78		eqid 2209	. . 3 ⊢ (+g‘(mulGrp‘𝐼)) = (+g‘(mulGrp‘𝐼))
79	77, 78	issgrp 13402	. 2 ⊢ ((mulGrp‘𝐼) ∈ Smgrp ↔ ((mulGrp‘𝐼) ∈ Mgm ∧ ∀𝑎 ∈ (Base‘(mulGrp‘𝐼))∀𝑏 ∈ (Base‘(mulGrp‘𝐼))∀𝑐 ∈ (Base‘(mulGrp‘𝐼))((𝑎(+g‘(mulGrp‘𝐼))𝑏)(+g‘(mulGrp‘𝐼))𝑐) = (𝑎(+g‘(mulGrp‘𝐼))(𝑏(+g‘(mulGrp‘𝐼))𝑐))))
80	4, 76, 79	sylanbrc 417	1 ⊢ ((𝑅 ∈ Rng ∧ 𝑈 ∈ 𝐿 ∧ 0 ∈ 𝑈) → (mulGrp‘𝐼) ∈ Smgrp)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 983   = wceq 1375   ∈ wcel 2180  ∀wral 2488  Vcvv 2779  ‘cfv 5294  (class class class)co 5974  Basecbs 12998   ↾_s cress 12999  +_gcplusg 13076  ._rcmulr 13077  0_gc0g 13255  Mgmcmgm 13353  Smgrpcsgrp 13400  mulGrpcmgp 13849  Rngcrng 13861  LIdealclidl 14396

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 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-cnex 8058  ax-resscn 8059  ax-1cn 8060  ax-1re 8061  ax-icn 8062  ax-addcl 8063  ax-addrcl 8064  ax-mulcl 8065  ax-addcom 8067  ax-addass 8069  ax-i2m1 8072  ax-0lt1 8073  ax-0id 8075  ax-rnegex 8076  ax-pre-ltirr 8079  ax-pre-lttrn 8081  ax-pre-ltadd 8083

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-nel 2476  df-ral 2493  df-rex 2494  df-reu 2495  df-rmo 2496  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-riota 5927  df-ov 5977  df-oprab 5978  df-mpo 5979  df-pnf 8151  df-mnf 8152  df-ltxr 8154  df-inn 9079  df-2 9137  df-3 9138  df-4 9139  df-5 9140  df-6 9141  df-7 9142  df-8 9143  df-ndx 13001  df-slot 13002  df-base 13004  df-sets 13005  df-iress 13006  df-plusg 13089  df-mulr 13090  df-sca 13092  df-vsca 13093  df-ip 13094  df-0g 13257  df-mgm 13355  df-sgrp 13401  df-mnd 13416  df-grp 13502  df-abl 13790  df-mgp 13850  df-rng 13862  df-lssm 14282  df-sra 14364  df-rgmod 14365  df-lidl 14398

This theorem is referenced by:  rnglidlrng  14427