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.
In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let , and the order of 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 , is its value at ; is the ordered pair, the Cartesian product, and stands for .
Let be a class and let satisfy for every and for every with for all . If some element of lies in , then .
Let be a class, let and be maps, and let with
Then for every and every set with .
Loading…
No relations recorded yet.