Take a transitive model . In , choose a bijection and encode its graph by a set , using a fixed bijection between and . The relative constructible universe can decode , and therefore contains every real number of ; being an inner model of , it has no additional reals.
Models with the same reals have the same first uncountable ordinal, because their reals code exactly the same countable well-orders. If satisfied the Continuum hypothesis, its bijection between and the reals would also belong to , contradicting . This is the construction in relative constructible universe can violate the continuum hypothesis, and it gives
Suppose ZFC proved that every -Suslin set is determined. The assumed consistency of ZFC and the relative consistency of the Continuum hypothesis would then give a model of
In that model . By Every set of reals is continuum-Suslin, every subset of is therefore -Suslin and hence determined. This is the axiom of determinacy.
But the axiom of choice produces an undetermined set of reals, so ZFC and the axiom of determinacy are incompatible. The displayed theory cannot have a model, contradicting the relative consistency of ZFC plus the continuum hypothesis. Hence ZFC cannot prove that all -Suslin sets are determined.
Conditions with the same finite stem in Hechler forcing are compatible: and have the common stronger condition . Since there are only countably many finite stems, Hechler forcing is sigma-centered and hence has the countable chain condition for forcing. It therefore preserves .
In , the Continuum hypothesis gives
Every real in has a nice name for a real, and the countable chain condition bounds the number of such names by
where the last equality uses the ground-model continuum hypothesis. The extension still contains all ground-model reals, already many, so
Thus forcing once with preserves the continuum hypothesis.