Goal:
  
  A : Type
  B : Type
  C : Type
  P : A → B → C → Type
  c : C
  a : C
  ls1 : list C
  IH : ∀ (ls2 : list A) (ls3 : list B),
         All (λ z : C, All2 (λ (x : A) (y : B), P x y z) ls2 ls3) (c :: ls1)
         → All2 (λ (x : A) (y : B), All (P x y) (c :: ls1)) ls2 ls3
  a0 : A
  ls2 : list A
  b : B
  ls3 : list B
  X : P a0 b c
  X2 : All2 (λ (x : A) (y : B), P x y c) ls2 ls3
  X3 : All
         (λ z : C, All2 (λ (x : A) (y : B), P x y z) (a0 :: ls2) (b :: ls3))
         ls1
  X1 : P a0 b a
  X4 : All2 (λ (x : A) (y : B), P x y a) ls2 ls3
  ============================
   (All2 (λ (x : A) (y : B), All (P x y) (c :: a :: ls1)) 
      (a0 :: ls2) (b :: ls3))


DEBUG:Going to execute:
let is_ctor_list x :=
            lazymatch x with
            | [] => idtac
            | _ :: _ => idtac
            end
           in
           match goal with
           | H:All2 _ ?x ?y
             |- _ =>
                 (first [ is_ctor_list x | is_ctor_list y ]); inversion H;
                  clear H
           | H:All2_fold _ ?x ?y
             |- _ =>
                 (first [ is_ctor_list x | is_ctor_list y ]); inversion H;
                  clear H
           | H:All _ ?x |- _ => is_ctor_list x; inversion H; clear H
           | |- (_ :: _ = []) + _ => right
           | |- (?x = ?x) + _ => left
           end
Level 0: Backtrace:

Failed to progress.
Level 0: Backtrace:

Failed to progress.
Level 0: Backtrace:

Failed to progress.