Goal:
  
  A : Type
  B : Type
  f : A → B
  a : A
  l : list A
  H : a :: l ≠ []
  e : map f (a :: l) = []
  ============================
   (a :: l = [])


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