proposition: Lemma ltxx x: x < x = false.
proof: Proof. by rewrite lt_def eqxx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)