TheoremBase

The first clause follows from 0 ≤ c ≤ s by transitivity of the order; the second reads the pair (y,v) of g as v = g(y) = w(n,y) and uses that (n,y) lies in ℕ×X.

Proof

Proof of (i). Let c∈Cc\in C with c∈[0,∞]c\in[0,\infty]. By Order and Suprema in the Extended Real Line (viii), 0≤c0\le c, and c≤sc\le s by the hypothesis on ss, so 0≤s0\le s by transitivity of the total order ≤\le (Order and Suprema in the Extended Real Line (i)). As s∈[−∞,∞]s\in[-\infty,\infty], Order and Suprema in the Extended Real Line (viii) gives s∈[0,∞]s\in[0,\infty].

Proof of (ii). Let y∈Xy\in X and let vv be a set with (y,v)∈g(y,v)\in g. Then v=g(y)=w(n,y)v=g(y)=w(n,y), and since (n,y)∈N×X(n,y)\in\mathbb{N}\times X, the pair ((n,y),w(n,y))=((n,y),v)((n,y),w(n,y))=((n,y),v) lies in ww (by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ii) for gg, Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (viii), and Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i) for ww).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…