Goal:
  
  A : Type
  B : Type
  f : A → B
  l : nat
  H : ∀ l0 : list A, map f (skipn l l0) = skipn l (map f l0)
  l0 : list A
  ============================
   (map f (skipn (S l) l0) = skipn (S l) (map f l0))


DEBUG:Going to execute:
match goal with
           | H:¬ _ |- _ => solve [ case H; trivial ]
           end
Level 1: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.
Level 0: Backtrace:

No such assumption.