Goal:
  
  A : Type
  P : nat → A → Type
  p : nat → A → bool
  n : nat
  a : A
  l : list A
  Hp : ∀ (i : nat) (x : A), reflectT (P i x) (p i x)
  IHl : ∀ n : nat, alli p n l → Alli P n l
  pa : is_true true
  pl : is_true (alli p (S n) l)
  p0 : P n a
  ============================
   (P n a)


DEBUG:Going to execute:
let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"