Definition:Cofinal Subset

Definition
Let $\left({S, \preceq}\right)$ be a relational structure, that is, a set $S$ endowed with a binary relation $\preceq$ (usually a partial ordering).

A subset $T \subseteq S$ is a cofinal subset of $S$ iff:
 * $\forall x \in S: \exists t \in T: x \preceq t$

Note
Although the definition pertains to arbitrary binary relations over $S$, in practice the notion of a cofinal set goes along with a partial order or a preorder.

Also see

 * Cofinal Sets of Natural Numbers

Any strictly increasing sequence of integers $\Gamma := \left\langle{n_k}\right\rangle_{k \in \N}\subseteq \N$ is a cofinal set of $\N$.

Thus, for a given sequence $\left\{{x_n}\right\}_{n \in \N} \subseteq S$ (where $S$ is any set), the set $\left\langle{x_\gamma}\right\rangle_{\gamma \in \Gamma}$ is a subsequence of $\left\langle{n_k}\right\rangle_{n \in \N}$.

It is straightforward to identify the counterpart of subsequences for nets: Let $\left\langle {x_\lambda}\right\rangle_{\lambda \in \Lambda} \subseteq S$ be a net in $S$ where $\Lambda$ is a partially ordered set. The counterparts of a "subsequence" of $\left\langle {x_\lambda}\right\rangle_{\lambda \in \Lambda}$ are sets of the form $\left\langle {x_\sigma}\right\rangle_{\sigma \in \Sigma}$ where $\Sigma$ is a cofinal subset of $\Lambda$.