Goal:
  
  A : Type
  P : A → A → Prop
  a : A
  l : list A
  a0 : A
  l' : list A
  r : A
  r' : A
  H : Forall2 P (a :: l ++ [r]) (a0 :: l' ++ [r'])
  H3 : P a a0
  H5 : Forall2 P (l ++ [r]) (l' ++ [r'])
  H0 : Forall2 P l l'
  H1 : P r r'
  ============================
   (P r r')


DEBUG:Going to execute:
fun flags =>
             match reverse goal with
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
             | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
             | _ => Ltac.assumption
             end