A posthumous book on number theory by Dirichlet appeared in 1859. It stated that Euclid's proof of the infinitude of primes was by contradiction, starting with an assumption that only finitely many primes exist and then deducing a contradiction.
Euclid's actual proof, recast in modern language, was that if $S$ is any finite set of primes (with no assumption that it contains the smallest $n$ primes nor that it contains all primes), then the prime factors of $1+\prod S$ are not members of $S;$ hence there are always more primes than what one already has.
For example, if $S=\{5,7\}$ then $1+\prod S=36=2\times2\times3\times3$ and the new primes are $2$ and $3.$
This requires no assumption that $S$ contains all primes.
Only the assumption that $S$ contains all primes could justify the conclusion that $1+\prod S$ has no prime factors, and so "is therefore itself prime", to quote G. H. Hardy (no relation to me, as far as I know) on pages 122–123 of the 1908 edition of A Course of Pure Mathematics (but not in the posthumous 10th edition).
The erroroneous belief that $1+\prod S$ is prime whenever $S$ is the set of the smallest $n$ primes for some $n$ has been held by some conscientious persons. The smallest (but not the only) counterexample is $1+(2\times3\times5\times7\times11\times13) = 59\times509.$
Catherine Woodgold and I examined in some detail the error of thinking that this proof is by contradiction in "Prime Simplicity", Mathematical Intelligencer, volume 31, number 4, Fall 2009, pages 44–52.