proposition: Lemma tail_cons_poly {R: ringType} (a: R) (q: {poly R}): tail_poly (cons_poly a q) = q.
proof: Proof. rewrite /tail_poly polyseq_cons. destruct (nilp q) eqn:Heq => /=. 2: by rewrite polyseqK. rewrite /nilp size_poly_eq0 in Heq. move /eqP in Heq. rewrite Heq polyseqC. by destruct (a != 0). 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)