Goal:
  
  A : Type
  B : Type
  x : A
  a : A
  l : list A
  proj : A → B
  size : B → nat
  IHl : In x l → size (proj x) < list_size (λ x : A, size (proj x)) l
  H : a = x ∨ In x l
  ============================
   (size (proj x) < S (size (proj a) + list_size (λ x : A, size (proj x)) l))


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.