Goal:
  
  A : Type
  P : A → Type
  x : A
  x0 : A
  l : list A
  H : x0 = x ∨ In x l
  p : P x0
  X : All P l
  IHX : In x l → ∥ P x ∥
  ============================
   (∥ P x ∥)


DEBUG:Going to execute:
solve
[ do
![ solve
 [ trivial | apply : eq_sym ; trivial ]
 | discriminate
 | contradiction
 | Ltac.split ]
| case not_locked_false_eq_true; Ltac.assumption
| match goal with
  | H:¬ _ |- _ => solve [ case H; trivial ]
  end ]