Metamath Proof Explorer


Theorem dya2iocucvr

Description: The dyadic rectangular set collection covers ( RR X. RR ) . (Contributed by Thierry Arnoux, 18-Sep-2017)

Ref Expression
Hypotheses sxbrsiga.0 ⊢ J = topGen ⁡ ran ⁡ .
dya2ioc.1 ⊢ I = x ∈ ℤ , n ∈ ℤ ⟼ x 2 n x + 1 2 n
dya2ioc.2 ⊢ R = u ∈ ran ⁡ I , v ∈ ran ⁡ I ⟼ u × v
Assertion dya2iocucvr ⊢ ⋃ ran ⁡ R = ℝ 2

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 dya2ioc.2 ⊢ R = u ∈ ran ⁡ I , v ∈ ran ⁡ I ⟼ u × v
4 unissb ⊢ ⋃ ran ⁡ R ⊆ ℝ 2 ↔ ∀ d ∈ ran ⁡ R d ⊆ ℝ 2
5 vex ⊢ u ∈ V
6 vex ⊢ v ∈ V
7 5 6 xpex ⊢ u × v ∈ V
8 3 7 elrnmpo ⊢ d ∈ ran ⁡ R ↔ ∃ u ∈ ran ⁡ I ∃ v ∈ ran ⁡ I d = u × v
9 simpr ⊢ u ∈ ran ⁡ I ∧ v ∈ ran ⁡ I ∧ d = u × v → d = u × v
10 pwssb ⊢ ran ⁡ I ⊆ 𝒫 ℝ ↔ ∀ d ∈ ran ⁡ I d ⊆ ℝ
11 ovex ⊢ x 2 n x + 1 2 n ∈ V
12 2 11 elrnmpo ⊢ d ∈ ran ⁡ I ↔ ∃ x ∈ ℤ ∃ n ∈ ℤ d = x 2 n x + 1 2 n
13 simpr ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → d = x 2 n x + 1 2 n
14 simpll ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x ∈ ℤ
15 14 zred ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x ∈ ℝ
16 2re ⊢ 2 ∈ ℝ
17 16 a1i ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 2 ∈ ℝ
18 2ne0 ⊢ 2 ≠ 0
19 18 a1i ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 2 ≠ 0
20 simplr ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → n ∈ ℤ
21 17 19 20 reexpclzd ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 2 n ∈ ℝ
22 2cnd ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 2 ∈ ℂ
23 22 19 20 expne0d ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 2 n ≠ 0
24 15 21 23 redivcld ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x 2 n ∈ ℝ
25 1red ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → 1 ∈ ℝ
26 15 25 readdcld ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x + 1 ∈ ℝ
27 26 21 23 redivcld ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x + 1 2 n ∈ ℝ
28 27 rexrd ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x + 1 2 n ∈ ℝ *
29 icossre ⊢ x 2 n ∈ ℝ ∧ x + 1 2 n ∈ ℝ * → x 2 n x + 1 2 n ⊆ ℝ
30 24 28 29 syl2anc ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → x 2 n x + 1 2 n ⊆ ℝ
31 13 30 eqsstrd ⊢ x ∈ ℤ ∧ n ∈ ℤ ∧ d = x 2 n x + 1 2 n → d ⊆ ℝ
32 31 ex ⊢ x ∈ ℤ ∧ n ∈ ℤ → d = x 2 n x + 1 2 n → d ⊆ ℝ
33 32 rexlimivv ⊢ ∃ x ∈ ℤ ∃ n ∈ ℤ d = x 2 n x + 1 2 n → d ⊆ ℝ
34 12 33 sylbi ⊢ d ∈ ran ⁡ I → d ⊆ ℝ
35 10 34 mprgbir ⊢ ran ⁡ I ⊆ 𝒫 ℝ
36 35 sseli ⊢ u ∈ ran ⁡ I → u ∈ 𝒫 ℝ
37 36 elpwid ⊢ u ∈ ran ⁡ I → u ⊆ ℝ
38 35 sseli ⊢ v ∈ ran ⁡ I → v ∈ 𝒫 ℝ
39 38 elpwid ⊢ v ∈ ran ⁡ I → v ⊆ ℝ
40 xpss12 ⊢ u ⊆ ℝ ∧ v ⊆ ℝ → u × v ⊆ ℝ 2
41 37 39 40 syl2an ⊢ u ∈ ran ⁡ I ∧ v ∈ ran ⁡ I → u × v ⊆ ℝ 2
42 41 adantr ⊢ u ∈ ran ⁡ I ∧ v ∈ ran ⁡ I ∧ d = u × v → u × v ⊆ ℝ 2
43 9 42 eqsstrd ⊢ u ∈ ran ⁡ I ∧ v ∈ ran ⁡ I ∧ d = u × v → d ⊆ ℝ 2
44 43 ex ⊢ u ∈ ran ⁡ I ∧ v ∈ ran ⁡ I → d = u × v → d ⊆ ℝ 2
45 44 rexlimivv ⊢ ∃ u ∈ ran ⁡ I ∃ v ∈ ran ⁡ I d = u × v → d ⊆ ℝ 2
46 8 45 sylbi ⊢ d ∈ ran ⁡ R → d ⊆ ℝ 2
47 4 46 mprgbir ⊢ ⋃ ran ⁡ R ⊆ ℝ 2
48 retop ⊢ topGen ⁡ ran ⁡ . ∈ Top
49 1 48 eqeltri ⊢ J ∈ Top
50 49 49 txtopi ⊢ J × t J ∈ Top
51 uniretop ⊢ ℝ = ⋃ topGen ⁡ ran ⁡ .
52 1 unieqi ⊢ ⋃ J = ⋃ topGen ⁡ ran ⁡ .
53 51 52 eqtr4i ⊢ ℝ = ⋃ J
54 49 49 53 53 txunii ⊢ ℝ 2 = ⋃ J × t J
55 54 topopn ⊢ J × t J ∈ Top → ℝ 2 ∈ J × t J
56 1 2 3 dya2iocuni ⊢ ℝ 2 ∈ J × t J → ∃ c ∈ 𝒫 ran ⁡ R ⋃ c = ℝ 2
57 50 55 56 mp2b ⊢ ∃ c ∈ 𝒫 ran ⁡ R ⋃ c = ℝ 2
58 simpr ⊢ c ∈ 𝒫 ran ⁡ R ∧ ⋃ c = ℝ 2 → ⋃ c = ℝ 2
59 elpwi ⊢ c ∈ 𝒫 ran ⁡ R → c ⊆ ran ⁡ R
60 59 adantr ⊢ c ∈ 𝒫 ran ⁡ R ∧ ⋃ c = ℝ 2 → c ⊆ ran ⁡ R
61 60 unissd ⊢ c ∈ 𝒫 ran ⁡ R ∧ ⋃ c = ℝ 2 → ⋃ c ⊆ ⋃ ran ⁡ R
62 58 61 eqsstrrd ⊢ c ∈ 𝒫 ran ⁡ R ∧ ⋃ c = ℝ 2 → ℝ 2 ⊆ ⋃ ran ⁡ R
63 62 rexlimiva ⊢ ∃ c ∈ 𝒫 ran ⁡ R ⋃ c = ℝ 2 → ℝ 2 ⊆ ⋃ ran ⁡ R
64 57 63 ax-mp ⊢ ℝ 2 ⊆ ⋃ ran ⁡ R
65 47 64 eqssi ⊢ ⋃ ran ⁡ R = ℝ 2