The printed inclusion-and-elementarity assertion is false if transitivity is required of the same submodel. Take the theorem of ZFC that combines the axiom of infinity and the Axiom of power set. Whenever satisfies this sentence, it contains , every subset of , and their actual power set . A submodel contains and , since these are uniquely definable in . If were transitive, it would contain every element of , contradicting countability by Cantor theorem.
The corrected conclusion uses an elementary embedding rather than elementary inclusion. By Lévy reflection theorem, choose with and with Extensionality true there. The Downward Lowenheim-Skolem theorem says that an infinite structure in a countable language has a countable elementary substructure. Apply it to obtain a countable . The membership relation on is externally well-founded, and elementarity makes it extensional. The Mostowski collapse theorem gives an isomorphism onto a countable transitive set. Hence
Indeed : rank induction gives for every . The crucial correction is that , rather than the inclusion of , is elementary. For a formula with free variables, apply this argument to its universal closure.
A witness to failure of the Axiom of power set is . Every subset belongs to , since its transitive closure has cardinality at most . If some were the internal power set of , transitivity and bounded subsethood would force to contain every ambient subset of , and only those subsets. Thus it would be the full .
By the Cantor theorem,
Its transitive closure contains all its members, so . This contradicts . Therefore
The power-set failure in hereditarily small sets needs no assumption about the Continuum hypothesis.
The Rasiowa–Sikorski lemma constructs a generic filter over each . Every resulting generic extension remains a countable transitive model of ZFC: there are only countably many ground-model names externally. The order has the same elements and ordering at every stage, and atomless forcing order structure is absolute because all its quantifiers are bounded to . Hence the generic filter for an atomless order is new result gives for every .
The increasing union is transitive and contains . If it satisfied Axiom of power set for , there would be a set with
Choose with . The next-stage generic filter belongs to and is an actual subset of . This subset assertion is absolute for the transitive set , so . Transitivity of and then give , a contradiction. Thus the power-set failure in an increasing union of generic extensions occurs already at the fixed ground-model order:
The stages form an increasing chain, not an elementary chain, so the elementary chain theorem does not assert ZFC for their union.
Fix . Inside the ambient transitive model , the Axiom of power set makes the collection of constructible subsets of a set. For each such subset , choose the least stage of the constructible hierarchy at which appears. The Axiom schema of replacement and the supremum of a set of ordinals give an ordinal bounding all these stages; enlarge so that .
Now
is definable over with parameter . It therefore belongs to the definable power set . This set contains exactly the subsets of that belong to the constructible universe, so it witnesses the Axiom of power set in . Therefore Power Set.
False. The reasonable sets form the transitive set , but this structure fails the Axiom of power set. The set is reasonable, and every subset of is itself countable and therefore reasonable. Its full power set is uncountable, so it is not reasonable. No member of can therefore contain internally every subset of that belongs to . Thus the reasonable sets do not form a model of ZFC.
The hereditarily small set structure fails the Axiom of power set at . Every subset of belongs to , but their full power set has cardinality at least by the Cantor theorem, so cannot itself be hereditarily smaller than .