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

Theorem isrrext 34031
Description: Express the property "𝑅 is an extension of ". (Contributed by Thierry Arnoux, 2-May-2018.)
Hypotheses
Ref Expression
isrrext.b 𝐵 = (Base‘𝑅)
isrrext.v 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
isrrext.z 𝑍 = (ℤMod‘𝑅)
Assertion
Ref Expression
isrrext (𝑅 ∈ ℝExt ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))

Proof of Theorem isrrext
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 elin 3942 . . 3 (𝑅 ∈ (NrmRing ∩ DivRing) ↔ (𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing))
21anbi1i 624 . 2 ((𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
3 fveq2 6876 . . . . . . 7 (𝑟 = 𝑅 → (ℤMod‘𝑟) = (ℤMod‘𝑅))
43eleq1d 2819 . . . . . 6 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod))
5 isrrext.z . . . . . . 7 𝑍 = (ℤMod‘𝑅)
65eleq1i 2825 . . . . . 6 (𝑍 ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod)
74, 6bitr4di 289 . . . . 5 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ 𝑍 ∈ NrmMod))
8 fveqeq2 6885 . . . . 5 (𝑟 = 𝑅 → ((chr‘𝑟) = 0 ↔ (chr‘𝑅) = 0))
97, 8anbi12d 632 . . . 4 (𝑟 = 𝑅 → (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ↔ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0)))
10 eleq1 2822 . . . . 5 (𝑟 = 𝑅 → (𝑟 ∈ CUnifSp ↔ 𝑅 ∈ CUnifSp))
11 fveq2 6876 . . . . . 6 (𝑟 = 𝑅 → (UnifSt‘𝑟) = (UnifSt‘𝑅))
12 fveq2 6876 . . . . . . . . 9 (𝑟 = 𝑅 → (dist‘𝑟) = (dist‘𝑅))
13 fveq2 6876 . . . . . . . . . . 11 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
14 isrrext.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
1513, 14eqtr4di 2788 . . . . . . . . . 10 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
1615sqxpeqd 5686 . . . . . . . . 9 (𝑟 = 𝑅 → ((Base‘𝑟) × (Base‘𝑟)) = (𝐵 × 𝐵))
1712, 16reseq12d 5967 . . . . . . . 8 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = ((dist‘𝑅) ↾ (𝐵 × 𝐵)))
18 isrrext.v . . . . . . . 8 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
1917, 18eqtr4di 2788 . . . . . . 7 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = 𝐷)
2019fveq2d 6880 . . . . . 6 (𝑟 = 𝑅 → (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) = (metUnif‘𝐷))
2111, 20eqeq12d 2751 . . . . 5 (𝑟 = 𝑅 → ((UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) ↔ (UnifSt‘𝑅) = (metUnif‘𝐷)))
2210, 21anbi12d 632 . . . 4 (𝑟 = 𝑅 → ((𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))) ↔ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
239, 22anbi12d 632 . . 3 (𝑟 = 𝑅 → ((((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))))) ↔ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
24 df-rrext 34030 . . 3 ℝExt = {𝑟 ∈ (NrmRing ∩ DivRing) ∣ (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))))}
2523, 24elrab2 3674 . 2 (𝑅 ∈ ℝExt ↔ (𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
26 3anass 1094 . 2 (((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
272, 25, 263bitr4i 303 1 (𝑅 ∈ ℝExt ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2108  cin 3925   × cxp 5652  cres 5656  cfv 6531  0cc0 11129  Basecbs 17228  distcds 17280  DivRingcdr 20689  metUnifcmetu 21306  ℤModczlm 21461  chrcchr 21462  UnifStcuss 24192  CUnifSpccusp 24235  NrmRingcnrg 24518  NrmModcnlm 24519   ℝExt crrext 34025
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-xp 5660  df-res 5666  df-iota 6484  df-fv 6539  df-rrext 34030
This theorem is referenced by:  rrextnrg  34032  rrextdrg  34033  rrextnlm  34034  rrextchr  34035  rrextcusp  34036  rrextust  34039  rerrext  34040  cnrrext  34041
  Copyright terms: Public domain W3C validator