proposition: Lemma lex1 (x : L) : x <= top.
proof: Proof. exact: lex1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)