Goal:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
cbv beta iota delta [TODO projection TODO projection] in id, id'
DEBUG LTAC Evaluated term: H1
DEBUG LTAC Evaluated term: (list A)
Level 4: type of id
 has value 
(list A)


Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
tac H

Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
DepElim.do_case hyp

Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
fun p =>
             DepElim.introduce p;
              DepElim.elim_case p || destruct p || (case p; clear p)

Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
DepElim.introduce p;
            DepElim.elim_case p || destruct p || (case p; clear p)

Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
DepElim.introduce p
Level 2: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := H
of type
ident of type tacvalue

Level 2: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := H
of type
ident of type tacvalue

Level 1: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := H
of type
ident of type tacvalue

Level 1: evaluation returns
DepElim.introduce p; DepElim.elim_case p || destruct p || (case p; clear p)
where
p := H
of type
ident of type tacvalue


Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
fun p => first
             [ match p with
               | _ => generalize dependent p; intros p
               end
             | intros
             until
             p
             | intros
             until
             1
             | intros ]

Goals:
  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := [] |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ [])

  
  A : Type
  P : list A → A → Type
  Q : list A → list A → A → A → Type
  Γ : list A
  d : A
  Γ0 : list A
  X : All_fold P Γ0
  p : P Γ0 d
  IHX : ∀ Γ : list A,
          All2_fold Q Γ Γ0
          → All2_fold (λ (Γ0 Γ' : list A) (d d' : A), P Γ' d' × Q Γ0 Γ' d d')
              Γ Γ0
  H1' : list A
  H1 : list A
  H : All2_fold Q H1' H1
  ============================
   ({| pr1 := Γ; pr2 := d :: Γ0 |} = {| pr1 := H1'; pr2 := H1 |}
    → let H := CoreTactics.block in
      let H0 := CoreTactics.block in
      All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ' d' × Q Γ Γ' d d') Γ
        (d :: Γ0))


DEBUG:Going to execute:
first
[ match p with
  | _ => generalize dependent p; intros p
  end
| intros
until
p
| intros
until
1
| intros ]