proposition: Theorem leb_total : forall a1 a2, leb a1 a2 = true \/ leb a2 a1 = true.
proof: Proof. cbv [leb]; intros a1 a2; rewrite !Qle_bool_iff. cbv [Qle Qnum Qden]; destruct a1, a2; lia. Qed.
imports: Coq.Strings.String Coq.Structures.Orders Coq.micromega.Lia Coq.Bool.Bool Coq.Sorting.Mergesort Coq.QArith.QArith Coq.QArith.Qround Coq.QArith.Qabs Coq.QArith.Qminmax Coq.NArith.NArith Coq.ZArith.ZArith Coq.Arith.Arith Coq.Lists.List PerformanceExperiments.LetIn