Metamath Proof Explorer


Theorem dya2icobrsiga

Description: Dyadic intervals are Borel sets of RR . (Contributed by Thierry Arnoux, 22-Sep-2017) (Revised by Thierry Arnoux, 13-Oct-2017)

Ref Expression
Hypotheses sxbrsiga.0 ⊢ J = topGen ⁡ ran ⁡ .
dya2ioc.1 ⊢ I = x ∈ ℤ , n ∈ ℤ ⟼ x 2 n x + 1 2 n
Assertion dya2icobrsiga ⊢ ran ⁡ I ⊆ 𝔅 ℝ

Proof

Step Hyp Ref Expression
1 sxbrsiga.0 ⊢ J = topGen ⁡ ran ⁡ .
2 dya2ioc.1 ⊢ I = x ∈ ℤ , n ∈ ℤ ⟼ x 2 n x + 1 2 n
3 ovex ⊢ x 2 n x + 1 2 n ∈ V
4 2 3 elrnmpo ⊢ d ∈ ran ⁡ I ↔ ∃ x ∈ ℤ ∃ n ∈ ℤ d = x 2 n x + 1 2 n
5 simpr ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → d = x 2 n x + 1 2 n
6 mnfxr ⊢ −∞ ∈ ℝ *
7 6 a1i ⊢ x ∈ ℤ ∧ n ∈ ℤ → −∞ ∈ ℝ *
8 simpl ⊢ x ∈ ℤ ∧ n ∈ ℤ → x ∈ ℤ
9 8 zred ⊢ x ∈ ℤ ∧ n ∈ ℤ → x ∈ ℝ
10 2rp ⊢ 2 ∈ ℝ +
11 10 a1i ⊢ x ∈ ℤ ∧ n ∈ ℤ → 2 ∈ ℝ +
12 simpr ⊢ x ∈ ℤ ∧ n ∈ ℤ → n ∈ ℤ
13 11 12 rpexpcld ⊢ x ∈ ℤ ∧ n ∈ ℤ → 2 n ∈ ℝ +
14 9 13 rerpdivcld ⊢ x ∈ ℤ ∧ n ∈ ℤ → x 2 n ∈ ℝ
15 14 rexrd ⊢ x ∈ ℤ ∧ n ∈ ℤ → x 2 n ∈ ℝ *
16 1red ⊢ x ∈ ℤ ∧ n ∈ ℤ → 1 ∈ ℝ
17 9 16 readdcld ⊢ x ∈ ℤ ∧ n ∈ ℤ → x + 1 ∈ ℝ
18 17 13 rerpdivcld ⊢ x ∈ ℤ ∧ n ∈ ℤ → x + 1 2 n ∈ ℝ
19 18 rexrd ⊢ x ∈ ℤ ∧ n ∈ ℤ → x + 1 2 n ∈ ℝ *
20 mnflt ⊢ x 2 n ∈ ℝ → −∞ < x 2 n
21 14 20 syl ⊢ x ∈ ℤ ∧ n ∈ ℤ → −∞ < x 2 n
22 difioo ⊢ −∞ ∈ ℝ * ∧ x 2 n ∈ ℝ * ∧ x + 1 2 n ∈ ℝ * ∧ −∞ < x 2 n → −∞ x + 1 2 n ∖ −∞ x 2 n = x 2 n x + 1 2 n
23 7 15 19 21 22 syl31anc ⊢ x ∈ ℤ ∧ n ∈ ℤ → −∞ x + 1 2 n ∖ −∞ x 2 n = x 2 n x + 1 2 n
24 brsigarn ⊢ 𝔅 ℝ ∈ sigAlgebra ⁡ ℝ
25 elrnsiga ⊢ 𝔅 ℝ ∈ sigAlgebra ⁡ ℝ → 𝔅 ℝ ∈ ⋃ ran ⁡ sigAlgebra
26 24 25 ax-mp ⊢ 𝔅 ℝ ∈ ⋃ ran ⁡ sigAlgebra
27 retop ⊢ topGen ⁡ ran ⁡ . ∈ Top
28 iooretop ⊢ −∞ x + 1 2 n ∈ topGen ⁡ ran ⁡ .
29 elsigagen ⊢ topGen ⁡ ran ⁡ . ∈ Top ∧ −∞ x + 1 2 n ∈ topGen ⁡ ran ⁡ . → −∞ x + 1 2 n ∈ 𝛔 ⁡ topGen ⁡ ran ⁡ .
30 27 28 29 mp2an ⊢ −∞ x + 1 2 n ∈ 𝛔 ⁡ topGen ⁡ ran ⁡ .
31 df-brsiga ⊢ 𝔅 ℝ = 𝛔 ⁡ topGen ⁡ ran ⁡ .
32 30 31 eleqtrri ⊢ −∞ x + 1 2 n ∈ 𝔅 ℝ
33 iooretop ⊢ −∞ x 2 n ∈ topGen ⁡ ran ⁡ .
34 elsigagen ⊢ topGen ⁡ ran ⁡ . ∈ Top ∧ −∞ x 2 n ∈ topGen ⁡ ran ⁡ . → −∞ x 2 n ∈ 𝛔 ⁡ topGen ⁡ ran ⁡ .
35 27 33 34 mp2an ⊢ −∞ x 2 n ∈ 𝛔 ⁡ topGen ⁡ ran ⁡ .
36 35 31 eleqtrri ⊢ −∞ x 2 n ∈ 𝔅 ℝ
37 difelsiga ⊢ 𝔅 ℝ ∈ ⋃ ran ⁡ sigAlgebra ∧ −∞ x + 1 2 n ∈ 𝔅 ℝ ∧ −∞ x 2 n ∈ 𝔅 ℝ → −∞ x + 1 2 n ∖ −∞ x 2 n ∈ 𝔅 ℝ
38 26 32 36 37 mp3an ⊢ −∞ x + 1 2 n ∖ −∞ x 2 n ∈ 𝔅 ℝ
39 23 38 eqeltrrdi ⊢ x ∈ ℤ ∧ n ∈ ℤ → x 2 n x + 1 2 n ∈ 𝔅 ℝ
40 39 adantr ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x 2 n x + 1 2 n ∈ 𝔅 ℝ
41 5 40 eqeltrd ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → d ∈ 𝔅 ℝ
42 41 ex ⊢ x ∈ ℤ ∧ n ∈ ℤ → d = x 2 n x + 1 2 n → d ∈ 𝔅 ℝ
43 42 rexlimivv ⊢ ∃ x ∈ ℤ ∃ n ∈ ℤ d = x 2 n x + 1 2 n → d ∈ 𝔅 ℝ
44 4 43 sylbi ⊢ d ∈ ran ⁡ I → d ∈ 𝔅 ℝ
45 44 ssriv ⊢ ran ⁡ I ⊆ 𝔅 ℝ