Looking at the ZFC axioms (in the Wikipedia version), the axiom of infinity stands out because it contains an extremely specific construction. This seems rather unelegant to me, therefore I've thought about whether it could be replaced by a more generic version.
Now one property of the set natural numbers in standard construction (and indeed, of any limit ordinal, if I understand it correctly) is that it is the union of all its elements.
Now from trying it seems to me (although I have no formal proof of that) that the only finite set with this property is the empty set (for which it trivially holds), because you cannot construct a non-empty finite set which has that property without violating the axiom of foundation.
Therefore I thought of the following
Axiom of Non-Constructive Infinity: There exists a non-empty set which is the union of all its members.
The question is: Is ZFC with Infinity replaced by Non-Constructive Infinity equivalent to ZFC? (And what about ZF without C?)
It is easy to prove from the axiom of foundation that any non-empty set which is the union of all its members must contain the empty set (because all its members are subsets, and thus any non-empty member cannot be disjunct with it). However I neither managed to prove that such a set must for each element $x$ also contain $x\cup\{x\}$, nor was I able to construct a counterexample. (But then, even if a counterexample existed, it might still be possible to construct such a "standard-infinity set" from any "self-union set", so it would by itself not negatively answer my question).
I claim that is suffices to show that such set is infinite. We can prove that there are only finitely many sets of a given finite rank, and they are all finite. So an infinite set must have an infinite rank, so $\omega$ must exist, which is an inductive set.
Let us that if $x$ a non-empty set of a finite rank then $\bigcup x\neq x$. $\DeclareMathOperator{rank}{rank}$
It suffices to show that $\rank(\bigcup x)<\rank(x)$, when $x$ is non-empty and has a finite rank.
Recall that for finite sets it holds that $\rank(x)=\max\{\rank(y)+1\mid y\in x\}$. Therefore if $a\in\bigcup x$ then there is some $b\in x$ such that $a\in b$, so $\rank(a)+1<\rank(x)$.
Therefore $\max\{\rank(a)+1\mid a\in\bigcup x\}=\rank(\bigcup x)<\rank x$.