Good catch. The proof could simply state that, like all integers > 1, N must have a prime divisor, and that divisor cannot be any of the listed primes, since di

Good catch. The proof could simply state that, like all integers > 1, N must have a prime divisor, and that divisor cannot be any of the listed primes, since dividing N by any of them leaves remainder 1.