Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fracerl Structured version   Visualization version   GIF version

Theorem fracerl 33973
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.
StepHypRef Expression
1 fracerl.3 . . . . 5 ∼ = (𝑅 ~RL (RLReg‘𝑅))
2 fracerl.1 . . . . . 6 𝐵 = (Base‘𝑅)
3 eqid 2766 . . . . . 6 (0g‘𝑅) = (0g‘𝑅)
4 fracerl.2 . . . . . 6 · = (.r‘𝑅)
5 eqid 2766 . . . . . 6 (-g‘𝑅) = (-g‘𝑅)
6 eqid 2766 . . . . . 6 (𝐵 × (RLReg‘𝑅)) = (𝐵 × (RLReg‘𝑅))
7 eqid 2766 . . . . . 6 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))}
8 eqid 2766 . . . . . . . 8 (RLReg‘𝑅) = (RLReg‘𝑅)
98, 2rrgss 21007 . . . . . . 7 (RLReg‘𝑅) ⊆ 𝐵
109a1i 11 . . . . . 6 (𝜑 → (RLReg‘𝑅) ⊆ 𝐵)
112, 3, 4, 5, 6, 7, 10erlval 33919 . . . . 5 (𝜑 → (𝑅 ~RL (RLReg‘𝑅)) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))})
121, 11eqtrid 2813 . . . 4 (𝜑 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × (RLReg‘𝑅)) ∧ 𝑏 ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅))})
13 simprl 783 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝑎 = ⟨𝐸, 𝐹⟩)
1413fveq2d 6919 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑎) = (1st ‘⟨𝐸, 𝐹⟩))
15 fracerl.5 . . . . . . . . . . 11 (𝜑 → 𝐸 ∈ 𝐵)
16 fracerl.7 . . . . . . . . . . . 12 (𝜑 → 𝐹 ∈ (RLReg‘𝑅))
1716adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝐹 ∈ (RLReg‘𝑅))
18 op1stg 8046 . . . . . . . . . . 11 ((𝐸 ∈ 𝐵 ∧ 𝐹 ∈ (RLReg‘𝑅)) → (1st ‘⟨𝐸, 𝐹⟩) = 𝐸)
1915, 17, 18syl2an2r 698 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘⟨𝐸, 𝐹⟩) = 𝐸)
2014, 19eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑎) = 𝐸)
21 simprr 785 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝑏 = ⟨𝐺, 𝐻⟩)
2221fveq2d 6919 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑏) = (2nd ‘⟨𝐺, 𝐻⟩))
23 fracerl.6 . . . . . . . . . . 11 (𝜑 → 𝐺 ∈ 𝐵)
24 fracerl.8 . . . . . . . . . . . 12 (𝜑 → 𝐻 ∈ (RLReg‘𝑅))
2524adantr 486 . . . . . . . . . . 11 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → 𝐻 ∈ (RLReg‘𝑅))
26 op2ndg 8047 . . . . . . . . . . 11 ((𝐺 ∈ 𝐵 ∧ 𝐻 ∈ (RLReg‘𝑅)) → (2nd ‘⟨𝐺, 𝐻⟩) = 𝐻)
2723, 25, 26syl2an2r 698 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘⟨𝐺, 𝐻⟩) = 𝐻)
2822, 27eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑏) = 𝐻)
2920, 28oveq12d 7468 . . . . . . . 8 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((1st ‘𝑎) · (2nd ‘𝑏)) = (𝐸 · 𝐻))
3021fveq2d 6919 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑏) = (1st ‘⟨𝐺, 𝐻⟩))
31 op1stg 8046 . . . . . . . . . . 11 ((𝐺 ∈ 𝐵 ∧ 𝐻 ∈ (RLReg‘𝑅)) → (1st ‘⟨𝐺, 𝐻⟩) = 𝐺)
3223, 25, 31syl2an2r 698 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘⟨𝐺, 𝐻⟩) = 𝐺)
3330, 32eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (1st ‘𝑏) = 𝐺)
3413fveq2d 6919 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑎) = (2nd ‘⟨𝐸, 𝐹⟩))
35 op2ndg 8047 . . . . . . . . . . 11 ((𝐸 ∈ 𝐵 ∧ 𝐹 ∈ (RLReg‘𝑅)) → (2nd ‘⟨𝐸, 𝐹⟩) = 𝐹)
3615, 17, 35syl2an2r 698 . . . . . . . . . 10 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘⟨𝐸, 𝐹⟩) = 𝐹)
3734, 36eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (2nd ‘𝑎) = 𝐹)
3833, 37oveq12d 7468 . . . . . . . 8 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((1st ‘𝑏) · (2nd ‘𝑎)) = (𝐺 · 𝐹))
3929, 38oveq12d 7468 . . . . . . 7 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎))) = ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)))
4039oveq2d 7466 . . . . . 6 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))))
4140eqeq1d 2768 . . . . 5 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → ((𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅) ↔ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
4241rexbidv 3193 . . . 4 ((𝜑 ∧ (𝑎 = ⟨𝐸, 𝐹⟩ ∧ 𝑏 = ⟨𝐺, 𝐻⟩)) → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏) · (2nd ‘𝑎)))) = (0g‘𝑅) ↔ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
4312, 42brab2d 5518 . . 3 (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ ((⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))))
4415, 16opelxpd 5696 . . . . 5 (𝜑 → ⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)))
4523, 24opelxpd 5696 . . . . 5 (𝜑 → ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅)))
4644, 45jca 521 . . . 4 (𝜑 → (⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))))
4746biantrurd 542 . . 3 (𝜑 → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((⟨𝐸, 𝐹⟩ ∈ (𝐵 × (RLReg‘𝑅)) ∧ ⟨𝐺, 𝐻⟩ ∈ (𝐵 × (RLReg‘𝑅))) ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))))
48 simplr 781 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑡 ∈ (RLReg‘𝑅))
49 fracerl.4 . . . . . . . . 9 (𝜑 → 𝑅 ∈ CRing)
5049crnggrpd 20527 . . . . . . . 8 (𝜑 → 𝑅 ∈ Grp)
5150ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑅 ∈ Grp)
5249crngringd 20526 . . . . . . . . 9 (𝜑 → 𝑅 ∈ Ring)
5352ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝑅 ∈ Ring)
5415ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐸 ∈ 𝐵)
559, 24sselid 3910 . . . . . . . . 9 (𝜑 → 𝐻 ∈ 𝐵)
5655ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐻 ∈ 𝐵)
572, 4, 53, 54, 56ringcld 20537 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝐸 · 𝐻) ∈ 𝐵)
5823ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐺 ∈ 𝐵)
599, 16sselid 3910 . . . . . . . . 9 (𝜑 → 𝐹 ∈ 𝐵)
6059ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → 𝐹 ∈ 𝐵)
612, 4, 53, 58, 60ringcld 20537 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝐺 · 𝐹) ∈ 𝐵)
622, 5grpsubcl 19282 . . . . . . 7 ((𝑅 ∈ Grp ∧ (𝐸 · 𝐻) ∈ 𝐵 ∧ (𝐺 · 𝐹) ∈ 𝐵) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵)
6351, 57, 61, 62syl3anc 1401 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵)
64 simpr 490 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
658, 2, 4, 3rrgeq0i 21004 . . . . . . 7 ((𝑡 ∈ (RLReg‘𝑅) ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵) → ((𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
6665imp 412 . . . . . 6 (((𝑡 ∈ (RLReg‘𝑅) ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) ∈ 𝐵) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
6748, 63, 64, 66syl21anc 851 . . . . 5 (((𝜑 ∧ 𝑡 ∈ (RLReg‘𝑅)) ∧ (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
6867r19.29an 3173 . . . 4 ((𝜑 ∧ ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
69 oveq1 7457 . . . . . 6 (𝑡 = (1r‘𝑅) → (𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))))
7069eqeq1d 2768 . . . . 5 (𝑡 = (1r‘𝑅) → ((𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅)))
71 eqid 2766 . . . . . . 7 (1r‘𝑅) = (1r‘𝑅)
7271, 8, 521rrg 33944 . . . . . 6 (𝜑 → (1r‘𝑅) ∈ (RLReg‘𝑅))
7372adantr 486 . . . . 5 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → (1r‘𝑅) ∈ (RLReg‘𝑅))
74 simpr 490 . . . . . . 7 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅))
7574oveq2d 7466 . . . . . 6 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = ((1r‘𝑅) · (0g‘𝑅)))
762, 71ringidcl 20547 . . . . . . . . 9 (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵)
7752, 76syl 18 . . . . . . . 8 (𝜑 → (1r‘𝑅) ∈ 𝐵)
782, 4, 3, 52, 77ringrzd 20580 . . . . . . 7 (𝜑 → ((1r‘𝑅) · (0g‘𝑅)) = (0g‘𝑅))
7978adantr 486 . . . . . 6 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · (0g‘𝑅)) = (0g‘𝑅))
8075, 79eqtrd 2801 . . . . 5 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ((1r‘𝑅) · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
8170, 73, 80rspcedvdw 3582 . . . 4 ((𝜑 ∧ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)) → ∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅))
8268, 81impbida 813 . . 3 (𝜑 → (∃𝑡 ∈ (RLReg‘𝑅)(𝑡 · ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹))) = (0g‘𝑅) ↔ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
8343, 47, 823bitr2d 310 . 2 (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ ((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅)))
842, 4, 52, 15, 55ringcld 20537 . . 3 (𝜑 → (𝐸 · 𝐻) ∈ 𝐵)
852, 4, 52, 23, 59ringcld 20537 . . 3 (𝜑 → (𝐺 · 𝐹) ∈ 𝐵)
862, 3, 5grpsubeq0 19288 . . 3 ((𝑅 ∈ Grp ∧ (𝐸 · 𝐻) ∈ 𝐵 ∧ (𝐺 · 𝐹) ∈ 𝐵) → (((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅) ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))
8750, 84, 85, 86syl3anc 1401 . 2 (𝜑 → (((𝐸 · 𝐻)(-g‘𝑅)(𝐺 · 𝐹)) = (0g‘𝑅) ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))
8883, 87bitrd 282 1 (𝜑 → (⟨𝐸, 𝐹⟩ ∼ ⟨𝐺, 𝐻⟩ ↔ (𝐸 · 𝐻) = (𝐺 · 𝐹)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∃wrex 3093   ⊆ wss 3899  ⟨cop 4839   class class class wbr 5107  {copab 5172   × cxp 5655  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033  Basecbs 17433  .rcmulr 17475  0gc0g 17662  Grpcgrp 19196  -gcsg 19198  1rcur 20460  Ringcrg 20512  CRingccrg 20513  RLRegcrlreg 20996   ~RL cerl 33914
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-tpos 8280  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-ress 17455  df-plusg 17488  df-mulr 17489  df-0g 17664  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-grp 19199  df-minusg 19200  df-sbg 19201  df-cmn 20049  df-abl 20050  df-mgp 20414  df-rng 20428  df-ur 20461  df-ring 20514  df-cring 20515  df-oppr 20620  df-dvdsr 20640  df-unit 20641  df-invr 20671  df-rlreg 20999  df-erl 33916
This theorem is used by:  fracfld  33975  zringfrac  34190
  Copyright terms: Public domain W3C validator