proposition: Lemma nat_poly_nat (t a: nat): a < p^t -> poly_to_nat t (nat_to_poly t a) = a.
proof: Proof. elim: t a => [|t IHt] a H. 1: by destruct a. rewrite expnS mulnC in H. rewrite /= head_cons_poly tail_cons_poly IHt -?divn_eq //. by rewrite ltn_divLR // prime_gt0. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude) extructures(ord fset fmap) Equations(Equations)