proposition: Lemma ltx0 x : (x < \bot) = false.
proof: Proof. by rewrite lt_neqAle lex0 andNb. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)