I would like to have some ideas about possibilities of proving or disproving the following conjecture:

For any partition $\mathcal{F}=\{\mathcal{A_1},\ldots,\mathcal{A_m} \}$ of the powerset without the empty set element $\mathcal{P}([n]) \setminus \{\emptyset\}$, and defined $\mathcal{F}_a = \{\mathcal{A} \in \mathcal{F} : \exists B \in \mathcal{A} : a \in B\}$, there exists $x \in [n]$ such that $\vert \mathcal{F}_x \vert \ge \big\lfloor \frac{m}{2} \big\rfloor$.

For example, for $n = 4$, a possible family $\mathcal{F}$ is: $$\{\{\{1\}\}, \{\{2\}\}, \{\{1,3\}, \{2,3\}\}, \{\{4\}\}, \{\{1,4\}, \{2,4\}\}, \{\{1,2\}, \{3\}, \{1,2,3\}, \{1,2,4\}, \{3,4\}, \{1,3,4\}, \{2,3,4\}, \{1,2,3,4\}\}\}$$ with $m = 6$ and $\vert \mathcal{F}_1 \vert = 4 \ge 3$, $\vert\mathcal{F}_2 \vert = 4 \ge 3$, $\vert\mathcal{F}_3 \vert = 2 \lt 3$, $\vert\mathcal{F}_4 \vert = 3 \ge 3$.

I have tested all cases for $n \le 4$, however I don't see how to go further with brute force.