proposition: Lemma disj_leC x y : y `&` x == \bot -> x <= y = (x == \bot).
proof: Proof. by rewrite meetC => /disj_le. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)