proposition: Lemma lteifN2 C : {mono -%R : x y /~ x < y ?<= if C :> R}.
proof: Proof. by case: C => ? ?; rewrite /= lterN2. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)