Goal:
  
  elt : Type
  eq_elt : elt -> elt -> Prop
  m : t elt
  m' : t elt
  H : forall x y : key, E.eq x y -> find x m = find y m
  H0 : forall x y : key, E.eq x y -> find x m' = find y m'
  H1 : forall (k : key) (e : elt),
       find k m = Some e ->
       match find k m with
       | Some x =>
           match find k m' with
           | Some y => eq_elt x y
           | None => False
           end
       | None => match find k m' with
                 | Some _ => False
                 | None => True
                 end
       end
  H3 : forall (k : key) (e : elt),
       find k m' = Some e ->
       match find k m with
       | Some x =>
           match find k m' with
           | Some y => eq_elt x y
           | None => False
           end
       | None => match find k m' with
                 | Some _ => False
                 | None => True
                 end
       end
  k : key
  x : elt
  H2 : find k m' = Some x
  H4 : forall k : key, find k m' = find k m'
  H5 : forall k : key, find k m = find k m
  ============================
   (exists e : elt, find k m = Some e)


DEBUG:Going to execute:
let T := type of defn in
           tryif
            (let H := FindHyp.find_hyp T in
             fail 2 "Already a hypothesis" H "of type" T) then 
            fail else pose proof defn 
DEBUG LTAC Evaluated term: (fun k : key => H k k (E.eq_refl k))