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