Goal:
  
  A : Type
  a : A
  L1 : list A
  P : list A → list A → A → A → Type
  IHL1 : ∀ L2 : list A,
           #|L1| = #|L2|
           → (∀ (n : nat) (x1 x2 : A),
                n < #|L1|
                → nth_error L1 n = Some x1
                  → nth_error L2 n = Some x2
                    → P (skipn (S n) L1) (skipn (S n) L2) x1 x2)
             → All2_fold P L1 L2
  a0 : A
  L2 : list A
  X : ∀ (n : nat) (x1 x2 : A),
        n < S #|L1|
        → nth_error (a :: L1) n = Some x1
          → nth_error (a0 :: L2) n = Some x2
            → P (skipn n L1) (skipn (S n) (a0 :: L2)) x1 x2
  n : nat
  x1 : A
  x2 : A
  H0 : BinInt.Z.lt (BinInt.Z.of_nat n) (BinInt.Z.of_nat #|L1|)
  H1 : BinInt.Z.of_nat #|L1| = BinInt.Z.of_nat #|L2|
  H : BinInt.Z.add (BinInt.Z.of_nat #|L1|) (BinNums.Zpos BinNums.xH) =
      BinInt.Z.of_nat #|a0 :: L2|
  cstr : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat #|a0 :: L2|)
  cstr0 : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat #|L2|)
  cstr1 : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat #|L1|)
  cstr2 : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat n)
  ============================
   (BinInt.Z.lt (BinInt.Z.add (BinInt.Z.of_nat n) (BinNums.Zpos BinNums.xH))
      (BinInt.Z.add (BinInt.Z.of_nat #|L1|) (BinNums.Zpos BinNums.xH)))


DEBUG:Going to execute:
Zify.zify_convert_to_euclidean_division_equations_flag