Let
, note that
a
∈
B
since
f
(
[
a
,
a
]
)
=
{
f
(
a
)
}
therefore
f
(
[
a
,
b
]
)
is bounded.
Suppose that
e
∈
B
and
e
>
a
, then
f
is bounded on
[
a
,
e
]
by the definition of
B
, meaning that for any
a
<
m
<
e
,
f
is bounded on
[
a
,
m
]
so
m
∈
B
, this shows that
B
is an interval of the form
[
a
,
x
]
for
x
∈
[
a
,
b
]
.
f
is continuous at
a
, then let
t
∈
R
be a throwaway value insofar as to obtain some
δ
∈
R
>
0
so that for all
x
∈
dom
(
f
)
=
[
a
,
b
]
, we have
|
x
−
a
|
<
δ
implying
|
f
(
x
)
−
f
(
a
)
|
<
t
.
This shows us that
f
is bounded on
[
a
,
a
+
δ
]
using our throwaway value of
t
, therefore
a
+
δ
∈
B
and as mentioned in the second paragraph, we know
[
a
,
a
+
δ
]
⊆
B
, this means that
B
has at least two values, so we can find another element
y
∈
B
such that
a
<
y
.
Since
R
has the least upper bound property then since
B
is bounded above by
b
, then we know that
s
:=
sup
(
B
)
∈
B
, from the existance of
y
, then by chaining inequalities we get
a
<
s
(todo: define set builder notation) (anything amaller has a point greater def of sup)