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:
<Coq.Init.Tauto.is_disj> flags X1; (solve
            [ Ltac.left; t_tauto_intuit | Ltac.right; t_tauto_intuit ])