Goal:
  
  elt : Type
  lt_tree_dec : forall (x : T.t) (t : M.Raw.tree elt),
                {M.Raw.lt_tree x t} + {~ M.Raw.lt_tree x t}
  x : T.t
  t : M.Raw.tree elt
  l : M.Raw.tree elt
  k : T.t
  n : elt
  r : M.Raw.tree elt
  z : BinNums.Z
  e : T.eq k x
  l0 : forall y : M.Raw.key, M.Raw.In y l -> T.lt y x
  pf : M.Raw.lt_tree x r -> False
  f : forall y : M.Raw.key, M.Raw.In y (M.Raw.Node l k n r z) -> T.lt y x
  y : M.Raw.key
  H : M.Raw.In y r
  ============================
   (T.eq y k)


DEBUG:Going to execute:
reflexivity
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.