proposition: Lemma snumden_pos' x: 0 <= x -> 0 < snumden' x.
proof: Proof. rewrite le0r => /orP; case; first by move/eqP ->. by rewrite /snumden' -numq_gt0 => h; apply: addr_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)