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