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 33871

Description: Ring localization is a proper operator, so it can be used with ovprc1 7466. (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 33870	. 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 7561	1 ⊢ Rel dom RLocal

Colors of variables: wff setvar class

This proof depends on syntax axioms: ∧ wa 401 ∈ wcel 2146 Vcvv 3453 ⦋csb 3850 ∪ cun 4151 ∅c0 4280 {ctp 4591 ⟨cop 4837 class class class wbr 5105 {copab 5169 × cxp 5652 dom cdm 5654 Rel wrel 5659 ‘cfv 6546 (class class class)co 7427 ∈ cmpo 7429 1^st c1st 8006 2^nd c2nd 8007 ndxcnx 17383 Basecbs 17399 +_gcplusg 17440 ._rcmulr 17441 Scalarcsca 17443 ·_𝑠 cvsca 17444 ·_𝑖cip 17445 TopSetcts 17446 lecple 17447 distcds 17449 ↾_t crest 17603 /_s cqus 17689 ×_t ctx 23891 ~_RL cerl 33867 RLocal crloc 33868

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-pr 5394

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-br 5106 df-opab 5170 df-xp 5660 df-rel 5661 df-dm 5664 df-oprab 7431 df-mpo 7432 df-rloc 33870

This theorem is used by: fracval 33919

W3C validator