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 34335
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 3929 . . 3 (𝑅 ∈ (NrmRing ∩ DivRing) ↔ (𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing))
21anbi1i 635 . 2 ((𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
3 fveq2 6882 . . . . . . 7 (𝑟 = 𝑅 → (ℤMod‘𝑟) = (ℤMod‘𝑅))
43eleq1d 2854 . . . . . 6 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod))
5 isrrext.z . . . . . . 7 𝑍 = (ℤMod‘𝑅)
65eleq1i 2860 . . . . . 6 (𝑍 ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod)
74, 6bitr4di 292 . . . . 5 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ 𝑍 ∈ NrmMod))
8 fveqeq2 6891 . . . . 5 (𝑟 = 𝑅 → ((chr‘𝑟) = 0 ↔ (chr‘𝑅) = 0))
97, 8anbi12d 643 . . . 4 (𝑟 = 𝑅 → (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ↔ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0)))
10 eleq1 2857 . . . . 5 (𝑟 = 𝑅 → (𝑟 ∈ CUnifSp ↔ 𝑅 ∈ CUnifSp))
11 fveq2 6882 . . . . . 6 (𝑟 = 𝑅 → (UnifSt‘𝑟) = (UnifSt‘𝑅))
12 fveq2 6882 . . . . . . . . 9 (𝑟 = 𝑅 → (dist‘𝑟) = (dist‘𝑅))
13 fveq2 6882 . . . . . . . . . . 11 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
14 isrrext.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
1513, 14eqtr4di 2822 . . . . . . . . . 10 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
1615sqxpeqd 5694 . . . . . . . . 9 (𝑟 = 𝑅 → ((Base‘𝑟) × (Base‘𝑟)) = (𝐵 × 𝐵))
1712, 16reseq12d 5980 . . . . . . . 8 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = ((dist‘𝑅) ↾ (𝐵 × 𝐵)))
18 isrrext.v . . . . . . . 8 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
1917, 18eqtr4di 2822 . . . . . . 7 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = 𝐷)
2019fveq2d 6886 . . . . . 6 (𝑟 = 𝑅 → (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) = (metUnif‘𝐷))
2111, 20eqeq12d 2785 . . . . 5 (𝑟 = 𝑅 → ((UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) ↔ (UnifSt‘𝑅) = (metUnif‘𝐷)))
2210, 21anbi12d 643 . . . 4 (𝑟 = 𝑅 → ((𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))) ↔ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
239, 22anbi12d 643 . . 3 (𝑟 = 𝑅 → ((((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))))) ↔ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
24 df-rrext 34334 . . 3 ℝExt = {𝑟 ∈ (NrmRing ∩ DivRing) ∣ (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))))}
2523, 24elrab2 3663 . 2 (𝑅 ∈ ℝExt ↔ (𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
26 3anass 1109 . 2 (((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
272, 25, 263bitr4i 306 1 (𝑅 ∈ ℝExt ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  cin 3912   × cxp 5660  cres 5664  cfv 6537  0cc0 11100  Basecbs 17269  distcds 17319  DivRingcdr 20813  metUnifcmetu 21482  ℤModczlm 21619  chrcchr 21620  UnifStcuss 24379  CUnifSpccusp 24422  NrmRingcnrg 24705  NrmModcnlm 24706   ℝExt crrext 34329
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-xp 5668  df-res 5674  df-iota 6493  df-fv 6545  df-rrext 34334
This theorem is referenced by:  rrextnrg  34336  rrextdrg  34337  rrextnlm  34338  rrextchr  34339  rrextcusp  34340  rrextust  34343  rerrext  34344  cnrrext  34345
  Copyright terms: Public domain W3C validator