proposition: Lemma cons_eq_head_tail_poly {R: ringType} (a: R) (q: {poly R}): a = head_poly q -> cons_poly a (tail_poly q) = q.
proof: Proof. move=> H. by rewrite H cons_head_tail_poly. 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)