Theorem erlcl2 33248

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 2735	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
5		eqid 2735	. . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅)
6		eqid 2735	. . . . . 6 ⊢ (-g‘𝑅) = (-g‘𝑅)
7		eqid 2735	. . . . . 6 ⊢ (𝐵 × 𝑆) = (𝐵 × 𝑆)
8		eqid 2735	. . . . . 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 33245	. . . . 5 ⊢ (𝜑 → (𝑅 ~RL 𝑆) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))})
11	2, 10	eqtrid 2787	. . . 4 ⊢ (𝜑 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅))})
12		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑎 = 𝑈)
13	12	fveq2d 6911	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑎) = (1st ‘𝑈))
14		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑏 = 𝑉)
15	14	fveq2d 6911	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (2nd ‘𝑏) = (2nd ‘𝑉))
16	13, 15	oveq12d 7449	. . . . . . . . 9 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏)) = ((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉)))
17	14	fveq2d 6911	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑏) = (1st ‘𝑉))
18	12	fveq2d 6911	. . . . . . . . . 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 2737	. . . . . 6 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((𝑡(.r‘𝑅)(((1st ‘𝑎)(.r‘𝑅)(2nd ‘𝑏))(-g‘𝑅)((1st ‘𝑏)(.r‘𝑅)(2nd ‘𝑎)))) = (0g‘𝑅) ↔ (𝑡(.r‘𝑅)(((1st ‘𝑈)(.r‘𝑅)(2nd ‘𝑉))(-g‘𝑅)((1st ‘𝑉)(.r‘𝑅)(2nd ‘𝑈)))) = (0g‘𝑅)))
23	22	rexbidv 3177	. . . . 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 32627	. . 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 1537   ∈ wcel 2106  ∃wrex 3068   ⊆ wss 3963   class class class wbr 5148  {copab 5210   × cxp 5687  ‘cfv 6563  (class class class)co 7431  1^st c1st 8011  2^nd c2nd 8012  Basecbs 17245  ._rcmulr 17299  0_gc0g 17486  -_gcsg 18966   ~_RL cerl 33240

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fun 6565  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-erl 33242

This theorem is referenced by:  rlocaddval  33255  rlocmulval  33256