TheoremBase

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.

Proof

By Equivalence Relations on a Set §equivalence, RR 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 u∈au\in a and every set ww, w∈[u]Rw\in[u]_{R} if and only if w∈aw\in a and u R wu\,R\,w; and by The Quotient of a Set by an Equivalence Relation and the Canonical Projection §quotient, a set cc is an element of a/Ra/R if and only if c=[u]Rc=[u]_{R} for some u∈au\in a.

(i) For u∈au\in a, reflexivity gives u R uu\,R\,u, so u∈[u]Ru\in[u]_{R}.

Equal. Let u,v∈au,v\in a. Suppose [u]R=[v]R[u]_{R}=[v]_{R}. By (i), v∈[v]R=[u]Rv\in[v]_{R}=[u]_{R}, hence u R vu\,R\,v. Conversely suppose u R vu\,R\,v; by symmetry also v R uv\,R\,u. If w∈[v]Rw\in[v]_{R}, then w∈aw\in a and v R wv\,R\,w, so u R wu\,R\,w by transitivity from u R vu\,R\,v, and w∈[u]Rw\in[u]_{R}. If w∈[u]Rw\in[u]_{R}, then w∈aw\in a and u R wu\,R\,w, so v R wv\,R\,w by transitivity from v R uv\,R\,u, and w∈[v]Rw\in[v]_{R}. By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, [u]R=[v]R[u]_{R}=[v]_{R}.

Disjoint. Let u,v∈au,v\in a with [u]R≠[v]R[u]_{R}\neq[v]_{R}, and suppose, for a contradiction, that the intersection [u]R∩[v]R[u]_{R}\cap[v]_{R} has an element ww. Then w∈aw\in a, u R wu\,R\,w and v R wv\,R\,w; by symmetry w R vw\,R\,v, and by transitivity u R vu\,R\,v. By the Equal part above, [u]R=[v]R[u]_{R}=[v]_{R}, a contradiction. So [u]R∩[v]R[u]_{R}\cap[v]_{R} has no element, and the two classes are disjoint by The Boolean Operations on Classes, Disjointness, and the Universal Class §disjoint.

Quotient-set. Let c∈a/Rc\in a/R. Then there is u∈au\in a with c=[u]Rc=[u]_{R}, and every element of [u]R[u]_{R} lies in aa, so cc is a subset of aa; hence c∈P(a)c\in\mathcal{P}(a) by The Union Set and the Power Set of a Set §power. Thus a/R⊆P(a)a/R\subseteq\mathcal{P}(a), and since P(a)\mathcal{P}(a) is a set by The Union Set and the Power Set of a Set §power, a/Ra/R 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 u∈au\in a, u∈[u]Ru\in[u]_{R} by (i). Since a/Ra/R is a set by the Quotient-set part, its union set ⋃(a/R)\bigcup(a/R) is defined, and by The Union Set and the Power Set of a Set §union a set ww is an element of it if and only if w∈cw\in c for some c∈a/Rc\in a/R. If w∈cw\in c with c∈a/Rc\in a/R, then c=[u]Rc=[u]_{R} for some u∈au\in a, so w∈aw\in a. Conversely, if w∈aw\in a, then w∈[w]Rw\in[w]_{R} by (i) and [w]R∈a/R[w]_{R}\in a/R, so w∈⋃(a/R)w\in\bigcup(a/R). By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, ⋃(a/R)=a\bigcup(a/R)=a. Finally, every c∈a/Rc\in a/R is [u]R[u]_{R} for some u∈au\in a, and u∈cu\in c by (i).

Representative. Let c∈a/Rc\in a/R and u∈cu\in c. Then c=[v]Rc=[v]_{R} for some v∈av\in a, and u∈[v]Ru\in[v]_{R} gives u∈au\in a and v R uv\,R\,u. By the Equal part above, [v]R=[u]R[v]_{R}=[u]_{R}, that is, c=[u]Rc=[u]_{R}.

Projection. By The Quotient of a Set by an Equivalence Relation and the Canonical Projection §projection, every element of πR\pi_{R} is an ordered pair (u,[u]R)(u,[u]_{R}) with u∈au\in a, so πR\pi_{R} is a relation by Relations, Domain, Range, Inverse and Composition §relation. Moreover, for sets uu and cc: if (u,c)∈πR(u,c)\in\pi_{R} then there is u′∈au'\in a with (u,c)=(u′,[u′]R)(u,c)=(u',[u']_{R}), so u=u′∈au=u'\in a and c=[u]Rc=[u]_{R} by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic; conversely, if u∈au\in a then (u,[u]R)∈πR(u,[u]_{R})\in\pi_{R}. That is,

(u,c)∈πRif and only ifu∈a and c=[u]R.(∗)(u,c)\in\pi_{R}\quad\text{if and only if}\quad u\in a\text{ and }c=[u]_{R}.\qquad(\ast)

Function. If (u,c)∈πR(u,c)\in\pi_{R} and (u,c′)∈πR(u,c')\in\pi_{R}, then c=[u]R=c′c=[u]_{R}=c' by (∗)(\ast); so πR\pi_{R} is a function by Functions, Values of a Function, and Functions from One Class to Another §function. Domain. By (∗)(\ast) and Relations, Domain, Range, Inverse and Composition §domain, a set uu is in dom⁡πR\operatorname{dom}\pi_{R} if and only if u∈au\in a; by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, dom⁡πR=a\operatorname{dom}\pi_{R}=a. Values. For u∈au\in a, (u,[u]R)∈πR(u,[u]_{R})\in\pi_{R}, so πR(u)=[u]R\pi_{R}(u)=[u]_{R} by Functions, Values of a Function, and Functions from One Class to Another §value. Range. By (∗)(\ast) and Relations, Domain, Range, Inverse and Composition §range, a set cc is in ran⁡πR\operatorname{ran}\pi_{R} if and only if c=[u]Rc=[u]_{R} for some u∈au\in a, that is, if and only if c∈a/Rc\in a/R; by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, ran⁡πR=a/R\operatorname{ran}\pi_{R}=a/R. In particular ran⁡πR⊆a/R\operatorname{ran}\pi_{R}\subseteq a/R, so πR:a→a/R\pi_{R}:a\to a/R by Functions, Values of a Function, and Functions from One Class to Another §map. Surjective. Every element of a/Ra/R is of the form [u]R=πR(u)[u]_{R}=\pi_{R}(u) with u∈au\in a, and ran⁡πR=a/R\operatorname{ran}\pi_{R}=a/R; so πR\pi_{R} is surjective onto a/Ra/R by Injective, Surjective and Bijective Functions between Classes §surjective.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…