Each clause is checked directly from reflexivity, symmetry and transitivity, extensionality, the characteristic property of ordered pairs, and the facts that subclasses of sets are sets.
By Equivalence Relations on a Set §equivalence, is reflexive, symmetric and transitive; these are meant below by reflexivity, symmetry and transitivity. Unfolding the class abstractions once by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula §abstraction and Class Abstraction: the Class of All Sets Satisfying a Predicative Formula §restricted: by The Equivalence Class of an Element under an Equivalence Relation §class, for and every set , if and only if and ; and by The Quotient of a Set by an Equivalence Relation and the Canonical Projection §quotient, a set is an element of if and only if for some .
(i) For , reflexivity gives , so .
Equal. Let . Suppose . By (i), , hence . Conversely suppose ; by symmetry also . If , then and , so by transitivity from , and . If , then and , so by transitivity from , and . By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, .
Disjoint. Let with , and suppose, for a contradiction, that the intersection has an element . Then , and ; by symmetry , and by transitivity . By the Equal part above, , a contradiction. So has no element, and the two classes are disjoint by The Boolean Operations on Classes, Disjointness, and the Universal Class §disjoint.
Quotient-set. Let . Then there is with , and every element of lies in , so is a subset of ; hence by The Union Set and the Power Set of a Set §power. Thus , and since is a set by The Union Set and the Power Set of a Set §power, 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 §subclass.
Cover. For , by (i). Since is a set by the Quotient-set part, its union set is defined, and by The Union Set and the Power Set of a Set §union a set is an element of it if and only if for some . If with , then for some , so . Conversely, if , then by (i) and , so . By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, . Finally, every is for some , and by (i).
Representative. Let and . Then for some , and gives and . By the Equal part above, , that is, .
Projection. By The Quotient of a Set by an Equivalence Relation and the Canonical Projection §projection, every element of is an ordered pair with , so is a relation by Relations, Domain, Range, Inverse and Composition §relation. Moreover, for sets and : if then there is with , so and by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic; conversely, if then . That is,
Function. If and , then by ; so is a function by Functions, Values of a Function, and Functions from One Class to Another §function. Domain. By and Relations, Domain, Range, Inverse and Composition §domain, a set is in if and only if ; by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, . Values. For , , so by Functions, Values of a Function, and Functions from One Class to Another §value. Range. By and Relations, Domain, Range, Inverse and Composition §range, a set is in if and only if for some , that is, if and only if ; by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, . In particular , so by Functions, Values of a Function, and Functions from One Class to Another §map. Surjective. Every element of is of the form with , and ; so is surjective onto by Injective, Surjective and Bijective Functions between Classes §surjective.
Loading…