Goal:
  
  A : Type
  a : A
  l : list A
  P : A → bool
  d : A
  IHl : ∀ n : nat, forallb P l → n < #|l| → ∃ x : A, nth n l d = x ∧ P x
  ============================
   (P a && forallb P l → 0 < S #|l| → ∃ x : A, a = x ∧ P x)


DEBUG:Going to execute:
solve [ inversion H ]
Level 3: Backtrace:

The type of a is not inductive.
Level 3: Backtrace:

No applicable tactic.