To prove that power-set equality is not upward absolute, use the standard constructible universe theorem: is a transitive inner model of ZF containing every ordinal, and set rank is absolute between and . Since , some rank stage contains a nonconstructible set. Let be the least ordinal with . It is not zero; it cannot be a limit, since a union of earlier stages contained in is still contained in . Thus and .
We need not merely this inclusion, but that itself belongs to . Inside , ZF constructs its own rank stage , which is a set of . By transitivity and rank absoluteness,Consequently . Let , the power set computed in . Then and .
By minimality there is . Externally , but , because every member of the set is in the transitive class . Hence . Taking and proves power-set equality is not upward absolute, even between transitive models of ZF.
There is no contradiction with absoluteness of : that bounded relation agrees whenever both parameters are present in the smaller class. Power-set equality quantifies over all subsets, including a new absent from the smaller class. The step proving is essential; inclusion in a class alone would not imply membership in it.
Power-set equality is not upward absolute 2026-10-31
Assume . At the first cumulative stage containing a nonconstructible set, the index is a successor . Rank absoluteness gives , not just . Let be the power set of computed in . It omits a nonconstructible subset of from the next external rank stage. Thus satisfies power-set equality for the parameters , while does not. Both are transitive models of ZF. Subset inclusion itself is bounded and absolute; quantification over all possible subsets causes the failure.