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