Theorem 2idlcpblrng 14019

Description: The coset equivalence relation for a two-sided ideal is compatible with ring multiplication. (Contributed by Mario Carneiro, 14-Jun-2015.) Generalization for non-unital rings and two-sided ideals which are subgroups of the additive group of the non-unital ring. (Revised by AV, 23-Feb-2025.)

Hypotheses

Ref	Expression
2idlcpblrng.x	⊢ 𝑋 = (Base‘𝑅)
2idlcpblrng.r	⊢ 𝐸 = (𝑅 ~QG 𝑆)
2idlcpblrng.i	⊢ 𝐼 = (2Ideal‘𝑅)
2idlcpblrng.t	⊢ · = (.r‘𝑅)

Assertion

Ref	Expression
2idlcpblrng	⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷) → (𝐴 · 𝐵)𝐸(𝐶 · 𝐷)))

Proof of Theorem 2idlcpblrng

Step	Hyp	Ref	Expression
1		simpl1 1002	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑅 ∈ Rng)
2		simpl3 1004	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (SubGrp‘𝑅))
3		2idlcpblrng.x	. . . . . . . . 9 ⊢ 𝑋 = (Base‘𝑅)
4		2idlcpblrng.r	. . . . . . . . 9 ⊢ 𝐸 = (𝑅 ~QG 𝑆)
5	3, 4	eqger 13294	. . . . . . . 8 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → 𝐸 Er 𝑋)
6	2, 5	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐸 Er 𝑋)
7		simprl 529	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐴𝐸𝐶)
8	6, 7	ersym 6599	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐶𝐸𝐴)
9		rngabl 13431	. . . . . . . 8 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
10	9	3ad2ant1 1020	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel)
11		eqid 2193	. . . . . . . . . . . 12 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
12		eqid 2193	. . . . . . . . . . . 12 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
13		eqid 2193	. . . . . . . . . . . 12 ⊢ (LIdeal‘(oppr‘𝑅)) = (LIdeal‘(oppr‘𝑅))
14		2idlcpblrng.i	. . . . . . . . . . . 12 ⊢ 𝐼 = (2Ideal‘𝑅)
15	11, 12, 13, 14	2idlelb 14001	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝐼 ↔ (𝑆 ∈ (LIdeal‘𝑅) ∧ 𝑆 ∈ (LIdeal‘(oppr‘𝑅))))
16	15	simplbi 274	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝐼 → 𝑆 ∈ (LIdeal‘𝑅))
17	16	3ad2ant2 1021	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (LIdeal‘𝑅))
18	17	adantr 276	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (LIdeal‘𝑅))
19	3, 11	lidlss 13972	. . . . . . . 8 ⊢ (𝑆 ∈ (LIdeal‘𝑅) → 𝑆 ⊆ 𝑋)
20	18, 19	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ⊆ 𝑋)
21		eqid 2193	. . . . . . . 8 ⊢ (-g‘𝑅) = (-g‘𝑅)
22	3, 21, 4	eqgabl 13400	. . . . . . 7 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → (𝐶𝐸𝐴 ↔ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)))
23	10, 20, 22	syl2an2r 595	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶𝐸𝐴 ↔ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)))
24	8, 23	mpbid 147	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆))
25	24	simp2d 1012	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐴 ∈ 𝑋)
26		simprr 531	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵𝐸𝐷)
27	3, 21, 4	eqgabl 13400	. . . . . . 7 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → (𝐵𝐸𝐷 ↔ (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)))
28	10, 20, 27	syl2an2r 595	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵𝐸𝐷 ↔ (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)))
29	26, 28	mpbid 147	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆))
30	29	simp1d 1011	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵 ∈ 𝑋)
31		2idlcpblrng.t	. . . . 5 ⊢ · = (.r‘𝑅)
32	3, 31	rngcl 13440	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 · 𝐵) ∈ 𝑋)
33	1, 25, 30, 32	syl3anc 1249	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴 · 𝐵) ∈ 𝑋)
34	24	simp1d 1011	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐶 ∈ 𝑋)
35	29	simp2d 1012	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐷 ∈ 𝑋)
36	3, 31	rngcl 13440	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶 · 𝐷) ∈ 𝑋)
37	1, 34, 35, 36	syl3anc 1249	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐷) ∈ 𝑋)
38		rnggrp 13434	. . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
39	38	3ad2ant1 1020	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Grp)
40	39	adantr 276	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑅 ∈ Grp)
41	3, 31	rngcl 13440	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐶 · 𝐵) ∈ 𝑋)
42	1, 34, 30, 41	syl3anc 1249	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐵) ∈ 𝑋)
43	3, 21	grpnnncan2 13169	. . . . 5 ⊢ ((𝑅 ∈ Grp ∧ ((𝐶 · 𝐷) ∈ 𝑋 ∧ (𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐵) ∈ 𝑋)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)))
44	40, 37, 33, 42, 43	syl13anc 1251	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)))
45	3, 31, 21, 1, 34, 35, 30	rngsubdi 13447	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)))
46		eqid 2193	. . . . . . . . . 10 ⊢ (0g‘𝑅) = (0g‘𝑅)
47	46	subg0cl 13252	. . . . . . . . 9 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (0g‘𝑅) ∈ 𝑆)
48	47	3ad2ant3 1022	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (0g‘𝑅) ∈ 𝑆)
49	48	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘𝑅) ∈ 𝑆)
50	29	simp3d 1013	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)
51	46, 3, 31, 11	rnglidlmcl 13976	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ (LIdeal‘𝑅) ∧ (0g‘𝑅) ∈ 𝑆) ∧ (𝐶 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
52	1, 18, 49, 34, 50, 51	syl32anc 1257	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
53	45, 52	eqeltrrd 2271	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
54	3, 21	grpsubcl 13152	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
55	40, 25, 34, 54	syl3anc 1249	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
56		eqid 2193	. . . . . . . . 9 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
57	3, 31, 12, 56	opprmulg 13567	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝐵 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑋) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴(-g‘𝑅)𝐶) · 𝐵))
58	1, 30, 55, 57	syl3anc 1249	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴(-g‘𝑅)𝐶) · 𝐵))
59	3, 31, 21, 1, 25, 34, 30	rngsubdir 13448	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴(-g‘𝑅)𝐶) · 𝐵) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
60	58, 59	eqtrd 2226	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
61	12	opprrng 13573	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (oppr‘𝑅) ∈ Rng)
62	61	3ad2ant1 1020	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (oppr‘𝑅) ∈ Rng)
63	62	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (oppr‘𝑅) ∈ Rng)
64	15	simprbi 275	. . . . . . . . 9 ⊢ (𝑆 ∈ 𝐼 → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
65	64	3ad2ant2 1021	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
66	65	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
67	12, 46	oppr0g 13577	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
68	1, 67	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
69	68, 49	eqeltrrd 2271	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘(oppr‘𝑅)) ∈ 𝑆)
70	12, 3	opprbasg 13571	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑋 = (Base‘(oppr‘𝑅)))
71	1, 70	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑋 = (Base‘(oppr‘𝑅)))
72	30, 71	eleqtrd 2272	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵 ∈ (Base‘(oppr‘𝑅)))
73	24	simp3d 1013	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)
74		eqid 2193	. . . . . . . 8 ⊢ (0g‘(oppr‘𝑅)) = (0g‘(oppr‘𝑅))
75		eqid 2193	. . . . . . . 8 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅))
76	74, 75, 56, 13	rnglidlmcl 13976	. . . . . . 7 ⊢ ((((oppr‘𝑅) ∈ Rng ∧ 𝑆 ∈ (LIdeal‘(oppr‘𝑅)) ∧ (0g‘(oppr‘𝑅)) ∈ 𝑆) ∧ (𝐵 ∈ (Base‘(oppr‘𝑅)) ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) ∈ 𝑆)
77	63, 66, 69, 72, 73, 76	syl32anc 1257	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) ∈ 𝑆)
78	60, 77	eqeltrrd 2271	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
79	21	subgsubcl 13255	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝑅) ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆 ∧ ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
80	2, 53, 78, 79	syl3anc 1249	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
81	44, 80	eqeltrrd 2271	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)
82	3, 21, 4	eqgabl 13400	. . . 4 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → ((𝐴 · 𝐵)𝐸(𝐶 · 𝐷) ↔ ((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐷) ∈ 𝑋 ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)))
83	10, 20, 82	syl2an2r 595	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴 · 𝐵)𝐸(𝐶 · 𝐷) ↔ ((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐷) ∈ 𝑋 ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)))
84	33, 37, 81, 83	mpbir3and 1182	. 2 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴 · 𝐵)𝐸(𝐶 · 𝐷))
85	84	ex 115	1 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷) → (𝐴 · 𝐵)𝐸(𝐶 · 𝐷)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364   ∈ wcel 2164   ⊆ wss 3153   class class class wbr 4029  ‘cfv 5254  (class class class)co 5918   Er wer 6584  Basecbs 12618  ._rcmulr 12696  0_gc0g 12867  Grpcgrp 13072  -_gcsg 13074  SubGrpcsubg 13237   ~_QG cqg 13239  Abelcabl 13355  Rngcrng 13428  opp_rcoppr 13563  LIdealclidl 13963  2Idealc2idl 13995

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-tpos 6298  df-er 6587  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-4 9043  df-5 9044  df-6 9045  df-7 9046  df-8 9047  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626  df-plusg 12708  df-mulr 12709  df-sca 12711  df-vsca 12712  df-ip 12713  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-sbg 13077  df-subg 13240  df-eqg 13242  df-cmn 13356  df-abl 13357  df-mgp 13417  df-rng 13429  df-oppr 13564  df-lssm 13849  df-sra 13931  df-rgmod 13932  df-lidl 13965  df-2idl 13996

This theorem is referenced by:  2idlcpbl  14020  qus2idrng  14021  qusmulrng  14028