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


DEBUG:Going to execute:
let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"