proposition: Lemma size_nat_to_poly (t a: nat): size (nat_to_poly t a) <= t.
proof: Proof. elim: t => [|t IHt] /= in a*. 1: by rewrite size_poly0. rewrite size_cons_poly. destruct (_ && _) => //. by rewrite ltnS. 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)