proposition: Lemma meetUr : right_distributive (@meet _ L) (@join _ L).
proof: Proof. by move=> x y z; rewrite meetC meetUl ![_ `&` x]meetC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)