proposition: Theorem leb_total : forall a1 a2:Q, leb a1 a2 = true \/ leb a2 a1 = true.
proof: Proof. intros. unfold leb. do 2 rewrite Qle_bool_iff. destruct (Qlt_le_dec a1 a2). left. apply Qlt_le_weak, q. right. exact q. Qed.
imports: List Permutation Orders Sorted Mergesort QArith Qpower ConstructiveReals ConstructiveAbs ConstructiveMinMax ConstructiveSum ConstructiveLimits ConstructiveRcomplete ConstructiveDiagonal ConstructiveUniformCont