proposition: Lemma finite_inter_l : forall E F, finite E -> finite (E \n F).
proof: Proof. Proof using. intros. applys* finite_inter. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)