Proof of infinitude of prime elements? All proofs of infinitude of primes which I know of essentially prove that there are infinitely many irreducible elements of $\Bbb Z$, and with this goal in mind we can very easily extend this proof to many other rings (e.g. to $\Bbb Z[\sqrt{-d}],d\in\Bbb N$). Because in $\Bbb Z$ (and many other rings) it is known that all irreducible elements are prime elements. However, this isn't true always.
Suppose that we do not know that all irreducibles are prime. Is there any direct proof that there are infinitely many prime elements in $\Bbb Z$?
I am mainly interested in this because I hope for such proofs to generalize to rings in which implication "irreducible $\Rightarrow$ prime" is not true.
Thanks in advance.
Edit: Here are my definitions. Let $R$ be a fixed commutative ring with unity and $p\in R$ any non-zero element.
Call $p$ irreducible if, whenever $p=a\cdot b,a,b\in R$ then exactly one of $a$ and $b$ is a unit.
Call $p$ prime if it's not a unit and whenever $p$ divides $a\cdot b$, then $p$ divides $a$ or $p$ divides $b$ (where we say that $x$ divides $y$ if $y=x\cdot z$ for some $z\in R$).
 A: As per the comments, here is an analytic proof (due to Euler) that can be generalised to the ring of integers of a number field (a number field is a finite extension $K$ of $\mathbb Q$, and its integer ring is the ring of algebraic integers contained in it). This can then be used to show that $\mathbb Z[\sqrt d]$ has infinitely many primes. (If $d \not\equiv 1 \pmod 4$, then $\mathbb Z[\sqrt d]$ is the integer ring of $\mathbb Q(\sqrt d)$).

Consider the Riemann Zeta function
$$\zeta(s) = \sum_{n=1}^\infty \frac{1}{n^s}$$
It is clear that $\lim_{s\to 1^+}\zeta(s) = \infty$. There is also a multiplicative form of the Riemann zeta function, convergent for $s>1$ given by
$$\zeta(s) = \prod_{p \text{ prime}}(1-p^{-s})^{-1}$$
If there are only finitely many primes $p_1, \ldots, p_n\in\mathbb Z$, then using the second formula, $\zeta(s)$ is a finite product, and in particular, $\lim_{s\to 1^+}\zeta(s)$ is a finite product - this contradicts the fact that  $\lim_{s\to 1^+}\zeta(s) = \infty$.

There is a generalisation of the Riemann zeta function, called the Dedekind zeta function, $\zeta_K(s)$, where $K$ is a number field, defined by
$$\zeta_K(s) = \sum_{\mathfrak a\text{ an ideal}}(\mathbb N\mathfrak a)^{-s}$$where $\mathbb N\mathfrak a = \#(\mathcal O_K/\mathfrak a)$ is the ideal norm. When $K = \mathbb Q$, this is just the regular Riemann zeta function. Using the fact that in such rings, any ideal can be uniquely factorised into a product of prime ideals, we can show that 
$$\zeta_K(s) = \prod_{\mathfrak p\text{ a prime ideal}}(1-(\mathbb N\mathfrak p)^{-s})^{-1}$$
which gives the existence of infinitely many prime ideals similarly as before.
One can show that an infinite number of these ideals are principal, and using the fact that an element $x$ of a ring is prime if and only if the ideal it generates is prime, we can deduce that there are infinitely many prime elements.
A: 
Suppose that we do not know that all irreducibles are prime. Is there any direct proof that there are infinitely many prime elements in $\mathbb{Z}$?

Good question.  Euclid's proof that there are infinitely many primes is in fact a proof that there are infinitely many irreducibles, and then elsewhere he uses the Euclidean algorithm to prove that if $p$ is irreducible and $p \mid ab$, then $p \mid a$ or $p \mid b$: i.e., that all irreducible elements are prime.  Since existence of factorizations into irreducible elements in $\mathbb{Z}$ is quite clear by well-ordering, this latter result has all the content that $\mathbb{Z}$ is a unique factorization domain.  Alternately, it follows easily from the Euclidean algorithm that every ideal in $\mathbb{Z}$ is principal, so $\mathbb{Z}$ is a PID hence also a UFD (although the proof of the "hence" is not as quick as a direct proof in the case of $\mathbb{Z}$).  Assuming by a "direct proof" you mean an argument analogous to the proof of infinitely many irreducibles and not the Euclidean algorithm / PID / UFD stuff, my answer is not that I know of, no.
I do know of one partial streamlining: that $\mathbb{Z}$ is a UFD can be proved by an inductive argument, due to Lindemann and Zermelo: see e.g. the introduction to these notes.  So one can use that and Euclid's proof of the infinitude of irreducibles and conclude that $\mathbb{Z}$ has infinitely many prime elements without having to go through the Euclidean algorithm or Euclid's Lemma (at least not explicitly: if you want to, you can see traces of these ideas in the inductive proof).  But in terms of a "direct, one step argument": no, I don't think so!

I am mainly interested in this because I hope for such proofs to generalize to rings in which implication "irreducible ⇒ prime" is not true.

Great followup.  I happened to be thinking of this kind of thing myself yesterday: in the context of a seminar on the process of mathematical research that I am (co-)leading, I presented an "axiomatic version" of Euclid's argument and then later asked myself what else this argument proves.  It seems to me that irreducibles is a fundamental feature of this argument, and though there are variations -- including one which is justly popular on this site, that a ring with infinitely many elements and finitely many units has infinitely many maximal ideals -- I don't see how to squeeze prime elements out of this argument in any way.
Here is my abstract version of Euclid's argument:

Theorem: Let $R$ be a factorization domain (a.k.a. atomic domain: that is, every nonzero nonunit admits a factorization -- not necessarily unique! -- into a product of irreducibles) which is not a field and which satisfies Condition (E): for every nonzero element $x \in R$, there is $y \in R$ such that $yx+1$ is not a unit of $R$.  Then $R$ has "infinitely many irreducibles", i.e., there is an infinite sequence $f_1,\ldots,f_n,\ldots$ of pairwise nonassociate irreducible elements.

You already know the proof: take any nonzero nonunit element of $R$ and factor it into irreducibles; that gives us one irreducible $f_1$.  Inductively, having produced nonassociate irreducibles $f_1,\ldots,f_n$, by Condition (E) there is $y \in R$ such that $z = y f_1 \cdots f_n + 1$ is not a unit.  It is also not zero, since that would force the $f_i$'s to be units.  So $z$ has an irreducible factor $f_{n+1}$, which if it divided (and thus was associate to) $f_i$ for any $1 \leq i \leq n$, it would divide $z-y f_1 \cdots f_n = 1$ and thus be a unit.
For instance, one nice consequence of this is the following (again, at least a close cousin of other results which have been presented here and elsewhere):

Corollary: a) An infinite factorization domain which is not a field and which has finite unit group has infinitely many (nonassociate) irreducibles.
b) The set of all irreducible elements in a factorization domain is either empty (in the case of a field) or infinite (otherwise).

Some cases in which it is easy and pleasant to establish Condition (E) directly include a polynomial ring $R[t]$ over any domain $R$ and the Gaussian integers $\mathbb{Z}[i]$ (or the ring of integers of any imaginary quadratic field).
What is this Condition (E) really?  It makes sense in any commutative ring and, for those who know about such things, is easily recognizable as saying that the Jacobson radical $J(R)$ -- i.e., the intersection of all maximal ideals -- is zero.  Now observe that a Dedekind domain $R$ has $J(R) = (0)$ precisely when it has infinitely many prime ideals.  So:

Theorem: A Dedekind domain has infinitely many prime ideals iff it has infinitely many (nonassociate) irreducibles.

Proof: As we just saw, Euclid's proof gives the forward direction.  Conversely, a Dedekind domain with finitely many prime ideals is a PID, and then the distinction between prime ideals, prime elements and irreducible elements evaporates: up to associates, we have only finitely many irreducible elements.
Thus in some sense Euclid's argument is "the only way" to show that a Dedekind domain has infinitely many irreducible elements, although in any given case it may be easier or harder to pull off a direct verification of Condition (E).
For instance, for any number field $K$, the ring of integers $\mathbb{Z}_K$ is the integral closure of a Dedekind domain with infinitely many prime ideals ($\mathbb{Z}$) in a finite degree field extension, so over every prime ideal $(p)$ of $\mathbb{Z}$ there lies at least one prime ideal $\mathfrak{p}$ of $\mathbb{Z}_K$.  So we have infinitely many prime ideals and thus infinitely many irreducible elements.  But can you show Condition (E) directly in, say, $\mathbb{Z}[\sqrt{2}]$?  It is not immediately obvious (to me) how to do so.
As in @Mathmo123's answer, it turns out to be the case that $\mathbb{Z}_K$ always has infinitely many prime elements.  But I regard this as a quite deep result of algebraic number theory that lies far away from these "general algebraic" considerations.  You need (don't you? do you??) to use Chebotarev Density to observe that the set of prime ideals of $K$ which split completely in the Hilbert class field of $K$ has positive density, and then use class field theory to deduce the result.
Let me try to persuade you that there is no "easy" connection between prime ideals and prime elements.  Indeed, here is a striking construction of L.E. Claborn (see Example 1.5 here): let $R$ be any Dedekind domain which is not a PID, let $\mathcal{P}$ be the set of all prime elements of $R$ and put $\tilde{R} = R[\frac{1}{p} \mid p \in \mathcal{P}]$, i.e., the localization of $R$ with respect to the multiplicative set generated by all the prime elements.  Then the pushforward map $\mathfrak{p} \rightarrow \mathfrak{p} \tilde{R}$ carries each principal prime ideal to the unit ideal and carries each nonprincipal prime ideal to a nonprincipal prime ideal.  (In fact, it induces an isomorphism on the ideal class groups.)  So $\tilde{R}$ is a Dedekind domain with infinitely many prime ideals but no prime elements!
Added: I just noticed that there is a result in the literature much stronger than some of the results I mentioned above.

Theorem (Cohen-Kaplansky, 1946): A factorization domain with only finitely many nonassociate irreducible elements has only finitely many prime ideals.

Proof: Consider a set of generators $X$ for a prime ideal $\mathfrak{p}$ in a factorization domain.  For each element $x \in X$, some irreducible divisor $f_x$ of $X$ also lies in $\mathfrak{p}$, and thus $\{f_x \mid x \in X\}$ is also a set of generators, and the ideal so generated clearly does not change if we replace each $f_x$ by any associate element.  We're done!
