Goal:
  
  A : Type
  P : nat → A → Type
  n : nat
  x : A
  Γ : list A
  IHΓ : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
        → Alli P n Γ
  a : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
  p : P (n + #|List.rev Γ|) x
  ============================
   (Alli P (n + #|Γ|) [x])


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.

Goals:
  
  A : Type
  P : nat → A → Type
  n : nat
  x : A
  Γ : list A
  IHΓ : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
        → Alli P n Γ
  a : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
  p : P (n + #|List.rev Γ|) x
  ============================
   (Alli P n Γ)

  
  A : Type
  P : nat → A → Type
  n : nat
  x : A
  Γ : list A
  IHΓ : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
        → Alli P n Γ
  a : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
  p : P (n + #|List.rev Γ|) x
  ============================
   (Alli P (n + #|Γ|) [x])


DEBUG:Going to execute:
eauto
Level 0: Backtrace:

No matching clauses for match.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.
Level 1: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.

Goals:
  
  A : Type
  P : nat → A → Type
  n : nat
  x : A
  Γ : list A
  IHΓ : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
        → Alli P n Γ
  a : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
  p : P (n + #|List.rev Γ|) x
  ============================
   (Alli P n Γ)

  
  A : Type
  P : nat → A → Type
  n : nat
  x : A
  Γ : list A
  IHΓ : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
        → Alli P n Γ
  a : All_fold (λ (Γ : list A) (d : A), P (n + #|Γ|) d) (List.rev Γ)
  p : P (n + #|List.rev Γ|) x
  ============================
   (Alli P (n + #|Γ|) [x])


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