Encouraged by the positive solutions to my question, Tiling with one of each shape, I'd like to pose the $\mathbb{R}^3$ equivalent:
Q. Is there a tiling of $\mathbb{R}^3$ by (bounded) polyhedra, one each of polyhedra of $4$ faces, $5$ faces, $\ldots$ ?
The two main versions of Q are (1) allowing nonconvex polyhedra, or (2) insisting on convex polyhedra. (Another variant counts vertices rather than faces.) For (1), Noam Elkies' 2D idea may apply, say using a tiling by congruent cubes, and partitioning each cube. For (2), it may be that Martin Tancer's idea can extend to a spherical design rather than his 2D circular construction.
If both variants are resolved, it would then be natural to generalize to $\mathbb{R}^d$ for $d > 3$.