proposition: Lemma not_in_fsetU : ∀ (l : Location) L0 L1, l \notin L0 → l \notin L1 → l \notin L0 :|: L1.
proof: Proof. intros l L0 L1 h1 h2. rewrite -fdisjoints1 fset1E. rewrite fdisjointUl. apply /andP ; split. + rewrite -fdisjoints1 fset1E in h1. apply h1. + rewrite -fdisjoints1 fset1E in h2. apply h2. 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)