cf(2ℵ0)>ℵ0 — the continuum 2ℵ0 cannot be written as a union of countably many strictly smaller sets. Equivalently, 2ℵ0=ℵω and more generally 2ℵ0 is never a cardinal of countable cofinality.
Why is it true?
Even though we cannot know the exact value of 2ℵ0 from ZFC alone (Cohen's independence result), this theorem is one of the few things we CAN prove unconditionally about it: whatever it equals, you cannot approach it from below along an ω-sequence of strictly smaller cardinals.
Proof sketch
We first prove the general König inequality: if κi<λi for every i in an index set I, then ∑i∈Iκi<∏i∈Iλi. Fix sets Bi with ∣Bi∣=λi and subsets Ai⊊Bi with ∣Ai∣=κi. The inequality ∑iκi≤∏iλi is routine (send each a∈Ai to the tuple that is a in coordinate i and some fixed default value elsewhere), so the content is showing they are not equal.
Suppose, for contradiction, some function h:⨆i∈IAi→∏i∈IBi is surjective. For each i, let hi:Ai→Bi send a↦h(a)(i) (the i-th coordinate of h(a)). Since ∣Ai∣=κi<λi=∣Bi∣, the map hi cannot be surjective onto Bi (if it were, picking a preimage for each element of Bi would inject Bi into Ai, forcing λi≤κi — contradiction). So choose di∈Bi∖ran(hi) for every i, and let g∈∏iBi be the tuple with g(i)=di.
Since h is surjective, g=h(a) for some a, say a∈Aj. Then g(j)=h(a)(j)=hj(a)∈ran(hj). But g(j)=dj∈/ran(hj) by construction — a direct contradiction. So no surjection h exists, giving ∑iκi<∏iλi. (Setting I=X, κi=1, λi=2 recovers Cantor's classical diagonal argument ∣X∣<2∣X∣ as a special case.)
Now suppose, for contradiction, cf(2ℵ0)=ℵ0. Then 2ℵ0 is the sum of a strictly increasing ω-sequence of smaller cardinals κ0<κ1<κ2<⋯, i.e. 2ℵ0=∑n<ωκn with every κn<2ℵ0. Apply König's inequality with λn:=2ℵ0 held constant for every n (valid since κn<2ℵ0=λn for every n):
2ℵ0=n<ω∑κn<n<ω∏λn=(2ℵ0)ℵ0=2ℵ0⋅ℵ0=2ℵ0.
This says 2ℵ0<2ℵ0, absurd. So cf(2ℵ0)=ℵ0; since cofinality is never smaller than that (it is at least ℵ0 for any infinite cardinal, and it cannot be finite), we conclude cf(2ℵ0)>ℵ0. ■