input: Write a function to return a sublist of prime numbers from a given list of integers. The function should take a list as input and return a new list containing only the prime numbers from the input list. If the input list is empty then return an empty 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])==[]
  assert prime_list([])==[]
  assert prime_list([2, 3, 5, 7, 11, 13])==[2, 3, 5, 7, 11, 13]
  assert prime_list([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[2, 3, 5, 7]
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)]