proposition: Lemma set_join_le_ub S x : ubound S x -> set_join S <= x.
proof: Proof. exact: (set_join_is_lub S).2. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype choice order) mathcomp(ssrnat bigop classical_sets)