proposition: Lemma uniq_make_shares (U: seq Party) (m: Word) (q: {poly Word}): uniq U -> uniq (unzip1 (make_shares m q U)).
proof: Proof. elim: U => [// | a U IHu] /=. move=> /andP [H1 H2]. by rewrite IHu // in_make_shares H1. 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)