Arhangeleskii's Theorem states the following

For any Hausdorff topological space $X$, $$ |X|\leq2^{\chi(X)L(X)} $$ where $\chi(X)$ is the character of $X$ and $L(X)$ is the Lindelöf degree of $X$.

In the article Paracompactness of Box Products of Compact Spaces, Kenneth Kunen presents a generalization of the countable case of the previous Theorem, also by Arhangelskii. It says

If $Y$ is a compact Hausdorff space and $\mathfrak{F}$ is a cover of $Y$ by closed $G_\delta$ sets and $\mathfrak{F}$ satisfies $$ \forall H\in \mathfrak F (|\{K\in\mathfrak F: H\cap K\neq\emptyset\}|\leq \mathfrak c), $$ then $|\mathfrak F|\leq \mathfrak c$

I would like to prove this result. Kunen says only that the proof to this Theorem is an easy modification of a proof by R. Pol of the original (on the article Short proofs of two theorems on cardinality of topological spaces). However, the steps of the original proof don't translate well to this generalization. When I try to emulate Pol's proof, I can't take the closure of each step, because that why I couldn't ensure that I take less than $\mathfrak c$ elements of $\mathfrak F$. When I tried to use something other than the closure in that step, I can't guarantee that after the induction I have closed sets. I wanted those set to be closed in order to use the compactness of the space. Maybe there is some other way to ensure the compactness, but I don't have any clue of what that could be.

Does the theorem lack some extra hypothesis? There is a proof supposing that $X$ has countable cellularity, but this assumption does not help me.

There is a similar result in the article Box Products, by Scott Williams, in the Handbook of Set Theoretic Topology (Lemma 4.1 on page 184).

No compact Hausdorff space can be partitioned into more than $\mathfrak c$ closed $G_\delta$ sets.

This result would be enough for me, but the proof in the article has a flaw. During the induction step, a function is defined in order to guarantee that each step does not exceed $\mathfrak c$ closed $G_\delta$ sets. However, that function is not always injective. I think that this can be related to the troubles I have with the other version.