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
  H : is_true (P a && forallb P l)
  H0 : 0 < S #|l|
  ============================
   (∃ x : A, a = x ∧ P x)


DEBUG:Going to execute:
try (solve [ inversion H ])
DEBUG LTAC Evaluated term: H0
DEBUG LTAC Evaluated term: (0 < S #|l|)
Level 2: type of H
 has value 
(0 < S #|l|)