Bourbaki marks this one as harder than the rest.
(a) Let α and β be two ordinals such that α has no predecessor, and let ξ→σξ be a strictly increasing mapping of the ordinal ωβ into the ordinal α such that supξ<ωβσξ=α. Show that
ℵαℵβ=ξ<ωβ∏ℵσξ.
(With each mapping f of the ordinal ωβ into the ordinal ωα associate an injective mapping fˉ of ωβ into the set of all ωσξ (ξ<ωβ) such that f(ξ)≤fˉ(ξ) for all ξ<ωβ. Calculate the cardinal of the set of mappings f associated with the same fˉ and observe that
m=ξ<ωβ∏ℵσξ≥2Card(ωβ)
and m≥ℵα (cf. § 3, Exercise 3).)
(b) Let αˉ be the ordinal such that ωαˉ is the final character of ωα. Show that ℵαℵαˉ>ℵα and that if there exists n such that ℵα=nℵγ, then γ<αˉ (use (a) and Exercise 3 of § 3).
(c) Show that, if λ<αˉ, then
ℵαℵλ=ξ<α∑ℵξℵλ
(argue as in Exercise 18 (a)).