Goal:
  
  A : Type
  P : list A → A → Type
  Q : list A → A → Type
  X : ∀ (Γ : list A) (x : A), P Γ x → Q Γ x
  ============================
   (All_fold Q [])


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 ]