TheoremBase

All three facts follow from facts about maps between classes: values of a map lie in its codomain, maps with equal values are equal, and the pairs in a map are exactly its argument-value pairs.

Proof

The "in particular" readings follow because a sequence in a set XX is a map N→X\mathbb{N}\to X whose nn-th term is its value at nn (Sequences (i)).

Proof of (i). Let AβŠ†BA\subseteq B and let a:Nβ†’Aa:\mathbb{N}\to A be a map. Every value a(n)a(n) lies in AA (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i)), hence in BB, so a:Nβ†’Ba:\mathbb{N}\to B is a map by Membership in Inverse Relations, Preimages and Images of Classes, and Enlarging the Codomain of a Map (v), applied to F=aF=a with domain N\mathbb{N}, codomain AA and D=BD=B.

Proof of (ii). The maps aa and bb have the same domain N\mathbb{N} and equal values at every k∈Nk\in\mathbb{N}, so b=ab=a by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii), applied to F=aF=a and G=bG=b with both codomains XX.

Proof of (iii). Let a:Nβ†’Xa:\mathbb{N}\to X be a map and yy a class. By Relations, Domain, Range, Inverse and Composition (iii) and Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), a set vv lies in ran⁑a\operatorname{ran}a if and only if (u,v)∈a(u,v)\in a for some set uu.

Suppose y∈ran⁑ay\in\operatorname{ran}a. Then (as an element of a class, yy is a set by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (i)) there is a set nn with (n,y)∈a(n,y)\in a. By Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ii), this gives n∈Nn\in\mathbb{N} and y=a(n)=any=a(n)=a_{n}.

Conversely, let n∈Nn\in\mathbb{N} with y=any=a_{n}. By Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i), a(n)a(n) is a set and (n,a(n))∈a(n,a(n))\in a, so a(n)∈ran⁑aa(n)\in\operatorname{ran}a by the description of the range above; that is, y∈ran⁑ay\in\operatorname{ran}a.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…