Theorem erldi 33293

Description: Main property of the ring localization equivalence relation. (Contributed by Thierry Arnoux, 4-May-2025.)

Hypotheses

Ref	Expression
erlcl1.b	⊢ 𝐵 = (Base‘𝑅)
erlcl1.e	⊢ ∼ = (𝑅 ~RL 𝑆)
erlcl1.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
erldi.1	⊢ 0 = (0g‘𝑅)
erldi.2	⊢ · = (.r‘𝑅)
erldi.3	⊢ − = (-g‘𝑅)
erldi.4	⊢ (𝜑 → 𝑈 ∼ 𝑉)

Assertion

Ref	Expression
erldi	⊢ (𝜑 → ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 )

Distinct variable groups:   𝑡, ·   𝑡,𝐵   𝑡,𝑅   𝑡,𝑆   𝑡,𝑈   𝑡,𝑉

Allowed substitution hints:   𝜑(𝑡)   ∼ (𝑡)   − (𝑡)   0 (𝑡)

Proof of Theorem erldi

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

Step	Hyp	Ref	Expression
1		erldi.4	. . 3 ⊢ (𝜑 → 𝑈 ∼ 𝑉)
2		erlcl1.e	. . . . 5 ⊢ ∼ = (𝑅 ~RL 𝑆)
3		erlcl1.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
4		erldi.1	. . . . . 6 ⊢ 0 = (0g‘𝑅)
5		erldi.2	. . . . . 6 ⊢ · = (.r‘𝑅)
6		erldi.3	. . . . . 6 ⊢ − = (-g‘𝑅)
7		eqid 2734	. . . . . 6 ⊢ (𝐵 × 𝑆) = (𝐵 × 𝑆)
8		eqid 2734	. . . . . 6 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )}
9		erlcl1.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
10	3, 4, 5, 6, 7, 8, 9	erlval 33289	. . . . 5 ⊢ (𝜑 → (𝑅 ~RL 𝑆) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )})
11	2, 10	eqtrid 2781	. . . 4 ⊢ (𝜑 → ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝐵 × 𝑆) ∧ 𝑏 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )})
12		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑎 = 𝑈)
13	12	fveq2d 6836	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑎) = (1st ‘𝑈))
14		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → 𝑏 = 𝑉)
15	14	fveq2d 6836	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (2nd ‘𝑏) = (2nd ‘𝑉))
16	13, 15	oveq12d 7374	. . . . . . . . 9 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((1st ‘𝑎) · (2nd ‘𝑏)) = ((1st ‘𝑈) · (2nd ‘𝑉)))
17	14	fveq2d 6836	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (1st ‘𝑏) = (1st ‘𝑉))
18	12	fveq2d 6836	. . . . . . . . . 10 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (2nd ‘𝑎) = (2nd ‘𝑈))
19	17, 18	oveq12d 7374	. . . . . . . . 9 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((1st ‘𝑏) · (2nd ‘𝑎)) = ((1st ‘𝑉) · (2nd ‘𝑈)))
20	16, 19	oveq12d 7374	. . . . . . . 8 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎))) = (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈))))
21	20	oveq2d 7372	. . . . . . 7 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))))
22	21	eqeq1d 2736	. . . . . 6 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → ((𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 ↔ (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 ))
23	22	rexbidv 3158	. . . . 5 ⊢ ((𝑎 = 𝑈 ∧ 𝑏 = 𝑉) → (∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 ↔ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 ))
24	23	adantl 481	. . . 4 ⊢ ((𝜑 ∧ (𝑎 = 𝑈 ∧ 𝑏 = 𝑉)) → (∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 ↔ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 ))
25	11, 24	brab2d 32632	. . 3 ⊢ (𝜑 → (𝑈 ∼ 𝑉 ↔ ((𝑈 ∈ (𝐵 × 𝑆) ∧ 𝑉 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 )))
26	1, 25	mpbid 232	. 2 ⊢ (𝜑 → ((𝑈 ∈ (𝐵 × 𝑆) ∧ 𝑉 ∈ (𝐵 × 𝑆)) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 ))
27	26	simprd 495	1 ⊢ (𝜑 → ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑈) · (2nd ‘𝑉)) − ((1st ‘𝑉) · (2nd ‘𝑈)))) = 0 )

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∃wrex 3058   ⊆ wss 3899   class class class wbr 5096  {copab 5158   × cxp 5620  ‘cfv 6490  (class class class)co 7356  1^st c1st 7929  2^nd c2nd 7930  Basecbs 17134  ._rcmulr 17176  0_gc0g 17357  -_gcsg 18863   ~_RL cerl 33284

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-erl 33286

This theorem is referenced by:  rlocaddval  33299  rlocmulval  33300  rlocf1  33304  fracfld  33339