Goal:
  
  A : Type
  P : A → Prop
  a : A
  l : list A
  H : ∀ x : A, In x (a :: l) → P x
  IHl : (∀ x : A, In x l → P x) → Forall P l
  ============================
   (a = a ∨ In a l)


DEBUG:Going to execute:
PTRDEBUGTAC<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:

P is used in hypothesis H.
Level 0: Backtrace:

P is used in hypothesis H.
Level 0: Backtrace:

P is used in hypothesis H.
Level 0: Backtrace:

P is used in hypothesis H.
Level 0: Backtrace:

P is used in hypothesis H.
Level 1: Backtrace:

P is used in hypothesis H.
Level 0: Backtrace:

P is used in hypothesis H.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 2: Backtrace:

Not convertible.
Level 1: Backtrace:

Not convertible.