proposition: Fact lex1 x : x <= oneU.
proof: Proof. by rewrite leEsub /= SubK lex1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)