Defines G as the class of pairs ([u]_R, F(u)) for u in a, checks that it is a well-defined map from a/R to b with G composed with the projection equal to F, and derives uniqueness from the surjectivity of the projection.
For , denotes the equivalence class of , and means as in Relations, Domain, Range, Inverse and Composition §relation. By Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection §projection, is a surjective map with for every . By Functions, Values of a Function, and Functions from One Class to Another §map, , so is defined for every , and by Functions, Values of a Function, and Functions from One Class to Another §value it is the unique set with .
Construction. Let
formed by class abstraction with the parameters , and ; its formula quantifies over set variables only, the ordered pair, and being defined set symbols, so it is predicative as Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §comprehension requires. By Class Abstraction: the Class of All Sets Satisfying a Predicative Formula §abstraction and The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic, for all sets and ,
is a function. Every element of is an ordered pair, so is a relation by Relations, Domain, Range, Inverse and Composition §relation. Let and . By there are with , and . By Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection §equal, , so by the hypothesis on , that is, . Hence is a function by Functions, Values of a Function, and Functions from One Class to Another §function.
Domain. By Relations, Domain, Range, Inverse and Composition §domain and , a set lies in if and only if there are a set and some with and ; since exists for every , this holds if and only if for some , that is, by The Quotient of a Set by an Equivalence Relation and the Canonical Projection §quotient, if and only if . By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, .
Range. Let . By Relations, Domain, Range, Inverse and Composition §range and , for some . Since , by Relations, Domain, Range, Inverse and Composition §range, and by Functions, Values of a Function, and Functions from One Class to Another §map; so . Thus , and by Functions, Values of a Function, and Functions from One Class to Another §map.
Values. For , by , so by Functions, Values of a Function, and Functions from One Class to Another §value.
Factorization. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, applied to and , the composition is a map with for every . As by Functions, Values of a Function, and Functions from One Class to Another §map, Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §equality gives .
Uniqueness. Let be a map with . Let . Since is surjective, there is with , by Injective, Surjective and Bijective Functions between Classes §surjective. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, , and likewise ; so . Since by Functions, Values of a Function, and Functions from One Class to Another §map, Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §equality gives . Hence is the only map from to with .
Loading…