A König-Egerváry graph is a graph $G$ satisfying $α(G)+μ(G)=|V(G)|$, where $α(G)$ is the cardinality of a maximum independent set and $μ(G)$ is the matching number of $G$. Such graphs are those that admit a matching between $V(G)-\bigcup Γ$ and $\bigcap Γ$ where $Γ$ is a set-system comprised of maximum independent sets satisfying $|\bigcup Γ'|+|\bigcap Γ'|=2α(G)$ for every set-system $Γ' \subseteq Γ$; in order to improve this characterization of a König-Egerváry graph, we characterize \emph{hereditary König-Egerváry set-systems} (HKE set-systems, here after). An \emph{HKE} set-system is a set-system, $F$, such that for some positive integer, $α$, the equality $|\bigcup Γ|+|\bigcap Γ|=2α$ holds for every non-empty subset, $Γ$, of $F$. We prove the following theorem: Let $F$ be a set-system. $F$ is an HKE set-system if and only if the equality $|\bigcap Γ_1-\bigcup Γ_2|=|\bigcap Γ_2-\bigcup Γ_1|$ holds for every two non-empty disjoint subsets, $Γ_1,Γ_2$ of $F$. This theorem is applied in \cite{hke},\cite{broken}.