There are some related problems:
1. dual cone is closed
2. Why is any subspace a convex cone?
Consider a cone $\mathcal{C}(A)$:
$$\mathcal{C}(A) = \{Ax: x\geq 0\}$$
This is a cone generated by the columns of $A$. Since $x\geq 0$, the construction meets the definition of being a convex cone. Therefore $\mathcal{C}(A)$ is a convex cone.
Is it closed?
I think it is without further proof.
However, in the following lecture from Stanford:
http://web.stanford.edu/class/msande310/lecture03.pdf (p.9 and p.11)
In the proof of Farkas lemma, the author cannot guarantee that $\mathcal{C}$ is closed convex before further proof. So the author utilize convergence sequence to prove that.