TheoremBase

The first two clauses unfold the definition of the value of a function, the third passes through the range, and the metric clause applies the third to the distance map at the pair (x, y).

Proof

Every element of a class is a set by Classes, Membership, Sets and Proper Classes (i); in particular aa, and below xx and yy, are sets. By Functions, Values of a Function, and Functions from One Class to Another (iii), FF is a function with dom⁑F=A\operatorname{dom}F=A, so by Functions, Values of a Function, and Functions from One Class to Another (ii) F(a)F(a) is the unique set vv with (a,v)∈F(a,v)\in F. In particular F(a)F(a) is a set, which is (i), and (a,F(a))∈F(a,F(a))\in F, which is (ii).

By Relations, Domain, Range, Inverse and Composition (iii) and Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), applied to the set F(a)F(a), F(a)∈ran⁑FF(a)\in\operatorname{ran}F holds if and only if there is a set uu with (u,F(a))∈F(u,F(a))\in F; by (ii) the set u=au=a is one, so F(a)∈ran⁑FF(a)\in\operatorname{ran}F. By Functions, Values of a Function, and Functions from One Class to Another (iii), ran⁑FβŠ†B\operatorname{ran}F\subseteq B, so F(a)∈BF(a)\in B by Subclasses and Subsets (i). This is (iii).

For (iv): by Metric Space (vi) and the standing hypothesis of Metric Space, dd is a map d:MΓ—Mβ†’Rd:M\times M\to\mathbb{R}, a map in the sense of Functions, Values of a Function, and Functions from One Class to Another (iii) as fixed by Sets and Maps: Ordinary Notation (v). Since xx and yy are sets, (x,y)∈MΓ—M(x,y)\in M\times M by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i). Applying (iii) to the map dd from the class MΓ—MM\times M to the class R\mathbb{R} at the element (x,y)(x,y) gives d((x,y))∈Rd((x,y))\in\mathbb{R}, which by Sets and Maps: Ordinary Notation (v) is d(x,y)∈Rd(x,y)\in\mathbb{R}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…