Both clauses are unwound from the definitions of a map, its value, and the domain and range of a relation.
By Functions, Values of a Function, and Functions from One Class to Another (iii), is a function with and .
Proof of (i). Let and let be a set. Since , the value is defined, and by Functions, Values of a Function, and Functions from One Class to Another (ii) it is the unique set with ; in particular
If , this says . Conversely, if , then and give by single-valuedness of (Functions, Values of a Function, and Functions from One Class to Another (i)).
Proof of (ii). Let and be sets with . Then by Domains and Restrictions of Maps (i). Since holds with , 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 , by Subclasses and Subsets (i).
Loadingβ¦