Lemma related to the counting of numbers in list

Question

I want to solve the lemma with the help of following functions. Here is code

 Theorem count_values:forall(n m:nat)(l:list nat),
  n<>0->
  m<>0->