Theorem erld2 33499

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

Hypotheses

Ref	Expression
erld2.b	⊢ 𝐵 = (Base‘𝑅)
erld2.e	⊢ ∼ = (𝑅 ~RL 𝑆)
erld2.t	⊢ · = (.r‘𝑅)
erld2.r	⊢ (𝜑 → 𝑅 ∈ CRing)
erld2.s	⊢ (𝜑 → 𝑆 ∈ (SubMnd‘(mulGrp‘𝑅)))
erld2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
erld2.y	⊢ (𝜑 → 𝑌 ∈ 𝑆)
erld2.z	⊢ (𝜑 → 𝑍 ∈ 𝐵)
erld2.w	⊢ (𝜑 → 𝑊 ∈ 𝑆)
erld2.1	⊢ (𝜑 → [⟨𝑋, 𝑌⟩] ∼ = [⟨𝑍, 𝑊⟩] ∼ )

Assertion

Ref	Expression
erld2	⊢ (𝜑 → ∃𝑡 ∈ 𝑆 (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌)))

Distinct variable groups:   𝑡, ·   𝑡,𝐵   𝑡,𝑅   𝑡,𝑆   𝑡,𝑊   𝑡,𝑋   𝑡,𝑌   𝑡,𝑍   𝜑,𝑡

Allowed substitution hint:   ∼ (𝑡)

Proof of Theorem erld2

Step	Hyp	Ref	Expression
1		erld2.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
2		erld2.e	. . 3 ⊢ ∼ = (𝑅 ~RL 𝑆)
3		erld2.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubMnd‘(mulGrp‘𝑅)))
4		eqid 2765	. . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
5	4, 1	mgpbas 20212	. . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅))
6	5	submss 18857	. . . 4 ⊢ (𝑆 ∈ (SubMnd‘(mulGrp‘𝑅)) → 𝑆 ⊆ 𝐵)
7	3, 6	syl 18	. . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
8		eqid 2765	. . 3 ⊢ (0g‘𝑅) = (0g‘𝑅)
9		erld2.t	. . 3 ⊢ · = (.r‘𝑅)
10		eqid 2765	. . 3 ⊢ (-g‘𝑅) = (-g‘𝑅)
11		erld2.1	. . . 4 ⊢ (𝜑 → [⟨𝑋, 𝑌⟩] ∼ = [⟨𝑍, 𝑊⟩] ∼ )
12		eqid 2765	. . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅)
13		eqid 2765	. . . . . 6 ⊢ (𝐵 × 𝑆) = (𝐵 × 𝑆)
14		erld2.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ CRing)
15	1, 8, 12, 9, 10, 13, 2, 14, 3	erler 33498	. . . . 5 ⊢ (𝜑 → ∼ Er (𝐵 × 𝑆))
16		erld2.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
17		erld2.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
18	16, 17	opelxpd 5691	. . . . 5 ⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝑆))
19	15, 18	erth 8737	. . . 4 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∼ ⟨𝑍, 𝑊⟩ ↔ [⟨𝑋, 𝑌⟩] ∼ = [⟨𝑍, 𝑊⟩] ∼ ))
20	11, 19	mpbird 260	. . 3 ⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∼ ⟨𝑍, 𝑊⟩)
21	1, 2, 7, 8, 9, 10, 20	erldi 33495	. 2 ⊢ (𝜑 → ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅))
22	14	crngringd 20319	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Ring)
23	22	ringgrpd 20315	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Grp)
24	23	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → 𝑅 ∈ Grp)
25	22	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → 𝑅 ∈ Ring)
26	25	adantr 485	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → 𝑅 ∈ Ring)
27	7	sselda 3939	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → 𝑡 ∈ 𝐵)
28	27	adantr 485	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → 𝑡 ∈ 𝐵)
29		erld2.w	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ 𝑆)
30	7, 29	sseldd 3940	. . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ 𝐵)
31	1, 9, 22, 16, 30	ringcld 20333	. . . . . . . 8 ⊢ (𝜑 → (𝑋 · 𝑊) ∈ 𝐵)
32	31	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → (𝑋 · 𝑊) ∈ 𝐵)
33	32	adantr 485	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → (𝑋 · 𝑊) ∈ 𝐵)
34	1, 9, 26, 28, 33	ringcld 20333	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → (𝑡 · (𝑋 · 𝑊)) ∈ 𝐵)
35		erld2.z	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
36	7, 17	sseldd 3940	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
37	1, 9, 22, 35, 36	ringcld 20333	. . . . . . . 8 ⊢ (𝜑 → (𝑍 · 𝑌) ∈ 𝐵)
38	37	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → (𝑍 · 𝑌) ∈ 𝐵)
39	38	adantr 485	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → (𝑍 · 𝑌) ∈ 𝐵)
40	1, 9, 26, 28, 39	ringcld 20333	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → (𝑡 · (𝑍 · 𝑌)) ∈ 𝐵)
41		op1stg 7986	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑆) → (1st ‘⟨𝑋, 𝑌⟩) = 𝑋)
42	16, 17, 41	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (1st ‘⟨𝑋, 𝑌⟩) = 𝑋)
43		op2ndg 7987	. . . . . . . . . . . . 13 ⊢ ((𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝑆) → (2nd ‘⟨𝑍, 𝑊⟩) = 𝑊)
44	35, 29, 43	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (2nd ‘⟨𝑍, 𝑊⟩) = 𝑊)
45	42, 44	oveq12d 7418	. . . . . . . . . . 11 ⊢ (𝜑 → ((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩)) = (𝑋 · 𝑊))
46		op1stg 7986	. . . . . . . . . . . . 13 ⊢ ((𝑍 ∈ 𝐵 ∧ 𝑊 ∈ 𝑆) → (1st ‘⟨𝑍, 𝑊⟩) = 𝑍)
47	35, 29, 46	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (1st ‘⟨𝑍, 𝑊⟩) = 𝑍)
48		op2ndg 7987	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑆) → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
49	16, 17, 48	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (2nd ‘⟨𝑋, 𝑌⟩) = 𝑌)
50	47, 49	oveq12d 7418	. . . . . . . . . . 11 ⊢ (𝜑 → ((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)) = (𝑍 · 𝑌))
51	45, 50	oveq12d 7418	. . . . . . . . . 10 ⊢ (𝜑 → (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩))) = ((𝑋 · 𝑊)(-g‘𝑅)(𝑍 · 𝑌)))
52	51	oveq2d 7416	. . . . . . . . 9 ⊢ (𝜑 → (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (𝑡 · ((𝑋 · 𝑊)(-g‘𝑅)(𝑍 · 𝑌))))
53	52	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (𝑡 · ((𝑋 · 𝑊)(-g‘𝑅)(𝑍 · 𝑌))))
54	1, 9, 10, 25, 27, 32, 38	ringsubdi 20381	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → (𝑡 · ((𝑋 · 𝑊)(-g‘𝑅)(𝑍 · 𝑌))) = ((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))))
55	53, 54	eqtrd 2800	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = ((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))))
56	55	eqeq1d 2767	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → ((𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅) ↔ ((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))) = (0g‘𝑅)))
57	56	biimpa 481	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → ((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))) = (0g‘𝑅))
58	1, 8, 10	grpsubeq0 19083	. . . . . 6 ⊢ ((𝑅 ∈ Grp ∧ (𝑡 · (𝑋 · 𝑊)) ∈ 𝐵 ∧ (𝑡 · (𝑍 · 𝑌)) ∈ 𝐵) → (((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))) = (0g‘𝑅) ↔ (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌))))
59	58	biimpa 481	. . . . 5 ⊢ (((𝑅 ∈ Grp ∧ (𝑡 · (𝑋 · 𝑊)) ∈ 𝐵 ∧ (𝑡 · (𝑍 · 𝑌)) ∈ 𝐵) ∧ ((𝑡 · (𝑋 · 𝑊))(-g‘𝑅)(𝑡 · (𝑍 · 𝑌))) = (0g‘𝑅)) → (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌)))
60	24, 34, 40, 57, 59	syl31anc 1396	. . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑆) ∧ (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅)) → (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌)))
61	60	ex 417	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑆) → ((𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅) → (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌))))
62	61	reximdva 3178	. 2 ⊢ (𝜑 → (∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘⟨𝑋, 𝑌⟩) · (2nd ‘⟨𝑍, 𝑊⟩))(-g‘𝑅)((1st ‘⟨𝑍, 𝑊⟩) · (2nd ‘⟨𝑋, 𝑌⟩)))) = (0g‘𝑅) → ∃𝑡 ∈ 𝑆 (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌))))
63	21, 62	mpd 16	1 ⊢ (𝜑 → ∃𝑡 ∈ 𝑆 (𝑡 · (𝑋 · 𝑊)) = (𝑡 · (𝑍 · 𝑌)))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  ∃wrex 3089   ⊆ wss 3907  ⟨cop 4591   class class class wbr 5105   × cxp 5650  ‘cfv 6525  (class class class)co 7400  1^st c1st 7972  2^nd c2nd 7973  [cec 8680  Basecbs 17259  ._rcmulr 17301  0_gc0g 17482  SubMndcsubmnd 18830  Grpcgrp 18990  -_gcsg 18992  mulGrpcmgp 20207  1_rcur 20254  Ringcrg 20306  CRingccrg 20307   ~_RL cerl 33486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-ec 8684  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-nn 12225  df-2 12294  df-sets 17214  df-slot 17232  df-ndx 17244  df-base 17260  df-ress 17281  df-plusg 17313  df-0g 17484  df-mgm 18688  df-sgrp 18767  df-mnd 18783  df-submnd 18832  df-grp 18993  df-minusg 18994  df-sbg 18995  df-cmn 19843  df-abl 19844  df-mgp 20208  df-rng 20222  df-ur 20255  df-ring 20308  df-cring 20309  df-erl 33488

This theorem is referenced by:  rlocisunit  33509