ThmDex – An index of mathematical definitions, results, and conjectures.
▼ Set of symbols
▼ Alphabet
▼ Deduction system
▼ Theory
▼ Zermelo-Fraenkel set theory
▼ Set
▼ Binary cartesian set product
▼ Binary relation
▼ Binary endorelation
▼ Preordering relation
▼ Partial ordering relation
▼ Partially ordered set
Definition D669
Minimal element
Formulation 0
Let $P = (X, {\preceq})$ be a D1103: Partially ordered set such that
(i) $X \neq \emptyset$
A D2218: Set element $m \in X$ is a minimal element in $P$ if and only if \begin{equation} \forall \, x \in X \left( x \neq m \quad \implies \quad (x, m) \not\in {\preceq} \right) \end{equation}
Formulation 1
Let $P = (X, {\preceq})$ be a D1103: Partially ordered set such that
(i) $X \neq \emptyset$
A D2218: Set element $m \in X$ is a minimal element in $P$ if and only if \begin{equation} \forall \, x \in X \left( x \neq m \quad \implies \quad x \not\preceq m \right) \end{equation}
Children
▶ D667: Minimum element