Goal:
  
  A : Type
  P : nat → A → Type
  Q : nat → A → Type
  n : nat
  hd : A
  tl : list A
  p : P n hd
  X : Alli P (S n) tl
  X0 : Alli (λ (n : nat) (x : A), P n x → Q n x) n (hd :: tl)
  hd0 : A
  tl0 : list A
  X2 : Alli (λ (n : nat) (x : A), P n x → Q n x) (S n) tl
  H0 : hd0 = hd
  H1 : tl0 = tl
  X3 : Q n hd
  X1 : Alli Q (S n) tl
  ============================
   (Q n hd)


DEBUG:Going to execute:
<Coq.Init.Tauto.is_unit_or_eq> flags X1; Ltac.cut X2;
            [ intro; clear id
            | Ltac.cut X1; [ exact id | constructor 1; fail ] ]
Level 0: Backtrace:

Q is used in conclusion.
Level 0: Backtrace:

Q is used in conclusion.
Level 0: Backtrace:

Q is used in conclusion.
Level 0: Backtrace:

Q is used in conclusion.
Level 0: Backtrace:

Q is used in conclusion.
Level 1: Backtrace:

Q is used in conclusion.
Level 0: Backtrace:

Q is used in conclusion.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 1: Backtrace:

Not convertible.