TheoremBase

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.

Proof

For u∈au\in a, [u]R[u]_{R} denotes the equivalence class of uu, and u R vu\,R\,v means (u,v)∈R(u,v)\in R 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, πR\pi_{R} is a surjective map πR:a→a/R\pi_{R}:a\to a/R with πR(u)=[u]R\pi_{R}(u)=[u]_{R} for every u∈au\in a. By Functions, Values of a Function, and Functions from One Class to Another §map, dom⁡F=a\operatorname{dom}F=a, so F(u)F(u) is defined for every u∈au\in a, and by Functions, Values of a Function, and Functions from One Class to Another §value it is the unique set ww with (u,w)∈F(u,w)\in F.

Construction. Let

G={p:∃c ∃w ∃u (p=(c,w)∧u∈a∧c=[u]R∧w=F(u))},G=\{p:\exists c\,\exists w\,\exists u\,(p=(c,w)\wedge u\in a\wedge c=[u]_{R}\wedge w=F(u))\},

formed by class abstraction with the parameters aa, RR and FF; its formula quantifies over set variables only, the ordered pair, [u]R[u]_{R} and F(u)F(u) 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 cc and ww,

(c,w)∈Gif and only ifthere is u∈a with c=[u]R and w=F(u).(∗)(c,w)\in G\quad\text{if and only if}\quad\text{there is }u\in a\text{ with }c=[u]_{R}\text{ and }w=F(u).\qquad(\ast)

GG is a function. Every element of GG is an ordered pair, so GG is a relation by Relations, Domain, Range, Inverse and Composition §relation. Let (c,w)∈G(c,w)\in G and (c,w′)∈G(c,w')\in G. By (∗)(\ast) there are u,u′∈au,u'\in a with c=[u]R=[u′]Rc=[u]_{R}=[u']_{R}, w=F(u)w=F(u) and w′=F(u′)w'=F(u'). By Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection §equal, u R u′u\,R\,u', so F(u)=F(u′)F(u)=F(u') by the hypothesis on FF, that is, w=w′w=w'. Hence GG 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 (∗)(\ast), a set cc lies in dom⁡G\operatorname{dom}G if and only if there are a set ww and some u∈au\in a with c=[u]Rc=[u]_{R} and w=F(u)w=F(u); since F(u)F(u) exists for every u∈au\in a, this holds if and only if c=[u]Rc=[u]_{R} for some u∈au\in a, that is, by The Quotient of a Set by an Equivalence Relation and the Canonical Projection §quotient, if and only if c∈a/Rc\in a/R. By Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §extensionality, dom⁡G=a/R\operatorname{dom}G=a/R.

Range. Let w∈ran⁡Gw\in\operatorname{ran}G. By Relations, Domain, Range, Inverse and Composition §range and (∗)(\ast), w=F(u)w=F(u) for some u∈au\in a. Since (u,F(u))∈F(u,F(u))\in F, w∈ran⁡Fw\in\operatorname{ran}F by Relations, Domain, Range, Inverse and Composition §range, and ran⁡F⊆b\operatorname{ran}F\subseteq b by Functions, Values of a Function, and Functions from One Class to Another §map; so w∈bw\in b. Thus ran⁡G⊆b\operatorname{ran}G\subseteq b, and G:a/R→bG:a/R\to b by Functions, Values of a Function, and Functions from One Class to Another §map.

Values. For u∈au\in a, ([u]R,F(u))∈G([u]_{R},F(u))\in G by (∗)(\ast), so G([u]R)=F(u)G([u]_{R})=F(u) 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 πR:a→a/R\pi_{R}:a\to a/R and G:a/R→bG:a/R\to b, the composition is a map G∘πR:a→bG\circ\pi_{R}:a\to b with (G∘πR)(u)=G(πR(u))=G([u]R)=F(u)(G\circ\pi_{R})(u)=G(\pi_{R}(u))=G([u]_{R})=F(u) for every u∈au\in a. As dom⁡(G∘πR)=a=dom⁡F\operatorname{dom}(G\circ\pi_{R})=a=\operatorname{dom}F 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 G∘πR=FG\circ\pi_{R}=F.

Uniqueness. Let G′:a/R→bG':a/R\to b be a map with G′∘πR=FG'\circ\pi_{R}=F. Let c∈a/Rc\in a/R. Since πR\pi_{R} is surjective, there is u∈au\in a with πR(u)=c\pi_{R}(u)=c, by Injective, Surjective and Bijective Functions between Classes §surjective. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, G′(c)=G′(πR(u))=(G′∘πR)(u)=F(u)G'(c)=G'(\pi_{R}(u))=(G'\circ\pi_{R})(u)=F(u), and likewise G(c)=(G∘πR)(u)=F(u)G(c)=(G\circ\pi_{R})(u)=F(u); so G′(c)=G(c)G'(c)=G(c). Since dom⁡G′=a/R=dom⁡G\operatorname{dom}G'=a/R=\operatorname{dom}G 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 G′=GG'=G. Hence GG is the only map from a/Ra/R to bb with G∘πR=FG\circ\pi_{R}=F.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…