Motivation. The starting point of this question is the trivial observation that if we cover $\mathbb{N}$ with $$\big\{\{0,\ldots n\}: n\in \mathbb{N}\big\},$$ then this cover doesn't have a minimal subcover (from which no more sets can be taken away). So in this question we focus on covers in which the members of the cover have minimum overlap.
Formal setting. Let $X\neq \emptyset$ be a set. We say that ${\cal C}\subseteq {\cal P}(X)$ is a cover if $\bigcup {\cal C} = X$, and we call ${\cal C}$ linear if $|A \cap B| \leq 1$ whenever $A\neq B \in {\cal C}$. If $x_0\in X$, we let the covering number of $x_0$ be $\text{cov}_{\cal C}(x_0) = |\{A \in {\cal C}: x_0\in A\}|$.
We say ${\cal C}$ is minimal if for all $A \in {\cal C}$ the set ${\cal C}\setminus \{A\}$ is no longer a cover. Note that ${\cal C}$ is minimal if for all $A\in {\cal C}$ there is $a\in A$ with $\text{cov}_{\cal C}(a) = 1$. We call ${\cal C}$ weakly minimal if there is $x_0\in X$ such that $\text{cov}_{\cal C}(x_0) = 1$.
Question. If $X$ is an infinite set and ${\cal C}$ is a linear cover of $X$, is there necessarily a weakly minimal cover ${\cal C}'\subseteq {\cal C}$?