Metamath Proof Explorer


Theorem icomnfordt

Description: An unbounded above open interval is open in the order topology of the extended reals. (Contributed by Mario Carneiro, 3-Sep-2015)

Ref Expression
Assertion icomnfordt −∞ A ordTop

Proof

Step Hyp Ref Expression
1 eqid ran x * x +∞ = ran x * x +∞
2 eqid ran x * −∞ x = ran x * −∞ x
3 eqid ran . = ran .
4 1 2 3 leordtval ordTop = topGen ran x * x +∞ ran x * −∞ x ran .
5 letop ordTop Top
6 4 5 eqeltrri topGen ran x * x +∞ ran x * −∞ x ran . Top
7 tgclb ran x * x +∞ ran x * −∞ x ran . TopBases topGen ran x * x +∞ ran x * −∞ x ran . Top
8 6 7 mpbir ran x * x +∞ ran x * −∞ x ran . TopBases
9 bastg ran x * x +∞ ran x * −∞ x ran . TopBases ran x * x +∞ ran x * −∞ x ran . topGen ran x * x +∞ ran x * −∞ x ran .
10 8 9 ax-mp ran x * x +∞ ran x * −∞ x ran . topGen ran x * x +∞ ran x * −∞ x ran .
11 10 4 sseqtrri ran x * x +∞ ran x * −∞ x ran . ordTop
12 ssun1 ran x * x +∞ ran x * −∞ x ran x * x +∞ ran x * −∞ x ran .
13 ssun2 ran x * −∞ x ran x * x +∞ ran x * −∞ x
14 eqid −∞ A = −∞ A
15 oveq2 x = A −∞ x = −∞ A
16 15 rspceeqv A * −∞ A = −∞ A x * −∞ A = −∞ x
17 14 16 mpan2 A * x * −∞ A = −∞ x
18 eqid x * −∞ x = x * −∞ x
19 ovex −∞ x V
20 18 19 elrnmpti −∞ A ran x * −∞ x x * −∞ A = −∞ x
21 17 20 sylibr A * −∞ A ran x * −∞ x
22 13 21 sselid A * −∞ A ran x * x +∞ ran x * −∞ x
23 12 22 sselid A * −∞ A ran x * x +∞ ran x * −∞ x ran .
24 11 23 sselid A * −∞ A ordTop
25 24 adantl −∞ * A * −∞ A ordTop
26 df-ico . = x * , y * z * | x z z < y
27 26 ixxf . : * × * 𝒫 *
28 27 fdmi dom . = * × *
29 28 ndmov ¬ −∞ * A * −∞ A =
30 0opn ordTop Top ordTop
31 5 30 ax-mp ordTop
32 29 31 eqeltrdi ¬ −∞ * A * −∞ A ordTop
33 25 32 pm2.61i −∞ A ordTop