Metamath Proof Explorer


Theorem lptioo1cn

Description: The lower bound of an open interval is a limit point of the interval, wirth respect to the standard topology on complex numbers. (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Hypotheses lptioo1cn.1 ⊢ J = TopOpen ⁡ ℂ fld
lptioo1cn.2 ⊢ φ → B ∈ ℝ *
lptioo1cn.3 ⊢ φ → A ∈ ℝ
lptioo1cn.4 ⊢ φ → A < B
Assertion lptioo1cn ⊢ φ → A ∈ limPt ⁡ J ⁡ A B

Proof

Step Hyp Ref Expression
1 lptioo1cn.1 ⊢ J = TopOpen ⁡ ℂ fld
2 lptioo1cn.2 ⊢ φ → B ∈ ℝ *
3 lptioo1cn.3 ⊢ φ → A ∈ ℝ
4 lptioo1cn.4 ⊢ φ → A < B
5 eqid ⊢ topGen ⁡ ran ⁡ . = topGen ⁡ ran ⁡ .
6 5 3 2 4 lptioo1 ⊢ φ → A ∈ limPt ⁡ topGen ⁡ ran ⁡ . ⁡ A B
7 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
8 7 cnfldtop ⊢ TopOpen ⁡ ℂ fld ∈ Top
9 8 a1i ⊢ φ → TopOpen ⁡ ℂ fld ∈ Top
10 ax-resscn ⊢ ℝ ⊆ ℂ
11 unicntop ⊢ ℂ = ⋃ TopOpen ⁡ ℂ fld
12 10 11 sseqtri ⊢ ℝ ⊆ ⋃ TopOpen ⁡ ℂ fld
13 12 a1i ⊢ φ → ℝ ⊆ ⋃ TopOpen ⁡ ℂ fld
14 ioossre ⊢ A B ⊆ ℝ
15 14 a1i ⊢ φ → A B ⊆ ℝ
16 eqid ⊢ ⋃ TopOpen ⁡ ℂ fld = ⋃ TopOpen ⁡ ℂ fld
17 tgioo4 ⊢ topGen ⁡ ran ⁡ . = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
18 16 17 restlp ⊢ TopOpen ⁡ ℂ fld ∈ Top ∧ ℝ ⊆ ⋃ TopOpen ⁡ ℂ fld ∧ A B ⊆ ℝ → limPt ⁡ topGen ⁡ ran ⁡ . ⁡ A B = limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∩ ℝ
19 9 13 15 18 syl3anc ⊢ φ → limPt ⁡ topGen ⁡ ran ⁡ . ⁡ A B = limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∩ ℝ
20 6 19 eleqtrd ⊢ φ → A ∈ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∩ ℝ
21 elin ⊢ A ∈ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∩ ℝ ↔ A ∈ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∧ A ∈ ℝ
22 20 21 sylib ⊢ φ → A ∈ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B ∧ A ∈ ℝ
23 22 simpld ⊢ φ → A ∈ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B
24 1 eqcomi ⊢ TopOpen ⁡ ℂ fld = J
25 24 fveq2i ⊢ limPt ⁡ TopOpen ⁡ ℂ fld = limPt ⁡ J
26 25 fveq1i ⊢ limPt ⁡ TopOpen ⁡ ℂ fld ⁡ A B = limPt ⁡ J ⁡ A B
27 23 26 eleqtrdi ⊢ φ → A ∈ limPt ⁡ J ⁡ A B