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


DEBUG:Going to execute:
let is_transparent :=
            match goal with
            | _ => let __ := eval cbv delta [H] in H in
                   constr:(true)
            | _ => constr:(false)
            end
           in
           lazymatch constr:((all_ways, is_transparent)) with
           | (false, true) =>
               let H' := fresh in
               rename H into H';
                (let H'' :=
                  guarded_specialize_term_under_binders_by guard_tac H' tac
                 in
                 pose (H := H''); subst H')
           | (true, true) =>
               let H :=
                guarded_specialize_term_under_binders_by guard_tac H tac
               in
               unique
               pose
               H
           | (false, false) =>
               let H :=
                guarded_specialize_term_under_binders_by guard_tac H tac
               in
               specialize
               H
           | (true, false) =>
               let H :=
                guarded_specialize_term_under_binders_by guard_tac H tac
               in
               unique
               pose
               proof
               H
           end