Theorem fracerl 33406

Description: Rewrite the ring localization equivalence relation in the case of a field of fractions. (Contributed by Thierry Arnoux, 5-May-2025.)

Hypotheses

Ref	Expression
fracerl.1	⊢ 𝐵 = (Base‘𝑅)
fracerl.2	⊢ · = (.r‘𝑅)
fracerl.3	⊢ ∼ = (𝑅 ~RL (RLReg‘𝑅))
fracerl.4	⊢ (𝜑 → 𝑅 ∈ CRing)
fracerl.5	⊢ (𝜑 → 𝐸 ∈ 𝐵)
fracerl.6	⊢ (𝜑 → 𝐺 ∈ 𝐵)
fracerl.7	⊢ (𝜑 → 𝐹 ∈ (RLReg‘𝑅))
fracerl.8	⊢ (𝜑 → 𝐻 ∈ (RLReg‘𝑅))

Assertion

Ref	Expression
fracerl	⊢ (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))

Proof of Theorem fracerl

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

Step	Hyp	Ref	Expression
1		fracerl.3	. . . . 5 ⊢ ∼ = (𝑅 ~RL (RLReg‘𝑅))
2		fracerl.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
3		eqid 2737	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
4		fracerl.2	. . . . . 6 ⊢ · = (.r‘𝑅)
5		eqid 2737	. . . . . 6 ⊢ (-g‘𝑅) = (-g‘𝑅)
6		eqid 2737	. . . . . 6 ⊢ (𝐵 × (RLReg‘𝑅)) = (𝐵 × (RLReg‘𝑅))
7		eqid 2737	. . . . . 6 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))}
8		eqid 2737	. . . . . . . 8 ⊢ (RLReg‘𝑅) = (RLReg‘𝑅)
9	8, 2	rrgss 20652	. . . . . . 7 ⊢ (RLReg‘𝑅) ⊆ 𝐵
10	9	a1i 11	. . . . . 6 ⊢ (𝜑 → (RLReg‘𝑅) ⊆ 𝐵)
11	2, 3, 4, 5, 6, 7, 10	erlval 33358	. . . . 5 ⊢ (𝜑 → (𝑅 ~RL (RLReg‘𝑅)) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))})
12	1, 11	eqtrid 2784	. . . 4 ⊢ (𝜑 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))})
13		simprl 771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝑎 = ⟨𝐸, 𝐹⟩)
14	13	fveq2d 6848	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑎) = (1st ‘⟨𝐸, 𝐹⟩))
15		fracerl.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐸 ∈ 𝐵)
16		fracerl.7	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ (RLReg‘𝑅))
17	16	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝐹 ∈ (RLReg‘𝑅))
18		op1stg 7957	. . . . . . . . . . 11 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝐹 ∈ (RLReg‘𝑅)) → (1st ‘⟨𝐸, 𝐹⟩) = 𝐸)
19	15, 17, 18	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘⟨𝐸, 𝐹⟩) = 𝐸)
20	14, 19	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑎) = 𝐸)
21		simprr 773	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝑏 = ⟨𝐺, 𝐻⟩)
22	21	fveq2d 6848	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑏) = (2nd ‘⟨𝐺, 𝐻⟩))
23		fracerl.6	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ 𝐵)
24		fracerl.8	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ∈ (RLReg‘𝑅))
25	24	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝐻 ∈ (RLReg‘𝑅))
26		op2ndg 7958	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ 𝐵 ∧ 𝐻 ∈ (RLReg‘𝑅)) → (2nd ‘⟨𝐺, 𝐻⟩) = 𝐻)
27	23, 25, 26	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘⟨𝐺, 𝐻⟩) = 𝐻)
28	22, 27	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑏) = 𝐻)
29	20, 28	oveq12d 7388	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((1st ‘𝑎) · (2nd ‘𝑏)) = (𝐸 · 𝐻))
30	21	fveq2d 6848	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑏) = (1st ‘⟨𝐺, 𝐻⟩))
31		op1stg 7957	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ 𝐵 ∧ 𝐻 ∈ (RLReg‘𝑅)) → (1st ‘⟨𝐺, 𝐻⟩) = 𝐺)
32	23, 25, 31	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘⟨𝐺, 𝐻⟩) = 𝐺)
33	30, 32	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑏) = 𝐺)
34	13	fveq2d 6848	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑎) = (2nd ‘⟨𝐸, 𝐹⟩))
35		op2ndg 7958	. . . . . . . . . . 11 ⊢ ((𝐸 ∈ 𝐵 ∧ 𝐹 ∈ (RLReg‘𝑅)) → (2nd ‘⟨𝐸, 𝐹⟩) = 𝐹)
36	15, 17, 35	syl2an2r 686	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘⟨𝐸, 𝐹⟩) = 𝐹)
37	34, 36	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑎) = 𝐹)
38	33, 37	oveq12d 7388	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((1st ‘𝑏) · (2nd ‘𝑎)) = (𝐺 · 𝐹))
39	29, 38	oveq12d 7388	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎))) = ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)))
40	39	oveq2d 7386	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))))
41	40	eqeq1d 2739	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅) ↔ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
42	41	rexbidv 3162	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅) ↔ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
43	12, 42	brab2d 32701	. . 3 ⊢ (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ ((⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))))
44	15, 16	opelxpd 5673	. . . . 5 ⊢ (𝜑 → ⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)))
45	23, 24	opelxpd 5673	. . . . 5 ⊢ (𝜑 → ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅)))
46	44, 45	jca 511	. . . 4 ⊢ (𝜑 → (⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))))
47	46	biantrurd 532	. . 3 ⊢ (𝜑 → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))))
48		simplr 769	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑡 ∈ (RLReg‘𝑅))
49		fracerl.4	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ CRing)
50	49	crnggrpd 20199	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ Grp)
51	50	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑅 ∈ Grp)
52	49	crngringd 20198	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ Ring)
53	52	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑅 ∈ Ring)
54	15	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐸 ∈ 𝐵)
55	9, 24	sselid 3933	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ 𝐵)
56	55	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐻 ∈ 𝐵)
57	2, 4, 53, 54, 56	ringcld 20212	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝐸 · 𝐻) ∈ 𝐵)
58	23	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐺 ∈ 𝐵)
59	9, 16	sselid 3933	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
60	59	ad2antrr 727	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐹 ∈ 𝐵)
61	2, 4, 53, 58, 60	ringcld 20212	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝐺 · 𝐹) ∈ 𝐵)
62	2, 5	grpsubcl 18967	. . . . . . 7 ⊢ ((𝑅 ∈ Grp ∧ (𝐸 · 𝐻) ∈ 𝐵 ∧ (𝐺 · 𝐹) ∈ 𝐵) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵)
63	51, 57, 61, 62	syl3anc 1374	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵)
64		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
65	8, 2, 4, 3	rrgeq0i 20649	. . . . . . 7 ⊢ ((𝑡 ∈ (RLReg‘𝑅) ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵) → ((𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
66	65	imp 406	. . . . . 6 ⊢ (((𝑡 ∈ (RLReg‘𝑅) ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
67	48, 63, 64, 66	syl21anc 838	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
68	67	r19.29an 3142	. . . 4 ⊢ ((𝜑 ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
69		oveq1 7377	. . . . . 6 ⊢ (𝑡 = (1r‘𝑅) → (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))))
70	69	eqeq1d 2739	. . . . 5 ⊢ (𝑡 = (1r‘𝑅) → ((𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
71		eqid 2737	. . . . . . 7 ⊢ (1r‘𝑅) = (1r‘𝑅)
72	71, 8, 52	1rrg 33383	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) ∈ (RLReg‘𝑅))
73	72	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → (1r‘𝑅) ∈ (RLReg‘𝑅))
74		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
75	74	oveq2d 7386	. . . . . 6 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = ((1r‘𝑅) · (0g‘𝑅)))
76	2, 71	ringidcl 20217	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵)
77	52, 76	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1r‘𝑅) ∈ 𝐵)
78	2, 4, 3, 52, 77	ringrzd 20248	. . . . . . 7 ⊢ (𝜑 → ((1r‘𝑅) · (0g‘𝑅)) = (0g‘𝑅))
79	78	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · (0g‘𝑅)) = (0g‘𝑅))
80	75, 79	eqtrd 2772	. . . . 5 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
81	70, 73, 80	rspcedvdw 3581	. . . 4 ⊢ ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
82	68, 81	impbida 801	. . 3 ⊢ (𝜑 → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
83	43, 47, 82	3bitr2d 307	. 2 ⊢ (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
84	2, 4, 52, 15, 55	ringcld 20212	. . 3 ⊢ (𝜑 → (𝐸 · 𝐻) ∈ 𝐵)
85	2, 4, 52, 23, 59	ringcld 20212	. . 3 ⊢ (𝜑 → (𝐺 · 𝐹) ∈ 𝐵)
86	2, 3, 5	grpsubeq0 18973	. . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝐸 · 𝐻) ∈ 𝐵 ∧ (𝐺 · 𝐹) ∈ 𝐵) → (((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅) ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))
87	50, 84, 85, 86	syl3anc 1374	. 2 ⊢ (𝜑 → (((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅) ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))
88	83, 87	bitrd 279	1 ⊢ (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃wrex 3062   ⊆ wss 3903  ⟨cop 4588   class class class wbr 5100  {copab 5162   × cxp 5632  ‘cfv 6502  (class class class)co 7370  1^st c1st 7943  2^nd c2nd 7944  Basecbs 17150  ._rcmulr 17192  0_gc0g 17373  Grpcgrp 18880  -_gcsg 18882  1_rcur 20133  Ringcrg 20185  CRingccrg 20186  RLRegcrlreg 20641   ~_RL cerl 33353

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-cnex 11096  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-1st 7945  df-2nd 7946  df-tpos 8180  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-nn 12160  df-2 12222  df-3 12223  df-sets 17105  df-slot 17123  df-ndx 17135  df-base 17151  df-ress 17172  df-plusg 17204  df-mulr 17205  df-0g 17375  df-mgm 18579  df-sgrp 18658  df-mnd 18674  df-grp 18883  df-minusg 18884  df-sbg 18885  df-cmn 19728  df-abl 19729  df-mgp 20093  df-rng 20105  df-ur 20134  df-ring 20187  df-cring 20188  df-oppr 20290  df-dvdsr 20310  df-unit 20311  df-invr 20341  df-rlreg 20644  df-erl 33355

This theorem is referenced by:  fracfld  33408  zringfrac  33653