having numerals on both sides.

However, the numerals on the right are quantifiers, and the

numerals on the left are predicates. Furthermore, each numerical-quantifier can be expanded
into primitive notation using (D1) above, which yields the following series of theorems. (t1.0)
0[A] « ;$x[x Î A] (t1.1) 1[A] « $x"y(y Î A « y=x) (t1.2) 2[A] « $x$y(x¹y & "z(z Î A «. z=x Ú
z=y)) etc. We also have the following theorems, which might be useful in seeing how the
above numerical predicates work. (T1.0) "x[ 0[x] « x=Æ ] (T1.1) "x[ 1[x] « $y(x={y}) ]
(T1.2) "x[ 2[x] « $y$z(y¹z & x={y,z}) ] etc. In other words, a set has zero elements iff it is
identical to the empty set, a set has exactly one element iff it is identical to some singleton or
other. And so on. In our construction, we start with numerals-as-quantifiers – ‘1x’, ‘2x’, etc.
Next, we construct