proposition: Lemma Sba_p_pos x: 0 < x -> 1 < (Sba_p x).
proof: Proof. by move => h; rewrite /Sba_p -ltrBlDl. 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)