proposition: Lemma set_meetUr S S' : lbound S' (set_meet (S `|` S')).
proof: Proof. rewrite setUC; exact: set_meetUl. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype choice order) mathcomp(ssrnat bigop classical_sets)