proposition: Lemma lteif01 C : 0 < 1 ?<= if C :> R.
proof: Proof. by case: C; rewrite /= lter01. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)