input: Write a function to determine if a given list of integers contains only prime numbers. If the list contains only prime numbers, the function should return True; otherwise, it should return False. If the input list is empty, the function should return True.
  assert check_prime_list([7, 8, 12, 19, 22, 23])==False
  assert check_prime_list([2, 19, 7, 3])==True
  assert check_prime_list([141, 12, 89, 100])==False
  assert check_prime_list([31, 59])==True
  assert check_prime_list([])==True
output: def check_prime_list(lst):
      if not lst:
          return True
      
      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
      
      for num in lst:
          if not is_prime(num):
              return False
      return True