proposition: Lemma mkciph_ciph_to_pair (c: Ciph): mkciph (ciph_to_pair c).1 (ciph_to_pair c).2 = c.
proof: Proof. apply: ord_inj. case: c => [c Hc] /=. by rewrite -divn_eq. 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)