proposition: Lemma leIr x y : y `&` x <= x.
proof: Proof. by rewrite leIx2 ?lexx ?orbT. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)