TheoremBase

Upper Bounds of Elements of [0,∞], and the Graph of a Section of a Map on ℕ×X

A least upper bound in [−∞,∞] of a class containing an element of [0,∞] lies in [0,∞]; and a map g on X that agrees with the section w(n,·) of a map w on ℕ×X has its graph pairs (y,v) carried to pairs ((n,y),v) of w.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let [−∞,∞][-\infty,\infty], [0,∞][0,\infty] and the order ≤\le of [−∞,∞][-\infty,\infty] be as in The Extended Real Line, Its Order, and [0,∞] (ii) and The Extended Real Line, Its Order, and [0,∞] (iii). For a map FF, F(u)F(u) is its value at uu; (u,v)(u,v) is the ordered pair, N×X\mathbb{N}\times X the Cartesian product, and w(n,y)w(n,y) stands for w((n,y))w((n,y)).

Let CC be a class and let s∈[−∞,∞]s\in[-\infty,\infty] satisfy c≤sc\le s for every c∈Cc\in C and s≤ts\le t for every t∈[−∞,∞]t\in[-\infty,\infty] with c≤tc\le t for all c∈Cc\in C. If some element of CC lies in [0,∞][0,\infty], then s∈[0,∞]s\in[0,\infty].

Let XX be a class, let w:N×X→[0,∞]w:\mathbb{N}\times X\to[0,\infty] and g:X→[0,∞]g:X\to[0,\infty] be maps, and let n∈Nn\in\mathbb{N} with

g(y)=w(n,y)for every y∈X.g(y)=w(n,y)\quad\text{for every }y\in X.

Then ((n,y),v)∈w((n,y),v)\in w for every y∈Xy\in X and every set vv with (y,v)∈g(y,v)\in g.

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…