Metamath Proof Explorer


Theorem leordtval

Description: The topology of the extended reals. (Contributed by Mario Carneiro, 3-Sep-2015)

Ref Expression
Hypotheses leordtval.1 ⊢ A = ran ⁡ x ∈ ℝ * ⟼ x +∞
leordtval.2 ⊢ B = ran ⁡ x ∈ ℝ * ⟼ −∞ x
leordtval.3 ⊢ C = ran ⁡ .
Assertion leordtval ⊢ ordTop ⁡ ≤ = topGen ⁡ A ∪ B ∪ C

Proof

Step Hyp Ref Expression
1 leordtval.1 ⊢ A = ran ⁡ x ∈ ℝ * ⟼ x +∞
2 leordtval.2 ⊢ B = ran ⁡ x ∈ ℝ * ⟼ −∞ x
3 leordtval.3 ⊢ C = ran ⁡ .
4 1 2 leordtval2 ⊢ ordTop ⁡ ≤ = topGen ⁡ fi ⁡ A ∪ B
5 letsr ⊢ ≤ ∈ TosetRel
6 ledm ⊢ ℝ * = dom ⁡ ≤
7 1 leordtvallem1 ⊢ A = ran ⁡ x ∈ ℝ * ⟼ y ∈ ℝ * | ¬ y ≤ x
8 1 2 leordtvallem2 ⊢ B = ran ⁡ x ∈ ℝ * ⟼ y ∈ ℝ * | ¬ x ≤ y
9 df-ioo ⊢ . = a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | a < y ∧ y < b
10 xrltnle ⊢ a ∈ ℝ * ∧ y ∈ ℝ * → a < y ↔ ¬ y ≤ a
11 10 adantlr ⊢ a ∈ ℝ * ∧ b ∈ ℝ * ∧ y ∈ ℝ * → a < y ↔ ¬ y ≤ a
12 xrltnle ⊢ y ∈ ℝ * ∧ b ∈ ℝ * → y < b ↔ ¬ b ≤ y
13 12 ancoms ⊢ b ∈ ℝ * ∧ y ∈ ℝ * → y < b ↔ ¬ b ≤ y
14 13 adantll ⊢ a ∈ ℝ * ∧ b ∈ ℝ * ∧ y ∈ ℝ * → y < b ↔ ¬ b ≤ y
15 11 14 anbi12d ⊢ a ∈ ℝ * ∧ b ∈ ℝ * ∧ y ∈ ℝ * → a < y ∧ y < b ↔ ¬ y ≤ a ∧ ¬ b ≤ y
16 15 rabbidva ⊢ a ∈ ℝ * ∧ b ∈ ℝ * → y ∈ ℝ * | a < y ∧ y < b = y ∈ ℝ * | ¬ y ≤ a ∧ ¬ b ≤ y
17 16 mpoeq3ia ⊢ a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | a < y ∧ y < b = a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | ¬ y ≤ a ∧ ¬ b ≤ y
18 9 17 eqtri ⊢ . = a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | ¬ y ≤ a ∧ ¬ b ≤ y
19 18 rneqi ⊢ ran ⁡ . = ran ⁡ a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | ¬ y ≤ a ∧ ¬ b ≤ y
20 3 19 eqtri ⊢ C = ran ⁡ a ∈ ℝ * , b ∈ ℝ * ⟼ y ∈ ℝ * | ¬ y ≤ a ∧ ¬ b ≤ y
21 6 7 8 20 ordtbas2 ⊢ ≤ ∈ TosetRel → fi ⁡ A ∪ B = A ∪ B ∪ C
22 5 21 ax-mp ⊢ fi ⁡ A ∪ B = A ∪ B ∪ C
23 22 fveq2i ⊢ topGen ⁡ fi ⁡ A ∪ B = topGen ⁡ A ∪ B ∪ C
24 4 23 eqtri ⊢ ordTop ⁡ ≤ = topGen ⁡ A ∪ B ∪ C