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