proposition: Lemma stir_Sn1 n : 'St(n.+1,1) = 1.
proof: Proof. by elim:n => // n Hr; rewrite stirS Hr stirn0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)