input: Write a function to check if a given list of integers (`lst`) contains only prime numbers or not. If all elements in the list are prime numbers, the function should return True, otherwise it should return False. If the list is empty, the function should return True.
  assert check_prime_list([7, 8, 12, 19, 22, 23])==False
  assert check_prime_list([7, 19, 23])==True
  assert check_prime_list([2])==True
  assert check_prime_list([])==True
  assert check_prime_list([4, 6, 8])==False
output: def check_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
      
      for num in lst:
          if not is_prime(num):
              return False
      return True