proposition: Lemma not_in_domm {T S} : ∀ i m, i \notin @domm T S m :\ i.
proof: Proof. intros. apply /negPn. rewrite in_fsetD. move=> /andP [H _]. move: H => /negPn H. apply H. by rewrite in_fset1. 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) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb UniformStateProb pkg_composition Package Prelude SigmaProtocol Schnorr DDH) Coq(Utf8 Lia) extructures(ord fset fmap) Equations(Equations)