The extension is the graph of g with the single pair (p, c) added; it is a function because p is not in the domain of g, and it is unique because maps with the same values agree. Injectivity and surjectivity onto C together with c follow by cases on whether an argument is p.
By The Boolean Operations on Classes, Disjointness, and the Universal Class (i) and The Empty Set, the Unordered Pair and the Singleton (iii), a set lies in if and only if or ; likewise for .
Existence in (i). The map is a set by Sets and Maps: Ordinary Notation (v), the ordered pair is a set by The Ordered Pair of Two Sets and Nested Tuples (i), and its singleton is a set by The Empty Set, the Unordered Pair and the Singleton (iii); so is a set by Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (iv), and its elements are the elements of together with , by The Boolean Operations on Classes, Disjointness, and the Universal Class (i) and The Empty Set, the Unordered Pair and the Singleton (iii). Since is a function, every element of is an ordered pair by Relations, Domain, Range, Inverse and Composition (i); hence is a relation.
Let , and be sets with and . If , then by Domains and Restrictions of Maps (i), so ; hence by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i), so , and because is a function (Functions, Values of a Function, and Functions from One Class to Another (i)). If , then and by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i); as , by Domains and Restrictions of Maps (i), so and . Thus is a function.
For a set : by Relations, Domain, Range, Inverse and Composition (ii), if and only if for some set , that is, for some or for some . The first holds if and only if , and by Functions, Values of a Function, and Functions from One Class to Another (iii); the second holds if and only if , by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i). Hence by Axiom of Extensionality for Classes. If , then by Relations, Domain, Range, Inverse and Composition (iii) either for some , so by Functions, Values of a Function, and Functions from One Class to Another (iii), or for some , so . Hence , and is a map by Functions, Values of a Function, and Functions from One Class to Another (iii).
For , by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii), so by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (i), applied to ; and gives in the same way.
Uniqueness in (i). If is a map with for every and , then for every , as or ; hence by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (iv).
Proof of (ii). For , by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii), applied to ; and . So for every . If , then for some set by Relations, Domain, Range, Inverse and Composition (iii), by Domains and Restrictions of Maps (i), and by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (i); so , and is a map by Functions, Values of a Function, and Functions from One Class to Another (iii).
Injective. Let with . If , then , so as is injective. If and , then while , which is impossible; likewise if and . If , there is nothing to prove.
Surjective. Let . If , there is with , as is surjective, and then and . If , then .
Hence is a bijection by Injective, Surjective and Bijective Functions between Classes (iii).
Loadingβ¦