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 : M.Raw.key
  n : elt
  r : M.Raw.tree elt
  z : Int.Z_as_Int.t
  p1 : T.lt k x
  p2 : M.Raw.lt_tree x l
  p3 : M.Raw.lt_tree x r
  ============================
   (M.Raw.lt_tree x (M.Raw.Node l k n r z))


DEBUG:Going to execute:
inversion 1; subst; auto;
            match goal with
            | H:T.lt _ _, H':T.eq _ _
              |- _ => now first [ rewrite H' in H | rewrite <- H' in H ]
            end
Level 0: Backtrace:

Proof is not complete.