Definition sup := completeness.Definition is_lower_bound (E:R->Prop) (m:R) :=
  forall x:R, E x -> x >= m.Definition lower_bound (E:R->Prop) :=
  exists m:R, is_lower_bound E m.Definition is_glb (E:R->Prop) (m:R) :=
  is_lower_bound E m /\ (forall b:R, is_lower_bound E b -> b <= m).Definition inf: forall E:R->Prop, lower_bound E -> (exists x:R, E x) ->
  { m:R | is_glb E m }.

Lemma glb_approx: forall (S:Ensemble R) (m:R) (eps:R), is_glb S m -> eps > 0 -> exists x:R, In S x /\ m <= x < m + eps.