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