Goal:
  
  A : Type
  P : nat → A → Type
  p : nat → A → bool
  Hp : ∀ (i : nat) (x : A), reflectT (P i x) (p i x)
  n : nat
  hd : A
  tl : list A
  p0 : P n hd
  X : Alli P (S n) tl
  IHX : is_true (alli p (S n) tl)
  ============================
   (p n hd && true = true)


DEBUG:Going to execute:
apply : eq_sym ; trivial
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.