input: Write a function to filter prime numbers from a list.
  assert filter_prime_numbers([3, 4, 7, 11, 13, 18])==[3, 7, 11, 13]
  assert filter_prime_numbers([2, 5, 6, 8, 9, 10])==[2, 5]
  assert filter_prime_numbers([14, 15, 16, 17, 18, 19])==[17, 19]
output: def filter_prime_numbers(numbers):
      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 numbers if is_prime(num)]