Goal:
  
  A : Type
  B : Type
  C : Type
  P : A → B → C → Type
  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) ls1
         → (ls1 = []) + All2 (λ (x : A) (y : B), All (P x y) ls1) ls2 ls3
  a0 : A
  ls2 : list A
  b : B
  ls3 : list B
  X1 : All
         (λ z : C, All2 (λ (x : A) (y : B), P x y z) (a0 :: ls2) (b :: ls3))
         ls1
  X : P a0 b a
  X2 : All2 (λ (x : A) (y : B), P x y a) ls2 ls3
  n : nat
  x1 : A
  x2 : B
  H : n < #|ls2|
  H0 : nth_error ls2 n = Some x1
  H1 : nth_error ls3 n = Some x2
  ============================
   (All (P x1 x2) (a :: ls1))


DEBUG:Going to execute:
case not_locked_false_eq_true; Ltac.assumption
Level 1: Backtrace:

Not an inductive goal with 1 constructor.
Level 0: Backtrace:

Not an inductive goal with 1 constructor.
Level 0: Backtrace:

No applicable tactic.
Level 0: Backtrace:

No applicable tactic.