Let $H = (V,E)$ be a hypergraph, that is $V$ is a set and $E \subseteq {\cal P}(V)$. We assume $\bigcup E = V$. Moreover we assume that every $e\in E$ is contained in some maximal member $e'\in E$ (maximal with respect to $\subseteq$). Let $\text{Max}(E)$ be the set of maximal members of $E$.

A *cover* is a set $N\subseteq E$ with $\bigcup N = V$. If $N \subseteq E$ is a cover, we call a map $\mu:N\to \text{Max}(E)$ such
that $\mu(n) \supseteq n$ for all $n \in N$ a maximal expansion map of
$N$. The image $\text{im}(\mu)$ is called a *maximal expansion*.
By (AC) every cover has a maximal expansion.

A cover $C$ is *minimal* if for $C' \subseteq C, C'\neq C$ we have $\bigcup C' \neq V$. The cover $C$ is *strongly minimal* if $|C\setminus K| \leq |K\setminus C|$ for all covers $K$ of the hypergraph $H$.

Question. Suppose $N$ is strongly minimal, $\mu: N\to \text{Max}(E)$ is a maximal expansion map and $M= \text{im}(\mu)$. If $M$ is minimal, is it automatically strongly minimal?