Goal:
  
  A : Type
  B : Type
  f : nat → A → B
  x : A
  l : list A
  IHl : ∀ n : nat,
          mapi_rec f (List.rev l) n =
          List.rev (mapi_rec (λ (k : nat) (x : A), f (#|l| + n - S k) x) l 0)
  n : nat
  cstr : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat n)
  cstr0 : BinInt.Z.le BinNums.Z0 (BinInt.Z.of_nat #|l|)
  z1 : BinNums.Z
  H1 : BinInt.Z.lt BinNums.Z0
         (BinInt.Z.sub
            (BinInt.Z.add
               (BinInt.Z.add (BinInt.Z.of_nat #|l|) (BinNums.Zpos BinNums.xH))
               (BinInt.Z.of_nat n))
            (BinInt.Z.add (BinInt.Z.add (BinInt.Z.of_nat #|l|) BinNums.Z0)
               (BinNums.Zpos BinNums.xH)))
       ∧ z1 =
         BinInt.Z.sub
           (BinInt.Z.add
              (BinInt.Z.add (BinInt.Z.of_nat #|l|) (BinNums.Zpos BinNums.xH))
              (BinInt.Z.of_nat n))
           (BinInt.Z.add (BinInt.Z.add (BinInt.Z.of_nat #|l|) BinNums.Z0)
              (BinNums.Zpos BinNums.xH))
       ∨ BinInt.Z.le
           (BinInt.Z.sub
              (BinInt.Z.add
                 (BinInt.Z.add (BinInt.Z.of_nat #|l|)
                    (BinNums.Zpos BinNums.xH)) (BinInt.Z.of_nat n))
              (BinInt.Z.add (BinInt.Z.add (BinInt.Z.of_nat #|l|) BinNums.Z0)
                 (BinNums.Zpos BinNums.xH))) BinNums.Z0 ∧ 
         z1 = BinNums.Z0
  ============================
   (BinInt.Z.of_nat n = z1)


DEBUG:Going to execute:
Zify.zify_convert_to_euclidean_division_equations_flag