input: Write a function named `prime_list` that takes a list of integers as input and returns a sublist consisting of the prime numbers from the original list. If the input list is empty, the function should 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]) == []  
  assert prime_list([]) == []  
  assert prime_list([2, 3, 5, 7, 11]) == [2, 3, 5, 7, 11]
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)]