proposition: Lemma pt_in_zero_points {R: ringType} {x: R} {s: seq R}: x \in s -> (x, 0) \in zero_points s.
proof: Proof. rewrite /zero_points. elim: s => [// | a s IHs] H /=. rewrite in_cons in H. rewrite in_cons. destruct (x == a) eqn:Heq. - move /eqP in Heq. by rewrite Heq eq_refl. - by rewrite xpair_eqE Heq IHs. 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)