proposition: Lemma card_inter_le_r : forall A (E F:set A), finite F -> card (E \n F) <= card F.
proof: Proof. Proof using. intros. rewrite inter_comm. apply~ card_inter_le_l. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)