input: Write a python function to check for prime numbers in a list.
  assert check_prime_numbers([4, 15, 22, 50, 119])==[]
  assert check_prime_numbers([2, 3, 5, 7, 11, 13])==[2, 3, 5, 7, 11, 13]
  assert check_prime_numbers([4, 6, 8, 10, 12])==[]
output: def check_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)]