proposition: Lemma gt_ge a b : (forall x, b < x -> a < x) -> a <= b.
proof: Proof. by move=> ab; apply/ler_addgt0Pr => e e_gt0; rewrite ltW// ab// ltrDl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)