Goal:
  
  A : Type
  H : ReflectEq A
  a1 : A
  l1 : list A
  a2 : A
  l2 : list A
  prefix : list A
  l1' : list A
  l2' : list A
  Heq : split_prefix l1 l2 = (prefix, l1', l2')
  Hind : let
         '(prefix, l1', l2') := split_prefix l1 l2 in
          l1 = prefix ++ l1' ∧ l2 = prefix ++ l2'
  Heq0 : (a1 == a2) = true
  Heqcall : (a1 :: prefix, l1', l2') = split_prefix (a1 :: l1) (a2 :: l2)
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a1 :: l1) (a2 :: l2) in
     a1 :: l1 = prefix ++ l1' ∧ a2 :: l2 = prefix ++ l2')


DEBUG:Going to execute:
match goal with
           | hyp:context [ CoreTactics.block ]
             |- _ =>
                 cbn beta in hyp; eqns_specialize_eqs_block hyp;
                  cbn[eq_rect_r eq_rect] in hyp
           end
Level 1: Backtrace:

No matching clauses for match.

Goals:
    A : Type  H : ReflectEq A  l2 : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix [] l2 in
     [] = prefix ++ l1' ∧ l2 = prefix ++ l2')

    A : Type  H : ReflectEq A  a : A  l : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a :: l) [] in
     a :: l = prefix ++ l1' ∧ [] = prefix ++ l2')

  
  A : Type
  H : ReflectEq A
  a1 : A
  l1 : list A
  a2 : A
  l2 : list A
  Heq : (a1 == a2) = false
  Heqcall : ([], a1 :: l1, a2 :: l2) = split_prefix (a1 :: l1) (a2 :: l2)
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a1 :: l1) (a2 :: l2) in
     a1 :: l1 = prefix ++ l1' ∧ a2 :: l2 = prefix ++ l2')

  
  A : Type
  H : ReflectEq A
  a1 : A
  l1 : list A
  a2 : A
  l2 : list A
  prefix : list A
  l1' : list A
  l2' : list A
  Heq : split_prefix l1 l2 = (prefix, l1', l2')
  Hind : let
         '(prefix, l1', l2') := split_prefix l1 l2 in
          l1 = prefix ++ l1' ∧ l2 = prefix ++ l2'
  Heq0 : (a1 == a2) = true
  Heqcall : (a1 :: prefix, l1', l2') = split_prefix (a1 :: l1) (a2 :: l2)
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a1 :: l1) (a2 :: l2) in
     a1 :: l1 = prefix ++ l1' ∧ a2 :: l2 = prefix ++ l2')


DEBUG:Going to execute:
tac c
Level 1: Backtrace:

No matching clauses for match.

Goals:
    A : Type  H : ReflectEq A  l2 : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix [] l2 in
     [] = prefix ++ l1' ∧ l2 = prefix ++ l2')

    A : Type  H : ReflectEq A  a : A  l : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a :: l) [] in
     a :: l = prefix ++ l1' ∧ [] = prefix ++ l2')

  
  A : Type
  H : ReflectEq A
  a1 : A
  l1 : list A
  a2 : A
  l2 : list A
  Heq : (a1 == a2) = false
  Heqcall : ([], a1 :: l1, a2 :: l2) = split_prefix (a1 :: l1) (a2 :: l2)
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a1 :: l1) (a2 :: l2) in
     a1 :: l1 = prefix ++ l1' ∧ a2 :: l2 = prefix ++ l2')

  
  A : Type
  H : ReflectEq A
  a1 : A
  l1 : list A
  a2 : A
  l2 : list A
  prefix : list A
  l1' : list A
  l2' : list A
  Heq : split_prefix l1 l2 = (prefix, l1', l2')
  Hind : let
         '(prefix, l1', l2') := split_prefix l1 l2 in
          l1 = prefix ++ l1' ∧ l2 = prefix ++ l2'
  Heq0 : (a1 == a2) = true
  Heqcall : (a1 :: prefix, l1', l2') = split_prefix (a1 :: l1) (a2 :: l2)
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a1 :: l1) (a2 :: l2) in
     a1 :: l1 = prefix ++ l1' ∧ a2 :: l2 = prefix ++ l2')


DEBUG:Going to execute:
idtac

Goals:
    A : Type  H : ReflectEq A  l2 : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix [] l2 in
     [] = prefix ++ l1' ∧ l2 = prefix ++ l2')

    A : Type  H : ReflectEq A  a : A  l : list A
  ============================
   (let
    '(prefix, l1', l2') := split_prefix (a :: l) [] in
     a :: l = prefix ++ l1' ∧ [] = prefix ++ l2')


DEBUG:Going to execute:
simp split_prefix
Level 2: evaluation returns
idtac
where
c := split_prefix l1 l2
of type
constr of type tacvalue

Level 2: evaluation returns
idtac
where
c := split_prefix l1 l2
of type
constr of type tacvalue

Level 2: evaluation returns
idtac
where
c := split_prefix l1 l2
of type
constr of type tacvalue

Level 2: evaluation returns
idtac
where
c := split_prefix l1 l2
of type
constr of type tacvalue