Theorem rrextust 34751

Description: The uniformity of an extension of ℝ is the uniformity generated by its distance. (Contributed by Thierry Arnoux, 2-May-2018.)

Hypotheses

Ref	Expression
rrextust.b	⊢ 𝐵 = (Base‘𝑅)
rrextust.d	⊢ 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))

Assertion

Ref	Expression
rrextust	⊢ (𝑅 ∈ ℝExt → (UnifSt‘𝑅) = (metUnif‘𝐷))

Proof of Theorem rrextust

Step	Hyp	Ref	Expression
1		rrextust.b	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
2		rrextust.d	. . . 4 ⊢ 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
3		eqid 2763	. . . 4 ⊢ (ℤMod‘𝑅) = (ℤMod‘𝑅)
4	1, 2, 3	isrrext 34743	. . 3 ⊢ (𝑅 ∈ ℝExt ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((ℤMod‘𝑅) ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
5	4	simp3bi 1165	. 2 ⊢ (𝑅 ∈ ℝExt → (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))
6	5	simprd 501	1 ⊢ (𝑅 ∈ ℝExt → (UnifSt‘𝑅) = (metUnif‘𝐷))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   × cxp 5656   ↾ cres 5660  ‘cfv 6566  0cc0 11239  Basecbs 17431  distcds 17481  DivRingcdr 21031  metUnifcmetu 21720  ℤModczlm 21861  chrcchr 21862  UnifStcuss 24627  CUnifSpccusp 24670  NrmRingcnrg 24953  NrmModcnlm 24954   ℝExt crrext 34737

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-res 5670  df-iota 6520  df-fv 6574  df-rrext 34742

This theorem is used by:  rrhfe  34755  rrhcne  34756  sitgclg  35085