proposition: Lemma boundP x : 0 <= x -> x < (bound x)%:R.
proof: Proof. by move/ger0_norm=> {1}<-; rewrite /bound; case: (sigW _). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)