TheoremBase

Strictly Increasing Sequences of Natural Numbers Dominate Their Index

Statement

Let N\mathbb{N} denote the natural numbers with the addition of that definition and the order ≤\le, and let (nk)k∈N(n_k)_{k\in\mathbb{N}} be a sequence in N\mathbb{N} that is strictly increasing in the sense of Subsequence of a Sequence in a Set.

Then k≤nkk\le n_k for every k∈Nk\in\mathbb{N}. Consequently, for every N∈NN\in\mathbb{N} there exists k∈Nk\in\mathbb{N} with N≤nkN\le n_k.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…