A map on C βͺ {x} is recovered from its restriction to C and its value at x, and any such pair is realized by gluing a constant map on {x}; injectivity is tracked through the gluing.
Throughout, because ; the elements of are the maps and those of the injective maps (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), The Sets of Injections, Surjections and Bijections between Two Sets (i)). For a set and , let be the constant map with value (Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (i)). For a map on , the restriction is a map on with the same values as there; so two maps on with the same restriction to and the same value at agree at every point of , and are equal.
Step 1: maps ((i)). For we have and , since ; so the map is defined. It is injective by the last remark above. It is surjective: let . By Gluing Maps on Disjoint Domains, and Shrinking the Codomain (i), applied to and , the union is a map with for and . Hence , and is mapped to .
Step 2: injections ((ii)). Fix and put .
The map is defined: let and . Then , so by injectivity. Thus takes its values in , so it is a map (Gluing Maps on Disjoint Domains, and Shrinking the Codomain (iii)), and it is injective because is.
It is injective: two maps in with the same restriction to also have the same value at , so they are equal.
It is surjective: let be injective. Its values lie in , so is also a map (Gluing Maps on Disjoint Domains, and Shrinking the Codomain (iii)). By Gluing Maps on Disjoint Domains, and Shrinking the Codomain (i), applied to and , the union is a map with and . It is injective: two points of with the same value are equal because is injective, and a point has . So , and it is mapped to .
Loadingβ¦