proposition: Lemma bij_share_bij (U: seq Party) (m m': Word): uniq U -> (size U <= t')%N -> bijective (share_bij U m m').
proof: Proof. move=> Huniq Hleq. exists (share_bij U m' m) => q. all: apply: ord_inj. all: rewrite /= poly_nat_poly ?size_poly_bij ?size_nat_to_poly //. all: by rewrite bij_poly_bij ?nat_poly_nat. 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)