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
  e : T.eq k x
  l0 : M.Raw.lt_tree x l
  l1 : M.Raw.lt_tree x r
  ============================
   (~ M.Raw.lt_tree x (M.Raw.Node l k n r z))


DEBUG:Going to execute:
intro f; apply pf; hnf in *; intros; apply f; constructor;
            assumption + reflexivity
Level 0: Backtrace:

The type of H is not inductive.
Level 0: Backtrace:

The type of H is not inductive.
Level 0: Backtrace:

The type of H is not inductive.
Level 0: Backtrace:

The type of H is not inductive.