proposition: Lemma Stern_nz n: Stern n.+1 != 0.
proof: Proof. by move:(Stern_gt0 n); rewrite Order.POrderTheory.lt_def => /andP[]. 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)