input: Write a function to create a Python program that takes a list of integers and returns the sublist consisting of the prime numbers from the list. If the given list is empty, return an empty list.
  
  def is_prime(num):
      if num < 2:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  def prime_list(lst):
      return [num for num in lst if is_prime(num)]
  
  assert prime_list([2, 8, 3, 6, 10, 7, 14, 11, 17, 15]) == [2, 3, 7, 11, 17]
  assert prime_list([]) == []
  assert prime_list([4, 6, 8, 9, 10]) == []
  assert prime_list([2, 3, 5, 7, 11]) == [2, 3, 5, 7, 11]
  assert prime_list([1, 0, -1]) == []
output: def prime_list(lst):
      return [num for num in lst if is_prime(num)]