proposition: Lemma in_inst : forall A, BagIn A (set A).
proof: Proof. Proof using. constructor. exact (@in_impl A). Defined.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)