proposition: Lemma meet_l x y : x <= y -> x `&` y = x.
proof: Proof. exact/meet_idPl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)