TheoremBase

The extension is the graph of g with the single pair (p, c) added; it is a function because p is not in the domain of g, and it is unique because maps with the same values agree. Injectivity and surjectivity onto C together with c follow by cases on whether an argument is p.

Proof

By The Boolean Operations on Classes, Disjointness, and the Universal Class (i) and The Empty Set, the Unordered Pair and the Singleton (iii), a set uu lies in Aβˆͺ{p}A\cup\{p\} if and only if u∈Au\in A or u=pu=p; likewise for Cβˆͺ{c}C\cup\{c\}.

Existence in (i). The map gg is a set by Sets and Maps: Ordinary Notation (v), the ordered pair (p,c)(p,c) is a set by The Ordered Pair of Two Sets and Nested Tuples (i), and its singleton {(p,c)}\{(p,c)\} is a set by The Empty Set, the Unordered Pair and the Singleton (iii); so h=gβˆͺ{(p,c)}h=g\cup\{(p,c)\} 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 (iv), and its elements are the elements of gg together with (p,c)(p,c), by The Boolean Operations on Classes, Disjointness, and the Universal Class (i) and The Empty Set, the Unordered Pair and the Singleton (iii). Since gg is a function, every element of gg is an ordered pair by Relations, Domain, Range, Inverse and Composition (i); hence hh is a relation.

Let uu, vv and vβ€²v' be sets with (u,v)∈h(u,v)\in h and (u,vβ€²)∈h(u,v')\in h. If (u,v)∈g(u,v)\in g, then u∈Au\in A by Domains and Restrictions of Maps (i), so uβ‰ pu\neq p; hence (u,vβ€²)β‰ (p,c)(u,v')\neq(p,c) by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i), so (u,vβ€²)∈g(u,v')\in g, and v=vβ€²v=v' because gg is a function (Functions, Values of a Function, and Functions from One Class to Another (i)). If (u,v)=(p,c)(u,v)=(p,c), then u=pu=p and v=cv=c by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i); as pβˆ‰Ap\notin A, (u,vβ€²)βˆ‰g(u,v')\notin g by Domains and Restrictions of Maps (i), so (u,vβ€²)=(p,c)(u,v')=(p,c) and vβ€²=c=vv'=c=v. Thus hh is a function.

For a set uu: by Relations, Domain, Range, Inverse and Composition (ii), u∈dom⁑hu\in\operatorname{dom}h if and only if (u,v)∈h(u,v)\in h for some set vv, that is, (u,v)∈g(u,v)\in g for some vv or (u,v)=(p,c)(u,v)=(p,c) for some vv. The first holds if and only if u∈dom⁑gu\in\operatorname{dom}g, and dom⁑g=A\operatorname{dom}g=A by Functions, Values of a Function, and Functions from One Class to Another (iii); the second holds if and only if u=pu=p, by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i). Hence dom⁑h=Aβˆͺ{p}\operatorname{dom}h=A\cup\{p\} by Axiom of Extensionality for Classes. If v∈ran⁑hv\in\operatorname{ran}h, then by Relations, Domain, Range, Inverse and Composition (iii) either (u,v)∈g(u,v)\in g for some uu, so v∈ran⁑gβŠ†Bv\in\operatorname{ran}g\subseteq B by Functions, Values of a Function, and Functions from One Class to Another (iii), or (u,v)=(p,c)(u,v)=(p,c) for some uu, so v=c∈Bv=c\in B. Hence ran⁑hβŠ†B\operatorname{ran}h\subseteq B, and h:Aβˆͺ{p}β†’Bh:A\cup\{p\}\to B is a map by Functions, Values of a Function, and Functions from One Class to Another (iii).

For u∈Au\in A, (u,g(u))∈gβŠ†h(u,g(u))\in g\subseteq h by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (ii), so h(u)=g(u)h(u)=g(u) by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (i), applied to hh; and (p,c)∈h(p,c)\in h gives h(p)=ch(p)=c in the same way.

Uniqueness in (i). If hβ€²:Aβˆͺ{p}β†’Bh':A\cup\{p\}\to B is a map with hβ€²(u)=g(u)h'(u)=g(u) for every u∈Au\in A and hβ€²(p)=ch'(p)=c, then hβ€²(u)=h(u)h'(u)=h(u) for every u∈Aβˆͺ{p}u\in A\cup\{p\}, as u∈Au\in A or u=pu=p; hence hβ€²=hh'=h by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv).

Proof of (ii). For u∈Au\in A, h(u)=g(u)∈Ch(u)=g(u)\in C by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (ii), applied to g:Aβ†’Cg:A\to C; and h(p)=ch(p)=c. So h(u)∈Cβˆͺ{c}h(u)\in C\cup\{c\} for every u∈Aβˆͺ{p}u\in A\cup\{p\}. If v∈ran⁑hv\in\operatorname{ran}h, then (u,v)∈h(u,v)\in h for some set uu by Relations, Domain, Range, Inverse and Composition (iii), u∈Aβˆͺ{p}u\in A\cup\{p\} by Domains and Restrictions of Maps (i), and v=h(u)v=h(u) by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (i); so ran⁑hβŠ†Cβˆͺ{c}\operatorname{ran}h\subseteq C\cup\{c\}, and h:Aβˆͺ{p}β†’Cβˆͺ{c}h:A\cup\{p\}\to C\cup\{c\} is a map by Functions, Values of a Function, and Functions from One Class to Another (iii).

Injective. Let u,uβ€²βˆˆAβˆͺ{p}u,u'\in A\cup\{p\} with h(u)=h(uβ€²)h(u)=h(u'). If u,uβ€²βˆˆAu,u'\in A, then g(u)=g(uβ€²)g(u)=g(u'), so u=uβ€²u=u' as gg is injective. If u∈Au\in A and uβ€²=pu'=p, then h(u)=g(u)∈Ch(u)=g(u)\in C while h(uβ€²)=cβˆ‰Ch(u')=c\notin C, which is impossible; likewise if u=pu=p and uβ€²βˆˆAu'\in A. If u=uβ€²=pu=u'=p, there is nothing to prove.

Surjective. Let v∈Cβˆͺ{c}v\in C\cup\{c\}. If v∈Cv\in C, there is u∈Au\in A with g(u)=vg(u)=v, as g:Aβ†’Cg:A\to C is surjective, and then u∈Aβˆͺ{p}u\in A\cup\{p\} and h(u)=vh(u)=v. If v=cv=c, then h(p)=vh(p)=v.

Hence h:Aβˆͺ{p}β†’Cβˆͺ{c}h:A\cup\{p\}\to C\cup\{c\} is a bijection by Injective, Surjective and Bijective Functions between Classes (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…