proposition: Lemma Sba_m_pos x: 1 < x -> 0 < (Sba_m x).
proof: Proof. by move => h; rewrite /Sba_m subr_gt0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)