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 33973
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 3919 . . 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 6822 . . . . . . 7 (𝑟 = 𝑅 → (ℤMod‘𝑟) = (ℤMod‘𝑅))
43eleq1d 2813 . . . . . 6 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod))
5 isrrext.z . . . . . . 7 𝑍 = (ℤMod‘𝑅)
65eleq1i 2819 . . . . . 6 (𝑍 ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod)
74, 6bitr4di 289 . . . . 5 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ 𝑍 ∈ NrmMod))
8 fveqeq2 6831 . . . . 5 (𝑟 = 𝑅 → ((chr‘𝑟) = 0 ↔ (chr‘𝑅) = 0))
97, 8anbi12d 632 . . . 4 (𝑟 = 𝑅 → (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ↔ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0)))
10 eleq1 2816 . . . . 5 (𝑟 = 𝑅 → (𝑟 ∈ CUnifSp ↔ 𝑅 ∈ CUnifSp))
11 fveq2 6822 . . . . . 6 (𝑟 = 𝑅 → (UnifSt‘𝑟) = (UnifSt‘𝑅))
12 fveq2 6822 . . . . . . . . 9 (𝑟 = 𝑅 → (dist‘𝑟) = (dist‘𝑅))
13 fveq2 6822 . . . . . . . . . . 11 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
14 isrrext.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
1513, 14eqtr4di 2782 . . . . . . . . . 10 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
1615sqxpeqd 5651 . . . . . . . . 9 (𝑟 = 𝑅 → ((Base‘𝑟) × (Base‘𝑟)) = (𝐵 × 𝐵))
1712, 16reseq12d 5931 . . . . . . . 8 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = ((dist‘𝑅) ↾ (𝐵 × 𝐵)))
18 isrrext.v . . . . . . . 8 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
1917, 18eqtr4di 2782 . . . . . . 7 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = 𝐷)
2019fveq2d 6826 . . . . . 6 (𝑟 = 𝑅 → (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) = (metUnif‘𝐷))
2111, 20eqeq12d 2745 . . . . 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 33972 . . 3 ℝExt = {𝑟 ∈ (NrmRing ∩ DivRing) ∣ (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))))}
2523, 24elrab2 3651 . 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 2109  cin 3902   × cxp 5617  cres 5621  cfv 6482  0cc0 11009  Basecbs 17120  distcds 17170  DivRingcdr 20614  metUnifcmetu 21252  ℤModczlm 21407  chrcchr 21408  UnifStcuss 24139  CUnifSpccusp 24182  NrmRingcnrg 24465  NrmModcnlm 24466   ℝExt crrext 33967
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 2008  ax-8 2111  ax-9 2119  ax-ext 2701
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 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-xp 5625  df-res 5631  df-iota 6438  df-fv 6490  df-rrext 33972
This theorem is referenced by:  rrextnrg  33974  rrextdrg  33975  rrextnlm  33976  rrextchr  33977  rrextcusp  33978  rrextust  33981  rerrext  33982  cnrrext  33983
  Copyright terms: Public domain W3C validator