Theorem isrrext 34458

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.

Step	Hyp	Ref	Expression
1		elin 3922	. . 3 ⊢ (𝑅 ∈ (NrmRing ∩ DivRing) ↔ (𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing))
2	1	anbi1i 636	. 2 ⊢ ((𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
3		fveq2 6885	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (ℤMod‘𝑟) = (ℤMod‘𝑅))
4	3	eleq1d 2850	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod))
5		isrrext.z	. . . . . . 7 ⊢ 𝑍 = (ℤMod‘𝑅)
6	5	eleq1i 2856	. . . . . 6 ⊢ (𝑍 ∈ NrmMod ↔ (ℤMod‘𝑅) ∈ NrmMod)
7	4, 6	bitr4di 292	. . . . 5 ⊢ (𝑟 = 𝑅 → ((ℤMod‘𝑟) ∈ NrmMod ↔ 𝑍 ∈ NrmMod))
8		fveqeq2 6894	. . . . 5 ⊢ (𝑟 = 𝑅 → ((chr‘𝑟) = 0 ↔ (chr‘𝑅) = 0))
9	7, 8	anbi12d 644	. . . 4 ⊢ (𝑟 = 𝑅 → (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ↔ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0)))
10		eleq1 2853	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑟 ∈ CUnifSp ↔ 𝑅 ∈ CUnifSp))
11		fveq2 6885	. . . . . 6 ⊢ (𝑟 = 𝑅 → (UnifSt‘𝑟) = (UnifSt‘𝑅))
12		fveq2 6885	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (dist‘𝑟) = (dist‘𝑅))
13		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
14		isrrext.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
15	13, 14	eqtr4di 2818	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
16	15	sqxpeqd 5695	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((Base‘𝑟) × (Base‘𝑟)) = (𝐵 × 𝐵))
17	12, 16	reseq12d 5981	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = ((dist‘𝑅) ↾ (𝐵 × 𝐵)))
18		isrrext.v	. . . . . . . 8 ⊢ 𝐷 = ((dist‘𝑅) ↾ (𝐵 × 𝐵))
19	17, 18	eqtr4di 2818	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))) = 𝐷)
20	19	fveq2d 6889	. . . . . 6 ⊢ (𝑟 = 𝑅 → (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) = (metUnif‘𝐷))
21	11, 20	eqeq12d 2781	. . . . 5 ⊢ (𝑟 = 𝑅 → ((UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))) ↔ (UnifSt‘𝑅) = (metUnif‘𝐷)))
22	10, 21	anbi12d 644	. . . 4 ⊢ (𝑟 = 𝑅 → ((𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))) ↔ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))
23	9, 22	anbi12d 644	. . 3 ⊢ (𝑟 = 𝑅 → ((((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟)))))) ↔ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
24		df-rrext 34457	. . 3 ⊢ ℝExt = {𝑟 ∈ (NrmRing ∩ DivRing) ∣ (((ℤMod‘𝑟) ∈ NrmMod ∧ (chr‘𝑟) = 0) ∧ (𝑟 ∈ CUnifSp ∧ (UnifSt‘𝑟) = (metUnif‘((dist‘𝑟) ↾ ((Base‘𝑟) × (Base‘𝑟))))))}
25	23, 24	elrab2 3656	. 2 ⊢ (𝑅 ∈ ℝExt ↔ (𝑅 ∈ (NrmRing ∩ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
26		3anass 1111	. 2 ⊢ (((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))) ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ ((𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷)))))
27	2, 25, 26	3bitr4i 306	1 ⊢ (𝑅 ∈ ℝExt ↔ ((𝑅 ∈ NrmRing ∧ 𝑅 ∈ DivRing) ∧ (𝑍 ∈ NrmMod ∧ (chr‘𝑅) = 0) ∧ (𝑅 ∈ CUnifSp ∧ (UnifSt‘𝑅) = (metUnif‘𝐷))))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ∩ cin 3905   × cxp 5661   ↾ cres 5665  ‘cfv 6540  0cc0 11119  Basecbs 17295  distcds 17345  DivRingcdr 20881  metUnifcmetu 21567  ℤModczlm 21704  chrcchr 21705  UnifStcuss 24465  CUnifSpccusp 24508  NrmRingcnrg 24791  NrmModcnlm 24792   ℝExt crrext 34452

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-res 5675  df-iota 6496  df-fv 6548  df-rrext 34457

This theorem is used by:  rrextnrg  34459  rrextdrg  34460  rrextnlm  34461  rrextchr  34462  rrextcusp  34463  rrextust  34466  rerrext  34467  cnrrext  34468