Theorem 2idlcpblrng 14157

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 13432	. . . . . . . 8 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → 𝐸 Er 𝑋)
6	2, 5	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐸 Er 𝑋)
7		simprl 529	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐴𝐸𝐶)
8	6, 7	ersym 6613	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐶𝐸𝐴)
9		rngabl 13569	. . . . . . . 8 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
10	9	3ad2ant1 1020	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel)
11		eqid 2196	. . . . . . . . . . . 12 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
12		eqid 2196	. . . . . . . . . . . 12 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
13		eqid 2196	. . . . . . . . . . . 12 ⊢ (LIdeal‘(oppr‘𝑅)) = (LIdeal‘(oppr‘𝑅))
14		2idlcpblrng.i	. . . . . . . . . . . 12 ⊢ 𝐼 = (2Ideal‘𝑅)
15	11, 12, 13, 14	2idlelb 14139	. . . . . . . . . . 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 14110	. . . . . . . 8 ⊢ (𝑆 ∈ (LIdeal‘𝑅) → 𝑆 ⊆ 𝑋)
20	18, 19	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ⊆ 𝑋)
21		eqid 2196	. . . . . . . 8 ⊢ (-g‘𝑅) = (-g‘𝑅)
22	3, 21, 4	eqgabl 13538	. . . . . . 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 13538	. . . . . . 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 13578	. . . 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 13578	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶 · 𝐷) ∈ 𝑋)
37	1, 34, 35, 36	syl3anc 1249	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐷) ∈ 𝑋)
38		rnggrp 13572	. . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
39	38	3ad2ant1 1020	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Grp)
40	39	adantr 276	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑅 ∈ Grp)
41	3, 31	rngcl 13578	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐶 · 𝐵) ∈ 𝑋)
42	1, 34, 30, 41	syl3anc 1249	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐵) ∈ 𝑋)
43	3, 21	grpnnncan2 13301	. . . . 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 13585	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)))
46		eqid 2196	. . . . . . . . . 10 ⊢ (0g‘𝑅) = (0g‘𝑅)
47	46	subg0cl 13390	. . . . . . . . 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 14114	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ (LIdeal‘𝑅) ∧ (0g‘𝑅) ∈ 𝑆) ∧ (𝐶 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
52	1, 18, 49, 34, 50, 51	syl32anc 1257	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
53	45, 52	eqeltrrd 2274	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
54	3, 21	grpsubcl 13284	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
55	40, 25, 34, 54	syl3anc 1249	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
56		eqid 2196	. . . . . . . . 9 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
57	3, 31, 12, 56	opprmulg 13705	. . . . . . . 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 13586	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴(-g‘𝑅)𝐶) · 𝐵) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
60	58, 59	eqtrd 2229	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
61	12	opprrng 13711	. . . . . . . . 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 13715	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
68	1, 67	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
69	68, 49	eqeltrrd 2274	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘(oppr‘𝑅)) ∈ 𝑆)
70	12, 3	opprbasg 13709	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑋 = (Base‘(oppr‘𝑅)))
71	1, 70	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑋 = (Base‘(oppr‘𝑅)))
72	30, 71	eleqtrd 2275	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵 ∈ (Base‘(oppr‘𝑅)))
73	24	simp3d 1013	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)
74		eqid 2196	. . . . . . . 8 ⊢ (0g‘(oppr‘𝑅)) = (0g‘(oppr‘𝑅))
75		eqid 2196	. . . . . . . 8 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅))
76	74, 75, 56, 13	rnglidlmcl 14114	. . . . . . 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 2274	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
79	21	subgsubcl 13393	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝑅) ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆 ∧ ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
80	2, 53, 78, 79	syl3anc 1249	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
81	44, 80	eqeltrrd 2274	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)
82	3, 21, 4	eqgabl 13538	. . . 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 2167   ⊆ wss 3157   class class class wbr 4034  ‘cfv 5259  (class class class)co 5925   Er wer 6598  Basecbs 12705  ._rcmulr 12783  0_gc0g 12960  Grpcgrp 13204  -_gcsg 13206  SubGrpcsubg 13375   ~_QG cqg 13377  Abelcabl 13493  Rngcrng 13566  opp_rcoppr 13701  LIdealclidl 14101  2Idealc2idl 14133

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-addcom 7998  ax-addass 8000  ax-i2m1 8003  ax-0lt1 8004  ax-0id 8006  ax-rnegex 8007  ax-pre-ltirr 8010  ax-pre-lttrn 8012  ax-pre-ltadd 8014

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-tpos 6312  df-er 6601  df-pnf 8082  df-mnf 8083  df-ltxr 8085  df-inn 9010  df-2 9068  df-3 9069  df-4 9070  df-5 9071  df-6 9072  df-7 9073  df-8 9074  df-ndx 12708  df-slot 12709  df-base 12711  df-sets 12712  df-iress 12713  df-plusg 12795  df-mulr 12796  df-sca 12798  df-vsca 12799  df-ip 12800  df-0g 12962  df-mgm 13060  df-sgrp 13106  df-mnd 13121  df-grp 13207  df-minusg 13208  df-sbg 13209  df-subg 13378  df-eqg 13380  df-cmn 13494  df-abl 13495  df-mgp 13555  df-rng 13567  df-oppr 13702  df-lssm 13987  df-sra 14069  df-rgmod 14070  df-lidl 14103  df-2idl 14134

This theorem is referenced by:  2idlcpbl  14158  qus2idrng  14159  qusmulrng  14166