Goal:
  
  A : Type
  B : Type
  x : A
  xs : list A
  f0 : A → B
  H : ∀ f : A → B,
        (λ (x : A) (_ : In x xs), f0 x) = (λ (x : A) (_ : In x xs), f x)
        → map_InP xs (λ (x : A) (_ : In x xs), f0 x) = map f xs
  ============================
   (map f0 xs = map f0 xs)


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