Theorem erlcl2 33265

Description: Closure for the ring localization equivalence relation. (Contributed by Thierry Arnoux, 4-May-2025.)

Hypotheses

Ref	Expression
erlcl1.b	⊢ 𝐵 = (Base‘𝑅)
erlcl1.e	⊢ ∼ = (𝑅 ~RL 𝑆)
erlcl1.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
erlcl1.1	⊢ (𝜑 → 𝑈 ∼ 𝑉)

Assertion

Ref	Expression
erlcl2	⊢ (𝜑 → 𝑉 ∈ (𝐵 × 𝑆))

Proof of Theorem erlcl2

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

Step	Hyp	Ref	Expression
1		erlcl1.1	. . 3 ⊢ (𝜑 → 𝑈 ∼ 𝑉)
2		erlcl1.e	. . . . 5 ⊢ ∼ = (𝑅 ~RL 𝑆)
3		erlcl1.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4		eqid 2737	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
5		eqid 2737	. . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅)
6		eqid 2737	. . . . . 6 ⊢ (-g‘𝑅) = (-g‘𝑅)
7		eqid 2737	. . . . . 6 ⊢ (𝐵 × 𝑆) = (𝐵 × 𝑆)
8		eqid 2737	. . . . . 6 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))}
9		erlcl1.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
10	3, 4, 5, 6, 7, 8, 9	erlval 33262	. . . . 5 ⊢ (𝜑 → (𝑅 ~RL 𝑆) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))})
11	2, 10	eqtrid 2789	. . . 4 ⊢ (𝜑 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))})
12		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑎 = 𝑈)
13	12	fveq2d 6910	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑎) = (1st ‘𝑈))
14		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑏 = 𝑉)
15	14	fveq2d 6910	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (2nd ‘𝑏) = (2nd ‘𝑉))
16	13, 15	oveq12d 7449	. . . . . . . . 9 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏)) = ((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉)))
17	14	fveq2d 6910	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑏) = (1st ‘𝑉))
18	12	fveq2d 6910	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (2nd ‘𝑎) = (2nd ‘𝑈))
19	17, 18	oveq12d 7449	. . . . . . . . 9 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)) = ((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))
20	16, 19	oveq12d 7449	. . . . . . . 8 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎))) = (((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈))))
21	20	oveq2d 7447	. . . . . . 7 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))))
22	21	eqeq1d 2739	. . . . . 6 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅) ↔ (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅)))
23	22	rexbidv 3179	. . . . 5 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅) ↔ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅)))
24	23	adantl 481	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝑈 ∧ 𝑏 = 𝑉)) → (∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅) ↔ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅)))
25	11, 24	brab2d 32619	. . 3 ⊢ (𝜑 → (𝑈 ∼ 𝑉 ↔ ((𝑈 ∈ (𝐵 × 𝑆) ∧ 𝑉 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅))))
26	1, 25	mpbid 232	. 2 ⊢ (𝜑 → ((𝑈 ∈ (𝐵 × 𝑆) ∧ 𝑉 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅)))
27	26	simplrd 770	1 ⊢ (𝜑 → 𝑉 ∈ (𝐵 × 𝑆))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∃wrex 3070   ⊆ wss 3951   class class class wbr 5143  {copab 5205   × cxp 5683  ‘cfv 6561  (class class class)co 7431  1^st c1st 8012  2^nd c2nd 8013  Basecbs 17247  ._rcmulr 17298  0_gc0g 17484  -_gcsg 18953   ~_RL cerl 33257

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-iota 6514  df-fun 6563  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-erl 33259

This theorem is referenced by:  rlocaddval  33272  rlocmulval  33273