Goal:
  
  A : Type
  f : A → A
  x : A
  l : list A
  p : f x = x
  X : All (λ x : A, f x = x) l
  IHX : map f l = l
  ============================
   (x :: l = x :: l)


DEBUG:Going to execute:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]