Goal:
  
  A : Type
  B : Type
  P : list A → list A → A → A → B → Type
  b : B
  a : B
  ls1 : list B
  IH : ∀ ls2 ls3 : list A,
         All
           (λ z : B,
              All2_fold (λ (l1 l2 : list A) (x y : A), P l1 l2 x y z) ls2 ls3)
           (b :: ls1)
         → All2_fold
             (λ (l1 l2 : list A) (x y : A), All (P l1 l2 x y) (b :: ls1)) ls2
             ls3
  a0 : A
  ls2 : list A
  a1 : A
  ls3 : list A
  X : All2_fold (λ (l1 l2 : list A) (x y : A), P l1 l2 x y b) ls2 ls3
  X2 : P ls2 ls3 a0 a1 b
  X3 : All
         (λ z : B,
            All2_fold (λ (l1 l2 : list A) (x y : A), P l1 l2 x y z)
              (a0 :: ls2) (a1 :: ls3)) ls1
  X1 : All2_fold (λ (l1 l2 : list A) (x y : A), P l1 l2 x y a) ls2 ls3
  X4 : P ls2 ls3 a0 a1 a
  ============================
   (All2_fold (λ (Γ Γ' : list A) (d d' : A), P Γ Γ' d d' a) ls2 ls3)


DEBUG:Going to execute:
first
[ progress intros
| progress subst
| 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
| exactly_once constructor
| solve
[ eauto
| (first [ eapply All2_impl | eapply All2_fold_impl | eapply All_impl ]); tea;
   cbn; intros *; inversion 1 + constructor; subst; eauto ]
| congruence
| now
apply All_refl; constructor
| apply All2_from_nth_error => //; lia
| progress cbn in *
| match goal with
  | H:?x ≠ ?x ∨ ?A |- _ => assert A by now destruct H; clear H
  end ]