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 33435
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 3956 . . 3 (𝑅 ∈ (NrmRing ∩ DivRing) ↔ (𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing))
21anbi1i 623 . 2 ((𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
3 fveq2 6881 . . . . . . 7 (𝑟 = 𝑅 → (ℤMod‘𝑟) = (ℤMod‘𝑅))
43eleq1d 2810 . . . . . 6 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod))
5 isrrext.z . . . . . . 7 𝑍 = (ℤMod‘𝑅)
65eleq1i 2816 . . . . . 6 (𝑍 ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod)
74, 6bitr4di 289 . . . . 5 (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ 𝑍 ∈ NrmMod))
8 fveqeq2 6890 . . . . 5 (𝑟 = 𝑅 → ((chr‘𝑟) = 0 ↔ (chr‘𝑅) = 0))
97, 8anbi12d 630 . . . 4 (𝑟 = 𝑅 → (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ↔ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0)))
10 eleq1 2813 . . . . 5 (𝑟 = 𝑅 → (𝑟 ∈ CUnifSp ↔ 𝑅 ∈ CUnifSp))
11 fveq2 6881 . . . . . 6 (𝑟 = 𝑅 → (UnifSt‘𝑟) = (UnifSt‘𝑅))
12 fveq2 6881 . . . . . . . . 9 (𝑟 = 𝑅 → (dist‘𝑟) = (dist‘𝑅))
13 fveq2 6881 . . . . . . . . . . 11 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
14 isrrext.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
1513, 14eqtr4di 2782 . . . . . . . . . 10 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
1615sqxpeqd 5698 . . . . . . . . 9 (𝑟 = 𝑅 → ((Base‘𝑟) × (Base‘𝑟)) = (𝐵 × 𝐵))
1712, 16reseq12d 5972 . . . . . . . 8 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = ((dist‘𝑅) ↾ (𝐵 × 𝐵)))
18 isrrext.v . . . . . . . 8 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
1917, 18eqtr4di 2782 . . . . . . 7 (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = 𝐷)
2019fveq2d 6885 . . . . . 6 (𝑟 = 𝑅 → (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) = (metUnif‘𝐷))
2111, 20eqeq12d 2740 . . . . 5 (𝑟 = 𝑅 → ((UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) ↔ (UnifSt‘𝑅) = (metUnif‘𝐷)))
2210, 21anbi12d 630 . . . 4 (𝑟 = 𝑅 → ((𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))) ↔ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
239, 22anbi12d 630 . . 3 (𝑟 = 𝑅 → ((((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))))) ↔ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
24 df-rrext 33434 . . 3 ℝExt = {𝑟 ∈ (NrmRing ∩ DivRing) ∣ (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))))}
2523, 24elrab2 3678 . 2 (𝑅 ∈ ℝExt ↔ (𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
26 3anass 1092 . 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 205  wa 395  w3a 1084   = wceq 1533  wcel 2098  cin 3939   × cxp 5664  cres 5668  cfv 6533  0cc0 11105  Basecbs 17140  distcds 17202  DivRingcdr 20572  metUnifcmetu 21214  ℤModczlm 21350  chrcchr 21351  UnifStcuss 24068  CUnifSpccusp 24112  NrmRingcnrg 24398  NrmModcnlm 24399   ℝExt crrext 33429
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2695
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2702  df-cleq 2716  df-clel 2802  df-rab 3425  df-v 3468  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-br 5139  df-opab 5201  df-xp 5672  df-res 5678  df-iota 6485  df-fv 6541  df-rrext 33434
This theorem is referenced by:  rrextnrg  33436  rrextdrg  33437  rrextnlm  33438  rrextchr  33439  rrextcusp  33440  rrextust  33443  rerrext  33444  cnrrext  33445
  Copyright terms: Public domain W3C validator