proposition: Lemma finite_of_list_repr : forall (E:set A) L, list_repr E L -> finite E.
proof: Proof. Proof using. introv (ND&EQ). exists~ L. introv Hx. rewrite~ EQ. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibList LibOperation LibMonoid LibInt LibNat LibEpsilon LibRelation LibMin)