TheoremBase

Greatest Element of a Finite Family in a Totally Ordered Set

Statement

Let AA be a set equipped with a total order ≤\le, let nn be a natural number, let [n][n] be the initial segment determined by nn, and let c∈Anc\in A^{n} be an nn-tuple in AA, with components ckc_{k}.

Then there exists j∈[n]j\in[n] such that ck≤cjc_{k}\le c_{j} for every k∈[n]k\in[n].

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…