Goal:
  
  A : Type
  l' : list A
  a0 : A
  r' : list A
  H0 : #|a0 :: r'| = #|a0 :: r'|
  H : (l' ++ [a0]) ++ r' = (l' ++ [a0]) ++ r'
  IHr : ∀ l l' r'0 : list A,
          l ++ r' = l' ++ r'0 → #|r'| = #|r'0| → l = l' ∧ r' = r'0
  ============================
   (l' = l' ∧ a0 :: r' = a0 :: r')


DEBUG:Going to execute:
symmetry; trivial
Level 1: Backtrace:

 The relation and is not a declared reflexive relation. Maybe you need to require the Coq.Classes.RelationClasses library
Level 0: Backtrace:

 The relation and is not a declared reflexive relation. Maybe you need to require the Coq.Classes.RelationClasses library