Can we go in the direction opposite of Cantor's arguments for cardinal comparisons between sets belonging to disjoint hierarchies? The idea of this question is if we can go in the direction opposite to that of Cantor's argments for sets being strictly smaller than their powers, through building two disjoint hierarchies on top of two distinct empty objects, then we add an axiom saying that for every object in one hierarchy there is an object in the other hierarchy with an isomorphic set picture (i.e. the $\in$ graph on its inclusive transitive closure), the question is:

Can we add a bijective function $J$ over some infinite stage of the first hierarchy to the power set of its $\in$-copy in the second hierarchy, and axiomatize that $J$ can be used in replacement and separation axioms of both hierarchies from parameters coming from the the union of both hierarchies with all quantifiers relativized to that union?

This daunting question supplies the superficial appearance of in some sense circumventing Cantor's diagonal argument, albeit under different set constructions! $J$ basically is a bijection between a set and the power set of its $\in$-copy. To cut a possible paradox, it is hoped that the restriction of parameters and quantification to the union of the two hierarchies will prevent using crossover relations and functions that link elements of one hierarchy to the other. The only permitted crossover function is $J$. Without another crossover relation or function, it appears difficult to prove a paradox. However, the question is about if this can work?
Formal workup
Language: $\mathsf {FOL} (=, \in, \emptyset, \varnothing, J)$
$\emptyset, \varnothing$ are constants; $J$ is a partial function symbol.
Axioms: those of ID theory +

*

*Weak Extensionality: $\forall x (x \in a \iff x \in b) \land \exists x \, (x \in a) \to a=b$
Define: $set(y) \iff \exists s (y \in s)$


*Comprehension: $\exists x \forall y (y \in x \iff \phi(y) \land set(y))$, if $\phi$ doesn't have $x$ free.


*Emptyness: $\forall x: \not \exists y \, (y \in x) \iff x=\emptyset \lor x= \varnothing$


*Sets existence: $set (\emptyset), set(\varnothing), \emptyset \neq \varnothing$
Define: $x \text{ is } \ _\emptyset set \iff set(x) \land \forall y \in TC(x) [\emptyset \in TC(\{y\})] \land \varnothing \not \in TC(\{x\})$
Define: $x \text{ is} \ _\varnothing set \iff set(x) \land \forall y \in TC(x) [\varnothing \in TC(\{y\})] \land \emptyset \not \in TC(\{x\})$
Where $TC$ stands for 'transitive closure' defined in the usual manner.
Define: $\ _\emptyset V = \{x: x \text{ is } \ _\emptyset set\}$
Define: $\ _\varnothing V = \{x: x \text{ is } \ _\varnothing set\}$


*Pairing: $  a,b \text { are } \ _\emptyset sets \to set ( \{a,b\} ) \\  a,b \text { are } \ _\varnothing sets \to set ( \{a,b\} )$


*Union: $set(x) \to set(\bigcup x)$


*Power: $ \ _\emptyset set(x) \to set(\ _\emptyset \mathcal P(x)) \\ \ _\varnothing set(x) \to set(\ _\varnothing \mathcal P(x)) $
Where: $\ _\emptyset \mathcal P (x) = \{set(y): \forall z \in y (z \in x) \land y \neq  \varnothing \} ; \\\ _\varnothing \mathcal P (x) = \{set(y): \forall z \in y (z \in x) \land y \neq  \emptyset \}  $


*Infinity: $set (_\emptyset \omega);set (_\varnothing \omega) $


*Replacement: if $f$ is a definable function by a formula with all quantifiers relativized to $ \ _\emptyset V \ \cup \ _\varnothing V$ , with parameters from $\vec{p},a$, then: $$\forall   \vec{p},a \in \ _\emptyset V \ \cup \ _\varnothing V :\\ \forall x \in a (f(x) \in \ _\emptyset V) \lor \forall x \in a (f(x) \in \ _\varnothing V) \\\to set(\{f(x): x \in a\})$$


*Copying: $\forall x \in \ _\emptyset V \exists y \in \ _\varnothing V \exists f \ ( f: picture(x) \approx picture(y))$
Where the picture of a set $x$ is the $\in$-graph on the transitive closure of $\{x\}$; $`` \approx "$ stands for "isomorphism" on membership.
The copying relation shall be denoted using $``^*"$, so for every $x \in \ _\emptyset V$, we define $x^*$ as the element of $\ _\varnothing V$ whereby an isomorphism $f$ exists from the set picture of $x$ to the set picture of $x^*$. We call $x^*$ as the $\in$-copy of $x$.
Define recursively: $$ \ _\emptyset V_\emptyset = \emptyset \\ \ _\emptyset V_{\ _\emptyset \alpha + 1} = \ _\emptyset\mathcal P (V _{_\emptyset \alpha}) \\ \ _\emptyset V_{\ _\emptyset \lambda} = \bigcup_{\alpha \in \ _\emptyset \lambda} \ _\emptyset V_\alpha $$, for limit $_\emptyset \lambda$
Similarly define $\ _\varnothing V_{\ _\varnothing \alpha}$ by replacing $\emptyset$ by $\varnothing$ in the above definitions.


*Foundation: $$\ _\emptyset V = \bigcup_{\alpha \in \ _\emptyset \mathsf {ORD}} \ _\emptyset V_\alpha \\ \ _\varnothing V = \bigcup_{\alpha \in \, _\varnothing \mathsf {ORD}} \ _\varnothing V_\alpha $$
Where $\alpha \in \ _k \mathsf{ORD}$ iff $\alpha$ is a transitive $ _k set$ of transitive sets, having every nonempty subclass of it having a least element with respect to $\in$; where $k \in \{\emptyset, \varnothing\}$


*Anti-Cantorian: $$\exists \text{ limit } \ _\emptyset \alpha \, (  J: \ _\emptyset V_{\ _\emptyset \alpha} \rightarrow  \ _\varnothing \mathcal P ((\ _\emptyset V_{\ _\emptyset \alpha} )^*),\\ J \text{ is a bijection })$$
So the question is whether this theory is consistent relative to some extension of $\sf ZF$?
 A: This theory is inconsistent.
Let A(x) hold if x is the first empty set or the first empty set is the only empty set in the transitive closure of {x}. Let B(x) hold if x is the second empty set or the second  empty set is the only empty set in the transitive closure of {x}.
Let Aβ be the be the set of those elements x such that A(x) and the rank of x is less than β.
(a)Suppose s is transitive, t is transitive, A(s), and A(t). Suppose u is transitive, v is transitive, B(u), and B(v). If f is an isomorphism from s to u and g is an isomorphism from t to v,
then fx=gx for all xεs∩t.
Proof: Suppose not and let yεs∩t for which   such  f and g  exist with fy not equal to gy. By 2., there is a Y such that xεY<-->(xεTC({y}) and such f and g exist for y). By 6.,Since Y is contained in s,
   set(Y). Let x be an element of Y of least rank. Then fx=f"x=g"x=gx.

(b)Suppose s is a transitive set and A(s). Then there is a unique transitive set y such that (B(y) and there is an isomorphism from sU{s} to yU{y}), and any 2 such isomorphisms are the same.
Proof: By (9.), there is a y such that B(y) and there is an isomorphism f from su{s} to  the transitive closure of {y}. Then fs=y and y is transitive. The uniqueness follows from (a).
Let  be the ordinal whose existence is guaranteed by 11.
Suppose that t is the unique transitive set such that there is an isomorphism f from AU{A} to tU{t}. Suppose that T is the unique transitive set such that there is an isomorphism g from
A(+1)U{A(+1)} to TU{T}. Then T={x|x⊆t and B(x)}.
Proof:Suppose x⊆t and B(x) By 2., there is a z be such cεz iff (the unique isomorphism from  AU{A} to tU{t}, sends c to an element of x). set(z), since z is contined in A()U{A()}. Then gz=x and
thus xεT. Now suppose xεT. Then x=gz for some zεA(+1). Then gz=g"z=f"z⊆t.
By 2., there is an I consisting of those (x,y)ε(AXA(+1)) such that there is a z  with Jx=z and z is  the image of y under the isomorphism from A(+1)U{A(+1)} to  {x|x⊆t and B(x)}U{{x|x⊆t and B(x)}}.
Since I is contained in AXA(+1), set(I).  But I is a function from A onto A(+1).
