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'
  H3 : forall (k : key) (e e' : elt),
       find k m = Some e -> find k m' = Some e' -> eq_elt e e'
  k : key
  x : elt
  H1 : find k m' = Some x
  H4 : forall (k : key) (e : elt),
       find k m = Some e -> exists e0 : elt, find k m' = Some e0
  H5 : forall (k : key) (e : elt),
       find k m' = Some e -> exists e0 : elt, find k m = Some e0
  H2 : forall k : key, find k m' = find k m'
  H6 : forall k : key, find k m = find k m
  ============================
   ?T0


DEBUG:Going to execute:
match goal with
           | _ =>
               let __ := lazymatch goal with
                         | _ => guard_tac H
                         end in
               open_constr:((H ltac:((progress tac))))
           | _ =>
               let H := open_constr:((H _)) in
               guarded_specialize_term_under_binders_by' guard_tac H tac
           end
DEBUG LTAC Evaluated term: (H ?x ?y)
DEBUG LTAC Evaluated term: (E.eq ?x ?y -> find ?x m = find ?y m)
Level 11: type of H
 has value 
(E.eq ?x ?y -> find ?x m = find ?y m)