proposition: Lemma bounded_below_sub X Y r: sub Y X -> bounded_below r X -> bounded_below r Y.
proof: Proof. move=> YX [x ux]; exists x; apply: (sub_lower_bound ux YX). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)