proposition: Lemma in_compl {n} (a: 'I_n) (s: {fset 'I_n}): (a \in compl s) = (a \notin s).
proof: Proof. by rewrite in_fsetD in_fset mem_ord_enum Bool.andb_true_r. 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)