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,
       (exists 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
  ============================
   (exists e : elt, find k m' = Some e)


DEBUG:Going to execute:
constr:(match b with
                   | a => f
                   end)
Level 7: x
 has value 
(let H4 :
   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 :=
   fun (k : key) (e : elt) (e0 : find k m = Some e) =>
   H1 k (ex_intro (fun e1 : elt => find k m = Some e1) e e0) in
 H4)