proposition: Lemma stir1_Sn1 n : 'So(n.+1,1) = n `!.
proof: Proof. by elim:n => // n Hr; rewrite stir1_S stir1_n0 Hr addn0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)