proposition: Lemma lt01 : 0 < 1.
proof: Proof. by rewrite lt_def oner_neq0 le01. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)