I want to show that if the set $A$ is an infinite subset of natural numbers $N$, then $\text{card}(A)=\text{card}(N)$. To do so, it suffices to find an injective function $f:N\rightarrow A$.
One natural way to construct $f$ is as follows: we assign to $f(1)$ the smallest element of $A$. Then we omit the smallest element of $A$ and we assign to $f(2)$ the smallest element of the remaining numbers and so on.
I do not want to use the well ordering principle. I argue as follows. I assign to $f(1)$ an arbitary element of A like $a_1$.Then I remove $a_1$ from $A$ and assign to $f(2)$ an arbitrary element of $A/a_1$. Since $A$ is infinite, I can assign to $f(n)$ a number from $A$ for any $n$ because $A$ never gets empty.
Do I need to use the axiom of choice here??
No. You don't need the axiom of choice. $\Bbb N$ is well-ordered without relying on the axiom of choice, indeed it is a defining property of $\Bbb N$: it is the unique non-empty linear order that is well-ordered, without a maximal, and every element has a successor.
The thing about the term "arbitrary" is that you're effectively hiding a choice function from the non-empty subsets of $A$ (or at least the co-finite subsets). So the question is why such a function exists, and in order to prove this you'll need to resort to proving that $A$ is either countable, or at least there is an injection from $\Bbb N$ into $A$.
So you run into a slight circularity. Of course, the axiom of choice might be used for the argument a priori, and then removed in the a postriori by arguing "actually since there is a well-ordering of $A$ as a subset of $\Bbb N$ here's a choice function".