Goal:
  
  A : Type
  P : nat → A → Type
  n : nat
  hd : A
  tl : list A
  p : P n hd
  X : Alli P (S n) tl
  IHX : All_fold (λ (Γ : list A) (d : A), P (S n + #|Γ|) d) (List.rev tl)
  Γ : list A
  x : A
  X0 : P (S (n + #|Γ|)) x
  ============================
   (P (S (n + #|Γ|)) x)


DEBUG:Going to execute:
<coq-core.plugins.ltac::trivial@0> $1 $2

Goals:

DEBUG:Going to execute:
hnf

Goals:

DEBUG:Going to execute:
intros

Goals:

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 ]