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.
Throughout, set-builder classes such as 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 is a set for by Addition on Omega (i).
Proof of (i). Let . By Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i),
so by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), if and only if and . The first condition holds by assumption, and holds by Arithmetic and Order of the Natural Numbers (vi). Hence .
Proof of (ii). Let , and be sets. By Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), applied to the class of Addition on Omega (i), if and only if there are with
By The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i), applied first to these two pairs and then to , this equation holds if and only if , and . Hence, if , then , and ; conversely, if and , the witnesses and give .
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).
Loading…