In set theory, many properties/relations of interest can be expressed as $\Delta_0$ formulas (formulas with only bounded quantifiers):
\begin{align} \text{empty}(a) &\equiv \forall x \in a . \bot \\ \text{union}(a, b) &\equiv (\forall x \in b . \forall y \in x . x \in a) \land (\forall y \in a . \exists x \in b . y \in x) \\ \text{singleton}(a, b) &\equiv b \in a \land (\forall x \in a . x = b) \\ \text{pair}(a, b, c) &\equiv b \in a \land c \in a \land (\forall x \in a . x = b \lor x = c) \\ \text{subset}(a, b) &\equiv \forall x \in a . x \in b \\ \text{successor}(a, b) &\equiv b \in a \land \text{subset}(b, a) \land (\forall x \in a . x \in b \lor x = b) \\ \text{inductive}(a) &\equiv (\exists x \in a . \text{empty}(x)) \land (\forall x \in a . \exists y \in a . \text{successor}(y, x)) \\ \text{transitive}(a) &\equiv \forall x \in a . \forall y \in x . y \in a \\ \text{transitiveclosure}(a, b) &\equiv b \in a \land \text{transitive}(a) \\ \text{intersection}(a, b) &\equiv (\forall x \in b . \forall y \in x . ((\forall z \in b . y \in z) \to y \in a)) \land \forall y \in a . \forall x \in b . y \in x \end{align}
Thus several axioms of ZFC can be expressed in the form: \begin{align} \forall a_1 \ldots \forall a_n . \exists u . & \phi \end{align} where $\phi$ is $\Delta_0$. For example: \begin{align} \exists u . & \text{empty}(u) & \text{empty set axiom} \\ \forall a . \forall b . \exists u . & \text{pair}(u, a, b) & \text{pairing axiom} \\ \forall a . \exists u . & \text{union}(u, a) & \text{union axiom} \\ \exists u . & \text{inductive}(u) & \text{infinity axiom} \end{align}
There is, however, an odd one out: powerset.
\begin{align} \text{powerset}(a, b) \equiv \forall x . (\text{subset}(x, b) \to x \in a) \land (\forall x \in a . \text{subset}(x, b)) \end{align}
\begin{align} \forall a . \exists u . & \text{powerset}(u, a) & \text{powerset axiom} \end{align}
The powerset relation is not $\Delta_0$.
According to nlab:
When power sets don’t exist at all, whether as a set or a proper class, this results in strictly weaker foundations, since in this case one simply cannot form various mathematical structures which require the use of power sets, such as the Dedekind real numbers, topological spaces, frames, and locales. This is usually the case for predicative mathematics done internally in a Heyting or Boolean pretopos, as well as for predicative material set theories like Kripke–Platek set theory which do not have an internal notion of class. In dependent type theory, this notion of predicativity requires not having any type universes in the type theory itself, since otherwise $\sum_{A:U} \text{isProp}(A)$ is a large type of propositions. In addition, unlike for set theory, not having power sets in dependent type theory results in additional structure like formal topologies or inductive covers not being definable in the type theory, since without universes or types of propositions one cannot define relations between elements and subtypes.
My question is as follows: Let ZFC- be the axioms of ZFC without powerset, as described in [1]. Let A be an axiom of the form $\forall a_1 \ldots \forall a_n . \exists u . \phi$ where $\phi$ is $\Delta_0$, such that ZFC- + A is consistent and interprets ZFC. Are there any examples of such A, in the literature or otherwise? If so, what are they?
References: