proposition: Lemma Rbar_le_lt_or_eq_dec (x y : Rbar) : Rbar_le x y -> { Rbar_lt x y } + { x = y }.
proof: Proof. destruct (Rbar_total_order x y) as [[H|H]|H]. now left. now right. intros K. now elim (Rbar_le_not_lt _ _ K). Qed.
imports: Coq(Reals ssreflect) Rcomplements