Let $(E, \preceq)$ be a finite distributive lattice, $H_E$ be the Hasse diagram of $E$ and $d$ be the distance on $E \times E$ defined as the length of the shortest path in $H_E$ between any pair of points from $E$. An interval is a subset from $E$ of the form $[inf(e_1, e_2), sup(e_1, e_2)]$ for some $e_1, e_2 \in E$. The set $\mathcal{I}_E$ denotes the set of all intervals from $E$. A profile $P$ is a non-empty finite multiset of intervals. The set $\mathcal{P}_E$ denotes the set of all profiles. The distance $d$ is extended to the mapping $E \times \mathcal{I}_E \mapsto \mathbb{N}$ defined $\forall e \in E$, $\forall I \in \mathcal{I}_E$ as $d(e, I) = \min\{d(e, e') \mid e' \in I\}$. Then, $d$ is extended to the mapping $E \times \mathcal{P}_E \mapsto \mathbb{N}$ defined $\forall e \in E$, $\forall P \in \mathcal{P}_E$ as $d(e, P) = \sum\{d(e, I) \mid I \in P\}$. Lastly, for any profile $P \in \mathcal{P}_E$ let us denote $Merge(P)$ the set $argmin\{d(e, P) \mid e \in E\}$ (i.e., $Merge(P) = \{e \in E \mid \forall e' \in E, d(e, P) \leq d(e', P)\}$).
I would like to show that for any profile $P \in \mathcal{P}_E$, we have that $(Merge(P), \preceq)$ is an interval from $\mathcal{I}_E$ (or to find a counter-example, that I failed to do so far).
