input: Write a function `prime_list` that takes a list of integers and returns a list of prime numbers from the given list.
  assert prime_list([2, 8, 3, 6, 10, 7, 14, 11, 17, 15]) == [2, 3, 7, 11, 17]
  assert prime_list([4, 6, 8, 9, 10, 12, 14, 15, 16]) == []
  assert prime_list([]) == []
  assert prime_list([2, 3, 5, 7, 11, 13, 17, 19]) == [2, 3, 5, 7, 11, 13, 17, 19]
output: def prime_list(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      return [num for num in lst if is_prime(num)]