proposition: Lemma notin_union_r : forall x E F, x \notin (E \u F) -> (x \notin E) /\ (x \notin F).
proof: Proof. Proof using. intros. rewrite~ <- notin_union. Qed.
imports: TLC(LibTactics LibList LibLogic LibNat LibEpsilon LibReflect)