python generator prime numbers

# effiecent and fast way to generate prime numbers
def primeCheck(n):
    if n == 1 or n == 0 or (n % 2 == 0 and n > 2):
        return False
    else:
        for o in range(3, int(n ** (1 / 2)) + 1, 2):
            if n % o == 0:
                return False
        return True


for a in range(2**15):
    if primeCheck(a):
        prime_numbers.append(a)

#function that check if ur number is a prime number in one line code
def is_prime(number): return not(bool([True for i in range(2, number//2) if number % i == 0 ]))

#for exmple 
print(is_prime(42))
print(is_prime(43))

# Prime number generator
def prime_generator(end):
    for n in range(2, end):     # n starts from 2 to end
        for x in range(2, n):   # check if x can be divided by n
            if n % x == 0:      # if true then n is not prime
                break
        else:                   # if x is found after exhausting all values of x
            yield n             # generate the prime


g = prime_generator(1000)       # give firt 1000 prime numbers
print(list(g))