Definition:Minimal

Definition

Let $\struct {S, \RR}$ be a relational structure.

Let $T \subseteq S$ be a subset of $S$.

An element $x \in T$ is a minimal element (under $\RR$) of $T$ if and only if:

$\forall y \in T: y \mathrel \RR x \implies x = y$

Let $S$ be a set.

Let $\powerset S$ be the power set of $S$.

Let $\TT \subseteq \powerset S$ be a subset of $\powerset S$.

Let $\struct {\TT, \subseteq}$ be the ordered set formed on $\TT$ by $\subseteq$ considered as an ordering.

Then $T \in \TT$ is a minimal set of $\TT$ if and only if $T$ is a minimal element of $\struct {\TT, \subseteq}$.

That is:

$\forall X \in \TT: X \subseteq T \implies X = T$