Metamath Proof Explorer


Theorem rectbntr0

Description: A countable subset of the reals has empty interior. (Contributed by Mario Carneiro, 26-Jul-2014)

Ref Expression
Assertion rectbntr0 ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A = ∅

Proof

Step Hyp Ref Expression
1 nnex ⊢ ℕ ∈ V
2 1 canth2 ⊢ ℕ ≺ 𝒫 ℕ
3 domnsym ⊢ 𝒫 ℕ ≼ ℕ → ¬ ℕ ≺ 𝒫 ℕ
4 2 3 mt2 ⊢ ¬ 𝒫 ℕ ≼ ℕ
5 retop ⊢ topGen ⁡ ran ⁡ . ∈ Top
6 simpl ⊢ A ⊆ ℝ ∧ A ≼ ℕ → A ⊆ ℝ
7 uniretop ⊢ ℝ = ⋃ topGen ⁡ ran ⁡ .
8 7 ntropn ⊢ topGen ⁡ ran ⁡ . ∈ Top ∧ A ⊆ ℝ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ∈ topGen ⁡ ran ⁡ .
9 5 6 8 sylancr ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ∈ topGen ⁡ ran ⁡ .
10 opnreen ⊢ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ∈ topGen ⁡ ran ⁡ . ∧ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≠ ∅ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≈ 𝒫 ℕ
11 10 ex ⊢ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ∈ topGen ⁡ ran ⁡ . → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≠ ∅ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≈ 𝒫 ℕ
12 9 11 syl ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≠ ∅ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≈ 𝒫 ℕ
13 reex ⊢ ℝ ∈ V
14 13 ssex ⊢ A ⊆ ℝ → A ∈ V
15 7 ntrss2 ⊢ topGen ⁡ ran ⁡ . ∈ Top ∧ A ⊆ ℝ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ⊆ A
16 5 15 mpan ⊢ A ⊆ ℝ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ⊆ A
17 ssdomg ⊢ A ∈ V → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ⊆ A → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ A
18 14 16 17 sylc ⊢ A ⊆ ℝ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ A
19 domtr ⊢ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ A ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ ℕ
20 18 19 sylan ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ ℕ
21 ensym ⊢ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≈ 𝒫 ℕ → 𝒫 ℕ ≈ int ⁡ topGen ⁡ ran ⁡ . ⁡ A
22 endomtr ⊢ 𝒫 ℕ ≈ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ∧ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ ℕ → 𝒫 ℕ ≼ ℕ
23 22 expcom ⊢ int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≼ ℕ → 𝒫 ℕ ≈ int ⁡ topGen ⁡ ran ⁡ . ⁡ A → 𝒫 ℕ ≼ ℕ
24 20 21 23 syl2im ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≈ 𝒫 ℕ → 𝒫 ℕ ≼ ℕ
25 12 24 syld ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A ≠ ∅ → 𝒫 ℕ ≼ ℕ
26 25 necon1bd ⊢ A ⊆ ℝ ∧ A ≼ ℕ → ¬ 𝒫 ℕ ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A = ∅
27 4 26 mpi ⊢ A ⊆ ℝ ∧ A ≼ ℕ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A = ∅