This answer builds on Qiaochu's and uses the same definition as Qiaochu, to wit: A ring $R$ is noetherian if, for any nonempty collection of ideals $\mathcal{I}$, there is some $I \in \mathcal{I}$ which is not properly contained in any $J \in \mathcal{I}$.
Theorem: If $R$ is noetherian, then $R[x]$ is noetherian.
This proof is basically taking the standard proof and rephrasing it to use Qiaochu's definition and be careful about choice.
I'm going to try to systematically use the following conventions: Ideals in $R[x]$ get capital letters; ideal in $R$ get overlined capital letters. Sets of ideals in $R[x]$ get calligraphic letters. I found that I could manage to write this without ever assigning a name to a set of ideals in $R$.
For any ideal $I \subseteq R[x]$, and any integer $j \geq 0$, define
$$s_j(I) := \{ r \in R : \mbox{there is an element of $I$ of the form } r x^j + r_{j-1} x^{j-1} + \cdots +r_0 \}$$
Observe that $s_j(I)$ is an ideal and $s_j(I) \subseteq s_{j+1}(I)$.
Lemma: If $R$ is noetherian, and $I \subseteq R[x]$ is an ideal, then there is an index $j$ such that $s_k(I) = s_j(I)$ for $k \geq j$.
Proof: Let $s_j(I)$ be a maximal element in $\{ s_j(I) \}_{j \geq 0}$. Let $k \geq j$. Then we observed above that $s_k(I) \supseteq s_j(I)$. But, by the definition of a maximal element, we do not have $s_k(I) \supsetneq s_j(I)$, so $s_k(I) = s_j(I)$. $\square$.
We will denote the ideal $s_j(I)$ defined in the above lemma as $s_{\infty}(I)$.
For $\mathcal{I}$ a collection of ideals in $R[x]$, we will write $s_j(\mathcal{I})$ or $s_{\infty}(\mathcal{I})$ for the result of applying $s_j$ or $s_{\infty}$ to each element of $\mathcal{I}$. So $s_j(\mathcal{I})$ is a set of ideals in $R$.
Let $\mathcal{I}$ be a collection of ideals in $R[x]$. Since $R$ is noetherian, there is a maximal element $\bar{J}$ in $s_{\infty}(\mathcal{I})$. Let $\mathcal{J}$ be the set of all $I \in \mathcal{I}$ with $s_{\infty}(I) = \bar{J}$.
Note that no element of $\mathcal{I} \setminus \mathcal{J}$ contains an element of $\mathcal{J}$, by the maximality of $\bar{J}$, so it is enough to show that $\mathcal{J}$ has a maximal element.
Choose an ideal $K \in \mathcal{J}$. (Making one choice does not use AC.) Let $m$ be an index such that $s_m(K) = \bar{J}$. Let $\mathcal{K}$ be the collection of ideals $I \in \mathcal{J}$ for which $s_m(I) = \bar{J}$. Note that no element of $\mathcal{J} \setminus \mathcal{K}$ can properly contain an element of $\mathcal{K}$, so it is enough to show that $\mathcal{K}$ has a maximal element.
We now make finitely many dependent choices.
Choose a maximal element $\bar{J}^{m-1}$ in $s_{m-1}(\mathcal{K})$; let $\mathcal{K}_{m-1}$ be the set of $I \in \mathcal{K}$ with $s_{m-1}(I)=\bar{J}^{m-1}$; it is enough to show that $\mathcal{K}_{m-1}$ has a maximal element.
Choose a maximal element $\bar{J}^{m-2}$ in $s_{m-2}(\mathcal{K}_{m-1})$; let $\mathcal{K}_{m-2}$ be the set of $I \in \mathcal{K}^{m-1}$ with $s_{m-2}(I)=\bar{J}^{m-2}$; it is enough to show that $\mathcal{K}_{m-2}$ has a maximal element.
Continue in this manner to construct $\mathcal{K}_{m-3}$, $\mathcal{K}_{m-4}$, ..., $\mathcal{K}_0$. Since we are only making finitely many choices, we don't need AC; see my answer here.
At the end, we have a nonempty collection $\mathcal{K}_0$ of ideals such that, for any $I$ and $J \in \mathcal{K}_0$, and any $j \geq 0$, we have $s_j(I)= s_j(J)$. I claim that any element of $\mathcal{K}_0$ is maximal.
Let $I$ and $J \in \mathcal{K}_0$ and suppose that $I \supseteq J$. I will prove that $I=J$. This shows that every element of $\mathcal{K}_0$ is maximal.
Let $I_{\leq d}$ be the set of polynomials in $I$ of degree $\leq d$. I will show by induction on $d$ that $I_{\leq d} = J_{\leq d}$. The base case is $d=-1$, where both sides are $\{ 0 \}$. Since $I \supseteq J$, I just need to show that $I_{\leq d} \subseteq J_{\leq d}$.
Let $f \in I_{\leq d}$ and let the leading term of $f$ be $r x^d$. Then $r \in s_d(I) = s_d(J)$ so there is some $g \in J_{\leq d}$ with leading term $r$. Since $I \supseteq J$, we have $g \in I$ and hence $f-g \in I$. Since $\deg(f-g) < d$, by the induction hypothesis, we have $f-g \in J$. So $f = (f-g)+g \in J$. QED