proposition: Lemma ltn_paddl m n: 0 < m -> n < m + n.
proof: Proof. by rewrite - (ltn_add2r n) add0n. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)