Definition Map (K V : Type) : Type :=
  list (K * V).Definition well_formed {K V} (m : Map K V) : Prop :=
  NoDup (map fst m).(* no repeat keys *)

Class DecEq (X : Type) := {
  dec_eq : forall x x' : X, { x = x' } + { x <> x' }
  }.(* no repeat keys *)

Class DecEq (X : Type) := {
  dec_eq : forall x x' : X, { x = x' } + { x <> x' }
  }.

Lemma lookup_insert {K V} `{DecEq K} (k : K) (v : V) (m : Map K V) : well_formed m -> lookup k (insert k v m) = Some v.