proposition: Lemma uniq_unzip1_in {S T: eqType} (a: S * T) (s: seq (S * T)): uniq (unzip1 (a :: s)) -> a.1 \notin unzip1 s.
proof: Proof. by rewrite /unzip1 map_cons cons_uniq -/unzip1 => /andP []. 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)