let A be non empty Interval; for x being Real st 0 < x & A is left_open_interval holds
x ** A is left_open_interval
let x be Real; ( 0 < x & A is left_open_interval implies x ** A is left_open_interval )
assume A1:
0 < x
; ( not A is left_open_interval or x ** A is left_open_interval )
assume
A is left_open_interval
; x ** A is left_open_interval
then consider a being R_eal, b being real number such that
A3:
A = ].a,b.]
by MEASURE5:def 8;
A2:
a < b
by A3, XXREAL_1:26;
reconsider b = b as R_eal by XXREAL_0:def 1;
now per cases
( ( a = -infty & b = -infty ) or ( a = -infty & b in REAL ) or ( a = -infty & b = +infty ) or ( a in REAL & b in REAL ) or ( a in REAL & b = +infty ) or ( a = +infty & b = +infty ) )
by A2, Th6;
case A4:
(
a = -infty &
b in REAL )
;
x ** A is left_open_interval then consider s being
Real such that A5:
s = b
;
x * s is
R_eal
by XXREAL_0:def 1;
then consider d being
R_eal such that A6:
d = x * s
;
consider c being
R_eal such that A7:
c = -infty
;
A8:
].c,d.] c= x ** A
x ** A c= ].c,d.]
proof
let q be
set ;
TARSKI:def 3 ( not q in x ** A or q in ].c,d.] )
assume A14:
q in x ** A
;
q in ].c,d.]
then reconsider q =
q as
Real ;
consider z2 being
Real such that A15:
z2 in A
and A16:
q = x * z2
by A14, INTEGRA2:41;
reconsider q =
q as
R_eal by XXREAL_0:def 1;
A17:
-infty < q
by XXREAL_0:12;
reconsider z2 =
z2 as
R_eal by XXREAL_0:def 1;
z2 <= b
by A3, A15, XXREAL_1:2;
then consider r,
o being
Real such that A18:
(
r = z2 &
o = b )
and A19:
r <= o
by A4;
x * r <= x * o
by A1, A19, XREAL_1:66;
hence
q in ].c,d.]
by A5, A7, A6, A16, A18, A17, XXREAL_1:2;
verum
end; then
x ** A = ].c,d.]
by A8, XBOOLE_0:def 10;
hence
x ** A is
left_open_interval
by A6, MEASURE5:def 8;
verum end; case A20:
(
a in REAL &
b in REAL )
;
x ** A is left_open_interval then reconsider s =
a as
Real ;
x * s is
R_eal
by XXREAL_0:def 1;
then consider d being
R_eal such that A21:
d = x * s
;
consider r being
Real such that A22:
r = b
by A20;
x * r is
R_eal
by XXREAL_0:def 1;
then consider g being
R_eal such that A23:
g = x * r
;
A24:
].d,g.] c= x ** A
x ** A c= ].d,g.]
proof
let q be
set ;
TARSKI:def 3 ( not q in x ** A or q in ].d,g.] )
assume A32:
q in x ** A
;
q in ].d,g.]
then reconsider q =
q as
Real ;
consider z2 being
Real such that A33:
z2 in A
and A34:
q = x * z2
by A32, INTEGRA2:41;
reconsider z2 =
z2 as
R_eal by XXREAL_0:def 1;
a <= z2
by A3, A33, XXREAL_1:2;
then consider 1o,
1ra being
Real such that A35:
(
1o = a &
1ra = z2 )
and
1o <= 1ra
by A20;
1o < 1ra
by A3, A33, A35, XXREAL_1:2;
then A36:
x * 1o < x * 1ra
by A1, XREAL_1:70;
z2 <= b
by A3, A33, XXREAL_1:2;
then consider 2o,
2r being
Real such that A37:
(
2o = z2 &
2r = b )
and A38:
2o <= 2r
by A20;
(
x * 2o is
R_eal &
x * 2r is
R_eal )
by XXREAL_0:def 1;
then consider 2o1,
2r1 being
R_eal such that A39:
(
2o1 = x * 2o &
2r1 = x * 2r )
;
2o1 <= 2r1
by A1, A38, A39, XREAL_1:66;
hence
q in ].d,g.]
by A22, A21, A23, A34, A35, A37, A36, A39, XXREAL_1:2;
verum
end; then
x ** A = ].d,g.]
by A24, XBOOLE_0:def 10;
hence
x ** A is
left_open_interval
by A23, MEASURE5:def 8;
verum end; end; end;
hence
x ** A is left_open_interval
; verum