proposition: Lemma Nat_le_succ_r_dec : forall n m : nat, le n (S m) -> { le n m } + { n = S m }.
proof: Proof. intros. destruct (Nat.eq_dec n (S m)). right. assumption. left. destruct (Nat.le_succ_r n m) as [H0 _]. destruct H0. assumption. assumption. contradiction. Qed.
imports: List QArith ConstructiveReals ConstructiveAbs ConstructiveMinMax ConstructiveSum ConstructiveLimits ConstructiveRcomplete