Theorem 2idlcpblrng 14495

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 1024	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑅 ∈ Rng)
2		simpl3 1026	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (SubGrp‘𝑅))
3		2idlcpblrng.x	. . . . . . . . 9 ⊢ 𝑋 = (Base‘𝑅)
4		2idlcpblrng.r	. . . . . . . . 9 ⊢ 𝐸 = (𝑅 ~QG 𝑆)
5	3, 4	eqger 13769	. . . . . . . 8 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → 𝐸 Er 𝑋)
6	2, 5	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐸 Er 𝑋)
7		simprl 529	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐴𝐸𝐶)
8	6, 7	ersym 6700	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐶𝐸𝐴)
9		rngabl 13906	. . . . . . . 8 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
10	9	3ad2ant1 1042	. . . . . . 7 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Abel)
11		eqid 2229	. . . . . . . . . . . 12 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
12		eqid 2229	. . . . . . . . . . . 12 ⊢ (oppr‘𝑅) = (oppr‘𝑅)
13		eqid 2229	. . . . . . . . . . . 12 ⊢ (LIdeal‘(oppr‘𝑅)) = (LIdeal‘(oppr‘𝑅))
14		2idlcpblrng.i	. . . . . . . . . . . 12 ⊢ 𝐼 = (2Ideal‘𝑅)
15	11, 12, 13, 14	2idlelb 14477	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝐼 ↔ (𝑆 ∈ (LIdeal‘𝑅) ∧ 𝑆 ∈ (LIdeal‘(oppr‘𝑅))))
16	15	simplbi 274	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝐼 → 𝑆 ∈ (LIdeal‘𝑅))
17	16	3ad2ant2 1043	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (LIdeal‘𝑅))
18	17	adantr 276	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (LIdeal‘𝑅))
19	3, 11	lidlss 14448	. . . . . . . 8 ⊢ (𝑆 ∈ (LIdeal‘𝑅) → 𝑆 ⊆ 𝑋)
20	18, 19	syl 14	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ⊆ 𝑋)
21		eqid 2229	. . . . . . . 8 ⊢ (-g‘𝑅) = (-g‘𝑅)
22	3, 21, 4	eqgabl 13875	. . . . . . 7 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → (𝐶𝐸𝐴 ↔ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)))
23	10, 20, 22	syl2an2r 597	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶𝐸𝐴 ↔ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)))
24	8, 23	mpbid 147	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆))
25	24	simp2d 1034	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐴 ∈ 𝑋)
26		simprr 531	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵𝐸𝐷)
27	3, 21, 4	eqgabl 13875	. . . . . . 7 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → (𝐵𝐸𝐷 ↔ (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)))
28	10, 20, 27	syl2an2r 597	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵𝐸𝐷 ↔ (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)))
29	26, 28	mpbid 147	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆))
30	29	simp1d 1033	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵 ∈ 𝑋)
31		2idlcpblrng.t	. . . . 5 ⊢ · = (.r‘𝑅)
32	3, 31	rngcl 13915	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 · 𝐵) ∈ 𝑋)
33	1, 25, 30, 32	syl3anc 1271	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴 · 𝐵) ∈ 𝑋)
34	24	simp1d 1033	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐶 ∈ 𝑋)
35	29	simp2d 1034	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐷 ∈ 𝑋)
36	3, 31	rngcl 13915	. . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑋) → (𝐶 · 𝐷) ∈ 𝑋)
37	1, 34, 35, 36	syl3anc 1271	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐷) ∈ 𝑋)
38		rnggrp 13909	. . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
39	38	3ad2ant1 1042	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑅 ∈ Grp)
40	39	adantr 276	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑅 ∈ Grp)
41	3, 31	rngcl 13915	. . . . . 6 ⊢ ((𝑅 ∈ Rng ∧ 𝐶 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐶 · 𝐵) ∈ 𝑋)
42	1, 34, 30, 41	syl3anc 1271	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · 𝐵) ∈ 𝑋)
43	3, 21	grpnnncan2 13638	. . . . 5 ⊢ ((𝑅 ∈ Grp ∧ ((𝐶 · 𝐷) ∈ 𝑋 ∧ (𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐵) ∈ 𝑋)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)))
44	40, 37, 33, 42, 43	syl13anc 1273	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)))
45	3, 31, 21, 1, 34, 35, 30	rngsubdi 13922	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) = ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)))
46		eqid 2229	. . . . . . . . . 10 ⊢ (0g‘𝑅) = (0g‘𝑅)
47	46	subg0cl 13727	. . . . . . . . 9 ⊢ (𝑆 ∈ (SubGrp‘𝑅) → (0g‘𝑅) ∈ 𝑆)
48	47	3ad2ant3 1044	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (0g‘𝑅) ∈ 𝑆)
49	48	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘𝑅) ∈ 𝑆)
50	29	simp3d 1035	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)
51	46, 3, 31, 11	rnglidlmcl 14452	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ (LIdeal‘𝑅) ∧ (0g‘𝑅) ∈ 𝑆) ∧ (𝐶 ∈ 𝑋 ∧ (𝐷(-g‘𝑅)𝐵) ∈ 𝑆)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
52	1, 18, 49, 34, 50, 51	syl32anc 1279	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐶 · (𝐷(-g‘𝑅)𝐵)) ∈ 𝑆)
53	45, 52	eqeltrrd 2307	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
54	3, 21	grpsubcl 13621	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
55	40, 25, 34, 54	syl3anc 1271	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑋)
56		eqid 2229	. . . . . . . . 9 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅))
57	3, 31, 12, 56	opprmulg 14042	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝐵 ∈ 𝑋 ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑋) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴(-g‘𝑅)𝐶) · 𝐵))
58	1, 30, 55, 57	syl3anc 1271	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴(-g‘𝑅)𝐶) · 𝐵))
59	3, 31, 21, 1, 25, 34, 30	rngsubdir 13923	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴(-g‘𝑅)𝐶) · 𝐵) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
60	58, 59	eqtrd 2262	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) = ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)))
61	12	opprrng 14048	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (oppr‘𝑅) ∈ Rng)
62	61	3ad2ant1 1042	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → (oppr‘𝑅) ∈ Rng)
63	62	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (oppr‘𝑅) ∈ Rng)
64	15	simprbi 275	. . . . . . . . 9 ⊢ (𝑆 ∈ 𝐼 → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
65	64	3ad2ant2 1043	. . . . . . . 8 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
66	65	adantr 276	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑆 ∈ (LIdeal‘(oppr‘𝑅)))
67	12, 46	oppr0g 14052	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
68	1, 67	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘𝑅) = (0g‘(oppr‘𝑅)))
69	68, 49	eqeltrrd 2307	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (0g‘(oppr‘𝑅)) ∈ 𝑆)
70	12, 3	opprbasg 14046	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑋 = (Base‘(oppr‘𝑅)))
71	1, 70	syl 14	. . . . . . . 8 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝑋 = (Base‘(oppr‘𝑅)))
72	30, 71	eleqtrd 2308	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → 𝐵 ∈ (Base‘(oppr‘𝑅)))
73	24	simp3d 1035	. . . . . . 7 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)
74		eqid 2229	. . . . . . . 8 ⊢ (0g‘(oppr‘𝑅)) = (0g‘(oppr‘𝑅))
75		eqid 2229	. . . . . . . 8 ⊢ (Base‘(oppr‘𝑅)) = (Base‘(oppr‘𝑅))
76	74, 75, 56, 13	rnglidlmcl 14452	. . . . . . 7 ⊢ ((((oppr‘𝑅) ∈ Rng ∧ 𝑆 ∈ (LIdeal‘(oppr‘𝑅)) ∧ (0g‘(oppr‘𝑅)) ∈ 𝑆) ∧ (𝐵 ∈ (Base‘(oppr‘𝑅)) ∧ (𝐴(-g‘𝑅)𝐶) ∈ 𝑆)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) ∈ 𝑆)
77	63, 66, 69, 72, 73, 76	syl32anc 1279	. . . . . 6 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐵(.r‘(oppr‘𝑅))(𝐴(-g‘𝑅)𝐶)) ∈ 𝑆)
78	60, 77	eqeltrrd 2307	. . . . 5 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆)
79	21	subgsubcl 13730	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝑅) ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆 ∧ ((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵)) ∈ 𝑆) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
80	2, 53, 78, 79	syl3anc 1271	. . . 4 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (((𝐶 · 𝐷)(-g‘𝑅)(𝐶 · 𝐵))(-g‘𝑅)((𝐴 · 𝐵)(-g‘𝑅)(𝐶 · 𝐵))) ∈ 𝑆)
81	44, 80	eqeltrrd 2307	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)
82	3, 21, 4	eqgabl 13875	. . . 4 ⊢ ((𝑅 ∈ Abel ∧ 𝑆 ⊆ 𝑋) → ((𝐴 · 𝐵)𝐸(𝐶 · 𝐷) ↔ ((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐷) ∈ 𝑋 ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)))
83	10, 20, 82	syl2an2r 597	. . 3 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → ((𝐴 · 𝐵)𝐸(𝐶 · 𝐷) ↔ ((𝐴 · 𝐵) ∈ 𝑋 ∧ (𝐶 · 𝐷) ∈ 𝑋 ∧ ((𝐶 · 𝐷)(-g‘𝑅)(𝐴 · 𝐵)) ∈ 𝑆)))
84	33, 37, 81, 83	mpbir3and 1204	. 2 ⊢ (((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) ∧ (𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷)) → (𝐴 · 𝐵)𝐸(𝐶 · 𝐷))
85	84	ex 115	1 ⊢ ((𝑅 ∈ Rng ∧ 𝑆 ∈ 𝐼 ∧ 𝑆 ∈ (SubGrp‘𝑅)) → ((𝐴𝐸𝐶 ∧ 𝐵𝐸𝐷) → (𝐴 · 𝐵)𝐸(𝐶 · 𝐷)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200   ⊆ wss 3197   class class class wbr 4083  ‘cfv 5318  (class class class)co 6007   Er wer 6685  Basecbs 13040  ._rcmulr 13119  0_gc0g 13297  Grpcgrp 13541  -_gcsg 13543  SubGrpcsubg 13712   ~_QG cqg 13714  Abelcabl 13830  Rngcrng 13903  opp_rcoppr 14038  LIdealclidl 14439  2Idealc2idl 14471

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8098  ax-resscn 8099  ax-1cn 8100  ax-1re 8101  ax-icn 8102  ax-addcl 8103  ax-addrcl 8104  ax-mulcl 8105  ax-addcom 8107  ax-addass 8109  ax-i2m1 8112  ax-0lt1 8113  ax-0id 8115  ax-rnegex 8116  ax-pre-ltirr 8119  ax-pre-lttrn 8121  ax-pre-ltadd 8123

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-tpos 6397  df-er 6688  df-pnf 8191  df-mnf 8192  df-ltxr 8194  df-inn 9119  df-2 9177  df-3 9178  df-4 9179  df-5 9180  df-6 9181  df-7 9182  df-8 9183  df-ndx 13043  df-slot 13044  df-base 13046  df-sets 13047  df-iress 13048  df-plusg 13131  df-mulr 13132  df-sca 13134  df-vsca 13135  df-ip 13136  df-0g 13299  df-mgm 13397  df-sgrp 13443  df-mnd 13458  df-grp 13544  df-minusg 13545  df-sbg 13546  df-subg 13715  df-eqg 13717  df-cmn 13831  df-abl 13832  df-mgp 13892  df-rng 13904  df-oppr 14039  df-lssm 14325  df-sra 14407  df-rgmod 14408  df-lidl 14441  df-2idl 14472

This theorem is referenced by:  2idlcpbl  14496  qus2idrng  14497  qusmulrng  14504