proposition: Lemma ciph_to_pair_mkciph (m: Word) (r: Key): ciph_to_pair (mkciph m r) = (m, r).
proof: Proof. rewrite /mkciph /ciph_to_pair /=. f_equal. all: apply: ord_inj => /=. - by rewrite modnMDl modn_small. - by rewrite divnMDl ?PositiveExp2 ?divn_small ?addn0. 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)