reldmrloc - Mathbox for Thierry Arnoux

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

Theorem reldmrloc 33917

Description: Ring localization is a proper operator, so it can be used with ovprc1 7490. (Contributed by Thierry Arnoux, 10-May-2025.)

**Assertion**
Ref	Expression
reldmrloc	⊢ Rel dom RLocal

Proof of Theorem reldmrloc Dummy variables 𝑎 𝑏 𝑘 𝑟 𝑠 𝑤 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rloc 33916	. 2 ⊢ RLocal = (𝑟 ∈ V, 𝑠 ∈ V ↦ ⦋(._r‘𝑟) / 𝑥⦌⦋((Base‘𝑟) × 𝑠) / 𝑤⦌((({⟨(Base‘ndx), 𝑤⟩, ⟨(+_g‘ndx), (𝑎 ∈ 𝑤, 𝑏 ∈ 𝑤 ↦ ⟨(((1^st ‘𝑎)𝑥(2^nd ‘𝑏))(+_g‘𝑟)((1^st ‘𝑏)𝑥(2^nd ‘𝑎))), ((2^nd ‘𝑎)𝑥(2^nd ‘𝑏))⟩)⟩, ⟨(._r‘ndx), (𝑎 ∈ 𝑤, 𝑏 ∈ 𝑤 ↦ ⟨((1^st ‘𝑎)𝑥(1^st ‘𝑏)), ((2^nd ‘𝑎)𝑥(2^nd ‘𝑏))⟩)⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑟)⟩, ⟨( ·_𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑟)), 𝑎 ∈ 𝑤 ↦ ⟨(𝑘( ·_𝑠 ‘𝑟)(1^st ‘𝑎)), (2^nd ‘𝑎)⟩)⟩, ⟨(·_𝑖‘ndx), ∅⟩}) ∪ {⟨(TopSet‘ndx), ((TopSet‘𝑟) ×_t ((TopSet‘𝑟) ↾_t 𝑠))⟩, ⟨(le‘ndx), {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ((1^st ‘𝑎)𝑥(2^nd ‘𝑏))(le‘𝑟)((1^st ‘𝑏)𝑥(2^nd ‘𝑎)))}⟩, ⟨(dist‘ndx), (𝑎 ∈ 𝑤, 𝑏 ∈ 𝑤 ↦ (((1^st ‘𝑎)𝑥(2^nd ‘𝑏))(dist‘𝑟)((1^st ‘𝑏)𝑥(2^nd ‘𝑎))))⟩}) /_s (𝑟 ~_RL 𝑠)))
2	1	reldmmpo 7584	1 ⊢ Rel dom RLocal

Colors of variables: wff setvar class

This proof depends on syntax axioms: ∧ wa 401 ∈ wcel 2147 Vcvv 3454 ⦋csb 3851 ∪ cun 4152 ∅c0 4281 {ctp 4592 ⟨cop 4840 class class class wbr 5108 {copab 5173 × cxp 5656 dom cdm 5658 Rel wrel 5663 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 1^st c1st 8033 2^nd c2nd 8034 ndxcnx 17415 Basecbs 17431 +_gcplusg 17472 ._rcmulr 17473 Scalarcsca 17475 ·_𝑠 cvsca 17476 ·_𝑖cip 17477 TopSetcts 17478 lecple 17479 distcds 17481 ↾_t crest 17641 /_s cqus 17727 ×_t ctx 23934 ~_RL cerl 33913 RLocal crloc 33914

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-pr 5398

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-dm 5668 df-oprab 7455 df-mpo 7456 df-rloc 33916

This theorem is used by: fracval 33970

W3C validator