TheoremBase

The first clause unfolds [n] as the natural numbers k with k ≤ n and uses reflexivity of the order; the second unfolds the class abstraction defining the addition and compares coordinates of ordered pairs.

Proof

Throughout, set-builder classes such as {k∈N:k≤n}\{k\in\mathbb{N}:k\le n\} are restricted class abstractions of Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii), as Sets and Maps: Ordinary Notation (iii) provides; ordered pairs of sets are sets by The Ordered Pair of Two Sets and Nested Tuples (i); and m+nm+n is a set for m,n∈ωm,n\in\omega by Addition on Omega (i).

Proof of (i). Let n∈Nn\in\mathbb{N}. By Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i),

[n]={k∈N:k≤n},[n]=\{k\in\mathbb{N}:k\le n\},

so by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), n∈[n]n\in[n] if and only if n∈Nn\in\mathbb{N} and n≤nn\le n. The first condition holds by assumption, and n≤nn\le n holds by Arithmetic and Order of the Natural Numbers (vi). Hence n∈[n]n\in[n].

Proof of (ii). Let aa, bb and cc be sets. By Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), applied to the class ++ of Addition on Omega (i), ((a,b),c)∈+((a,b),c)\in{+} if and only if there are m,n∈ωm,n\in\omega with

((a,b),c)=((m,n),m+n).((a,b),c)=((m,n),m+n).

By The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i), applied first to these two pairs and then to (a,b)=(m,n)(a,b)=(m,n), this equation holds if and only if a=ma=m, b=nb=n and c=m+nc=m+n. Hence, if ((a,b),c)∈+((a,b),c)\in{+}, then a∈ωa\in\omega, b∈ωb\in\omega and c=a+bc=a+b; conversely, if a,b∈ωa,b\in\omega and c=a+bc=a+b, the witnesses m=am=a and n=bn=b give ((a,b),c)∈+((a,b),c)\in{+}.

The argument for (ii) is adapted from the published proof (proof version ea2a2f1d-b7b8-4793-97f8-76d3456bac36) of the membership clause of lem:omega-multiplication-values-2026a (theorem version 8920386c-768d-45bd-8ead-a57505afa932).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…