proposition: Lemma bij_f w e : bijective (f w e).
proof: Proof. unfold f. exists (λ x, fto (otf x - w * e)). all: intro x ; unfold fto, otf ; rewrite !enum_rankK. - by rewrite addrK enum_valK. - by rewrite subrK enum_valK. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum fingroup.fingroup solvable.cyclic prime ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb UniformStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude SigmaProtocol) Coq(Utf8) extructures(ord fset fmap) Equations(Equations)