proposition: Lemma sec_poly_bij (U: seq Party) (m m': Word) (q: {poly Word}): uniq U -> make_shares m' (poly_bij U m m' q) U = make_shares m q U.
proof: Proof. move=> H. by rewrite (sec_poly_bij_rec [::]). 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)