TheoremBase

Both clauses are unwound from the definitions of a map, its value, and the domain and range of a relation.

Proof

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 and ran⁑FβŠ†B\operatorname{ran}F\subseteq B.

Proof of (i). Let a∈Aa\in A and let bb be a set. Since a∈dom⁑Fa\in\operatorname{dom}F, the value F(a)F(a) is defined, and by Functions, Values of a Function, and Functions from One Class to Another (ii) it is the unique set vv with (a,v)∈F(a,v)\in F; in particular

(a,F(a))∈F.(a,F(a))\in F.

If F(a)=bF(a)=b, this says (a,b)∈F(a,b)\in F. Conversely, if (a,b)∈F(a,b)\in F, then (a,b)∈F(a,b)\in F and (a,F(a))∈F(a,F(a))\in F give b=F(a)b=F(a) by single-valuedness of FF (Functions, Values of a Function, and Functions from One Class to Another (i)).

Proof of (ii). Let aa and bb be sets with (a,b)∈F(a,b)\in F. Then a∈Aa\in A by Domains and Restrictions of Maps (i). Since βˆƒu ((u,b)∈F)\exists u\,((u,b)\in F) holds with u=au=a, b∈ran⁑Fb\in\operatorname{ran}F by Relations, Domain, Range, Inverse and Composition (iii) (membership in a class abstraction, Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i)). Since ran⁑FβŠ†B\operatorname{ran}F\subseteq B, b∈Bb\in B by Subclasses and Subsets (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…