proposition: Lemma set_decompose_union_right : forall A (E F : set A), (E \u F) = E \u (F \- E).
proof: Proof. Proof using. set_prove_classic. Qed.
imports: TLC(LibTactics) TLC(LibLogic LibEqual LibList LibRelation LibWf LibList LibLN)