Clause 1 is proved by contradiction from the injectivity of the successor map together with the fact that 1 is not a successor; clause 2 transports a bijection with an initial segment back to the natural numbers.
Each result cited is universally quantified over the data in its own statement, and is applied here to the data named in the statement of this lemma.
Claim 1 (Clause 1). Suppose, for a contradiction, that is finite. It is nonempty, since . The successor map is injective, this being one of the requirements imposed on the natural numbers in Natural Numbers. By claim 2 of An Injective Self-Map of a Finite Set is a Bijection, applied to the nonempty finite set and to , the map is a bijection from onto . Applying Bijection of Sets to the element of the codomain, there is with . This contradicts the requirement , also imposed in Natural Numbers. Hence is not finite.
Claim 2 (Clause 2). Let and be as in clause 2 and suppose, for a contradiction, that is finite. Put
By claim 3 of Basic Properties of Finite Sets, applied to the finite set and the subset , the set is finite; and is nonempty, since . By Finite Set a nonempty finite set has elements for some ; fix such a for . By Number of Elements of a Set there is then a bijection , where is the initial segment determined by .
Let be the map with , which is well defined by the definition of . It is a bijection: every equals for some , by the definition of , and such an is unique because is injective; this is precisely the condition of Bijection of Sets.
By claim 2 of Inverse of a Bijection, applied to , the map is a bijection. By claim 2 of Injectivity, Composition, and Restriction of Bijections, applied to and to , the map is a bijection from onto ; by claim 2 of Inverse of a Bijection, applied to that map, its inverse is a bijection from onto . Hence has elements by Number of Elements of a Set, and so is finite by Finite Set, contradicting claim 1. Therefore is not finite.
Loadingβ¦
Prerequisites
452fd6e7-da54-49c6-af09-702f15a3b84d