Goal:
  
  A : Type
  P : A → Type
  f : A → A
  x : A
  l : list A
  p : P x
  X : All P l
  H : ∀ x : A, P x → f x = x
  H0 : map f l = l
  ============================
   (f x :: map f l = x :: l)


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