PRINCIPIA MATHEMATICA

ALFRED NORTH WHITEHEAD, Sc.D., F.R.S.

Fellow and late Lecturer of Trinity College, Cambridge

AND

BERTRAND RUSSELL, M.A., F.R.S.

Lecturer and late Fellow of Trinity College, Cambridge

VOLUME II

Cambridge
at the University Press
1912

p. 5, line 20, delete " $\pi$ ."
p. 34, line 20, for " $yRx$ " read " $xRy$ ."
p. 36, line 7 and line 10, for " $Q\mid R$ " read " $R\mid P$ ."
p. 44, line 17, for " $(p).p. \text{is false}$ " read " $(p). p\text{ is false}$ ."
p. 112, in *2·52, in place of " $p \supset \sim q$ " read " $\sim p \supset \sim q$ ."
p. 129, in *5·11, in place of reference to " $*2·51$ " read reference to " $*2·5$ ."
p. 129, in *5·12, in place of reference to " $*2·52$ " read reference to "*2·51."
p. 144, *10·23 should be " $\vdash\colon\ldotp(x).\phi x \supset p.\equiv :(\exists x).\phi x.\supset.p$ ."
p. 157, line 11, for "*10" read "*9."
p. 184, last line of Dem. of *14·111, for second " $x=c$ " read " $x=b$ ."
p. 228, in *23·81, for " $\dot{-} R \unicode{x2abd} \dot{-} S$ " read " $\dot{-} S \unicode{x2abd} \dot{-} R$ ."
p. 242, in *25·37, for " $zRw$ " read " $zSw$ ."
p. 242, in *25·412, for " $R$ " read " $S$ ."
p. 253, 2nd and 4th lines of Dem. of *31·16, for "*21·35" read "*23·35."
p. 259, in note to *32·35, for "*32·2" read "*32·3."
p. 263, in *33·16, 4th line of Dem., for "*20·34" read "*22·34."
p. 265, in *33·26, 2nd line of Dem., for "*21·34" read "*23·34."
p. 275, in *34·6, 4th line of Dem., for first " $S$ " read " $R$ ."
p. 289, 1st line, for " $=\beta \uparrow \gamma$ " read " $=\alpha \uparrow \gamma$ ."
p. 322, in *40·18, enunciation, for " $\equiv$ " read " $=$ ".
p. 329, in *40·69, Dem., for " $\overrightarrow{P}$ " read " $\overleftarrow{P}$ " (3 times).
p. 387, in *55·224, 1st line of Dem., for " $\uparrow$ " read " $\downarrow$ " (twice).
p. 388, in *55·281, for third " $=$ " read " $\equiv$ ."
p. 410, in *60·53, last line of Dem., for " $\gamma$ " read " $\beta$ ."
p. 453, in *71·25, Dem., 1st line, for " $xRy.xRz$ " read " $ySx.zSx$ ."
" " 2nd line, for " $xRy.ySu.xRz.zSv.\supset.y=z.ySu.zSv$ "
read " $uRy.ySx.vRz.zSx.\supset.y=z.uRy.vRz$ ."
" " 3rd line, for " $ySu.ySv$ " read " $uRy.vRy$ ."
" " 6th line, for " $xRy.ySu$ " read " $uRy.ySx$ " and for
" $xRz.zSv$ " read " $vRz.zSx$ ."
" " 7th line, for " $x(R\mid S)u.x(R\mid S)v$ " read " $u(R\mid S)x.v(R\mid S)x$ ."
p. 465, in *72·16, Dem., 1st line, for last " $\kappa$ " read " $x$ ."
p. 483, in *73·44, Dem., 1st line, for second " $y$ " read " $x$ ."
p. 485, in *73·511, for " $\beta$ " read " $\alpha$ ."
p. 522, in *81·23, enunciation and 2nd line of Dem., for " $\overrightarrow{R}$ " read " $R$ ."
p. 592, in *91·33, Dem., 1st line, for " $P$ " read " $R$ ."
p. 614, in *93·36, Dem., for " $R$ " read " $P$ " throughout.
p. 628, in *95·21, Dem., line 6, for " $Q'$ " read " $T'$ ."

p. 82, last line but one, for " $\Lambda_{\alpha}$ " and " $\Lambda_{\beta}$ " read " $\Lambda \cap \alpha$ " and " $\Lambda \cap \beta$ ."
p. 101, *112·23, enunciation, the second time two dots occur, read one dot.
p. 573, *205·7, enunciation, for " $\text{max}_{P}$ " read " $\overrightarrow{\text{max}}_{P}$ ."

THE purpose of the following observations is to bring together in one discussion various explanations which are required in applying the theory of types to cardinal arithmetic. It is convenient to collect these observations, since otherwise their dispersion throughout the several numbers of Part III makes it difficult to see what is their total effect. But although we have placed these observations at the beginning, they are to be read concurrently with the text of Part III, at least with so much of the text as consists of explanations of definitions. The earlier portion of what follows is merely a résumé of previous explanations; it is only in the later portions that the application to cardinal arithmetic is made.

Three different kinds of typical ambiguity are involved in our propositions, concerning:

We often speak as though the type represented by small Latin letters were not composed of functions. It is, however, compatible with all we have to say that it should be composed of functions. It is to be observed, further, that, given the number of individuals, there is nothing in our axioms to show how many predicative functions of individuals there are, i.e. their number is not a function of the number of individuals: we only know that their number $\geq 2^{\text{Nc}ʻ\text{Indiv}}$ , where " $\text{Indiv}$ " stands for the class of individuals.

In practice, we proceed along the extensional hierarchy after the early numbers of the book. If we have started from individuals, the result of this is to exclude functions wholly from our hierarchy; if we have started with functions of a given type, all functions of other types are excluded. Thus a fresh extensional hierarchy, wholly excluding every other, starts from each[Pg x] type of function. When we speak simply of "the extensional hierarchy," we mean the one which starts from individuals.

It is to be observed that when we have the assertion of a propositional function, say " $\vdash.\phi x$ ," the $x$ must be of some definite type, i.e. we only assert that $\phi x$ is true whatever $x$ may be within some one type. Thus e.g. " $\vdash.x=x$ " does not assert more than that this assertion holds for any $x$ of a given type. It is true that symbolically the same assertion holds in other types, but other types cannot be included under one assertion-sign, because no variable can travel beyond its type.

The process of rendering the types of variables ambiguous is begun in *9, where we take the first step in regard to the propositional hierarchy. Before *9, our variables are elementary propositions. These are such as contain no apparent variables. Hence the only functions that occur are matrices, and these only occur through their values. The assumption involved in the transition from Section A to Section B (Part I) is that, given " $\vdash.fp$ ," where $p$ is an elementary proposition, we may substitute for $p$ " $\phi!(x,y,z,\ldots)$ ," where $\phi$ is any matrix. Thus instead of " $\vdash.fp$ ," which contained one variable $p$ of a given type, we have " $\vdash.f\{\phi!(x,y,z,...)\}$ ," which contains several variables of several types (any finite number of variables and types is possible). This assumption involves some rather difficult points. It is to be remembered that no value of $\phi$ contains $\phi$ as a constituent, and therefore $\phi$ is not a constituent of $fp$ even if $p$ is a value of $\phi$ . Thus we pass, above, from an assertion containing no function as a constituent to one containing one or more functions as constituents. The assertion " $\vdash.fp$ " concerns any elementary proposition, whereas " $\vdash.f\{\phi(x,y,z,\ldots)\}$ " concerns any of a certain set of elementary propositions, namely any of those that are values of $\phi$ . Different types of functions give different sorts of ways of picking out elementary propositions.

Having assumed or proved " $\vdash.fp$ ," where $p$ is elementary and therefore involves no ambiguity of type, we thus assert $\vdash.f\{\phi(x,y,z,\ldots)\},$ where the types of the arguments and the number of them are wholly arbitrary, except that they must belong to the functional hierarchy including individuals. (The assumption that propositions are incomplete symbols excludes the possibility that the arguments to $\phi$ are propositions.) The noteworthy point is that we thus obtain an assertion in which there may be any finite number of variables and the variables have unlimited typical ambiguity, from an assertion containing one variable of a perfectly definite type. All this is presupposed before we embark on the propositional hierarchy.

It should be observed that all elementary propositions are values of predicative functions of one individual, i.e. of $\phi!\hat{x}$ , where $\hat{x}$ is individual.[Pg xi] Thus we need not assume that elementary propositions form a type; we may replace $p$ by " $\phi!x$ " in " $\vdash.fp$ ." In this way, propositions as variables wholly disappear.

In extending statements concerning elementary propositions so as formally to apply to first-order propositions, we have to assume afresh the primitive proposition *1·11 (*1·1 is never used), i.e. given " $\vdash.\phi x$ " and " $\vdash.\phi x\supset \psi x$ ," we have " $\vdash.\psi x$ " which is practically *9·12. This was asserted in *1·11 for any case in which $\phi x$ and $\psi x$ are elementary propositions. There was here already an ambiguity of type, owing to the fact that x need not be an individual, but might be a function of any order. E.g. we might use *1·11 to pass from $\unicode{x201c}\vdash.\phi!a\unicode{x201d} \quad \text{and} \quad \unicode{x201c}\vdash.\phi!a\supset \phi!b\unicode{x201d} \quad \text{to} \quad \unicode{x201c}\vdash.\phi!b,\unicode{x201d}$ where $\phi$ replaces the $x$ of *1·11, and $\hat{\phi}!a$ , $\hat{\phi}!b$ replace $\phi\hat{x}$ and $\psi\hat{x}$ . Thus *1·11, even before its extension in *9, already states a fresh primitive proposition for each fresh type of functions considered. The novelty in *9 is that we allow $\phi$ and $\psi$ to contain one apparent variable. This may be of any functional type (including Indiv); thus we get another set of symbolically identical primitive propositions. In passing, as indicated at the end of *9, to more than one apparent variable, we introduce a new batch of primitive propositions with each additional apparent variable.

What makes the above process legitimate is that nothing in the treatment of functions of order $n$ presupposes functions of higher order. We can deal with each new type of functions as it arises, without having to take account of the fact that there are later types. From symbolic analogy we "see" that the process can be repeated indefinitely. This possibility rests upon two things:

(1) A fresh interpretation of our constants— $\lor$ , $\sim$ , !, ( $x$ )., ( $\exists x$ ).—at each fresh stage;

(2) A fresh assumption, symbolically unchanged, of the primitive propositions which we found sufficient at an earlier stage—the possibility of avoiding symbolic change being due to the fresh interpretation of our constants.

The above remarks apply to the axiom of reducibility as well as to our other primitive propositions. If, at any stage, we wish to deal with a class defined by a function of the 30,000th type, we shall have to repeat our arguments and assumptions 30,000 times. But there is still no necessity to speak of the hierarchy as a whole, or to suppose that statements can be made about "all types."

We come now to the extensional hierarchy. This starts from some one point in the functional hierarchy. We usually suppose it to start from[Pg xii] individuals, but any other starting-point is equally legitimate. Whatever type of functions (including $\text{Indiv}$ we start from, all higher types of functions are excluded from the extensional hierarchy, and also all lower types (if any). Some complications arise here. Suppose we start from $\text{Indiv}$ . Then if $\phi!\hat{z}$ is any predicative function of individuals, $\hat{z}(\phi!z) = \phi!\hat{z}$ . But identity between a function and a class does not have the usual properties of identity; in fact, though every function is identical with some class, and vice versa, the number of functions is likely to be greater than the number of classes. This is due to the fact that we may have $\hat{z}(\phi!z)=\psi!\hat{z}.\hat{z}(\phi!z)=\chi!\hat{z}$ without having $\psi!\hat{z}=\chi!\hat{z}$ .

In the extensional hierarchy, we prove the extension from classes to classes of classes, and so on, without fresh primitive propositions (*20, *21). The primitive propositions involved are those concerning the functional hierarchy.

From all these various modes of extension we "see" that whatever can be proved for lower types, whether functional or extensional, can also be proved for higher types[1]. Hence we assume that it is unnecessary to know the types of our variables, though they must always be confined within some one definite type.

Now although everything that can be proved for lower types can be proved for higher types, the converse does not hold. In Vol. I. only two propositions occur which can be proved for higher but not for lower types. These are $\exists !2$ and $\exists !2_{r}$ . These can be proved for any type except that of individuals. It is to be observed that we do not state that whatever is true for lower types is true for higher types, but only that whatever can be proved for lower types can be proved for higher types. If, for example, $\text{Nc}ʻ{\text{Indiv}} = \nu$ , then this proposition is false for any higher type; but this proposition, $\text{Nc}ʻ{\text{Indiv}} = \nu$ , is one which cannot be proved logically; in fact, it is only ascertainable by a census, not by logic. Thus among the propositions which can be proved by logic, there are some which can only be proved for higher types, but none which can only be proved for lower types.

The propositions which can be proved in some types but not in others all are or depend upon existence-theorems for cardinals. We can prove $\begin{array}{l} \exists !0,\, \exists !1,\, \text{universally},\\ \exists !2,\, \text{except for}\,\, \text{Indiv},\\ \exists !3,\, \exists !4,\, \text{except for}\,\, \text{Indiv},\, \text{Cl}ʻ\text{Indiv},\, \text{Rl}ʻ\text{Indiv};\,\, \text{and so on}. \end{array}$ Exactly similar remarks would apply to the functional hierarchy. In both cases, the possibility of proving these propositions depends upon the axiom of reducibility and the definition of identity. Suppose there is only one individual, $x$ . Then $\hat{y}=x$ , $\hat{y}\neq x$ are two different functions, which, by the[Pg xiii] axiom of reducibility, are equivalent to two different predicative functions. Hence there are at least two predicative functions of $x$ , and at least two classes $\iotaʻx$ , $\Lambda_{x}$ . This argument fails both for classes and functions if either we deny the axiom of reducibility or we suppose that there may be two different individuals which agree in all their predicates, i.e. that the definition of identity is misleading.

The statement that what can be proved for lower types can be proved for higher types requires certain limitations, or rather, a more exact formulation. Taking $\text{Indiv}$ as a primitive idea, put $\text{Kl} = \text{Cl}ʻ\text{Indiv} \quad\text{Df},\,\, \text{Kl}^{2} = \text{Cl}ʻ\text{Kl} \quad\text{Df}, \quad\text{etc}.$ Then consider the proposition $\text{Nc}ʻ\text{Kl} = \Lambda$ . We can prove $\text{Nc}ʻ\text{Kl} \cap tʻ\text{Indiv} = \Lambda . \exists ! \text{Nc}ʻ\text{Kl} \cap tʻ\text{Kl} . \exists ! \text{Nc}ʻ\text{Kl} \cap tʻ\text{Kl}^{2}. \quad\text{etc}.$ Thus $\text{Nc}ʻ\text{Kl} = \Lambda$ can be proved in the lowest type in which it is significant, and disproved in any other. The difficulty, however, is avoided if Indiv is replaced by a variable $\alpha$ , and $\text{Kl}$ by $\text{Cl}ʻt_{0}ʻ\alpha$ . Then we have $\text{Nc}ʻ\text{Cl}ʻt_{0}ʻ\alpha \cap tʻ\alpha = \Lambda,$ and this holds whatever the type of $\alpha$ may be. Thus in order that our principle about lower and higher types may be true, it is necessary that any relation there may be between two types occurring in a proposition should be preserved; in other words, when one constant type is defined in terms of another (as $\text{Kl}$ and $\text{Indiv}$ ), the definition must be restored before the type is varied, so that when one type is varied, so is the other. With this proviso, our principle about higher and lower types holds.

With the above proviso, the truth of our statement is manifest. For we have shown that the same primitive propositions, symbolically, which hold for the lowest type concerned in our reasoning, hold also for subsequent types; and therefore all our proofs can be repeated symbolically unchanged.

The importance of this lies in the fact that, when we have proved a proposition for the lowest significant type, we "see" that it holds in any other assigned significant type. Hence every proposition which is proved without the mention of any type is to be regarded as proved for the lowest significant type, and extended by analogy to any other significant type.

By exactly similar considerations we "see" that a proposition which can be proved for some type other than the lowest significant type must hold for any type in the direct descent from this. E.g. suppose we can prove a proposition (such as $\exists ! 2$ ) for the type $\text{Kl}$ (where $\text{Kl} = \text{Cl}ʻ\text{Indiv}$ ); then merely writing $\text{Cl}ʻ\text{Indiv}$ for $\text{Kl}$ , we have a proposition which is proved concerning $\text{Indiv}$ , namely $\exists!2 \cap tʻ\text{Cl}ʻ\text{Indiv}$ , and here, by what was said before, $\text{Indiv}$ ) may be replaced by any higher type.

Thus given a typically ambiguous relation $R$ , such that, if $\tau$ is a type, $Rʻ\tau$ is a type ( $\text{Cl}$ or $\text{Rl}$ is such a relation), we "see" that, if we can prove[Pg xiv] $\phi (Rʻ\text{Indiv})$ , we can also prove $\phi (Rʻ\tau)$ , where $\tau$ is any type, and $\phi$ is composed of typically ambiguous symbols. Similarly if we can prove $\phi (\text{Indiv},Rʻ\text{Indiv})$ , we can prove $\phi (\tau ,Rʻ\tau)$ , where $\tau$ is any type. But we cannot in general prove $\phi (\text{Indiv},Rʻ\tau)$ or $\phi (\tau,Rʻ\text{Indiv})$ , and these may be in fact untrue. e.g. we have $\exists !\text{Nc}(\text{Kl})ʻ\text{Indiv}.{\sim}\exists!\text{Nc}(\text{Kl})ʻ\text{Kl}^{2}$ .

Thus more generally, when a proposition containing several ambiguities can be proved for the types $Rʻ\text{Indiv}$ , $Sʻ\text{Indiv}$ , ..., but not for lower types, it is to be regarded as a function of $\text{Indiv}$ , and then it becomes true for any type; that is, given $\phi (Rʻ\text{Indiv},Sʻ\text{Indiv}, \ldots),$ we shall also have $\phi (Rʻ\tau,Sʻ\tau, \ldots),$ where $\tau$ is any type. In this way, all demonstrable propositions are in the first instance about $\text{Indiv}$ , and when so expressed remain true if any other type is substituted for $\text{Indiv}$ .

When a proposition containing typically ambiguous symbols can be proved to be true in the lowest significant type, and we can "see" that symbolically the same proof holds in any other assigned type, we say that the proposition has "permanent truth." (We may also say, loosely, that it is "true in all types.") When a proposition containing typically ambiguous symbols can be proved to be false in the lowest significant type, and we can "see" that it is false in any other assigned type, we say that it has "permanent falsehood." Any other proposition containing typically ambiguous symbols is said to be "fluctuating," or to have "fluctuating truth-value," as opposed to "permanent truth-value," which belongs to propositions that have either permanent truth or permanent falsehood.

In what follows, ambiguities concerned with the propositional hierarchy will be ignored, since they never lead to fluctuating propositions. Thus disjunction and negation and their derivatives will not receive explicit typical determination, but only such typical determination as results from assigning the types of the other typically ambiguous symbols involved.

It is convenient to call the symbolic form of a propositional function simply a "symbolic form." Thus, if a symbolic form contains symbols of ambiguous type it represents different propositional functions according as the types of its ambiguous symbols are differently adjusted. The adjustment is of course always limited by the necessity for the preservation of meaning. It is evident that the ideas of "permanent truth-value" and "fluctuating truth-value" apply in reality to symbolic forms and not to propositions or propositional functions. Ambiguity of type can only exist in the process of determination of meaning. When the meaning has been assigned to a symbolic form and a propositional function thereby obtained, all ambiguity of type has vanished.

To "assert a symbolic form" is to assert each of the propositional functions arising for the set of possible typical determinations which are somewhere enumerated. We have in fact enumerated a very limited number of types starting from that of individuals, and we "see" that this process can be indefinitely continued by analogy. The form is always asserted so far as the enumeration has arrived; and this is sufficient for all purposes, since it is essentially impossible to use a type which has not been arrived at by successive enumeration from the lower types.

The only difficulties which arise in Cardinal Arithmetic in connection with the ambiguities of type of the symbols are those which enter through the use of the symbol $\text{ sm }$ , or of the symbol $\text{Nc}$ , which is $\overrightarrow{\text{ sm }}$ . For it may happen that a class in one type has no class similar to it in some lower type (cf. *102·72 ·73). All fallacious reasoning in cardinal or ordinal arithmetic in connection with types, apart from that due to the mere absence of meaning in symbols, is due to this fact—in other words to the fact that in some types $\exists!\text{Nc}ʻ\alpha$ is true, and in other types $\exists !\text{Nc}ʻ\alpha$ may not be true. The fallacy consists in neglecting this latter possibility of the failure of $\exists !\text{Nc}ʻ\alpha$ for a limited number of types, that is, in taking the "fluctuating" form $\exists !\text{Nc}ʻ\alpha$ as though it possessed a "permanent" truth-value.

A fluctuating form however often possesses what is here termed a "stable" truth-value, which is as important as the permanent truth-value of other forms. For example, anticipating our definitions of elementary arithmetic, consider $2 +_{c} 3 = 5$ . There is no abstract logical proof that there are two individuals; so suppose 2 and 3 refer to classes of individuals, but 5 refers to classes of a high enough type, then with these determinations $2 +_{c} 3 = 5$ cannot be proved. But $2 +_{c} 3 = 5$ has a stable truth-value, since it can always be proved when all the types are high enough. In this case the fact that our empirical census of individuals (at least of the "relative" individuals of ordinary life) has outrun the capacity of logical proof, makes the fluctuation in the truth-value of the form to be entirely unimportant.

In order to make this idea precise, it is necessary to have a convention as to the order in which the types of symbols in a symbolic form are assigned. The rule we adopt is that the types of the real variables are to be first assigned, and then those of the constant symbols. The types of the apparent variables, if any, will then be completely determinate.

A symbolic form has a stable truth-value if, after any assignment of types to the real variables, types can be assigned to the constant symbols so that the truth-value of the proposition thus obtained is the same as the truth-value of any proposition obtained by modifying it by the assignment of higher types to some or all of the constant symbols. This truth-value is the stable truth-value.

The conventions, which we shall give below as to the assignment of types, practically restrict our interpretation of fluctuating symbolic forms to types in which the forms possess their stable truth-value. The assumption that these truth-values are stable never enters into the reasoning. But we judge a truth-value to be stable when any method of raising the types of the constant symbols by one step leaves it unaltered.

In practice the fluctuation of truth-values only enters into our consideration through a limited number of symbols called "formal numbers."

A constant formal number is any constant symbol for which there is a constant $\alpha$ such that, in whatever type the constant symbol is determined, it is, in that type, identical with $\text{Nc}ʻ\alpha$ . In other words if $\sigma$ be a constant symbol, then $\sigma$ is a formal number provided that "truth" is the permanent truth-value of $\sigma =\text{Nc}ʻ\alpha$ , for some constant $\alpha$ .

The functional formal numbers are defined by enumeration; they are $\text{Nc}ʻ\alpha,\,\, \Sigma \text{Nc}ʻ\kappa,\,\, \Pi \text{Nc}ʻ\kappa,\,\, \text{ sm }ʻʻ\mu,\,\, \mu+_{c}\nu,\,\, \mu-_{c}\nu,\,\, \mu \times_{c}\nu,\,\, \mu^\nu,$ where in each formal number the symbols $\alpha$ , $\kappa$ , $\mu$ , $\nu$ occurring in it are called the arguments of the functional form even when they are complex symbols. The argument of $\text{Nc}ʻ(\alpha +\beta)$ is $\alpha +\beta$ , and those of $\mu+_{c} (\nu +_{c} \varpi)$ are $\mu$ and $\nu+_{c} \varpi$ , and those of $1 +_{c} 2$ are 1 and 2.

Thus among the constant formal numbers are $0,\,\, 1,\,\, 2,\,\, \ldots,\,\, \aleph_{0},\,\, 1 +_{c} 2,\,\, 2 \times _{c} \aleph_{0},\,\, 2^{2}.$ The references which support this statement are

Among the functional formal numbers are $\text{Nc}ʻ(\alpha +\beta),\,\, \mu +_{c} (\nu +_{c} \varpi),\,\,(\mu +_{c} \nu) \times _{c} \varpi,\,\, (\mu +_{c} \nu )^\varpi.$ It will be observed that e.g. $1 +_{c} 2$ is both a constant and a functional formal number, so that the two classes are not mutually exclusive. In fact they possess an indefinite number of members in common.

A functional formal number consists of two parts, namely, its argument or arguments, and the constant "form." An argument of a functional formal number may be a complex symbol, and may be constant or variable. Thus $\mu +_{c} \nu$ is an argument of $(\mu +_{c} \nu) +_{c}\rho$ , [Pg xvii]and of ( $\mu +_{c} \nu) \times _{c} 1$ and of ( $\mu +_{c}\nu)^\rho$ ; also $2 +_{c} 3$ is an argument of ( $2 +_{c} 3)\times_{c} 1$ . The constant form is constituted by the other symbols which are constants. Two occurrences of functional formal numbers are only occurrences of the same formal number if the arguments and also the constant forms are identical in symbolism. Thus two occurrences of $\text{Nc}ʻ\alpha$ are occurrences of the same formal number, even if they are determined to be in different types; but $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are different formal numbers. Also $\mu^{1}$ and $\mu \times _{c} 1$ are different formal numbers because their "forms" are different, though the arguments $\mu$ and 1 are the same and (in the same type) the entity denoted is the same. Thus the distinction between formal numbers depends on the symbolism and not on the entity denoted, and in considering them it is symbolic analogy and not denotation which is to be taken into account. For example two different occurrences of the same formal number will not denote the same entity, if in the two occurrences the ambiguity of type is determined differently.

The functional formal numbers are divided into three sets: (i) the primary set consisting of the forms $\text{Nc}ʻ\alpha$ , $\Sigma \text{Nc}ʻ\kappa$ , $\Pi \text{Nc}ʻ\kappa$ , (ii) the argumental set consisting only of $\text{ sm }ʻʻ\mu$ , (iii) the arithmetical set consisting of $\mu +_{c} \nu$ , $\mu \times _{c}\nu$ , $\mu^\nu$ , and $\mu -_{c} \nu$ .

A functional formal number has at most two arguments. But an argument of a functional formal number may itself be a functional formal number, and will accordingly possess either one or two arguments, which in their turn may be functional formal numbers, and so on. The whole set of arguments and of arguments of arguments, thus obtained, is called the set of components of the original formal number. Thus $\mu$ , $\nu$ , $\rho$ , and $\mu +_{c} \nu$ are components of ( $\mu +_{c} \nu) +_{c} \rho$ ; and $\mu$ , $\nu$ and $\text{ sm }ʻʻ\mu$ are components of $\nu +_{c} \text{ sm }ʻʻ\mu$ ; and $\mu$ , $\alpha$ and $\text{Nc}ʻ\alpha$ are components of $\mu +_{c} \text{Nc}ʻ\alpha$ . The two arguments of ( $\mu +_{c} \nu) +_{c}\rho$ are $\mu +_{c} \nu$ and $\rho$ , and those of $\nu +_{c}\text{ sm }ʻʻ\mu$ are $\nu$ and $\text{ sm }ʻʻ\mu$ , and those of $\mu+_{c} \text{Nc}ʻ\alpha$ are $\mu$ and $\text{Nc}ʻ\alpha$ .

Addition, multiplication, exponentiation, and subtraction will be called the arithmetical operations; and in $\mu +_{c} \nu$ , $\mu \times _{c} \nu$ , $\mu ^\nu$ , $\mu -_{c} \nu$ , $\mu$ and $\nu$ will each be said to be subjected to these respective operations. The arithmetical components of an arithmetical formal number (i.e. one belonging to the arithmetical set) consist of those of its components which do not appear in the capacity of components of a component which does not belong to the arithmetical set. Thus $\mu$ , $\nu$ , $\rho$ , $\mu +_{c} \nu$ are arithmetical components of $(\mu +_{c} \nu) +_{c} \rho$ ; and $\nu$ and $\text{ sm }ʻʻ\mu$ are arithmetical components of $\nu +_{c} \text{ sm }ʻʻ\mu$ , but $\mu$ is not one; and $\mu$ and $\text{Nc}ʻ\alpha$ are arithmetical components of $\mu +_{c} \text{Nc}ʻ\alpha$ , but $\alpha$ is not one; and $\mu$ and $\text{ sm }ʻʻ(\nu +_{c} \rho)$ are arithmetical components of $\mu +_{c} \text{ sm }ʻʻ(\nu +_{c} \rho)$ , but $\nu +_{c} \rho$ and $\nu$ and $\rho$ are components of $\text{ sm }ʻʻ(\nu +_{c} \rho)$ and are therefore not arithmetical components of $\mu +_{c} \text{ sm }ʻʻ(\nu +_{c} \rho)$ . Only arithmetical formal numbers possess arithmetical components.

A formal number of the arithmetical set having no components which are formal numbers of the argumental set is called a pure arithmetical formal number. For example $\mu +_{c}(\nu +_{c} \rho)$ and $\mu +_{c} \text{Nc}ʻ\alpha$ are pure, but $\mu +_{c} \text{ sm }ʻʻ(\nu +_{c} \rho)$ and $\mu +_{c}\text{ sm }ʻʻ\text{Nc}ʻ\alpha$ are not pure.

There are many types involved in the consideration of a formal number. For example, in $\text{Nc}ʻ\alpha$ there is the type of $\text{Nc}ʻ\alpha$ and of $\alpha$ ; in $\mu +_{c} \nu$ there is the type of $\mu +_{c} \nu$ , the type of $\mu$ , and the type of $\nu$ ; and so on for more complex formal numbers. The type of a formal number as a whole in any occurrence is called its actual type. This is the type of the entity which it then represents.

The other types involved in a formal number in any occurrence are called its subordinate types.

The actual types are not indicated in the symbolism for the various formal numbers as stated above. They can be indicated relatively to the type of the variable $\xi$ by writing $\text{Nc}(\xi)ʻ\alpha$ , $\text{ sm }_{\xi }ʻʻ\mu$ , ( $\mu \times _{c} \nu)_{\xi}$ , ( $\mu^\nu)_{\xi}$ , ( $\mu -_{c} \nu)_{\xi}$ , by the notation of *65. Even when the actual type of a complex formal number, such as $\mu +_{c}(\nu +_{c} \varpi)$ , is settled—so for instance that we have $\{\mu +_{c} (\nu +_{c} \varpi)\}_{\xi}$ —the meaning of the symbol is not completely determined, for the type of $\nu +_{c} \varpi$ remains ambiguous. It follows, however, from

that the subordinate types make no difference to the value of a formal number, so long as the components are not null.

We can therefore make a formal number definite as soon as its actual type is definite by securing that its components are not null. This is done by the convention II T (below) combined with the definitions

When the subordinate types are adjusted in accordance with these definitions and conventions, they will be said to be normally adjusted.

But in order to state this convention $\text{IIT}$ we require a definition of what is here called the adequacy of the actual type of a formal number. The general idea of adequacy is simple enough, namely that, given the subordinate types of $\sigma$ , the actual type of $\sigma$ should be high enough to enable us logically to prove $\exists!\sigma$ when such a proof is possible for types which are not too low. For example, all types except the lowest for which it has meaning are adequate for the constant formal number 2. It is rather difficult however to state the meaning of adequacy with precision in a manner adapted to all formal numbers. Fortunately the definition of the lowest type which corresponds to this general idea of adequacy is not important for our purposes. It will be sufficient to define as adequate some types which certainly do have the property in question.

The method of definition which we adopt is to replace the formal number $\sigma$ by another one $\sigma'$ so related to $\sigma$ that with the same actual type for both we can prove $\exists!\sigma'.\supset.\exists!\sigma$ , whenever $\sigma$ is not equal to $\Lambda$ in all types. If $\sigma$ be functional, we need only consider its argument, or its two arguments, and can dismiss from consideration the other components; then we replace these arguments by others so that the $\sigma'$ has the required property. Thus:

(i) The actual types of $\text{Nc}ʻ\alpha$ , $\Sigma\text{Nc}ʻ\kappa$ , $\Pi \text{Nc}ʻ\kappa$ , and $\text{ sm }ʻʻ\mu$ are adequate when we can logically prove $\exists !Ncʻt_{0}ʻ\alpha,\,\, \exists !\Sigma Ncʻt_{0}ʻ\kappa,\,\, \exists !\Pi Ncʻt_{0}ʻ\kappa,\,\, \text{and}\,\, \exists !\text{ sm }ʻʻt_{0}ʻ\mu;$

(ii) The actual types of $\mu +_{c} \nu$ , $\mu -_{c} \nu$ , $\mu\times _{c} \nu$ , and $\mu^\nu$ are adequate when we can logically prove $\begin{aligned} &\exists!\text{N}_{0}cʻt_{1}ʻ\mu +_{c} \text{N}_{0}cʻt_{1}ʻ\nu,\quad \exists !\text{N}_{0}cʻt_{1}ʻ\mu -_{c} 0\cap t_{0}ʻ\nu,\\ &\exists!\text{N}_{0}cʻt_{1}ʻ\mu \times _{c} \text{N}_{0}cʻt_{1}ʻ\nu,\quad \text{and}\quad \exists!\text{N}_{0}cʻt_{1}ʻ\mu^{{\text{N}_{0}cʻt_{1}ʻ\nu}}. \end{aligned}$

It will be noticed that $t_{0}ʻ\alpha$ , $t_{0}ʻ\kappa$ , and $t_0ʻ\mu$ are the greatest classes of the same type as $\alpha$ , $\kappa$ , and $\mu$ respectively, and that $\text{N}_{0}cʻt_{1}ʻ\mu$ and $\text{N}_0cʻt_1ʻ\nu$ are the greatest cardinal numbers of the same type as $\mu$ and $\nu$ respectively. These definitions hold even when any of $\alpha$ , $\kappa$ , $\mu$ , $\nu$ are complex symbols.

The remaining formal numbers which are not functional must certainly be constant. The difficulty which arises here is that if $\sigma$ be such a formal number and $\aleph_{0}$ occurs in its symbolism, we have no logical method of deciding as to the truth or falsehood of $\exists !\aleph_{0}$ in any type. But we replace $\aleph_{0}$ by $\text{N}_{0}cʻt_{1}ʻ\aleph_{0}$ which is the greatest existent cardinal of the same type as $\aleph_{0}$ in that occurrence. Thus:

(iii) If $\sigma$ be a formal number which is not functional, an adequate actual type of $\sigma$ is one for which we can logically prove $\exists !\sigma'$ , where $\sigma'$ is derived from $\sigma$ by replacing any occurrence of $\aleph_{0}$ in $\sigma$ by $\text{N}_{0}cʻt_{1}ʻ\aleph_{0}$ . Accordingly if $\aleph_{0}$ does not occur in $\sigma$ , an adequate type is any actual type for which we can logically prove $\exists !\sigma$ .

In the case of members of the primary and argumental groups we have substituted the $\text{V}$ of the appropriate type in the place of each variable. When the actual type is adequate we have $(\alpha ).\exists !\text{Nc}ʻ\alpha,\quad (\kappa ).\exists !\Sigma \text{Nc}ʻ\kappa,\quad (\kappa ).\exists !\Pi \text{Nc}ʻ\kappa,\quad (\mu).\exists !\text{ sm }ʻʻ\mu.$

In the case of members of the arithmetical group (except in the case of $\mu -_c \nu)$ , we have substituted for each argument the largest cardinal number which can be obtained in the type of that argument, namely the $\text{N}_{0}cʻ\text{V}$ for the $\text{V}$ of the appropriate type. Accordingly we are sure (except in the case of $\mu -_c \nu)$ that for all other values of the arguments which are existent cardinal numbers the formal number is not null.

It will be noticed that normal adjustment only concerns the subordinate types. For example *110·03 secures that in $\text{Nc}ʻ\alpha +_{c}\mu$ the actual type of[Pg xx] $\text{Nc}ʻ\alpha$ is adequate, and *110·23 shows that any adequate actual type of $\text{Nc}ʻ\alpha$ will do. But nothing is said about the actual type of $\text{Nc}ʻ\alpha +_{c}\mu$ . We make the following definition: When the subordinate types of a formal number are normally adjusted, and the actual type is adequate, the types of the formal number are said to be arithmetically adjusted.

We notice that for the primary set, the arithmetical adjustment of types means the same thing as the adequate adjustment of the actual type. Also if the arguments of a formal number of the arithmetical set are simple symbols, the two ideas come to the same thing.

In the case of variable formal numbers of the primary set, it follows from *117·22 ·32 that when their types are arithmetically adjusted they are not equal to $\Lambda$ for any values of their variables.

Also in the case of those variable formal numbers which are of the pure arithmetical set (excluding $\mu -_{c} \nu$ ) it follows from *100·4 ·52 ·42.*113·23.*116·23 that, working from the ultimate components reached by successive analysis upwards, for all values of such ultimate components which are members of $\text{NC} - \iotaʻ\Lambda$ they can be reduced to the case of the formal numbers of the primary group; and that therefore they are not equal to $\Lambda$ when their types are arithmetically adjusted. For example in $\mu +_{c} \{\nu+_{c} (\rho +_{c} \sigma)\}$ , $\mu$ , $\nu$ , $\rho$ , $\sigma$ are these ultimate components; let them be existent cardinal numbers. Hence when the types are arithmetically adjusted, the actual type of $\rho +_{c} \sigma$ is adequate and $\rho +_{c} \sigma$ is an existent cardinal; we can therefore substitute $\text{N}_{0}cʻ\alpha$ for it. By the same reasoning we can substitute $\text{N}_{0}cʻ\beta$ for $\nu +_c\text{N}_0cʻ\alpha$ , and again $\text{N}_{0}\text{c}ʻ\gamma$ for $\mu +_{c} \text{N}_{0}cʻ\beta$ .

A definite standard arithmetical adjustment of types for any formal number can always be found by making every use of $\text{ sm }$ , whether explicit or concealed in $\text{Nc}$ or in some other symbol, to be homogeneous. Proofs which apply to any arithmetical adjustment of types start by dealing with this standard type, and then by the use of *104·21.*106·21 ·211 ·212 ·213 the extension is made to the adjacent higher classical and relational types. We then "see" that by the analogy of symbolism this extension can always be formally proved at each stage, so that we are dealing with the stable truth-value. For some constant formal numbers a lower existential type can be found than that indicated by this method.

A symbolic form of any of the kinds [cf. *117·01 ·04 ·05 ·06] $\mu > \nu,\quad \mu < \nu,\quad \mu \geq \nu,\quad \mu \leq \nu,$ is called an arithmetical inequality.

These forms only arise when we are comparing cardinal numbers in respect to the relation of being "greater than" or "less than." It might seem natural to include equations among these arithmetical inequalities. Their use however, even as between cardinal numbers, is not so exclusively arithmetical, and it is convenient to consider them separately under another heading during our preliminary investigations.

In the arithmetical inequalities as above written, $\mu$ and $\nu$ , or any symbols replacing $\mu$ and $\nu$ , are called the opposed sides of the inequality, and either of $\mu$ or $\nu$ is called a side of the inequality.

Symbolic forms of the kinds $\sigma =\kappa$ and $\sigma \neq \kappa$ , where either $\sigma$ or $\kappa$ is a formal number, will be called equations and inequations respectively; and $\sigma$ and $\kappa$ are called the opposed sides of the equation or inequation, and either of them is simply a side of the equation or inequation.

When we reach the exclusively arithmetical point of view, it will be convenient to put together equations, inequations and arithmetical inequalities as one sort of symbolic form. Their separation here is for the sake of investigations into the exceptions due to the failure of existence theorems in low types. It is unnecessary to consider arithmetical inequalities in this connection.

The ways in which a symbol $\sigma$ can occur in a symbolic form are named as follows:

The occurrence of $\sigma$ in $\text{ sm }ʻʻ\sigma$ is called an argumental occurrence,

The occurrence of $\sigma$ as an argument of an arithmetical formal number (which may be a component of another formal number) or as one side of an arithmetical inequality is called an arithmetical occurrence,

The occurrence of $\sigma$ as one side of an equation is called an equational occurrence,

The occurrence of $\sigma$ in " $\xi \in \sigma$ " is called an attributive occurrence,

Any other occurrence of $\sigma$ is called a logical occurrence, so also is $\sigma =\Lambda$ .

It is obvious that a pair of opposed sides of an equation or inequation must be of the same type. Furthermore, if $\sigma$ be a formal number, and *20·18 is applied so as to give $\vdash \colon\ldotp \sigma =\kappa .\supset :f(\sigma).\equiv .f(\kappa),$ [Pg xxii]the equational occurrence of $\sigma$ must be of the same type as its occurrence in $f(\sigma$ ), otherwise the inference is fallacious. Accordingly substitution in arithmetical formulae can only be undertaken when the conventions as to the relations of ambiguous types secure this identity. This question is considered later in this prefatory statement, and the result appears in the text as *118·01.

At this point some examples will be useful; they will also be referred to subsequently in connection with the conventions limiting ambiguities of type.

*100·35. $\begin{aligned}\vdash \colon\ldotp \exists !\text{Nc}ʻ\alpha .\lor.&\exists !\text{Nc}ʻ\beta :\supset:\\ &\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\equiv .\alpha \in \text{Nc}ʻ\beta .\equiv .\beta \in \text{Nc}ʻ\alpha .\equiv .\alpha\,\text{ sm }\,\beta\end{aligned}$

Here the formal numbers are $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ , each of which has three occurrences. The first occurrence of $\text{Nc}ʻ\alpha$ is logical, its second is equational, and its third is attributive.

$\vdash :\mu ,\nu \in \text{NC}.\exists !\mu \cap \nu .\supset .(\exists \alpha,\beta).\mu =\text{Nc}ʻ\alpha .\nu =\text{Nc}ʻ\beta .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

Here $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are the only formal numbers, and all their occurrences are equational.

*100·44 (in the demonstration).
$\vdash :\mu \in \text{NC}.\exists !\text{Nc}ʻ\alpha .\alpha \in \mu .\supset .(\exists \beta ).\mu =\text{Nc}ʻ\beta .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

Here $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are the only formal numbers; the first occurrence of $\text{Nc}ʻ\alpha$ is logical, its second is equational; both the occurrences of $\text{Nc}ʻ\beta$ are equational.

*100·511. $\vdash :\exists !\text{Nc}ʻ\beta .\supset .\text{ sm }ʻʻ\text{Nc}ʻ\beta =\text{Nc}ʻ\beta$

Here the formal numbers are $\text{Nc}ʻ\beta$ and $\text{ sm }ʻʻ\text{Nc}ʻ\beta$ . The first occurrence of $\text{Nc}ʻ\beta$ is logical, the second is argumental, the third is equational; the only occurrence of $\text{ sm }ʻʻ\text{Nc}ʻ\beta$ is equational.

*100·521. $\vdash :\mu \in \text{NC}.\exists !\,\text{ sm }ʻʻ\mu .\supset .\text{ sm }ʻʻ\text{ sm }ʻʻ\mu =\mu$

Here $\text{ sm }ʻʻ\mu$ and $\text{ sm }ʻʻ\text{ sm }ʻʻ\mu$ are the only formal numbers; $\text{ sm }ʻʻ\mu$ has two occurrences, the first logical, the second argumental; $\text{ sm }ʻʻ\text{ sm }ʻʻ\mu$ has one occurrence, which is equational.

*101·28 (in the demonstration).
$\vdash :\gamma\in \text{ sm }ʻʻ1.\equiv .(\exists \alpha ).\alpha \in 1.\gamma\, \text{ sm }\,\alpha$

Here the formal numbers are 1 and $\text{ sm }ʻʻ1$ . The first occurrence of 1 is argumental, the second is attributive; the occurrence of $\text{ sm }ʻʻ1$ is attributive.

*110·54. $\vdash .(\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta) +_{0} \text{Nc}ʻ\gamma = \text{Nc}ʻ(\alpha +\beta +\gamma)$

Here the formal numbers are $\text{Nc}ʻ\alpha,\,\, \text{Nc}ʻ\beta,\,\, \text{Nc}ʻ\gamma,\,\, \text{Nc}ʻ(\alpha +\beta +\gamma),\,\, \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta,\,\, (\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta) +_{c} \text{Nc}ʻ\gamma.$ The occurrence of $\text{Nc}ʻ(\alpha +\beta +\gamma$ ) and that of ( $\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta) +_{c} \text{Nc}ʻ\gamma$ are both equational, and they must be of the same type since they are opposed sides of the same equation. The occurrences of the other formal numbers[Pg xxiii] are as arithmetical components of a more complex arithmetical formal number and are therefore arithmetical.

The formal numbers are $\nu \times _{c} \varpi$ , $\mu^{\nu }$ , $\mu ^{\nu \times _{c} \varpi}$ , and ( $\mu^{\nu})^{\varpi}$ . Each formal number occurs once only. The occurrences of $\nu \times _{c} \varpi$ and $\mu^{\nu}$ are arithmetical, and those of the other two are equational.

*117·108. $\vdash \colon\ldotp \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta . \equiv : \text{Nc}ʻ\alpha > \text{Nc}ʻ\beta . \lor . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta$

The formal numbers are $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ , each with three occurrences. The first two occurrences of each formal number are arithmetical, the last occurrence of each is equational.

*120·53 (in the demonstration).
$\vdash : \beta = \gamma +_{c} \delta . \exists ! \beta . \supset . \alpha ^\beta = \alpha^\gamma \times _{c} \alpha^\delta$

Here the formal numbers are $\gamma +_{c} \delta$ , $\alpha ^\beta$ , $\alpha ^\gamma$ , $\alpha ^\delta$ , $\alpha ^\gamma \times _{c}\alpha ^\delta$ . Each formal number has one occurrence. Those of $\gamma +_{c}\delta$ , $\alpha ^\beta$ and $\alpha ^\gamma \times _{c} \alpha^\delta$ are equational, and those of $\alpha ^\gamma$ and $\alpha^\delta$ are arithmetical.

*120·53 (in the demonstration).
$\vdash : \alpha^\beta = \alpha^\gamma . \beta = \gamma +_{c} \delta . \exists ! \alpha^\beta . \supset . \alpha ^\gamma = \alpha ^\gamma \times _{c} \alpha ^\delta$

Here the formal numbers are $\alpha ^\beta$ , $\alpha ^\gamma$ , $\alpha ^\delta$ , $\alpha ^\gamma \times _{c} \alpha ^\delta$ , $\gamma +_{c} \delta$ . The first occurrence of $\alpha ^\beta$ is equational, its second occurrence is logical; the first two occurrences of $\alpha ^\gamma$ are equational, its third occurrence is arithmetical; the only occurrence of $\alpha ^\delta$ is arithmetical; the only occurrences of $\alpha ^\gamma \times _{c}\alpha ^\delta$ and of $\gamma +_{c} \delta$ are equational.

Two occurrences of a formal number with the same actual type are said to be bound to each other.

The choice of types for formal numbers, when they are not made definite in terms of variables by the notation of *65, is limited by the following conventions, which enable us to dispense largely with the elaboration produced by the definition of types.

$\text{IT}$ . All logical occurrences of the same formal number are in the same type; argumental occurrences are bound to logical and attributive occurrences; and, if there are no argumental occurrences, equational occurrences are bound to logical occurrences.

This rule only applies, so far as meaning permits, to those types which remain ambiguous after the assignment of types to the real variables.

It will be noticed that if there are no argumental or logical occurrences of a formal number, $\text{IT}$ does not in any way apply to the assignment of types to the occurrences in the form of that formal number.

The identification of types in argumental and attributive occurrences by $\text{IT}$ is rendered necessary to secure the use of the equivalence $\gamma \in \text{ sm }ʻʻ\sigma .\equiv .(\exists \alpha ).\alpha \in \sigma .\gamma\,\text{ sm }\,\alpha,$ where $\sigma$ is a formal number. Without the convention, this application of *37·1 would be fallacious. The only one of our examples to which this part of the convention applies is *101·28 (demonstration), where it secures that the two occurrences of 1 are in the same type. It is relevant however to the symbolism in the demonstration of *100·521.

It will be found in practice that this convention relates the types of occurrences in the same way as would naturally be done by anyone who was not thinking of the convention at all. To see how the convention works, we will run through the examples which have already been given above.

In *100·35, $\text{IT}$ directs the logical and equational occurrences of $\text{Nc}ʻ\alpha$ to be in the same type, and similarly for $\text{Nc}ʻ\beta$ . Also "meaning" secures that the equational types of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are the same. Thus these four occurrences are all in one type, which has no necessary relation to the types of the attributive occurrences of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ . Thus, using the notation of *65·04 to secure typical definiteness, *100·35 is to mean $\begin{aligned} \vdash \colon\ldotp \exists !&\text{Nc}(\xi )ʻ\alpha .\lor.\exists !\text{Nc}(\xi)ʻ\beta :\supset :\\ &\text{Nc}(\xi)ʻ\alpha =\text{Nc}(\xi)ʻ\beta .\equiv .\alpha \in \text{Nc}(\alpha)ʻ\beta .\equiv .\beta \in \text{Nc}(\beta)ʻ\alpha .\equiv .\alpha\,\text{ sm }\,\beta.\end{aligned}$

The types of these attributive occurrences are settled by the necessity of "meaning."

In *100·42 (demonstration), since all the occurrences of formal numbers are equational, $\text{IT}$ produces no limitation of types.

In *100·44 (demonstration), $\text{IT}$ secures that the two occurrences of $\text{Nc}ʻ\alpha$ are in the same type. Also we notice that the first occurrence of $\text{Nc}ʻ\beta$ is really (cf. *65·04) $\text{Nc}(\alpha)ʻ\beta$ , since " $\alpha \in \mu$ " occurs, and thus "meaning" requires this relation of types, and the second occurrence of $\text{Nc}ʻ\beta$ is in the type of the occurrences of $\text{Nc}ʻ\alpha$ .

In *100·511, $\text{IT}$ directs that the logical and argumental occurrences are to have the same type. In *100·521, $\text{IT}$ directs that the two occurrences of $\text{ sm }ʻʻ\mu$ are to have the same type. In *101·28 both occurrences of 1 are to be in the same type. In *101·38, $\text{IT}$ directs that all the occurrences of 2 are to have the same type.

The convention $\text{IT}$ in no way limits the types in *110·54, nor in *116·63, nor in *117·108.

In the first example from *120·53 (in the demonstration) convention $\text{IT}$ has no application.

In the second example from *120·53 (in the demonstration) convention $\text{IT}$ directs that the two occurrences of $\alpha ^\beta$ shall be in the same type; and the[Pg xxv] necessity of "meaning" secures that the first occurrence of $\alpha ^\gamma$ shall also be in this type. The same necessity secures that $\gamma +_{c} \delta$ shall be in the same type as $\beta$ ; and it also secures that in " $\alpha ^\gamma = \alpha ^\gamma \times _{c} \alpha ^\delta$ " the first occurrence of $\alpha ^\gamma$ and that of $\alpha ^\gamma\times_c \alpha^\delta$ shall have a common type, which is otherwise unfettered; also nothing has been decided as to the types of $\alpha ^\gamma$ and $\alpha ^\delta$ in $\alpha ^\gamma\times _{c} \alpha ^\delta$ .

We now come to conventions embodying the outcome of arithmetical ideas. The term "arithmetical" is here used to denote investigations in which the interest lies in the comparison of formal numbers in respect to equality or inequality, excluding the exceptional cases—whenever the cases are exceptional—due to the failure of existence in low types. The thorough-going arithmetical point of view, which we adopt later in the investigation on Ratio and Quantity and also in this volume in *117 and *126 and some earlier propositions, would sweep aside as uninteresting all investigation of the exact ways in which the failure of existence theorems is relevant to the truth of propositions, thus concentrating attention exclusively on stable truth-values. But the logical investigation has its own intrinsic interest among the principles of the subject. It is obvious however that it should be restrained to a consideration of the theorems of purely logical interest. In practice this extrusion of uninteresting cases of the failure of arithmetical theorems, even amid the logical investigations of the first part of this volume, is effected by securing that all arithmetical occurrences of formal numbers have their actual types adequate.

As far as formal numbers of the primary group, i.e. $\text{Nc}ʻ\alpha$ , $\Sigma \text{Nc}ʻ\kappa$ , $\Pi\text{Nc}ʻ\kappa$ , are concerned, the arithmetical adjustment of types is secured formally in the symbolism by the definitions *110·03 ·04 for addition, and *113·04 ·05 for multiplication, and *116·03 ·04 for exponentiation, and *117·02 ·03 for arithmetical inequalities, and *119·02 ·03 for subtraction.

We save the symbolic elaboration which would arise from the extension of similar definitions to other formal numbers by the following convention:

$\text{IIT}$ . Whenever a formal number $\sigma$ occurs, so that, if it were replaced by $\text{Nc}ʻ\alpha$ , the actual type of $\text{Nc}ʻ\alpha$ would by definition have to be adequate, then the actual type of $\sigma$ is also to be adequate.

For example in $\mu +_{c} (\nu +_{c} \varpi)$ , if $\nu +_{c}\varpi$ were replaced by $\text{Nc}ʻ\alpha$ , then by *110·04 the actual type of $\text{Nc}ʻ\alpha$ is adequate. Hence by $\text{IIT}$ the actual type of $\nu +_{c} \varpi$ is to be adequate: accordingly so long as $\nu$ and $\varpi$ are simple variables and members of $\text{NC}-\iotaʻ\Lambda$ , we can always assume $\exists !(\nu +_{c}\varpi)$ for the type of the occurrence of $\nu +_{c} \varpi \in \mu +_{c} (\nu +_{c} \varpi)$ .

It is essential to notice that so long as the argument of an argumental formal number, or the arguments of an arithmetical formal number, are adjusted arithmetically, the exact types chosen make no difference. This follows for argumental formal numbers from *102·862 ·87 ·88, for addition from[Pg xxvi] *110·25, for multiplication from *113·26, for exponentiation from *116·26, for subtraction from *119·61 ·62. Thus (remembering also *100·511) in any definite type a formal number has one definite meaning provided that any subordinate formal number which occurs in its symbolism is determined existentially. The convention $\text{IIT}$ directs us always to take this definite meaning for any pure arithmetical formal number.

The convention does not determine completely the meaning of an arithmetical formal number which is not pure. For example, $\mu +_{c}(\nu +_{c} \rho )$ is a pure arithmetical formal number when $\mu$ , $\nu$ , $\rho$ are determined in type; and convention $\text{IIT}$ directs that the type of $(\nu +_{c} \rho)$ is to be adequate. But $\mu +_{c} \text{ sm }ʻʻ(\nu +_{c} \rho)$ is an arithmetical formal number which is not pure, and convention $\text{IIT}$ directs that the type of the domain of $\text{ sm }$ is to be adequate, but does not affect the type of $\nu +_{c} \rho$ . Thus it is easy to see that $\text{IIT}$ secures the adequacy of the actual types of all arithmetical components of any arithmetical formal numbers which occur, but does not affect the actual type of a formal number which occurs as the argument of an argumental formal number. But in this case convention $\text{IT}$ will bind the actual type of this occurrence of the argument to any logical or attributive occurrence of the same formal number. For example, if $\exists ! \nu +_{c} \rho$ and $\mu +_c\text{ sm }ʻʻ(\nu +_c \rho)$ occur in the same form, then these two occurrences of $\nu +_{c} \rho$ must have the same actual type. In practice argumental formal numbers are useful as components of arithmetical formal numbers for the very purpose of avoiding the automatic adjustment of types directed by $\text{IIT}$ .

The meaning of $\text{IIT}$ is best explained by examples. Among our previous examples we need only consider those in which arithmetical formal numbers occur.

In *110·54 the convention or definitions direct us to determine the types of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ adequately when forming $\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta$ , also to determine $\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta$ and $\text{Nc}ʻ\gamma$ adequately when forming $(\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta)+_{c} \text{Nc}ʻ\gamma$ . The convention does not apply to the types of $(\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta) +_{c} \text{Nc}ʻ\gamma$ and $\text{Nc}ʻ(\alpha + \beta + \gamma)$ . These types must be identical in order to secure meaning.

In *116·63 the convention directs us to adjust the types of $\nu\times _c \varpi$ and $\mu ^\nu$ adequately; it does not affect the types of $\mu ^{\nu \times _{c} \varpi}$ and $(\mu^\nu)^\varpi$ , which must be identical to secure meaning. If we replace $\mu$ , $\nu$ , $\varpi$ by formal numbers, by 2, $\aleph_{0}$ , and 1 for example, we get " $\vdash . 2^{\aleph_{0}\times \text{c1}} = (2^{\aleph _{0}})^{1}$ ." The convention now directs that 1 is to be determined adequately. It so happens that any type is adequate for it, since $\exists ! 1$ can be proved in any type. Then adequate types for $\aleph _{0} \times_{c} 1$ and $2^{\aleph _{0}}$ are types for which we can prove $\exists! (\text{N}_{0} cʻt_{1}ʻ\aleph _{0}) \times _{c} 1$ and $\exists! 2^{\text{N}_{0} cʻt_{1}ʻ\aleph _{0}}$ . Thus if $\tau$ is the type of $\aleph _{0}$ in both cases, an adequate type for $\aleph_{0} \times _{c} 1$ is $\tau$ , and for $2^{\aleph _{0}}$ is $\text{Cl}ʻ\tau$ .

In *117·108 we find arithmetical occurrences in arithmetical inequalities. Thus $\text{IIT}$ directs us to take the first two occurrences of $\text{Nc}ʻ\alpha$ and the first[Pg xxvii] two of $\text{Nc}ʻ\beta$ with adequate actual types. The type of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ in $\text{Nc}ʻ\alpha= \text{Nc}ʻ\beta$ is not affected by it. It is evident that the conventions $\text{IT}$ , $\text{IIT}$ are not sufficient to secure the truth of this proposition as thus symbolized. It is essential that in the equation the type be adjusted adequately for both formal numbers. In fact the general arithmetical convention, that types of equational as well as of arithmetical occurrences are adjusted arithmetically, is here used.

Principle of Arithmetical Substitution. In *120·53, the application of $\text{IIT}$ needs a consideration of the whole question of arithmetical substitution. Consider the first of the two examples. We have $\vdash : \beta = \gamma +_c \delta . \exists ! \beta . \supset . \alpha ^\beta = \alpha ^\gamma \times _c \alpha ^\delta.$

It is obvious that unless we can pass with practical immediateness from " $\beta = \gamma +_c \delta. \alpha ^\beta = \alpha ^\beta$ " to " $\alpha ^\beta = \alpha^{\gamma +_c \delta}$ " by *20·18, arithmetic is made practically impossible by the theory of types. But a difficulty arises from the application of $\text{IIT}$ . Suppose we assign the types of our real variables first. Then the types of $\alpha$ , $\beta$ , $\gamma$ , $\delta$ can be arbitrarily assigned, and there is no necessary connection between them which arises from the preservation of meaning. Thus $\beta$ may be in a type which is not an adequate type for $\gamma +_c \delta$ . Assume that this is the case. But the equational use of $\gamma +_c \delta$ is in the same type as $\beta$ , and by $\text{IIT}$ the arithmetical use of $\gamma +_c \delta$ in $\alpha^{\gamma +_c \delta}$ is in an adequate type. Thus, on the face of it, the reasoning, appealing to *20·18, by which the substitution was justified, is fallacious; for the two occurrences of $\gamma +_c \delta$ in fact mean different things.

In order to generalize our solution of this difficulty it is convenient to define the term "arithmetical equation." An arithmetical equation is an equation between purely arithmetical formal numbers whose actual types are both determined adequately. Then it is evident that from " $\sigma = \tau.f(\tau)$ ," where $\sigma$ and $\tau$ are formal numbers and $\tau$ occurs arithmetically in $f(\tau)$ , we cannot infer $f(\sigma)$ unless the equation $\sigma = \tau$ is arithmetical. For otherwise the $\tau$ in the equation cannot be identified with the $\tau$ in $f(\tau)$ .

When we have " $\beta = \tau . f(\tau)$ ," where $\tau$ is a formal number and $\beta$ is a number in a definite type, and wish to pass to " $f(\beta)$ ," or " $\beta = \tau . f(\beta)$ " and wish to pass to " $f(\tau)$ ," the occurrence of $\tau$ in $f(\tau)$ being arithmetical, the type of $\beta$ may not be an adequate type for $\tau$ . Accordingly the $\tau$ in " $\beta = \tau$ " cannot be identified with the $\tau$ in $f(\tau)$ . The type of the $\tau$ in the equation ought to be freed from dependence on that of $\beta$ . Accordingly the transition is only legitimate when we can write instead $\unicode{x201c}\beta +_c 0 = \tau . f(\tau )\unicode{x201d}\quad \text{or}\quad \unicode{x201c}\beta +_c 0 = \tau . f(\beta ),\unicode{x201d}$ [Pg xxviii] where in both cases the equation is arithmetical. For now all the symbols are subject to the same rules.

If this modification can be made without altering the truth-value of the asserted propositions, the substitution is legitimate, otherwise it is not.

It is obvious that in the above our immediate passage is to or from $f(\beta +_{c}0)$ . But is easy to see that, the occurrence of $\beta+_{c}0$ being arithmetical, we always have $f(\beta ).\equiv .f(\beta +_{c}0).$ In order to prove this, we have only to prove $\begin{array}{l} \alpha +_{c}(\beta +_{c}0)&=\alpha +_{c}\beta,\\ \alpha \times _{c}(\beta +_{c}0)&=\alpha \times _{c}\beta,\\ (\alpha +_{c}0)^\beta &=\alpha ^\beta, \alpha ^{\beta +_{c}0}&=\alpha ^\beta, \end{array}$ $\text{and}\qquad \alpha >\beta +_{c}0.\equiv .\alpha >\beta .\equiv .\alpha +_{c}0>\beta.$

The demonstration of the first of these propositions runs as follows: $\begin{array}{l} \vdash .*110·4.\supset \vdash \colon\ldotp \beta {\sim}\in \text{NC}.\lor.\beta =\Lambda :&\supset .\beta +_{c}0=\Lambda .\alpha +_{c}\beta =\Lambda.\\ [*110·4] &\supset .\alpha +_{c}(\beta +_{c}0)=\Lambda =\alpha +_{c}\beta &\qquad \text{(1)}\\ \vdash .*110·4.&\supset \vdash \colon\ldotp \alpha {\sim}\in \text{NC}.\lor.\alpha =\Lambda :\supset .\alpha +_{c}(\beta +_{c}0)=\Lambda =\alpha +_{c}\beta &\qquad \text{(2)}\\ \vdash .*110·6.\supset \vdash :\alpha ,\beta \in \text{NC}-{℩}ʻ\Lambda .\supset .\alpha +_{c}(\beta +_{c}0)&=\alpha +_{c}\text{ sm }ʻʻ\beta \\ &=\alpha +_{c}\beta &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash :\alpha +_{c}(\beta +_{c}0)=\alpha +_{c}\beta \end{array}$

In the above demonstration the step to (3) is legitimate since by the hypothesis $\beta$ is a determination of $\text{ sm }ʻʻ\beta$ in an adequate type.

We must also consider the circumstances under which we can pass from " $\beta =\tau$ " to " $\beta +_{c}0=\tau$ ," where the latter equation is arithmetical. In other words, using *65·01 we require the hypothesis necessary for $\exists !\tau _{\eta }.\beta =\tau _{\xi }.\supset .\beta +_{c}0=\tau _{\eta }.$

We have $\begin{array}{l} \vdash .*20·18. &\supset \vdash :\beta =\tau_{\xi }.\supset .\beta +_{c}0=\tau_{\xi }+_{c}0 &\qquad \text{(1)}\\ \vdash .*110·35. &\supset \vdash :\exists !\tau_{\xi }.\exists !\tau_{\eta }.\supset .\tau_{\xi }+_{c}0=\tau_{\eta }+_{c}0 &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\ldotp \exists !\tau_{\xi }.\exists !\tau_{\eta }.\supset :\beta =\tau_{\xi }.\supset .\beta +_{c}0=\tau_{\eta }+_{c}0 &\qquad \text{(3)}\\ \vdash .(3). &\supset \vdash \colon\ldotp \exists !\beta .\exists !\tau_{\eta }.\supset :\beta =\tau_{\xi }.\supset .\beta +_{c}0=\tau_{\eta }+_{c}0 &\qquad \text{(4)} \end{array}$

Now in (4) the occurrences of $\beta +_{c}0$ and $\tau_{\eta}+_{c}0$ , which are in the same type, may be chosen to be in any type we like. Hence we deduce $\begin{array}{l} \vdash .(4).*110·6.\supset \vdash \colon\ldotp \exists !\beta .\exists !\tau _{\eta}.\supset :\beta =\tau _{\xi}.&\supset .(\beta +_{c}0)_{\zeta }=\text{ sm }_{\zeta}ʻʻ\tau _{\eta}.\\ [*100·511] &\supset .(\beta +_{c}0)_{\zeta}=\tau_{\zeta} \end{array}$

Hence $\exists !\beta$ is the requisite condition. Now since $\zeta$ can be in any type, we can also choose it in any existential type for $\tau$ . Thus with $\text{IIT}$ applying to the arithmetical occurrence of $\tau$ in $f(\tau)$ , we have, where $\tau$ is a formal number and $\beta$ is a number in a definite type, $\begin{aligned} \vdash :\exists !\beta .\beta &=\tau .f(\tau).\supset .f(\beta),\\ \vdash :\exists !\beta .\beta &=\tau .f(\beta).\supset .f(\tau),\\ \vdash :\exists !\sigma .\sigma &=\tau .f(\tau).\supset .f(\sigma). \end{aligned}$

In the last proposition by $\text{IT}$ the equation $\sigma =\tau$ is arithmetical. These equations are summed up in *118·01.

These three fundamental theorems embody the principle of arithmetical substitution. The hypothesis $\exists !\beta$ is really less than is assumed in ordinary life, the usual tacit assumption being $\beta \in\text{NC}-\iota ʻ\Lambda$ . In fact unless $\beta \in \text{NC}$ , $\beta =\tau$ is necessarily false.

Principle of Identification of Types. Suppose we have proved " $\vdash :\text{Hp}.\supset .\phi \sigma$ " and " $\vdash :\phi(\sigma _{\xi}).\supset .p$ ," where $\sigma$ is a formal number whose occurrence in " $\vdash :\text{Hp}.\supset .\phi \sigma$ " is in an entirely ambiguous type, and $\phi _{\xi}$ is the same formal number $\sigma$ with its type related to that of $\xi$ by *65·01. Then since the type of the $\sigma$ in " $\vdash :\text{Hp}.\supset.\phi \sigma$ " is ambiguous, we can write " $\vdash :\text{Hp}.\supset.\phi (\sigma _{\xi})$ " and thence infer " $\vdash .p$ ."

The principle is: An entirely undetermined type in an asserted symbolic form can be identified with any type ambiguous or otherwise in any other asserted symbolic form or in the same symbolic form.

For example in *100·42 (demonstration) considered above, since $\exists !\mu \cap \nu$ occurs, the first occurrences of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are of the same type, and so are their second occurrences in $\text{Nc}ʻ\alpha=\text{Nc}ʻ\beta$ . But the two types are not determined by our conventions to have any necessary connection. In fact the type in $\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$ is entirely arbitrary. Accordingly it can be identified with the other type, and thus the inference to the next line, viz. to " $\vdash :\text{Hp}.\supset.\mu =\nu$ ," is justified.

In the case of arithmetical equations, it is important to notice that we have $\vdash .*100·321·33.\supset \vdash \colon\ldotp \exists !\text{Nc}(\xi)ʻ\alpha .\supset :\text{Nc}(\xi)ʻ\alpha =\text{Nc}(\xi)ʻ\beta .\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta.$ Hence if $\sigma$ and $\tau$ are formal numbers, $\vdash \colon\ldotp \exists !\sigma_{\xi}.\supset :\sigma _{\xi}=\tau _{\xi}.\supset .\sigma =\tau.$ Thus if we have " $\vdash :\text{Hp}.\exists !\sigma .\supset .\sigma=\tau$ " and " $\vdash :\text{Hp}ʻ.\sigma _{\eta}=\tau _{\eta}.\supset.p$ ," we can infer from the former proposition " $\vdash:\text{Hp}.\exists !\sigma .\supset .\sigma _{\eta}=\tau_{\eta}$ " and from this and the latter proposition, we infer " $\vdash:\text{Hp}'.\text{Hp}.\exists !\sigma .\supset .p$ ," so the general principle of identification can be employed when the $\phi (\sigma)$ in the first proposition is an arithmetical equation.

For example, in an example given above, *100·44 (demonstration), viz. $\vdash :\mu \in \text{NC}.\exists !\text{Nc}ʻ\alpha .\alpha \in \mu .\supset .(\exists \beta).\mu =\text{Nc}ʻ\beta .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta,$ [Pg xxx] the equation $\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$ is arithmetical. Accordingly we are justified in asserting the propositional function $\vdash :\mu \in \text{NC}.\exists !\text{Nc}ʻ\alpha .\alpha \in \mu .\supset .(\exists \beta).\mu =\text{Nc}(\alpha )ʻ\beta .\text{Nc}(\alpha)ʻ\alpha =\text{Nc}(\alpha)ʻ\beta,$ where $\text{Nc}(\alpha )ʻ\beta$ in " $\mu =\text{Nc}(\alpha)ʻ\beta$ " has all along been presupposed by the necessity of meaning. Thus the inference follows, $\begin{aligned} \vdash :\mu \in \text{NC}.\exists !\text{Nc}ʻ\alpha .\alpha \in \mu .&\supset .\text{Nc}(\alpha )ʻ\alpha =\mu .\\ &\supset .\text{Nc}ʻ\alpha =\mu . \end{aligned}$

This proof loses its point when $\mu$ is looked on as a variable with necessarily the same type throughout. For then the proposition collapses into $\vdash \colon\ldotp \mu \in \text{NC}.\supset :\alpha \in \mu .\equiv .\text{Nc}(\alpha )ʻ\alpha =\mu .$

But if $\mu$ be a formal number necessarily a member of $\text{NC}$ , the proposition is really $\vdash \colon\ldotp \exists !\text{Nc}ʻ\alpha .\supset :\alpha \in \mu .\equiv .\text{Nc}ʻ\alpha =\mu .$

With this presupposition we should have in the first line of the demonstration $\unicode{x201c}\vdash :\exists !\text{Nc}ʻ\alpha .\text{Nc}ʻ\alpha =\mu .\supset .\alpha \in \mu,\unicode{x201d}$ though with " $\mu$ " a single variable, the line is formally correct as it stands in the text.

Recognition of Particular Cases. It is important to notice the conditions under which $\phi \sigma$ can be recognized as a particular case of $\phi \xi$ , where $\xi$ is a real variable and $\sigma$ is a formal number. In the first place obviously we must substitute $\sigma \cap t_{0}ʻ\xi$ for $\sigma$ , wherever it occurs in $\phi \sigma$ , and thus obtain $\phi (\sigma \cap t_{0}ʻ\xi)$ . Then we may find that by the application of our conventions, we can replace this by $\phi \sigma$ . For example we have

*100·42. $\vdash :\mu ,\nu \in \text{NC}.\exists !\mu \cap \nu .\supset .\mu =\nu$

Now put $\text{Nc}ʻ\alpha \cap t_{0}ʻ\mu$ for $\mu$ , we obtain $\begin{array}{l} \vdash :\text{Nc}ʻ\alpha \cap t_{0}ʻ\mu ,\nu \in \text{NC}.\exists !(\text{Nc}ʻ\alpha \cap t_{0}ʻ\mu )\cap \nu .\supset .\text{Nc}ʻ\alpha \cap t_{0}\mu =\nu &\qquad \text{(1)}\\ \vdash .(1).*100·41.\supset \vdash :\nu \in \text{NC}.\exists !\text{Nc}ʻ\alpha \cap t_{0}ʻ\mu \cap \nu .\supset .\text{Nc}ʻ\alpha \cap t_{0}ʻ\mu =\nu &\qquad \text{(2)} \end{array}$

Now by $\text{IT}$ , even when $\nu$ is a formal number, the identity of types of the two occurrences of $\text{Nc}ʻ\alpha$ is equally secured in $\vdash :\nu \in \text{NC}.\exists !\text{Nc}ʻ\alpha \cap \nu .\supset .\text{Nc}ʻ\alpha =\nu.$

Thus this is a particular case of *100·42. Such deductions can be made in general without any explicit formal statement.

Ambiguity of $\text{NC}$ . It follows (cf. *100·02 and *103·02) from the typical ambiguity of $\text{Nc}$ that $\text{NC}$ is also typically ambiguous. Hence " $\mu \in \text{NC}.\nu \in \text{NC}$ " according to our methods of interpretation would not necessitate that $\mu$ and $\nu$ should be of the same type. We shall always interpret " $\mu ,\nu \in \text{NC}$ " as standing for " $\mu \in \text{NC}.\nu \in \text{NC}$ " and therefore as not necessarily identifying the types of $\mu$ and $\nu$ . Similarly for $\text{N}_{0}\text{C}$ , $\text{NC induct}$ , and $\text{NC ind}$ . For example

*110·402. $\vdash :\mu,\nu \in \text{N}_{0}\text{C}.\supset .\exists !(\mu +_{c} \nu )\cap tʻtʻ(\mu \uparrow \nu)$

*110·41. $\vdash :\mu,\nu \in \text{N}_{0}\text{C}.tʻ\mu = tʻ\nu .\supset .\exists !(\mu +_{c} \nu)\cap tʻ\mu$

Here the identification of the types of $\mu$ and $\nu$ requires the hypothesis " $tʻ\mu = tʻ\nu$ ."

General Arithmetical Convention. Conventions $\text{IT}$ and $\text{IIT}$ are always applied, but the following convention is not used at first. This convention limits the remaining ambiguity of type by sweeping away the exceptional cases in low types, due to the failure of existence theorems. The convention will be cited as $\text{AT}$ .

$\text{AT}$ . All equations involving pure arithmetical formal numbers are to be arithmetical.

We have seen that from an arithmetical equation the analogous equation in any other type can be deduced. Thus with $\text{AT}$ all equations between formal numbers are so determined in type that their truth in "any type" is deducible. Thus in the few early propositions where $\text{AT}$ is introduced, the fact is noted by stating that the equations hold "in any type." These propositions are *103·16, *110·71 ·72.

The effect of applying $\text{AT}$ to other propositions in *100 is to render some of the hypotheses (usually logical forms affirming existence) unnecessary, but also materially to limit the scope of the propositions. Take for example

*100·35. $\begin{aligned}\vdash :\exists !\text{Nc}ʻ\alpha .\lor.&\exists !\text{Nc}ʻ\beta :\supset:\\ &\text{Nc}ʻ\alpha = \text{Nc}ʻ\beta .\equiv .\alpha \in \text{Nc}ʻ\beta .\equiv .\beta \in \text{Nc}ʻ\alpha .\equiv .\alpha\,\text{ sm }\,\beta\end{aligned}$

If we apply $\text{AT}$ to this, we can write $\vdash :\text{Nc}ʻ\alpha = \text{Nc}ʻ\beta .\equiv .\alpha \in \text{Nc}ʻ\beta .\equiv .\beta \in \text{Nc}ʻ\alpha .\equiv .\alpha\,\text{ sm }\,\beta.$

For the equational occurrences of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are by $\text{AT}$ and $\text{IIT}$ to be with adequate actual types. But if $\alpha$ is a small class in a high type, an adequate actual type for $\text{Nc}ʻ\alpha$ will be a high type, whereas $\exists !\text{Nc}ʻ\alpha$ may hold in a low type. Thus with $\text{AT}$ , for the sake of simplicity we abandon the statement of the minimum of hypothesis necessary for our propositions. The enunciation of no other proposition in *100 is affected.

The enunciation of no proposition in *101 is affected by $\text{AT}$ , though it would unduly limit the scope of *101·34. In *110, $\text{AT}$ would unduly limit the scope of such propositions as

and of many others, without altering their enunciations. There is no proposition in *110 whose enunciation it would alter. $\text{AT}$ is already[Pg xxxii] applied to *110·71 ·72; if $\text{AT}$ is removed from these propositions, then $\exists !\text{Nc}ʻ\alpha$ must be added as an hypothesis to both of them. The effect of $\text{AT}$ on *113 and *116 is entirely analogous to that on *110; in neither of these two numbers is there any proposition to which $\text{AT}$ is applied in the text.

As regards *117, $\text{AT}$ is applied throughout, so that the propositions are all in the form suitable for subsequent investigations in which the interest is purely arithmetical. It is important however to analyse the effect of AT on the enunciations for the sake of logical investigations, especially in connection with *120. First, $\text{AT}$ can only affect propositions in which equations or inequations occur, and among such propositions it does not affect the enunciations of those in which both sides of the equations are not formal numbers, so that the equations are not arithmetical after the application of AT. These propositions are *117·104 ·14 ·24 ·241 ·243 ·31 ·551. These propositions, which are characterized by the presence of a single letter on one side of any equation involved, can be recognized at a glance. The propositions involving arithmetical equations whose enunciations are unaltered by the removal of $\text{AT}$ are *117·21 ·54 ·592. Propositions involving inequations whose enunciations are unaltered by the removal of $\text{AT}$ are *117·26 ·27. Finally the only propositions of *117 whose enunciations are altered by the removal of $\text{AT}$ are *117·108 ·211 ·23 ·25 .

In *120, which is devoted to those properties of inductive cardinals which are of logical interest, $\text{AT}$ is never used. None of the propositions *117·108 ·211 ·23 ·25 ·3 are cited in it, except *117·25 in the demonstration of *120·435 for a use where $\text{AT}$ is not relevant. The application of AT to *120 would simplify the hypotheses of *120·31 ·41 ·451 ·53 ·55, and limit the scopes of the propositions.

One other convention, which we will call " $\text{Infin T}$ ," is required in certain propositions where the hypothesis implies that there are types in which every inductive cardinal exists, i.e. in which $\text{V}$ is not an inductive class. Among such hypotheses are $\text{Infin ax}$ , $\exists !\text{Prog}$ , $\exists!\aleph_{0}$ (or typically definite forms of these hypotheses), or $R\in \text{Prog}$ or $\alpha \in \aleph_{0}$ . When such hypotheses occur, we shall assume that $\text{NC}$ induct is, whenever significance permits, to be determined in a type in which every inductive cardinal exists, i.e. in which the axiom of infinity holds (cf. *120·03 ·04). The statement of this convention is as follows:

$\text{Infin T}$ . When the hypothesis of a proposition implies that there is a type in which every inductive cardinal exists, every occurrence of " $\text{NC induct}$ " in this proposition is to be taken (if conditions of significance permit) in a sufficiently high type to insure the existence of every inductive cardinal.

It is to be observed that this convention would be unnecessary if we confined ourselves to one extensional hierarchy, for in any one such hierarchy[Pg xxxiii] all types are inductive or all are non-inductive, so that if every inductive cardinal exists in one type in the hierarchy, the same holds for any other type in the hierarchy. But when we no longer confine ourselves to one extensional hierarchy, this result may not follow. For example, it may be the case that the number of individuals is inductive, but the number of predicative functions of individuals is not inductive; at any rate, no logical reason can be given against this possibility, which can only be rejected on empirical grounds, if at all.

The way in which this convention is used may be illustrated by the demonstration of *122·33. In the second line of this demonstration, we show that the hypothesis implies $\begin{array}{l} \qquad\qquad\qquad\qquad\qquad \text{E}!\nu_{R} . \supset . \text{E}!(\nu +_{c}1)_{R} &\qquad \text{(1)}\\ \text{where by} *121·04\qquad \nu_{R} = \breve{R}_{\nu -_{c}1}ʻBʻR &\qquad\text{Df},\\ \text{and by} *121·02\qquad R_{\nu} = \hat{x} \hat{y}\{\text{N}_{0}\text{c}ʻR(x \vdash\dashv y) = \nu +_{c}1\} &\qquad\text{Df}. \end{array}$ It will be seen that these definitions do not suffice to determine the type of $\nu$ . Hence in (1), the $\nu$ on the left may not be of the same type as the $\nu +_{c}1$ on the right. Now the use of *122·473, which occurs in the next line of the demonstration of *122·33, requires that the $\nu$ on the left and the $\nu +_{c}1$ on the right should be of the same type. This requires that the $\nu$ should not be taken in a type in which we have $\exists !\nu. \nu +_c 1 = \Lambda$ . Hence in order to apply *120·473, we must choose a type in which all inductive cardinals exist. Since " $R \in \text{Prog}$ " occurs in the hypothesis, we know that all inductive cardinals exist in the type of $CʻR$ . But it is unnecessary to restrict ourselves to the type of $CʻR$ , since any other type in which all inductive cardinals exist will equally secure the validity of the demonstration. Thus the convention $\text{Infin T}$ secures the restriction required, and no more.

The convention $\text{Infin T}$ is often relevant when " $\text{Infin ax}$ " without any typical determination occurs in the hypothesis. Whenever this is the case, if " $\text{NC induct}$ " occurs in the proposition in a way which leaves its type undetermined so far as conditions of significance are concerned, it is to be taken in a type in which all its members exist.

It is now (whenever $\text{AT}$ is used, together with $\text{Infin T}$ when necessary) possible finally to sweep aside all consideration of types in connection with inductive numbers. For by combining *126·121 *126·122 and *120·4232 ·4622, we see that it is always possible to take the type high enough so that no definitely determined inductive number shall be null ( $\Lambda)$ , and that all the inductive reasoning can take place within this type. Furthermore we have already seen that the arithmetical operations are independent of the types of the components, so long as they are existential. Thus, as far as the ordinary[Pg xxxiv] arithmetic of finite numbers is concerned, all the conventions (including AT), and the necessity for hypotheses as to the existence of inductive numbers, are finally superseded by the following single rule:

Rule of Indefinite Numbers. The type assigned to any symbol which represents an inductive number is such that the symbol is not equal to $\Lambda$ .

Wherever this symbol " $\text{Nc ind}$ " for the class of "indefinite inductive cardinal numbers" is used, the above rule is adhered to. In other words, " $\mu \in \text{Nc ind}$ " can always be replaced by " $\mu = \text{Nc}ʻ\alpha .\alpha \in \text{Cls induct}$ ," where $\text{Nc}ʻ\alpha$ is a homogeneous or ascending cardinal, and $\alpha$ is the appropriate constant, or is a variable, as the case may be. In the latter case, a symbolic form such as $(\mu).f(\mu \in \text{Nc ind},\mu)$ can be replaced by $(\mu,\alpha).f(\mu = \text{Nc}ʻ\alpha .\alpha \in \text{Cls induct},\mu).$

Furthermore by *120·4622 it follows that with this rule the result of proceeding by induction in one type and then transforming to another type is the same as that of proceeding by induction in the latter type. Thus for example there is no advantage to be gained by discriminating between $2_{\xi }$ and $2_{\eta }$ ; for $\text{ sm }_{\eta }ʻʻ2_{\xi} = 2_{\eta }$ , $\text{ sm }_{\xi }ʻʻ2_{\eta } = 2_{\xi }$ , $\mu +_{c}2_{\xi } = \mu +_{c} 2_{\eta }$ , $\mu \times _{c} 2_{\xi } = \mu \times _{c} 2_{\eta }$ , $\mu ^{2_\xi } = \mu ^{2_\eta }$ , $2_{\xi^\mu } = 2_{\eta ^\mu }$ , and $\mu \geq 2_{\xi }.\equiv .\mu \geq 2_{\eta }$ , and so on.

Hence all discrimination of the types of indefinite inductive numbers may be dropped; and the types are entirely indefinite and irrelevant.

FOOTNOTES:

[1] But cf. next page for a more exact statement of this principle.

IN this Part, we shall be concerned, first, with the definition and general logical properties of cardinal numbers (Section A); then with the operations of addition, multiplication and exponentiation, of which the definitions and formal laws do not require any restriction to finite numbers (Section B); then with the theory of finite and infinite, which is rendered somewhat complicated by the fact that there are two different senses of "finite," which cannot (so far as is known) be identified without assuming the multiplicative axiom. The theory of finite and infinite will be resumed, in connection with series, in Part V, Section E.

It is in this Part that the theory of types first becomes practically relevant. It will be found that contradictions concerning the maximum cardinal are solved by this theory. We have therefore devoted our first section in this Part (with the exception of two numbers giving the most elementary properties of cardinals in general, and of 0 and 1 and 2, respectively) to the application of types to cardinals. Every cardinal is typically ambiguous, and we confer typical definiteness by the notations of *63, *64, and *65. It is especially where existence-theorems are concerned that the theory of types is essential. The chief importance of the propositions of the present part lies, not only, as throughout the book, in the hypotheses necessary to secure the conclusions, but also in the typical ambiguity which can be allowed to the symbols consistently with the truth of the propositions in all the cases thereby included.

The Cardinal Number of a class $\alpha$ , which we will denote by " $\text{Nc}ʻ\alpha$ ," is defined as the class of all classes similar to $\alpha$ , i.e. as $\hat{\beta} (\beta\,\text{ sm }\,\alpha)$ . This definition is due to Frege, and was first published in his Grundlagen der Arithmetik[2]; its symbolic expression and use are to be found in his Grundgesetze der Arithmetik[3]. The chief merits of this definition are (1) that the formal properties which we expect cardinal numbers to have result from it; (2) that unless we adopt this definition or some more complicated and practically equivalent definition, it is necessary to regard the cardinal number of a class as an indefinable. Hence the above definition avoids a useless indefinable with its attendant primitive propositions.

It will be observed that, if $x$ is any object, 1 is not the cardinal number of $x$ , but that of $\iota ʻx$ . This obviates a confusion which otherwise is liable to arise in dealing with classes. Suppose we have a class $\alpha$ consisting of many terms; we say, nevertheless, that it is one class. Thus it seems to be at once one and many. But in fact it is $\alpha$ that is many, and $\iotaʻ\alpha$ that is one. In regard to zero, the analogous point is still clearer. Suppose we say "there are no Kings of France." This is equivalent to "the class of Kings of France has no members," or, in our language, "the class of Kings of France is a member of the class 0." It is obvious that we cannot say "the King of France is a member of the class 0," because there is no King of France. Thus in the case of 0 and 1, as more evidently in all other cases, a cardinal number appertains to a class, not to the members of the class.

For the purposes of formal definition, we subject the formula $\text{Nc}ʻ\alpha = \hat{\beta} (\beta\,\text{ sm }\,\alpha)$ to some simplification. It will be seen that, according to this formula, " $\text{Nc}$ " is a relation, namely the relation of a cardinal number to any class of which it is the number. Thus for example 1 has to $\iota ʻx$ the relation $\text{Nc}$ ; so has[Pg 5] 2 to $\iota ʻx \cup \iota ʻy$ , provided $x\neq y$ . The relation $\text{Nc}$ is, in fact, the relation $\overrightarrow{\text{ sm }}$ ; for $\overrightarrow{\text{ sm }}ʻ\alpha = \hat{\beta} (\beta\,\text{ sm }\, \alpha)$ . Hence for formal purposes of definition we put $\text{Nc} = \overrightarrow{\text{ sm }} \quad\text{Df}.$

The class of cardinal numbers is the class of objects which are the cardinal numbers of something or other, i.e. of objects which, for some $\alpha$ , are equal to $\text{Nc}ʻ\alpha$ . We call the class of cardinal numbers $\text{NC}$ ; thus we have $\text{NC} = \hat{\mu}\{(\exists \alpha) . \mu = \text{Nc}ʻ\alpha\}.$

For purposes of formal definition, we replace this by the simpler formula $\text{NC} = \text{D}ʻ\text{Nc} \quad\text{Df}.$

In the present section, we shall be concerned with what we may call the purely logical properties of cardinal numbers, namely those which do not depend upon the arithmetical operations of addition, multiplication and exponentiation, nor upon the distinction of finite and infinite[4]. The chief point to be dealt with, as regards both importance and difficulty, is the relation of a cardinal number in one type to the same or an associated cardinal number in another type. When a symbol is ambiguous as to type, we will call it typically ambiguous; when, either always or in a given context, it is unambiguous as to type, we will call it typically definite. Now the symbol " $\text{ sm }$ " is typically ambiguous; the only limitation on its type is that its domain and converse domain must both consist of classes. When we have $\alpha\,\text{sm}\,\beta$ , $\alpha$ and $\beta$ need not be of the same type, in fact, in any type of classes, there are classes similar to some of the classes of any other type of classes. For example, we have $\iota ʻx \text{ sm } \iota ʻy$ , whatever types $x$ and $y$ may belong to. This ambiguity of " $\text{ sm }$ " is derived from that of $1 \rightarrow 1$ , which in turn is derived from that of 1. We denote (cf. *65·01) by " $1_{\alpha}$ " all the unit classes which are of the same type as $\alpha$ . Then (according to the definition *70·01) $1_{\alpha} \rightarrow 1_{\beta}$ will be the class of those one-one relations whose domain is of the same type as $\alpha$ and whose converse domain is of the same type as $\beta$ . Thus " $1_{\alpha} \rightarrow 1_{\beta}$ " is typically definite as soon as $\alpha$ and $\beta$ are given. Suppose now, instead of having merely $\gamma \text{ sm } \delta$ , we have $(\exists R). R\in 1_{\alpha } \rightarrow 1_{\beta } . \text{D}ʻR = \gamma . \text{ᗡ}ʻR = \delta ;$ then we know not only that $\gamma\,\text{ sm }\,\delta$ , but also that $\gamma$ belongs to the same type as $\alpha$ , and $\delta$ belongs to the same type as $\beta$ . When the ambiguous symbol " $\text{ sm }$ " is rendered typically definite by having its domain defined as being of the same type as $\alpha$ , and its converse domain defined as being of the same type as $\beta$ , we write it " $\text{ sm }_{(\alpha ,\beta)}$ ," because generally, in accordance with *65·1, if $R$ is a typically ambiguous relation, we write [Pg 6] $R_{(\alpha ,\beta)}$ for the typically definite relation that results when the domain of $R$ is to consist of terms of the same type as $\alpha$ , and the converse domain is to consist of terms of the same type as $\beta$ . Thus we have $\gamma\,\text{ sm }_{(\alpha, \beta)}\,\delta . \equiv . (\exists R) . R \in 1_{\alpha} \rightarrow 1_{\beta} . \gamma = \text{D}ʻR . \delta = \text{ᗡ}ʻR.$ Here everything is typically definite if $\alpha$ and $\beta$ (or their types) are given.

Passing now to the relation " $\text{Nc}$ ," it will be seen that it shares the typical ambiguity of " $\text{sm}$ ." In order to render it typically definite, we must derive it from a typically definite " $\text{sm}$ ." So long as nothing is added to give typical definiteness, " $\text{Nc}ʻ\gamma$ " will mean all the classes belonging to some one (unspecified) type and similar to $\gamma$ . If $\alpha$ is a member of the type to which these classes are to belong, then $\text{Nc}ʻ\gamma$ is contained in the type of $\alpha$ . For this case, it is convenient to introduce the following two notations, already defined in *65. When a typically ambiguous relation $R$ is to be rendered typically definite as to its domain only, by deciding that every member of the domain is to be contained in the type of $\alpha$ , we write " $R(\alpha)$ " in place of $R$ . When we further wish to determine $R$ as having members of the converse domain contained in the type of $\beta$ , we write " $R(\alpha, \beta)$ " in place of $R$ ; and when we wish members of the converse domain to be members of the type of $\beta$ , we write " $R(\alpha_{\beta})$ " in place of $R$ . Thus $\text{sg}ʻ{R_{(\alpha, \beta)}} = \{\text{sg}ʻR\}(\alpha_{\beta})$ (cf. *65·2), and in particular, since $\text{Nc} =\overrightarrow{\text{ sm }}$ , $\text{Nc}(\alpha_{\beta}) = \text{sg}ʻ\text{ sm }_{(\alpha, \beta)}.$ Thus " $\text{Nc}(\alpha_{\beta})ʻ\gamma$ " is only significant when $\gamma$ is of the same type as $\beta$ , and then it means "classes of the same type as $\alpha$ and similar to $\gamma$ (which is of the same type as $\beta$ )."

" $\text{Nc}(\alpha)ʻ\gamma$ " will mean "classes of the same type as $\alpha$ and similar to $\gamma$ ." As soon as the types of $\alpha$ and $\gamma$ are known, this is a typically definite symbol, being in fact equal to $\text{Nc}(\alpha_{\gamma})ʻ\gamma$ . Hence so long as we only wish to consider " $\text{Nc}ʻ\gamma$ ," typical definiteness is secured by writing " $\text{Nc}(\alpha)$ " in place of " $\text{Nc}$ ."

When we come to the consideration of $\text{NC}$ , " $\text{Nc}(\alpha)$ " is no longer a sufficient determination, although it suffices to determine the type. Suppose we put $\text{NC}^{\beta}(\alpha) = \text{D}ʻ\text{Nc}(\alpha_{\beta}) \quad\text{Df};$ we have also, in virtue of the definitions in *65, $\text{NC}(\alpha) = \text{NC} \cap t^{2}ʻ\alpha = \text{D}ʻ\text{Nc}(\alpha).$ Thus $\text{NC}(\alpha)$ is definite as to type, but is the domain of a relation whose converse domain is ambiguous as to type; and it will appear that there are some propositions about $\text{NC}(\alpha)$ whose truth or falsehood depends upon the determination chosen for the converse domain of $\text{Nc}(\alpha)$ . Hence if we wish to have a symbol which is completely definite, we must write [Pg 7]" $\text{NC}^{\beta}(\alpha)$ ."

This point is important in connection with the contradictions as to the maximum cardinal. The following remarks will illustrate it further.

Cantor has shown that, if $\beta$ is any class, no class contained in $\beta$ is similar to $\text{Cl}ʻ\beta$ . Hence in particular if $\beta$ is a type, no class contained in $\beta$ is similar to $\text{Cl}ʻ\beta$ , which is the next type above $\beta$ . Consequently, if $\beta = \alpha \cup - \alpha$ , where $\alpha$ is any class, we have ${\sim}(\exists \gamma) . \gamma \subset \alpha \cup - \alpha . \gamma \text{ sm } \text{Cl}ʻ(\alpha \cup - \alpha).$

Now (cf. *63) we put $t_{0}ʻ\alpha = \alpha \cup - \alpha \quad\text{Df},$ and we have $tʻ\alpha = \text{Cl}ʻ(\alpha \cup - \alpha)$ . Thus we find $\begin{aligned} {\sim}&(\exists \gamma) . \gamma \subset t_{0}ʻ\alpha . \gamma\, \text{ sm }\, tʻ\alpha.\\ \text{Hence}\qquad &\text{Nc}(\alpha_{tʻ\alpha})ʻtʻ\alpha = \Lambda . \end{aligned}$ That is to say, no class of the same type as $\alpha$ has as many members as $tʻ\alpha$ has. Hence also $\begin{aligned} &\Lambda \in \text{NC}^{tʻ\alpha}(\alpha).\\ \text{But}\qquad \gamma \subset t_{0}ʻ\alpha . \supset . \gamma \in &\text{Nc}(\alpha_{\alpha })ʻ\gamma . \supset . \exists !\text{Nc}(\alpha_{\alpha })ʻ\gamma , \end{aligned}$ and " $\text{Nc}(\alpha_{\alpha})ʻ\gamma$ " is only significant when $\gamma \subset t_{0}ʻ\alpha$ ; hence $\begin{aligned} \mu \in &\text{NC}^{\alpha}(\alpha) . \supset_{\mu } . \exists !\mu\\ \text{and}\qquad\qquad &\Lambda {\sim}\in \text{NC}^{\alpha}(\alpha). \end{aligned}$

Now the notation " $\text{NC}(\alpha)$ " will apply with equal justice to $\text{NC}^{\alpha }(\alpha)$ or to $\text{NC}^{tʻ\alpha}(\alpha)$ ; but we have just seen that in the first case we shall have $\Lambda {\sim}\in \text{NC}(\alpha)$ , and in the second we shall have $\Lambda \in \text{NC}(\alpha)$ . Consequently " $\text{NC}(\alpha)$ " has not sufficient definiteness to prevent practically important differences between the various determinations of which it is capable.

A converse procedure to the above yields similar results. Let $\alpha$ be a class of classes; then $sʻ\alpha$ is of lower type than $\alpha$ . Let us consider $\text{NC}^{sʻ\alpha}(\alpha)$ . In accordance with *63, we write $t_{1}ʻ\alpha$ for the type containing $sʻ\alpha$ , i.e. for $sʻ\alpha \cup - sʻ\alpha$ . Then the greatest number in the class $\text{NC}^{sʻ\alpha}(\alpha)$ will be $\text{Nc}(\alpha)ʻt_{1}ʻ\alpha$ ; but neither this nor any lesser member of the class will be equal to $\text{Nc}(\alpha)ʻt_{0}ʻ\alpha$ , because, as before, ${\sim}(\exists \gamma ) . \gamma \subset t_{1}ʻ\alpha . \gamma \text{ sm } t_{0}ʻ\alpha .$ Hence $\text{Nc}(\alpha )ʻt_{0}ʻ\alpha$ , which is a member of $\text{NC}^{\alpha }(\alpha)$ , is not a member of $\text{NC}^{sʻ\alpha }(\alpha)$ ; but $\text{NC}^{\alpha}(\alpha)$ and $\text{NC}^{sʻ\alpha}(\alpha)$ have an equal right to be called $\text{NC}(\alpha)$ . Hence again " $\text{NC}(\alpha)$ " is a symbol not sufficiently definite for many of our purposes.

The solution of the paradox concerning the maximum cardinal is evident in view of what has been said. This paradox is as follows: It results from a theorem of Cantor's that there is no maximum cardinal, since, for all values of $\alpha$ , $\text{Nc}ʻ\text{Cl}ʻ\alpha \gt \text{Nc}ʻ\alpha .$ [Pg 8] But at first sight it would seem that the class which contains everything must be the greatest possible class, and must therefore contain the greatest possible number of terms. We have seen, however, that a class $\alpha$ must always be contained within some one type; hence all that is proved is that there are greater classes in the next type, which is that of $\text{Cl}ʻ\alpha$ . Since there is always a next higher type, we thus have a maximum cardinal in each type, without having any absolutely maximum cardinal. The maximum cardinal in the type of $\alpha$ is $\text{Nc}(\alpha)ʻ(\alpha \cup - \alpha).$ But if we take the corresponding cardinal in the next type, i.e. $\text{Nc}(\text{Cl}ʻ\alpha )ʻ(\alpha \cup - \alpha),$ this is not as great as $\text{Nc}(\text{Cl}ʻ\alpha)ʻ\text{Cl}ʻ(\alpha\cup - \alpha)$ , and is therefore not the maximum cardinal of its type. This gives the complete solution of the paradox.

For most purposes, what we wish to know in order to have a sufficient amount of typical definiteness is not the absolute types of $\alpha$ and $\beta$ , as above, but merely what we may call their relative types. Thus, for example, $\alpha$ and $\beta$ may be of the same type; in that case, $\text{Nc}(\alpha _{\beta})$ and $\text{NC}^{\beta }(\alpha)$ are respectively equal to $\text{Nc}(\alpha _{\alpha })$ and $\text{NC}^{\alpha }(\alpha)$ . We will call cardinals which, for some $\alpha$ , are members of the class $\text{NC}^{\alpha }(\alpha)$ , homogeneous cardinals, because the " $\text{sm}$ " from which they are derived is a homogeneous relation. We shall denote the homogeneous cardinal of $\alpha$ by " $\text{N}_{0}\text{C}ʻ\alpha$ ," and we shall denote the class of homogeneous cardinals (in an unspecified type) by " $\text{N}_{0}\text{C}$ "; thus we put $\begin{aligned} \text{N}_{0}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻ\alpha &\quad\text{Df},\\ \text{N}_{0}\text{C} &= \text{D}ʻ\text{N}_{0}\text{c} &\quad\text{Df}. \end{aligned}$ Almost all the properties of $\text{N}_{0}\text{C}$ are the same in different types. When further typical definiteness is required, it can be secured by writing $\text{N}_{0}\text{c}(\alpha)$ , $\text{N}_{0}\text{C}(\alpha)$ in place of $\text{N}_{0}\text{c}$ , $\text{N}_{0}\text{C}$ . For although $\text{Nc}(\alpha)$ and $\text{NC}(\alpha)$ were not wholly definite, $\text{N}_{0}\text{c}(\alpha)$ and $\text{N}_{0}\text{C}(\alpha)$ are wholly definite. Apart from the fact of being of different types, the only property in which $\text{N}_{0}\text{C}(\alpha)$ and $\text{N}_{0}\text{C}(\beta)$ differ when $\alpha$ and $\beta$ are of different types is in regard to the magnitude of the cardinals belonging to them. Thus suppose the whole universe consisted (as monists aver) of a single individual. Let us call the type of this individual " $\text{Indiv}$ ." Then $\text{N}_{0}\text{C}(\text{Indiv})$ will consist of 0 and 1, i.e. $\text{N}_{0}\text{C}(\text{Indiv}) = \iotaʻ0 \cup \iota ʻ1.$ But in the next higher type, there will be two members, namely $\Lambda$ and $\text{Indiv}$ . Thus $\begin{aligned} &\text{N}_{0}\text{C}(tʻ\text{Indiv}) = \iotaʻ0 \cup \iotaʻ1 \cup \iotaʻ2.\\ \text{Similarly}\qquad \text{N}_{0}\text{C}&(tʻtʻ\text{Indiv}) = \iotaʻ0 \cup \iotaʻ1 \cup \iotaʻ2 \cup \iotaʻ3 \cup \iotaʻ4, \end{aligned}$ [Pg 9] the members of $tʻtʻ\text{Indiv}$ being $\Lambda \cap tʻ\text{Indiv}, \iotaʻ\Lambda$ , $\iotaʻ\text{Indiv}$ , $\iotaʻ\Lambda \cup \iotaʻ\text{Indiv}$ ; and so on. (The greatest cardinal in any except the lowest type is always a power of 2.)

The maximum of $\text{N}_{0}\text{C}(\alpha)$ is $\text{N}_{0}\text{c}ʻt_{0}ʻ\alpha$ ; but apart from this difference of maximum and its consequences, $\text{N}_{0}\text{C}(\alpha)$ and $\text{N}_{0}\text{C}(\beta)$ do not differ in any important properties. Hence for most purposes $\text{N}_{0}\text{C}$ and $\text{N}_{0}\text{c}$ have as much typical definiteness as is necessary.

Among cardinals which are not homogeneous we shall consider three kinds. The first of these we shall call ascending cardinals. A cardinal $\text{NC}^{\beta}(\alpha)$ is called an ascending cardinal if the type of $\beta$ is $tʻ\alpha$ or $tʻtʻ\alpha$ or $tʻtʻtʻ\alpha$ or etc. We write $t^{2}ʻ\alpha$ for $tʻtʻ\alpha$ , $t^{3}ʻ\alpha$ for $tʻtʻtʻ\alpha$ , and so on. We put $\begin{aligned} \text{N}^{1}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻtʻ\alpha &&\quad\text{Df}\\ \text{N}^{2}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt^{2}ʻ\alpha &&\quad\text{Df}\\ \text{N}^{3}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt^{3}ʻ\alpha &&\quad\text{Df and so on},\\ \text{and}\qquad \text{N}^{1}\text{C} &= \text{D}ʻ\text{N}^{1}\text{c} &&\quad\text{Df}\\ \text{N}^{2}\text{C} &= \text{D}ʻ\text{N}^{2}\text{c} &&\quad\text{Df}\\ \text{N}^{3}\text{C} &= \text{D}ʻ\text{N}^{3}\text{c} &&\quad\text{Df and so on}. \end{aligned}$ We then have obviously $\text{N}^{1}\text{C}(tʻ\alpha) \subset \text{N}_{0}\text{C}(tʻ\alpha).$ We also have (by what was said earlier) $\begin{aligned} &\text{N}_{0}\text{c}ʻtʻ\alpha {\sim}\in \text{N}^{1}\text{C}(tʻ\alpha).\\ \text{Hence}\qquad &\exists !\text{N}_{0}\text{C}(tʻ\alpha) - \text{N}^{1}\text{C}(tʻ\alpha). \end{aligned}$ The members of $\text{N}_{0}\text{C}(tʻ\alpha) - \text{N}^{1}\text{C}(tʻ\alpha)$ will be all cardinals which exceed $\text{Nc}ʻt_{0}ʻ\alpha$ but do not exceed $\text{Nc}ʻtʻ\alpha$ .

Let us recur in illustration to our previous hypothesis of the universe consisting of a single individual. Then $\text{N}^{1}\text{c}\,\text{Indiv}$ will consist of those classes which are similar to " $\text{Indiv}$ " but of the next higher type. These are $\iota ʻ\Lambda$ and $\iota ʻ\text{Indiv}$ . In our case we had $\text{N}_{0}\text{c}(\text{Indiv}) = 1$ . This leads to $\text{N}^{1}\text{c}\,\text{Indiv} = 1 . \text{N}^{2}\text{c}\,\text{Indiv} = 1\, \quad\text{etc}.$ or, introducing typical definiteness, $\text{N}^{1}\text{c}\,\text{Indiv} = 1(tʻ\text{Indiv}) . \text{N}^{2}\text{c}\,\text{Indiv} = 1(t^{2}ʻ\text{Indiv})\, \quad\text{etc}.$ We have then $1(tʻ\text{Indiv}) \in\text{N}^{1}\text{C}(tʻtʻ\text{Indiv})$ . Also $1(tʻ\text{Indiv}) \in \text{N}_{0}\text{C}(tʻtʻ\text{Indiv}).$ And in the case supposed, $1(tʻ\text{Indiv})$ is the maximum of $\text{N}^{1}\text{C}(tʻtʻ\text{Indiv})$ , but $2(tʻ\text{Indiv}) \in\text{N}_{0}\text{C}(tʻtʻ\text{Indiv})$ . Hence $\text{N}_{0}\text{C}(tʻtʻ\text{Indiv}) - \text{N}^{1}\text{C}(tʻtʻ\text{Indiv}) = \iota ʻ2.$ Generalizing, we see that $\text{N}^{1}\text{C}(tʻ\alpha)$ consists of the same numbers as $\text{N}_{0}\text{C}(\alpha)$ each raised one degree in type. Similar propositions hold of $\text{N}^{2}\text{C}(t^{2}ʻ\alpha)$ , [Pg 10] $\text{N}^{3}\text{C}(t^{3}ʻ\alpha)$ etc.

It is often useful to have a notation for what we may call "the same cardinal in another type." Suppose $\mu$ is a typically definite cardinal; then we will denote by $\mu ^{(1)}$ the same cardinal in the next type, i.e. $\text{ sm }ʻʻ\mu \cap tʻ\mu .$ Note that, if $\mu$ is a cardinal, $\text{ sm }ʻʻ\mu \cap \mu = \mu$ ; and whether $\mu$ is a typically definite cardinal or not, $\text{ sm }ʻʻ\mu \cap tʻ\alpha$ is a cardinal in a definite type. If $\mu$ is typically definite, then $\text{ sm }ʻʻ\mu \cap tʻ\alpha$ is wholly definite; if $\mu$ is typically ambiguous, $\text{ sm }ʻʻ\mu \cap tʻ\alpha$ has the same kind of indefiniteness as belongs to $\text{NC}(\alpha)$ . The most important case is when $\mu$ is typically definite and $\alpha$ has an assigned relation of type to $\mu$ . We then put, as observed above, $\begin{aligned} \mu ^{(1)} &= \text{ sm }ʻʻ\mu \cap tʻ\mu &&\quad\text{Df}\\ \mu ^{(2)} &= \text{ sm }ʻʻ\mu \cap t^{2}ʻ\mu &&\quad\text{Df etc}. \end{aligned}$ If $\mu$ is an $\text{N}_{0}\text{C}$ , $\mu ^{(1)}$ is an $\text{N}^{1}\text{C}$ and $\mu ^{(2)}$ is an $\text{N}^{2}\text{C}$ and so on. $\text{N}^{1}\text{C}(tʻ\alpha)$ will consist of all numbers which are of the form $\mu^{(1)}$ for some $\mu$ which is a member of $\text{N}_{0}\text{C}(\alpha)$ ; i.e. $\text{N}^{1}\text{C}(tʻ\alpha) = \hat{\nu}\{(\exists \mu). \mu \in \text{N}_{0}\text{C}(\alpha) . \nu = \mu^{(1)}\}.$

The second kind of non-homogeneous cardinals to be considered is called the class of "descending cardinals." These are such as go into a lower type; i.e. $\text{Nc}(\alpha)ʻ\beta$ is a descending cardinal if $\alpha$ is of a lower type than $\beta$ . We put $\begin{aligned} \text{N}_{1}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt_{1}ʻ\alpha &&\quad\text{Df}\\ \text{N}_{2}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt_{2}ʻ\alpha &&\quad\text{Df etc}.\\ \text{N}_{1}\text{C} &= \text{D}ʻ\text{N}_{1}\text{C} &&\quad\text{Df}\\ \text{N}_{2}\text{C} &= \text{D}ʻ\text{N}_{2}\text{C} &&\quad\text{Df etc}.\\ \mu_{(1)} &= \text{ sm }ʻʻ\mu \cap t_{1}ʻ\mu &&\quad\text{Df}\\ \mu_{(2)} &= \text{ sm }ʻʻ\mu \cap t_{2}ʻ\mu &&\quad\text{Df etc}. \end{aligned}$

We have obviously $\text{N}_{0}\text{c}ʻ\alpha = \text{N}_{1}\text{c}ʻ\iotaʻʻ\alpha$ .

Also $\gamma \in \text{N}_{1}\text{c}ʻ\delta . \supset .\text{N}_{1}\text{c}ʻ\delta = \text{N}_{0}\text{c}ʻ\gamma$ , whence $\exists !\text{N}_{1}\text{c}ʻ\delta . \supset .\text{N}_{1}\text{c}ʻ\delta \in \text{N}_{0}\text{C}$ , whence $\text{N}_{1}\text{C} - \iota ʻ\Lambda \subset \text{N}_{0}\text{C}$ .

Since also $\Lambda {\sim} \in\text{N}_{0}\text{C}\text{N}_{0}\text{C}(\alpha)$ , we find $\text{N}_{0}\text{C} = \text{N}_{1}\text{C} - \iota ʻ\Lambda,$ this proposition not requiring any further typical definiteness, since it holds however such definiteness may be introduced, remembering that such definiteness is necessarily so introduced as to secure significance. Further, in virtue of the fact that no class contained in $t_{0}ʻ\alpha$ is similar to $tʻ\alpha$ , we have $\Lambda \in \text{N}_{1}\text{C}(\alpha).$ [Pg 11] Consequently $\text{N}_{1}\text{C} = \text{N}_{0}\text{C} \cup\iotaʻ\Lambda$ .

We can prove in just the same way $\begin{aligned} \text{N}_{2}\text{C} &= \text{N}_{0}\text{C} \cup \iotaʻ\Lambda.\\ \text{Hence}\qquad \text{N}_{1}\text{C} &= \text{N}_{2}\text{C}, \end{aligned}$ and this result can obviously be extended to all descending cardinals.

The third kind of non-homogeneous cardinals to be considered may be called "relational cardinals." They are those applicable to classes of relations having a given relation of type to a given class. Consider for example $\text{Nc}ʻ\in_{\Delta}ʻ\kappa$ . (We shall take this as the definition of the product of the numbers of the members of $\kappa$ .) Suppose now that $\kappa$ consists of a single term: we want to be able to say $\text{Nc}ʻ{\in}_{\Delta}ʻ\kappa = \text{Nc}ʻ\breve{\iota}ʻ\kappa .$ We have in this case, if $\kappa = \iota ʻ\alpha$ , $\in_{\Delta }ʻ\kappa = \downarrow \alphaʻʻ\alpha,$ and we know that $\downarrow \alphaʻʻ\alpha\,\text{ sm }\,\alpha$ . But if we put simply $\text{Nc}ʻ\downarrow \alphaʻʻ\alpha = \text{Nc}ʻ\alpha,$ our proposition, though not mistaken, requires care in interpretation. Just as we put $\iota ʻʻ\alpha \in \text{N}^{1}\text{c}ʻ\alpha$ , so we want a notation giving typical definiteness to the proposition $\downarrow \alpha ʻʻ\alpha \in \text{Nc}ʻ\alpha$ . This is provided as follows.

Using the notation of *64, put $\begin{aligned} \text{N}_{00}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt_{0}ʻ\alpha &&\quad\text{Df}\\ \text{N}_{0}^{1}\text{c}ʻ\alpha &= \text{Nc}ʻ\alpha \cap tʻt_{0}^{1}ʻ\alpha &&\quad\text{Df etc}.\\ \text{N}_{00}\text{C} &= \text{D}ʻ\text{N}_{00}c &&\quad\text{Df}\\ \text{N}_{0}^{1}\text{C} &= \text{D}ʻ\text{N}_{0}^{1}c &&\quad\text{Df etc}.\\ \mu_{00} &= \text{ sm }ʻʻ\mu \cap tʻt_{00}ʻt_{1}ʻ\mu &&\quad\text{Df etc}. \end{aligned}$ Then we have, for example, $\downarrow \alphaʻʻ\alpha \subset t_{0}^{1}ʻ\alpha,\quad\textit{i.e.}\quad \downarrow \alphaʻʻ\alpha \in tʻt_{0}^{1}ʻ\alpha.$ Hence $\downarrow \alphaʻʻ\alpha \in\text{N}_{0}^{1}\text{c}ʻ\alpha$ , where $\text{N}_{0}^{1}ʻ\alpha =\text{Nc}ʻ\alpha \cap t_{0}^{1}ʻ\alpha$ .

Similarly $x \in tʻ\alpha . \supset . \downarrow xʻʻ\alpha \in\text{N}_{00}\text{c}ʻ\alpha$ .

In order to complete our notation for types, we should need to be able to express the type of the domain or converse domain of $R$ , or of any relation whose domain and converse domain have respectively given relations of type to the domain and converse domain of $R$ . Thus we might put $\begin{aligned} d_{0}ʻR &= t_{0}ʻ\text{D}ʻR &&\quad\text{Df}\\ b_{0}ʻR &= t_{0}ʻ\text{ᗡ}ʻR &&\quad\text{Df} \end{aligned}$ ("b" appears here as "d" written backwards) $\begin{aligned} d_{00}ʻR &= tʻ(d_{0}ʻR \uparrow b_{0}ʻR) &&\quad\text{Df}\\ &= tʻR\\ d^{mn}ʻR &= tʻ(t^{m}ʻd_{0}ʻR \uparrow t^{n}ʻb_{0}ʻR) &&\quad\text{Df and so on}. \end{aligned}$

This notation would enable us to deal with descending relational cardinals. But it is not required in the present work, and is therefore not introduced among the numbered propositions.

When a typically ambiguous symbol, such as " $\text{sm}$ " or " $\text{Nc}$ ," occurs more than once in a given context, it must not be assumed, unless required by the conditions of significance, that it is to receive the same typical determination in each case. Thus e.g. we shall write " $\alpha\,\text{ sm }\, \beta . \supset .\beta\, \text{ sm }\, \alpha$ ," although, if $\alpha$ and $\beta$ are of different types, the two symbols " $\text{ sm }$ " must receive different typical determinations.

Formulae which are typically ambiguous, or only partially definite as to type, must not be admitted unless every significant interpretation is true. Thus for example we may admit $\unicode{x201c}\vdash . \alpha \in \text{Nc}ʻ\alpha\unicode{x201d}$ because here " $\text{Nc}$ " must mean " $\text{Nc}(\alpha_{\alpha})$ ," so that the only ambiguity remaining is as to the type of $\alpha$ , and the formula holds whatever type $\alpha$ may belong to, provided " $\text{Nc}ʻ\alpha$ " is significant, i.e. provided $\alpha$ is a class. But we must not, from " $\alpha \in\text{Nc}ʻ\alpha$ ," allow ourselves to infer $\unicode{x201c}\exists !\text{Nc}ʻ\alpha.\unicode{x201d}$ For here the conditions of significance no longer demand that " $\text{Nc}$ " should mean " $\text{Nc}(\alpha_{\alpha})$ ": it might just as well mean " $\text{Nc}(\beta_{\alpha })$ ." And as we saw, if $\beta$ is a lower type than $\alpha$ , and $\alpha$ is sufficiently large of its type, we may have $\text{Nc}(\beta_{\alpha})ʻ\alpha = \Lambda,$ so that " $\exists !\text{Nc}ʻ\alpha$ " is not admissible without qualification. Nevertheless, as we shall see in *100, there are a certain number of propositions to be made about a wholly ambiguous $\text{Nc}$ or $\text{NC}$ .

FOOTNOTES:

[2] Breslau, 1884. Cf. especially pp. 79, 80.

[3] Jena, Vol. I. 1893, Vol. II. 1903. Cf. Vol. I. §§ 40-42, pp. 57, 58. The grounds in favour of this definition will be found at length in Principles of Mathematics, Part II.

[4] The definitions of the arithmetical operations, and of finite and infinite, are really just as purely logical as what precedes them; but if we are to draw a line between logic and arithmetic somewhere, the arithmetical operations seem the natural point at which to place the beginning of arithmetic.

In this number we shall be concerned only with such immediate consequences of the definition of cardinal numbers as do not require typical definiteness, beyond what the inherent conditions of significance may bestow. We introduce here the fundamental definitions:

The definition " $\text{Nc}$ " is required chiefly for the sake of the descriptive function $\text{Nc}ʻ\alpha$ . We have

*100·1. $\vdash .\text{Nc}ʻ\alpha = \hat{\beta}(\beta\,\text{ sm }\,\alpha) = \hat{\beta}(\alpha\,\text{ sm }\,\beta)$

This may be stated in various equivalent forms, which are given at the beginning of this number (*100·1—·16). After a few propositions on $\text{Nc}$ as a relation, we proceed to the elementary properties of $\text{Nc}ʻ\alpha$ . We have

*100·31. $\vdash :\alpha \in \text{Nc}ʻ\beta . \equiv . \beta \in \text{Nc}ʻ\alpha . \equiv . \alpha \text{ sm } \beta$

*100·321. $\vdash : \alpha\,\text{ sm }\,\beta . \supset . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta$

*100·33. $\vdash : \exists !\text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta . \supset . \alpha\,\text{ sm }\,\beta$

*100·4. $\vdash : \mu \in \text{NC} . \equiv . (\exists \alpha ) . \mu = \text{Nc}ʻ\alpha$

*100·42. $\vdash : \mu ,\nu \in \text{NC} . \exists !\mu \cap \nu . \supset . \mu =\nu$

*100·45. $\vdash : \mu \in \text{NC} . \alpha \in \mu . \supset . \text{Nc}ʻ\alpha = \mu$

*100·51. $\vdash : \mu \in \text{NC} . \alpha \in \mu . \supset . \text{ sm }ʻʻ\mu = \text{Nc}ʻ\alpha$

Observe that when we have such a hypothesis as " $\mu \in \text{NC}$ ," the $\mu$ , though it may be of any type, must be of some type; hence the $\mu$ cannot have the typical ambiguity which belongs to $\text{Nc}ʻ\alpha$ . If we put $\mu = \text{Nc}ʻ\alpha$ , this will hold only in the type of $\mu$ ; but " $\text{ sm }ʻʻ\mu$ " is a typically ambiguous symbol, which[Pg 14] will represent in any type the "same" number as $\mu$ . Thus " $\text{ sm }ʻʻ\mu = \text{Nc}ʻ\alpha$ " is an equation which is applicable to all possible typical determinations of " $\text{ sm }$ " and " $\text{Nc}$ ."

*100·52. $\vdash :\mu \in \text{NC}.\exists !\mu .\supset .\text{ sm }ʻʻ\mu \in \text{NC}$

The hypothesis $\exists !\mu$ is unnecessary, but we cannot prove this till later (*102).

We end the number with some propositions (*100·6—·64) stating that various classes (such as $\iota ʻʻ\alpha$ ), which have already been proved to be similar to $\alpha$ , have $\text{Nc}ʻ\alpha$ members.

*100·1. $\vdash .\text{Nc}ʻ\alpha =\hat{\beta}(\beta\, \text{ sm }\,\alpha)=\hat{\beta}(\alpha\, \text{ sm }\,\beta) \quad[*32·13.*73·31.(*100·01)]$

*100·11. $\vdash .\text{Nc}ʻ\alpha =\hat{\beta}\{(\exists R).R\in 1\rightarrow 1.\text{D}ʻR=\alpha .\text{ᗡ}ʻR=\beta\} \quad[*100·1.*73·1]$

*100·12. $\vdash . \text{Nc}ʻ\alpha =\hat{\beta}\{(\exists R).R\in 1\rightarrow 1.\alpha \subset \text{D}ʻR.\beta =\breve{R}ʻʻ\alpha\} \quad[*100·1.*73·11]$

*100·13. $\vdash .\text{Nc}ʻ\alpha =\text{ᗡ}ʻʻ(1\rightarrow 1\cap \overleftarrow{\text{D}}ʻ\alpha )=\text{D}ʻʻ(1\rightarrow 1\cap \overleftarrow{\text{ᗡ}}ʻ\alpha)$

Dem. $\begin{array}{l} \vdash .*100·11.*33·6. \supset \vdash .\text{Nc}ʻ\alpha &=\hat{\beta} \{(\exists R).R\in 1\rightarrow 1.R\in \overleftarrow{\text{D}}ʻ\alpha .\text{ᗡ}ʻR=\beta\}\\ [*22·33.*37·6] &=\text{ᗡ}ʻʻ(1\rightarrow 1\cap \overleftarrow{\text{D}}ʻ\alpha) &\qquad \text{(1)}\\ \vdash .*100·1.*73·1.*33·61. \supset \vdash .\text{Nc}ʻ\alpha &=\hat{\beta} \{(\exists R).R\in 1\rightarrow 1.R\in \overleftarrow{\text{ᗡ}}ʻ\alpha .\text{D}ʻR=\beta\}\\ [*22·33.*37·6] &=\text{D}ʻʻ(1\rightarrow 1\cap \overleftarrow{\text{ᗡ}}ʻ\alpha) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*100·14. $\vdash .\text{Nc}ʻ\alpha =\hat{\beta} \{(\exists R).\alpha \subset \text{ᗡ}ʻR.R\upharpoonright \alpha \in 1\rightarrow 1.\beta = Rʻʻ\alpha\} \quad [*73·15.*100·1]$

*100·15. $\vdash .\text{Nc}ʻ\alpha =\hat{\beta} \{(\exists R):\text{E}!!Rʻʻ\alpha : x,y\in \alpha .Rʻx=Rʻy.\supset _{x,y}.x=y:\beta =Rʻʻ\alpha\}$

Dem. $\begin{array}{l} \vdash .*74·1·11.\supset \\ \vdash \colon\ldotp \text{E}!!Rʻʻ\alpha :x,y\in \alpha .&Rʻx=Rʻy.\supset _{x,y}.x=y:\beta =Rʻʻ\alpha :\equiv :\\ &R\upharpoonright \alpha \in 1\rightarrow \text{Cls}.\alpha \subset \text{ᗡ}ʻR.R\upharpoonright \alpha \in 1\rightarrow 1.\beta = Rʻʻ\alpha \qquad \text{(1)}\\ \vdash .(1).*4·71.*100·14.\supset \vdash .\text{Prop} \end{array}$

*100·16. $\vdash .\text{Nc}ʻ\alpha =\hat{\beta} \{(\exists R)\colon\ldotp x,y\in \alpha .\supset _{x,y}:Rʻx=Rʻy.\equiv .x=y\colon\ldotp \beta =Rʻʻ\alpha\}$

Dem. $\begin{array}{l} \vdash .*71·59.\supset \\ \vdash \colon\colon x,y\in \alpha .\supset_{x,y}:Rʻx=Rʻy.\equiv .x=y\colon\ldotp \equiv .R\upharpoonright \alpha \in 1\rightarrow 1.\alpha \subset \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash .(1).*100·14.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} &\vdash .*37·76.(*100·01).\supset \vdash .\text{ᗡ}ʻ\text{Nc}\subset \text{Cls} &\qquad \text{(1)}\\ &\vdash .*33·431.*100·2. \supset \vdash .\text{Cls}\subset \text{ᗡ}ʻ\text{Nc} &\qquad \text{(2)}\\ &\vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*100·22. $\vdash .\text{Nc}\in 1\rightarrow \text{Cls} \quad[*72·12.(*100·01)]$

Note that it is fallacious to infer $\exists !\text{Nc}ʻ\alpha$ , for reasons explained in the introduction to the present section.

*100·31. $\vdash :\alpha \in \text{Nc}ʻ\beta .\equiv .\beta \in \text{Nc}ʻ\alpha .\equiv .\alpha\,\text{ sm }\,\beta \quad[*32·18.*73·31.(*100·01)]$

*100·32. $\vdash :\alpha \in \text{Nc}ʻ\beta .\beta \in \text{Nc}ʻ\gamma .\supset .\alpha \in \text{Nc}ʻ\gamma \quad[*100·31.*73·32]$

*100·321. $\vdash :\alpha\,\text{ sm }\,\beta .\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*73·37.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\gamma\,\text{ sm }\,\alpha .\equiv _{\gamma }.\gamma \text{ sm }\beta :\\ [*100·1] &\supset :\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Note that $\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\supset .\alpha\,\text{ sm }\,\beta$ is not always true. We might be tempted to prove it as follows: $\begin{array}{l} \vdash .*100·1.\supset \vdash \colon\ldotp \text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\equiv :\gamma \,\text{ sm }\,\alpha .&\equiv _{\gamma }.\gamma \,\text{ sm }\,\beta :\\ [*10·1] &\supset :\alpha \,\text{ sm }\,\alpha .\equiv .\alpha \,\text{ sm }\,\beta :\\ [*73·3] &\supset :\alpha \,\text{ sm }\,\beta \end{array}$

But the use of *10·1 here is only legitimate when the " $\text{sm}$ " concerned is a homogeneous relation. If $\text{Nc}ʻ\alpha$ , $\text{Nc}ʻ\beta$ are descending cardinals, we may have $\text{Nc}ʻ\alpha =\Lambda = \text{Nc}ʻ\beta$ without having $\alpha\text{ sm }\beta$ .

*100·33. $\vdash :\exists !\text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta .\supset .\alpha \,\text{ sm }\,\beta$

Dem. $\begin{array}{l} \vdash .*100·1.\supset \vdash :\text{Hp}.&\supset .(\exists \gamma ).\gamma\,\text{ sm }\, \alpha .\gamma \,\text{ sm }\, \beta.\\ [*73·31] &\supset .(\exists \gamma ).\alpha\, \text{ sm }\, \gamma .\gamma \text{ sm } \beta.\\ [*73·32] &\supset .\alpha\,\text{ sm }\, \beta :\supset \vdash .\text{Prop} \end{array}$

Note that we do not always have $\alpha \,\text{ sm }\, \beta .\supset .\exists !\text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta.$

For if the $\text{Nc}$ concerned is a descending $\text{Nc}$ , and $\alpha$ and $\beta$ are sufficiently great, $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ may both be $\Lambda$ . For example, we have $\text{Cl}ʻ(\alpha \cup - \alpha)\,\text{ sm }\, \text{Cl}ʻ(\alpha \cup - \alpha).$

But $\text{Nc}(\alpha)ʻ\text{Cl}ʻ(\alpha \cup - \alpha) = \Lambda$ , so that ${\sim}\exists !\text{Nc}(\alpha )ʻ\text{Cl}ʻ(\alpha \cup - \alpha ) \cap \text{Nc}(\alpha )ʻ\text{Cl}ʻ(\alpha \cup - \alpha).$

Thus " $\alpha\, \text{ sm }\,\beta . \supset . \exists ! \text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta$ " is not always true when it is significant.

*100·34. $\vdash : \exists ! \text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta . \supset . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta \quad[*100·33·321]$

*100·35. $\begin{aligned}\vdash \colon\ldotp \exists ! \text{Nc}ʻ\alpha . \lor . &\exists ! \text{Nc}ʻ\beta : \supset:\\ &\text{Nc}ʻ\alpha = \text{Nc}ʻ\beta . \equiv . \alpha \in \text{Nc}ʻ\beta . \equiv . \beta \in \text{Nc}ʻ\alpha . \equiv . \alpha \,\text{ sm }\, \beta \end{aligned}$

Dem. $\begin{array}{l} \vdash .*22·5. \supset \vdash \colon\ldotp \text{Hp} . \supset : \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta . &\supset . \exists ! \text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta.\\ [*100·33] &\supset . \alpha \, \text{ sm }\, \beta &\qquad \text{(1)}\\ \vdash .(1).*100·321. &\supset \vdash \colon\ldotp \text{Hp} . \supset : \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta . \equiv . \alpha \,\text{ sm }\, \beta &\qquad\text{(2)}\\ \vdash .(2).*100·31. &\supset \vdash . \text{Prop} \end{array}$

Thus the only case in which the implications in *100·321 ·33 ·34 cannot be turned into equivalences is the case in which $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are both $\Lambda$ .

*100·36. $\vdash \colon\ldotp \beta \in \text{Nc}ʻ\alpha . \supset : \exists ! \alpha . \equiv . \exists !\beta \quad[*100·31.*73·36]$

*100·4. $\vdash : \mu \in \text{NC} . \equiv . (\exists \alpha) . \mu = \text{Nc}ʻ\alpha \quad[*37·78·79.(*100·02·01)]$

*100·42. $\vdash : \mu,\nu \in \text{NC} . \exists !\mu \cap \nu . \supset . \mu = \nu$

Dem. $\begin{array}{l} \vdash . *100·4 . \supset \vdash : \text{Hp} . &\supset . (\exists \alpha ,\beta ) . \mu = \text{Nc}ʻ\alpha . \nu = \text{Nc}ʻ\beta . \exists ! \text{Nc}ʻ\alpha \cap \text{Nc}ʻ\beta .\\ [*100·34] &\supset . (\exists \alpha ,\beta) . \mu = \text{Nc}ʻ\alpha . \nu = \text{Nc}ʻ\beta . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta.\\ [*14·15] &\supset . \mu = \nu : \supset \vdash . \text{Prop} \end{array}$

*100·43. $\vdash . \text{NC} \in \text{Cls}^{2} \text{excl} \quad[*100·42.*84·11]$

*100·44. $\vdash \colon\ldotp \mu \in \text{NC}. \exists ! \text{Nc}ʻ\alpha . \supset : \alpha \in \mu . \equiv . \text{Nc}ʻ\alpha = \mu$

Dem. $\begin{array}{l} \vdash . *100·3. &\supset \vdash : \text{Nc}ʻ\alpha = \mu . \supset . \alpha \in \mu &\qquad\text{(1)}\\ \vdash . *10·24. \supset \vdash : &\mu \in \text{NC} . \exists ! \text{Nc}ʻ\alpha . \alpha \in \mu . \supset.\\ &\mu \in \text{NC} . \exists !\mu . \exists ! \text{Nc}ʻ\alpha . \alpha \in \mu.\\ [*100·4] &\supset . (\exists \beta ) . \mu = \text{Nc}ʻ\beta . \exists ! \text{Nc}ʻ\beta. \exists ! \text{Nc}ʻ\alpha . \alpha \in \text{Nc}ʻ\beta.\\ [*100·35] &\supset . (\exists \beta). \mu = \text{Nc}ʻ\beta . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta.\\ [*14·15] &\supset . \text{Nc}ʻ\alpha = \mu &\qquad \text{(2)}\\ \vdash . (1).(2). &\supset \vdash . \text{Prop} \end{array}$

*100·45. $\vdash : \mu \in \text{NC} . \alpha \in \mu . \supset . \text{Nc}ʻ\alpha = \mu \quad[*100·4·31·321]$

*100·5. $\vdash : \mu \in \text{NC} . \alpha ,\beta \in \mu . \supset . \alpha \,\text{ sm }\, \beta$

Dem. $\begin{array}{l} \vdash . *100·4. \supset \vdash : \text{Hp} . &\supset . (\exists \gamma ) . \mu = \text{Nc}ʻ\gamma . \alpha ,\beta \in \text{Nc}ʻ\gamma.\\ [*100·31] &\supset .(\exists \gamma). \alpha\,\text{sm}\,\gamma . \beta\,\text{ sm }\,\gamma.\\ [*73·31·32] &\supset . \alpha\,\text{ sm }\,\beta : \supset \vdash . \text{Prop} \end{array}$

*100·51. $\vdash : \mu \in \text{NC} . \alpha \in \mu . \supset . \text{ sm }ʻʻ\mu = \text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash. *100·5 . \text{Fact}. \supset \vdash \colon\ldotp \text{Hp} . \supset : \beta \in \mu . \gamma \,\text{ sm }\, \beta . &\supset . \alpha \text{ sm } \beta . \gamma \text{ sm } \beta.\\ [*73·31·32] &\supset . \alpha \,\text{ sm }\, \gamma.\\ [*100·31] &\supset . \gamma \in \text{Nc}ʻ\alpha &\qquad\text{(1)}\\ \vdash .(1).*10·11·21·23.*37·1. \supset \vdash : \text{Hp} . &\supset . \text{ sm }ʻʻ\mu \subset \text{Nc}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*100·31. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \gamma \in \text{Nc}ʻ\alpha . \supset . \gamma \,\text{ sm }\, \alpha . \alpha \in \mu.\\ [*37·1] &\supset . \gamma \in \text{ sm }ʻʻ\mu &\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash . \text{Prop} \end{array}$

*100·511. $\vdash : \exists ! \text{Nc}ʻ\beta . \supset . \text{ sm }ʻʻ\text{Nc}ʻ\beta = \text{Nc}ʻ\beta$

Here the last " $\text{Nc}ʻ\beta$ " may be of a different type from the others: the proposition holds however its type is determined.

Dem. $\begin{array}{l} \vdash .*100·51·41. \supset \vdash : \alpha \in \text{Nc}ʻ\beta . \supset . \text{ sm }ʻʻ\text{Nc}ʻ\beta &= \text{Nc}ʻ\alpha \\ [*100·31·321] &= \text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*10·11·23. \supset \vdash . \text{Prop} \end{array}$

*100·52. $\vdash : \mu \in \text{NC} . \exists ! \mu . \supset . \text{ sm }ʻʻ\mu \in \text{NC} \quad[*100·51·4]$

This proposition still holds when $\mu = \Lambda$ , but the proof is more difficult, since it depends upon the proof that every null-class of classes is an $\text{NC}$ , which in turn depends upon the proof that $\text{Cl}ʻ\alpha$ is not similar to $\alpha$ or to any class contained in $\alpha$ .

*100·521. $\vdash : \mu \in \text{NC} . \exists ! \text{ sm }ʻʻ\mu . \supset . \text{ sm }ʻʻ\text{ sm }ʻʻ\mu = \mu$

Dem. $\begin{array}{l} \vdash .*37·29.\text{Transp}. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \exists !\mu:\\ [*100·52] &\supset : \text{ sm }ʻʻ\mu \in \text{NC}:\\ [*100·51.\text{Hp}] &\supset : \gamma \in \text{ sm }ʻʻ\mu . \supset . \text{ sm }ʻʻ\text{ sm }ʻʻ\mu = \text{Nc}ʻ\gamma &\qquad \text{(1)}\\ \vdash .*37·1.\text{Fact}. \supset \vdash : \text{Hp} . \gamma \in \text{ sm }ʻʻ\mu . &\supset . (\exists \alpha) . \alpha \in \mu . \mu \in \text{NC} . \gamma \text{ sm } \alpha.\\ [*100·45·321] &\supset . (\exists \alpha) . \text{Nc}ʻ\alpha = \mu . \text{Nc}ʻ\gamma = \text{Nc}ʻ\alpha.\\ [*13·17] &\supset . \text{Nc}ʻ\gamma = \mu &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\ldotp \text{Hp} . \gamma \in \text{ sm }ʻʻ\mu . \supset . \text{ sm }ʻʻ\text{ sm }ʻʻ\mu = \mu &\qquad \text{(3)}\\ \vdash .(3).*10·11·23·35 . \supset \vdash . \text{Prop} \end{array}$

*100·53. $\vdash \colon\ldotp \exists !\mu . \exists !\nu . \supset : \mu \in \text{NC} . \nu = \text{ sm }ʻʻ\mu . \equiv . \nu \in \text{NC} . \mu = \text{ sm }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*100·52. &\supset \vdash \colon\ldotp \text{Hp} . \supset : \mu \in \text{NC} . \nu = \text{ sm }ʻʻ\mu . \supset . \nu \in \text{NC} &\qquad \text{(1)}\\ \vdash .*100·521. &\supset \vdash \colon\ldotp \text{Hp} . \supset : \mu \in \text{NC} . \nu = \text{ sm }ʻʻ\mu . \supset . \mu = \text{ sm }ʻʻ\nu &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\ldotp \text{Hp} . \supset : \mu \in \text{NC} . \nu = \text{ sm }ʻʻ\mu . \supset . \nu \in \text{NC} . \mu = \text{ sm }ʻʻ\nu &\qquad \text{(3)}\\ \vdash .(3).(3)\dfrac{\nu,\,\mu}{\mu,\,\nu}. \supset \vdash . \text{Prop} \end{array}$

*100·6. $\vdash .\iotaʻʻ\alpha \in \text{Nc}ʻ\alpha \quad[*73·41.*100·31]$

*100·61. $\vdash .\hat{\beta}\{(\exists y).y \in \alpha .\beta = \iota ʻx \cup \iota ʻy\} \in \text{Nc}ʻ\alpha \quad [*73·27.*54·21.*100·31]$

*100·62. $\vdash .x\downarrow ʻʻ\alpha \in \text{Nc}ʻ\alpha \quad[*73·61.*100·31]$

*100·621. $\vdash .\downarrow xʻʻ\alpha \in \text{Nc}ʻ\alpha \quad[*73·611.*100·31]$

*100·63. $\vdash .\in_{\Delta }ʻ\iota ʻ\alpha \in \text{Nc}ʻ\alpha \quad[*83·41.*100·31]$

*100·631. $\vdash .\text{D}ʻʻ{\in}_{\Delta}ʻ\iota ʻ\alpha \in \text{Nc}ʻ\alpha \quad[*83·7.*100·6]$

*100·64. $\vdash :\kappa \in \text{Cls}^{2} \text{excl} .\supset . \text{D}ʻʻ\in_{\Delta }ʻ\kappa \subset \text{Nc}ʻ\kappa$

Dem. $\begin{array}{l} \vdash .*84·3.*80·14.\supset \vdash :\text{Hp}.R\in {\in}_{\Delta}ʻ\kappa .&\supset .R \in 1\rightarrow 1.\kappa = \text{ᗡ}ʻR.\\ [*73·2.*100·31] &\supset .\text{D}ʻR \in \text{Nc}ʻ\kappa :\supset \vdash . \text{Prop} \end{array}$

In the present number, we have to show that 0 and 1 and 2 as previously defined are cardinal numbers in the sense defined in *100, and to add a few elementary propositions to those already given concerning them. We prove (*101·12 ·241) that 0 and 1 are not null, which cannot be proved, with our axioms, for any other cardinal, except (in the case of finite cardinals) when the type is specified as a sufficiently high one. Thus we prove (*101·42 ·43) that $2_{\text{Cls}}$ and $2_{\text{Rel}}$ exist; this follows from $\Lambda \neq \text{V}$ and $\dot{\Lambda}\neq \dot{\text{V}}$ . We prove (*101·22 ·34) that 0 and 1 and 2 are all different from each other. We prove (*101·15 ·28) that $\text{ sm }ʻʻ0 = 0$ and $\text{ sm }ʻʻ1 = 1$ , but we cannot prove $\text{ sm }ʻʻ2 = 2$ unless we assume the existence of at least two individuals, or define the first 2 in " $\text{ sm }ʻʻ2 = 2$ " as a 2 of some type other than $2_{\text{Indiv}}$ , where " $\text{Indiv}$ " stands for the type of individuals.

It should be observed that, since 0 and 1 and 2 are typically ambiguous, their properties are analogous to those of " $\text{Nc}ʻ\alpha$ " rather than to those of $\mu$ , where $\mu \in\text{NC}$ . For example, we have

*100·511. $\vdash : \exists ! \text{Nc}ʻ\beta . \supset . \text{ sm }ʻʻ\text{Nc}ʻ\beta = \text{Nc}ʻ\beta$

but we shall not have $\mu \in \text{NC} . \exists ! \mu . \supset. \text{ sm }ʻʻ\mu =\mu$ unless the " $\text{ sm }$ " concerned is homogeneous, since in other cases the symbols do not express a significant proposition. But in *100·511 we may substitute 0 or 1 or 2, and the proposition remains significant and true. In fact we have (*101·1 ·2 ·31) $\vdash . 0 = \text{Nc}ʻ\Lambda . 1 = \text{Nc}ʻ\iota ʻx . 2 = \text{Nc}ʻ(\iota ʻ\iota ʻx \cup \iota ʻ\Lambda ),$ where 0 and 1 and 2 have an ambiguity corresponding to that of " $\text{Nc}$ ."

*101·13. $\vdash . \exists ! 0 \cap \text{Cl}ʻ\alpha . \Lambda \in 0 \cap \text{Cl}ʻ\alpha \quad[*51·16 . *60·3]$

Dem. $\begin{array}{l} \vdash .*101·1·12 . \supset \vdash : \text{Nc}ʻ\gamma = 0 . &\equiv . \text{Nc}ʻ\gamma = \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\Lambda.\\ [*13·194] &\equiv . \text{Nc}ʻ\gamma = \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\gamma.\\ [*100·35] &\equiv . \gamma \in \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\gamma.\\ [*101·1.*54·102] &\equiv . \gamma = \Lambda . \exists ! \text{Nc}ʻ\Lambda . \exists ! \text{Nc}ʻ\gamma .\\ [*101·1·12.*13·194] &\equiv . \gamma = \Lambda : \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*37·1 . \supset \vdash : \gamma \in \text{ sm }ʻʻ0 . &\equiv . (\exists \alpha ) . \alpha \in 0 . \gamma \text{ sm } \alpha.\\ [*54·102] &\equiv . \gamma \text{ sm } \Lambda .\\ [*73·48] &\equiv . \gamma \in 0 : \supset \vdash . \text{Prop} \end{array}$

*101·16. $\vdash \colon\ldotp \mu \in \text{NC}-\iota ʻ0 . \supset : \alpha \in \mu . \supset_{\alpha} . \exists !\alpha$

Dem. $\begin{array}{l} \vdash .*100·45 . \supset \vdash : \mu \in \text{NC} . \Lambda \in \mu . &\supset . \mu = \text{Nc}ʻ\Lambda\\ [*101·1] & =0 &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}. &\supset \vdash \colon\ldotp \mu \in \text{NC}-\iota ʻ0 . \supset : \Lambda {\sim}\in \mu :\\ [*24·63] &\supset : \alpha \in \mu . \supset_{\alpha} . \exists !\alpha \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*101·17. $\vdash : \Lambda \in \text{Nc}ʻ\alpha . \equiv . \text{Nc}ʻ\alpha = 0 . \equiv . \text{Nc}ʻ\alpha = \text{Nc}ʻ\Lambda . \equiv . \alpha = \Lambda$

Dem. $\begin{array}{l} \vdash .*100·31·321. \supset \vdash : \Lambda \in \text{Nc}ʻ\alpha . &\supset . \text{Nc}ʻ\alpha = \text{Nc}ʻ\Lambda.\\ [*101·1] &\supset . \text{Nc}ʻ\alpha = 0 &\qquad \text{(1)}\\ \vdash .*101·13. &\supset \vdash : \text{Nc}ʻ\alpha = 0 . \supset . \Lambda \in \text{Nc}ʻ\alpha &\qquad\text{(2)}\\ \vdash .(1).(2). \supset \vdash : \Lambda \in \text{Nc}ʻ\alpha . &\equiv . \text{Nc}ʻ\alpha = 0. &\qquad\text{(3)}\\ [*101·1] &\equiv . \text{Nc}ʻ\alpha = \text{Nc}ʻ\Lambda . &\qquad\text{(4)}\\ [*101·14] &\equiv . \alpha = \Lambda &\qquad \text{(5)}\\ \vdash .(3).(4).(5). \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*52·21.*101·13. &\supset \vdash . \Lambda {\sim}\in 1 . \Lambda \in 0.\\ [*13·14] &\supset \vdash . 1\neq 0 \end{array}$

Dem. $\begin{array}{l} \vdash .*52·21. \supset \vdash : \alpha \in 1 . &\supset . \alpha \neq \Lambda.\\ [*54·102] &\supset . \alpha {\sim}\in 0 &\qquad\text{(1)}\\ \vdash .(1).*24·39. &\supset \vdash . \text{Prop} \end{array}$

*101·24. $\vdash : \exists !\alpha . \supset . \exists ! 1 \cap \text{Cl}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *52·22.*60·6 . \supset \vdash : x \in \alpha . \supset . \iota ʻx \in 1 \cap \text{Cl}ʻ\alpha \qquad \text{(1)}\\ \vdash .(1).*10·11·28. \supset \vdash . \text{Prop} \end{array}$

*101·25. $\vdash : \alpha \in 1 . \beta \subset \alpha . \beta \neq \alpha . \supset . \beta \in 0$

Dem. $\begin{array}{l} \vdash .*52·64.*22·621. &\supset \vdash : \alpha \in 1 . \beta \subset \alpha . \supset . \beta \in 1 \cup 0 &\qquad\text{(1)}\\ \vdash .*52·46. &\supset \vdash : \alpha,\beta \in 1 . \beta \subset \alpha . \supset . \beta =\alpha:\\ [\text{Transp}] &\supset \vdash : \alpha \in 1 . \beta \subset \alpha . \beta \neq \alpha . \supset . \beta {\sim}\in 1 &\qquad\text{(2)}\\ \vdash .(1).(2). \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*60·371.*40·43. &\supset \vdash . sʻ\text{Cl}ʻʻ1 \subset 0 \cup 1 &\qquad\text{(1)}\\ \vdash .*60·3·34. &\supset \vdash . \Lambda \in \text{Cl}ʻ\iota ʻx . \iota ʻx \in \text{Cl}ʻ\iota ʻx.\\ [*52·22.*40·4] &\supset \vdash . \Lambda \in sʻ\text{Cl}ʻʻ1 . \iota ʻx \in sʻ\text{Cl}ʻʻ1.\\ [*51·2.*52·1] &\supset \vdash . 0 \subset sʻ\text{Cl}ʻʻ1 . 1 \subset sʻ\text{Cl}ʻʻ1 &\qquad\text{(2)}\\ \vdash .(1).(2). \supset \vdash .\text{Prop} \end{array}$

*101·27. $\vdash . 1 = \hat{\alpha}\{(\exists x) . x \in \alpha . \alpha - \iota ʻx \in 0\}$

Dem. $\begin{array}{l} \vdash .*54·102. \supset \vdash : (\exists x) . x \in \alpha . \alpha - \iota ʻx \in 0 . &\equiv . (\exists x) . x \in \alpha . \alpha - \iota ʻx = \Lambda .\\ [*24·3] &\equiv . (\exists x). x \in \alpha . \alpha \subset \iota ʻx.\\ [*51·2] &\equiv . (\exists x) . \alpha = \iota ʻx.\\ [*52·1] &\equiv . \alpha \in 1 : \supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*37·1. \supset \vdash : \gamma \in \text{ sm }ʻʻ1 . &\equiv . (\exists \alpha ) . \alpha \in 1 . \gamma\,\text{ sm }\,\alpha.\\ [*52·1] &\equiv . (\exists x) . \gamma\,\text{ sm }\,\iota ʻx.\\ [*73·45] &\equiv . \gamma \in 1 : \supset \vdash . \text{Prop} \end{array}$

*101·29. $\vdash : \iota ʻx\in \text{Nc}ʻ\alpha . \equiv . \text{Nc}ʻ\alpha = 1. \equiv . \text{Nc}ʻ\alpha = \text{Nc}ʻ\iota ʻx. = . \alpha \in 1$

Dem. $\begin{array}{l} \vdash .*100·31·321. \supset \vdash : \iota ʻx \in \text{Nc}ʻ\alpha . &\supset . \text{Nc}ʻ\alpha = \text{Nc}ʻ\iota ʻx.\\ [*101·2] &\supset . \text{Nc}ʻ\alpha = 1 &\qquad\text{(1)}\\ \vdash .*52·22. &\supset \vdash : \text{Nc}ʻ\alpha = 1 . \supset . \iota ʻx \in \text{Nc}ʻ\alpha &\qquad\text{(2)}\\ \vdash .(1).(2). \supset \vdash : \iota ʻx \in \text{Nc}ʻ\alpha . &\equiv . \text{Nc}ʻ\alpha = 1. &\qquad\text{(3)}\\ [*101·2] &\equiv . \text{Nc}ʻ\alpha = \text{Nc}ʻ\iota ʻx &\qquad\text{(4)}\\ \vdash .*101·2.*52·1. &\supset \vdash : \alpha \in 1 . \supset . \text{Nc}ʻ\alpha = 1 &\qquad\text{(5)}\\ \vdash .*100·3 . &\supset \vdash : \text{Nc}ʻ\alpha = 1 . \supset . \alpha \in 1 &\qquad\text{(6)}\\ \vdash .(3).(4).(5).(6). \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*73·71·43.*51·231.\supset \vdash \colon\ldotp \text{Hp}.&\supset :z\neq w.\supset .(\iota ʻz\cup \iota ʻw)\text{ sm }(\iota ʻx\cup \iota ʻy):\\ [*54·101]&\supset :\beta \in 2.\supset .\beta \text{ sm }(\iota ʻx\cup \iota ʻy):\\ [*100·1] &\supset :2\subset \text{Nc}ʻ(\iota ʻx\cup \iota ʻy) &\qquad \text{(1)}\\ \vdash .*53·32.*71·163.\supset \vdash :R\in 1\rightarrow 1.x,y&\in \text{ᗡ}ʻR.\supset .\\ &Rʻʻ(\iota ʻx\cup \iota ʻy)=\iota ʻRʻx\cup \iota ʻRʻy &\qquad \text{(2)}\\ \vdash .*71·56.\text{Transp}. &\supset \vdash :\text{Hp}.R\in 1\rightarrow 1.x,y\in \text{ᗡ}ʻR.\supset .Rʻx\neq Rʻy &\qquad \text{(3)}\\ \vdash .(2).(3).*54·26.&\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :R\in 1\rightarrow 1.x,y\in \text{ᗡ}ʻR.\beta =Rʻʻ(\iota ʻx\cup \iota ʻy).\supset .\beta \in 2:\\ [*10·11·21·23.*51·234]&\supset :(\exists R).R\in 1\rightarrow 1.\iota ʻx\cup \iota ʻy\subset \text{ᗡ}ʻR.\beta =Rʻʻ(\iota ʻx\cup \iota ʻy).\\ &\supset .\beta \in 2:\\ [*73·12.*100·1] &\supset :\text{Nc}ʻ(\iota ʻx\cup \iota ʻy)\subset 2 &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*101·301. $\vdash.2=\hat{\alpha}\{(\exists x).x\in \alpha .\alpha -\iota ʻx\in 1\} \quad[*54·3]$

In comparing *101·31 with *101·1 ·2 ·3, it should be observed that $\iota ʻx$ and $\Lambda$ are both classes, whereas in *101·1·2·3 there was no typical limitation beyond what was imposed by the conditions of significance.

Dem. $\begin{array}{l} \vdash .*51·161. &\supset \vdash .\iota ʻx\neq \Lambda &\qquad \text{(1)}\\ \vdash .(1).*101·3.&\supset \vdash .\text{Prop} \end{array}$

*101·33. $\vdash :\alpha,\beta \in 1.\alpha \cap \beta =\Lambda .\supset .\alpha \cup \beta \in 2 \quad[*54·43]$

Dem. $\begin{array}{l} \vdash .*101·13.&\supset \vdash .\Lambda \in 0 &\qquad \text{(1)}\\ \vdash .*101·301. &\supset \vdash :\alpha \in 2.\supset .\exists !\alpha :\\ [*24·63] &\supset \vdash .\Lambda {\sim}\in 2 &\qquad \text{(2)}\\ \vdash .(1).(2).*13·14. &\supset \vdash .2\neq 0 &\qquad \text{(3)}\\ \vdash .*52·22.*54·26.*22·56. &\supset \vdash .\iota ʻy\in 1.\iota ʻy{\sim}\in 2.\\ [*13·14]&\supset \vdash .1\neq 2 &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*101·35. $\vdash .2\cap 0=\Lambda .2\cap 1=\Lambda \quad[*100·42.\text{Transp}.*101·11·21·32·34]$

*101·36. $\vdash :\alpha \in 2.\beta \subset \alpha .\beta \neq \alpha .\supset .\beta \in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*54·42. &\supset \vdash :\alpha \in 2.\beta \subset \alpha .\exists !\beta .\beta \neq \alpha .\supset .\beta \in 1 &\qquad \text{(1)}\\ \vdash .*54·102. &\supset \vdash :{\sim}\exists !\beta .\supset .\beta \in 0 &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*60·3. \supset \vdash : \text{Hp} . &\supset . (\exists \alpha) . \alpha \in 2 . \Lambda \in \text{Cl}ʻ\alpha.\\ [*40·4] &\supset . \Lambda \in sʻ\text{Cl}ʻʻ2.\\ [*51·2] &\supset . 0 \subset sʻ\text{Cl}ʻʻ2 &\qquad\text{(1)}\\ \vdash .*60·34.&\supset \vdash . 2 \subset sʻ\text{Cl}ʻʻ2 &\qquad\text{(2)}\\ \vdash .*54·101. \supset \vdash \colon\colon \text{Hp} . &\supset \colon\ldotp (\exists x,y) . x \neq y \colon\ldotp \\ [*13·171.\text{Transp}] &\supset \colon\ldotp (\exists x,y) \colon\ldotp (z) : z\neq x . \lor . z\neq y\colon\ldotp\\ [*54·26] &\supset \colon\ldotp (\exists x,y) \colon\ldotp (z) : \iota ʻz \cup \iota ʻx \in 2 . \lor . \iota ʻz \cup \iota ʻy \in 2\colon\ldotp\\ [*11·26.*22·58] &\supset \colon\ldotp (z) \colon\ldotp (\exists \alpha ,\beta ) : \alpha \in 2 . \iota ʻz \in \text{Cl}ʻ\alpha . \lor . \beta \in 2 . \iota ʻz \in \text{Cl}ʻ\beta \colon\ldotp \\ [*40·4] &\supset \colon\ldotp (z) . \iota ʻz \in sʻ\text{Cl}ʻʻ2\colon\ldotp \\ [*52·1] &\supset \colon\ldotp 1 \subset sʻ\text{Cl}ʻʻ2 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*101·37 . \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *54·26 . &\supset \vdash : x\neq y . \supset . \exists !2:\\ [*11·11·35] &\supset \vdash : (\exists x,y) . x\neq y . \supset . \exists !2 &\qquad \text{(1)}\\ \vdash .*54·101. &\supset \vdash : \alpha \in 2 . \supset . (\exists x,y) . x\neq y:\\ [*10·11·23] &\supset \vdash : \exists !2 . \supset . (\exists x,y) . x\neq y &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash . \text{Prop} \end{array}$

When we are considering the lowest type occurring in a context, our premisses do not suffice to prove $(\exists x,y).x\neq y$ . For every other type, this can be proved. Thus $\Lambda \neq \text{V}$ and $\dot{\Lambda} \neq \dot{\text{V}}$ give the required result for classes and relations respectively.

Dem. $\begin{array}{l} \vdash .*24·14.\text{Transp}. \supset \\ \vdash \colon\ldotp (\exists x) . \iota ʻx\neq \text{V} . &\equiv : (\exists x) : (\exists y) . y {\sim}\in \iota ʻx :\\ [*51·15] &\equiv : (\exists x,y) . x\neq y:\\ [*101·4] &\equiv : \exists !2 \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*101·42. $\vdash . \exists ! 2_{\text{Cls}} . \iota ʻ\Lambda \cup \iota ʻ\text{V} \in 2_{\text{Cls}}$

Dem. $\begin{array}{l} \vdash .*20·41.*24·1. &\supset \vdash . \Lambda , \text{V} \in \text{Cls} . \Lambda \neq \text{V} &\qquad \text{(1)}\\ \vdash .(1).*54·26. &\supset \vdash . \iota ʻ\Lambda \cup \iota ʻ\text{V} \in 2 . \iota ʻ\Lambda \cup \iota ʻ\text{V} \subset \text{Cls}.\\ [*63·371·105] &\supset \vdash . \iota ʻ\Lambda \cup \iota ʻ\text{V} \in 2 \cap tʻ\text{Cls}.\\ [(*65·01)] &\supset \vdash . \iota ʻ\Lambda \cup \iota ʻ\text{V} \in 2_{\text{Cls}} . \supset \vdash . \text{Prop} \end{array}$

*101·43. $\vdash . \exists ! 2_{\text{Rel}} \quad[\text{Proof as in *101·42}]$

In this number, we shall consider a typically definite relation " $\text{Nc}$ ," i.e. we shall consider the relation, to a class $\delta$ which is given as of the same type as $\beta$ , of the class $\mu$ of those classes $\gamma$ which are similar to $\delta$ and of the same type as $\alpha$ . We shall then put $\begin{aligned} \mu &= \text{Nc}(\alpha _{\beta })ʻ\delta ,\\ \gamma &\in \text{Nc}(\alpha _{\beta })ʻ\delta ,\\ \gamma &\,\text{ sm }_{(\alpha ,\beta )}\delta , \end{aligned}$ and the class of all such numbers as $\mu$ for a given $\alpha$ and $\beta$ we shall call $\text{NC}^{\beta }(\alpha)$ , so that $\text{NC}^{\beta }(\alpha ) = \text{D}ʻ\text{Nc}(\alpha _{\beta }).$

The notations here introduced for giving typical definiteness to " $\text{sm}$ " and " $\text{Nc}$ " are those defined in *65 for any typically ambiguous relation.

By *63·01·02 we have, if $\alpha$ is a typically ambiguous symbol, $\begin{aligned} &\vdash .\alpha _{x} = \alpha \cap tʻx,\\ &\vdash .\alpha (x) = \alpha \cap tʻ\iota ʻx. \end{aligned}$

Thus $\vdash .\alpha (x) = \alpha _{\iota ʻx}$ . If we apply the definitions to 1, " $1_{x}$ " is meaningless unless $x$ is a class; we therefore write a Greek letter in place of $x$ , and we have $\vdash .1_{\beta } = 1\cap tʻ\beta = 1\cap (\iota ʻ\beta \cup -\iota ʻ\beta ).$

If $x\in \beta$ , we shall have $\iota ʻx = \beta .\lor.\iota ʻx\neq\beta$ . Hence $\begin{aligned} &\vdash :x\in \beta .\supset .\iota ʻx\in 1_{\beta }.\\ \text{Similarly}\qquad &\vdash :x{\sim}\in \beta .\supset .\iota ʻx\in 1_{\beta }.\\ \text{Thus}\qquad &\vdash :x\in t_{0}ʻ\beta .\supset .\iota ʻx\in 1_{\beta }. \end{aligned}$

The converse implication also holds, so that $\vdash :x\in t_{0}ʻ\beta .\equiv .\iota ʻx\in 1_{\beta }.$

Thus $1_{\beta}$ consists of all unit classes whose sole members $x$ either are or are not members of $\beta$ , i.e. for which " $x\in \beta$ " is significant.

In " $x\in t_{0}ʻ\beta .\supset .\iota ʻx\in 1_{\beta }$ ," the hypothesis renders explicit the condition of significance; thus " $\iota ʻx\in 1_{\beta }$ " is always true when significant, and always significant when $x\in t_{0}ʻ\beta$ . On the interpretation of negative statements concerning types, see the note at the end of this number.

It should be noted that all the constant relations introduced in this work are typically ambiguous. Consider e.g. $\dot{\Lambda}$ , $\text{sg}$ , $\text{D}$ , $s$ , $\dot{s}$ , $I$ , $\iota$ , $\in$ , $\text{Cl}$ , $\text{Rl}$ . These[Pg 25] all have more or less typical ambiguity, though all of them have what we will call relative typical definiteness, i.e. when the type of the relatum is given, that of the referent is given also. (In regard to $\text{D}$ , it is not true that, conversely, when the type of the referent is given, that of the relatum is also given.) But " $\text{sm}$ " and " $\text{Nc}$ " have not even relative definiteness. When the type of the relatum is given, that of the referent becomes no more definite than before; the only restrictions are that the relatum for " $\text{sm}$ " or " $\text{Nc}$ " must be a class, that the referent for " $\text{sm}$ " must be a class, and that the referent for " $\text{Nc}$ " must be a class of classes. When a relation $R$ has relative definiteness, it is enough to fix the type of the relatum; and if further $R\in 1\rightarrow \text{Cls}$ , so that $R$ leads to a descriptive function, " $Rʻy$ " has complete typical definiteness as soon as the type of $y$ is given. Now the constant relations hitherto introduced, with the exception of " $\text{sm}$ " and " $\dot{\text{V}}$ ," have all been one-many relations, and have been used almost exclusively in the form of descriptive functions. Hence no special notation has been required to give typical definiteness, since " $Rʻy$ " in these circumstances, has typical definiteness as soon as $y$ is assigned. But with the consideration of " $\text{sm}$ " and " $\text{Nc}$ ," which do not have even relative definiteness, an explicit means of giving typical definiteness becomes necessary. It should be observed, however, that " $\text{Nc}ʻ\delta$ " has typical definiteness, when $\delta$ is known, as soon as the domain of " $\text{Nc}$ " has typical definiteness, since $\delta$ must belong to the converse domain. It is for the sake of this and similar cases that we introduced the two definitions in *65, which only give typical definiteness to the domain.

In virtue of the definitions in *65, if $R$ is a typically ambiguous relation, and $x$ is a referent, $R$ becomes $R_{x}$ ; if, further, $y$ is a relatum, $R$ becomes $R_{(x,y)}$ . If $x$ is a referent for $R$ , we have $(\exists y).x\in \overrightarrow{R}ʻy$ , and $\overrightarrow{R}ʻy\in \text{D}ʻ\overrightarrow{R}$ . Thus $\text{D}ʻ\overrightarrow{R}$ has a member of the type next above that of $x$ , i.e. of the type of $\iota ʻx$ . Thus $\begin{aligned} &\vdash .\text{sg}ʻ(R_{x}) = (\overrightarrow{R})(x)\\ \text{and}\qquad &\vdash .\text{sg}ʻ{R_{(x,y)}} = (\overrightarrow{R})(x_{y}) \end{aligned}$ as was proved in *65. Hence in particular $\vdash .\text{sg}ʻ{\text{ sm }_{(\alpha ,\beta )}} = \text{Nc}(\alpha _{\beta }).$

It is chiefly for this reason that it is worth while to introduce the definition of $R(x_{y})$ .

We have, in virtue of the above, as will be proved in *102·46, $\vdash : \gamma \in tʻ\alpha .\delta \in tʻ\beta .\gamma\,\text{ sm }\,\delta . \equiv .\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta .$

With regard to " $\text{Nc}(\alpha)$ ," which is to be interpreted by *65·04, some caution is necessary. This will mean some one of those typically different relations called " $\text{Nc}$ " which have their domains composed of terms of the same type as $\alpha$ . But it will not mean the logical sum of all such relations, because these relations are of different types according as their converse[Pg 26] domains differ in type, and therefore their logical sum is meaningless. Thus for example if the type of $\beta$ is lower than or equal to that of $\alpha$ , we shall have $\vdash .\exists !\text{Nc}(\alpha )ʻ\beta ,$ whence, if " $\text{Nc}(\alpha)$ " has its converse domain composed of terms of the same type as $\beta$ , $\vdash .\Lambda {\sim}\in \text{D}ʻ\text{Nc}(\alpha ).$ But if $\beta$ is of higher type than $\alpha$ , we shall find $\vdash .\Lambda \in \text{D}ʻ\text{Nc}(\alpha).$ Thus " $\text{Nc}(\alpha)$ " is indeterminate in a way that makes a practical difference.

Exactly similar remarks apply to $\text{NC}(\alpha)$ . We have $\vdash .\text{NC}(\alpha ) = \text{D}ʻ\text{Nc}(\alpha );$ thus " $\text{NC}(\alpha)$ " shares the ambiguity of " $\text{Nc}(\alpha)$ ." The question whether $\Lambda \in\text{NC}(\alpha)$ depends upon the decision of this ambiguity. The difficulty is that " $\text{NC}(\alpha)$ " stands for the domain of any one determination of " $\text{Nc}$ " which has its domain composed of objects of the type of $\iota ʻ\alpha$ ; but it is the domain of only one such determination of " $\text{Nc}$ ," because different determinations are of different types, and therefore cannot be taken together, even when their domains are all of the same type. In consequence of this ambiguity, " $\text{NC}(\alpha)$ " is a symbol which is as a rule better avoided, and " $\text{Nc}(\alpha)$ " is not often useful except as a descriptive function, in which case the relatum supplies the requisite typical definiteness.

The peculiarity of " $\text{NC}(\alpha)$ " is that it is typically definite, and yet is capable of different meanings: it is not wholly definite, being defined as the domain of a relation whose converse domain is typically ambiguous. It results that we cannot profitably make " $\text{NC}$ " half-definite, as " $\text{NC}(\alpha)$ " does, but must make it completely definite, as we do by taking $\text{D}ʻ\text{Nc}(\alpha_{\beta})$ . For this we adopt the notation $\text{NC}^\beta (\alpha)$ . We cannot adopt the notation $\text{NC}(\alpha_{\beta})$ , because that would conflict with *65·11, nor $\text{NC}(\alpha)_{\beta}$ , because that would conflict with *65·01, nor $\text{NC}_{\beta}(\alpha)$ , for the same reason. But $\text{NC}^\beta(\alpha)$ has no previously defined meaning. We may if we like regard " $\text{NC}^\beta$ " as $\text{D}ʻ(\text{Nc}\upharpoonright tʻ\beta)$ . Then the required meaning of " $\text{NC}^\beta(\alpha)$ " would result from *65·04. But as " $\text{NC}^\beta$ " so defined is not required, it is simpler to regard " $\text{NC}^\beta(\alpha)$ " as a single symbol. We therefore put

*102·01. $\text{NC}^\beta (\alpha ) = \text{D}ʻ\text{Nc}(\alpha _{\beta }) \quad\text{Df}$

The present number begins with various propositions (*102·2—·27) on a typically definite relation of similarity, i.e. $\text{ sm }_{(\alpha,\beta)}$ . We then have a set of propositions (*102·3-·46) on " $\text{Nc}(\alpha_{\beta})ʻ\delta$ ." This is only significant if $\beta$ and $\delta$ are of the same type; it then denotes the class of those classes which are similar to $\delta$ and of the same type as $\alpha$ . We then have a set of propositions (*102·5-·64) on $\text{NC}^\beta(\alpha)$ , i.e. on cardinals consisting of classes of the same type as $\alpha$ which are similar to classes of the same type as $\beta$ . We next prove[Pg 27] (*102·71—·75) that no sub-class of \alpha is similar to $\text{Cl}ʻ\alpha$ , and therefore (substituting $t_{0}ʻ\alpha$ for $\alpha$ ) no class of the same type as $\alpha$ is similar to $tʻ\alpha$ , and therefore

This proves that $\Lambda$ is a cardinal, which is a proposition constantly required. The remaining propositions of *102 are concerned with $\text{ sm }ʻʻ\mu$ where $\mu$ is a typically definite cardinal.

*102·3. $\vdash :\gamma\,\text{ sm }_{(\alpha,\beta)}\delta . \equiv .\gamma \in \text{Nc}(\alpha_{\beta})ʻ\delta$

*102·46. $\vdash :\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta .\equiv .\delta \in \text{Nc}(\beta _{\alpha })ʻ\gamma . \equiv .\gamma\,\text{ sm }\,\delta .\gamma \in tʻ\alpha .\delta \in tʻ\beta$

*102·5. $\vdash :\mu \in \text{NC}^\beta (\alpha ). \equiv .(\exists \delta ).\mu = \text{Nc}(\alpha _{\beta })ʻ\delta$

*102·6. $\vdash .\text{Nc}(\alpha )ʻ\beta = \text{Nc}(\alpha _{\beta })ʻ\beta = \hat{\gamma} (\gamma\,\text{ sm }\,\beta .\gamma \in tʻ\alpha ) = \text{Nc}ʻ\beta \cap tʻ\alpha$

*102·72. $\vdash :\beta \subset \alpha .\supset .{\sim}(\beta \text{ sm } \text{Cl}ʻ\alpha)$

This is used in proving $\mu \in \text{NC}.\supset .2^\mu >\mu$ , which is the proposition from which Cantor deduced that there is no greatest cardinal. (If $\mu = \text{Nc}ʻ\alpha$ , $2^\mu =\text{Nc}ʻ\text{Cl}ʻ\alpha$ , and thus there is a rise of type.)

*102·84. $\vdash :(\exists \gamma ).\gamma \in tʻ\alpha .\gamma \text{ sm } \alpha .\delta \text{ sm } \gamma . \equiv .\delta \text{ sm } \alpha$

*102·85. $\vdash .\text{ sm }ʻʻ\mu \cap tʻ\beta = \text{ sm }_{\beta }ʻʻ\mu$

*102·01. $\text{NC}^\beta (\alpha ) = \text{D}ʻ\text{Nc}(\alpha _{\beta }) \quad\text{Df}$

*102·11. $\vdash :R \in 1\rightarrow 1.\supset .R_{(x,y)} \in 1(x)\rightarrow 1(y)$

Here, if $R$ is a real variable, the conditions of significance require $R = R_{(x,y)}$ . But if $R$ is a typically ambiguous constant, such as $\iota$ or $\dot{\Lambda}$ or $\text{sg}$ , $R_{(x,y)}$ is a typically definite constant. It is chiefly for such cases that propositions such as the above are useful.

Dem. $\begin{array}{l} \vdash .*37·402.(*65·1).&\supset \vdash .\text{D}ʻR_{(x,y)}\subset tʻx.\\ [*33·15]&\supset \vdash .\{\text{sg}ʻR_{(x,y)}\}ʻz\subset tʻx.\\ [*63·5]&\supset \vdash .\{\text{sg}ʻR_{(x,y)}\}ʻz \in tʻtʻx &\qquad \text{(1)}\\ \vdash .(1).*71·102.\supset \vdash :\text{Hp}.z \in \text{ᗡ}ʻR_{(x,y)}.&\supset .\{\text{sg}ʻR_{(x,y)}\}ʻz \in 1\cap tʻtʻx.\\ [(*65·02)] &\supset .\{\text{sg}ʻR_{(x,y)}\}ʻz \in 1(x) &\qquad \text{(2)}\\ \text{Similarly}\qquad &\vdash : \text{Hp}.\omega \in \text{D}ʻR_{(x,y)}.\supset .\{gsʻR_{(x,y)}\}ʻ\omega \in 1(y) &\qquad \text{(3)}\\ \vdash .(2).(3).*70·1.\supset \vdash .\text{Prop} \end{array}$

*102·13. $\vdash :R \in 1\rightarrow 1.\supset .R_{x} \in 1(x)\rightarrow 1 \quad[\text{Proof as in *102·11}]$

*102·2. $\vdash :\gamma \text{ sm }_{(\alpha ,\beta )}\delta . \equiv .\gamma \text{ sm } \delta .\gamma \in tʻ\alpha .\delta \in tʻ\beta \quad[*35·102.(*65·1)]$

*102·21. $\begin{aligned}\vdash :\gamma \text{ sm }_{(\alpha ,\beta )}&\delta . \equiv .(\exists R).R \in 1\rightarrow 1.\text{D}ʻR \in tʻ\alpha .\\ &\text{ᗡ}ʻR \in tʻ\beta .\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta \quad[*102·2.*73·1]\end{aligned}$

*102·22. $\vdash :\gamma \text{ sm }(x,y)\delta . \equiv .\gamma \text{ sm } \delta .\gamma \subset tʻx.\delta \subset tʻy \quad[*63·5.(*65·12)]$

102·23. $\begin{aligned}\vdash :\gamma \text{ sm }(x,y)&\delta . \equiv .(\exists R).R \in 1\rightarrow 1.\text{D}ʻR\subset tʻx.\\ &\text{ᗡ}ʻR\subset tʻy.\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta \quad[*102·22.*73·1]\end{aligned}$

*102·24. $\vdash :\gamma \text{ sm } (x,y) \delta . \equiv .(\exists R).R \in 1(x)\rightarrow 1(y).\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta$

Dem. $\begin{array}{l} \vdash .*102·23.*40·5·52·43.*37·25.\supset \\ \vdash \colon\ldotp \gamma \text{ sm }v(x,y)\delta . &\equiv :(\exists R):R \in 1\rightarrow 1 : w \in \text{ᗡ}ʻR.\supset _{w}\overrightarrow{R}ʻw\subset tʻx:\\ &z \in \text{D}ʻR.\supset _{z}.\overleftarrow{R}ʻz\subset tʻy : \text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta :\\ [*63·5] &\equiv :(\exists R):R \in 1\rightarrow 1 . \overleftarrow{R}ʻʻ\text{ᗡ}ʻR\subset tʻtʻx.\overleftarrow{R}ʻʻ\text{D}ʻR\subset tʻtʻy.\\ &\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta :\\ [*71·102.(*65·02)] &\equiv :(\exists R).\overrightarrow{R}ʻʻ\text{ᗡ}ʻR\subset 1(x).\overleftarrow{R}ʻʻ\text{D}ʻR\subset 1(y).\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta :\\ [*70·1] &\equiv :(\exists R).R \in 1(x)\rightarrow 1(y).\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*102·25. $\begin{aligned}&\vdash :\gamma \text{ sm }_{(\alpha ,\beta )} \delta . \equiv .(\exists R).R \in 1_{\alpha }\rightarrow 1_{\beta }.\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta\\ &[\text{Proof as in *102·24}]\end{aligned}$

*102·26. $\vdash :\gamma \text{ sm }_{(\alpha ,\beta )} \delta .\gamma'\text{ sm }_{(\alpha ,\beta )} \delta .\supset .\gamma \text{ sm }_{(\alpha ,\alpha )}\gamma'$

Dem. $\begin{array}{l} \vdash .*102·2. \supset \vdash : \text{Hp}.&\supset .\gamma \text{ sm } \delta .\gamma'\text{ sm } \delta .\gamma ,\gamma'\in \tau ʻ\alpha .\\ [*73·32] &\supset .\gamma \text{ sm } \gamma'.\gamma ,\gamma'\in \tau ʻ\alpha .\\ [*102·2] &\supset .\gamma \text{ sm }_{(\alpha ,\alpha )}\gamma':\supset \vdash .\text{Prop} \end{array}$

*102·27. $\vdash :\gamma \text{ sm }_{(\alpha ,\beta )} \delta .\gamma' \text{ sm }_{(\alpha ʻ,\beta )} \delta .\supset .\gamma \text{ sm }_{(\alpha ,\alpha ʻ)}\gamma' \quad[\text{Proof as in *102·26}]$

*102·3. $\vdash :\gamma \text{ sm }_{(\alpha ,\beta )} \delta . \equiv .\gamma \in \text{Nc}{(\alpha _\beta )}ʻ\delta$

Dem. $\begin{array}{l} \vdash .*32·18.\supset \\ \vdash :\gamma \text{ sm }_{(\alpha _\beta )} \delta . &\equiv .\gamma \in {\text{sg}ʻ\text{ sm }_(\alpha _{\beta })}ʻ\delta .\\ [*65·2] &\equiv .\gamma \in {(\text{sg}ʻ\text{ sm })(\alpha _{\beta })}ʻ\delta .\\ [(*100·01)] &\equiv \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta :\supset \vdash .\text{Prop} \end{array}$

*102·31. $\vdash .\text{Nc} (\alpha _{\beta })ʻ\delta = \text{D}ʻʻ\{1\rightarrow 1\cap \hat{R} (\text{D}ʻR \in tʻ\alpha .\text{ᗡ}ʻR \in tʻ\beta .\text{ᗡ}ʻR = \delta )\}$

Dem. $\begin{array}{l} \vdash .*102·3·21.\supset\\ \vdash :\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . &\equiv .(\exists R).R \in 1\rightarrow 1.\text{D}ʻR \in tʻ\alpha .\text{ᗡ}ʻR \in tʻ\beta .\text{D}ʻR = \gamma .\text{ᗡ}ʻR = \delta .\\ [*33·123.*37·1] &\equiv .\gamma \in \text{D}ʻʻ\{1\rightarrow 1\cap \hat{R} (\text{D}ʻR \in tʻ\alpha . \text{ᗡ}ʻR \in tʻ\beta .\text{ᗡ}ʻR = \delta )\}:\\ \supset \vdash .\text{Prop} \end{array}$

*102·32. $\vdash . \text{Nc}(\alpha _{\beta })ʻ\delta = \text{D}ʻʻ\{(1_{\alpha }\rightarrow 1_{\beta }) \cap \overleftarrow{\text{ᗡ}}ʻ\delta\}$

Dem. $\begin{array}{l} \vdash .*102·3·25. \supset \\ \vdash : \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . &\equiv . (\exists R) . R \in 1_{\alpha }\rightarrow 1_{\beta } . \text{D}ʻR = \gamma . \text{ᗡ}ʻR = \delta .\\ [*33·61] &\equiv . (\exists R) . R \in 1_{\alpha }\rightarrow 1_{\beta } . R \in \overleftarrow{\text{ᗡ}}ʻ\delta . \text{D}ʻR = \gamma .\\ [*33·123.*37·1] &\equiv . \gamma \in \text{D}ʻʻ{(1_{\alpha }\rightarrow 1_{\beta }) \cap \overleftarrow{\text{ᗡ}}ʻ\delta } : \supset \vdash . \text{Prop} \end{array}$

*102·34. $\begin{aligned}\vdash . \text{Nc}(\alpha ,\beta )ʻ\delta = &\text{D}ʻʻ\{1 \rightarrow 1 \cap \hat{R} (\text{D}ʻR \in tʻ\alpha . \text{ᗡ}ʻR \subset tʻ\beta . \text{ᗡ}ʻR = \delta )\}\\ &[\text{Proof as in *102·31}]\end{aligned}$

*102·35. $\vdash . \text{Nc}(\alpha ,\beta )ʻ\delta = \text{D}ʻʻ[{1_{\alpha } \rightarrow 1(\beta )} \cap \overleftarrow{\text{ᗡ}}ʻ\delta ] \quad[\text{Proof as in *102·32}]$

*102·36. $\vdash . \text{E}! \text{Nc}(\alpha _{\beta })ʻ\delta \quad[*102·31.*14·21]$

This proposition is true whenever it is significant, and is significant whenever $\delta \in tʻ\beta$ . When $\delta$ belongs to some other type, the above proposition is not significant.

*102·361. $\vdash . \text{E}! \text{Nc}(\alpha , \beta )ʻ\delta \quad[*102·34.*14·21]$

Dem. $\begin{array}{l} \vdash .*37·402.(*65·11). &\supset \vdash . \text{ᗡ}ʻ\text{Nc}(\alpha _{\beta }) \subset tʻ\beta &&\qquad \text{(1)}\\ \vdash .*102·36.*33·43 . &\supset \vdash . (\delta ) . \delta \in \text{ᗡ}ʻ\text{Nc}(\alpha _{\beta }). [*63·14] &\supset \vdash . t_{0}ʻ\text{ᗡ}ʻ\text{Nc}(\alpha _{\beta }) = \text{ᗡ}ʻ\text{Nc}(\alpha _{\beta }) &\qquad \text{(2)}\\ \vdash .(1).*63·21. &\supset \vdash .t_{0}ʻ\text{ᗡ}ʻ\text{Nc}(\alpha _{\beta }) = tʻ\beta &&\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash . \text{Prop} \end{array}$

*102·4. $\vdash : \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . \gamma' \in \text{Nc}(\alpha _{\beta })ʻ\delta . \supset . \gamma \in \text{Nc}(\alpha _{\alpha })ʻ\gamma'\quad[*102·3·26]$

*102·41. $\vdash : \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . \gamma'\in \text{Nc}(\alpha _{\beta }ʻ)ʻ\delta . \supset . \gamma \in \text{Nc}(\alpha _{\alpha ʻ})ʻ\gamma' \quad[*102·3·27]$

*102·42. $\vdash . \alpha \in \text{Nc}(\alpha _{\alpha })ʻ\alpha \quad[*102·3·2.*73·3.*63·103]$

*102·43. $\vdash . \exists ! \text{Nc}(\alpha _{\alpha })ʻ\alpha \quad[*102·42]$

This inference is legitimate because, when $\alpha$ is given, " $\text{Nc}(\alpha _{\alpha })ʻ\alpha$ " is typically definite. The inference from " $\alpha \in \text{Nc}ʻ\alpha$ " (which is true) to " $\exists !\text{Nc}ʻ\alpha$ " is not valid, because " $\exists!\text{Nc}ʻ\alpha$ " may hold only for some of the possible determinations of the ambiguity of " $\text{Nc}$ ."

*102·44. $\vdash : \alpha \text{ sm } \beta . \equiv . \alpha \in \text{Nc}(\alpha _{\beta })ʻ\beta . \equiv . \beta \in \text{Nc}(\beta _{\alpha })ʻ\alpha$

Dem. $\begin{array}{l} &\vdash .*63·102 . \supset\\ &\vdash : \alpha \text{ sm } \beta . \equiv . \alpha \text{ sm } \beta . \alpha \in tʻ\alpha . \beta \in tʻ\beta &\qquad \text{(1)}\\ &\vdash .(1).*102·2·3 . \supset \vdash . \text{Prop} \end{array}$

*102·45. $\vdash :\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta .\supset .\gamma \in \text{Nc}(\alpha _{\alpha })ʻ\gamma$

Dem. $\begin{array}{l} &\vdash .*102·3·2. \supset \vdash :\text{Hp}.\supset .\gamma \in tʻ\alpha &\qquad \text{(1)}\\ &\vdash .*73·3. \supset \vdash .\gamma \text{ sm } \gamma &\qquad \text{(2)}\\ &\vdash .(1).(2).*102·3·2.\supset \vdash .\text{Prop} \end{array}$

*102·46. $\begin{aligned}&\vdash :\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . \equiv .\delta \in \text{Nc}(\beta _{\alpha }ʻ\gamma . \equiv .\gamma \text{ sm } \delta .\gamma \in tʻ\alpha.\delta \in tʻ\beta \\ &[*102·2·3.*73·31]\end{aligned}$

*102·5. $\vdash :\mu \in \text{NC}^\beta (\alpha ). \colon\ldotp .(\exists \delta ).\mu = \text{Nc}(\alpha _{\beta })ʻ\delta \quad[*100·22.*71·41.(*102*01)]$

In using propositions, such as those of *100, in which we have a typically ambiguous " $\text{Nc}$ " or " $\text{NC}$ ," any significant typical definiteness may be added, since, when a typically ambiguous proposition is asserted, that includes the assertion of every possible proposition resulting from determining the ambiguity.

*102·501. $\vdash .\text{Nc}(\alpha _{\beta }ʻ\delta \in \text{NC}^\beta (\alpha ) \quad[*102·5·36]$

*102·51. $\begin{aligned}\vdash :\gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta .\supset .&\text{Nc}((\alpha _{\beta })ʻ\delta = \text{Nc}(\alpha _{\alpha })ʻ\gamma .\\ &\text{Nc}(\alpha _{\beta })ʻ\delta \in \text{NC}^\beta (\alpha ).\text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\alpha (\alpha )\end{aligned}$

Dem. $\begin{array}{l} \vdash .*102·3·2.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\gamma \text{ sm } \delta .\gamma \in tʻ\alpha .\delta \in tʻ\beta :\\ [*73·37.*4·73] \supset :\xi \text{ sm } \delta . \equiv .&\xi \text{ sm } \gamma :\xi \text{ sm } \delta . \equiv .\xi \text{ sm } \delta .\delta \in tʻ\beta :\\ &\xi \text{ sm } \gamma . \equiv .\xi \text{ sm } \gamma .\gamma \in tʻ\alpha :\\ [*4·22] &\supset :\xi \text{ sm } \delta .\delta \in tʻ\beta . \equiv .\xi \text{ sm } \gamma .\gamma \in tʻ\alpha :\\ [\text{Fact}] &\supset :\xi \text{ sm } \delta .\xi \in tʻ\alpha .\delta \in tʻ\beta . \equiv .\xi \text{ sm } \gamma .\xi \in tʻ\alpha .\gamma \in tʻ\alpha :\\ [*102·2·3] &\supset :\text{Nc}(\alpha _{\beta })ʻ\delta = \text{Nc}(\alpha _{\alpha })ʻ\gamma &\qquad \text{(1)}\\ \vdash .(1).*102·501 .\supset \vdash .\text{Prop} \end{array}$

*102·52. $\vdash :\exists ! \text{Nc}(\alpha _{\beta })ʻ\delta .\supset .\text{Nc}(\alpha _{\beta })ʻ\delta \in \text{NC}^\alpha (\alpha ) \quad[*102·51]$

*102·53. $\vdash .\text{NC}^\beta (\alpha )-\iota ʻ\Lambda \subset \text{NC}^\alpha (\alpha )$

Dem. $\begin{array}{l} \vdash .*102·52.\supset \vdash :\mu = \text{Nc}(\alpha _{\beta })ʻ\delta .\exists !\mu .\supset .\mu \in \text{NC}^\alpha (\alpha ) &\qquad \text{(1)}\\ \vdash .(1).*102*5.\supset \vdash .\text{Prop} \end{array}$

*102·54. $\vdash :\delta \in \text{Nc}(\beta _{\alpha })ʻ\gamma .\supset .\text{Nc}(\alpha _{\beta })ʻ\delta = \text{Nc}(\alpha _{\alpha })ʻ\gamma \quad[*102·51·46]$

*102·541. $\vdash :\exists ! \text{Nc}(\beta _{\alpha })ʻ\gamma .\supset .\text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\beta (\alpha )-tʻ\Lambda$

Dem. $\begin{array}{l} \vdash . *102·54·501.&\supset \vdash :\delta \in \text{Nc}(\beta_{\alpha}ʻ\gamma .\supset .\text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\beta (\alpha ) &\qquad \text{(1)}\\ \vdash . *102·46·45. \supset :\vdash \delta \in \text{Nc}{(\beta_{\alpha})}ʻ\gamma .&\supset .\gamma \in \text{Nc}(\alpha _{\alpha })ʻ\gamma .\\ [*10·24] &\supset .\exists !\text{Nc}(\alpha_{\alpha})ʻ\gamma &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \\ \vdash :\delta \in \text{Nc}(\beta_{\alpha})ʻ\gamma .&\supset .\text{Nc}(\alpha_{\alpha})ʻ\gamma \in \text{NC}^\beta (\alpha )-tʻ\Lambda :\supset \vdash .\text{Prop} \end{array}$

*102·55. $\vdash : \Lambda {\sim}\in \text{NC}^\alpha (\beta ) . \supset . \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda = \text{NC}^\alpha (\alpha )$

Dem. $\begin{array}{l} \vdash .*102·5 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \mu = \text{Nc}(\beta _{\alpha })ʻ\gamma . \supset _{\mu ,\gamma } . \exists !\mu .\\ [*102·541] &\supset _{\mu ,\gamma } . \text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda :\\ [*10·23] &\supset : (\exists \mu ) . \mu = \text{Nc}(\beta _{\alpha })ʻ\gamma . \supset _{\gamma } . \text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda :\\ [*102·36] &\supset : (\gamma ) . \text{Nc}(\alpha _{\alpha })ʻ\gamma \in \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda :\\ [*13·191] &\supset : \nu = \text{Nc}(\alpha _{\alpha })ʻ\gamma . \supset _{\nu ,\gamma } . \nu \in \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda :\\ [*102·5] &\supset : \nu \in \text{NC}^\alpha (\alpha ) . \supset _{\nu } . \nu \in \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .(1).*102·53. \supset \vdash . \text{Prop} \end{array}$

The above proposition shows that, if every class of the same type as $\beta$ is similar to some class of the same type as $\alpha$ , then, given a class $\gamma$ of the same type as $\alpha$ , there is a class $\delta$ , of the same type as $\beta$ , such that the classes similar to $\delta$ and of the same type as $\alpha$ are the same as the classes similar to $\gamma$ and of the same type as $\alpha$ ; and conversely, given any class $\delta$ , of the same type as $\beta$ , and similar to some class of the same type as $\alpha$ , then there is a class $\gamma$ , of the same type as $\alpha$ , such that the classes similar to $\gamma$ and of the same type as $\alpha$ are the same as the classes similar to $\delta$ and of the same type as $\alpha$ . We may express this by saying that, if the cardinals which go from the type of $\alpha$ to the type of $\beta$ are never null, then those that go from the type of $\beta$ to the type of $\alpha$ , with the exception of $\Lambda$ (if $\Lambda$ is one of them), are the same as those that begin and end within the type of $\alpha$ . The latter are what we call "homogeneous" cardinals. Thus our proposition is a step towards reducing the general study of cardinals to that of homogeneous cardinals.

*102·6. $\vdash . \text{Nc}(\alpha )ʻ\beta = \text{Nc}(\alpha _{\beta })ʻ\beta = \hat{\gamma} (\gamma \text{ sm } \beta . \gamma \in tʻ\alpha ) = \text{Nc}ʻ\beta \cap tʻ\alpha$

Dem. $\begin{array}{l} \vdash .*35·1.(*65·04). \supset \\ \vdash : \mu = \text{Nc}(\alpha )ʻ\beta . &\equiv . \mu = \text{Nc}ʻ\beta . \mu \in t^{2}ʻ\alpha .\\ [*63·5] &\equiv . \mu = \text{Nc}ʻ\beta . \mu \subset tʻ\alpha .\\ [*65·13] &\equiv . \mu = \text{Nc}ʻ\beta \cap tʻ\alpha . &&\qquad \text{(1)}\\ [*100·1] &\equiv . \mu = \hat{\gamma} (\gamma \text{ sm } \beta . \gamma \in tʻ\alpha ). &&\qquad \text{(2)}\\ [*63·103] &\equiv . \mu = \hat{\gamma} (\gamma \text{ sm } \beta . \gamma \in tʻ\alpha . \beta \in tʻ\beta ). [*102·46] &\equiv . \mu = \text{Nc}(\alpha _{\beta })ʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*20·2.*100·1. \supset \vdash . \text{Prop} \end{array}$

*102·61. $\vdash : \delta \in tʻ\beta . \supset . \text{Nc}(\alpha )ʻ\delta = \text{Nc}(\alpha _{\beta })ʻ\delta$

Dem. $\begin{array}{l} \vdash .*4·73 . \supset \vdash : \text{Hp} . \supset . \hat{\gamma} (\gamma \text{ sm } \delta . \gamma \in tʻ\alpha ) &= \hat{\gamma} (\gamma \text{ sm } \delta . \gamma \in tʻ\alpha . \delta \in tʻ\beta )\\ [*102·46] &= \text{Nc}(\alpha _{\beta })ʻ\delta &\qquad \text{(1)}\\ \vdash .(1).*102·6. \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*37·7.(*100·01). \supset \\ \vdash . \text{Nc}(\alpha )ʻʻtʻ\beta &= \hat{\mu} \{(\exists \delta ) . \delta \in tʻ\beta . \mu = \text{Nc}(\alpha )ʻ\delta\}\\ [*102·61] &= \hat{\mu} \{(\exists \delta ) . \delta \in tʻ\beta . \mu = \text{Nc}(\alpha _{\beta})ʻ\delta\}\\ [*102·37] &= \text{D}ʻ\text{Nc}(\alpha _{\beta })\\ [(*102·01)] &= \text{NC}^\beta (\alpha ) . \supset \vdash . \text{Prop} \end{array}$

*102·63. $\vdash : \mu = \text{Nc}ʻ\gamma . \alpha \in \mu . \supset . \mu = \text{Nc}(\alpha )ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *63·5 . \supset \vdash : \text{Hp} . &\supset . \mu = \text{Nc}ʻ\gamma . \mu \subset tʻ\alpha .\\ [*65·13] &\supset . \mu = \text{Nc}ʻ\gamma \cap tʻ\alpha .\\ [*102·6] &\supset . \mu = \text{Nc}(\alpha )ʻ\gamma : \supset \vdash . \text{Prop} \end{array}$

*102·64. $\vdash : \mu \in \text{NC} . \exists !\mu . \supset . (\exists \alpha ,\gamma ) . \mu = \text{Nc}(\alpha )ʻ\gamma \quad[*102·63.*100·4]$

The following propositions are part of Cantor's proof that there is no greatest cardinal. They are inserted here in order to enable us to prove that $\Lambda$ is a cardinal, namely what we call a "descending" cardinal, i.e. one whose corresponding " $\text{ sm }$ " goes from a higher to a lower type.

*102·71. $\vdash : R \in \text{Cls} \rightarrow 1 . \text{D}ʻR\subset \alpha . \text{ᗡ}ʻR\subset \text{Cl}ʻ\alpha . \supset . \exists ! \text{Cl}ʻ\alpha - \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*20·33.*4·73 . \supset \\ \vdash \colon\colon \text{Hp} . \varpi = &\hat{x} (x \in \text{D}ʻR . x {\sim}\in \breve{R}ʻx) . \supset \colon\ldotp \\ x \in \text{D}ʻR . &\supset _{x} : x \in \varpi . \equiv . x {\sim} \in \breve{R}ʻx:\\ [*5·18] &\supset _{x} : {\sim}\{x \in \varpi . \equiv . x \in \breve{R}ʻx\}:\\ [*20·43.\text{Transp}.*71·164] &\supset _{x} : \varpi \neq \breve{R}ʻx\colon\ldotp \\ [*71·411.\text{Transp}] &\supset \colon\ldotp \varpi {\sim}\in \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash .*20·33.*3·26 . \supset \vdash : \text{Hp}(1) . &\supset . \varpi \subset \text{D}ʻR.\\ [\text{Hp}] &\supset . \varpi \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*13·191 . \supset \\ \vdash : \text{Hp} . \supset . \hat{x} (x \in \text{D}ʻR . x {\sim}\in \breve{R}ʻx) \in \text{Cl}ʻ\alpha - \text{ᗡ}ʻR : \supset \vdash . \text{Prop} \end{array}$

*102·72. $\vdash : \beta \subset \alpha . \supset .{\sim}(\beta \text{ sm } \text{Cl}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*102·71. \supset \vdash \colon\ldotp \text{Hp} . &\supset : R \in 1 \rightarrow 1 . \text{D}ʻR = \beta . \text{ᗡ}ʻR \subset \text{Cl}ʻ\alpha . \supset _{R} . \exists ! \text{Cl}ʻ\alpha - \text{ᗡ}ʻR:\\ [*24·55.*22·41] &\supset : R \in 1 \rightarrow 1 . \text{D}ʻR = \beta . \supset _{R}. \text{ᗡ}ʻR \neq \text{Cl}ʻ\alpha :\\ [*10·51] &\supset : {\sim}(\exists R) . R \in 1 \rightarrow 1 . \text{D}ʻR = \beta . \text{ᗡ}ʻR = \text{Cl}ʻ\alpha :\\ [*73·1] &\supset : {\sim}(\beta \text{ sm } \text{Cl}ʻ\alpha ) \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*102·6 . \supset \vdash . \text{Nc}(\alpha )ʻtʻ\alpha &= \hat{\gamma} (\gamma \text{ sm } tʻ\alpha . \gamma \in tʻ\alpha )\\ [*63·65] &= \hat{\gamma} (\gamma \text{ sm } \text{Cl}ʻt_{0}ʻ\alpha . \gamma \subset t_{0}ʻ\alpha )\\ [*102·72] &= \Lambda . \supset \vdash . \text{Prop} \end{array}$

This proposition proves that no class of the same type as $\alpha$ is similar to $tʻ\alpha$ . Now $tʻ\alpha$ is the greatest class of its type; thus there are classes of the type next above that of $\alpha$ which are too great to be similar to any class of the type of $\alpha$ . Thus (as will be explicitly proved later) the maximum cardinal in one type is less than that in the next higher type. Cantor's proposition that there is no maximum cardinal only holds when we are allowed to rise to continually higher types: in each type, there is a maximum for that type, namely the number of members of the type.

Dem. $\begin{array}{l} \vdash .*102·6·501. &\supset \vdash . \text{Nc}(\alpha )ʻtʻ\alpha \in \text{NC}^{tʻ\alpha }(\alpha ) &\qquad \text{(1)}\\ \vdash .(1).*102·73. &\supset \vdash .\text{Prop} \end{array}$

*102·75. $\vdash . \text{NC}^{tʻ\alpha }(\alpha ) = \text{NC}^\alpha (\alpha ) \cup \iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*100·6. &\supset \vdash : \gamma \in tʻ\alpha . \supset . \gamma \in tʻ\alpha . \iota ʻʻ\gamma \in \text{Nc}ʻ\gamma &\qquad \text{(1)}\\ \vdash .*63·64·5. &\supset \vdash : \gamma \in tʻ\alpha . \supset . \iota ʻʻ\gamma \in t^{2}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*102·46. \supset \vdash : \gamma \in tʻ\alpha . &\supset . \iota ʻʻ\alpha \in \text{Nc}{(tʻ\alpha )_{\alpha }}ʻ\gamma .\\ [*10·24] &\supset . \exists ! \text{Nc}{(tʻ\alpha )_{\alpha }}ʻ\gamma &\qquad \text{(3)}\\ \vdash .(3).*102·55. &\supset \vdash . \text{NC}^{tʻ\alpha }(\alpha ) - \iota ʻ\Lambda = \text{NC}^\alpha (\alpha ) &\qquad \text{(4)}\\ \vdash .(4).*102·74. &\supset \vdash .\text{Prop} \end{array}$

*102·8. $\vdash : \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . \gamma \text{ sm } \zeta . \zeta \in tʻ\xi . \supset . \zeta \in \text{Nc}(\xi _{\beta })ʻ\delta . \zeta \in \text{Nc}(\xi _{\alpha })ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *102·46 . \supset \\ \vdash : \text{Hp}. &\supset . \gamma \text{ sm } \delta . \gamma \in tʻ\alpha . \delta \in tʻ\beta . \gamma \text{ sm } \zeta . \zeta \in tʻ\xi .\\ [*73·31·32] &\supset . \zeta \text{ sm } \delta . \zeta \in tʻ\xi . \delta \in tʻ\beta . \zeta \text{ sm } \gamma . \zeta \in tʻ\xi . \gamma \in tʻ\alpha .\\ [*102·46] &\supset . \zeta \in \text{Nc}(\xi _{\beta })ʻ\delta . \zeta \in \text{Nc}(\xi _{\alpha })ʻ\gamma : \supset \vdash . \text{Prop} \end{array}$

*102·81. $\vdash : \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta . \supset . \text{ sm }ʻʻ\text{Nc}(\alpha _{\beta })ʻ\delta \cap tʻ\xi = \text{Nc}(\xi _{\beta })ʻ\delta = \text{Nc}(\xi _{\alpha })ʻ\gamma$

Dem. $\begin{array}{l} \vdash .*102·8.*73·31·32 . \supset \\ \vdash : \gamma , \gamma ʻ &\in \text{Nc}(\alpha _{\beta })ʻ\delta . \zeta \text{ sm } \gamma ʻ . \zeta \in tʻ\xi . \supset . \zeta \in \text{Nc}(\xi _{\beta })ʻ\delta . \zeta \in \text{Nc}(\xi _{\alpha })ʻ\gamma &\qquad \text{(1)}\\ \vdash .(1).*37·1. \supset \vdash : \text{Hp} . \supset . &\text{ sm }ʻʻ\text{Nc}(\alpha _{\beta })ʻ\delta \cap tʻ\xi \subset \text{Nc}(\xi _{\beta })ʻ\delta .\\ &\text{ sm }ʻʻ\text{Nc}(\alpha _{\beta })ʻ\delta \cap tʻ\xi \subset \text{Nc}(\xi _{\alpha })ʻ\gamma &\qquad \text{(2)}\\ \vdash .*102·46.*73·31·32 . \supset \\ \vdash : \text{Hp} . \zeta \in \text{Nc}(\xi _{\beta })ʻ\delta . &\supset . \zeta \in tʻ\xi . \zeta \text{ sm } \gamma . \gamma \in \text{Nc}(\alpha _{\beta })ʻ\delta .\\ [*37·1] &\supset . \zeta \in \text{ sm }ʻʻ\text{Nc}(\alpha _{\beta })ʻ\delta \cap tʻ\xi &\qquad \text{(3)}\\ \text{Similarly}\\ \vdash : \text{Hp} . \zeta \in \text{Nc}(\xi _{\alpha })ʻ\gamma . &\supset . \zeta \in \text{ sm }ʻʻ\text{Nc}(\alpha _{\beta })ʻ\delta \cap tʻ\xi &\qquad \text{(4)}\\ \vdash .(2).(3).(4). \supset \vdash . \text{Prop} \end{array}$

*102·82. $\vdash : \mu \in \text{NC}^\beta (\alpha ) . \exists !\mu . \supset . \text{ sm }ʻʻ\mu \cap tʻ\xi \in \text{NC}^\beta (\xi ) \quad[*102·81·5]$

*102·83. $\begin{aligned}\vdash : \mu \in \text{NC}^\beta (\alpha ) . &\exists !\mu . \nu = \text{ sm }ʻʻ\mu \cap tʻ\xi . \exists !\nu . \supset .\\ &\text{ sm }ʻʻ\mu \cap tʻ\zeta = \text{ sm }ʻʻ\nu \cap tʻ\zeta . \mu = \text{ sm }ʻʻ\nu \cap tʻ\alpha\end{aligned}$

Dem. $\begin{array}{l} \vdash . *102·81 . \supset \\ \vdash : \text{Hp} . \gamma \in \mu . &\gamma' \in \nu . \mu = \text{Nc}(\alpha _{\beta })ʻ\delta . \supset .\\ &\nu = \text{Nc}(\xi _{\beta })ʻ\delta = \text{Nc}(\xi _{\alpha })ʻ\gamma . \text{ sm }ʻʻ\mu \cap tʻ\zeta = \text{Nc}(\zeta _{\alpha })ʻ\gamma .\\ [*102·81] \supset . &\text{ sm }ʻʻ\nu \cap tʻ\zeta = \text{Nc} (\zeta _{\alpha })ʻ\gamma = \text{ sm }ʻʻ\mu \cap tʻ\zeta .\\ &\text{ sm }ʻʻ\nu \cap tʻ\alpha = \text{Nc}(\alpha _{\beta })ʻ\delta = \mu &\qquad \text{(1)}\\ \vdash . (1) . *102·5 . \supset \vdash . \text{Prop} \end{array}$

*102·84. $\vdash : (\exists \gamma ) . \gamma \text{ sm } \alpha . \gamma \in tʻ\alpha . \delta \text{ sm } \gamma . \equiv . \delta \text{ sm } \alpha$

Dem. $\begin{array}{l} \vdash . *73·32 . &\supset \vdash : (\exists \gamma ) . \gamma \text{ sm } \alpha . \gamma \in tʻ\alpha . \delta \text{ sm } \gamma . \supset . \delta \text{ sm } \alpha &\qquad \text{(1)}\\ \vdash . *73·3 . *63·103 . \supset \\ \vdash : \delta \text{ sm } \alpha . &\supset . \alpha \text{ sm } \alpha . \alpha \in tʻ\alpha . \delta \text{ sm } \alpha .\\ [*10·24] &\supset . (\exists \gamma ) . \gamma \text{ sm } \alpha . \gamma \in tʻ\alpha . \delta \text{ sm } \gamma &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*102·85. $\vdash . \text{ sm }ʻʻ\mu \cap tʻ\beta = \text{ sm }_{\beta }ʻʻ\mu \quad[*65·3]$

*102·86. $\vdash : \mu = \text{Nc} (\alpha )ʻ\delta . \exists !\mu . \supset . \text{ sm }_{\xi }ʻʻ\mu = \text{Nc}(\xi )ʻ\delta$

Dem. $\begin{array}{l} \vdash . *102·6·81 . \supset \\ \vdash : \gamma \in \text{Nc}(\alpha )ʻ\delta . &\supset . \text{ sm }ʻʻ\text{Nc}(\alpha )ʻ\delta \cap tʻ\xi = \text{Nc}(\xi )ʻ\delta .\\ [*102·85] &\supset . \text{ sm }_{\xi }ʻʻ\text{Nc}(\alpha )ʻ\delta = \text{Nc}(\xi )ʻ\delta &\qquad \text{(1)}\\ \vdash . (1) . *13·12 . \supset \\ \vdash : \mu = \text{Nc} (\alpha )ʻ\delta . \gamma \in \mu . &\supset . \text{ sm }_{\xi }ʻʻ\mu = \text{Nc}(\xi )ʻ\delta : \supset \vdash . \text{Prop} \end{array}$

*102·861. $\vdash . \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ \mu \subset \text{ sm }_{\alpha }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash . *37·1 . \supset \vdash : \gamma \in \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu . &\supset . (\exists \zeta ,\eta ) . \eta \in \mu . \zeta \text{ sm } \eta . \zeta \in tʻ\xi . \gamma \text{ sm } \zeta . \gamma \in tʻ\alpha .\\ [*73·32.*10·5] &\supset . (\exists \eta ) . \eta \in \mu . \gamma \text{ sm } \eta . \gamma \in tʻ\alpha .\\ [*37·1] &\supset . \gamma \in \text{ sm }_{\alpha }ʻʻ\mu : \supset \vdash . \text{Prop} \end{array}$

*102·862. $\vdash \colon\ldotp \eta \in \mu . \supset _{\eta } . \exists !\text{Nc}(\xi )ʻ\eta : \supset . \text{ sm }_{\alpha }ʻʻ\mu = \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash . *102·6. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \eta \in \mu . \supset . (\exists \zeta ) . \zeta \text{ sm } \eta . \zeta \in tʻ\xi :\\ [\text{Fact}.*10·35] &\supset : \eta \in \mu . \gamma \text{ sm } \eta . \gamma \in tʻ\alpha . \supset .\\ &(\exists \zeta ) . \zeta \text{ sm } \eta . \zeta \in tʻ \xi . \gamma \text{ sm } \eta . \gamma \in tʻ\alpha .\\ [*73·37] &\supset . (\exists \zeta ) . \zeta \text{ sm } \eta . \zeta \in tʻ \xi . \gamma \text{ sm } \zeta . \zeta \in tʻ\alpha .\\ [*37·1] &\supset . \gamma \in \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(1)}\\ \vdash . (1) . *10·11·23 . *37·1 . &\supset \vdash : \text{Hp}. \supset . \text{ sm }_{\alpha }ʻʻ\mu \subset \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(2)}\\ \vdash . (2) . *102·861 . \supset \vdash . \text{Prop} \end{array}$

*102·863. $\vdash \colon\ldotp \mu = \text{Nc}(\beta )ʻ\delta . \exists !\text{Nc}(\xi )ʻ\delta . \supset : \eta \in \mu . \supset _{\eta } . \exists !\text{Nc}(\xi )ʻ\eta$

Dem. $\begin{array}{l} \vdash . *100·31·321. \supset \vdash : \text{Hp} . \eta \in \mu . &\supset . \text{Nc}(\xi )ʻ\eta = \text{Nc}(\xi )ʻ\delta .\\ [\text{Hp}] &\supset . \exists !\text{Nc}(\xi )ʻ\eta : \supset \vdash . \text{Prop} \end{array}$

*102·87. $\begin{aligned}&\vdash : \mu = \text{Nc}(\beta )ʻ\delta . \exists !\text{Nc}(\xi )ʻ\delta . \supset . \text{ sm }_{\alpha }ʻʻ\mu = \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu \\ &[*102·862·863]\end{aligned}$

*102·88. $\begin{aligned}\vdash : \mu = \text{Nc}(\beta )ʻ\delta . \exists !\text{ sm }_{\xi }ʻʻ\mu . \supset . &\text{ sm }_{\xi }ʻʻ\mu = \text{Nc}(\xi )ʻ\delta . \text{ sm }_{\alpha }ʻʻ\mu = \text{Nc}(\alpha )ʻ\delta .\\ &\text{ sm }_{\alpha }ʻʻ\mu = \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu = \text{ sm }_{\alpha }ʻʻ\text{Nc}(\xi )ʻ\delta\end{aligned}$

Dem. $\begin{array}{l} \vdash . *37·29 . \text{Transp}. \supset \vdash : \text{Hp} . \supset . \exists !\mu .\\ [*102·86] &\supset . \text{ sm }_{\xi }ʻʻ\mu = \text{Nc}(\xi )ʻ\delta . \text{ sm }_{\alpha }ʻʻ\mu = \text{Nc}(\alpha )ʻ\delta . &\qquad \text{(1)}\\ [\text{Hp}] &\supset . \exists !\text{Nc}(\xi )ʻ\delta .\\ [*102·87] \supset . \text{ sm }_{\alpha }ʻʻ\mu &= \text{ sm }_{\alpha }ʻʻ\text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(2)}\\ [(1)] &= \text{ sm }_{\alpha }ʻʻ\text{Nc}(\xi )ʻ\delta &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

Note on negative statements concerning types. Statements such as " $x {\sim} \in tʻy$ " or " $x {\sim} \in t_{0}ʻ\alpha$ " are always false when they are significant. Hence when an object belongs to one type, there is no significant way of expressing what we mean when we say that it does not belong to some other type. The reason is that, when, for example, $tʻ\alpha$ and $t_{0}ʻ\alpha$ are said to be different, the statement is only significant if interpreted as applying to the symbols, i.e. as meaning to deny that the two symbols denote the same class. We cannot assert that they denote different classes, since " $tʻ\alpha \neq t_{0}ʻ\alpha$ " is not significant, but we can deny that they denote the same class. Owing to this peculiarity, propositions dealing with types acquire their importance largely from the fact that they can be interpreted as dealing with the symbols rather than directly with the objects denoted by the symbols. Another reason for the importance of typically definite propositions is that, when they are implications of which the hypothesis can be asserted, they can be used for inference, i.e. for the assertion of the conclusion. Where typically ambiguous symbols occur in implications, on the contrary, the conditions of significance may be different for the hypothesis and the conclusion, so that fallacies may arise from the use of such implications in inference. E.g. it is a fallacy to infer " $\vdash . \exists !\text{Nc}ʻ\alpha$ " from the (true) propositions " $\vdash : \alpha \in \text{Nc}ʻ\alpha .\supset . \exists !\text{Nc}ʻ\alpha$ " and " $\vdash . \alpha \in \text{Nc}ʻ\alpha$ ." (The truth of the first of these two requires that " $\text{Nc}ʻ\alpha$ " should receive the same typical determination in both its occurrences.) For these two reasons hypothetical concerning types are often useful, in spite of the fact that their hypotheses are always true when they are significant.

In this number, we shall consider cardinals generated by a homogeneous relation of similarity. A "homogeneous" cardinal is to mean all the classes similar to some class $\alpha$ and of the same type as $\alpha$ . The "homogeneous cardinal of $\alpha$ " will be defined as $\text{Nc}ʻ\alpha \cap tʻ\alpha$ ; we shall denote it by " $\text{N}_{0}\text{c}ʻ\alpha$ ." Then the class of homogeneous cardinals is the class of all such cardinals as " $\text{N}_{0}\text{c}ʻ\alpha$ ," i.e. it is $\text{D}ʻ\text{N}_{0}\text{c}$ ; this we shall denote by " $\text{N}_{0}\text{C}$ ." The symbol " $\text{N}_{0}\text{c}ʻ\alpha$ " is typically definite as soon as $\alpha$ is assigned; " $\text{N}_{0}\text{C}$ ," on the contrary, is typically ambiguous: it must be a $\text{Cls}^{3}$ , but otherwise its type may vary indefinitely. Homogeneous cardinals have, however, many properties which do not require that the ambiguity of " $\text{N}_{0}\text{C}$ " should be determined, and few which do require this. They are important also as being the simplest kind of cardinals, and as being a kind to which other kinds can usually be reduced.

The chief advantage of homogeneous cardinals is that they are never null (*103·13 ·22). This enables us to avoid by their means the explicit exclusion of exceptional cases; thus throughout Section B we shall use homogeneous cardinals in defining the arithmetical operations: the arithmetical sum of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ , for example, will be defined by means of $\text{N}_{0}\text{c}ʻ\alpha$ and $\text{N}_{0}\text{c}ʻ\beta$ , in order to exclude such a determination of the typical ambiguity of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ as would make either of them null. It is true that not only homogeneous cardinals, but also ascending cardinals (cf. *104), are never null. But homogeneous cardinals are much the simplest kind of cardinals that are never null, and are therefore the most convenient.

*103·2. $\vdash : \mu \in \text{N}_{0}\text{C} . \equiv . (\exists \alpha ) . \mu = \text{Nc}ʻ\alpha \cap tʻ\alpha . \equiv . (\exists \alpha ) . \mu = \text{N}_{0}\text{c}ʻ\alpha$

*103·26. $\vdash \colon\ldotp \mu \in \text{NC} . \supset : \alpha \in \mu . \equiv . \text{N}_{0}\text{c}ʻ\alpha = \mu$

*103·27. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\equiv .\mu \in \text{NC}.\alpha \in \mu$

Thus to say that $\mu$ is the homogeneous cardinal of $\alpha$ is equivalent to saying that $\mu$ is a cardinal of which $\alpha$ is a member.

*103·4. $\vdash .\text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha$

*103·41. $\vdash .\text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha \cap tʻ\beta =\text{Nc}(\beta )ʻ\alpha$

*103·01. $\text{N}_{0}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻ\alpha \quad\text{Df}$

*103·1. $\vdash .\text{N}_{0}\text{c}ʻ\alpha =(\text{Nc}ʻ\alpha )_{\alpha }=\text{Nc}(\alpha )ʻ\alpha =\text{Nc}(\alpha _{\alpha })ʻ\alpha \quad[*102·6.(*103·01)]$

*103·11. $\begin{aligned}&\vdash :\beta \in \text{N}_{0}\text{c}ʻ\alpha .\equiv .\beta \text{ sm }\alpha .\beta \in tʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻ\alpha\\ &[*103·1.*102·6]\end{aligned}$

*103·12. $\vdash .\alpha \in \text{N}_{0}\text{c}ʻ\alpha \quad[*103·11.*73·3.*63·103]$

*103·13. $\vdash .\exists !\text{N}_{0}\text{c}ʻ\alpha \quad[*103·12.*10·24]$

This is a legitimate inference from *103·12 because, when $\alpha$ is given, $\text{N}_{0}\text{c}ʻ\alpha$ is typically definite.

*103·14. $\vdash :\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\equiv .\alpha \in \text{N}_{0}\text{c}ʻ\beta .\equiv .\beta \in \text{N}_{0}\text{c}ʻ\alpha .\equiv .\alpha \text{ sm }\beta .\alpha \in tʻ\beta$

Dem. $\begin{array}{l} \vdash .*103·11.\supset \\ \vdash \colon\ldotp \text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\equiv :\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\equiv _{\gamma }.\gamma \text{ sm }\beta .\gamma \in tʻ\beta : &\qquad \text{(1)}\\ [*10·1] \supset :\alpha \text{ sm }\alpha .\alpha \in tʻ\alpha .\equiv .\alpha \text{ sm }\beta .\alpha \in tʻ\beta :\\ [*73·3.*63·103] \supset :\alpha \text{ sm }\beta .\alpha \in tʻ\beta &\qquad \text{(2)}\\ \vdash .*73·32.*63·17\\ \vdash :\alpha \text{ sm }\beta .\alpha \in tʻ\beta .\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\supset .\gamma \text{ sm }\beta .\gamma \in tʻ\beta &\qquad \text{(3)}\\ \vdash .(3)\frac{\beta,\,\alpha}{\alpha,\,\beta}.*73·31.*63·16.\supset \\ \vdash :\alpha \text{ sm }\beta .\alpha \in tʻ\beta .\gamma \text{ sm }\beta .\gamma \in tʻ\beta .\supset .\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).(1).\supset \\ \vdash :\alpha \text{ sm }\beta .\alpha \in tʻ\beta .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(5)}\\ \vdash .(2).(5).*103·11.*73·31.*63·16.\supset \vdash .\text{Prop} \end{array}$

*103·15. $\vdash :\exists !\text{N}_{0}\text{c}ʻ\alpha \cap \text{N}_{0}\text{c}ʻ\beta .\equiv .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*103·13.&\supset \vdash :\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\supset .\exists !\text{N}_{0}\text{c}ʻ\alpha \cap \text{N}_{0}\text{c}ʻ\beta &\qquad \text{(1)}\\ \vdash .*103·14.\supset \vdash :\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\gamma \in \text{N}_{0}\text{c}ʻ\beta .&\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\text{N}_{0}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻ\gamma .\\ [*14·131·144] &\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta :\\ [*10·11·23] &\supset \vdash :\exists !\text{N}_{0}\text{c}ʻ\alpha \cap \text{N}_{0}\text{c}ʻ\beta .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*103·16. $\vdash : \text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta . \equiv . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta$

In this proposition, the equation " $\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$ " must be supposed to hold in any type for which it is significant. Otherwise, we might find a type for which $\text{Nc}ʻ\alpha = \Lambda = \text{Nc}ʻ\beta$ , without having $\text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta$ .

Dem. $\begin{array}{l} \vdash . *103·12 . \supset \vdash : \text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta . &\supset . \alpha \in \text{Nc}ʻ\beta .\\ [*100·31·321] &\supset . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash . *22·481. \supset \vdash : \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta . &\supset . \text{Nc}ʻ\alpha \cap tʻ\alpha = \text{Nc}ʻ\beta \cap tʻ\alpha .\\ [*65·13.(*103·01)] &\supset . \text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash . \text{Prop} \end{array}$

*103·2. $\begin{aligned}&\vdash : \mu \in \text{N}_{0}\text{C} . \equiv . (\exists \alpha ) . \mu = \text{Nc}ʻ\alpha \cap tʻ\alpha . \equiv . (\exists \alpha ). \mu = \text{N}_{0}\text{c}ʻ\alpha\\ &[*71·41.*100·22.(*103·01·02)]\end{aligned}$

*103·21. $\vdash . \text{N}_{0}\text{c}ʻ\alpha \in \text{N}_{0}\text{C} . \text{N}_{0}\text{c}ʻ\alpha \in \text{NC} \quad[*103·2.*100·2·4.*14·28.*65·13]$

In adducing a proposition, such as *100·2, which is concerned with an " $\text{Nc}$ " entirely undetermined in type, any degree of typical determination may be added to our " $\text{Nc}$ ," since an asserted proposition containing an ambiguous " $\text{Nc}$ " is only legitimate if it is true for every possible determination of the ambiguity.

*103·22. $\vdash : \mu \in \text{N}_{0}\text{C} . \supset . \exists !\mu \quad[*103·13·2]$

*103·24. $\vdash . \text{N}_{0}\text{C} \in \text{Cls ex}^{2}\,\text{excl}\quad[*100·43.*103·23.*84·13]$

*103·25. $\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{C} . \supset : \exists !\mu \cap \nu . \equiv . \mu = \nu \quad[*103·24 . *84·135]$

*103·26. $\vdash \colon\ldotp \mu \in \text{NC}. \supset : \alpha \in \mu . \equiv . \text{N}_{0}\text{c}ʻ\alpha = \mu$

Dem. $\begin{array}{l} \vdash .*100·45. &\supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha \in \mu . \supset . \text{Nc}ʻ\alpha = \mu &\qquad \text{(1)}\\ \vdash .*63·22. &\supset \vdash : \alpha \in \mu . \supset . \mu \subset tʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*22·621. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \alpha \in \mu . \supset . \text{Nc}ʻ\alpha \cap tʻ\alpha = \mu .\\ [(*103·01)] &\supset . \text{N}_{0}\text{c}ʻ\alpha = \mu &\qquad \text{(3)}\\ \vdash . *103·12. &\supset \vdash : \text{N}_{0}\text{c}ʻ\alpha = \mu . \supset . \alpha \in \mu &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash . \text{Prop} \end{array}$

*103·27. $\vdash : \mu = \text{N}_{0}\text{c}ʻ\alpha . \equiv . \mu \in \text{NC} . \alpha \in \mu$

Dem. $\begin{array}{l} \vdash .*103·26. \supset \vdash : \mu \in \text{NC} . \mu = \text{N}_{0}\text{c}ʻ\alpha . \equiv . \mu \in \text{NC} . \alpha \in \mu &\qquad \text{(1)}\\ \vdash .(1).*103·21. \supset \vdash . \text{Prop} \end{array}$

*103·28. $\vdash : (\exists \alpha ) . \gamma \text{ sm } \alpha . \mu = \text{N}_{0}\text{c}ʻ\alpha . \equiv . \exists ! \mu . \mu = \text{Nc}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *103·27 . \supset \\ \vdash : (\exists \alpha ) . \gamma \text{ sm } \alpha . \mu = \text{N}_{0}\text{c}ʻ\alpha . &\equiv . (\exists \alpha ) . \gamma \text{ sm } \alpha . \mu \in \text{NC} . \alpha \in \mu .\\ [*100·31] &\equiv . \mu \in \text{NC} . \exists ! \mu \cap \text{Nc}ʻ\gamma .\\ [*100·42·41] &\equiv . \mu \in \text{NC} . \exists ! \mu \cap \text{Nc}ʻ\gamma . \mu = \text{Nc}ʻ\gamma .\\ [*100·41] &\equiv . \exists ! \mu . \mu = \text{Nc}ʻ\gamma : \supset \vdash . \text{Prop} \end{array}$

*103·3. $\vdash :\beta \in tʻ\alpha .\supset .\text{N}_{0}\text{c}ʻ\beta =\text{Nc}(\alpha )ʻ\beta =\text{Nc}(\alpha _{\alpha })ʻ\beta =\text{Nc}ʻ\beta \cap tʻ\alpha$

Dem. $\begin{array}{l} \vdash .*63·16.\supset \vdash :\text{Hp}.\supset .tʻ\beta =tʻ\alpha .\\ [*22·481.(*103·01)] \supset .\text{N}_{0}\text{c}ʻ\beta &=\text{Nc}ʻ\beta \cap tʻ\alpha &\qquad \text{(1)}\\ [*102·6]&=\text{Nc}(\alpha )ʻ\beta &\qquad \text{(2)}\\ [*102·61] &=\text{Nc}(\alpha _{\alpha })ʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

Note that although " $\text{NC}(\alpha )$ " is not definite, " $\text{N}_{0}\text{C}(\alpha )$ " is absolutely definite as soon as $\alpha$ is assigned.

Dem. $\begin{array}{l} \vdash .*103·3.\supset \vdash :\beta \in tʻ\alpha .\mu =\text{N}_{0}\text{c}ʻ\beta .\equiv .\beta \in tʻ\alpha .\mu =\text{Nc}(\alpha _{\alpha })ʻ\beta .\\ [*102·37] \equiv .\mu =\text{Nc}(\alpha _{\alpha })ʻ\beta &\qquad \text{(1)}\\ \vdash .*63·5.(*103·01).\supset \\ \vdash \colon\ldotp \mu =\text{N}_{0}\text{c}ʻ\beta .\supset :\beta \in tʻ\alpha .\equiv .\mu \in t^{2}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\mu \in t^{2}ʻ\alpha .\mu =\text{N}_{0}\text{c}ʻ\beta .\equiv .\mu =\text{Nc}(\alpha _{\alpha })ʻ\beta &\qquad \text{(3)}\\ \vdash .(3).*10·11·281·35.\supset \\ \vdash \colon\ldotp \mu \in t^{2}ʻ\alpha :(\exists \beta ).\mu =\text{N}_{0}\text{c}ʻ\beta :\equiv .(\exists \beta ).\mu =\text{Nc}(\alpha _{\alpha })ʻ\beta .\\ [*102·5] \equiv .\mu \in \text{NC}^\alpha (\alpha ) &\qquad \text{(4)}\\ \vdash .(4).*103·2.\supset \vdash :\mu \in t^{2}ʻ\alpha \cap \text{N}_{0}\text{C}.\equiv .\mu \in \text{NC}^\alpha (\alpha ) &\qquad \text{(5)}\\ \vdash .(5).(*65·02).\supset \vdash .\text{Prop} \end{array}$

*103·31. $\vdash :\exists !\text{Nc}(\alpha _{\beta })ʻ\delta .\supset .\text{Nc}(\alpha _{\beta })ʻ\delta \in \text{N}_{0}\text{C}(\alpha )$

Dem. $\begin{array}{l} \vdash .*102·52.\supset \vdash :\text{Hp}.&\supset .\text{Nc}(\alpha _{\beta })ʻ\delta \in \text{NC}^\alpha (\alpha ).\\ [*103·301] &\supset .\text{Nc}(\alpha _{\beta })ʻ\delta \in \text{N}_{0}\text{C}(\alpha ):\supset \vdash .\text{Prop} \end{array}$

*103·32. $\vdash .\text{NC}^\beta (\alpha )-\iota ʻ\Lambda \subset \text{N}_{0}\text{C}(\alpha )$

Dem. $\begin{array}{l} \vdash .*103·31.\supset \vdash :\mu =\text{Nc}(\alpha _{\beta })ʻ\delta .\exists !\mu .\supset .\mu \in \text{N}_{0}\text{C}(\alpha ) &\qquad \text{(1)}\\ \vdash .(1).*102·5.\supset \vdash .\text{Prop} \end{array}$

In the above proposition, the " $\beta$ " may be omitted, and we may write (cf. *103·33, below) $\vdash .\text{NC}(\alpha )-\iota ʻ\Lambda \subset \text{N}_{0}\text{C}(\alpha ).$

For the $\beta$ is wholly arbitrary, so that any possible determination of $\text{NC}(\alpha )$ makes the above proposition true. We may proceed a step further, and write (*103·34, below) $\vdash .\text{NC}-\iota ʻ\Lambda \subset \text{N}_{0}\text{C}.$

But although we also have $\text{N}_{0}\text{C}\subset \text{NC}-\iotaʻ\Lambda$ , provided the " $\text{NC}$ " on the right is suitably determined, we do not have this always. For example, if " $\text{NC}$ " is determined as $\text{NC}^\alpha (tʻ\alpha )$ , and " $\text{N}_{0}\text{C}$ " as $\text{N}_{0}\text{C}(tʻ\alpha )$ , then $\text{N}_{0}\text{c}ʻtʻ\alpha \in \text{N}_{0}\text{C}-\text{NC}$ .

*103·33. $\vdash . \text{NC}(\alpha ) - \iota ʻ\Lambda \subset \text{N}_{0}\text{C}(\alpha )$

Dem. $\begin{array}{l} \vdash . *4·2 . (*65·02) . \supset \\ \vdash \colon\ldotp \mu \in \text{NC}(\alpha ) - \iota ʻ\Lambda . \equiv : \mu \in \text{NC} . \mu \in t^{2}ʻ\alpha . \exists ! \mu :\\ [*100·4 . *63·5] \equiv : (\exists \beta ) . \mu = \text{Nc}ʻ\beta : \mu \subset tʻ\alpha . \exists ! \mu :\\ [*65·13] \equiv : (\exists \beta ) . \mu = \text{Nc}ʻ\beta \cap tʻ\alpha : \exists ! \mu :\\ [*102·6] \equiv : (\exists \beta ) . \mu = \text{Nc}(\alpha _{\beta })ʻ\beta . \exists ! \mu :\\ [*103·31] \supset : \mu \in \text{N}_{0}\text{C}(\alpha ) \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *100·31·321 . *63·5 . \supset \\ \vdash : \mu = \text{Nc}ʻ\alpha . \beta \in \mu . \supset . \mu = \text{Nc}ʻ\beta \cap tʻ\beta \\ [(*103·01)] = \text{N}_{0}\text{c}ʻ\beta .\\ [*103·2] \supset . \mu \in \text{N}_{0}\text{C} &\qquad \text{(1)}\\ \vdash . (1) . *100·4 . *11·11·35·54 . \supset \vdash . \text{Prop} \end{array}$

Thus every cardinal except $\Lambda$ is a homogeneous cardinal in the appropriate type. Note that although of course every homogeneous cardinal is a cardinal, yet " $\text{N}_{0}\text{C}\subset \text{NC}$ " must not be asserted, because it is possible to determine the ambiguity of " $\text{NC}$ " in such a way as to make this false. Hence we do not get $\text{NC} - \iota ʻ\Lambda =\text{N}_{0}\text{C}$ .

*103·35. $\vdash : \Lambda {\sim} \in \text{NC}^\alpha (\beta ) . \supset . \text{NC}^\beta (\alpha ) - \iota ʻ\Lambda = \text{N}_{0}\text{C}(\alpha ) \quad[*102·55 . *103·301]$

The hypothesis of this proposition is satisfied, as will appear later, if the type of $\beta$ is in what we may call the direct ascent from that of $\alpha$ , i.e. if it can be reached from $\alpha$ by a finite number of steps each of which takes us from a type $\tau$ to either $\text{Cl}ʻ\tau$ or $\text{Rl}ʻ(\tau \uparrow \tau)$ . Thus in such a case the cardinals (other than $\Lambda$ ) which go from $tʻ\beta$ to $tʻ\alpha$ are the same as those which begin and end within $tʻ\alpha$ . It will also appear that in such a case $\Lambda$ always is a member of $\text{NC}^\beta (\alpha )$ . If two cardinals which are not equal must always be one greater and the other less, then $\Lambda \in \text{NC}^\beta (\alpha )$ is the condition for $\text{N}_{0}\text{c}ʻtʻ\beta \gt \text{Nc}(\beta )ʻtʻ\alpha$ . In that case, we shall have $\Lambda \in \text{NC}^\beta (\alpha ). \supset . \Lambda {\sim} \in \text{NC}^\alpha(\beta )$ . But there is no known proof that of two different cardinals one must be the greater, except by assuming the multiplicative axiom and proving thence (by Zermelo's theorem) that every class can be well-ordered (cf. *258).

*103·4. $\vdash . \text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *37·1 . \supset \\ \vdash : \delta \in \text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha . &\equiv . (\exists \gamma ) . \gamma \text{ sm } \alpha . \gamma \in tʻ\alpha . \delta \text{ sm } \gamma .\\ [*102·84] &\equiv . \delta \text{ sm } \alpha : \supset \vdash . \text{Prop} \end{array}$

*103·41. $\vdash . \text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha \cap tʻ\beta = \text{Nc}(\beta )ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *103·4 . \supset \vdash .\\ \text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha \cap tʻ\beta &= \text{Nc}ʻ\alpha \cap tʻ\beta \\ [*102·6] &= \text{Nc}(\beta )ʻ\alpha . \supset \vdash . \text{Prop} \end{array}$

*103·42. $\vdash :\beta \text{ sm } \alpha . \equiv .\text{Nc}(\beta )ʻ\alpha = \text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*100·321.\supset \vdash :\beta \text{ sm } \alpha .&\supset .\text{Nc}ʻ\alpha = \text{Nc}ʻ\beta .\\ [*22·481] &\supset .\text{Nc}ʻ\alpha \cap tʻ\beta = \text{Nc}ʻ\beta \cap tʻ\beta .\\ [*102·6.(*103·01)] &\supset .\text{Nc}(\beta )ʻ\alpha = \text{N}_{0}\text{c}ʻ\beta &\qquad \text{(1)}\\ \vdash .*103·12.\supset \vdash :\text{Nc}(\beta )ʻ\alpha = \text{N}_{0}\text{c}ʻ\beta .&\supset .\beta \in \text{Nc}(\beta )ʻ\alpha .\\ [*100·31] &\supset .\beta \text{ sm } \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*103·43. $\vdash :\mu \in \text{NC}.\supset .\text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu = \mu$

Dem. $\begin{array}{l} \vdash .*37·29. &\supset \vdash :\mu = \Lambda .\supset .\text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu = \Lambda &\qquad \text{(1)}\\ \vdash .*103·27. \supset \vdash :\mu \in \text{NC}.\alpha \in \mu .&\supset .\mu = \text{N}_{0}\text{c}ʻ\alpha .t_{0}ʻ\mu = tʻ\alpha .\\ [*103·41] &\supset .\text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu = \text{Nc}(\alpha )ʻ\alpha \\ [*103·3·27] &= \mu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*103·44. $\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{C}.\supset :\mu = \text{ sm }ʻʻ\nu .\equiv .\nu = \text{ sm }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*100·53. &\supset \vdash \colon\ldotp \exists !\mu .\exists !\nu .\mu ,\nu \in \text{NC}.\supset :\mu = \text{ sm }ʻʻ\nu .\equiv .\nu = \text{ sm }ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*103·27·2.&\supset \vdash :\text{Hp}.\supset .\exists !\mu .\exists !\nu .\mu ,\nu \in \text{NC} &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*101·11·12.&\supset \vdash .0\in \text{NC}.\exists !0.\\ [*103·34]&\supset \vdash .0\in \text{N}_{0}\text{C}.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*101·21·241.&\supset \vdash .1\in \text{NC}.\exists !1.\\ [*103·34] &\supset \vdash .1\in \text{N}_{0}\text{C}.\supset \vdash .\text{Prop} \end{array}$

0 and 1 are the only cardinals of which the above property can be proved universally with our assumptions. If (as is possible so far as our assumptions go) the lowest type is a unit class, we shall have in that type (though in no other) $2 = \Lambda$ , so that in that type $2 {\sim} \in \text{N}_{0}\text{C}$ .

In this number we have to consider cardinals derived from a relation of similarity which goes from the type of $\alpha$ to that of $tʻ\alpha$ , or to that of $t^{2}ʻ\alpha$ . The propositions to be proved can be extended, by a mere repetition of the proofs, to $t^{3}ʻ\alpha$ , $t^{4}ʻ\alpha$ , etc. This extension must, however, be made afresh in each instance; we cannot prove that it can be made generally, because mathematical induction cannot be applied to the series $t_{0}ʻ\alpha,\quad tʻ\alpha,\quad t^{2}ʻ\alpha,\quad t^{3}ʻ\alpha ,\ldotp\ldots$

Ascending cardinals, though less important than homogeneous cardinals, yet have considerable importance in arithmetic, because $\text{Nc}ʻ\alpha \times \text{Nc}ʻ\beta$ and $(\text{Nc}ʻ\alpha)^{\text{Nc}ʻ\beta }$ are defined as the cardinals of classes of higher types than those of $\alpha$ and $\beta$ , and the same applies to the product of the cardinals of members of a class of classes. In these cases, however, we also need cardinals of relational types, which will be dealt with in *106.

*104·01. $\text{N}^{1}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻtʻ\alpha \quad\text{Df}$

with similar definitions of $\text{N}^{2}\text{c}ʻ\alpha$ , etc. Thus $\text{N}^{1}\text{c}ʻ\alpha$ consists of all classes similar to $\alpha$ but of the next higher type, i.e. it is the cardinal number of $\alpha$ in the type next above that of $\text{N}_{0}\text{c}ʻ\alpha$ ; $\text{N}^{1}\text{C}$ is the class of all such cardinals as $\text{N}^{1}\text{c}ʻ\alpha$ , and is a typically ambiguous symbol, though $\text{N}^{1}\text{c}ʻ\alpha$ is typically definite when $\alpha$ is given; $\mu ^{(1)}$ (if $\mu$ is a cardinal which is not null) is the "same" cardinal in the next higher type, so that, e.g., if $\mu$ is 1 determined as consisting of unit classes of individuals, $\mu ^{(1)}$ will be 1 determined as consisting of unit classes of classes of individuals. (When $\mu$ is not an existent cardinal, $\mu ^{(1)}$ is unimportant.)

*104·12. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\gamma \in \text{N}^{1}\text{c}ʻ\beta .\supset .\gamma \in \text{N}^{2}\text{c}ʻ\alpha$

*104·24. $\vdash :\mu = \text{N}^{1}\text{c}ʻ\alpha .\supset .\mu = \text{N}_{0}\text{c}ʻ\iota ʻʻ\alpha = \text{N}_{0}\text{c}ʻ\hat{\beta} \{(\exists y).y\in \alpha .\beta = \iota ʻx\cup \iota ʻy\}$

*104·26. $\vdash :\mu = \text{N}_{0}\text{c}ʻ\alpha .\supset .\mu ^{(1)} = \text{N}_{0}\text{c}ʻ\iota ʻʻ\alpha = \text{N}^{1}\text{c}ʻ\alpha$

*104·27. $\vdash \colon\ldotp \mu \in \text{NC}.\supset :\mu = \text{N}_{0}\text{c}ʻ\alpha . \equiv .\mu ^{(1)} = \text{N}^{1}\text{c}ʻ\alpha$

*104·35. $\vdash .\text{N}^{2}\text{C}\subset \text{N}^{1}\text{C}.\text{N}^{2}\text{C}\subset \text{N}_{0}\text{C}$

*104·43. $\vdash :tʻ\alpha = tʻ\beta .\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda$

*104·01. $\text{N}^{1}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻtʻ\alpha \quad\text{Df}$

This defines the cardinal number of $\alpha$ in the next type above that of $\text{N}_{0}\text{c}ʻ\alpha$ ; thus $\text{N}^{1}\text{c}ʻ\alpha$ consists of all classes similar to $\alpha$ and of the next type above that of $\alpha$ .

*104·011. $\text{N}^{2}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻt^{2}ʻ\alpha \quad\text{Df}$

*104·02. $\text{N}^{1}\text{C} = \text{D}ʻ\text{N}^{1}\text{c} \quad\text{Df}$

$\text{N}^{1}\text{C}$ , like $\text{N}_{0}\text{C}$ , is typically ambiguous; but $\text{N}^{1}\text{C}(\alpha )$ is typically definite.

*104·021. $\text{N}^{2}\text{C} = \text{D}ʻ\text{N}^{2}\text{c} \quad\text{Df}$

Here, if $\mu$ is a cardinal, $\mu ^{(1)}$ is the same cardinal in the next higher type. For example, if $\mu$ is couples of individuals, $\mu ^{(1)}$ is couples of classes of individuals.

*104·1. $\begin{aligned}&\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha . \equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻtʻ\alpha . \equiv .\beta \in \text{Nc}ʻ\alpha .\beta \subset tʻ\alpha \\ &[*63·5. (*104-01)]\end{aligned}$

*104·101. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha . \equiv .\beta \text{ sm } \alpha .\beta \subset tʻ\alpha \quad[*100·31.*104·1]$

*104·102. $\vdash .\text{N}^{1}\text{c}ʻ\alpha = \text{Nc}(tʻ\alpha )ʻ\alpha = \text{Nc} {(tʻ\alpha )_{\alpha }}ʻ\alpha \quad[*102·6.(*104·01)]$

*104·11. $\begin{aligned}&\vdash :\beta \in \text{N}^{2}\text{c}ʻ\alpha . \equiv .\beta \in \text{Nc}ʻ\alpha . \beta \in tʻt^{2}ʻ\alpha . \equiv .\beta \in \text{Nc}ʻ\alpha .\beta \subset t^{2}ʻ\alpha\\ &[*63·5.(*104·011)]\end{aligned}$

*104·111. $\vdash :\beta \in \text{N}^{2}\text{c}ʻ\alpha . \equiv .\beta \text{ sm } \alpha .\beta \subset t^{2}ʻ\alpha \quad[*100·31.*104·11]$

*104·112. $\vdash .\text{N}^{2}\text{c}ʻ\alpha = \text{Nc}(t^{2}ʻ\alpha )ʻ\alpha = \text{Nc}{(t^{2}ʻ\alpha )_{\alpha }}ʻ\alpha \quad[*102·6.(*104·011)]$

*104·12. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\gamma \in \text{N}^{1}\text{c}ʻ\beta .\supset .\gamma \in \text{N}^{2}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·1.\supset \vdash :\text{Hp}.&\supset .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻtʻ\alpha .\gamma \in \text{Nc}ʻ\beta .\gamma \in tʻtʻ\beta .\\ [*100·32] &\supset .\gamma \in \text{Nc}ʻ\alpha .\beta \in tʻtʻ\alpha .\gamma \in tʻtʻ\beta .\\ [*63·16] &\supset .\gamma \in \text{Nc}ʻ\alpha .tʻ\beta = tʻtʻ\alpha .\gamma \in tʻtʻ\beta .\\ [*13·12] &\supset .\gamma \in \text{Nc}ʻ\alpha .\gamma \in tʻtʻtʻ\alpha .\\ [*104·11] &\supset .\gamma \in \text{N}^{2}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*104·121. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\gamma \in \text{N}^{2}\text{c}ʻ\alpha .\supset .\gamma \in \text{N}^{1}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*104·102·112.\supset \vdash :\text{Hp}.&\supset .\beta \in \text{Nc}\{(tʻ\alpha)_{\alpha}\} ʻ\alpha .\gamma \in \text{Nc}\{(t^{2}ʻ\alpha)_{\alpha}\}ʻ\alpha.\\ [*102·41] &\supset .\gamma \in \text{Nc}\{(t^{2}ʻ\alpha )_{tʻ\alpha}\}ʻ\beta &\qquad \text{(1)}\\ \vdash .*104·1.\supset \vdash :\text{Hp}.&\supset .\beta \in tʻtʻ\alpha .\\ [*63*16] &\supset .tʻ\beta = tʻtʻ\alpha .\\ [(*65·11)] &\supset .\text{Nc}\{(t^{2}ʻ\alpha )_{tʻ\alpha}\} = \text{Nc}\{(tʻ\beta)_{\beta}\} &\qquad \text{(2)}\\ \vdash .(1).(2).*104·102.\supset \vdash .\text{Prop} \end{array}$

*104·122. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\supset .\text{N}^{1}\text{c}ʻ\beta = \text{N}^{2}\text{c}ʻ\alpha \quad[*104·12·121]$

*104·123. $\vdash :\text{N}_{0}\text{c}ʻ\beta = \text{N}^{1}\text{c}ʻ\alpha .\supset . \text{N}^{1}\text{c}ʻ\beta = \text{N}^{2}\text{c}ʻ\alpha \quad[*104·122.*103·26]$

*104·13. $\vdash :\mu \in \text{N}^{1}\text{C}. \equiv .(\exists \alpha ).\mu = \text{N}^{1}\text{c}ʻ\alpha \quad[*100·122.*71·41.(*104·02)]$

*104·14. $\begin{aligned}&\vdash :\delta \in \mu ^{(1)}. \equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm } \gamma .\delta \in tʻ\mu . \equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm } \gamma .\delta \subset tʻ\gamma\\ &[*37·1.*63·22.(*104·03)]\end{aligned}$

*104·141. $\vdash :\mu \in \text{NC}.\exists !\mu .\supset .\mu ^{(1)}\in \text{NC} \quad[*100·52]$

When the hypothesis " $\exists !\mu$ " is omitted, this proposition is still true, but with a difference. E.g. let us put $\mu = \text{Nc}(\alpha )ʻtʻ\alpha .$ Then $\mu = \Lambda .\mu ^{(1)} = \Lambda$ . Thus $\mu^{(1)} \neq \text{Nc}(tʻ\alpha)ʻtʻ\alpha$ . But we still have $\mu ^{(1)} = \text{Nc}(tʻ\alpha )ʻt^{2}ʻ\alpha .$ Thus $\mu^{(1)}\in \text{NC}$ , but $\mu^{(1)}$ is not the same cardinal as $\mu$ in a higher type, i.e. there are classes whose cardinal in one type is $\mu$ , but whose cardinal in the next higher type is not $\mu ^{(1)}$ .

*104·142. $\vdash :\mu \in \text{NC}.\exists !\mu .\supset .\mu ^{(2)}\in \text{NC} \quad[*100·52]$

*104·15. $\vdash :\mu \in \text{N}^{2}\text{C}. \equiv .(\exists \alpha ).\mu = \text{N}^{2}\text{c}ʻ\alpha \quad[*100·22.*71·41. (*104·021)]$

Dem. $\begin{array}{l} \vdash .*63·621.&\supset \vdash x\in \alpha .\supset _{x}.\iota ʻx\in tʻ\alpha :\\ [*37·61] &\supset \vdash .\iotaʻʻ\alpha \subset tʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*100·6.*104·1.\supset \vdash . \text{Prop} \end{array}$

*104·201. $\vdash :\beta \in \text{N}_{0}\text{c}ʻ\alpha .\supset .\iotaʻʻ\beta \in \text{N}^{1}\text{c}ʻ\alpha .\text{N}^{1}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*100·31·321.\supset \vdash :\text{Hp}.&\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash .*103·11. \supset \vdash :\text{Hp}.&\supset .\beta \in tʻ\alpha .\\ [*63·16] &\supset .tʻ\alpha =tʻ\beta .\\ [*30·37] &\supset .tʻtʻ\alpha =tʻtʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).(*104·01).&\supset \vdash .\text{N}^{1}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta &\qquad \text{(3)}\\ \vdash .(3).*104·2.\supset \vdash .\text{Prop} \end{array}$

It follows from this proposition that ascending cardinals are never null. The proof has to be made separately for each kind of ascending cardinal, i.e. $\text{N}^{1}\text{C}$ , $\text{N}^{2}\text{C}$ , etc.

*104·211. $\vdash .\exists !\text{N}^{1}\text{c}ʻ\alpha \cap \text{Cl}ʻ1 \quad[*104·2.*52·3]$

*104·23. $\vdash .\hat{\beta} \{(\exists y).y\in \alpha .\beta =\iota ʻx\cup \iota ʻy\}\in \text{N}^{1}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*51·16. &\supset \vdash :y\in \alpha .\supset y\in \alpha \cap (\iota ʻx\cup \iota ʻy).\\ [*63·16] &\supset .\iota ʻx\cup \iota ʻy\in tʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*10·11·23.&\supset \vdash .\hat{\beta} \{(\exists y).y\in \alpha .\beta =\iota ʻx\cup \iota ʻy\}\subset tʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*100·61.*104·1.\supset \vdash .\text{Prop} \end{array}$

*104·231. $\vdash :\text{N}^{1}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*104·2.\supset \vdash :\text{Hp}.&\supset .\iotaʻʻ\beta \in \text{N}_{1}\text{c}ʻ\alpha .\\ [*104·101] &\supset .\iotaʻʻ\beta \text{ sm }\alpha .\iotaʻʻ\beta \subset tʻ\alpha .\\ [*73·41.*63·21·64] &\supset .\beta \text{ sm }\alpha .tʻ\beta =tʻ\alpha .\\ [*103·11.*63·16] &\supset .\beta \in \text{N}_{0}\text{c}ʻ\alpha .\\ [*103·14] &\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta :\supset \vdash .\text{Prop} \end{array}$

*104·232. $\begin{aligned}&\vdash :\text{N}^{1}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta .\equiv .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\equiv .\beta \in \text{N}_{0}\text{c}ʻ\alpha\\ &[*104·231·201.*103·14]\end{aligned}$

*104·24. $\begin{aligned}&\vdash :\mu =\text{N}^{1}\text{c}ʻ\alpha .\supset .\mu =\text{N}_{0}\text{c}ʻ\iotaʻʻ\alpha =\text{N}_{0}\text{c}ʻ\hat{\beta} \{(\exists y).y\in \alpha .\beta =\iota ʻx\cup \iota ʻy\}\\ &[*104·2·23.*103·26]\end{aligned}$

*104·25. $\vdash .\text{N}^{1}\text{C}\subset \text{N}_{0}\text{C} \quad[*104·24·13]$

This proposition holds for each possible determination of the typical ambiguities, i.e. for every $\alpha$ we have $\begin{aligned} \text{N}^{1}\text{C}(tʻ\alpha )&\subset \text{N}_{0}\text{C}(tʻ\alpha ).\\ \text{We do not have}\qquad \text{N}^{1}\text{C}(tʻ\alpha )&=\text{N}_{0}\text{C}(tʻ\alpha ),\\ \text{because}\qquad\qquad\qquad \text{N}_{0}\text{c}ʻtʻ\alpha &\in \text{N}_{0}\text{C}(tʻ\alpha )-\text{N}^{1}\text{C}(tʻ\alpha ). \end{aligned}$

*104·251. $\vdash .\Lambda {\sim}\in \text{N}^{1}\text{C} \quad[*104·25.*103·23]$

*104·252. $\vdash .\text{N}^{1}\text{C}\in \text{Cls ex}^{2}\,\text{excl} \quad[*104·25.*103·24.*84·26]$

*104·26. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu ^{(1)}=\text{N}_{0}\text{c}ʻ\iotaʻʻ\alpha =\text{N}^{1}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·14.*103·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\delta \in \mu ^{(1)}.&\equiv .(\exists \gamma ).\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\delta \text{ sm }\gamma .\delta \subset tʻ\gamma . &\qquad \text{(1)}\\ [*73·32.*63·16] &\supset .\delta \text{ sm }\alpha .\delta \subset tʻ\alpha .\\ [*104·101] &\supset .\delta \in \text{N}^{1}\text{c}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*104·101.\supset \\ \vdash :\delta \in \text{N}^{1}\text{c}ʻ\alpha . &\supset .\delta \text{ sm }\alpha .\delta \subset tʻ\alpha .\\ [*73·3.*63·103]&\supset .\alpha \text{ sm }\alpha .\alpha \in tʻ\alpha .\delta \text{ sm }\alpha .\delta \subset tʻ\alpha .\\ [*10·24] &\supset .(\exists \gamma ).\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\delta \text{ sm }\gamma .\delta \subset tʻ\gamma &\qquad \text{(3)}\\ \vdash .(3).(1).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\delta \in \text{N}^{1}\text{c}ʻ\alpha .\supset .\delta \in \mu ^{(1)} &\qquad \text{(4)}\\ \vdash .(2).(4).*104·24.\supset \vdash .\text{Prop} \end{array}$

*104·261. $\vdash :\mu ^{(1)}=\text{N}^{1}\text{c}ʻ\alpha .\supset .\mu \subset \text{N}_{0}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·14·101.\supset \\ \vdash \colon\ldotp \text{Hp}. \supset :(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\delta &\subset tʻ\gamma .\equiv _{\delta }.\delta \text{ sm }\alpha .\delta \subset tʻ\alpha :\\ [*10·23] \supset :\gamma \in \mu .\delta \text{ sm }\gamma .\delta \subset tʻ\gamma .&\supset _{\gamma ,\delta }.\delta \text{ sm }\alpha .\delta \subset tʻ\alpha .\\ [*4·7] &\supset _{\gamma ,\delta }.\delta \text{ sm }\alpha .\delta \text{ sm }\gamma .\delta \subset tʻ\alpha .\delta \subset tʻ\gamma .\\ [*73·32.*63·13] &\supset _{\gamma ,\delta }.\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\\ [*103·11] &\supset _{\gamma ,\delta }.\gamma \in \text{N}_{0}\text{c}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*10·23·35.*104·101.\supset \\ \vdash \colon\ldotp \text{Hp}. \supset :\gamma \in \mu .\exists !\text{N}^{1}\text{c}ʻ\gamma .\supset _{\gamma }.\gamma \in \text{N}_{0}\text{c}ʻ\alpha :\\ [*104·21] \supset :\gamma \in \mu .\supset _{\gamma }.\gamma \in \text{N}_{0}\text{c}ʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*104·262. $\vdash :\mu \in \text{NC}.\mu ^{(1)}=\text{N}^{1}\text{c}ʻ\alpha .\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·21.\supset \vdash :\text{Hp}.&\supset .\exists !\mu ^{(1)}.\\ [*37·29.\text{Transp}] &\supset .\exists !\mu &\qquad \text{(1)}\\ \vdash .*103·26.&\supset \vdash :\text{Hp}.\gamma \in \mu .\supset .\mu =\text{N}_{0}\text{c}ʻ\gamma &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.&\supset .(\exists \gamma ).\mu =\text{N}_{0}\text{c}ʻ\gamma .\\ [*104·26.\text{Hp}] &\supset .(\exists \gamma ).\mu =\text{N}_{0}\text{c}ʻ\gamma .\text{N}^{1}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\gamma .\\ [*104·231] &\supset .(\exists \gamma ).\mu =\text{N}_{0}\text{c}ʻ\gamma .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\\ [*13·172] &\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*73·41.*37·1.&\supset \vdash :\text{Hp}.\supset .\iotaʻʻ\alpha \in \text{ sm }ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*63·64. &\supset \vdash :\text{Hp}.\supset .\iotaʻʻ\alpha \in tʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2).(*104·03).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*104·263. &\supset \vdash :\exists !\mu .\supset .\exists !\mu ^{(1)} &\qquad \text{(1)}\\ \vdash .*37·29.\text{Transp}.(*104·03).&\supset \vdash :\exists !\mu ^{(1)}.\supset .\exists !\mu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*104·27. $\vdash \colon\ldotp \mu \in \text{NC}.\supset :\mu =\text{N}_{0}\text{c}ʻ\alpha .\equiv .\mu ^{(1)}=\text{N}^{1}\text{c}ʻ\alpha \quad[*104·26·262]$

*104·28. $\vdash :\mu \in \text{NC}-\iota ʻ\Lambda .\supset .\mu ^{(1)}\in \text{N}^{1}\text{C} \quad[*104·26.*103·34]$

*104·29. $\vdash :\nu \in \text{N}^{1}\text{C}.\equiv .(\exists \mu )·\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)}$

Dem. $\begin{array}{l} \vdash .*104·26. \supset \vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\mu ^{(1)}.\supset .\nu =\text{N}^{1}\text{c}ʻ\alpha :\\ [*10·11·28] \supset \vdash :(\exists \alpha ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\mu ^{(1)}.\supset .(\exists \alpha ).\nu =\text{N}^{1}\text{c}ʻ\alpha :\\ [*103·2.*104·13] \supset \vdash :\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)}.\supset .\nu \in \text{N}^{1}\text{C} &\qquad \text{(1)}\\ \vdash .*104·26.*103·2.\supset \\ \vdash :\nu =\text{N}^{1}\text{c}ʻ\alpha .\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\nu =\mu ^{(1)}.\mu \in \text{N}_{0}\text{C} &\qquad \text{(2)}\\ \vdash .(2).*10·11·28·35.\supset \\ \vdash \colon\ldotp \nu =\text{N}^{1}\text{c}ʻ\alpha :(\exists \mu ).\mu =\text{N}_{0}\text{c}ʻ\alpha :\supset .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)} &\qquad \text{(3)}\\ \vdash .(3).*100·2.*14·204.\supset \\ \vdash :\nu =\text{N}^{1}\text{c}ʻ\alpha .\supset .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)} &\qquad \text{(4)}\\ \vdash .(4).*10·11·23.*104·13.\supset \\ \vdash :\nu \in \text{N}^{1}\text{C}.\supset .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)} &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*104·2.&\supset \vdash .\iotaʻʻ\alpha \in \text{N}^{1}\text{c}ʻ\alpha .\iotaʻʻ\iotaʻʻ\alpha \in \text{N}^{1}\text{c}ʻ\iotaʻʻ\alpha .\\ [*104·12] &\supset \vdash .\iotaʻʻ\iotaʻʻ\alpha \in \text{N}^{2}\text{c}ʻ\alpha \end{array}$

*104·311. $\vdash .\text{N}^{2}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\iotaʻʻ\iotaʻʻ\alpha =\text{N}^{1}\text{c}ʻ\iotaʻʻ\alpha \quad[*104·3·2.*103·26]$

*104·32. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu ^{(2)}=\text{N}_{0}\text{c}ʻ\iotaʻʻ\iotaʻʻ\alpha =\text{N}^{1}\text{c}ʻ\iotaʻʻ\alpha =\text{N}^{2}\text{c}ʻ\alpha =\{\mu ^{(1)}\}^{(1)}$

Dem. $\begin{array}{l} \vdash .*104·26.\supset \vdash :\text{Hp}.\supset .\{\mu ^{(1)}\}^{(1)}&=\text{N}_{0}\text{c}ʻ\iotaʻʻ\iotaʻʻ\alpha &\qquad \text{(1)}\\ [*104·311] &=\text{N}^{2}\text{c}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*103·11.(*104·031).\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\delta \in \mu ^{(2)}.&\equiv .(\exists \gamma ).\gamma \text{ sm }\alpha .\gamma \in tʻ\alpha .\delta \text{ sm }\gamma .\delta \in tʻt^{2}ʻ\gamma .\\ [*102·84.*63·16] &\equiv .\delta \text{ sm }\alpha .\delta \in tʻt^{2}ʻ\alpha .\\ [*104·11] &\equiv .\delta \in \text{N}^{2}\text{c}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*104·24.\supset \vdash .\text{Prop} \end{array}$

*104·33. $\vdash \colon\ldotp \mu \in \text{NC}.\supset :\mu =\text{N}_{0}\text{c}ʻ\alpha .\equiv .\mu ^{(2)}=\text{N}^{2}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·27.\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu =\text{N}_{0}\text{c}ʻ\alpha .&\equiv .\mu ^{(1)}=\text{N}^{1}\text{c}ʻ\alpha .\\ [*104·24] &\equiv .\mu ^{(1)}=\text{N}_{0}\text{c}ʻ\iotaʻʻ\alpha .\\ [*104·27·141.*103·13] &\equiv .\{\mu ^{(1)}\}^{(1)}=\text{N}^{1}\text{c}ʻ\iotaʻʻ\alpha .\\ [*104·32·24] &\equiv .\mu ^{(2)}=\text{N}^{2}\text{c}ʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*104·34. $\vdash :\varpi \in \text{N}^{2}\text{C}.\equiv .(\exists \nu ).\nu \in \text{N}^{1}\text{C}.\varpi =\nu ^{(1)}.\equiv .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\varpi =\mu ^{(2)}$

Dem. $\begin{array}{l} \vdash .*104·32.\supset \\ \vdash :\varpi =\text{N}^{2}\text{c}ʻ\alpha .\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\varpi =\mu ^{(2)}.\mu \in \text{N}_{0}\text{C} &\qquad \text{(1)}\\ \vdash .(1).*100·2.*10·11·28·35.\supset\\ \vdash :(\exists \alpha ).\varpi =\text{N}^{2}\text{c}ʻ\alpha .\supset .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\varpi =\mu ^{(2)} &\qquad \text{(2)}\\ \vdash *104·32. \supset \vdash :\mu =\text{N}_{0}\text{C}ʻ\alpha .\varpi =\mu ^{(2)}.\supset .\varpi =\text{N}^{2}\text{c}ʻ\alpha .\\ [*104·15.*103·2]\supset \vdash :\mu \in \text{N}_{0}\text{C}.\varpi =\mu ^{(2)}.\supset .\varpi \in \text{N}^{2}\text{C} &\qquad \text{(3)}\\ \vdash (2).(3). \supset \vdash :\varpi \in \text{N}^{2}\text{C}.\equiv .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\varpi =\mu ^{(2)}. &\qquad \text{(4)}\\ [*104·32] \equiv .(\exists \mu ).\mu \in \text{N}_{0}\text{C}.\varpi =\{\mu ^{(1)}\}^{(1)}.\\ [*13·195] \equiv .(\exists \mu ,\nu ).\mu \in \text{N}_{0}\text{C}.\nu =\mu ^{(1)}.\varpi =\nu^{(1)}. [*104·29] \equiv .(\exists \nu).\nu \in \text{N}^{1}\text{C}.\varpi =\nu ^{(1)} &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*104·35. $\vdash .\text{N}^{2}\text{C}\subset \text{N}^{1}\text{C}.\text{N}^{2}\text{C}\subset \text{N}_{0}\text{C} \quad[*104·311·13·15]$

*104·36. $\vdash :\gamma \in \text{N}^{2}\text{c}ʻ\alpha .\gamma \in \text{N}^{1}\text{c}ʻ\beta .\supset .\beta \in \text{N}^{1}\text{c}ʻ\alpha .\text{N}^{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*104·1·11.\supset \vdash :\text{Hp}.&\supset .\gamma \in \text{Nc}ʻ\alpha .\gamma \in tʻt^{2}ʻ\alpha .\gamma \in \text{Nc}ʻ\beta .\gamma \in tʻtʻ\beta .\\ [*100·34.*63·16] & \supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .tʻt^{2}ʻ\alpha =tʻtʻ\beta .\\ [*63·35·15] &\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .t^{2}ʻ\alpha =tʻ\beta .\\ [(*104·01.*103·01)] &\supset .\text{N}^{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*103·12.\supset \vdash .\text{Prop} \end{array}$

*104·37. $\vdash :\text{N}^{2}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta .\equiv .\text{N}^{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*104·21.\supset \vdash :\text{N}^{2}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\beta .&\supset .\exists !\text{N}^{2}\text{c}ʻ\alpha \cap \text{N}^{1}\text{c}ʻ\beta.\\ [*104·36] &\supset .\text{N}^{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*104·123.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the proof that, given any two cardinals $\mu$ and $\nu$ , of the same type, we can find two mutually exclusive classes one of which has $\mu$ terms while the other has $\nu$ terms. The proof requires that we should raise the types of both $\mu$ and $\nu$ one degree above[Pg 49] that in which they were originally given, i.e. that we should turn $\mu$ and $\nu$ into $\mu ^{(1)}$ and $\nu ^{(1)}$ . Thus, for example, suppose the total number of individuals in the universe were finite (a supposition which is consistent with our primitive propositions), and suppose $\mu$ were this number. Then unless $\nu =0$ , a class of $\nu$ individuals will be an existent sub-class of the only class which consists of $\mu$ individuals, and therefore we shall have $\alpha \in \mu .\beta \in \nu .\supset _{\alpha ,\beta }.\exists !\alpha \cap \beta .$

But if we consider classes of $\mu$ classes and $\nu$ classes, we shall always be able to find a $\gamma$ and a $\delta$ such that $\gamma \in \mu ^{(1)}.\delta \in \nu^{(1)}.\gamma \cap \delta =\Lambda .$

The existence of such a $\gamma$ and $\delta$ is important in connection with the arithmetical operations, and is therefore proved here.

*104·4. $\begin{aligned}\vdash \colon\ldotp x\in \alpha .x\neq y.x\neq z.y\neq z:&(w).w_{\iota }=\hat{\alpha}\hat{u}(\alpha =\iota ʻw\cup \iota ʻu):\supset .\\ &x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\in \text{N}^{1}\text{c}ʻ\alpha \cap \text{Cl}ʻ2\end{aligned}$

Dem. $\begin{array}{l} \vdash .*100·61. &\supset \vdash :\text{Hp}.\supset .x_{\iota }ʻʻ(\alpha -\iota ʻx)\text{ sm }(\alpha -\iota ʻx) &\qquad \text{(1)}\\ \vdash .*73·43. &\supset \vdash :\text{Hp}.\supset .\iota ʻy_{\iota }ʻz\text{ sm }\iota ʻx &\qquad \text{(2)}\\ \vdash .*51·232.\text{Transp}.&\supset \vdash :\text{Hp}.\supset .x{\sim}\in y_{\iota }ʻz &\qquad \text{(3)}\\ \vdash .*51·232. &\supset \vdash :\text{Hp}.\gamma \in x_{\iota }ʻʻ(\alpha -\iota ʻx).\supset .x\in \gamma &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash :\text{Hp}.&\supset .y_{\iota }ʻz{\sim}\in x_{\iota }ʻʻ(\alpha -\iota ʻx).\\ [*51·211] &\supset .x_{\iota }ʻʻ(\alpha -\iota ʻx)\cap \iota ʻy_{\iota }ʻz=\Lambda &\qquad \text{(5)}\\ \vdash .*51·21·211. &\supset \vdash .(\alpha -\iota ʻx)\cap \iota ʻx=\Lambda &\qquad \text{(6)}\\ \vdash .(1).(2).(5).(6).*73·71.*51·221.\supset \\ \vdash :\text{Hp}.&\supset .x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\text{ sm }\alpha &\qquad \text{(7)}\\ \vdash .*63·101·16.*51·232·16.\supset \\ \vdash :\text{Hp}. &\supset .tʻx=tʻy.x\in \alpha .y\in y_{\iota }ʻz.y_{\iota }ʻz\in x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz.\\ [*63·53·2] &\supset .t^{2}ʻx=tʻ\alpha .t^{2}ʻy=t_{0}ʻ\{x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota}ʻz\}.t^{2}ʻx=t^{2}ʻy.\\ [*13·17] &\supset .tʻ\alpha =t_{0}ʻ\{x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\}.\\ [*63·105] &\supset .x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\subset tʻ\alpha &\qquad \text{(8)}\\ \vdash .*54·26.&\supset \vdash :\text{Hp}.\supset .x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\subset 2 &\qquad \text{(9)}\\ \vdash .(7).(8).(9).*104·101.\supset \vdash .\text{Prop} \end{array}$

*104·41 $\begin{aligned}\vdash \colon\ldotp tʻ\alpha =tʻ\beta :(\exists x,y,z).x\in \alpha .&x\neq y.x\neq z.y\neq z:\supset .\\ &(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*104·4·2.*52·3.\supset \\ \vdash :\text{Hp}.\text{Hp}*104·4.&\supset .(\exists x,y,z).x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz\in \text{N}^{1}\text{c}ʻ\alpha \cap \text{Cl}ʻ2.\\ &\iotaʻʻ\beta \in \text{N}^{1}\text{c}ʻ\beta \cap \text{Cl}ʻ1.\\ [*13·22] &\supset .(\exists x,y,z,\gamma ,\delta ).\gamma =x_{\iota }ʻʻ(\alpha -\iota ʻx)\cup \iota ʻy_{\iota }ʻz.\delta =\iotaʻʻ\beta .\\ &\gamma \in \text{N}^{1}\text{c}ʻ\alpha \cap \text{Cl}ʻ2.\delta \in \text{N}^{1}\text{c}ʻ\beta \cap \text{Cl}ʻ1.\\ [*11·55] &\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha \cap \text{Cl}ʻ2.\delta \in \text{N}^{1}\text{c}ʻ\beta \cap \text{Cl}ʻ1 &\qquad \text{(1)}\\ \vdash .(1).*101·35.\supset \vdash .\text{Prop} \end{array}$

This proposition proves the desired conclusions provided $\exists!\alpha$ , and $t_{0}ʻ\alpha$ consists of at least three terms. The following propositions deal with the cases in which this hypothesis is not verified.

*104·411. $\vdash :tʻ\alpha =tʻ\beta .\alpha \in 0.\gamma =\Lambda _{\alpha }.\delta =\iotaʻʻ\beta .\supset .\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda$

Dem. $\begin{array}{l} \vdash .*73·47. &\supset \vdash :\text{Hp}.\supset .\gamma \text{ sm }\alpha &\qquad \text{(1)}\\ *22·43.(*65·01). &\supset \vdash :\text{Hp}.\supset .\gamma \subset tʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*104·101.&\supset \vdash :\text{Hp}.\supset .\gamma \in \text{N}^{1}\text{c}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).*104·2.*24·23.\supset \vdash .\text{Prop} \end{array}$

*104·412. $\begin{aligned}\vdash :tʻ\alpha =tʻ\beta .\alpha =\iota ʻx.\gamma =\iota ʻ\Lambda _{x}.&\delta =\iotaʻʻ\beta .\supset .\\ &\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*73·43. &\supset \vdash :\text{Hp}.\supset .\gamma \text{ sm }\alpha &\qquad \text{(1)}\\ \vdash .*63·61·103. &\supset \vdash :\text{Hp}.\supset .\alpha \in t^{2}ʻx &\qquad \text{(2)}\\ \vdash .*22·43.(*65·01). \supset \vdash :\text{Hp}.\xi \in \gamma .&\supset _{\xi }.\xi \subset tʻx.\\ [*63·5] &\supset _{\xi }.\xi \in t^{2}ʻx.\\ [(2).*63·13] &\supset _\xi .\xi \in tʻ\alpha . &\qquad \text{(3)}\\ \vdash .(1).(3).*104·101.&\supset \vdash :\text{Hp}.\supset .\gamma \in \text{N}^{1}\text{c}ʻ\alpha &\qquad \text{(4)}\\ \vdash .*101·23. &\supset \vdash :\text{Hp}.\supset .\gamma \cap \delta =\Lambda &\qquad \text{(5)}\\ \vdash .(4).(5).*104·2.\supset \vdash .\text{Prop} \end{array}$

*104·413. $\begin{aligned}\vdash :tʻ\alpha =tʻ\beta .\alpha =\iota ʻx\cup \iota ʻy.&x \neq y.\gamma =\iota ʻ\Lambda \cup \iota ʻ(\iota ʻx\cup \iota ʻy).\delta =\iotaʻʻ\beta .\supset .\\ &\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*54·26. \supset \vdash :\text{Hp}.&\supset .\iota ʻx\cup \iota ʻy\in 2. &\qquad \text{(1)}\\ [*101·35] &\supset .\Lambda \neq \iota ʻx\cup \iota ʻy.\\ [*54·26] &\supset .\iota ʻ\Lambda \cup \iota ʻ(\iota ʻx\cup \iota ʻy)\in 2.\\ [*101·3] &\supset .\iota ʻ\Lambda \cup \iota ʻ(\iota ʻx\cup \iota ʻy)\in \text{Nc}ʻ(\iota ʻx\cup \iota ʻy) &\qquad \text{(2)}\\ \vdash .*51·16. \supset \vdash :\text{Hp}.&\supset .\alpha \in \gamma .\\ [*63·5] &\supset .\gamma \subset tʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).*104·1. &\supset \vdash :\text{Hp}.\supset .\gamma \in \text{N}^{1}\text{c}ʻ\alpha &\qquad \text{(4)}\\ \vdash .*52·21·3. &\supset \vdash .\Lambda {\sim}\in \iotaʻʻ\beta &\qquad \text{(5)}\\ \vdash .(1).*52·3.*54·25. &\supset \vdash :\text{Hp}.\supset .\iota ʻx\cup \iota ʻy{\sim}\in \iotaʻʻ\beta &\qquad \text{(6)}\\ \vdash .(5).(6). &\supset \vdash :\text{Hp}.\supset .\gamma \cap \delta =\Lambda &\qquad \text{(7)}\\ \vdash .(4).(7).*104·2.\supset \vdash .\text{Prop} \end{array}$

*104·42. $\begin{aligned}&\vdash :tʻ\alpha =tʻ\beta .\alpha \in 0\cup 1\cup 2.\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda \\ &[*104·411·412·413.*52·1.*54·101]\end{aligned}$

*104·43. $\vdash :tʻ\alpha =tʻ\beta .\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda$

Dem. $\begin{array}{l} \vdash .*54·56.\supset \\ \vdash :\text{Hp}.\alpha {\sim}\in 0\cup 1\cup 2.&\supset .(\exists x,y,z).x,y,z \in \alpha .x\neq y.x\neq z.y\neq z.\\ [*104·41] &\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda &\qquad \text{(1)}\\ \vdash .(1).*104·42.\supset \vdash .\text{Prop} \end{array}$

The above proposition gives the desired result. The following propositions re-state this result in other forms.

*104·44. $\begin{aligned}&\vdash :\mu ,\nu \in \text{N}^{1}\text{C}.tʻ\mu =tʻ\nu .\supset .(\exists \gamma ,\delta ).\gamma \in \mu .\delta \in \nu .\gamma \cap \delta =\Lambda\\ &[*104·13·43]\end{aligned}$

*104·45. $\begin{aligned}&\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.tʻ\mu =tʻ\nu .\supset .(\exists \gamma ,\delta ).\gamma \in \mu ^{(1)}.\delta \in \nu ^{(1)}.\gamma \cap \delta =\Lambda\\ &[*104·29·44]\end{aligned}$

*104·46. $\begin{aligned}&\vdash :\mu ,\nu \in \text{NC} - \iota ʻ\Lambda .tʻ\mu =tʻ\nu .\supset .(\exists \gamma ,\delta ).\gamma \in \mu ^{(1)}.\delta \in \nu ^{(1)}.\gamma \cap \delta =\Lambda \\ &[*104·28·44]\end{aligned}$

In this number, we consider cardinals generated by a relation of similarity which goes from a higher to a lower type, i.e. given any class of classes $\kappa$ , we consider $\text{Nc}ʻ\kappa$ in the type of members of $\kappa$ (which we shall call $\text{N}_{1}\text{c}ʻ\kappa$ ) or in some lower type. Thus e.g. we shall have $\kappa =\iotaʻʻ\alpha .\supset .\alpha \in \text{N}_{1}\text{c}ʻ\kappa ,$ where " $\text{N}_{1}\text{c}ʻ\kappa$ " means "classes similar to $\kappa$ but of the next lower type." Similarly $\kappa =\iotaʻʻ\iotaʻʻ\alpha .\supset .\alpha \in \text{N}_{2}\text{c}ʻ\kappa ,$ and so on. We shall have generally $\begin{aligned} \beta \in \text{N}_{1}\text{c}ʻ\alpha .&\equiv \alpha \in \text{N}^{1}\text{c}ʻ\beta ,\\ \beta \in \text{N}_{2}\text{c}ʻ\alpha .&\equiv \alpha \in \text{N}^{2}\text{c}ʻ\beta , \end{aligned}$ and so on. The chief difference between ascending and descending cardinals is that $\Lambda$ is one of the latter, but not one of the former. Otherwise the propositions of the present number are mostly analogous to corresponding propositions of *104.

On the analogy of the definitions in *104, we put $\begin{aligned} \text{N}_{1}\text{C}=\text{D}ʻ\text{N}_{1}\text{c} \quad\text{Df},\\ \mu _{(1)}=\text{ sm }ʻʻ\mu \cap t_{1}ʻ\mu \quad\text{Df}, \end{aligned}$ with similar definitions for $\text{N}_{2}\text{C}$ and $\mu_(2)$ .

No proposition of the present number is ever referred to in the sequel, and the reader who is not interested in the subject may therefore omit it without detriment to what follows. The principal propositions proved are the following:

Thus $\text{N}_{1}\text{C}$ or $\text{N}_{2}\text{C}$ , in any given type, only differs from $\text{N}_{0}\text{C}$ in that type by the addition of $\Lambda$ .

*105·3. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha$

*105·322. $\vdash \colon\ldotp \exists !\text{N}_{1}\text{c}ʻ\alpha .\supset :\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\beta .\equiv .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

*105·34. $\vdash \colon\ldotp \mu \in \text{NC}.\exists !\mu _{(1)}.\supset :\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\equiv .\mu =\text{N}_{0}\text{c}ʻ\alpha$

*105·35. $\vdash \colon\ldotp \mu \in \text{NC}.\nu \in \text{N}_{0}\text{C}.\supset :\mu =\nu ^{(1)}.\equiv .\mu _{(1)}=\nu$

*105·01. $\text{N}_{1}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻt_{1}ʻ\alpha \quad\text{Df}$

We might write $\text{N}_{1}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap t_{0}ʻ\alpha \quad\text{Df},$ which would be equivalent to the above. But we choose the above form for the sake of uniformity. If $s$ is any suffix, we put, provided $t_{s}ʻ\alpha$ has been defined, $\text{N}_{s}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻt_{s}ʻ\alpha \quad\text{Df},$ and if $i$ is any index for which $t^{i}ʻ\alpha$ has been defined, we put $\text{N}^{i}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻt^{i}ʻ\alpha \quad\text{Df}.$

Thus for the sake of uniformity it is better, in the above definition *105·01, to write " $tʻt_{1}ʻ\alpha$ " rather than " $t_{0}ʻ\alpha$ ."

*105·011. $\text{N}_{2}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap tʻt_{2}ʻ\alpha \quad\text{Df}$

*105·1. $\vdash .\text{N}_{1}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap t_{0}ʻ\alpha \quad[*63·383.(*105·01)]$

*105·101. $\vdash .\text{N}_{2}\text{c}ʻ\alpha =\text{Nc}ʻ\alpha \cap t_{1}ʻ\alpha \quad[*63·41.(*105·011)]$

*105·11. $\begin{aligned}&\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in t_{0}ʻ\alpha .\equiv .\beta \text{ sm }\alpha .\beta \in t_{0}ʻ\alpha .\equiv .\beta \text{ sm }\alpha .\beta \subset t_{1}ʻ\alpha \\ &[*105·1.*100·31.*63·51]\end{aligned}$

*105·111. $\begin{aligned}&\vdash :\beta \in \text{N}_{2}\text{c}ʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in t_{1}ʻ\alpha .\equiv .\beta \text{ sm }\alpha .\beta \in t_{1}ʻ\alpha .\equiv .\beta \text{ sm }\alpha .\beta \subset t_{2}ʻ\alpha\\ &[*105·101.*100·31.*63·52]\end{aligned}$

*105·12. $\begin{aligned}&\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\alpha \subset tʻ\beta .\equiv .\beta \text{ sm }\alpha .\alpha \subset tʻ\beta .\equiv .\alpha \in \text{N}^{1}\text{c}ʻ\beta \\ &[*105·11.*63·51.*104·1]\end{aligned}$

*105·121. $\begin{aligned}&\vdash :\beta \in \text{N}_{2}\text{c}ʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\alpha \subset t^{2}ʻ\beta .\equiv .\beta \text{ sm }\alpha .\alpha \subset t^{2}ʻ\beta .\equiv .\alpha \in \text{N}^{2}\text{c}ʻ\beta \\ &[*105·111.*63·52.*104·11]\end{aligned}$

*105·13. $\vdash .\text{N}_{1}\text{c}ʻ\alpha =\text{Nc}(t_{1}ʻ\alpha )ʻ\alpha =\text{Nc}\{(t_{1}ʻ\alpha )_{\alpha }\}ʻ\alpha \quad[*102·6.(*105·.01)]$

*105·131. $\vdash .\text{N}_{2}\text{c}ʻ\alpha =\text{Nc}(t_{2}ʻ\alpha )ʻ\alpha =\text{Nc}\{(t_{2}ʻ\alpha )_{\alpha }\}ʻ\alpha \quad[*102·6.(*105·011)]$

*105·14. $\vdash :\alpha \in t_{0}ʻ\beta .\supset .\text{N}_{1}\text{c}ʻ\beta =\text{Nc}(a)ʻ\beta =\text{Nc}(a_{\beta })ʻ\beta$

Dem. $\begin{array}{l} \vdash .*63·22.\supset \vdash :\text{Hp}.&\supset .tʻ\alpha =t_{0}ʻ\beta .\\ [*105·1] &\supset .\text{N}_{1}\text{c}ʻ\beta =\text{Nc}ʻ\beta \cap tʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*102·6.\supset \vdash .\text{Prop} \end{array}$

*105·141. $\vdash :\alpha \in t_{1}ʻ\beta .\supset .\text{N}_{2}\text{c}ʻ\beta =\text{Nc}(\alpha )ʻ\beta =\text{Nc}(\alpha _{\beta })ʻ\beta \quad[\text{Proof as in}\, *105·14]$

*105·142. $\vdash :\beta \subset tʻ\alpha .\supset .\text{N}_{1}\text{c}ʻ\beta =\text{Nc}(\alpha )ʻ\beta =\text{Nc}(\alpha _{\beta })ʻ\beta \quad[*105·14.*63·51]$

*105·143. $\vdash :\beta \subset t^{2}ʻ\alpha .\supset .\text{N}_{2}\text{c}ʻ\beta =\text{Nc}(\alpha )ʻ\beta =\text{Nc}(\alpha _{\beta })ʻ\beta \quad[*105·141.*63·52]$

*105·15. $\vdash :\mu \in \text{N}_{1}\text{C}.\equiv .(\exists \alpha ).\mu =\text{N}_{1}\text{c}ʻ\alpha \quad[*100·22.*71·41.(*105·02)]$

*105·151. $\vdash :\mu \in \text{N}_{2}\text{C}.\equiv .(\exists \alpha ).\mu =\text{N}_{2}\text{c}ʻ\alpha$

*105·16. $\begin{aligned}\vdash :\delta \in \mu _{(1)}.&\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\delta \in t_{1}ʻ\mu .\\ &\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\delta \in t_{0}ʻ\gamma .\\ &\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\gamma \subset tʻ\delta \quad[*37·1.*63·51·54]\end{aligned}$

*105·161. $\begin{aligned}\vdash :\delta \in \mu _{(2)}.&\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\delta \in t_{2}ʻ\mu .\\ &\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\delta \in t_{1}ʻ\gamma .\\ &\equiv .(\exists \gamma ).\gamma \in \mu .\delta \text{ sm }\gamma .\gamma \subset t^{2}ʻ\delta \quad[*37·1.*63·52·55]\end{aligned}$

In what follows, propositions concerning $\text{N}_{2}\text{c}$ or $\text{N}_{2}\text{C}$ have proofs exactly analogous to those of the corresponding propositions concerning $\text{N}_{1}\text{c}$ or $\text{N}_{1}\text{C}$ .

*105·2. $\vdash .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\iotaʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*105·12.*104·2.&\supset \vdash .\alpha \in \text{N}_{1}\text{c}ʻ\iotaʻʻ\alpha .\\ [*103·26]&\supset \vdash .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\iotaʻʻ\alpha \end{array}$

*105·201. $\vdash .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{2}\text{c}ʻ\iotaʻʻ\iotaʻʻ\alpha$

*105·21. $\vdash .\text{N}_{0}\text{C}\subset \text{N}_{1}\text{C} \quad[*105·2·15]$

*105·22. $\vdash :\gamma \in \text{N}_{1}\text{c}ʻ\delta .\supset .\text{N}_{1}\text{c}ʻ\delta =\text{N}_{0}\text{c}ʻ\gamma \quad[*103·26]$

*105·221. $\vdash :\gamma \in \text{N}_{2}\text{c}ʻ\delta .\supset .\text{N}_{2}\text{c}ʻ\delta =\text{N}_{0}\text{c}ʻ\gamma$

*105·23. $\vdash :\exists !\text{N}_{1}\text{c}ʻ\delta .\supset .\text{N}_{1}\text{c}ʻ\delta \in \text{N}_{0}\text{C} \quad[*105·22]$

*105·231. $\vdash :\exists !\text{N}_{2}\text{c}ʻ\delta .\supset .\text{N}_{2}\text{c}ʻ\delta \in \text{N}_{0}\text{C}$

*105·24. $\vdash .\text{N}_{1}\text{C}-\iota ʻ\Lambda \subset \text{N}_{0}\text{C} \quad[*105·23]$

*105·241. $\vdash .\text{N}_{2}\text{C}-\iota ʻ\Lambda \subset \text{N}_{0}\text{C}$

*105·25. $\vdash .\text{N}_{0}\text{C}=\text{N}_{1}\text{C}-\iota ʻ\Lambda \quad[*105·21·24.*103·23]$

*105·252. $\vdash .\text{N}_{1}\text{c}ʻ\beta =\text{N}_{2}\text{c}ʻ\iotaʻʻ\beta$

Dem. $\begin{array}{l} \vdash .*105·111.\supset \vdash :\alpha \in \text{N}_{2}\text{c}ʻ\iotaʻʻ\beta .&\equiv .\alpha \text{ sm }\iotaʻʻ\beta .\alpha \in t_{1}ʻ\iotaʻʻ\beta .\\ [*73·41.*63·64·54] &\equiv .\alpha \text{ sm }\beta .\alpha \in t_{0}ʻ\beta .\\ [*105·11] &\equiv .\alpha \in \text{N}_{1}\text{c}ʻ\beta :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*105·142.\supset \vdash .\text{N}_{1}\text{c}ʻtʻ\alpha =\text{Nc}(\alpha )ʻtʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*102·73.\supset \vdash .\text{Prop} \end{array}$

*105·261. $\vdash .\text{N}_{2}\text{c}ʻ\iotaʻʻtʻ\alpha =\Lambda \quad[*105·26·252]$

*105·28. $\vdash .\text{N}_{1}\text{C}=\text{N}_{0}\text{C}\cup \iota ʻ\Lambda \quad[*105·25·27]$

*105·281. $\vdash .\text{N}_{2}\text{C}=\text{N}_{1}\text{C}=\text{N}_{0}\text{C}\cup \iota ʻ\Lambda$

*105·29. $\vdash .\text{NC}\subset \text{N}_{1}\text{C}.\text{NC}\subset \text{N}_{2}\text{C} \quad[*105·281.*103·34]$

*105·3. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*103·4.(*105·03).\supset \vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .&\supset .\mu _{(1)}=\text{Nc}ʻ\alpha \cap t_{1}ʻ\mu &\qquad \text{(1)}\\ \vdash .*103·12. &\supset \vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\alpha \in \mu .\\ [*63·105] &\supset .\alpha \in t_{0}ʻ\mu .\\ [*63·54] &\supset .t_{0}ʻ\alpha =t_{1}ʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .&\supset .\mu _{(1)}=\text{Nc}ʻ\alpha \cap t_{0}ʻ\alpha .\\ [*105·1] &\supset .\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*105·301. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(2)}=\text{N}_{2}\text{c}ʻ\alpha$

*105·31. $\vdash :\mu \in \text{N}_{0}\text{C}.\supset .\mu {(1)}\in \text{N}_{1}\text{C} \quad[*105·3·15.*103·2]$

*105·311. $\vdash :\mu \in \text{N}_{0}\text{C}.\supset .\mu _{(2)}\in \text{N}_{2}\text{C}$

*105·312. $\vdash :\gamma \in \text{N}_{1}\text{c}ʻ\alpha .\supset .\alpha \in \text{N}^{1}\text{c}ʻ\gamma .\text{N}^{1}\text{c}ʻ\gamma =\text{N}_{0}\text{c}ʻ\alpha \quad[*105·12.*103·26]$

*105·313. $\vdash :\gamma \in \text{N}_{2}\text{c}ʻ\alpha .\supset .\alpha \in \text{N}^{2}\text{c}ʻ\gamma .\text{N}^{2}\text{c}ʻ\gamma =\text{N}_{0}\text{c}ʻ\alpha$

*105·314. $\vdash :\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\gamma \quad[*105·312.*103·12]$

*105·315. $\vdash :\text{N}_{2}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}^{2}\text{c}ʻ\gamma$

*105·316. $\vdash :\exists !\text{N}_{1}\text{c}ʻ\alpha .\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\beta .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*105·312.&\supset \vdash :\gamma \in \text{N}_{1}\text{c}ʻ\alpha \\.\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\beta .&\supset .\text{N}^{1}\text{c}ʻ\gamma =\text{N}_{0}\text{c}ʻ\alpha .\text{N}^{1}\text{c}ʻ\gamma =\text{N}_{0}\text{c}ʻ\beta .\\ [*13·171] &\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*10·11·23·35.\supset \vdash .\text{Prop} \end{array}$

*105·317. $\vdash :\exists !\text{N}_{2}\text{c}ʻ\alpha .\text{N}_{2}\text{c}ʻ\alpha =\text{N}_{2}\text{c}ʻ\beta .\supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

*105·32. $\vdash :\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\supset .\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*103·41.\supset \vdash :\text{Hp}.&\supset .\text{Nc}(t_{1}ʻ\alpha )ʻ\alpha =\text{Nc}(t_{1}ʻ\alpha )ʻ\beta &\qquad \text{(1)}\\ \vdash .*103·14.\supset \vdash :\text{Hp}.&\supset .\beta \in tʻ\alpha .\\ [*63·16·36] &\supset .t_{1}ʻ\alpha =t_{1}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.&\supset .\text{Nc}(t_{1}ʻ\alpha )ʻ\alpha =\text{Nc}(t_{1}ʻ\beta )ʻ\beta .\\ [*105·13] &\supset .\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{1}\text{c}ʻ\beta :\supset \vdash .\text{Prop} \end{array}$

*105·321. $\vdash :\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\supset .\text{N}_{2}\text{c}ʻ\alpha =\text{N}_{2}\text{c}ʻ\beta$

*105·323. $\vdash \colon\ldotp \exists !\text{N}_{2}\text{c}ʻ\alpha .\supset :\text{N}_{2}\text{c}ʻ\alpha =\text{N}_{2}\text{c}ʻ\beta .\equiv .\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta$

*105·324. $\vdash :\exists !\mu _{(1)}.\supset .\exists !\mu \quad[*37·29.(*105·03)]$

*105·326. $\vdash :\mu \in \text{NC}.\mu _{(1)}=\text{N}_{0}\text{c}ʻ\gamma .\supset .\mu =\text{N}^{1}\text{c}ʻ\gamma$

Dem. $\begin{array}{l} \vdash .*103·26. \supset \vdash :\text{Hp}.\alpha \in \mu .&\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha . &\qquad \text{(1)}\\ [*105·3] & \supset .\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\\ [\text{Hp}] &\supset .\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\\ [*105·314] & \supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\gamma .\\ [(1)] &\supset .\mu =\text{N}^{1}\text{c}ʻ\gamma &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35.\supset \vdash :\text{Hp}.\exists !\mu .&\supset .\mu =\text{N}^{1}\text{c}ʻ\gamma &\qquad \text{(3)}\\ \vdash .(3).*105·324.*103·13.\supset \vdash .\text{Prop} \end{array}$

*105·327. $\vdash :\mu \in \text{NC}.\mu _{(2)}=\text{N}_{0}\text{c}ʻ\gamma .\supset .\mu =\text{N}^{2}\text{c}ʻ\gamma$

*105·33. $\vdash :\mu \in \text{NC}.\exists !\mu _{(1)}.\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*103·26.\supset \vdash :\gamma \in \mu _{(1)}.\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\supset .\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\\ [*105·314] \supset .\text{N}_{0}\text{c}ʻ\alpha =\text{N}^{1}\text{c}ʻ\gamma &\qquad \text{(1)}\\ \vdash .(1).*105·326.\supset \\ \vdash :\gamma \in \mu _{(1)}.\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\mu \in \text{NC}.\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35.\supset \vdash .\text{Prop} \end{array}$

*105·331. $\vdash :\mu \in \text{NC}.\exists !\mu _{(2)}.\mu _{(2)}=\text{N}_{2}\text{c}ʻ\alpha .\supset .\mu =\text{N}_{0}\text{c}ʻ\alpha$

*105·34. $\vdash \colon\ldotp \mu \in \text{NC}.\exists !\mu _{(1)}.\supset :\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\equiv .\mu =\text{N}_{0}\text{c}ʻ\alpha \quad[*105·33·3]$

*105·341. $\vdash \colon\ldotp \mu \in \text{NC}.\exists !\mu _{(2)}.\supset :\mu _{(2)}=\text{N}_{2}\text{c}ʻ\alpha .\equiv .\mu =\text{N}_{0}\text{c}ʻ\alpha$

*105·342. $\vdash .\mu \in \text{NC}.\supset .\mu _{(1)}\in \text{N}_{1}\text{C}$

Dem. $\begin{array}{l} \vdash .*103·34. \supset \vdash :\text{Hp}.\exists !\mu .&\supset .\mu \in \text{N}_{0}\text{C}.\\ [*105·31] &\supset .\mu _{(1)}\in \text{N}_{1}\text{C} &\qquad \text{(1)}\\ \vdash .*105·324.\supset \vdash :\text{Hp}.{\sim}\exists !\mu .&\supset .{\sim}\exists !\mu _{(1)}.\\ [*105·27] &\supset .\mu _{(1)}\in \text{N}_{1}\text{C} &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash .\text{Prop} \end{array}$

*105·343. $\vdash :\mu \in \text{NC}.\supset .\mu _{(2)}\in \text{N}_{2}\text{C}$

*105·344. $\vdash :\mu =\text{N}^{1}\text{c}ʻ\gamma .\supset .\mu _{(1)}=\text{N}_{0}\text{c}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *104·24.\supset \vdash :\text{Hp}.&\supset .\mu =\text{N}_{0}\text{c}ʻ\iotaʻʻ\gamma .\\ [*105·3] &\supset .\mu _{(1)}=\text{N}_{1}\text{c}ʻ\iotaʻʻ\gamma .\\ [*105·2] &\supset .\mu _{(1)}=\text{N}_{0}\text{c}ʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

*105·345. $\vdash :\mu =\text{N}^{2}\text{c}ʻ\gamma .\supset .\mu _{(2)}=\text{N}_{0}\text{c}ʻ\gamma$

*105·35. $\vdash \colon\ldotp \mu \in \text{NC}.\nu \in \text{N}_{0}\text{C}.\supset :\mu =\nu ^{(1)}.\equiv .\mu _{(1)}=\nu$

Dem. $\begin{array}{l} \vdash .*105·326.*104·26.\supset \\ \vdash :\mu \in \text{NC}.\nu =\text{N}_{0}\text{c}ʻ\gamma .\mu _{(1)}=\nu .\supset .\mu =\text{N}^{1}\text{c}ʻ\gamma . \nu ^{(1)}=\text{N}_{1}\text{c}ʻ\gamma .\\ [*13·172] \supset .\mu =\nu ^{(1)} &\qquad \text{(1)}\\ \vdash .*104·26.\text{Fact}.\supset \\ \vdash :\mu \in \text{NC}.\nu =\text{N}_{0}\text{c}ʻ\gamma .\mu =\nu ^{(1)}.\supset .\mu =\text{N}^{1}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\gamma .\\ [*105·344] \supset .\mu _{(1)}=\text{N}_{0}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\gamma .\\ [*13·172] \supset .\mu _{(1)}=\nu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp \mu \in \text{NC}.\nu =\text{N}_{0}\text{c}ʻ\gamma .\supset :\mu =\nu ^{(1)}.\equiv .\mu _{(1)}=\nu &\qquad \text{(3)}\\ \vdash .(3).*103·2.\supset \vdash .\text{Prop} \end{array}$

*105·351. $\vdash \colon\ldotp \mu \in \text{NC}.\nu \in \text{N}_{0}\text{C}.\supset :\mu =\nu ^{(2)}.\equiv .\mu _{(2)}=\nu$

*105·352. $\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\exists !\nu .\supset :\mu =\nu ^{(1)}.\equiv .\mu _{(1)}=\nu \quad[*105·35.*103·34]$

*105·353. $\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\exists !\nu .\supset :\mu =\nu ^{(2)}.\equiv .\mu _{(2)}=\nu$

*105·354. $\vdash :\nu \in \text{NC}.\exists !\nu .\supset .{\nu ^{(1)}}_{(1)}=\nu \quad[*105·352]$

*105·355. $\vdash :\nu \in \text{NC}.\exists !\nu .\supset .\{\nu ^{(2)}\}_{(2)}=\nu$

*105·356. $\vdash :\mu \in \text{NC}.\exists !\mu _{(1)}.\supset .\{\mu _{(1)}\}^{(1)}=\mu \quad[*105·352]$

*105·357. $\vdash :\mu \in \text{NC}.\exists !\mu _{(2)}.\supset .\{\mu _{(2)}\}^{(2)}=\mu$

*105·36. $\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\gamma \in \text{N}_{1}\text{c}ʻ\beta .\supset .\gamma \in \text{N}_{2}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*105·11.\supset \vdash :\text{Hp}.&\supset .\beta \text{ sm }\alpha .\beta \in t_{0}ʻ\alpha .\gamma \text{ sm }\beta .\gamma \in t_{0}ʻ\beta .\\ [*73·32.*63·38] &\supset .\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha .\\ [*105·111] &\supset .\gamma \in \text{N}_{2}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*105·361. $\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\gamma \in \text{N}_{2}\text{c}ʻ\alpha .\supset .\gamma \in \text{N}_{1}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*105·11·111 .\supset \vdash :\text{Hp}.&\supset .\beta \text{ sm }\alpha .\beta \in t_{0}ʻ\alpha .\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha .\\ [*73·31·32] &\supset .\gamma \text{ sm }\beta .\beta \in t_{0}ʻ\alpha .\gamma \in t_{1}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*63·54. &\supset \vdash :\beta \in t_{0}ʻ\alpha .\supset .t_{0}ʻ\beta =t_{1}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .\gamma \text{ sm }\beta .\gamma \in t_{0}ʻ\beta .\\ [*105·11] \supset .\gamma \in \text{N}_{1}\text{c}ʻ\beta :\supset \vdash .\text{Prop} \end{array}$

*105·362. $\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\supset .\text{N}_{1}\text{c}ʻ\beta =\text{N}_{2}\text{c}ʻ\alpha \quad[*105·36·361]$

*105·37. $\vdash :\text{N}_{0}\text{c}ʻ\beta =\text{N}_{1}\text{c}ʻ\alpha .\supset .\text{N}_{1}\text{c}ʻ\beta =\text{N}_{2}\text{c}ʻ\alpha \quad[*105·362.*103·12]$

Dem. $\begin{array}{l} \vdash .*63·381.(*63·05).\supset \\ \vdash :\gamma \text{ sm }\alpha .\alpha \in \mu .\gamma \in t_{2}ʻ\mu .&\supset .\gamma \text{ sm }\alpha .\alpha \in \mu .tʻ\gamma =t_{2}ʻ\mu .\\ [*73·41.*63·64] &\supset .\iotaʻʻ\gamma \text{ sm }\alpha .\alpha \in \mu .t_{0}ʻ\iotaʻʻ\gamma =t_{2}ʻ\mu .\\ [*63·57] &\supset .\iotaʻʻ\gamma \text{ sm }\alpha .\alpha \in \mu .tʻ\iotaʻʻ\gamma =t_{1}ʻ\mu .\\ [*63·103] &\supset .\iotaʻʻ\gamma \text{ sm }\alpha .\alpha \in \mu .\iotaʻʻ\gamma \in t_{1}ʻ\mu .\\ [*105·16] &\supset .\iotaʻʻ\gamma \in \mu _{(1)}.\\ [*10·24] &\supset .\exists !\mu _{(1)} &\qquad \text{(1)}\\ \vdash .(1).*10·11·23.\supset \\ \vdash :(\exists \alpha ).\gamma \text{ sm }\alpha .\alpha \in \mu .\gamma \in t_{2}ʻ\mu .&\supset .\exists !\mu _{(1)} &\qquad \text{(2)}\\ \vdash .(2).*105·161.\supset \vdash :\gamma \in \mu _{(2)}.&\supset .\exists !\mu _{(1)} &\qquad \text{(3)}\\ \vdash .(3).*10·11·23.\supset \vdash .\text{Prop} \end{array}$

*105·372. $\vdash :\mu _{(1)}=\Lambda .\supset .\mu _{(2)}=\Lambda \quad[*105·371.\text{Transp}]$

Dem. $\begin{array}{l} \vdash .*105·16.\supset \vdash :\gamma \in \{\mu _{(1)}\}_{(1)}.&\equiv .(\exists \beta ).\beta \in \mu _{(1)}.\gamma \text{ sm }\beta .\gamma \in t_{0}ʻ\beta .\\ [*105·16] &\equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \in t_{0}ʻ\alpha .\gamma \text{ sm }\beta .\gamma \in t_{0}ʻ\beta . &\qquad \text{(1)}\\ [*73·32.*63·38] &\supset .(\exists \alpha ).\alpha \in \mu .\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*73·41.*63·64·53·57.\supset \\ \vdash :\alpha \in \mu .\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha .&\supset .\alpha \in \mu .\iotaʻʻ\gamma \text{ sm }\alpha .\gamma \text{ sm }\iotaʻʻ\gamma .\gamma \in t_{0}ʻ\iotaʻʻ\gamma .\iotaʻʻ\gamma \in t_{0}ʻ\alpha .\\ [(1)] &\supset .\gamma \in \{\mu _{(1)}\}_{(1)} &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash :\gamma \in \{\mu _{(1)}\}_{(1)}.&\equiv .(\exists \alpha ).\alpha \in \mu .\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha .\\ [*105·161] &\equiv .\gamma \in \mu _{(2)}:\supset \vdash .\text{Prop} \end{array}$

*105·4. $\vdash :\gamma \in \text{N}_{2}\text{c}ʻ\alpha .\supset .\iotaʻʻ\gamma \in \text{N}_{1}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*105·111.*73·41.*63·64.\supset \vdash :\text{Hp}.&\supset .\iotaʻʻ\gamma \text{ sm }\alpha .\gamma \in t_{1}ʻ\alpha .\gamma \in t_{0}ʻ\iotaʻʻ\gamma .\\ [*63·41·383·16·55] &\supset .\iotaʻʻ\gamma \text{ sm }\alpha .t_{1}ʻ\alpha =t_{0}ʻ\iotaʻʻ\gamma .\\ [*63·54] &\supset .\iotaʻʻ\gamma \text{ sm }\alpha .\iotaʻʻ\gamma \in t_{0}ʻ\alpha .\\ [*105·11] &\supset .\iotaʻʻ\gamma \in \text{N}_{1}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*105·41. $\vdash :\exists !\text{N}_{2}\text{c}ʻ\alpha .\supset .\exists !\text{N}_{1}\text{c}ʻ\alpha \quad[*105·4]$

*105·42. $\vdash :\text{N}_{1}\text{c}ʻ\alpha =\Lambda .\supset .\text{N}_{2}\text{c}ʻ\alpha =\Lambda \quad[*105·41]$

*105·43. $\vdash :\mu _{(1)}=\text{N}_{1}\text{c}ʻ\alpha .\supset .\mu _{(2)}=\text{N}_{2}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*105·11. \supset \vdash :\text{Hp}.\beta \in \mu _{(1)}.&\supset .\beta \in \text{Nc}ʻ\alpha \cap t_{0}ʻ\alpha .\\ [*63·54.*100·31·321] &\supset .\text{Nc}ʻ\beta =\text{Nc}ʻ\alpha .t_{0}ʻ\beta =t_{1}ʻ\alpha .\\ [*105·1·101] &\supset .\text{N}_{1}\text{c}ʻ\beta =\text{N}_{2}\text{c}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*105·3.*103·26.\supset \vdash :\text{Hp}.\beta \in \mu _{(1)}.\supset .\text{N}_{1}\text{c}ʻ\beta &=\{\mu _{(1)}\}_{(1)}\\ [*105·38]&=\mu _{(2)} &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\exists !\mu _{(1)}.\supset .\mu _{(2)}=\text{N}_{2}\text{c}ʻ\alpha &\qquad \text{(3)}\\ \vdash .*105·372·42. &\supset \vdash :\text{Hp}.\mu _{(1)}=\Lambda .\supset .\mu _{(2)}=\Lambda .\text{N}_{2}\text{c}ʻ\alpha =\Lambda &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*105·26.&\supset \vdash .\text{N}_{1}\text{c}ʻtʻtʻ\alpha =\Lambda .\\ [*105·42] &\supset \vdash .\text{N}_{2}\text{c}ʻtʻtʻ\alpha =\Lambda .\supset \vdash .\text{Prop} \end{array}$

In this number we have to consider the cardinals whose members are classes of relations which have a given relation of type to some given class. For example, we have $\downarrow xʻʻ\alpha \text{ sm }\alpha$ , and $\downarrow xʻʻ\alpha$ has a given relation of type to $\alpha$ when $x$ is given. Thus we want a notation for $\text{Nc}ʻ\alpha \cap tʻ\downarrow xʻʻ\alpha$ and all the associated ideas. In this number, we shall deal only with relations in which the referent and relatum have a relation, as to type, which can be expressed by the notations of *63, i.e. roughly speaking, when, for suitable values of $\alpha$ , $m$ , $n$ , our relations are contained in $t^{m}ʻ\alpha \uparrow t^{n}ʻ\alpha\,\,\, \text{or}\,\,\, t_{m}ʻ\alpha \uparrow t_{n}ʻ\alpha\,\,\, \text{or}\,\,\, t^{m}ʻ\alpha \uparrow t_{n}ʻ\alpha\,\,\, \text{or}\,\,\, t_{m}ʻ\alpha \uparrow t^{n}ʻ\alpha.$

Thus if $t_{\mu \nu }ʻ\alpha$ has been defined, we shall put $\begin{aligned} \text{N}_{\mu \nu }\text{c}ʻ\alpha &=\text{Nc}ʻ\alpha \cap tʻt_{\mu \nu }ʻ\alpha &\quad\text{Df},\\ \text{N}_{\mu \nu }\text{C}&=\text{D}ʻ\text{N}_{\mu \nu }\text{c} &\quad\text{Df},\\ \xi _{\mu \nu }&=\text{ sm }ʻʻ\xi \cap tʻt_{\mu \nu }ʻt_{1}ʻ\xi &\quad\text{Df}, \end{aligned}$ with analogous definitions for $t^{\mu \nu }ʻ\alpha$ , $t^\mu _{\nu}ʻ\alpha$ and $^\mu t_{\nu }ʻ\alpha$ .

Much the most important case is that of $t_{00}ʻ\alpha$ . For this case we have

*106·1. $\begin{aligned}\vdash :\beta \in \text{N}_{00}\text{c}ʻ\alpha .\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻt_{00}ʻ\alpha .&\equiv .\beta \text{ sm }\alpha .\beta \in tʻtʻ(t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha ).\\ &\equiv .\beta \text{ sm }\alpha .\beta \subset tʻ(\alpha \uparrow \alpha )\end{aligned}$

Thus $\text{N}_{00}\text{c}ʻ\alpha$ will be the number of a class of relations whose fields are of the same type as $\alpha$ , provided this class of relations is similar to $\alpha$ . E.g. the number of terms such as $x\downarrow x$ , where $x\in \alpha$ , will be $\text{N}_{00}\text{c}ʻ\alpha$ .

*106·21. $\vdash .\exists !\text{N}_{00}\text{c}ʻ\alpha .\text{N}_{00}\text{c}ʻ\alpha \in \text{N}_{0}\text{C}$

*106·22. $\vdash :\lambda \in \text{N}_{0}^{1}\text{c}ʻ\alpha .\equiv .\text{Cnv}ʻʻ\lambda \in ^{1}\text{N}_{0}\text{c}ʻ\alpha$

*106·23. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\supset .\text{N}^{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\beta$

*106·32. $\vdash :t_{0}ʻ\alpha =t_{0}ʻ\beta .\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}_{00}\text{c}ʻ\alpha .\delta \in \text{N}_{00}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda$

*106·4·41·411. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(00)}=\text{N}_{00}\text{c}ʻ\alpha .\mu ^{(11)}=\text{N}^{11}\text{c}ʻ\alpha .\mu _{(11)}=\text{N}_{11}\text{c}ʻ\alpha$

*106·54. $\vdash .\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha {\sim} \in \text{N}_{00}\text{C}$

The propositions of this number, except *106·21, are never referred to again (except in *154·25 ·251 ·262, which are themselves never used again), but they have a somewhat greater importance than the propositions of *105, owing to the fact that the arithmetical operations are defined by means of classes of relations, i.e. the sum of two cardinals (for instance) is defined as the cardinal number of a certain class of relations (cf. *110).

*106·01 $\text{N}_{00}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻt_{00}ʻ\alpha \quad\text{Df}$

*106·011. $\text{N}^{11}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻt^{11}ʻ\alpha \quad\text{Df}$

*106·012. $\text{N}_{01}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻt_{01}ʻ\alpha \quad\text{Df etc.}$

*106·02. $\text{N}^{1}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻt_{0}^{1}ʻ\alpha \quad\text{Df etc.}$

*106·021. $^{1}\text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\alpha \cap tʻ^{1}t_{0}ʻ\alpha \quad\text{Df etc.}$

*106·03. $\text{N}_{00}\text{C} = \text{D}ʻ\text{N}_{00}\text{c} \quad\text{Df etc.}$

*106·04. $\mu _{(00)} = \text{ sm }ʻʻ\mu \cap tʻt_{00}ʻt_{1}ʻ\mu \quad\text{Df}$

*106·041. $\mu ^{(11)} = \text{ sm }ʻʻ\mu \cap tʻt^{11}ʻt_{1}ʻ\mu \quad\text{Df etc.}$

*106·1. $\begin{aligned}\vdash :\beta \in \text{N}_{00}\text{c}ʻ\alpha . &\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻt_{00}ʻ\alpha .\\ &\equiv .\beta \text{ sm } \alpha .\beta \in tʻtʻ(t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha ).\\ &\equiv .\beta \text{ sm } \alpha .\beta \subset tʻ(\alpha \uparrow \alpha )\\ &[*100·1.(*106·01.*64·01).*64·11]\end{aligned}$

*106·101. $\begin{aligned}\vdash :\beta \in \text{N}^{11}\text{c}ʻ\alpha . &\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻt^{11}ʻ\alpha .\\ &\equiv .\beta \text{ sm } \alpha .\beta \in tʻtʻ(tʻ\alpha \uparrow tʻ\alpha ).\\ &\equiv .\beta \text{ sm } \alpha .\beta \subset tʻ(tʻ\alpha \uparrow tʻ\alpha )\end{aligned}$

Similar propositions hold for any other double index $mn$ for which $t^{mn}ʻ\alpha$ has been defined.

*106·11. $\begin{aligned}\vdash :\beta \in \text{N}_{01}\text{c}ʻ\alpha . &\equiv .\beta \in \text{Nc}ʻ\alpha .\beta tʻt_{01}ʻ\alpha .\\ &\equiv .\beta \text{ sm } \alpha .\beta \in tʻtʻ(t_{0}ʻ\alpha \uparrow t_{1}ʻ\alpha ).\\ &\equiv .\beta \text{ sm } \alpha .\beta \subset tʻ(t_{0}ʻ\alpha \uparrow t_{1}ʻ\alpha )\end{aligned}$

Similar propositions hold for any other double suffix $mn$ for which $t_{mn}ʻ\alpha$ has been defined.

*106·12. $\begin{aligned}\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha . &\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻt_{0}^{1}ʻ\alpha .\\ &\equiv .\beta \text{ sm } \alpha .\beta \in tʻtʻ(t_{0}ʻ\alpha \uparrow tʻ\alpha ).\\ &\equiv .\beta \text{ sm } \alpha .\beta \subset tʻ(t_{0}ʻ\alpha \uparrow tʻ\alpha )\end{aligned}$

*106·121. $\begin{aligned}\vdash :\beta \in ^{1}\text{N}_{0}\text{c}ʻ\alpha . &\equiv .\beta \in \text{Nc}ʻ\alpha .\beta \in tʻ^{1}t_{0}ʻ\alpha .\\ &\equiv .\beta \text{ sm } \alpha .\beta \in tʻtʻ(tʻ\alpha \uparrow t_{0}ʻ\alpha ).\\ &\equiv .\beta \text{ sm } \alpha .\beta \subset tʻ(tʻ\alpha \uparrow t_{0}ʻ\alpha )\end{aligned}$

Similar propositions hold for any other index and suffix for which $t_{m}^{n}ʻ\alpha$ or $^{n}t_{m}ʻ\alpha$ has been defined.

*106·13. $\vdash :\mu \in \text{N}_{00}\text{C}.\equiv .(\exists \alpha ).\mu =\text{N}_{00}\text{c}ʻ\alpha \quad[*100·22.*71·41]$

*106·14. $\begin{aligned}\vdash :\beta \in \mu _{(00)}.&\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \in tʻtʻ(t_{1}ʻ\mu \uparrow t_{1}ʻ\mu ).\\ &\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \in tʻt_{00}ʻ\alpha .\\ &\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \subset tʻ(\alpha \uparrow \alpha ) \quad[*64·33·11]\end{aligned}$

*106·141. $\begin{aligned}\vdash :\beta \in \mu _{0}^{1}.&\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \in tʻtʻ(t_{1}ʻ\mu \uparrow t_{0}ʻ\mu ).\\ &\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \in tʻt_{0}^{1}ʻ\alpha .\\ &\equiv .(\exists \alpha ).\alpha \in \mu .\beta \text{ sm }\alpha .\beta \subset tʻ(\alpha \uparrow tʻ\alpha )\end{aligned}$

*106·2 $\vdash :x\in t_{0}ʻ\alpha .\supset .\downarrow xʻʻ\alpha \in \text{N}_{00}\text{c}ʻ\alpha .\downarrow xʻʻ\alpha \in \text{N}_{0}\text{c}ʻ\downarrow xʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*55·15.&\supset \vdash :R\in \downarrow xʻʻ\alpha .\supset .\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR=\iota ʻx:\\ [*63·105] &\supset \vdash \colon\ldotp x\in t_{0}ʻ\alpha .\supset :R\in \downarrow xʻʻ\alpha .\supset _{R}.\text{D}ʻR\subset t_{0}ʻ\alpha .\text{ᗡ}ʻR\subset t_{0}ʻ\alpha .\\ [*35·83] &\supset _{R}.R\unicode{x2abd} t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha .\\ [*64·16·13] &\supset _{R}.R\in tʻ(\alpha \uparrow \alpha ):\\ [*22·1] &\supset :\downarrow xʻʻ\alpha \subset tʻ(\alpha \uparrow \alpha ) &\qquad \text{(1)}\\ \vdash .(1).*73·611.*106·1.*103·12.&\supset \vdash .\text{Prop} \end{array}$

*106·201. $\vdash :\beta \in tʻ\alpha .\supset .\downarrow \beta ʻʻ\alpha \in \text{N}_{0}^{1}\text{c}ʻ\alpha$

*106·202. $\vdash :\beta \in t^{2}ʻ\alpha .\supset .\downarrow \beta ʻʻ\alpha \in \text{N}_{0}^{2}\text{c}ʻ\alpha$

*106·203. $\vdash .\downarrow \alpha ʻʻ\alpha \in \text{N}_{0}^{1}\text{c}ʻ\alpha \quad[*106·201]$

*106·204. $\vdash .\downarrow (\iotaʻʻ\alpha )ʻʻ\alpha \in \text{N}_{0}^{2}\text{c}ʻ\alpha \quad[*106·202]$

*106·21. $\vdash .\exists !\text{N}_{00}\text{c}ʻ\alpha .\text{N}_{00}\text{c}ʻ\alpha \in \text{N}_{0}\text{C} \quad[*106·2.*63·18]$

*106·211. $\vdash .\Lambda {\sim}\in \text{N}_{00}\text{C}.\text{N}_{00}\text{C}\subset \text{N}_{0}\text{C}.\text{N}_{00}\text{C}\in \text{Cls ex}^{2}\,\text{excl} \quad[*106·21.*103·24]$

*106·212. $\vdash .\Lambda {\sim}\in \text{N}_{0}^{1}\text{C}.\text{N}_{0}^{1}\text{C}\subset \text{N}_{0}\text{C}.\text{N}_{0}^{1}\text{C}\in \text{Cls ex}^{2}\,\text{excl} \quad[*106·203]$

*106·213. $\vdash .\Lambda {\sim}\in \text{N}_{0}^{2}\text{C}.\text{N}_{0}^{2}\text{C}\subset \text{N}_{0}\text{C}.\text{N}_{0}^{2}\text{C}\in \text{Cls ex}^{2}\,\text{excl} \quad[*106·204]$

*106·22. $\vdash :\lambda \in \text{N}_{0}^{1}\text{c}ʻ\alpha .\equiv .\text{Cnv}ʻʻ\lambda \in ^{1}\text{N}_{0}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*73·4. \supset \vdash :\lambda \text{ sm }\alpha .&\equiv .\text{Cnv}ʻʻ\lambda \text{ sm }\alpha &\qquad \text{(1)}\\ \vdash .*64·16. \supset \vdash \colon\ldotp \lambda \subset tʻ(t_{0}ʻ\alpha \uparrow tʻ\alpha ).&\equiv :R\in \lambda .\supset _{R}.R\,\unicode{x2abd}\,t_{0}ʻ\alpha \uparrow tʻ\alpha :\\ [*35·84] &\equiv :R\in \lambda .\supset _{R}.\breve{R}\,\unicode{x2abd}\, tʻ\alpha \uparrow t_{0}ʻ\alpha :\\ [*37·63] &\equiv :S\in \text{Cnv}ʻʻ\lambda .\supset _{S}.S\,\unicode{x2abd}\, tʻ\alpha \uparrow t_{0}ʻ\alpha :\\ [*64·16] &\equiv :\text{Cnv}ʻʻ\lambda \subset tʻ(tʻ\alpha \uparrow t_{0}ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).*106·12.\supset \vdash .\text{Prop} \end{array}$

The proof requires, in addition to *106·12, its analogue for $^{1}\text{N}_{0}\text{c}ʻ\alpha$ . Such analogues will be assumed as required.

*106·221. $\vdash :\lambda \in \text{N}_{0}^{2}\text{c}ʻ\alpha .\equiv .\text{Cnv}ʻʻ\lambda \in ^{2}\text{N}_{0}\text{c}ʻ\alpha$

*106·222. $\vdash .\Lambda {\sim}\in ^{1}\text{N}_{0}\text{C}.^{1}\text{N}_{0}\text{C}\subset \text{N}_{0}\text{C}.^{1}\text{N}_{0}\text{C}\in \text{Cls ex}^{2}\,\text{excl} \quad[*106·22·212]$

*106·223. $\vdash .\Lambda {\sim}\in ^{2}\text{N}_{0}\text{C}.^{2}\text{N}_{0}\text{C}\subset \text{N}_{0}\text{C}.^{2}\text{N}_{0}\text{C}\in \text{Cls ex}^{2}\,\text{excl}$

Other propositions of the same kind as the above may be proved by observing that, if $m$ and $n$ are indices for which $t^{m}ʻ\alpha$ and $t^{n}ʻ\alpha$ have been defined, we have $\gamma \subset t^{n}ʻ\alpha .\beta \in \text{N}^{m}\text{c}ʻ\alpha .\supset .\downarrow \beta ʻʻ\gamma \in \text{N}^{m}\text{c}ʻ\alpha ,$ of which the proof is direct and simple. Hence, since we always have $\exists !\text{N}^{m}\text{c}ʻ\alpha$ , we also always have $\begin{aligned} &\exists !\text{N}^{m}\text{c}ʻ\alpha ,\\ \text{whence}\qquad \text{N}^{mm}\text{C}\subset \text{N}_{0}\text{C}.&\text{N}^{mm}\text{C}\in \text{Cls ex}^{2}\,\text{excl}. \end{aligned}$ We have in like manner $\exists !\text{N}_{0}^{m}\text{c}ʻ\alpha .\exists !^{m}\text{N}_{0}\text{c}ʻ\alpha.$ But we do not always have $\exists !\text{N}_{mn}\text{c}ʻ\alpha \,\,\text{or}\,\, \exists !\text{N}_{n}^{m}\text{c}ʻ\alpha \,\,\text{or}\,\, \exists !^{m}\text{N}_{n}\text{c}ʻ\alpha .$

*106·23. $\vdash :\beta \in \text{N}^{1}\text{c}ʻ\alpha .\supset .\text{N}^{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\beta$

Dem. $\begin{array}{l} &\vdash .*64·33.*104·1.*63·5 .\supset \vdash :\text{Hp}.\supset .t^{11}ʻ\alpha =t_{00}ʻ\beta \\ &\vdash .(1).(*106·01·011).*100·321.\supset \vdash .\text{Prop} \end{array}$

*106·231. $\vdash :\beta \in \text{N}_{1}\text{c}ʻ\alpha .\supset .\text{N}_{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\beta \quad[\text{Proof as in}\, *106·23]$

*106·24. $\vdash :\text{N}^{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\supset .\text{N}^{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\beta \quad[*106·23]$

*106·241. $\vdash :\text{N}_{1}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\beta .\supset .\text{N}_{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\beta$

The analogues of the above propositions for other indices or suffixes are similarly proved.

*106·25. $\vdash .\text{N}^{11}\text{c}ʻ\alpha =\text{N}_{00}\text{c}ʻ\iotaʻʻ\alpha \quad[*106·23.*104·2]$

*106·251. $\vdash .\text{N}_{00}\text{c}ʻ\alpha =\text{N}_{11}\text{c}ʻ\iotaʻʻ\alpha$

*106·31. $\begin{aligned}\vdash :x,y\in t_{0}ʻ\alpha .t_{0}ʻ\alpha &=t_{0}ʻ\beta .x\neq y.\supset .\\ &\downarrow xʻʻ\alpha \in \text{N}_{00}\text{c}ʻ\alpha .\downarrow yʻʻ\beta \in \text{N}_{00}\text{c}ʻ\beta .\downarrow xʻʻ\alpha \cap \downarrow xʻʻ\beta =\Lambda \\ \quad[*106·2.*55·233]\end{aligned}$

*106·311. $\begin{aligned}\vdash \colon\ldotp x\in t_{0}ʻ\alpha .t_{0}ʻ\alpha &=t_{0}ʻ\beta :\alpha =\Lambda .\lor.\beta =\Lambda :\supset .\\ &\downarrow xʻʻ\alpha \in \text{N}_{00}\text{c}ʻ\alpha .\downarrow xʻʻ\beta \in \text{N}_{00}\text{c}ʻ\beta .\downarrow xʻʻ\alpha \cap \downarrow xʻʻ\beta =\Lambda \\ \quad[*106·2.*55·232.\text{Transp}]\end{aligned}$

*106·312. $\begin{aligned}\vdash :&t_{0}ʻ\alpha =\iota ʻx.\alpha =\beta =\iota ʻx.\supset .\\ &\iota ʻ(\iota ʻx\uparrow \iota ʻx)\in \text{N}_{00}\text{c}ʻ\alpha .\iota ʻ(\Lambda \uparrow \iota ʻx)\in \text{N}_{00}\text{c}ʻ\beta .\iota ʻ(\iota ʻx\uparrow \iota ʻx)\cap \iota ʻ(\Lambda \uparrow \iota ʻx)=\Lambda \end{aligned}$

Dem. $\begin{array}{l} \vdash .*73·43.&\supset \vdash .\iota ʻ(\iota ʻx\uparrow \iota ʻx)\text{ sm }\iota ʻx.\iota ʻ(\Lambda \uparrow \iota ʻx)\text{ sm }\iota ʻx.\\ [*13·12] &\supset \vdash :\text{Hp}.\supset .\iota ʻ(\iota ʻx\uparrow \iota ʻx)\text{ sm }\alpha .\iota ʻ(\Lambda \uparrow \iota ʻx)\text{ sm }\beta &\qquad \text{(1)}\\ \vdash .*64·16.&\supset \vdash :\text{Hp}.\supset .\iota ʻx\uparrow \iota ʻx\in t_{00}ʻ\alpha .\Lambda \uparrow \iota ʻx\in t_{00}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*106·1.*51·161.*24·54.*55·202.&\supset \vdash .\text{Prop} \end{array}$

*106·32. $\vdash :t_{0}ʻ\alpha =t_{0}ʻ\beta .\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}_{00}\text{c}ʻ\alpha .\delta \in \text{N}_{00}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda$

Dem. $\begin{array}{l} \vdash .*106·31.\supset \vdash \colon\ldotp \text{Hp}:(\exists x,y).x,y\in t_{0}ʻ\alpha .x\neq y:\supset .\\ (\exists \gamma ,\delta ).\gamma \in \text{N}_{00}\text{c}ʻ\alpha .\delta \in \text{N}_{00}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda &\qquad \text{(1)}\\ \vdash .*52·4. \supset \vdash :{\sim}(\exists x,y).x,y\in t_{0}ʻ\alpha .x\neq y.\supset .t_{0}ʻ\alpha \in 1\cup \iota ʻ\Lambda .\\ [*63·18] \supset .t_{0}\alpha \in 1 &\qquad \text{(2)}\\ \vdash .(2).*60·38.*63·105.*52·46.\supset \vdash :{\sim}(\exists x,y).x,y\in t_{0}ʻ\alpha .x\neq y.\exists !\alpha .\exists !\beta .\supset .\\ \alpha =\beta =t_{0}ʻ\alpha .t_{0}ʻ\alpha \in 1.\\ [*106·312] \supset .(\exists \gamma ,\delta ).\gamma \in \text{N}_{00}\text{c}ʻ\alpha .\delta \in \text{N}_{00}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda &\qquad \text{(3)}\\ \vdash .*106·311.*63·18.\supset \\ \vdash \colon\ldotp \text{Hp}:{\sim}(\exists !\alpha .\exists !\beta ):\supset .(\exists \gamma ,\delta ).\gamma \in \text{N}_{00}\text{c}ʻ\alpha .\delta \in \text{N}_{00}\text{c}ʻ\beta .\gamma \cap \delta =\Lambda &\qquad \text{(4)}\\ \vdash .(1).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*106·4. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(00)}=\text{N}_{00}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*106·14.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \beta \in \mu _{00}.&\equiv :(\exists \gamma ).\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\beta \text{ sm }\gamma .\beta \in tʻt_{00}ʻ\gamma :\\ [*64·3] &\equiv :(\exists \gamma ).\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\beta \text{ sm }\gamma :\beta \in tʻt_{00}ʻ\alpha :\\ [*102·84] & \equiv :\beta \text{ sm }\alpha .\beta \in tʻt_{00}ʻ\alpha :\\ [*106·1] &\equiv :\beta \in \text{N}_{00}\text{c}ʻ\alpha \colon\colon \supset \vdash .\text{Prop} \end{array}$

*106·401. $\vdash :\mu =\text{N}^{1}\text{c}ʻ\alpha .\supset .\mu _{(00)}=\text{N}^{11}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*104·24.*106·4.\supset \vdash :\text{Hp}.\supset .\mu _{(00)}&=\text{N}_{00}\text{c}ʻ\iotaʻʻ\alpha \\ [*106·25] &=\text{N}^{11}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*106·402. $\vdash :\mu =\text{N}_{1}\text{c}ʻ\alpha .\exists !\mu .\supset .\mu _{(00)}=\text{N}_{11}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*106·231. \supset \vdash :\text{Hp}.\beta \in \mu .\supset .\text{N}_{11}\text{c}ʻ\alpha &=\text{N}_{00}\text{c}ʻ\beta \\ [*106·4.*103·26] & =\mu _{(00)} &\qquad \text{(1)}\\ \vdash .(1).*10·11·23·35.&\supset \vdash :\text{Hp}.\exists !\mu .\supset .\mu _{(00)}=\text{N}_{11}\text{c}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*106·41. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu ^{(11)}=\text{N}^{11}\text{c}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*63·54.(*106·041).*103·27.\supset \\ \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \beta \in \mu ^{(11)}.&\equiv :(\exists \gamma ).\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\beta \text{ sm }\gamma :\beta \in tʻt^{11}ʻt_{0}ʻ\alpha :\\ [*102·84.*64·32] &\equiv :\beta \text{ sm }\alpha .\beta \in tʻt^{11}ʻ\alpha :\\ [(*106·011)] &\equiv :\beta \in \text{N}^{11}\text{c}ʻ\alpha \colon\colon \supset \vdash .\text{Prop} \end{array}$

*106·411. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu _{(11)}=\text{N}_{11}\text{c}ʻ\alpha \quad[\text{Proof as in}\, *106·41]$

*106·43. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.tʻ\mu =tʻ\nu .\supset .(\exists \gamma ,\delta ).\gamma \in \mu _{(00)}.\delta \in \nu _{(00)}.\gamma \cap \delta =\Lambda$

Dem. $\begin{array}{l} \vdash .*103·2.\supset \vdash :\text{Hp}.&\supset .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\\ [*106·4] &\supset .(\exists \alpha ,\beta ).\mu _{(00)}=\text{N}_{00}\text{c}ʻ\alpha .\nu _{(00)}=\text{N}_{00}\text{c}ʻ\beta .\\ [*106·32] &\supset .(\exists \gamma ,\delta ).\gamma \in \mu _{(00)}.\delta \in \nu _{(00)}.\gamma \cap \delta =\Lambda :\supset \vdash .\text{Prop} \end{array}$

*106·44. $\vdash :\mu ,\nu \in \text{N}_{00}\text{C}.tʻ\mu =tʻ\nu .\supset .(\exists \gamma ,\delta ).\gamma \in \mu .\delta \in \nu .\gamma \cap \delta =\Lambda \quad[*106·32]$

The following propositions are analogous to *102·71 ff., and similar remarks apply to them.

*106·5. $\begin{aligned}\vdash :R\in \text{Cls}\rightarrow &1.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR\subset \text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha ).\\ &W=\hat{x} \hat{y} \{x,y\in \alpha .{\sim}x(\breve{R} ʻx)y\}.\supset .W{\sim}\in \text{ᗡ}ʻR.W\unicode{x2abd} \alpha \uparrow \alpha\end{aligned}$

Dem. $\begin{array}{l} \vdash .*4·73.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp x,y\in \alpha .&\supset _{x,y}:xWy.\equiv .{\sim}x(\breve{R} ʻx)y:\\ [*5·18] &\supset _{x,y}:{\sim}\{xWy.\equiv .x(\breve{R} ʻx)y\}\colon\ldotp \\ [*10·1] \supset \colon\ldotp x\in \alpha .&\supset _{x}.{\sim}\{xWx.\equiv .x(\breve{R} ʻx)x\}.\\ [*21·43.\text{Transp}] &\supset _{x}.W\neq \breve{R} ʻx\colon\ldotp [\text{Hp}] \supset \colon\ldotp x\in \text{D}ʻR.\supset _{x}.W\neq \breve{R} ʻx\colon\ldotp \\ [*71·411.\text{Transp}] &\supset \colon\ldotp W{\sim}\in \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash .*21·33.(*35·04).&\supset \vdash :\text{Hp}.\supset .W\,\unicode{x2abd}\, \alpha \uparrow \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*106·51. $\vdash :\beta \subset \alpha .\supset .{\sim}\{\beta \text{ sm }\text{Rl}ʻ(\alpha \uparrow \alpha )\}$

Dem. $\begin{array}{l} \vdash .*106·5. \supset \vdash :\text{Hp}.R\in 1\rightarrow 1.\text{D}ʻR=&\beta .\text{ᗡ}ʻR\subset \text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha ).\supset .\\ &(\exists W).W\in \text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha ).W{\sim}\in \text{ᗡ}ʻR.\\ [*13·14] &\supset .\text{ᗡ}ʻR\neq \text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha ) &\qquad \text{(1)}\\ \vdash .(1).*22·41.\supset \vdash \colon\ldotp \text{Hp}.&\supset :R\in 1\rightarrow 1.\text{D}ʻR=\beta .\supset _{R}.\text{ᗡ}ʻR \neq \text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha ):\\ [*10·51.*73·1] &\supset :{\sim}{\beta \text{ sm }\text{ᗡ}ʻʻʻ(\alpha \uparrow \alpha )}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*106·52. $\vdash :\beta \subset t_{0}ʻ\alpha .\supset .\beta {\sim}\in \text{Nc}ʻt_{00}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*106·51.\supset \vdash :\text{Hp}.&\supset .{\sim}\{\beta \text{ sm }\text{Rl}ʻ(t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha)\}.\\ [*64·54] &\supset .{\sim}\{\beta \text{ sm }t_{00}ʻ\alpha\}.\\ [*100·1] &\supset .\beta {\sim}\in \text{Nc}ʻt_{00}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*106·53. $\vdash .\text{Nc}(\alpha )ʻt_{00}ʻ\alpha =\Lambda \quad[*106·52.*102·6.*63·371]$

*106·54. $\vdash .\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha {\sim}\in \text{N}_{00}\text{C}$

Dem. $\begin{array}{l} \vdash .*100·33.*103·15.&\supset \\ \vdash :\text{N}_{00}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha .&\supset .\beta \text{ sm }t_{00}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*103·12.(*106·01).&\supset \\ \vdash :\text{N}_{00}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha .&\supset .t_{00}ʻ\alpha \in tʻt_{00}ʻ\beta .\\ [*63·16.(*64·01)] &\supset .tʻtʻ(t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha )=tʻtʻ(t_{0}ʻ\beta \uparrow t_{0}ʻ\beta ).\\ [*63·391] &\supset .tʻ(t_{0}ʻ\alpha \uparrow t_{0}ʻ\alpha )=tʻ(t_{0}ʻ\beta \uparrow t_{0}ʻ\beta ) .\\ [*64·3.(*64·01)] &\supset .t_{0}ʻ\alpha =t_{0}ʻ\beta .\\ [*63·105] &\supset .\beta \subset t_{0}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{N}_{00}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha .\supset .\beta \in \text{Nc}ʻt_{00}ʻ\alpha .\beta \subset t_{0}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}.*106·52.&\supset \vdash .(\beta ).\text{N}_{00}\text{c}ʻ\beta \neq \text{N}_{0}\text{c}ʻt_{00}ʻ\alpha .\\ [*106·13.\text{Transp}] &\supset \vdash .\text{N}_{0}\text{c}ʻt_{00}ʻ\alpha {\sim}\in \text{N}_{00}\text{C}.\supset \vdash .\text{Prop} \end{array}$

*106·55. $\vdash .\exists !\text{N}_{0}\text{C}-\text{N}_{00}\text{C} \quad[*106·54]$

In the present section, we have to consider the arithmetical operations as applied to cardinals, as well as the relation of greater and less between cardinals. Thus the topics to be dealt with in this section are the first that can properly be said to belong to Arithmetic.

The treatment of addition, multiplication and exponentiation to be given in what follows is guided by the desire to secure the greatest possible generality. In the first place, everything to be said generally about the arithmetical operations must apply equally to finite and infinite classes or cardinals. In the second place, we desire such definitions as shall allow the number of summands in a sum or of factors in a product to be infinite. In the third place, we wish to be able to add or multiply two numbers which are not necessarily of the same type. In the fourth place, we wish our definitions to be such that the sum of the cardinal numbers of two or more classes shall depend only upon the cardinal numbers of those classes, and shall be the same when the classes overlap as when they are mutually exclusive; with similar conditions for the product. The desire to obtain definitions fulfilling all these conditions leads to somewhat more complicated definitions than would otherwise be required; but in the outcome, the result is simpler than if we started with simpler definitions, since we avoid vexatious exceptions.

The above observations will become clearer through their applications. Let us begin with the case of arithmetical addition of two classes.

If $\alpha$ and $\beta$ are mutually exclusive classes, the sum of their cardinal numbers will be the cardinal number of $\alpha \cup \beta$ . But in order that $\alpha$ and $\beta$ may be mutually exclusive, they must have no common members, and this is only significant when they are of the same type. Hence, given two perfectly general classes $\alpha$ and $\beta$ , we require to find two classes which are mutually exclusive and are respectively similar to $\alpha$ and $\beta$ ; if these two classes are called $\alpha'$ and $\beta'$ , then $\text{Nc}ʻ(\alpha' \cup \beta')$ will be the sum of the cardinal numbers of $\alpha$ and $\beta$ . We note that $\Lambda \cap \alpha$ and $\Lambda \cap \beta$ indicate respectively the $\Lambda$ 's of the same types as $\alpha$ and $\beta$ , and accordingly we take as $\alpha'$ and $\beta'$ the two classes $\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha\,\,\text{and}\,\,(\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta ;$ [Pg 67] these two classes are always of the same type, always mutually exclusive, and always similar to $\alpha$ and $\beta$ respectively. Hence we define $\alpha +\beta =\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha \cup (\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta \quad\text{Df}.$

The sum of the cardinal numbers of $\alpha$ and $\beta$ will then be the cardinal number of $\alpha + \beta$ ; hence we may call $\alpha + \beta$ the arithmetical class-sum of two classes, in contradistinction to $\alpha \cup \beta$ , which is the logical sum. It will be noted that $\alpha + \beta$ , unlike $\alpha \cup \beta$ , does not require that $\alpha$ and $\beta$ should be of the same type. Also $\alpha + \alpha$ is not identical with $\alpha$ , but when $\alpha = \Lambda$ , $\alpha + \alpha$ is also $\Lambda$ , though in a different type. Thus the law of tautology does not hold of the arithmetical class-sum of two classes.

If $\mu$ and $\nu$ are two cardinals of assigned types, we denote their arithmetical sum by $\mu +_{\text{c}} \nu$ . (As many kinds of arithmetical addition occur in our work, and as it is essential to our purpose to distinguish them, we effect the distinction by suffixes to the sign of addition. It is, of course, only in dealing with principles that these different symbols are needed: we do not wish to suggest that they should be adopted in ordinary mathematics.) Now if $\mu +_{\text{c}} \nu$ is to have the properties which we commonly associate with the sum of two cardinals, it must be typically ambiguous, and must be the cardinal number of any class which can be divided into two mutually exclusive parts having $\mu$ terms and $\nu$ terms respectively. Hence we are led to the following definition: $\mu +_{\text{c}}\nu =\hat{\xi} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\} \quad\text{Df}.$

In this definition, various points should be noted. In the first place, it does not require that $\mu$ and $\nu$ should be of the same type; $\mu +_{\text{c}} \nu$ is significant whenever $\mu$ and $\nu$ are classes of classes. Thus it is not necessary for significance that $\mu$ and $\nu$ should be cardinals, though if they are not both cardinals, $\mu +_{\text{c}} \nu = \Lambda$ . If they are both cardinals, we find $\mu +_{\text{c}}\nu =\hat{\xi} \{(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm } (\alpha +\beta )\}.$

Thus in this case $\alpha \in \mu .\beta \in \nu .\supset .\alpha+\beta \in \mu +_{\text{c}}\nu$ .

Hence if neither $\mu$ nor $\nu$ is null, and if $\alpha$ has $\mu$ terms and $\beta$ has $\nu$ terms, $\alpha + \beta$ is a member of $\mu +_{\text{c}} \nu$ . It easily follows that $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\supset .\mu +_{\text{c}}\nu =\text{Nc}ʻ(\alpha +\beta ).$

Hence when $\mu$ and $\nu$ are homogeneous cardinals (i.e. when they are cardinals other than $\Lambda$ ), their sum is the number of the arithmetical class-sum of any two classes having $\mu$ terms and $\nu$ terms respectively.

A few words are necessary to explain why, in the definition, we put $\mu = \text{N}_{0}\text{c}ʻ\alpha . \nu =\text{N}_{0}\text{c}ʻ\beta$ rather than $\mu = \text{Nc}ʻ\alpha .\nu = \text{Nc}ʻ\beta$ . The reason is this. Suppose either $\mu$ or $\nu$ , say $\mu$ , is $\Lambda$ . Then, by *102·73, $\mu = \text{Nc}(\zeta)ʻtʻ\zeta$ , if $\zeta$ is of the appropriate type. Hence if we had put $\mu +_{\text{c}}\nu =\hat{\xi} \{(\exists \alpha , \beta ).\mu =\text{Nc}ʻ\alpha .\nu =\text{Nc}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\} \quad\text{Df},$ [Pg 68] where the ambiguities of type involved in $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ may be determined as we please, we should have $\begin{aligned} \nu &=\text{Nc}ʻ\beta .\supset .tʻ\zeta +\beta \in \mu +_{\text{c}}\nu ,\\ \textit{i.e.}\qquad \nu &=\text{Nc}ʻ\beta .\supset .tʻ\zeta +\beta \in \Lambda +_{\text{c}} \nu . \end{aligned}$ We should also have $tʻtʻ\zeta +\beta \in \Lambda +_{\text{c}}\nu$ and so on. Thus $\Lambda +_{\text{c}}\nu$ would not have a definite value, i.e. it would not merely have typical ambiguity, which it ought to have, but it would not have a definite value even when its type was assigned. Thus such a definition would be unsuitable. For the above reasons, we put $\mu =\text{N}_{0}\text{c}ʻ\alpha . \nu =\text{N}_{0}\text{c}ʻ\beta$ in the definition, and obtain the typical ambiguity which we desire by means of the typical ambiguity of the " $\text{sm}$ " in " $\xi \text{ sm }(\alpha +\beta)$ ." It is always essential to right symbolism that the values of typically ambiguous symbols should be unique as soon as their type is assigned. The scope of these definitions and of the corresponding definitions for multiplication and exponentiation (*113·04 ·05.*116·03 ·04) is extended by convention $\text{IIT}$ of the prefatory statement.

The above definition of $\mu +_{\text{c}}\nu$ is designed for the case in which $\mu$ and $\nu$ are typically definite. But we must be able to speak of " $\text{Nc}ʻ\gamma+_{\text{c}}\text{Nc}ʻ\delta$ ," and this must be a definite cardinal, namely $\text{Nc}ʻ(\gamma +\delta)$ . If we simply write $\text{Nc}ʻ\gamma , \text{Nc}ʻ\delta$ in place of $\mu$ , $\nu$ in the definition of $\mu +_{\text{c}}\nu$ , we find $\text{Nc}ʻ\gamma +_{\text{c}}\text{Nc}ʻ\delta =\hat{\xi} \{(\exists \alpha ,\beta ).\text{Nc}ʻ\gamma =\text{N}_{0}\text{c}ʻ\alpha .\text{Nc}ʻ\delta =\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\}.$ But this will not always have a definite value when the type of $\text{Nc}ʻ\gamma +_{\text{c}}\text{Nc}ʻ\delta$ is assigned. To take a simple case, write $tʻ\zeta$ for $\gamma$ and $tʻy$ for $\delta$ . Then $\text{Nc}ʻtʻ\zeta +_{\text{c}}\text{Nc}ʻtʻy=\hat{\xi} \{(\exists \alpha ,\beta ).\text{Nc}ʻtʻ\zeta =\text{N}_{0}\text{c}ʻ\alpha .\text{Nc}ʻtʻy=\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\}.$ whence we easily obtain $\text{Nc}ʻtʻ\zeta +_{\text{c}}\text{Nc}ʻtʻy=\hat{\xi} \{(\exists \alpha ).\text{Nc}ʻtʻ\zeta =\text{N}_{0}\text{c}ʻ\alpha .\xi \text{ sm }(\alpha +\iota ʻy)\}.$ If we determine the ambiguity of $\text{Nc}ʻtʻ\zeta$ to be $\text{N}_{1}\text{c}ʻtʻ\zeta$ , we find $\text{Nc}ʻtʻ\zeta +_{\text{c}}\text{Nc}ʻ\iota ʻy=\Lambda$ in all types; but if we determine the ambiguity to be $\text{N}_{0}\text{c}ʻtʻ\zeta$ , we have $\text{Nc}ʻtʻ\zeta +_{\text{c}}\text{Nc}ʻ\iota ʻy=\text{Nc}ʻ(tʻ\zeta +\iota ʻy),$ and this exists in the type of $tʻ\zeta +\iota ʻy$ , if not in lower types. Hence the value of $\text{Nc}ʻtʻ\zeta+_{\text{c}}\text{Nc}ʻ\iota ʻy$ depends upon the determination of the ambiguity of $\text{Nc}ʻtʻ\zeta$ . It is obvious that we want our definition to yield $\text{Nc}ʻ\gamma +_{\text{c}}\text{Nc}ʻ\delta =\text{Nc}ʻ(\gamma +\delta )$ in all types; but in order to insure that this shall hold even when, for some values of $\zeta$ , $\text{Nc}(\zeta )ʻ\gamma =\Lambda$ , we must introduce two new definitions, namely $\begin{aligned} \text{Nc}ʻ\alpha +_{\text{c}}\mu &=\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\mu \quad\text{Df},\\ \mu +_{\text{c}}\text{Nc}ʻ\alpha &=\mu +_{\text{c}}\text{N}_{0}\text{c}ʻ\alpha \quad\text{Df},\\ \text{whence}\qquad \vdash :\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta &=\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta =\text{Nc}ʻ(\alpha +\beta ). \end{aligned}$ This definition is to be applied when " $\text{Nc}ʻ\gamma$ " and " $\text{Nc}ʻ\delta$ " occur without any[Pg 69] determination of type. On the other hand, if we have $\text{Nc}(\zeta)ʻ\gamma$ and $\text{Nc}(\eta)ʻ\delta$ , we apply the definition of $\mu +_{\text{c}}\nu$ . We shall find that whenever $\text{Nc}(\zeta )ʻ\gamma$ and $\text{Nc}(\eta )ʻ\delta$ both exist, $\text{Nc}(\zeta )ʻ\gamma +_{\text{c}} \text{Nc}(\eta )ʻ\delta =\text{N}_{0}\text{c}ʻ\gamma +_{\text{c}} \text{N}_{0}\text{c}ʻ\delta .$ Thus the above definition is only required in order to exclude values of $\zeta$ or $\eta$ for which either $\text{Nc}(\zeta )ʻ\gamma$ or $\text{Nc}(\eta )ʻ\delta$ is $\Lambda$ .

The commutative and associative laws of arithmetical addition are easily deduced from the definition of $\alpha +\beta$ . We shall have $\begin{aligned} \vdash .\alpha &+\beta =\text{Cnv}ʻʻ(\beta +a),\\ \text{whence}\qquad \vdash .\text{Nc}ʻ\alpha &+_{\text{c}}\text{Nc}ʻ\beta =\text{Nc}ʻ\beta +_{\text{c}}\text{Nc}ʻ\alpha , \end{aligned}$ because each = $\text{Nc}ʻ(\alpha +\beta)$ . A similar though slightly longer proof shows that $\begin{aligned} \vdash .(\alpha +\beta )&+\gamma \text{ sm }\alpha +(\beta +\gamma ),\\ \text{whence}\qquad \vdash .(\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta )&+_{\text{c}}\text{Nc}ʻ\gamma =\text{Nc}ʻ\alpha +_{\text{c}}(\text{Nc}ʻ\beta +_{\text{c}}\text{Nc}ʻ\gamma). \end{aligned}$

The above definition of $\alpha +\beta$ enables us to proceed to the sum of any finite number of classes, and allows any one class to recur in the summation. But it does not enable us to define the sum of an infinite number of classes. For this we need a new definition. Since an infinite number of classes cannot be given by enumeration, but only by intension, we shall have to take a class of classes $\kappa$ , and define the arithmetical sum of the members of $\kappa$ . Thus now the classes which are the summands must all be of the same type (since they are all members of $\kappa$ ), and no one class can occur more than once, since each member of $\kappa$ only counts once. (In order to deal with repetition, we must advance to multiplication, which will be explained shortly.) Thus in removing the limitation to a finite number of summands, we introduce certain other limitations. This is the reason which makes it worth while to introduce the above definition of $\alpha +\beta$ in addition to the definition now to be given.

If $\kappa$ is a class of classes, the sum of the cardinal numbers of the members of $\kappa$ will evidently be obtained by constructing a class of mutually exclusive classes whose members have a one-one relation to the members of corresponding members of $\kappa$ . Suppose $\alpha$ , $\beta$ are two different members of $\kappa$ , and suppose $x$ is a member both of $\alpha$ and of $\beta$ . Then we wish to count $x$ twice over, once as a member of $\alpha$ and once as a member of $\beta$ . The simplest way to do this is to form the ordinal couples $x\downarrow \alpha$ and $x\downarrow \beta$ , which are not identical except when $\alpha$ and $\beta$ are identical. Thus if we take all such ordinal couples, i.e. if we take the class $\hat{R} \{(\exists x).x\in \alpha .R=x\downarrow \alpha\},$ for every $\alpha$ which is a member of $\kappa$ , we get a class of mutually exclusive classes, namely the classes of the form $\downarrow\alpha ʻʻ\alpha$ , where $\alpha \in \kappa$ , each of these is similar to the corresponding member of $\kappa$ . Hence the logical sum of this class of classes, i.e. $\hat{R} \{(\exists \alpha ,x).\alpha \in \kappa .x\in \alpha .R=x\downarrow \alpha\},$ [Pg 70] has the required number of terms. Now, by *85·601, $\downarrow \alpha ʻʻ\alpha =\in \unicode{x21A7}ʻ\alpha .$ Hence the class whose logical sum we are taking is $\in\unicode{x21A7}ʻʻ\kappa$ . Hence we put $\Sigma ʻ\kappa =sʻ\in \unicode{x21A7}ʻʻ\kappa \quad\text{Df}.$ $\Sigma ʻ\kappa$ may be called the arithmetical sum of $\kappa$ , in contradistinction to $sʻ\kappa$ , which is the logical sum. Thus $\Sigma ʻ\kappa$ bears to $sʻ\kappa$ a relation analogous to that which $\alpha +\beta$ bears to $\alpha \cup \beta$ .

We put further $\Sigma \text{Nc}ʻ\kappa =\text{Nc}ʻsʻ\in\unicode{x21A7}ʻʻ\kappa \quad\text{Df}.$

Thus $\Sigma \text{Nc}ʻ\kappa$ is the sum of the numbers of members of $\kappa$ .

It is to be observed that $\Sigma \text{Nc}ʻ\kappa$ is not in general a function of $\text{Nc}ʻʻ\kappa$ . For, if two members of $\kappa$ have the same cardinal number, this will only count once in $\text{Nc}ʻʻ\kappa$ , whereas it counts twice in $\Sigma \text{Nc}ʻ\kappa$ .

We shall find that, provided $\alpha \neq \beta$ , $\Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )=\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta .$ Thus where a finite number of summands are concerned, the two definitions of addition agree, except that the first allows one class to count several times over, while the second does not.

In dealing with multiplication, our procedure is closely analogous to the procedure for addition. We first define the arithmetical class-product of two classes $\alpha$ and $\beta$ , which is a certain class whose cardinal number is the product of the cardinal numbers of $\alpha$ and $\beta$ . We write $\beta \times \alpha$ for the arithmetical class-product of $\beta$ and $\alpha$ , and define it as the class of all ordinal couples of which the referent is a member of $\alpha$ and the relatum a member of $\beta$ , i.e. as $\hat{R} \{(\exists x,y).x\in \alpha .y\in \beta .R=x\downarrow y\}.$ By *40·7, this class is $sʻ\alpha \downarrow_{,,}ʻʻ\beta$ . Hence we put $\beta \times \alpha =sʻ\alpha \downarrow_{,,}ʻʻ\beta \quad\text{Df}.$ The class $\alpha \downarrow_{,,}ʻʻ\beta$ is similar to $\beta$ , and each member of it is similar to $\alpha$ ; hence if $\text{N}_{0}\text{c}ʻ\alpha =\mu$ and $\text{N}_{0}\text{c}ʻ\beta=\nu$ , $sʻ\alpha \downarrow_{,,}ʻʻ\beta$ consists of $\nu$ classes having $\mu$ members each. The class $\alpha\downarrow_{,,}ʻʻ\beta$ is important also in connection with exponentiation.

The product of two cardinals is defined as follows: $\mu \times _{\text{c}}\nu =\hat{\xi} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha \times \beta )\} \quad\text{Df}.$ In regard to types, this definition calls for analogous remarks to those which were made on $\mu +_{\text{c}}\nu$ . Also, as before, we need definitions of $\mu \times _{\text{c}}\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\alpha \times _{\text{c}}\mu$ , whence we obtain $\text{Nc}ʻ\alpha \times _{\text{c}}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\alpha \times _{\text{c}}\text{N}_{0}\text{c}ʻ\beta \quad\text{Df}.$ [Pg 71]By means of these definitions, we can define the product of any finite number of cardinals; but in order to define products which have an infinite number of factors, we need a new definition.

If $\kappa$ is a class of classes, we take ${\in}_{\Delta}ʻ\kappa$ as its arithmetical product. In simple cases, it is easy to see the justification of this decision. E.g. let $\kappa$ consist of the three classes $\alpha _{1}$ , $\alpha _{2}$ , $\alpha _{3}$ , and let the members of $\alpha _{1}$ be $x_{1}$ , $x_{2}$ ; those of $\alpha _{2}$ , $y_{1}$ , $y_{2}$ ; those of $\alpha _{3}$ , $z_{1}$ , $z_{2}$ . Then the members of ${\in}_{\Delta}ʻ\kappa$ are $\begin{aligned} &x_{1}\downarrow \alpha _{1}\unicode{x228d} y_{1}\downarrow \alpha _{2}\unicode{x228d} z_{1}\downarrow \alpha _{3},\\ &x_{2}\downarrow \alpha _{1}\unicode{x228d} y_{1}\downarrow \alpha _{2}\unicode{x228d} z_{1}\downarrow \alpha _{3},\\ &x_{1}\downarrow \alpha _{1}\unicode{x228d} y_{2}\downarrow \alpha _{2}\unicode{x228d} z_{1}\downarrow \alpha _{3},\\ &x_{2}\downarrow \alpha _{1}\unicode{x228d} y_{2}\downarrow \alpha _{2}\unicode{x228d} z_{1}\downarrow \alpha _{3},\\ \end{aligned}$ with four more obtained by substituting $z_{2}$ for $z_{1}$ in the above. Thus $\text{Nc}ʻ{\in}_{\Delta}ʻ\kappa = 8 = \text{Nc}ʻ\alpha_{1} \times _{\text{c}} \text{Nc}ʻ\alpha _{2} \times _{\text{c}}\text{Nc}ʻ\alpha _{3}$ . In general, however, the existence of ${\in}_{\Delta}ʻ\kappa$ is doubtful, owing to the doubt as to the validity of the multiplicative axiom. (We shall return to this point shortly.) Hence there is no proof that the product of an infinite number of factors cannot be zero unless one of the factors is zero.

When $\kappa$ is a class of mutually exclusive classes, ${\in}_{\Delta}ʻ\kappa$ is similar to $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ . On account of its lower type, $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ is often more convenient than ${\in}_{\Delta}ʻ\kappa$ . Hence we put $\text{Prod}ʻ\kappa =\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa \quad\text{Df},$ or (what comes to the same thing) $\text{Prod}=\text{D}_{\in }\mid {\in}_{\Delta} \quad\text{Df}.$ For the product of the cardinal numbers of the members of $\kappa$ , we put $\Pi \text{Nc}ʻ\kappa =\text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \quad\text{Df}.$ As in the case of $\Sigma \text{Nc}ʻ\kappa$ , $\Pi \text{Nc}ʻ\kappa$ is not in general a function of $\text{Nc}ʻʻ\kappa$ . We shall have $\vdash :\alpha \neq \beta .\supset .\Pi \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )=\text{Nc}ʻ\alpha \times _{\text{c}}\text{Nc}ʻ\beta .$ Thus for products of a finite number of different factors, the two definitions of multiplication agree.

It remains to define exponentiation. Since this is not a commutative operation, it essentially involves an order as between the base and the exponent; hence we do not obtain a definition of the exponentiation of a class $\kappa$ , analogous to $\Sigma \text{Nc}ʻ\kappa$ or $\Pi\text{Nc}ʻ\kappa$ , but only a definition of $\mu ^\nu$ , which may be extended to any finite number of exponentiations. We put $\alpha\,\text{exp}\,\beta =\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \quad\text{Df}.$ where $\alpha \downarrow_{,,}ʻʻ\beta$ has the meaning explained above, resulting from *38·03. It will be observed that, if $\text{N}_{0}\text{c}ʻ\alpha = \mu$ and $\text{N}_{0}\text{c}ʻ\beta= \nu$ , $\alpha \downarrow_{,,}ʻʻ\beta$ is a class of $\nu$ mutually exclusive classes each of which has $\mu$ terms; hence $\alpha \text{exp}\beta$ may suitably be used to define $\mu ^\nu$ . Hence we put $\mu ^\nu =\hat{\xi} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha \,\text{exp}\,\,\beta )\} \quad\text{Df},$ and for the same reasons as before, we put $\text{Nc}ʻ\alpha ^{\text{N}_{c}\text{c}ʻ\beta} = \text{N}_{0}\text{c}ʻ\alpha ^{\text{N}_{0}\text{c}ʻ\beta} \quad\text{Df}.$

The above definition of exponentiation gives the same value of $\mu^\nu$ as results from Cantor's definition by means of "Belegungen." The class of Cantor's "Belegungen" is $\begin{aligned} \hat{R} \{R\in 1\rightarrow &\text{Cls}.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR=\beta \},\\ \textit{i.e.}\qquad &(\alpha \uparrow \beta )_{\Delta }ʻ\beta, \end{aligned}$ and it is easily proved that this is similar to $\alpha \,\text{exp}\,\beta$ .

The usual formal properties of exponentiation result without much difficulty from the above definitions.

The above definition of exponentiation is so framed as to make propositions on exponentiation independent of the multiplicative axiom, except when exponentiation is to be connected with multiplication, i.e. when it is to be shown that the product of $\nu$ factors, each of which is $\mu$ , is $\mu ^\nu$ . This proposition cannot be proved generally without the multiplicative axiom. Similarly, in the theory of multiplication, the proposition that the sum of $\nu \mu$ 's is $\mu \times _{\text{c}} \nu$ requires the multiplicative axiom (as does also the proposition that a product is zero when and only when one of its factors is zero). Otherwise, the theory of multiplication proceeds without the need for employing the multiplicative axiom.

To take first the connection of addition and multiplication: this connection, in the form in which we naturally suppose it to hold, is affirmed in the proposition: $\begin{aligned} \mu ,\nu \in \text{NC}.\kappa \in \nu \cap \text{Cls excl}ʻ\mu .&\supset .sʻ\kappa \in \mu \times _{\text{c}}\nu &\qquad \text{(A)}\\ \textit{or}\qquad \mu ,\nu \in \text{NC}.\kappa \in \nu \cap \text{Cl}ʻ\mu .&\supset .\Sigma ʻ\kappa \in \mu \times _{\text{c}}\nu . \end{aligned}$ We will take the first of these as being simpler. It affirms that the sum of $\nu \mu$ 's is $\mu \times _{\text{c}}\nu$ . This can be proved when $\nu$ is finite, whether $\mu$ is finite or not; but when $\nu$ is infinite, it cannot be proved without the multiplicative axiom. This may be seen as follows. We know that $\begin{aligned} \vdash :&\mu ,\nu \in \text{NC}.\alpha \in \mu .\beta \in \nu .\supset .\\ &\alpha \downarrow_{,,}ʻʻ\beta \in \nu \cap \text{Cls excl}ʻ\mu .sʻ\alpha \downarrow_{,,}ʻʻ\beta \in \mu \times _{\text{c}}\nu &\qquad \text{(A)}\\ \end{aligned}$ Thus (A) above will result if we can prove $\kappa ,\lambda \in \nu \cap \text{Cls excl}ʻ\mu .\supset .sʻ\kappa \text{ sm }sʻ\lambda ,$ since we shall put $\alpha \downarrow_{,,}ʻʻ\beta$ for $\lambda$ , and use (B).

Since $\kappa$ , $\lambda \in \nu$ , we have $\kappa\text{ sm }\lambda$ . Assume $S\in 1\rightarrow 1.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda .$ Let $\kappa _{1}$ , $\kappa _{2}$ , ... be members of $\kappa$ , and let $\lambda _{1}$ , $\lambda _{2}$ , ... be the members of $\lambda$ which are correlated with $\kappa _{1}$ , $\kappa_{2}$ , ... by $S$ , i.e. $\lambda _{1}=\breve{S}ʻ\kappa _{1} . \lambda _{2}=\breve{S} ʻ\kappa _{2}.\text{etc}$ . We have, since $\kappa$ , $\lambda \in \text{Cl}ʻ\mu$ , [Pg 73] $\kappa _{1}\text{ sm }\lambda _{1}.\kappa _{2}\text{ sm }\lambda_{2}.\text{etc}$ . Thus $\alpha S\beta .\supset _{\alpha ,\beta}.\alpha \text{ sm }\beta$ , i.e. $S\,\unicode{x2abd}\, \text{ sm }$ . If $\kappa$ and $\lambda$ are finite, we can pick out arbitrarily a correlation $S_{1}$ for $\kappa _{1}$ and $\lambda _{1}$ , another $S_{2}$ for $\kappa _{2}$ and $\lambda _{2}$ , and so on; then $S_{1}\unicode{x228d} S_{2}\unicode{x228d}$ ... correlates $sʻ\kappa$ and $sʻ\lambda$ , and therefore $sʻ\kappa \text{ sm }sʻ\lambda$ . But when $\kappa$ and $\lambda$ are infinite, this method is impracticable. In this case, we proceed as follows.

By *73·01, $\alpha \overline{\text{ sm }} \beta =(1\rightarrow 1)\cap\overleftarrow{\text{D}}ʻ\alpha \cap \overleftarrow{\text{ᗡ}}ʻ\beta\quad\text{Df}$ .

Thus " $\alpha \overline{\text{ sm }} \alpha$ " will stand for all the permutations of a class into itself; " $\alpha \overline{\text{ sm }}\beta$ " stands for all the permutations of $\alpha$ into $\beta$ , i.e. all the $1\rightarrow 1$ 's whose domain is $\alpha$ and whose converse domain is $\beta$ . It is obvious that $\vdash :\exists !\alpha \overline{\text{ sm }} \beta \cap \gamma \overline{\text{ sm }} \delta .\supset .\alpha =\gamma .\beta =\delta .$ In the case of the $\kappa$ and $\lambda$ above, we know that $\alpha \text{ sm }\beta$ when $\alpha S\beta$ ; thus $\begin{aligned} \alpha \in \kappa .\supset _{\alpha }.\exists !\alpha \overline{\text{ sm }} (\breve{S} ʻ\alpha )\\ \text{or}\qquad\qquad\quad \beta \in \lambda .\supset _{\beta }.\exists !(Sʻ\beta )\overline{\text{ sm }} \beta .\\ \text{Put}\qquad \text{Crp}(S)ʻ\beta =(Sʻ\beta )\overline{\text{ sm }} \beta \qquad\text{Df}, \end{aligned}$ where " $\text{Crp}$ " stands for "correspondence." Thus $\text{Crp}(S)ʻ\beta$ is the class of all correspondences of $Sʻ\beta$ and $\beta$ ; $\text{Crp}(S)ʻʻ\lambda$ is the class of all such classes of correspondences. If we extract one member out of each of these classes of correspondences, we get a class of relations whose sum is a correlator of $sʻ\kappa$ and $sʻ\lambda$ ; i.e. $\varpi \in \text{D}ʻʻ{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\supset .\dot{s} ʻ\varpi \in (sʻ\kappa )\overline{\text{ sm }} (sʻ\lambda ).$ Thus the desired result follows whenever $\exists !{\in}_{\Delta }ʻ\text{Crp}(S)ʻʻ\lambda .$ Now we have $S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\supset .\text{Crp}(S)ʻʻ\lambda \in \text{Cls}^{2} \text{excl}$ .

Consequently $\text{Mult ax}.\supset :S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda .\kappa ,\lambda \in \text{Cls}^{2} \text{excl}. \supset .sʻ\kappa \text{ sm }sʻ\lambda ,$ whence, by what was said previously, $\text{Mult ax}.\supset :\kappa \in \nu \cap \text{Cls excl}ʻ\mu .\supset .sʻ\kappa \in \mu \times _{\text{c}}\nu .\Sigma \text{Nc}ʻ\kappa =\mu \times _{\text{c}}\nu .$

The consideration of ${\in}_{\Delta }ʻ\text{Crp}(S)ʻʻ\lambda$ leads similarly to the proposition $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .{\in}_{\Delta}ʻ\kappa \in \mu ^\nu .\Pi \text{Nc}ʻ\kappa =\mu ^\nu.$ The proof is closely analogous to that for the connection of addition and multiplication.

It will be seen that, in the above use of the multiplicative axiom, we have two classes of classes $\kappa$ and $\lambda$ concerning which we assume $(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda ,$ i.e. we assume that $\kappa$ and $\lambda$ are similar classes of similar classes. A slightly modified hypothesis concerning $\kappa$ and $\lambda$ will enable us to obtain many results, without the multiplicative axiom, which otherwise might be expected to require this axiom. This is effected as follows.

Put $\kappa \text{ sm } \text{ sm } \lambda .\equiv .(\exists T).T\in 1\rightarrow 1.\text{ᗡ}ʻT=sʻ\lambda .\kappa =T_{\in }ʻʻ\lambda$ , where " $\text{ sm }\text{ sm }$ " is a single symbol representing a relation.

When this relation holds between $\kappa$ and $\lambda$ , we shall say that $\kappa$ and $\lambda$ have "double similarity." In this case, $T$ correlates $sʻ\kappa$ and $sʻ\lambda$ , while $T_{\in}$ correlates $\kappa$ and $\lambda$ , so that if $\beta$ is a member of $\lambda$ , $T_{\in }ʻ\beta$ , i.e. $Tʻʻ\beta$ , is its correlate in $\kappa$ . We shall then have $\begin{aligned} &\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .sʻ\kappa \text{ sm } sʻ\lambda ,\\ &\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .\Sigma \text{Nc}ʻ\kappa =\Sigma \text{Nc}ʻ\lambda ,\\ &\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .\Pi \text{Nc}ʻ\kappa =\Pi \text{Nc}ʻ\lambda . \end{aligned}$

Also we have $\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda .$ Conversely, $\begin{aligned} &\vdash :\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda .\\ &\varpi \in \text{D}ʻʻ{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .T=\dot{s} ʻ\varpi .\supset .T\in 1\rightarrow 1.\text{ᗡ}ʻT=sʻ\lambda .\kappa =T_{\in }ʻʻ\lambda , \end{aligned}$ whence $\begin{aligned} \vdash \colon\colon \text{Mult ax}.\supset \colon\ldotp \kappa ,\lambda \in \text{Cls}^{2} \text{excl}:&(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda :\\ &\supset .\kappa \text{ sm } \text{ sm } \lambda . \end{aligned}$ Hence the multiplicative axiom is only required in order to pass from $(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda$ to $\kappa \text{ sm } \text{ sm } \lambda$ . It is this fact, and the consequent possibility of diminishing the use of the multiplicative axiom, which has led us to the employment of " $\text{sm} \,\text{sm}$ " in the present section.

We treat also, in this section, the relation of greater and less between cardinals. We say that $\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta$ when there is a part of $\alpha$ which is similar to $\beta$ , but no part of $\beta$ is similar to $\alpha$ . The principal proposition in this subject is the Schröder-Bernstein theorem, i.e. $\vdash :\mu \geq \nu .\nu \geq \mu .\supset .\mu =\nu .$ This is an immediate consequence of *73·88. It cannot be shown, without assuming the multiplicative axiom, that of any two cardinals one must be the greater, i.e. $\mu ,\nu \in \text{NC}.\mu \neq \nu .\supset :\mu >\nu .\lor.\nu >\mu.$ If we assume the multiplicative axiom, this results from Zermelo's proof that on that assumption, every class can be well-ordered, together with Cantor's proof that of any two well-ordered series which are not similar, one must be similar to a part of the other. But these propositions cannot be proved till a much later stage (*258).

*110·01. $\alpha +\beta =\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha \cup (\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta \quad\text{Df}$

$\alpha +\beta$ is called the "arithmetical class-sum" of $\alpha$ and $\beta$ . The definition is framed so as to give two mutually exclusive classes respectively similar to $\alpha$ and $\beta$ , so that the number of terms in the logical sum of these two classes is the arithmetical sum of the numbers of terms in $\alpha$ and $\beta$ respectively. $\alpha +\beta$ is significant whenever $\alpha$ and $\beta$ are classes, whatever their types may be.

By means of $\alpha +\beta$ , we define the arithmetical sum of two cardinals as follows:

*110·02. $\mu +_{\text{c}} \nu =\hat{\xi} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\} \quad\text{Df}$

This defines the "arithmetical sum of two cardinals." (It is not necessary to significance that $\mu$ and $\nu$ should be cardinals, but only that they should be classes of classes. If, however, either is not a cardinal, $\mu +_{\text{c}}\nu =\Lambda$ ). It will be observed that, when $\mu$ and $\nu$ are typically definite, so are $\alpha$ and $\beta$ in the above definition; but $\xi$ is typically ambiguous, on account of the ambiguity of " $\text{ sm }$ ." Hence $\mu +_{\text{c}}\nu$ is also typically ambiguous.

It will be shown that $\mu +_{\text{c}}\nu$ is always a cardinal, and that, if $\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta, \quad\text{then}\quad \mu +_{\text{c}}\nu =\text{Nc}ʻ(\alpha +\beta ).$ Hence whenever $\mu$ and $\nu$ are cardinals other than $\Lambda$ , $\mu +_{\text{c}}\nu$ is an existent cardinal in some types, though it may be $\Lambda$ in others.

*110·03. $\text{Nc}ʻ\alpha +_{\text{c}}\mu =\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\mu \quad\text{Df}$

*110·04. $\mu +_{\text{c}} \text{Nc}ʻ\alpha =\mu +_{\text{c}}\text{N}_{0}\text{c}ʻ\alpha \quad\text{Df}$

These definitions are needed in order to apply the definition of $\mu +_{\text{c}}\nu$ to the case in which $\mu$ and $\nu$ are replaced by typically ambiguous symbols $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ . It does not make any difference to the value of $\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta$ how the ambiguities of $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ are determined, so long as they are determined in a way that insures $\exists !\text{Nc}ʻ\alpha.\exists !\text{Nc}ʻ\beta$ ; but if there are types in which either $\text{Nc}ʻ\alpha$ or $\text{Nc}ʻ\beta$ is $\Lambda$ , we get $\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta =\Lambda$ in all types if we determine the ambiguities so that $\text{Nc}ʻ\alpha=\Lambda$ or $\text{Nc}ʻ\beta =\Lambda$ . It is in order to[Pg 76] exclude such determinations of the ambiguity that the above definitions are required. Also in connection with these definitions and the corresponding definitions *113·04 ·05 and *116·03 ·04 and *117·02 ·03, the convention $\text{IIT}$ of the prefatory statement must be noted.

The propositions of the present number begin with the properties of $\alpha + \beta$ . We show (*110·11 ·12) that $\alpha + \beta$ consists of two mutually exclusive parts, which are respectively similar to $\alpha$ and $\beta$ ; we show (*110·14) that if $\alpha$ and $\beta$ are mutually exclusive, $\alpha \cup \beta$ is similar to $\alpha + \beta$ , and (*110·15) that if $\gamma$ and $\delta$ are respectively similar to $\alpha$ and $\beta$ , then $\gamma + \delta$ is similar to $\alpha + \beta$ . We show (*110·16) that $\text{Nc}ʻ(\alpha + \beta)$ consists of all classes which can be divided into two mutually exclusive parts which are respectively similar to $\alpha$ and $\beta$ .

We then proceed (*110·2—·252) to the consideration of $\mu +_{\text{c}} \nu$ . Here $\mu$ and $\nu$ are typically definite, and the definition *110·02 applies to any typically definite symbols, such as $\text{N}_{0}\text{c}ʻ\alpha$ or $\text{Nc}(\eta )ʻ\alpha$ . We prove (*110·21) that if $\mu$ and $\nu$ are cardinals, their sum consists of all classes similar to some class of the form $\alpha + \beta$ , where $\alpha \in \mu .\beta \in \nu$ ; we prove (*110·22) that the sum of $\text{N}_{0}\text{c}ʻ\alpha$ and $\text{N}_{0}\text{c}ʻ\beta$ is $\text{Nc}ʻ(\alpha + \beta)$ , and (*110·25) that if $\mu$ and $\nu$ are cardinals, their sum is equal to the sum of the "same" cardinals in any other types in which they are not null, i.e.

*110·25. $\vdash :\mu ,\nu \in \text{NC}.\exists !\text{ sm }_{\eta }ʻʻ\mu .\exists !\text{ sm }_{\zeta }ʻʻ\nu .\supset .\mu +_{\text{c}}\nu = \text{ sm }_{\eta }ʻʻ\mu +_{\text{c}}\text{ sm }_{\zeta }ʻʻ\nu$

We then (*110·3—·351) consider $\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta$ , to which we apply the definitions *110·03·04. We have

*110·3. $\vdash .\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta = \text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta = \text{Nc}ʻ(\alpha + \beta)$ whence the other properties of $\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta$ follow from previous propositions.

We then have (*110·4—·44) various propositions on the type of $\mu +_{\text{c}}\nu$ and its existence and kindred matters. The chief of these are

*110·4. $\vdash :\exists !\mu +_{\text{c}}\nu .\supset .\mu ,\nu \in \text{NC} - \iota ʻ\Lambda .\mu ,\nu \in \text{N}_{0}\text{C}$

This proposition requires no hypothesis, because, if $\mu$ and $\nu$ are not both cardinals, $\mu +_{\text{c}}\nu = \Lambda$ , and $\Lambda$ is a cardinal, by *102·74.

Our next set of propositions (*110·5—·57) are concerned with the permutative and associative laws, which are *110·51 and *110·56 respectively.

We then (*110·6—·643) consider the addition of 0 or 1, proving (*110·61) that a cardinal is unchanged by the addition of 0, and (*110·643) that $1 +_{\text{c}}1 = 2$ .

*110·01. $\alpha +\beta = \downarrow (\Lambda \cap \beta )ʻʻ\iota ʻʻ\alpha \cup (\Lambda \cap \alpha ) \downarrow ʻʻ\iota ʻʻ\beta \quad\text{Df}$

*110·02. $\mu +_{\text{c}}\nu = \hat{\xi} \{(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta )\} \quad\text{Df}$

*110·03. $\text{Nc}ʻ\alpha +_{\text{c}}\mu = \text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\mu \quad\text{Df}$

*110·04. $\mu +_{\text{c}}\text{Nc}ʻ\alpha = \mu +_{\text{c}}\text{N}_{0}\text{c}ʻ\alpha \quad\text{Df}$

*110·1. $\begin{aligned}\vdash \colon\ldotp R\in \alpha +\beta .\equiv :&(\exists x).x\in \alpha .R = (\iota ʻx)\downarrow (\Lambda \cap \beta ).\lor.\\ &(\exists y).y\in \beta .R = (\Lambda \cap \alpha )\downarrow (\iota ʻy)\\ &[*38·13·131 .(*110·01)]\end{aligned}$

*110·101. $\vdash .(\iota ʻx)\downarrow (\Lambda \cap \beta ) \neq (\Lambda \cap \alpha )\downarrow (\iota ʻy)$

Dem. $\begin{array}{l} \vdash .*55·15. &\supset \vdash .\text{D}ʻ(\iota ʻx)\downarrow (\Lambda \cap \beta ) = \iota ʻ\iota ʻx.\text{D}ʻ(\Lambda \cap \alpha )\downarrow (\iota ʻy) = \iota ʻ(\Lambda \cap \alpha ) &\qquad \text{(1)}\\ \vdash . *51·161. &\supset \vdash .\iota ʻx \neq (\Lambda \cap \alpha ).\\ [*51·23] &\supset \vdash .\iota ʻ\iota ʻx \neq \iota ʻ(\Lambda \cap \alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{D}ʻ(\iota ʻx)\downarrow (\Lambda \cap \beta ) \neq \text{D}ʻ(\Lambda \cap \alpha )\downarrow (\iota ʻy).\supset \vdash .\text{Prop} \end{array}$

*110·11. $\vdash .\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha \cap (\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta = \Lambda$

Dem. $\begin{array}{l} \vdash .*110·101.&\supset \vdash :x\in \alpha .R = \downarrow (\Lambda \cap \beta )ʻ\iota ʻx.y\in \beta .S = (\Lambda \cap \alpha )\downarrow ʻ\iota ʻy.\supset .R \neq S:\\ [*37·67] &\supset \vdash :R\in \downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha .S\in (\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta .\supset .R \neq S &\qquad \text{(1)}\\ \vdash .(1).*24·37.\supset \vdash .\text{Prop} \end{array}$

*110·12. $\vdash .\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha \text{ sm }\alpha .(\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta \text{ sm }\beta \quad[*73·41·61·611]$

*110·11 ·12 give the justification for the use of $\alpha + \beta$ in defining arithmetical addition, since they show that $\alpha + \beta$ consists of two mutually exclusive parts which are respectively similar to $\alpha$ and $\beta$ .

*110·13. $\vdash :\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta = \Lambda .\supset .\gamma \cup \delta \text{ sm }(\alpha +\beta)$

Dem. $\begin{array}{l} \vdash .*110·12.\supset \vdash :\text{Hp}.\supset .\gamma \text{ sm }\downarrow (\Lambda \cap \beta )ʻʻ\iotaʻʻ\alpha .\delta \text{ sm }(\Lambda \cap \alpha )\downarrow ʻʻ\iotaʻʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*110·11.*73·71.\supset \vdash .\text{Prop} \end{array}$

*110·14. $\vdash :\alpha \cap \beta = \Lambda .\supset .\alpha \cup \beta \text{ sm }(\alpha +\beta ) \quad[*110·13.*73·3]$

Thus whenever $\alpha$ and $\beta$ are mutually exclusive, their logical sum may replace their arithmetical sum in defining the sum of their cardinal numbers.

*110·15. $\vdash :\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\supset .\gamma +\delta \text{ sm }\alpha +\beta$

Dem. $\begin{array}{l} \vdash .*110·12.\supset \vdash :\text{Hp}.\supset .\downarrow (\Lambda \cap \delta )ʻʻ\iotaʻʻ\gamma \text{ sm }\alpha .(\Lambda \cap \gamma )\downarrow ʻʻ\iotaʻʻ\text{ sm }\beta &\qquad \text{(1)}\\ \vdash .*110·11.\supset \vdash .\downarrow (\Lambda \cap \delta )ʻʻ\iotaʻʻ\gamma \cap (\Lambda \cap \gamma )\downarrow ʻʻ\iotaʻʻ\delta = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*110·13.\supset \\ \vdash :\text{Hp}.\supset .\downarrow (\Lambda \cap \delta )ʻʻ\iotaʻʻ\gamma \cup (\Lambda \cap \gamma )\downarrow ʻʻ\iotaʻʻ\delta \text{ sm }\alpha +\beta :\supset \vdash .\text{Prop} \end{array}$

*110·151. $\vdash \colon\ldotp \alpha \cap \beta = \Lambda .\supset :\xi \text{ sm }(\alpha \cup \beta ).\equiv .(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta$

Dem. $\begin{array}{l} \vdash .*73·71.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta .\supset .\xi \text{ sm }(\alpha \cup \beta ) &\qquad \text{(1)}\\ \vdash .*72·411.*37·25·22.*73·22.\supset \\ \vdash :S\in &1\rightarrow 1.\text{D}ʻS = \xi .\text{ᗡ}ʻS = \alpha \cup \beta .\alpha \cap \beta = \Lambda .\supset .\\ &Sʻʻ\alpha \cap Sʻʻ\beta = \Lambda .\xi = Sʻʻ\alpha \cup Sʻʻ\beta .Sʻʻ\alpha \text{ sm }\alpha .Sʻʻ\beta \text{ sm }\beta .\\ [*11·36] &\supset .(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35.*73·1.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\xi \text{ sm }(\alpha \cup \beta ).\supset .(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*110·152. $\vdash :\xi \text{ sm } (\alpha +\beta ). \equiv .(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta$

Dem. $\begin{array}{l} \vdash .*110·151·11.\supset \\ \vdash :\xi \text{ sm } (\alpha +\beta ). &\equiv .(\exists \gamma ,\delta ).\gamma \text{ sm } \downarrow (\Lambda \cap \beta )ʻʻ\iota ʻʻ\alpha .\delta \text{ sm } (\Lambda \cap \alpha )\downarrow ʻʻ\iota ʻʻ\beta .\\ &\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta .\\ [*73·37.*110·12] &\equiv .(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta :\supset \vdash .\text{Prop} \end{array}$

*110·16. $\begin{aligned}&\vdash .\text{Nc}ʻ(\alpha +\beta ) = \hat{\xi} \{(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta \}\\ &[*110·152.*100·1]\end{aligned}$

*110·17. $\vdash :\alpha \in tʻ\beta .\supset .\exists !\text{Nc}(tʻ\alpha )ʻ(\alpha +\beta )$

Dem. $\begin{array}{l} \vdash . *104·43.\supset \\ \vdash :\text{Hp}.&\supset .(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\gamma \subset tʻ\alpha .\delta \text{ sm } \beta .\delta \subset tʻ\alpha .\gamma \cap \delta = \Lambda .\\ [*22·59] & \supset .(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\gamma \cup \delta \subset tʻ\alpha .\\ [*110·16] &\supset .(\exists \xi ).\xi \subset tʻ\alpha .\xi \in \text{Nc}ʻ(\alpha +\beta ).\\ [*102·6.*63·5] &\supset .\exists !\text{Nc}(tʻ\alpha )ʻ(\alpha +\beta ):\supset \vdash .\text{Prop} \end{array}$

Thus when $\alpha$ and $\beta$ are of the same type, $\text{Nc}ʻ(\alpha +\beta )$ exists at least in the type next above that of $\alpha$ and $\beta$ . We cannot prove that it exists in the type of $\alpha$ and $\beta$ . E.g. suppose the lowest type contained only one member; then if $x$ were that one member, $\text{Nc}ʻ(\iota ʻx+\iota ʻx)$ would not exist in the type to which $\iota ʻx$ belongs, but would exist in the next type, i.e. there would not be two individuals, but there would be two classes, namely $\Lambda$ and $\iota ʻx$ , so that $\iota ʻ\Lambda \cup \iota ʻ\iota ʻx\in \text{Nc}ʻ(\iota ʻx+\iota ʻx)$ .

Dem. $\begin{array}{l} \vdash .*64·53. &\supset \vdash :x\in \alpha .\supset .\downarrow (\Lambda \cap \beta )ʻ\iota ʻx\in tʻ(tʻ\alpha \uparrow tʻ\beta ) &\qquad \text{(1)}\\ \vdash .(1).*37·61.&\supset \vdash .\downarrow (\Lambda \cap \beta )ʻʻ\iota ʻʻ\alpha \subset tʻ(tʻ\alpha \uparrow tʻ\beta ) &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash .(\Lambda \cap \alpha )\downarrow ʻʻ\iota ʻʻ\beta \subset tʻ(tʻ\alpha \uparrow tʻ\beta ) &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash .\alpha +\beta \subset tʻ(tʻ\alpha \uparrow tʻ\beta ).\\ [*63·5] & \supset \vdash .\alpha +\beta \in tʻtʻ(tʻ\alpha \uparrow tʻ\beta ).\supset \vdash .\text{Prop} \end{array}$

*110·2. $\begin{aligned}&\vdash :\xi \in \mu +_{\text{c}}\nu . \equiv .(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\alpha .\xi \text{ sm } (\alpha +\beta )\\ &[(*110·02)]\end{aligned}$

*110·201. $\begin{aligned}&\vdash \colon\ldotp \xi \in \mu +_{\text{c}}\nu . \equiv :\mu ,\nu \in \text{NC}:(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm } (\alpha +\beta )\\ &[*103·27.*110·2]\end{aligned}$

*110·202. $\begin{aligned}\vdash \colon\ldotp \xi \in &\mu +_{\text{c}}\nu . \equiv :\\ &\exists !\mu .\exists !\nu :(\exists \gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta\end{aligned}$

Dem. $\begin{array}{l} \vdash .*110·2·152 .&\supset \vdash \colon\ldotp \xi \in \mu +_{\text{c}}\nu . \equiv :\\ (\exists \alpha ,\beta ,\gamma ,\delta ).&\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta :\\ [*103·28] &\equiv :(\exists \gamma ,\delta ).\exists !\mu .\exists !\nu .\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta \colon\ldotp \\ &\supset \vdash .\text{Prop} \end{array}$

*110·21. $\begin{aligned}&\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\xi \in \mu +_{\text{c}}\nu .\equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\alpha +\beta )\\ &[*110·201]\end{aligned}$

*110·211. $\begin{aligned}\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\xi &\in \mu +_{\text{c}}\nu .\equiv .\\ &(\exists \gamma ,\delta ).\gamma \in \text{ sm }ʻʻ\mu .\delta \in \text{ sm }ʻʻ\nu .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\end{aligned}$

Dem. $\begin{array}{l} \vdash .*110·21·152.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \mu +_{\text{c}}\nu .\equiv .\\ &(\exists \alpha ,\beta ,\gamma ,\delta ).\alpha \in \mu .\beta \in \nu .\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta .\\ [*37·1] &\equiv .(\exists \gamma ,\delta ).\gamma \in \text{ sm }ʻʻ\mu .\delta \in \text{ sm }ʻʻ\nu .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*110·212. $\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\xi \in \mu +_{\text{c}}\nu .\equiv .(\exists \gamma ).\gamma \in \text{ sm }ʻʻ\mu .\gamma \subset \xi .\xi -\gamma \in \text{ sm }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*110·211.*24·47.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \mu +_{\text{c}}\nu .&\equiv .(\exists \gamma ,\delta ).\gamma \in \text{ sm }ʻʻ\mu .\delta \in \text{ sm }ʻʻ\nu .\gamma \subset \xi .\delta =\xi -\gamma .\\ [*13·195] &\equiv .(\exists \gamma ).\gamma \in \text{ sm }ʻʻ\mu .\gamma \subset \xi .\xi -\gamma \in \text{ sm }ʻʻ\nu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*110·22. $\vdash .\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta = \text{Nc}ʻ(\alpha + \beta )$

Dem. $\begin{array}{l} \vdash .*103·4.*110·211.\supset \\ \vdash :\xi \in \text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta .&\equiv .(\exists \gamma ,\delta ).\gamma \in \text{Nc}ʻ\alpha .\delta \in \text{Nc}ʻ\beta .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta .\\ [*100·31] &\equiv .(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta .\\ [*110·16] &\equiv .\xi \in \text{Nc}ʻ(\alpha + \beta ):\supset \vdash .\text{Prop} \end{array}$

*110·221. $\vdash :\xi \in \text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta .\equiv .\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\xi \in \text{Nc}ʻ(\alpha +\beta )$

Dem. $\begin{array}{l} \vdash .*110·202.&\supset \vdash \colon\ldotp \xi \in \text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta .\\ &\equiv :\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta :(\exists \gamma ,\delta ).\text{Nc}(\eta )ʻ\alpha =\text{Nc}ʻ\gamma .\\ &\text{Nc}(\zeta )ʻ\beta =\text{Nc}ʻ\delta .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta :\\ [*100·35]&\equiv :\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta :(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta :\\ [*110·16]&\equiv :\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\xi \in \text{Nc}ʻ(\alpha +\beta )\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*110·23. $\begin{aligned}\vdash :&\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\supset .\\ &\text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta =\text{Nc}ʻ(\alpha +\beta )=\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta \quad[*110·221·22]\end{aligned}$

Thus $\text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta$ is independent of $\eta$ and $\zeta$ so long as $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ exist in the types of $\eta$ and $\zeta$ respectively.

*110·231. $\begin{aligned}&\vdash \colon\ldotp \text{Nc}(\eta )ʻ\alpha =\Lambda .\lor.\text{Nc}(\zeta )ʻ\beta =\Lambda :\supset .\text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta =\Lambda\\ &[*110·221]\end{aligned}$

*110·24. $\vdash :\eta \text{ sm }\alpha .\zeta \text{ sm }\beta .\supset .\text{N}_{0}\text{c}ʻ\eta +_{\text{c}}\text{N}_{0}\text{c}ʻ\zeta =\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*103·42. \supset \vdash :\text{Hp}.&\supset.\text{N}_{0}\text{c}ʻ\eta =\text{Nc}(\eta )ʻ\alpha .\text{N}_{0}\text{c}ʻ\zeta =\text{Nc}(\zeta )ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*103·13.\supset \vdash :\text{Hp}.&\supset .\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\\ [*110·23] &\supset .\text{Nc}(\eta )ʻ\alpha +_{\text{c}}\text{Nc}(\zeta )ʻ\beta =\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*110·25. $\vdash :\mu ,\nu \in \text{NC}.\exists ! \text{ sm }_{\eta }ʻʻ\mu .\exists ! \text{ sm }_{\zeta }ʻʻ\nu .\supset .\mu +_{\text{c}}\nu = \text{ sm }_{\eta }ʻʻ\mu +_{\text{c}} \text{ sm }_{\zeta }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*103·27.\supset \vdash :\mu ,\nu \in \text{NC}.\alpha \in \mu .\beta \in \nu .\exists ! \text{ sm }_{\eta }ʻʻ\mu .\exists ! \text{ sm }_{\zeta }ʻʻ\nu .\\ \supset .\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\exists ! \text{ sm }_{\eta }ʻʻ\mu .\exists ! \text{ sm }_{\zeta }ʻʻ\nu .\\ [*103·41.*102·85]\supset .\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta . \text{ sm }_{\eta }ʻʻ\mu = \text{Nc}(\eta )ʻ\alpha .\\ \text{ sm }_{\zeta }ʻʻ\nu = \text{Nc}(\zeta )ʻ\beta .\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\\ [*110·23] \supset .\mu +_{\text{c}}\nu = \text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta = \text{ sm }_{\eta }ʻʻ\mu +_{\text{c}} \text{ sm }_{\zeta }ʻʻ\nu &\qquad \text{(1)}\\ \vdash .(1).*10·11·23·35.\supset \\ \vdash :\mu ,\nu \in \text{NC}.\exists !\mu .\exists !\nu .\exists ! \text{ sm }_{\eta }ʻʻ\mu .\exists ! \text{ sm }_{\zeta }ʻʻ\nu .\supset .\mu +_{\text{c}}\nu = \text{ sm }_{\eta }ʻʻ\mu +_{\text{c}} \text{ sm }_{\zeta }ʻʻ\nu &\qquad \text{(2)}\\ \vdash .*37·29.\text{Transp}.\supset \vdash :\exists ! \text{ sm }_{\eta }ʻʻ\mu .\exists ! \text{ sm }_{\zeta }ʻʻ\nu .\supset .\exists !\mu .\exists !\nu &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*110·251. $\vdash :\mu ,\nu \in \text{NC}.\supset .\mu ^{(1)}+_{\text{c}}\nu ^{(1)} = \mu +_{\text{c}}\nu$

Dem. $\begin{array}{l} \vdash *110·25.*104·265.\supset \\ \vdash :\text{Hp}.\exists !\mu ^{(1)}.\exists !\nu ^{(1)}.&\supset .\mu ^{(1)}+_{\text{c}}\nu ^{(1)} = \mu +_{\text{c}}\nu &\qquad \text{(1)}\\ \vdash .*110·202.&\supset \vdash :{\sim}(\exists !\mu ^{(1)}.\exists !\nu ^{(1)}).\supset .\mu ^{(1)}+_{\text{c}}\nu ^{(1)} = \Lambda &\qquad \text{(2)}\\ \vdash .*104·264.\supset \vdash :\text{Hp}(2).&\supset .{\sim}(\exists !\mu .\exists !\nu ).\\ [*110·202] &\supset .\mu +_{\text{c}}\nu = \Lambda .\\ [(2)] &\supset .\mu ^{(1)}+_{\text{c}}\nu ^{(1)} = \mu +_{\text{c}}\nu &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*110·252. $\vdash :\mu ,\nu \in \text{NC}.\supset .\mu _{(00)}+_{\text{c}}\nu _{(00)} = \mu +_{\text{c}}\nu \quad[\text{Proof as in *110·251}]$

A similar proof applies to $\mu ^{(2)}$ , $\nu ^{(2)}$ , etc., and to any such derived cardinals whose existence follows from that of $\mu$ and $\nu$ . The proposition does not hold generally for $\mu _{(1)}$ , $\nu _{(1)}$ and other descending derived cardinals, because they may be null when $\mu$ and $\nu$ exist.

The following proposition (*110·3) is more often used than any other in this number except *110·4.

*110·3. $\vdash .\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta = \text{N}_{0}\text{c}ʻ\alpha +_{\text{c}}\text{N}_{0}\text{c}ʻ\beta = \text{Nc}ʻ(\alpha +\beta ) \quad[*110·22.(*110·03·04)]$

*110·31. $\vdash :\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\supset .\text{Nc}ʻ\gamma +_{\text{c}}\text{Nc}ʻ\delta = \text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta \quad[*110·24·3]$

*110·32. $\vdash :\alpha \cap \beta = \Lambda .\supset .\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta = \text{Nc}ʻ(\alpha \cup \beta ) \quad[*110·3·14]$

*110·33. $\begin{aligned}&\vdash :\xi \in \text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta . \equiv .(\exists \gamma ,\delta ).\gamma \text{ sm } \alpha .\delta \text{ sm } \beta .\gamma \cap \delta = \Lambda .\xi = \gamma \cup \delta \\ &[*110·3·16]\end{aligned}$

The above proposition is used in *110·63. We might have used the above to define arithmetical addition, but this method would have been less convenient than the method adopted in this number, both because there would[Pg 81] have been more difficulty in dealing with types, and because the existence of $\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta$ (in the types in which it does exist) is less evident with the above definition than with the definitions given in *110·01 ·02 ·03 ·04.

*110·331. $\vdash .\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta =\hat{\xi} \{(\exists \gamma ).\gamma \text{ sm }\alpha .\xi -\gamma \text{ sm }\beta .\gamma \subset \xi\}$

Dem. $\begin{array}{l} \vdash . *110·33.*24·47.&\supset \\ \vdash :\xi \in \text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta .&\equiv .(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\beta .\gamma \subset \xi .\delta =\xi -\gamma .\\ [*13·195] &\equiv .(\exists \gamma ).\gamma \text{ sm }\alpha .\xi -\gamma \text{ sm }\beta .\gamma \subset \xi :\supset \vdash .\text{Prop} \end{array}$

*110·34. $\begin{aligned}&\vdash :\exists !\text{Nc}(\eta )ʻ\alpha .\exists !\text{Nc}(\zeta )ʻ\beta .\supset .\text{Nc}(\eta )ʻ\alpha +_{\text{c}} \text{Nc}(\zeta )ʻ\beta =\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta \\ &[*110·23·3]\end{aligned}$

*110·35. $\vdash .\text{N}^{1}\text{c}ʻ\alpha +_{\text{c}} \text{N}^{1}\text{c}ʻ\beta =\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta \quad[*104·102·21.*110·34]$

*110·351. $\vdash .\text{N}_{00}\text{c}ʻ\alpha +_{\text{c}} \text{N}_{00}\text{c}ʻ\beta =\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta \quad[*106·21.*110·34]$

The following proposition (*110·4) is the most used of the propositions in this number. It is useful both in the form given, and in the form resulting from transposition, in which it shows that $\mu +_{\text{c}}\nu =\Lambda$ unless both $\mu$ and $\nu$ are existent cardinals. It is chiefly useful in avoiding the necessity of the hypothesis $\mu$ , $\nu \in \text{NC}$ in such propositions as the commutative and associative laws.

*110·4. $\vdash :\exists !\mu +_{\text{c}} \nu .\supset .\mu ,\nu \in \text{NC}-\iota ʻ\Lambda .\mu ,\nu \in \text{N}_{0}\text{C} \quad[*110·201·202·2]$

The following propositions, down to *110·411 inclusive, are concerned with types. They are not referred to in the sequel.

*110·401. $\vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\supset .\alpha + \beta \in tʻtʻ(\mu \uparrow \nu )$

Dem. $\begin{array}{l} \vdash .*110·18.*103·12.\supset \vdash :\text{Hp}.&\supset .\alpha + \beta \in tʻtʻ(tʻ\alpha \uparrow tʻ\beta ).\alpha \in \mu .\beta \in \nu .\\ [*63·11] &\supset .\alpha + \beta \in tʻtʻ(tʻ\alpha \uparrow tʻ\beta ).tʻ\alpha =t_{0}ʻ\mu .tʻ\beta =t_{0}ʻ\nu .\\ [*13·12] &\supset .\alpha + \beta \in tʻtʻ(t_{0}ʻ\mu \uparrow t_{0}ʻ\nu ).\\ [*64·13] &\supset .\alpha + \beta \in tʻtʻ(\mu \uparrow \nu ):\supset \vdash .\text{Prop} \end{array}$

*110·402. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\supset .\exists !(\mu +_{\text{c}} \nu )\cap tʻtʻ(\mu \uparrow \nu )$

Dem. $\begin{array}{l} \vdash .*110·22.*100·3.\supset \\ \vdash :\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .&\supset .\alpha + \beta \in \mu +_{\text{c}} \nu .\\ [*110·401] &\supset .\alpha + \beta \in (\mu +_{\text{c}} \nu )\cap tʻtʻ(\mu \uparrow \nu ).\\ [*10·24] &\supset .\exists !(\mu +_{\text{c}} \nu )\cap tʻtʻ(\mu \uparrow \nu ) (1) \vdash .(1).*103·2.\supset \vdash .\text{Prop} \end{array}$

*110·403. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\equiv .\exists !(\mu +_{\text{c}} \nu )\cap tʻtʻ(\mu \uparrow \nu ) \quad[*110·402·4]$

*110·404. $\vdash .\exists !(\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta )\cap tʻtʻ(tʻ\alpha \uparrow tʻ\beta ) \quad[*110·18·3.*100·3]$

*110·41. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.tʻ\mu = tʻ\nu .\supset .\exists !(\mu +_{\text{c}}\nu )\cap tʻ\mu$

Dem. $\begin{array}{l} \vdash .*103·11.\supset \vdash :&\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .tʻ\mu = tʻ\nu .\supset .\\ &\mu \subset tʻ\alpha .\nu \subset tʻ\beta .tʻ\mu = tʻ\nu .\\ [*63·21·35] &\supset .t_{0}ʻ\mu = tʻ\alpha .t_{0}ʻ\nu = tʻ\beta .t_{0}ʻ\mu = t_{0}ʻ\nu .\\ [*13·16·17] &\supset .tʻ\alpha = tʻ\beta = t_{0}ʻ\mu .\\ [*110·17] &\supset .\exists !\text{Nc}ʻ(\alpha +\beta )\cap tʻt_{0}ʻ\mu .\\ [*110·22.*63·19] &\supset .\exists !(\mu +_{\text{c}}\nu )\cap tʻ\mu :\supset .\text{Prop} \end{array}$

*110·411. $\begin{aligned}&\vdash :tʻ\alpha = tʻ\beta .\supset .\exists !(\text{Nc}ʻ\alpha +_{\text{c}}\text{Nc}ʻ\beta )\cap tʻtʻ\alpha .\exists !\text{Nc}(tʻ\alpha )ʻ(\alpha +\beta )\\ &[*110·17·3]\end{aligned}$

It will be observed that the following proposition (*110·42) requires no hypothesis. This is owing to *110·4 and *102·74.

Dem. $\begin{array}{l} \vdash .*110·22. \supset \vdash :\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .&\supset .\mu +_{\text{c}}\nu = \text{Nc}ʻ(\alpha +\beta ).\\ [*100·41] &\supset .\mu +_{\text{c}}\nu \in \text{NC}&\qquad \text{(1)}\\ \vdash .(1).*103·2. &\supset \vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\supset .\mu +_{\text{c}}\nu \in \text{NC}&\qquad \text{(2)}\\ \vdash .*110·4.\text{Transp}.\supset .\vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).&\supset .\mu +_{\text{c}}\nu = \Lambda .\\ [*102·74] &\supset .\mu +_{\text{c}}\nu \in \text{NC} &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*110·43. $\vdash :\mu +_{\text{c}}\nu = \text{N}_{0}\text{c}ʻ\eta . \equiv .\eta \in \mu +_{\text{c}}\nu \quad[*110·42.*103·26]$

Dem. $\begin{array}{l} \vdash .*37·1.*110·2.\supset \\ \vdash :\xi \in \text{ sm }ʻʻ(\mu +_{\text{c}}\nu ). &\equiv .(\exists \eta ,\alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }(\alpha +\beta ).\xi \text{ sm }\eta .\\ [*73·3·32] &\equiv .(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha +\beta ).\\ [*110·2] &\equiv .\xi \in \mu +_{\text{c}}\nu :\supset \vdash .\text{Prop} \end{array}$

The above proposition depends upon the fact that $\mu +_{\text{c}}\nu$ is typically ambiguous, even when $\mu$ and $\nu$ are typically definite. It is used in the theory of inductive cardinals (*120·32 ·41 ·424).

The following propositions are concerned with the commutative and associative laws for arithmetical addition of cardinals.

Dem. $\begin{array}{l} \vdash .*55·14.\supset \vdash .\text{Cnv}ʻʻ(\alpha +\beta ) &= \Lambda _{\beta }\downarrow ʻʻ\iota ʻʻ\alpha \cup \downarrow \Lambda _{\alpha }ʻʻ\iota ʻʻ\beta \\ [(*110·01)] &= \beta +\alpha .\supset \vdash .\text{Prop} \end{array}$

*110·501. $\vdash .\beta + \alpha \text{ sm }\alpha + \beta \quad[*110·5.*73·4]$

*110·51. $\vdash .\mu +_{\text{c}} \nu =\nu +_{\text{c}} \mu \quad[*110·2·501.*73·37]$

It is not necessary to the truth of the above proposition that $\mu$ and $\nu$ should be cardinals. If either is not a cardinal, $\mu +_{\text{c}} \nu$ and $\nu +_{\text{c}} \mu$ are both $\Lambda$ .

*110·52. $\begin{aligned}\vdash :\xi \text{ sm }(\alpha + \beta ) + \gamma .&\equiv .(\exists \pi ,\rho ,\sigma ).\pi \text{ sm }\alpha .\rho \text{ sm }\beta .\sigma \text{ sm }\gamma .\\ &\pi \cap \rho =\Lambda .\pi \cap \sigma =\Lambda .\rho \cap \sigma =\Lambda .\xi =\pi \cup \rho \cup \sigma\end{aligned}$

Dem. $\begin{array}{l} \vdash .*110·152.\supset \vdash \colon\ldotp \xi \text{ sm }(\alpha + \beta ) + \gamma .\equiv :(\exists \eta ,\sigma ).&\eta \text{ sm }(\alpha + \beta ).\\ &\sigma \text{ sm }\gamma .\eta \cap \sigma =\Lambda .\xi =\eta \cup \sigma :\\ [*110·152] \equiv :(\exists \pi ,\rho ,\eta ,\sigma ).\pi \text{ sm }\alpha .&\rho \text{ sm }\beta .\pi \cap \rho =\Lambda .\eta =\pi \cup \rho .\\ &\sigma \text{ sm }\gamma .\eta \cap \sigma =\Lambda .\xi =\eta \cup \sigma :\\ [*13·195.*22·68.*24·32] &\equiv :(\exists \pi ,\rho ,\sigma ).\pi \text{ sm }\alpha .\rho \text{ sm }\beta .\sigma \text{ sm }\gamma .\pi \cap \rho =\Lambda .\\ &\pi \cap \sigma =\Lambda .\rho \cap \sigma =\Lambda .\xi =\pi \cup \rho \cup \sigma \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*110·521. $\begin{aligned}\vdash :&\xi \text{ sm }\alpha + (\beta + \gamma ).\equiv .(\exists \pi ,\rho ,\sigma ).\pi \text{ sm }\alpha .\rho \text{ sm }\beta .\sigma \text{ sm }\gamma .\\ &\pi \cap \rho =\Lambda .\pi \cap \sigma =\Lambda .\rho \cap \sigma =\Lambda .\xi =\pi \cup \rho \cup \sigma \quad[*110·501·52]\end{aligned}$

*110·53. $\vdash .(\alpha + \beta )+ \gamma \text{ sm }\alpha + (\beta + \gamma ) \quad[*110·52·521]$

*110·54. $\vdash .(\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta ) +_{\text{c}} \text{Nc}ʻ\gamma =\text{Nc}ʻ(\alpha + \beta + \gamma )$

Dem. $\begin{array}{l} \vdash .*110.3.\supset \vdash .(\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta ) +_{\text{c}} \text{Nc}ʻ\gamma &=\text{Nc}ʻ(\alpha + \beta ) +_{\text{c}} \text{Nc}ʻ\gamma \\ [*110·3.(*110·531)] & =\text{Nc}ʻ(\alpha + \beta + \gamma ).\supset \vdash .\text{Prop} \end{array}$

*110·541. $\vdash .\text{Nc}ʻ\alpha +_{\text{c}} (\text{Nc}ʻ\beta +_{\text{c}} \text{Nc}ʻ\gamma )=\text{Nc}ʻ(\alpha + \beta + \gamma )$

Dem. $\begin{array}{l} \vdash .*110·3.\supset \vdash .\text{Nc}ʻ\alpha +_{\text{c}} (\text{Nc}ʻ\beta +_{\text{c}} \text{Nc}ʻ\gamma )&=\text{Nc}ʻ{\alpha + (\beta + \gamma )}\\ [*110·53.(*110·531)] & =\text{Nc}ʻ(\alpha + \beta + \gamma ).\supset \vdash .\text{Prop} \end{array}$

*110·55. $\vdash .(\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\beta ) +_{\text{c}} \text{Nc}ʻ\gamma =\text{Nc}ʻ\alpha +_{\text{c}} (\text{Nc}ʻ\beta +_{\text{c}} \text{Nc}ʻ\gamma ) \quad[*110·54·541]$

*110·551. $\begin{aligned}&\vdash .(\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}} \text{N}_{0}\text{c}ʻ\beta ) +_{\text{c}} \text{N}_{0}\text{c}ʻ\gamma =\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}} (\text{N}_{0}\text{c}ʻ\beta +_{\text{c}} \text{N}_{0}\text{c}ʻ\gamma )\\ &[*110·55.(*110·03·04)]\end{aligned}$

*110·56. $\vdash .(\mu +_{\text{c}} \nu ) +_{\text{c}} \varpi =\mu +_{\text{c}} (\nu +_{\text{c}} \varpi )$

Dem. $\begin{array}{l} \vdash .*110·551.*103·2.\supset \\ \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}.&\supset .(\mu +_{\text{c}} \nu ) +_{\text{c}} \varpi =\mu +_{\text{c}} (\nu +_{\text{c}} \varpi ) &\qquad \text{(1)}\\ \vdash .*110·4.\text{Transp}.&\supset \\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}).&\supset .(\mu +_{\text{c}} \nu ) +_{\text{c}} \varpi =\Lambda .\mu +_{\text{c}} (\nu +_{\text{c}} \varpi )=\Lambda .\\ [*13.171] &\supset .(\mu +_{\text{c}} \nu ) +_{\text{c}} \varpi =\mu +_{\text{c}} (\nu +_{\text{c}} \varpi )&\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

This is the associative law for arithmetical addition. It will be seen that, like the commutative law, it does not require that $\mu$ , $\nu$ , $\varpi$ should be cardinals.

*110·561. $\mu +_{\text{c}} \nu +_{\text{c}} \varpi = (\mu +_{\text{c}} \nu ) +_{\text{c}} \varpi \quad\text{Df}$

*110·57. $\vdash .(\mu +_{\text{c}} \nu ) +_{\text{c}} (\varpi +_{\text{c}} \rho ) = \mu +_{\text{c}} \nu +_{\text{c}} \varpi +_{\text{c}} \rho \quad[*110·56.(*110·561)]$

The following propositions, concerning the addition of 0 or 1, are used frequently in dealing with inductive cardinals (*120).

*110·6. $\vdash :\mu \in \text{NC}.\supset .\mu +_{\text{c}} 0 = \text{ sm }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*101·11.*110·21.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \mu +_{\text{c}} 0.&\equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in 0.\xi \text{ sm }(\alpha + \beta ).\\ [*54·102] &\equiv .(\exists \alpha ).\alpha \in \mu .\xi \text{ sm }(\alpha + \Lambda ).\\ [*110·152] & \equiv .(\exists \alpha ,\gamma ,\delta ).\alpha \in \mu .\gamma \text{ sm }\alpha .\delta \text{ sm }\Lambda .\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta .\\ [*73·47] &\equiv .(\exists \alpha ,\gamma ).\alpha \in \mu .\gamma \text{ sm }\alpha .\xi =\gamma .\\ [*13·195] &\equiv .(\exists \alpha ).\alpha \in \mu .\xi \text{ sm }\alpha .\\ [*37·1] &\equiv .\xi \in \text{ sm }ʻʻ\mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

When $\mu$ is a typically definite cardinal, $\text{ sm }ʻʻ\mu$ is the same cardinal rendered typically ambiguous; when $\mu$ is a typically ambiguous cardinal, $\text{ sm }ʻʻ\mu$ , is $\mu$ . In place of the above proposition, we might write $\mu \in \text{NC}.\supset.\mu +_{\text{c}} 0 = \mu$ ; this would be true whenever the ambiguity of $\mu +_{\text{c}} 0$ was so determined as to make it significant. But the above form gives more information.

Dem. $\begin{array}{l} \vdash .*101·1.\supset \vdash .\text{Nc}ʻ\alpha +_{\text{c}} 0&=\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\Lambda \\ [*110·32] &= \text{Nc}ʻ(\alpha \cup \Lambda )\\ [*24·24] &= \text{Nc}ʻ\alpha .\supset \vdash .\text{Prop} \end{array}$

In this proposition, $\text{Nc}ʻ\alpha$ is typically ambiguous; hence we escape the necessity of putting $\text{ sm }ʻʻ\text{Nc}ʻ\alpha$ on the right, as we should have to do if $\text{Nc}ʻ\alpha$ were typically definite. We can deduce *110·61 from *110·6 as follows: $\begin{array}{l} \vdash .*110·3.\supset \vdash .\text{Nc}ʻ\alpha +_{\text{c}} 0&=\text{N}_{0}\text{c}ʻ\alpha +_{\text{c}} 0\\ [*110·6] &=\text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\alpha \\ [*103·4] &=\text{Nc}ʻ\alpha \end{array}$

We have to travel via $\text{N}_{0}\text{c}ʻ\alpha$ in this proof, in order to avoid the possibility of a typical determination of $\text{Nc}ʻ\alpha$ which would make $\text{Nc}ʻ\alpha=\Lambda$ . It is for the same reason that we cannot put " $\text{ sm }ʻʻ\text{Nc}ʻ\alpha =\text{Nc}ʻ\alpha$ "; for if the first $\text{Nc}ʻ\alpha$ is determined to a type in which $\text{Nc}ʻ\alpha =\Lambda$ , while the second is not, this equation becomes false.

Dem. $\begin{array}{l} \vdash .*103·27.*101·11·13.&\supset \vdash .0=\text{N}_{0}\text{c}ʻ\Lambda &\quad \text{(1)}\\ \vdash .(1).*110·43.\supset \\ \vdash \colon\ldotp \mu +_{\text{c}} \nu =0.&\equiv :\Lambda \in \mu +_{\text{c}} \nu :\\ [*110·202] &\equiv :\exists !\mu .\exists !\nu :(\exists \gamma ,\delta ).\mu =\text{Nc}ʻ\gamma .\nu =\text{Nc}ʻ\delta .\gamma \cap \delta =\Lambda .\gamma \cup \delta =\Lambda :\\ [*24·32.*13·22] &\equiv :\exists !\mu .\exists !\nu :\mu =\text{Nc}ʻ\Lambda .\nu =\text{Nc}ʻ\Lambda :\\ [*101·1·12] &\equiv :\mu =0.\nu =0\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*110·63. $\vdash .\text{Nc}ʻ\alpha +_{\text{c}} 1=\hat{\xi} \{(\exists \gamma ,y).\gamma \text{ sm }\alpha .y{\sim}\in \gamma .\xi =\gamma \cup \iota ʻy\}$

Dem. $\begin{array}{l} \vdash .*101·2.\supset \\ \vdash .\text{Nc}ʻ\alpha +_{\text{c}} 1&=\text{Nc}ʻ\alpha +_{\text{c}} \text{Nc}ʻ\iota ʻx\\ [*110·33] &=\hat{\xi} \{(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \text{ sm }\iota ʻx.\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\}\\ [*73·45] &=\hat{\xi} \{(\exists \gamma ,\delta ).\gamma \text{ sm }\alpha .\delta \in 1.\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\}\\ [*52·1] &=\hat{\xi} \{(\exists \gamma ,\delta ,y).\gamma \text{ sm }\alpha .\delta =\iota ʻy.\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\}\\ [*13·195.*51·211] &=\hat{\xi} \{(\exists \gamma ,y).\gamma \text{ sm }\alpha .y{\sim}\in \gamma .\xi =\gamma \cup \iota ʻy\}.\supset \vdash .\text{Prop} \end{array}$

The above proposition is much used in the theory of finite and infinite, both cardinal and ordinal. It connects mathematical induction for inductive cardinals with mathematical induction for inductive classes (cf. *120).

*110·631. $\vdash :\mu \in \text{NC}.\supset \mu +_{\text{c}}1=\hat{\xi} \{(\exists \gamma ,y).\gamma \in \text{ sm }ʻʻ\mu .y{\sim}\in \gamma .\xi =\gamma \cup \iota ʻy\}$

Dem. $\begin{array}{l} \vdash .*110·211.*101·21.\supset \\ \vdash :\text{Hp}.\supset .\mu +_{\text{c}} 1&=\hat{\xi} \{(\exists \gamma ,\delta ).\gamma \in \text{ sm }ʻʻ\mu .\delta \in \text{ sm }ʻʻ1.\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\}\\ [*101·28] &=\hat{\xi} \{(\exists \gamma ,\delta ).\gamma \in \text{ sm }ʻʻ\mu .\delta \in 1.\gamma \cap \delta =\Lambda .\xi =\gamma \cup \delta\}\\ [*52·1.*51·211] &=\hat{\xi} \{(\exists \gamma ,y).\gamma \in \text{ sm }ʻʻ\mu .y{\sim}\in \gamma .\xi =\gamma \cup \iota ʻy\}:\supset \vdash .\text{Prop} \end{array}$

The proposition $\mu \in \text{NC}.\supset .\mu +_{\text{c}} 1=\hat{\xi} \{(\exists \gamma ,y).\gamma \in \mu .y{\sim}\in \gamma .\xi \text{ sm }\gamma \cup \iota ʻy\}$ which might at first sight seem demonstrable, will only be true universally if the total number of objects in any one type is not finite. For suppose $\alpha$ is a type, and $\mu=\text{N}_{0}\text{c}ʻ\alpha$ . Then if $\alpha$ is a finite class, $\mu =\iota ʻ\alpha$ . Hence $\gamma \in \mu . \supset _{\gamma ,y}. y\in \gamma$ . Hence $\hat{\xi} \{(\exists \gamma ,y).\gamma \in \mu .y{\sim}\in \gamma.\xi \text{ sm }(\gamma \cup \iota ʻy)\}=\Lambda$ in all types. But $\mu +_{\text{c}} 1$ will exist in all types higher than that of $\gamma$ . If on the other hand the number of entities in $\alpha$ is infinite, we shall have $y\in \alpha .\supset .\alpha -\iota ʻy\in \text{Nc}ʻ\alpha .y{\sim}\in \alpha -\iota ʻy.$ Hence in this case the above proposition will be true universally.

*110·632. $\vdash :\mu \in \text{NC}.\supset .\mu +_{\text{c}} 1=\hat{\xi} \{(\exists y).y\in \xi .\xi -\iota ʻy\in \text{ sm }ʻʻ\mu \}$

Dem. $\begin{array}{l} \vdash .*110·631.*51·211·22.\supset \\ \vdash :\text{Hp}.&\supset .\mu +_{\text{c}} 1=\hat{\xi} \{(\exists \gamma ,y).\gamma \in \text{ sm }ʻʻ\mu .y\in \xi .\gamma =\xi -\iota ʻy\}\\ [*13·195] &=\hat{\xi} \{(\exists y).y\in \xi .\xi -\iota ʻy\in \text{ sm }ʻʻ\mu\}:\supset \vdash .\text{Prop} \end{array}$

*110·641. $\vdash .1 +_{\text{c}} 0=0 +_{\text{c}} 1=1 \quad[*110·51·61.*101·2]$

*110·642. $\vdash .2 +_{\text{c}} 0=0 +_{\text{c}} 2=2 \quad[*110·51·61.*101·31]$

Dem. $\begin{array}{l} \vdash .*110·632.*101·21·28.\supset \\ \vdash .1 +_{\text{c}} 1=\hat{\xi} \{(\exists y).y\in \xi .\xi -\iota ʻy\in 1\}\\ [*54·3] =2.\supset \vdash .\text{Prop} \end{array}$

The above proposition is occasionally useful. It is used at least three times, in *113·66 and *120·123 ·472.

*110·7 ·71 are required for proving *110·72, and *110·72 is used in *117·3, which is a fundamental proposition in the theory of greater and less.

*110·7. $\vdash :\beta \subset \alpha .\supset .(\exists \mu ).\mu \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} \mu$

*110·71. $\vdash :(\exists \mu ).\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} \mu .\supset .(\exists \delta ).\delta \text{ sm }\beta .\delta \subset \alpha$

Dem. $\begin{array}{l} \vdash .*100·3.*110·4.\supset \\ \vdash :\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} \mu .&\supset .\mu \in \text{NC}-\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*110·3.\supset \vdash :\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} &\text{Nc}ʻ\gamma . \equiv .\text{Nc}ʻ\alpha =\text{Nc}ʻ(\beta + \gamma ).\\ [*100·3·31] &\supset .\alpha \text{ sm }(\beta + \gamma ).\\ [*73·1] &\supset .(\exists R).R\in 1\rightarrow 1.\text{D}ʻR=\alpha .\text{ᗡ}ʻR=\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \cup \Lambda _{\beta }\downarrow ʻʻ\iotaʻʻ\gamma .\\ [*37·15] &\supset .(\exists R).R\in 1 \rightarrow 1.\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \subset \text{ᗡ}ʻR.Rʻʻ\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \subset \alpha .\\ [*110·12.*73·22] &\supset .(\exists \delta ).\delta \subset \alpha .\delta \text{ sm }\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The above proof depends upon the fact that " $\text{Nc}ʻ\alpha$ " and " $\text{Nc}ʻ\beta +_{\text{c}} \mu$ " are typically ambiguous, and therefore, when they are asserted to be equal, this must hold in any type, and therefore, in particular, in that type for which we have $\alpha \in \text{Nc}ʻ\alpha$ , i.e. for $\text{N}_{0}\text{c}ʻ\alpha$ . This is why the use of *100·3 is legitimate.

*110·72. $\vdash :(\exists \delta ).\delta \text{ sm }\beta .\delta \subset \alpha .\equiv .(\exists \mu ).\mu \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} \mu$

Dem. $\begin{array}{l} \vdash .*100·321.*110·7.\supset \\ \vdash \colon\ldotp \delta \text{ sm } \beta .\delta \subset \alpha .&\supset :\text{Nc}ʻ\delta =\text{Nc}ʻ\beta :(\exists \mu ).\mu \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\delta +_{\text{c}} \mu :\\ [*13·12] &\supset :(\exists \mu ).\mu \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{\text{c}} \mu &\qquad \text{(1)}\\ \vdash .(1).*110·71.\supset \vdash .\text{Prop} \end{array}$

The arithmetical properties of a class, so far as these do not require or assume that it is a class of classes, are the same for any similar class. But a class of classes has many arithmetical properties which it does not share with all similar classes of classes. For example, if $\kappa$ is a class of classes, the number of members of $sʻ\kappa$ is an arithmetical property of $\kappa$ , but it is obvious that this is not determined by the number of members of $\kappa$ , but requires also a knowledge of the numbers of members of members of $\kappa$ . For example, let $\kappa$ consist of the two members $\alpha$ and $\beta$ , and let $\lambda$ consist of $\gamma$ and $\delta$ . Then $\kappa \text{ sm } \lambda$ ; but in order to be able to infer $sʻ\kappa \text{ sm } sʻ\lambda$ , we require $\kappa$ , $\lambda \in \text{Cls}^{2} \text{excl}$ and $\alpha \text{ sm } \gamma .\beta \text{ sm } \delta$ or $\alpha \text{ sm } \delta .\beta \text{ sm } \gamma$ or some such further datum. The relation of "double similarity," to be defined in the present number, is a relation between classes of classes, which, when it holds between $\kappa$ and $\lambda$ , insures that all the arithmetical properties of $\kappa$ and $\lambda$ are the same, e.g. we have (in particular) $\text{Nc}ʻsʻ\kappa =\text{Nc}ʻsʻ\lambda$ and $\text{Nc}ʻ{\in}_{\Delta }ʻ\kappa=\text{Nc}ʻ{\in}_{\Delta }ʻ\lambda$ . This relation we denote by " $\text{sm}\, \text{sm}$ ," which is to be read as one symbol. It is defined as follows: We define first the class of "double correlators" of $\kappa$ and $\lambda$ , which we denote by " $\kappa \overline{\text{ sm }}\,\overline{\text{ sm }}\, \lambda$ ," and of which the definition is

*111·01. $\kappa \overline{\text{ sm }}\, \overline{\text{ sm }} \lambda =(1\rightarrow 1)\cap \overleftarrow{\text{ᗡ}}ʻsʻ\lambda \cap \hat{T} (\kappa =T_{\in }ʻʻ\lambda ) \quad\text{Df}$

so that $\vdash :T\in \kappa \overline{\text{ sm }}\, \overline{\text{ sm }} \lambda .\equiv .T\in 1\rightarrow 1.\text{ᗡ}ʻT=sʻ\lambda .\kappa =T_{\in }ʻʻ\lambda .$

We then define " $\kappa \text{ sm } \text{ sm } \lambda$ " as meaning that $\kappa \overline{\text{ sm }}\, \overline{\text{ sm }} \lambda$ is not null, i.e. that there is at least one double correlator of $\kappa$ and $\lambda$ .

To illustrate the nature of a double correlator, let us suppose that $\kappa$ consists of the two classes $\alpha _{1}$ and $\alpha_{2}$ , and that $\alpha _{1}$ consists of $x_{11}$ , $x_{12}$ , while $\alpha _{2}$ consists of $x_{21}$ , $x_{22}$ , $x_{23}$ . Similarly let $\lambda$ consist of $\beta _{1}$ and $\beta _{2}$ while $\beta _{1}$ consists of $y_{11}$ , $y_{12}$ and $\beta_{2}$ consists of $y_{21}$ , $y_{22}$ , $y_{23}$ . Now let $T$ correlate each $x$ with the $y$ having the same two suffixes. Then $T$ is a one-one, and its converse domain is $sʻ\lambda$ . Moreover $T_{\in }ʻ\beta _{1}$ (which is $Tʻʻ\beta _{1}$ ) = $\alpha_{1}$ , and $T_{\in }ʻ\beta _{2}=\alpha _{2}$ , so that $T_{\in}ʻʻ\lambda =\kappa$ . Thus $T$ is a double correlator according to the definition.

The essential characteristic of a double correlator $T$ is that (1) $T$ is a correlator of $sʻ\kappa$ and $sʻ\lambda$ , (2) $T_{\in }\upharpoonright \lambda$ is a correlator of $\kappa$ and [Pg 89] $\lambda$ . If we write $S$ in place of $T_{\in }\upharpoonright \lambda$ , then if $\beta \in \lambda$ , we have $Sʻ\beta \in \kappa$ ; moreover $T\upharpoonright \beta$ is a correlator of $Sʻ\beta$ and $\beta$ . Thus $\kappa$ and $\lambda$ are similar classes of similar classes. They are not merely this, however, for we not only know that $Sʻ\beta$ is similar to $\beta$ , but we know a particular correlator of $Sʻ\beta$ and $\beta$ , namely $T\upharpoonright \beta$ . This is essential to the use of double similarity, as will appear shortly.

Let us consider the relation between $\kappa$ and $\lambda$ which consists in their being similar classes of similar classes. This means that there is a correlator $S$ of $\kappa$ and $\lambda$ , such that, if $\beta \in \lambda$ , $Sʻ\beta$ is similar to $\beta$ . That is to say, we are to consider the hypothesis $(\exists S).S\in 1\rightarrow 1.\text{D}ʻS=\kappa .\text{ᗡ}ʻS=\lambda .S \,\unicode{x2abd}\, \text{ sm }$ or, as it may be more briefly expressed, $\exists !\kappa \overline{\text{ sm }} \lambda \cap \text{Rl}ʻ\text{ sm }.$ Let us assume $S\in \kappa \overline{\text{ sm }} \lambda \cap\text{ᗡ}ʻʻʻ\text{ sm }$ . If we attempt to prove (say) that $sʻ\kappa$ is similar to $sʻ\lambda$ , we find that we are forced to assume the multiplicative axiom, unless $\kappa$ and $\lambda$ are finite. This necessity arises as follows. Let us put $\text{Crp}(S)ʻ\beta =(Sʻ\beta )\,\overline{\text{ sm }}\, \beta ,$ where " $\text{Crp}$ " stands for "correspondence." Then we know that whenever $\beta \in \lambda$ , $\text{Crp}(S)ʻ\beta$ is not null. Further it is easy to prove that, if $\kappa$ and $\lambda$ are classes of mutually exclusive classes, and if we can pick out one representative member of $\text{Crp}(S)ʻ\beta$ for each value of $\beta$ which is a member of $\lambda$ , then the relational sum of all these representative correlations gives us a correlator of $sʻ\kappa$ and $sʻ\lambda$ . That is, we have $\vdash :\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.S\in \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm }.R\in {\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\supset .\dot{s} ʻ\text{D}ʻR\in (sʻ\kappa )\,\overline{\text{ sm }}\, (sʻ\lambda ).$

But in order to infer hence $sʻ\kappa \text{ sm } sʻ\lambda$ , we need $\exists !{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda$ , i.e. we need to be able to pick out a particular correlator for each pair of similar classes $Sʻ\beta$ and $\beta$ . This, however, cannot be done in general without assuming the multiplicative axiom. It follows that we must not define two classes as having double similarity when $\exists!\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm }$ , but must give a definition which enables us to specify a particular correlator for each pair of similar classes. This is what is effected by the above definition of double correlators, where our $S$ is given as of the form $T_{\in }\upharpoonright \lambda$ , where $T\in 1\rightarrow 1.\text{ᗡ}ʻT =sʻ\lambda$ . If the multiplicative axiom is assumed, but in general not otherwise, we have (*111·5) $\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\supset :\kappa \text{ sm } \text{ sm } \lambda .\equiv .\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm }.$

In the present number, we shall begin with various properties of double correlators. We prove (*111·11) that $T$ is a double correlator of $\kappa$ and $\lambda$ when, and only when, $T$ is a correlator of $sʻ\kappa$ and $sʻ\lambda$ , and $T_{\in}\upharpoonright \lambda$ is a correlator of $\kappa$ and $\lambda$ . We prove (*111·112) that in the same hypothesis, $T_{\in }\upharpoonright \lambda \in\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm }$ . We prove (*111·13) that $1\upharpoonright sʻ\lambda$ is a double correlator of $\lambda$ with itself; that (*111·131) if $T$ is a double correlator of[Pg 90] $\kappa$ and $\lambda$ , $\breve{T}$ is a double correlator of $\lambda$ and $\kappa$ ; that (*111·132) if $S$ , $T$ are double correlators of $\kappa$ with $\lambda$ and of $\lambda$ with $\mu$ respectively, $S\mid T$ is a double correlator of $\kappa$ with $\mu$ . Hence it follows (*111·45 ·451 ·452) that double similarity is reflexive, symmetrical, and transitive.

We then proceed (*111·2—·34) to consider $\text{Crp}(S)ʻʻ\lambda$ , where it is to be supposed that $S$ is a correlator of $Sʻʻ\lambda$ and $\lambda$ , and that $Sʻ\beta$ is similar to $\beta$ if $\beta \in \lambda$ . We prove

*111·32. $\begin{aligned}\vdash :\lambda ,Sʻʻ\lambda \in \text{Cls}^{2} \text{excl}.&S\in 1\rightarrow 1.R\in {\in}_{\Delta }ʻ\text{Crp}(S)ʻʻ\lambda .M = \dot{s} ʻ\text{D}ʻR.\supset .\\ &M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda .Sʻʻ\lambda = M_{\in }ʻʻ\lambda .S\upharpoonright \lambda = M_{\in }\upharpoonright \lambda\end{aligned}$

Thus in the case supposed, $M$ is a double correlator of $Sʻʻ\lambda$ and $\lambda$ . Thus

*111·322. $\begin{aligned}\vdash :\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.S\in \kappa \,\overline{\text{ sm }}\, \lambda .R\in {\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .&M = \dot{s} ʻ\text{D}ʻR.\supset .\\ &M\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .S = M_{\in }\upharpoonright \lambda\end{aligned}$

We then proceed (*111·4—·47) to various propositions on " $\text{ sm }\,\text{ sm }$ ," and finally (*111·5 ·51 ·53) state three propositions which assume the multiplicative axiom, namely

*111·5. If $\kappa$ , $\lambda \in \text{Cls}^{2} \text{excl}$ , then $\kappa \text{ sm } \text{ sm } \lambda . \equiv .\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm }$ .

*111·51. In the same case, $\exists !\kappa\,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm }.\supset .sʻ\kappa\text{ sm } sʻ\lambda$ , i.e. if $\kappa$ and $\lambda$ are similar classes of mutually exclusive similar classes, their sums are similar.

*111·53. In the same case, if $\kappa$ , $\lambda \in \text{Cls}^{2} \text{excl}$ , $\kappa \text{ sm } \text{ sm } \lambda$ . Hence the multiplicative axiom implies that two classes of $\mu$ mutually exclusive classes each of which has $\nu$ terms, have the same number of terms in their sum.

*111·01. $\kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda = (1\rightarrow 1)\cap \overleftarrow{\text{ᗡ}}ʻsʻ\lambda \cap \hat{T} (\kappa = T_{\in }ʻʻ\lambda ) \quad\text{Df}$

*111·02. $\text{Crp}(S)ʻ\beta = (Sʻ\beta ) \,\overline{\text{ sm }}\, \beta \quad \text{Df}$

*111·03. $\text{ sm } \text{ sm } = \hat{\kappa} \hat{\lambda} (\exists ! \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda ) \quad\text{Df}$

*111·1. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv .T\in 1\rightarrow 1.\text{ᗡ}ʻT= sʻ\lambda .\kappa = T_{\in }ʻʻ\lambda \quad [(*111·01)]$

*111·11. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv .T\in (sʻ\kappa ).\,\overline{\text{ sm }}\, (sʻ\lambda ).T_{\in }\upharpoonright \lambda \in \kappa \,\overline{\text{ sm }}\, \lambda$

Dem. $\begin{array}{l} \vdash .*37·25.\text{Fact}.\supset \vdash :\text{ᗡ}ʻT = sʻ\lambda .\kappa = T_{\in }ʻʻ\lambda .&\supset .\text{D}ʻT = Tʻʻsʻ\lambda .\kappa = T_{\in }ʻʻ\lambda .\\ [*40·38] & \supset .\text{D}ʻT = sʻTʻʻʻ\lambda .\kappa = T_{\in }ʻʻ\lambda .\\ [(*37·04)] & \supset .\text{D}ʻT=sʻ\kappa &\qquad \text{(1)}\\ \vdash .*72·451.*60·57.*35·65.\supset \\ \vdash :T\in 1\rightarrow 1.\text{ᗡ}ʻT = sʻ\lambda .&\supset .T_{\in }\upharpoonright \lambda \in 1\rightarrow 1.\lambda = \text{ᗡ}ʻ(T_{\in }\upharpoonright \lambda ) &\qquad \text{(2)}\\ \vdash .*37·401. &\supset \vdash :\kappa = T_{\in }ʻʻ\lambda . \equiv .\kappa = \text{D}ʻ(T_{\in }\upharpoonright \lambda ) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*4·71.&\supset \vdash :T\in 1\rightarrow 1.\text{ᗡ}ʻT = sʻ\lambda .\kappa = T_{\in }ʻʻ\lambda . \equiv .\\ &T\in 1\rightarrow 1.\text{D}ʻT = sʻ\kappa .\text{ᗡ}ʻT = sʻ\lambda .T_{\in }\upharpoonright \lambda \in 1\rightarrow 1.\text{D}ʻ(T_{\in }\upharpoonright \lambda ) = \kappa .\text{ᗡ}ʻ(T_{\in }\upharpoonright \lambda ) = \lambda &\qquad \text{(4)}\\ \vdash .(4).*111·1.*73·03.\supset \vdash .\text{Prop} \end{array}$

*111·111. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .T_{\in }\upharpoonright \lambda \,\unicode{x2abd}\, \text{ sm }$

Dem. $\begin{array}{l} \vdash . *111·1. *60·57.\supset \vdash :\text{Hp}.&\supset .T\in 1\rightarrow 1.\lambda \subset \text{Cl}ʻ\text{ᗡ}ʻT.\\ [*73·5] &\supset .T_{\in }\upharpoonright \lambda \,\unicode{x2abd}\, \text{ sm }:\supset \vdash .\text{Prop} \end{array}$

*111·112. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .T_{\in }\upharpoonright \lambda \in \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm } \quad[*111·11·111]$

The two following propositions are useful lemmas for the case when $T$ is replaced (as it often is) by $T\upharpoonright \alpha$ .

*111·12. $\vdash :sʻ\lambda \subset \alpha .\supset .(T\upharpoonright \alpha )_{\in }ʻʻ\lambda = T_{\in }ʻʻ\lambda .(T\upharpoonright \alpha )_{\in }\upharpoonright \lambda = T_{\in }\upharpoonright \lambda$

Dem. $\begin{array}{l} \vdash . *37·101·421. &\supset \vdash :\beta \subset \alpha .\supset .(T\upharpoonright \alpha )_{\in }ʻ\beta = T_{\in }ʻ\beta &\qquad \text{(1)}\\ \vdash . *40·13. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \lambda .\supset .\beta \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash \colon\ldotp \text{Hp}.&\supset :\beta \in \lambda .\supset .(T\upharpoonright \alpha )_{\in }ʻ\beta = T_{\in }ʻ\beta :\\ [*37·69.*35·71] &\supset :(T\upharpoonright \alpha )_{\in }ʻʻ\lambda = T_{\in }ʻʻ\lambda .(T\upharpoonright \alpha )_{\in }\upharpoonright \lambda = T_{\in }\upharpoonright \lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*111·121. $\vdash .(T\upharpoonright sʻ\lambda )_{\in }ʻʻ\lambda = T_{\in }ʻʻ\lambda = (T_{\in }\upharpoonright \lambda )ʻʻ\lambda .(T\upharpoonright sʻ\lambda )_{\in }\upharpoonright \lambda = T_{\in }\upharpoonright \lambda$

Dem. $\begin{array}{l} \vdash .*37·421.\supset \vdash .T_{\in }ʻʻ\lambda = (T_{\in }\upharpoonright \lambda )ʻʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*111·12 \frac{sʻ\lambda}{\alpha}.\supset \vdash .\text{Prop} \end{array}$

*111·13. $\vdash .I\upharpoonright sʻ\lambda \in \lambda \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda$

Dem. $\begin{array}{l} \vdash .*72·17.*50·5·52.&\supset \vdash .I\upharpoonright sʻ\lambda \in 1\rightarrow 1.\text{ᗡ}ʻ(I\upharpoonright sʻ\lambda ) = sʻ\lambda &\qquad \text{(1)}\\ \vdash .*111·121. \supset \vdash .(I\upharpoonright sʻ\lambda )_{\in }ʻʻ\lambda &= I_{\in }ʻʻ\lambda \\ [*50·16·17] &= \lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*111·1.\supset \vdash .\text{Prop} \end{array}$

*111·131. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv .\breve{T} \in \lambda \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \kappa$

Dem. $\begin{array}{l} \vdash .*71·212.&\supset \vdash :T\in 1\rightarrow 1. \equiv .\breve{T} \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*111·11.&\supset \vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .\text{D}ʻT = sʻ\kappa &\qquad \text{(2)}\\ \vdash .*111·1.(2).*60·57.\supset \\ \vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .&\supset .T\in 1\rightarrow 1.\kappa \subset \text{Cl}ʻ\text{D}ʻT.\lambda \subset \text{Cl}ʻ\text{ᗡ}ʻT.\kappa = T_{\in }ʻʻ\lambda .\\ [*74·6] &\supset .\lambda = (\breve{T} )_{\in }ʻʻ\kappa &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*111·1.&\supset \vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .\breve{T} \in \lambda \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \kappa &\qquad \text{(4)}\\ \vdash .(4)\frac{\breve{T}}{T}. &\supset \vdash :\breve{T} \in \lambda \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \kappa .\supset .T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*111·132. $\vdash : S \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . T \in \lambda \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \mu .\supset . S \mid T \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \mu$

Dem. $\begin{array}{l} \vdash . *111·11 . *73·311 . \supset \\ \vdash : \text{Hp} . &\supset . S \mid T e (sʻ\kappa ) \,\overline{\text{ sm }}\, (sʻ\mu ) . (S_{\in } \upharpoonright \lambda ) \mid (T_{\in } \upharpoonright \mu ) \in \kappa \,\overline{\text{ sm }}\, \mu &\qquad \text{(1)}\\ \vdash . *35·354 . &\supset \vdash . (S_{\in } \upharpoonright \lambda ) \mid (T_{\in } \upharpoonright \mu ) = S_{\in } \mid (\lambda \upharpoonleft T_{\in } \upharpoonright \mu ) &\qquad \text{(2)}\\ \vdash . *74·251 . *111·1 . &\supset \vdash : \text{Hp} . \supset . S_{\in } \mid (\lambda \upharpoonleft T_{\in } \upharpoonright \mu ) = S_{\in } \mid (T_{\in } \upharpoonright \mu )\\ [*35·23] &= (S_{\in } \mid T_{\in }) \upharpoonright \mu \\ [*37·34] &= (S \mid T)_{\in } \upharpoonright \mu &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . \supset \vdash : \text{Hp} . &\supset . S \mid T_{\in } (sʻ\kappa ) \,\overline{\text{ sm }}\, (sʻ\mu ) . (S \mid T)_{\in } \upharpoonright \mu \in \kappa \,\overline{\text{ sm }}\, \mu .\\ [*111·11] &\supset . S \mid T \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \mu : \supset \vdash . \text{Prop} \end{array}$

*111·14. $\vdash : T \upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv . T \upharpoonright sʻ\lambda \in 1 \rightarrow 1 . sʻ\lambda \subset \text{ᗡ}ʻT . \kappa = T_{\in }ʻʻ\lambda$

Dem. $\begin{array}{l} \vdash . *111·1·121 . \supset \\ \vdash : T \upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . &\equiv . T \upharpoonright sʻ\lambda \in 1 \rightarrow 1 . \text{ᗡ}ʻ(T \upharpoonright sʻ\lambda ) = sʻ\lambda . \kappa = T_{\in }ʻʻ\lambda .\\ [*35·65] &\equiv . T \upharpoonright sʻ\lambda \in 1 \rightarrow 1 . sʻ\lambda \subset \text{ᗡ}ʻT . \kappa = T_{\in }ʻʻ\lambda : \supset \vdash . \text{Prop} \end{array}$

*111·15. $\vdash : T \upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv . T \upharpoonright sʻ\lambda \in (sʻ\kappa ) \,\overline{\text{ sm }}\, (sʻ\lambda ) . T_{\in } \upharpoonright \lambda \in \kappa \,\overline{\text{ sm }}\, \lambda$

Dem. $\begin{array}{l} \vdash . *111·11 . \supset \\ \vdash : T \upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda . \equiv . T \upharpoonright sʻ\lambda \in (sʻ\kappa ) \,\overline{\text{ sm }}\, (sʻ\lambda ) . (T \upharpoonright sʻ\lambda )_{\in } \upharpoonright \lambda \in \kappa \,\overline{\text{ sm }}\, \lambda &\qquad \text{(1)}\\ \vdash . (1) . *111·121 . \supset \vdash . \text{Prop} \end{array}$

*111·16. $\vdash : \exists ! \alpha \,\overline{\text{ sm }}\, \beta \cap \gamma \,\overline{\text{ sm }}\, \delta . \supset . \alpha = \gamma . \beta = \delta$

Dem. $\begin{array}{l} \vdash . *73·03 . \supset \vdash : \text{Hp} . &\supset . (\exists R) . \text{D}ʻR = \alpha . \text{ᗡ}ʻR = \beta . \text{D}ʻR = \gamma . \text{ᗡ}ʻR = \delta .\\ [*13·171] &\supset . \alpha = \gamma . \beta = \delta : \supset \vdash . \text{Prop} \end{array}$

*111·18. $\vdash . \alpha \,\overline{\text{ sm }}\, \beta \subset (\alpha \uparrow \beta )_{\Delta }ʻ\beta$

Dem. $\begin{array}{l} \vdash . *35·83 . *73·03 . &\supset \vdash : R \in \alpha \,\overline{\text{ sm }}\, \beta . \supset . R \,\unicode{x2abd}\, \alpha \uparrow \beta &\qquad \text{(1)}\\ \vdash . *73·03 . &\supset \vdash : R \in \alpha \,\overline{\text{ sm }}\, \beta . \supset . R \in 1 \rightarrow \text{Cls} . \text{ᗡ}ʻR = \beta &\qquad \text{(2)}\\ \vdash . (1) . (2) . *80·14 . &\supset \vdash . \text{Prop} \end{array}$

The class $(\alpha \uparrow \beta )_{\Delta }ʻ\beta$ is important, being the class of Cantor's "Belegungen," used by him to define exponentiation; we have in fact $\text{Nc}ʻ(\alpha \uparrow \beta )_{\Delta }ʻ\beta = (\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\beta }.$ Thus the above proposition shows that $\text{Nc}ʻ(\alpha\,\overline{\text{ sm }}\, \beta )$ is less than or equal to $(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\beta}$ ; and since, whenever it is not zero, $\text{Nc}ʻ\alpha = \text{Nc}ʻ\beta$ , it is less than or equal to $(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\alpha }.$

*111·2. $\vdash :\text{E}!Sʻ\beta .\supset .\text{Crp}(S)ʻ\beta = (Sʻ\beta )\,\overline{\text{ sm }}\, \beta \quad[*14·28.(*111·02)]$

*111·201. $\vdash :f\{\text{Crp}(S)ʻ\beta\}. \equiv .f\{(Sʻ\beta )\,\overline{\text{ sm }}\, \beta\} \quad[*4·2.(*111·02)]$

*111·202. $\begin{aligned}\vdash :R\in \text{Crp}(S)ʻ\beta . \equiv .R\in 1\rightarrow 1.\text{D}ʻR = &Sʻ\beta .\text{ᗡ}ʻR = \beta \\ &[*111·201.*73·03]\end{aligned}$

*111·21. $\vdash :\exists !\text{Crp}(S)ʻ\beta . \equiv .Sʻ\beta \text{ sm }\beta \quad[*111·201.*73·04]$

*111·211. $\vdash :\exists !\text{Crp}(S)ʻ\beta .\supset .\text{E}!Sʻ\beta .\beta \in \text{ᗡ}ʻS \quad[*111·21.*14·21.*33·43]$

*111·22. $\vdash \colon\ldotp \beta \in \text{ᗡ}ʻS.\supset _{\beta }.\exists !\text{Crp}(S)ʻ\beta : \equiv .S\in 1\rightarrow \text{Cls}.S\,\unicode{x2abd}\, \text{ sm }$

Dem. $\begin{array}{l} \vdash .*111·21.\supset \vdash \colon\ldotp \beta \in \text{ᗡ}ʻS.\supset _{\beta }.\exists !\text{Crp}(S)ʻ\beta : &\equiv :\beta \in \text{ᗡ}ʻS.\supset _{\beta }.Sʻ\beta \text{ sm }\beta :\\ [*72·93] &\equiv :S\in 1\rightarrow \text{Cls}.S\,\unicode{x2abd}\, \text{ sm }\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*111·221. $\vdash \colon\ldotp S\in 1\rightarrow \text{Cls}.S\,\unicode{x2abd}\, \text{ sm }.\supset :\exists !\text{Crp}(S)ʻ\beta . \equiv .\beta \in \text{ᗡ}ʻS$

Dem. $\begin{array}{l} \vdash .*111·22 .\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \text{ᗡ}ʻS.\supset .\exists !\text{Crp}(S)ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*111·211.\supset \vdash .\text{Prop} \end{array}$

*111·23. $\vdash :S\in 1\rightarrow 1.\beta \in \text{ᗡ}ʻS.\supset .\text{Crp}(S)ʻ\beta = \text{Cnv}ʻʻ\text{Crp}(\breve{S} )ʻSʻ\beta$

Dem. $\begin{array}{l} \vdash .*111·2.*71·163.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{Crp}(S)ʻ\beta & = (Sʻ\beta )\,\overline{\text{ sm }}\, \beta \\ [*73·301] &= \text{Cnv}ʻʻ(\beta \,\overline{\text{ sm }}\, Sʻ\beta )\\ [*72·241] &= \text{Cnv}ʻʻ(\breve{S} ʻSʻ\beta \,\overline{\text{ sm }}\, Sʻ\beta ) &\qquad \text{(1)}\\ \vdash .(1).*111·201 \frac{\breve{S},Sʻ\beta}{S,\, \beta}.\supset \vdash .\text{Prop} \end{array}$

*111·24. $\vdash :S\in 1\rightarrow \text{Cls}.\lambda \subset \text{ᗡ}ʻS.\supset .\text{Crp}(S)ʻʻ\lambda \in \text{Cls}^{2} \text{excl}$

Dem. $\begin{array}{l} \vdash .*111·2.*71·163.&\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\beta ,\gamma \in \lambda .\supset _{\beta , \gamma }.\text{Crp}(S)ʻ\beta = (Sʻ\beta )\,\overline{\text{ sm }}\, \beta .\text{Crp}(S)ʻ\gamma = (Sʻ\gamma )\,\overline{\text{ sm }}\, \gamma .&\qquad \text{(1)}\\ [*111·16] &\supset _{\beta , \gamma }.\exists !\text{Crp}(S)ʻ\beta \cap \text{Crp}(S)ʻ\gamma .\supset .\beta = \gamma .\\ [(1).*30·37] &\supset .\text{Crp}(S)ʻ\beta = \text{Crp}(S)ʻ\gamma &\qquad \text{(2)}\\ \vdash .(2).*37·63.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\rho ,\sigma \in \text{Crp} (S)ʻʻ\lambda .\exists !\rho \cap \sigma .\supset _{\rho ,\sigma }.\rho = \sigma \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*111·25. $\begin{aligned}&\vdash :S\in 1\rightarrow \text{Cls}.S\,\unicode{x2abd}\, \text{ sm }.\lambda \subset \text{ᗡ}ʻS.\supset .\text{Crp}(S)ʻʻ\lambda \in \text{Cls ex}^{2}\,\text{excl}\\ &[*111·24·22]\end{aligned}$

*111·3. $\vdash : \lambda \in \text{Cls ex}^{2}\,\text{excl} . \supset . \dot{s} ʻʻ\text{D}ʻʻ {\in}_{\Delta} ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda \subset (\alpha \uparrow sʻ\lambda )_{\Delta }ʻsʻ\lambda$

Dem. $\begin{array}{l} \vdash . *37·29 . *24·12 . \supset \\ \vdash : {\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda = \Lambda . &\supset . \dot{s} ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda \subset (\alpha \uparrow sʻ\lambda )_{\Delta }ʻsʻ\lambda &\qquad \text{(1)}\\ \vdash . *83·1 . \supset \\ \vdash \colon\ldotp \text{Hp} . \exists ! {\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda . \supset : \beta \in \lambda . &\supset _{\beta } . \exists ! \alpha \,\overline{\text{ sm }}\, ʻ\beta .\\ [*111·18] &\supset _{\beta } . \exists ! (\alpha \uparrow \beta )_{\Delta }ʻ\beta .\\ [*80·15] &\supset _{\beta } . \exists ! (\alpha \uparrow sʻ\lambda )_{\Delta }ʻ\beta :\\ [*80·83] &\supset : \{(\alpha \uparrow sʻ\lambda )_{\Delta }ʻʻ\lambda\} \upharpoonleft (\alpha \uparrow sʻ\lambda )_{\Delta } \in 1 \rightarrow 1 &\qquad \text{(2)}\\ \vdash . (2) . *111·18 . *85·72 \frac{\alpha \,\overline{\text{ sm }}\, , (\alpha \uparrow sʻ\lambda )_{\Delta }}{R,\, S}. \supset \\ \vdash : \text{Hp} . \exists ! {\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda . &\supset . \text{D}ʻʻ{\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda \subset \text{D}ʻʻ{\in}_{\Delta}ʻ(\alpha \uparrow sʻ\lambda )_{\Delta }ʻʻ\lambda .\\ [*37·2] \supset . \dot{s} ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\alpha \,\overline{\text{ sm }}\, ʻʻ\lambda &\subset \dot{s} ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ(\alpha \uparrow sʻ\lambda )_{\Delta }ʻʻ\lambda \\ [*85·27] &\subset (\alpha \uparrow sʻ\lambda )_{\Delta }ʻsʻ\lambda &\qquad \text{(3)}\\ \vdash . (1) . (3) . \supset \vdash . \text{Prop} \end{array}$

*111·31. $\begin{aligned}\vdash : \lambda , Sʻʻ\lambda \in \text{Cls}^{2} \text{excl} . S \in 1 \rightarrow 1 . R \in {\in}_{\Delta}ʻ\text{Crp} &(S)ʻʻ\lambda . \supset .\\ &\dot{s} ʻ\text{D}ʻR \in (sʻSʻʻ\lambda ) \,\overline{\text{ sm }}\, (sʻ\lambda )\end{aligned}$

Dem. $\begin{array}{l} \vdash . *83·2 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : \beta \in \lambda . &\equiv . Rʻ\text{Crp} (S)ʻ\beta \in \text{Crp} (S)ʻ\beta .\\ [*111·202] &\equiv . Rʻ\text{Crp} (S)ʻ\beta \in 1 \rightarrow 1 . \text{D}ʻRʻ\text{Crp} (S)ʻ\beta = Sʻ\beta .\\ &\text{ᗡ}ʻRʻ\text{Crp} (S)ʻ\beta = \beta &\qquad \text{(1)}\\ \vdash . (1) . *72·322 . &\supset \vdash : \text{Hp} . \supset . \dot{s} ʻRʻʻ\text{Crp} (S)ʻʻ\lambda \in 1 \rightarrow 1 .\\ [*80·34] &\supset . \dot{s} ʻ\text{D}ʻR \in 1 \rightarrow 1 &\qquad \text{(2)}\\ \vdash . (1) . *37·68 . *50·17 . \supset \vdash : \text{Hp} . &\supset . \text{D}ʻʻRʻʻ\text{Crp} (S)ʻʻ\lambda = Sʻʻ\lambda .\\ &\text{ᗡ}ʻʻRʻʻ\text{Crp} (S)ʻʻ\lambda = \lambda .\\ [*80·34] &\supset . \text{D}ʻʻ\text{D}ʻR = Sʻʻ\lambda . \text{ᗡ}ʻʻ\text{D}ʻR = \lambda .\\ [*41·43·44] &\supset . \text{D}ʻ\dot{s} ʻ\text{D}ʻR = sʻSʻʻ\lambda . \text{ᗡ}ʻ\dot{s} ʻ\text{D}ʻR = sʻ\lambda &\qquad \text{(3)}\\ \vdash . (2) . (3) . *73·03 . \supset \vdash . \text{Prop} \end{array}$

*111·311. $\begin{aligned}&\vdash : \lambda , Sʻʻ\lambda \in \text{Cls}^{2} \text{excl} . S \in 1 \rightarrow 1 . \exists ! {\in}_{\Delta}ʻ\text{Crp} (S)ʻʻ\lambda . \supset · sʻSʻʻ\lambda \text{ sm } sʻ\lambda\\ &[*111·31 . *73·04]\end{aligned}$

*111·313. $\begin{aligned}\vdash : \lambda \in \text{Cls}^{2} \text{excl} . R \in &{\in}_{\Delta }ʻ\text{Crp} (S)ʻʻ\lambda . \beta \in \lambda . M = \dot{s} ʻ\text{D}ʻR . \supset .\\ &M \upharpoonright \beta = Rʻ\text{Crp} (S)ʻ\beta . M \upharpoonright \beta \in \text{Crp} (S)ʻ\beta\end{aligned}$

Dem. $\begin{array}{l} \vdash . *83·2 . \supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp \alpha \in \lambda . &\supset _{\alpha } : Rʻ\text{Crp} (S)ʻ\alpha \in \text{Crp} (S)ʻ\alpha : &\qquad \text{(1)}\\ [*111·202] &\supset _{\alpha } : \text{ᗡ}ʻRʻ\text{Crp} (S)ʻ\alpha = \alpha :\\ [*33·14 . *4·71] &\supset _{\alpha } : x {Rʻ\text{Crp} (S)ʻ\alpha } y . \equiv . x {Rʻ\text{Crp} (S)ʻ\alpha } y . y \in \alpha &\qquad \text{(2)}\\ \vdash .*35·101.*83·23.*41·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x(M\upharpoonright \beta )y.&\equiv .(\exists \alpha ).\alpha \in \lambda .x\{Rʻ\text{Crp}(S)ʻ\alpha \}y.y\in \beta \\ [(2)] & \equiv .(\exists \alpha ).\alpha \in \lambda .x\{Rʻ\text{Crp}(S)ʻ\alpha\}y.y\in \alpha \cap \beta .\\ [*84·11.*22·5] &\equiv .(\exists \alpha ).\alpha \in \lambda .x\{Rʻ\text{Crp}(S)ʻ\alpha\}y.y\in \beta .\alpha = \beta .\\ [*13·195] &\equiv .\beta \in \lambda .x\{Rʻ\text{Crp}(S)ʻ\beta \}y.y\in \beta .\\ [\text{Hp}.*4·73.(2)] &\equiv .x\{Rʻ\text{Crp}(S)ʻ\beta\}y &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*111·32. $\begin{aligned}\vdash :\lambda ,Sʻʻ\lambda \in &\text{Cls}^{2} \text{excl}.S\in 1\rightarrow 1.R\in {\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .M = \dot{s} ʻ\text{D}ʻR.\supset .\\ &M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda .Sʻʻ\lambda = M_{\in }ʻʻ\lambda .S\upharpoonright \lambda = M_{\in }\upharpoonright \lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*111·31.*73·03.\supset \vdash :\text{Hp}.\supset .M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda &\qquad \text{(1)}\\ \vdash .*111·313·202. \supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \lambda .\supset .\text{D}ʻ(M\upharpoonright \beta ) = Sʻ\beta .\text{ᗡ}ʻ(M\upharpoonright \beta ) = \beta .\\ [*37·25] \supset .(M\upharpoonright \beta )ʻʻ\beta = Sʻ\beta .\\ [*37·421·11] \supset .M_{\in }ʻ\beta = Sʻ\beta :\\ [*35·71.*37·69] \supset :M_{\in }\upharpoonright \lambda = S\upharpoonright \lambda .M_{\in }ʻʻ\lambda = Sʻʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*111·321. $\begin{aligned}\vdash :\lambda ,&Sʻʻ\lambda \in \text{Cls}^{2} \text{excl}.S\in 1\rightarrow 1.\exists !{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\supset .\\ &(\exists M).M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda .Sʻʻ\lambda = M_{\in }ʻʻ\lambda .S\upharpoonright \lambda = M_{\in }\upharpoonright \lambda\\ &[*111·32]\end{aligned}$

*111·322. $\begin{aligned}\vdash :\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.&S\in \kappa \,\overline{\text{ sm }}\, \lambda .R\in {\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .M = \dot{s} ʻ\text{D}ʻR.\supset .\\ &M\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .S = M_{\in }\upharpoonright \lambda \quad[*111·32·1.*35·66.*73·03]\end{aligned}$

*111·33. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax}.\supset :S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.&\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\kappa =Sʻʻ\lambda .\lambda \subset \text{ᗡ}ʻS.\supset .\\ &sʻ\kappa \text{ sm }sʻ\lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*111·221.\supset \\ \vdash \colon\ldotp S\in 1\rightarrow 1.&S\,\unicode{x2abd}\, \text{ sm }.\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\kappa =Sʻʻ\lambda .\lambda \subset \text{ᗡ}ʻS.\supset :\\ &\beta \in \lambda .\supset _{\beta }.\exists !\text{Crp}(S)ʻ\beta :\\ [*88·37] \supset :\text{Mult ax}.&\supset .\exists !{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\\ [*111·311] &\supset .sʻ\kappa \text{ sm }sʻ\lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*111·34. $\begin{aligned}\vdash \colon\ldotp &\text{Mult ax}.\supset :\\ &(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS=\kappa .\text{ᗡ}ʻS = \lambda .\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\supset .\\ &(\exists M).M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda .\kappa = M_{\in }ʻʻ\lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash .*111·25.\supset \\ \vdash \colon\ldotp S\in 1\rightarrow 1.&S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\supset :\\ &\text{Crp}(S)ʻʻ\lambda \in \text{Cls ex}^{2}\,\text{excl}:\\ [*88·32] &\supset :\text{Mult ax}.\supset .\exists !{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\\ [*111·321] &\supset .(\exists M).M\in 1\rightarrow 1.\text{ᗡ}ʻM = sʻ\lambda .\kappa = M_{\in }ʻʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*10·11·23.\text{Comm}.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the elementary properties of " $\text{sm} \,\text{sm}$ ." It will be seen that they are closely analogous to those of " $\text{sm}$ ."

*111·4. $\begin{aligned}&\vdash :\kappa \text{ sm } \text{ sm }\lambda . \equiv .(\exists T).T\in 1\rightarrow 1.\text{ᗡ}ʻT = sʻ\lambda .\kappa = T_{\in }ʻʻ\lambda . \equiv .\exists !\kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda \\ &[*111·1.(*111·03)]\end{aligned}$

*111·401. $\vdash :\kappa \text{ sm } \text{ sm } \lambda . \equiv .(\exists T).T\in 1\rightarrow 1.sʻ\lambda \subset \text{ᗡ}ʻT.\kappa = T_{\in }ʻʻ\lambda$

Dem. $\begin{array}{l} \vdash . *22·42 . *111·4.\supset \vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .(\exists T).T\in 1\rightarrow 1.sʻ\lambda \subset \text{ᗡ}ʻT.\kappa = T_{\in }ʻʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*111·14.\supset \vdash .\text{Prop} \end{array}$

*111·402. $\begin{aligned}&\vdash :\kappa \text{ sm } \text{ sm } \lambda . \equiv .(\exists T).T\upharpoonright sʻ\lambda \in 1\rightarrow 1.sʻ\lambda \subset \text{ᗡ}ʻT.\kappa = T_{\in }ʻʻ\lambda\\ &[*111·14·1·121]\end{aligned}$

*111·43. $\begin{aligned}&\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda \\ &[*111·11·111]\end{aligned}$

*111·44. $\vdash :\kappa \text{ sm } \text{ sm } \lambda .\supset .\kappa \text{ sm } \lambda .sʻ\kappa \text{ sm } sʻ\lambda \quad[*111·11·4.*73·03]$

*111·451. $\vdash :\kappa \text{ sm } \text{ sm } \lambda . \equiv .\lambda \text{ sm } \text{ sm } \kappa \quad[*111·131·4]$

*111·452. $\vdash :\kappa \text{ sm } \text{ sm } \lambda .\lambda \text{ sm } \text{ sm } \mu .\supset .\kappa \text{ sm } \text{ sm } \mu \quad[*111·132·4]$

*111·46. $\begin{aligned}&\vdash :\lambda ,Sʻʻ\lambda \in \text{Cls}^{2} \text{excl}.S\in 1\rightarrow 1.\exists !{\in}_{\Delta}ʻ\text{Crp}(S)ʻʻ\lambda .\supset .Sʻʻ\lambda \text{ sm } \text{ sm } \lambda \\ &[*111·32·4]\end{aligned}$

*111·47. $\vdash \colon\ldotp \kappa \text{ sm } \text{ sm } \lambda .\supset :\kappa \in \text{Cls}^{2} \text{excl}. \equiv .\lambda \in \text{Cls}^{2} \text{excl}$

Dem. $\begin{array}{l} \vdash . *111·4. &\supset \vdash \colon\ldotp \text{Hp}.\supset :(\exists T).T\in 1\rightarrow 1.\text{ᗡ}ʻT = sʻ\lambda .\kappa = Tʻʻʻ\lambda :\\ [*84·53] &\supset :\lambda \in \text{Cls}^{2} \text{excl}.\supset .\kappa \in \text{Cls}^{2} \text{excl} &\qquad \text{(1)}\\ \vdash .(1).*111·451.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\lambda \in \text{Cls}^{2} \text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*111·5. $\begin{aligned}&\vdash \colon\colon \text{Mult ax}.\supset \colon\ldotp \kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\supset :\\ &\kappa \text{ sm } \text{ sm } \lambda . \equiv .(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\\ &\equiv .\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm } \quad[*111·34·43·4]\end{aligned}$

*111·51. $\begin{aligned}&\vdash \colon\ldotp \text{Mult ax}.\supset :\kappa ,\lambda \in \text{Cls}^{2} \text{excl}.\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm }.\supset .sʻ\kappa \text{ sm }sʻ\lambda \\ &[*111·5·44]\end{aligned}$

*111·52. $\vdash :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .\supset .\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm }$

Dem. $\begin{array}{l} \vdash .*100·5.*73·1.&\supset \vdash :\text{Hp}.\supset .(\exists S).S\in 1\rightarrow 1.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda &\qquad \text{(1)}\\ \vdash .*100·5. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \kappa .\beta \in \lambda .\supset .\alpha \text{ sm } \beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*111·53. $\begin{aligned}&\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl excl}ʻ\nu .\supset .\kappa \text{ sm } \text{ sm } \lambda\\ &[*111·52·5]\end{aligned}$

In this number, we return to the arithmetical operations. The definition of addition in *110 was only applicable to a finite number of summands, because the summands had to be enumerated. In the present number, we define the arithmetical sum of a class of classes, so that the summands are given as the members of a class, and do not require to be enumerated. Hence the definition in this number is as applicable to an infinite number of summands as to a finite number.

If $\kappa$ is a class of mutually exclusive classes, the number of $sʻ\kappa$ will be the sum of the numbers of members of $\kappa$ ; i.e. if we write " $\Sigma \text{Nc}ʻ\kappa$ " for the sum of the numbers of members of $\kappa$ , $\kappa \in \text{Cls}^{2} \text{excl}.\supset .\text{Nc}ʻsʻ\kappa =\Sigma \text{Nc}ʻ\kappa .$ But when the members of $\kappa$ are not mutually exclusive, a term $x$ which is a member of two members (say $\alpha$ and $\beta$ ) of $\kappa$ has to be counted twice over in obtaining the arithmetical sum of $\kappa$ , whereas in the logical sum $x$ is only counted once. Thus we need a construction which shall duplicate $x$ , taking it first as a member of $\alpha$ , and then as a member of $\beta$ . This is effected if we replace $x$ first by $x\downarrow \alpha$ , and then by $x\downarrow \beta$ . In fact, $x\downarrow \alpha$ has the kind of arithmetical properties which we mean to secure when we speak of " $x$ considered as a member of $\alpha$ "—a phrase which, as it stands, does not serve our purpose, for $x$ is simply $x$ however we may choose to consider it. Thus we replace $\alpha$ by $\downarrow \alphaʻʻ\alpha$ and $\beta$ by $\downarrow \betaʻʻ\beta$ and so on; i.e. (using *85·5), we replace $\alpha$ by $\in \unicode{x21A7}\alpha$ and $\beta$ by $\in \unicode{x21A7}\beta$ and so on. These new classes are similar to $\alpha$ and $\beta$ and so on, and are mutually exclusive. Hence their logical sum has the number of terms which is wanted for the arithmetical sum of the members of $\kappa$ . Thus we put $\begin{aligned} \Sigma ʻ\kappa &=sʻ\in \unicode{x21A7}ʻʻ\kappa &\quad\text{Df},\\ \Sigma \text{Nc}ʻ\kappa &=\text{Nc}ʻ\Sigma ʻ\kappa &\quad\text{Df}. \end{aligned}$

With regard to the second of these definitions, it is to be observed that $\Sigma \text{Nc}ʻ\kappa$ is not a function of $\text{Nc}ʻʻ\kappa$ , unless no two members of $\kappa$ are similar; for $\text{Nc}ʻʻ\kappa$ cannot contain the same number twice over. For the same reason, if $\lambda$ is a class of cardinals, and we define " $\text{Sum}ʻ\lambda$ ," we do not get what[Pg 98] is wanted for arithmetical addition, because our definition will not enable us to deal with summations in which there are numbers that are repeated. We could, if it were worth while, define " $\text{Sum}ʻ\lambda$ " as follows: Take a class of classes $\kappa$ , consisting of one class having each number which is a member of $\lambda$ , i.e. let $\kappa$ be a selection from $\lambda$ ; then $\Sigma ʻ\kappa$ will have the required number of terms. i.e. we might put $\text{Sum}ʻ\lambda = \hat{\xi} \{(\exists \kappa ).\kappa \in \text{D}ʻʻ{\in}_{\Delta}ʻ\lambda .\xi \text{ sm }\Sigma ʻ\kappa\} \quad\text{Df}.$ But since this definition is only available for sums in which no number is repeated, it is not worth while to introduce it.

*112·15. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .sʻ\kappa \in \Sigma \text{Nc}ʻ\kappa$

*112·17. $\vdash :\kappa \text{ sm }\text{ sm }\lambda .\supset .\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda .\Sigma ʻ\kappa \text{ sm }\Sigma ʻ\lambda$

The chief point in the above proposition is that it does not require $\kappa$ , $\lambda \in \text{Cls}^{2} \text{excl}$ .

*112·2—·24 are concerned with the use of the multiplicative axiom and the propositions of *111 in which it appears as hypothesis. We have

*112·22. $\vdash \colon\ldotp \text{Mult ax}.\supset :\exists !(\in \unicode{x21A7}ʻʻ\kappa )\,\overline{\text{ sm }}\, (\in \unicode{x21A7}ʻʻ\lambda )\cap \text{Rl}ʻ\text{ sm }.\supset .\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda$

*112·24. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .\supset .\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda$

I.e. assuming the multiplicative axiom, two classes which each consist of $\mu$ classes of $\nu$ terms each have the same number of terms in their sum. This number would naturally be defined as $\mu$ multiplied by $\nu$ , but owing to the necessity of the multiplicative axiom in this proposition, we have selected a different definition of multiplication (*113) which does not depend upon the multiplicative axiom. The reader should observe that the similarity of two classes, each of which consists of $\mu$ mutually exclusive sets of $\nu$ terms, cannot be proved in general without the multiplicative axiom.

The remaining propositions of this number give properties of $\Sigma$ in special cases. We prove that $\Sigma ʻ\Lambda = \Lambda$ (*112·3), that $\Sigma \text{Nc}ʻ\iota ʻ\alpha = \text{Nc}ʻ\alpha$ (*112·321), that $\alpha \neq \beta .\supset .\Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup\iota ʻ\beta ) = \text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta$ (*112·34), which connects the definition of addition in this number with that in *110. Finally we prove the general associative law for addition, in the following two forms:

*112·43. $\vdash :\lambda \in \text{Cls}^{2} \text{excl}.\supset .\text{Nc}ʻ\Sigma ʻ\Sigma ʻʻ\lambda = \text{Nc}ʻ\Sigma ʻsʻ\lambda$

*112·02. $\Sigma \text{Nc}ʻ\kappa = \text{Nc}ʻ\Sigma ʻ\kappa \quad\text{Df}$

*112·1. $\vdash .\Sigma ʻ\kappa = sʻ\in \unicode{x21A7} ʻʻ\kappa \quad[*20·2. (*112·01)]$

*112·101. $\vdash .\Sigma \text{Nc}ʻ\kappa = \text{Nc}ʻ\Sigma ʻ\kappa = \text{Nc}ʻsʻ\in \unicode{x21A7}ʻʻ\kappa \quad[*20·2. *112·1. (*112*02)]$

*112·102. $\vdash .\Sigma ʻ\kappa = \hat{R} \{(\exists \alpha ,x).\alpha \in \kappa .x\in \alpha .R=x\downarrow \alpha\}$

Dem. $\begin{array}{l} \vdash . *85·6. *40·11. *112·1.\supset \\ \vdash . \Sigma ʻ\kappa &= \hat{R} \{(\exists \mu ,\alpha ).\alpha \in \kappa .\mu = \downarrow \alpha ʻʻ\alpha .R\in \mu\}\\ [*13·195] &= \hat{R} \{(\exists \alpha ).\alpha \in \kappa .R\in \downarrow \alpha ʻʻ\alpha\}\\ [*55·231] &= \hat{R} \{(\exists \alpha , x).\alpha \in \kappa .x\in \alpha .R=x\downarrow \alpha\}.\supset \vdash .\text{Prop} \end{array}$

*112·103. $\vdash .\Sigma ʻ\kappa = sʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \kappa .\mu =\downarrow \alpha ʻʻ\alpha\} \quad[*112·1. *85·6]$

*112·11. $\vdash :\beta \in \Sigma \text{Nc}ʻ\kappa .\equiv . \beta \text{ sm } sʻ\in \unicode{x21A7}ʻʻ\kappa \quad[*112·101]$

*112·12. $\vdash .sʻ\in \unicode{x21A7}ʻʻ\kappa \in \Sigma \text{Nc}ʻ\kappa \quad[*112·11]$

*112·13. $\vdash :\lambda \text{ sm } \text{ sm } \in \unicode{x21A7}ʻʻ\kappa . \supset . sʻ\lambda \in \Sigma \text{Nc}ʻ\kappa \quad[*111·44. *112·11]$

*112·14. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}. \supset . \in \unicode{x21A7} ʻʻ\kappa \text{ sm } \text{ sm } \kappa$

Dem. $\begin{array}{l} \vdash . *21·33 .&\supset \vdash \colon\ldotp \text{Hp}.T= \hat{R} \hat{x} \{(\exists \alpha ).\alpha \in \kappa .x\in \alpha .R= x\downarrow \alpha\}.\supset :\\ &xTR.yTR . \supset . (\exists \alpha ,\beta ).R = x\downarrow \alpha .R = y\downarrow \beta .\\ [*55·31] &\supset .x=y:\\ [*71·17] &\supset :T\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *21·33 .\supset\\ \vdash :\text{Hp}(1).xTR.xTS. &\supset . (\exists \alpha ,\beta ).\alpha ,\beta \in \kappa .x\in \alpha \cap \beta .R = x\downarrow \alpha .S=x\downarrow \beta .\\ [*84·11.\text{Hp}] &\supset . (\exists \alpha ,\beta ).\alpha =\beta .R = x\downarrow \alpha .S = x\downarrow \beta .\\ [*13·195] &\supset .R=S:\\ [*71·171] &\supset :T\in \text{Cls}\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*33·131.\supset \vdash \colon\ldotp \text{Hp}(1).\supset :x\in \text{ᗡ}ʻT. &\equiv . (\exists R,\alpha ).\alpha \in \kappa .x\in \alpha .R = x\downarrow \alpha .\\ [*55·12] &\equiv .x\in sʻ\kappa &\qquad \text{(3)}\\ \vdash .*37·1·11 .\supset \\ \vdash \colon\colon \text{Hp} .\supset \colon\ldotp \alpha \in \kappa .\supset : R\in T_{\in }ʻ\alpha . &\equiv . (\exists x,\beta ).x\in \alpha \cap \beta .\beta \in \kappa .R=x\downarrow \beta .\\ [*84·11.\text{Hp}] &\equiv . (\exists x,\beta ).x\in \alpha \cap \beta .\beta \in \kappa .\alpha =\beta .R = x\downarrow \beta .\\ [*13·195] &\equiv . (\exists x).x\in \alpha .R = x\downarrow \beta .\\ [*85·601] &\equiv .R\in \in \unicode{x21A7}ʻ\alpha \colon\ldotp \\ [*37·69] &\supset \colon\ldotp T_{\in }ʻʻ\kappa = \in \unicode{x21A7}ʻʻ\kappa &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).*111·4.\supset \vdash .\text{Prop} \end{array}$

*112·15. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}. \supset . sʻ\kappa \in \Sigma \text{Nc}ʻ\kappa \quad[*112·14·11. *111·44]$

*112·151. $sʻ\in \unicode{x21A7}ʻʻ\lambda = \hat{R} \{(\exists \alpha ,x).\alpha \in \lambda .x\in \alpha .R = x\downarrow \alpha \}.\dot{s} ʻsʻ\in \unicode{x21A7}ʻʻ\lambda = \in \upharpoonright \lambda$

Dem. $\begin{array}{l} \vdash .*40·11.(*85·5).\supset \\ \vdash . sʻ\in \unicode{x21A7}ʻʻ\lambda &= \hat{R} \{(\exists \alpha ).\alpha \in \lambda .R\in \downarrow \alpha ʻʻ\alpha\}\\ [*38·131] &= \hat{R} \{(\exists \alpha ,x).\alpha \in \lambda .x\in \alpha .R = x\downarrow \alpha\} &\qquad \text{(1)}\\ \vdash .(1).*41·11.\supset \\ \vdash .\dot{s} ʻsʻ\in \unicode{x21A7}ʻʻ\lambda &= \hat{y} \hat{\beta} \{(\exists R,\alpha ,x).\alpha \in \lambda .x\in \alpha .R = x\downarrow \alpha .yR\beta\}\\ [*13·195.*55·13] &= \hat{y} \hat{\beta} \{(\exists \alpha ,x).\alpha \in \lambda .x\in \alpha .y = x.\beta = \alpha\}\\ [*13·22] &= \hat{y} \hat{\beta} \{\beta \in \lambda .y\in \beta\}\\ [*35·101] &= \in \upharpoonright \lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The following proposition is a lemma for *112·153, which is required for *112·16. *112·16 in turn is used in *112·17, which is a fundamental proposition in the theory of addition.

*112·152. $\vdash :T\in 1\rightarrow Cls.\beta \subset \text{ᗡ}ʻT.\supset .(T\parallel \breve{T} _{\in })ʻʻ\in \unicode{x21A7}\beta = \in \unicode{x21A7}(Tʻʻ\beta )$

Dem. $\begin{array}{l} \vdash . *37·6.*85·601.&\supset \vdash .(T\parallel \breve{T} _{\in })ʻʻ\in \unicode{x21A7}\beta = \hat{R} \{(\exists y).y\in \beta .R = (T\parallel \breve{T} _{\in })ʻ(y\downarrow \beta )\} &\qquad \text{(1)}\\ \vdash .(1).*55·61.\supset \\ \vdash :\text{Hp}.\supset .(T\parallel \breve{T} _{\in })ʻʻ\in \unicode{x21A7}\beta &= \hat{R} \{(\exists y).y\in \beta .R = (Tʻy)\downarrow (T_{\in }ʻ\beta )\}\\ [*37·11] &= \hat{R} \{(\exists y).y\in \beta .R = (Tʻy)\downarrow (Tʻʻ\beta )\}\\ [*38·131] &= \downarrow (Tʻʻ\beta )ʻʻ(Tʻʻ\beta )\\ [*85·601] &= \in \unicode{x21A7}(Tʻʻ\beta ):\supset \vdash .\text{Prop} \end{array}$

In the following proposition, we have a double correlator of a sort which will frequently occur in cardinal arithmetic, namely $T\parallel\breve{T}_{\in }$ with its converse domain limited, where $T$ is a given double correlator (or single correlator, on other occasions). As appears from the propositions used in the above proof of *112·152, if $T$ is a correlator whose converse domain includes $\beta$ and has $y$ as a member, $(T\parallel \breve{T} _{\in })ʻ(y\downarrow \beta ) =(Tʻy)\downarrow (Tʻʻ\beta )$ . Thus $T\parallel \breve{T}_{\in }$ is an operation which, when operating on suitable relations of individuals to classes (including selectors), turns the individuals into their correlates and the classes into the classes of their members' correlates. This is why it is a useful relation.

*112·153. $T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .(T\parallel \breve{T} _{\in })\upharpoonright sʻ\in \unicode{x21A7}ʻʻ\lambda \in (\in \unicode{x21A7}ʻʻ\kappa )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\in \unicode{x21A7}ʻʻ\lambda )$

Dem. $\begin{array}{l} \vdash .*112·151.*41·43·44.&\supset \vdash .sʻ\text{D}ʻʻsʻ\in \unicode{x21A7}ʻʻ\lambda = \text{D}ʻ(\in \upharpoonright \lambda ).sʻ\text{ᗡ}ʻʻsʻ\in \unicode{x21A7}ʻʻ\lambda = \text{ᗡ}ʻ(\in \upharpoonright \lambda ).\\ [*62·41·43] &\supset \vdash .sʻ\text{D}ʻʻsʻ\in \unicode{x21A7}ʻʻ\lambda = sʻ\lambda .sʻ\text{ᗡ}ʻʻsʻ\in \unicode{x21A7}ʻʻ\lambda = \lambda -\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash . (1) . *111·1 . *37·231 . &\supset \vdash : \text{Hp} . \supset . sʻ\text{D}ʻʻsʻ\in \unicode{x21A7} ʻʻ\lambda \subset \text{ᗡ}ʻT . sʻ\text{ᗡ}ʻʻsʻ\in \unicode{x21A7} ʻʻ\lambda \subset \text{ᗡ}ʻT_{\in } &\qquad \text{(2)}\\ \vdash . *111·1 .*71·29 . &\supset \vdash : \text{Hp} . \supset . T \upharpoonright sʻ\text{D}ʻʻsʻ\in \unicode{x21A7} ʻʻ\lambda \in 1 \rightarrow 1 &\qquad \text{(3)}\\ \vdash . *111·11 . (1) . &\supset \vdash : \text{Hp} . \supset . T_{\in } \upharpoonright sʻ\text{ᗡ}ʻʻsʻ\in \unicode{x21A7} ʻʻ\lambda \in 1 \rightarrow 1 &\qquad \text{(4)}\\ \vdash . (2) . (3) . (4) . *74·775 \frac{sʻ\in \unicode{x21A7} ʻʻ\lambda , T, T_{\in }}{\lambda,\, Q,\, R}. &\supset \vdash : \text{Hp} . \supset . (T \parallel \breve{T} _{\in }) \upharpoonright sʻ\in \unicode{x21A7} ʻʻ\lambda \in 1 \rightarrow 1 &\qquad \text{(5)}\\ \vdash . *43·302 . &\supset \vdash . sʻ\in \unicode{x21A7} ʻʻ\lambda \subset \text{ᗡ}ʻ(T \parallel \breve{T} _{\in }) &\qquad \text{(6)}\\ \vdash . *112·152 . \supset \vdash : \text{Hp} . &\supset . (T \parallel \breve{T} _{\in })ʻʻʻ\in \unicode{x21A7} ʻʻ\lambda = \in \unicode{x21A7} ʻʻTʻʻʻ\lambda .\\ [*37·11] \supset . (T \parallel \breve{T} _{\in })_{\in }ʻʻ\in \unicode{x21A7} ʻʻ\lambda &= \in \unicode{x21A7} ʻʻT_{\in }ʻʻ\lambda \\ [*111·1 . \text{Hp}] &= \in \unicode{x21A7} ʻʻ\kappa &\qquad \text{(7)}\\ \vdash . (5) . (6) . (7) . *111·14 . \supset \vdash . \text{Prop} \end{array}$

*112·16. $\vdash : \kappa \text{ sm } \text{ sm } \lambda . \supset . \in \unicode{x21A7} ʻʻ\kappa \text{ sm } \text{ sm } \in \unicode{x21A7} ʻʻ\lambda \quad[*112·153 . *111·4]$

*112·17. $\vdash : \kappa \text{ sm } \text{ sm } \lambda . \supset . \Sigma \text{Nc}ʻ\kappa . \Sigma \text{Nc}ʻ\lambda . \Sigma ʻ\kappa \text{ sm } \Sigma ʻ\lambda$

Dem. $\begin{array}{l} \vdash . *112·16 . *111·44 . \supset \vdash : \text{Hp} . \supset . sʻ\in \unicode{x21A7} ʻʻ\kappa \text{ sm } sʻ\in \unicode{x21A7} ʻʻ\lambda &\qquad \text{(1)}\\ \vdash . (1) . *112·1·101 . \supset \vdash . \text{Prop} \end{array}$

*112·18. $\vdash . \Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\in \unicode{x21A7} ʻʻ\kappa$

Dem. $\begin{array}{l} \vdash . *85·61 . *112·15 . \supset \vdash . sʻ\in \unicode{x21A7} ʻʻ\kappa \in \Sigma \text{Nc}ʻ\in \unicode{x21A7} ʻʻ\kappa &\qquad \text{(1)}\\ \vdash . (1) . *112·12 . *100·34 . \supset \vdash . \text{Prop} \end{array}$

*112·2. $\begin{aligned}\vdash : S \in 1 \rightarrow 1 . \text{D}ʻS = \in &\unicode{x21A7} ʻʻ\kappa . \text{ᗡ}ʻS = \in \unicode{x21A7} ʻʻ\lambda . \exists ! {\in}_{\Delta} ʻ\text{Crp} (S)ʻʻ\lambda .\\ &\supset . \Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda . \Sigma ʻ\kappa \text{ sm } \Sigma ʻ\lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash . *111·311 . *85·61 . \supset \vdash : \text{Hp} . \supset . sʻ\in \unicode{x21A7} ʻʻ\kappa \text{ sm } sʻ\in \unicode{x21A7} ʻʻ\lambda &\qquad \text{(1)}\\ \vdash . (1) . *112·1·101 . \supset \vdash . \text{Prop} \end{array}$

*112·21. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax} . \supset : (\exists S) . S \in 1 \rightarrow 1 . &S \,\unicode{x2abd}\, \text{ sm } . \text{D}ʻS = \in \unicode{x21A7} ʻʻ\kappa . \text{ᗡ}ʻS = \in \unicode{x21A7} ʻʻ\lambda .\\ &\equiv . \in \unicode{x21A7} ʻʻ\kappa \text{ sm } \text{ sm } \in \unicode{x21A7} ʻʻ\lambda \quad[*111·5 . *85·61]\end{aligned}$

*112·22. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax} . \supset : \exists ! (\in \unicode{x21A7} ʻʻ\kappa ) \,\overline{\text{ sm }}\, (\in \unicode{x21A7} ʻʻ\lambda \cap \text{ᗡ}ʻʻ ʻ\text{ sm } . \supset .\\ \Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda \quad[*112·17·18·21]\end{aligned}$

*112·23. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax} . \supset : \kappa , \lambda \in \text{Cls}^{2} \text{excl} . \exists ! \kappa &\,\overline{\text{ sm }}\, \lambda \cap \text{Rl}ʻ\text{ sm } . \supset .\\ &sʻ\kappa , sʻ\lambda \in \Sigma \text{Nc}ʻ\kappa . \Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda\end{aligned}$

Dem. $\begin{array}{l} \vdash . *112·15 . &\supset \vdash : \text{Hp} . \kappa , \lambda \in \text{Cls}^{2} \text{excl} . \supset . sʻ\kappa \in \Sigma \text{Nc}ʻ\kappa . sʻ\lambda \in \Sigma \text{Nc}ʻ\lambda &\qquad \text{(1)}\\ \vdash . *111·51 . &\supset \vdash : \text{Hp} (1) . \exists ! \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻ ʻ\text{ sm } . \supset . sʻ\kappa \text{ sm } sʻ\lambda &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash . \text{Prop} \end{array}$

*112·231. $\vdash : S \in \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻ ʻ\text{ sm } . \supset . \in \unicode{x21A7} \mid S\mid \text{Cnv}ʻ\in \unicode{x21A7} \in (\in \unicode{x21A7} ʻʻ\kappa ) \,\overline{\text{ sm }}\, ( \in \unicode{x21A7} ʻʻ\lambda ) \cap \text{Rl} ʻ\text{ sm }$

Dem. $\begin{array}{l} \vdash . *73·63 . *85·601 . &\supset \vdash : S \in \kappa \,\overline{\text{ sm }}\, \lambda . \supset . \in \unicode{x21A7} \mid S\mid \text{Cnv}ʻ\in \unicode{x21A7} \in (\in \unicode{x21A7} ʻʻ\kappa ) \,\overline{\text{ sm }}\, (\in \unicode{x21A7} ʻʻ\lambda ) &\qquad \text{(1)}\\ \vdash . *85·601 . *73·33·34 .& \supset \vdash : S \,\unicode{x2abd}\, \text{ sm } . \supset . \in \unicode{x21A7} \mid S\mid \text{Cnv}ʻ\in \unicode{x21A7} \,\unicode{x2abd}\, \text{ sm } &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash : S \in \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻ ʻ\text{ sm } . \supset . \in \unicode{x21A7} \mid S\mid \text{Cnv}ʻ\in \unicode{x21A7} \in (\in \unicode{x21A7} ʻʻ\kappa ) \,\overline{\text{ sm }}\, (\in \unicode{x21A7} ʻʻ\lambda ) \cap \text{Rl} ʻ\text{ sm }:\\ &\supset \vdash . \text{Prop} \end{array}$

*112·24. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .\supset .\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*111·52.\supset \vdash :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .&\supset .\exists !\kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm }.\\ [*112·231] &\supset .\exists !(\in \unicode{x21A7}ʻʻ\kappa )\,\overline{\text{ sm }}\, (\in \unicode{x21A7}ʻʻ\lambda )\cap \text{ᗡ}ʻʻʻ\text{ sm } &\qquad \text{(1)}\\ \vdash .(1).*111·51.*85·61.\supset \\ \vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .&\supset .sʻ\in \unicode{x21A7}ʻʻ\kappa \text{ sm }sʻ\in \unicode{x21A7}ʻʻ\lambda .\\ [*112·101] &\supset .\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*112·102.\supset \vdash .\Sigma ʻ\iota ʻ\Lambda &= \hat{R} \{(\exists \alpha ,x).\alpha \in \iota ʻ\Lambda .x\in \alpha .R = x\downarrow \alpha\}\\ [*51·15] &= \hat{R} \{(\exists x).x\in \Lambda .R = x\downarrow \Lambda\}\\ [*24·15] &= \Lambda .\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*112·102.\supset \vdash .\Sigma ʻ\kappa &= \hat{R} \{(\exists \alpha ,x).\alpha \in \kappa .x\in \alpha .R = x\downarrow \alpha\}\\ [*10·24] &= \hat{R} \{(\exists \alpha ,x).\alpha \in \kappa .\exists !\alpha .x\in \alpha .R = x\downarrow \alpha\}\\ [*53·52] &= \hat{R} \{(\exists \alpha ,x).\alpha \in \kappa - \iota ʻ\Lambda .x\in \alpha .R = x\downarrow \alpha\}\\ [*112·102] &= \Sigma ʻ(\kappa - \iota ʻ\Lambda ).\supset \vdash .\text{Prop} \end{array}$

Thus if $\Lambda$ is a member of a class of classes, it does not affect the value of their arithmetical sum.

*112·303. $\vdash : \kappa \cap \Lambda = \Lambda . \supset . \Sigma ʻ\kappa \cap \Sigma ʻ\lambda = \Lambda$

Dem. $\begin{array}{l} \vdash .*112·102.\supset \\ \vdash :R\in \Sigma ʻ\kappa \cap \Sigma ʻ\lambda . &\equiv .(\exists \alpha ,\beta ,x,y).\alpha \in \kappa .\beta \in \lambda .x\in \alpha .y\in \beta .R = x\downarrow \alpha = y\downarrow \beta .\\ [*55·202] &\supset .(\exists \alpha ,x).\alpha \in \kappa \cap \lambda .x\in \alpha .\\ [*24·5] &\supset .\exists !\kappa \cap \lambda &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*112·3·301.*53·24.&\supset \vdash :sʻ\kappa = \Lambda .\supset .\Sigma ʻ\kappa = \Lambda &\qquad \text{(1)}\\ \vdash . *112·102. &\supset \vdash :\alpha \in \kappa .x\in \alpha .\supset .x\downarrow \alpha \in \Sigma ʻ\kappa :\\ [*10·24.*40·11] &\supset \vdash :\exists !sʻ\kappa .\supset .\exists !\Sigma ʻ\kappa &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*112·31. $\vdash .\Sigma ʻ(\kappa \cup \lambda ) = \Sigma ʻ\kappa \cup \Sigma ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*112·1.\supset \vdash .\Sigma ʻ(\kappa \cup \lambda ) &= sʻ\in \unicode{x21A7}ʻʻ(\kappa \cup \lambda )\\ [*40·31] &= sʻ\in \unicode{x21A7}ʻʻ\kappa \cup sʻ\in \unicode{x21A7}ʻʻ\lambda \\ [*112·1] &= \Sigma ʻ\kappa \cup \Sigma ʻ\lambda .\supset \vdash .\text{Prop} \end{array}$

*112·311. $\vdash : \kappa \cap \lambda = \Lambda . \supset . \Sigma \text{Nc}ʻ(\kappa \cup \lambda ) = \Sigma \text{Nc}ʻ\kappa +_{c} \Sigma \text{Nc}ʻ\lambda$

Dem. $\begin{array}{l} \vdash . *112·303 . *110·32 . \supset \\ \vdash : \text{Hp} . \supset . \text{Nc}ʻ(\Sigma ʻ\kappa \cup \Sigma ʻ\lambda ) &= \text{Nc}ʻ\Sigma ʻ\kappa +_{c} \text{Nc}ʻ\Sigma ʻ\lambda \\ [*112·101] &= \Sigma \text{Nc}ʻ\kappa +_{c} \Sigma \text{Nc}ʻ\lambda &\qquad \text{(1)}\\ \vdash . (1) . *112·31 . \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *53·31 .*112·1 . \supset \vdash . \Sigma ʻ\iota ʻ\alpha &= sʻ\iota ʻ\in \unicode{x21A7} \alpha \\ [*53·02] &= \in \unicode{x21A7} \alpha . \supset \vdash . \text{Prop} \end{array}$

*112·321. $\vdash . \Sigma \text{Nc}ʻ\iota ʻ\alpha = \text{Nc}ʻ\alpha \quad[*112·32·101 . *85·601]$

*112·33. $\vdash . \Sigma ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = \in \unicode{x21A7} \alpha \cup \in \unicode{x21A7} \beta \quad[*112·32·31]$

*112·331. $\vdash . \Sigma ʻ(\kappa \cup \iota ʻ\beta ) = \Sigma ʻ\kappa \cup \in \unicode{x21A7} \beta \quad[*112·31·32]$

*112·34. $\vdash : \alpha \neq \beta . \supset . \Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash . *51·231 . *112·311 . \supset \\ \vdash : \text{Hp} . \supset . \Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) &= \Sigma \text{Nc}ʻ\iota ʻ\alpha +_{c} \Sigma \text{Nc}ʻ\iota ʻ\beta \\ [*112·321] &= \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta : \supset \vdash . \text{Prop} \end{array}$

This proposition establishes the agreement of the two definitions of addition, namely that in *110 and that in *112. It will be seen that the definition of *112 is inapplicable to the addition of a class to itself, if this is to give the double of the class, instead of (like logical addition) simply reproducing the class. Hence the need of the condition $\alpha\neq \beta$ in the above proposition.

*112·341. $\vdash : \beta {\sim} \in \kappa . \supset . \Sigma \text{Nc}ʻ(\kappa \cup \iota ʻ\beta ) = \Sigma \text{Nc}ʻ\kappa +_{c} \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash . *51·211 . \supset \vdash : \text{Hp} . &\supset . \kappa \cap \iota ʻ\beta = \Lambda .\\ [*112·311] \supset . \Sigma \text{Nc}ʻ(\kappa \cup \iota ʻ\beta ) &= \Sigma \text{Nc}ʻ\kappa +_{c} \Sigma \text{Nc}ʻ\iota ʻ\beta \\ [*112·321] &= \Sigma \text{Nc}ʻ\kappa +_{c} \text{Nc}ʻ\beta : \supset \vdash . \text{Prop} \end{array}$

*112·35. $\vdash : \alpha \neq \beta . \alpha \neq \gamma . \beta \neq \gamma . \supset . \Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta \cup \iota ʻ\gamma ) = \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta +_{c} \text{Nc}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *51·231 . *112·311 . \supset \\ \vdash : \text{Hp} . \supset . \Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta \cup \iota ʻ\gamma ) &= \Sigma \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) +_{c} \Sigma \text{Nc}ʻ\iota ʻ\gamma \\ [*112·34·321] &= \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta +_{c} \text{Nc}ʻ\gamma : \supset \vdash . \text{Prop} \end{array}$

*112·4. $\vdash :sʻ\kappa ,sʻʻ\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Sigma \text{Nc}ʻsʻ\kappa = \Sigma \text{Nc}ʻsʻʻ\kappa$

Dem. $\begin{array}{l} \vdash .*112·15.\supset \vdash :\text{Hp}.\supset .\Sigma \text{Nc}ʻsʻ\kappa &= \text{Nc}ʻsʻsʻ\kappa \\ [*42·1] &= \text{Nc}ʻsʻsʻʻ\kappa \\ [*112·15] &= \Sigma \text{Nc}ʻsʻʻ\kappa :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*112·1.\supset \vdash .sʻ\Sigma ʻʻ\lambda &= sʻsʻʻ\in \unicode{x21A7}ʻʻʻ\lambda \\ [*42·1] &= sʻsʻ\in \unicode{x21A7}ʻʻʻ\lambda \\ [*40·38] &= sʻ\in \unicode{x21A7}ʻʻsʻ\lambda\\ [*112·1] &= \Sigma ʻsʻ\lambda .\supset \vdash .\text{Prop} \end{array}$

*112·42. $\vdash :\lambda \in \text{Cls}^{2} \text{excl}.\supset .\Sigma ʻʻ\lambda \in \text{Cls}^{2} \text{excl}$

Dem. $\begin{array}{l} \vdash .*112·303.\supset \vdash \colon\ldotp \lambda \in \text{Cls}^{2} \text{excl}.&\supset :\beta ,\gamma \in \lambda .\beta \neq \gamma .\supset _[\beta ,\gamma ].\Sigma ʻ\beta \cap \Sigma ʻ\gamma = \Lambda :\\ [*30·37.\text{Transp}.*37·63] &\supset :\mu ,\nu \in \Sigma ʻʻ\lambda .\mu \neq \nu .\supset _{\mu ,\nu }.\mu \cap \nu = \Lambda :\\ [*84·1] &\supset :\Sigma ʻʻ\lambda \in \text{Cls}^{2} \text{excl}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*112·43. $\vdash :\lambda \in \text{Cls}^{2} \text{excl}.\supset .\text{Nc}ʻ\Sigma ʻ\Sigma ʻʻ\lambda = \text{Nc}ʻ\Sigma ʻsʻ\lambda$

Dem. $\begin{array}{l} \vdash .*112·15·42.\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻ\Sigma ʻ\Sigma ʻʻ\lambda &= \text{Nc}ʻsʻ\Sigma ʻʻ\lambda \\ [*112·41] &= \text{Nc}ʻ\Sigma ʻsʻ\lambda :\supset \vdash .\text{Prop} \end{array}$

In this number, we give a definition of multiplication which can be extended to any finite number of factors, but not to an infinite number of factors. We define first the arithmetical class-product of two classes $\alpha$ and $\beta$ , and thence the product of two cardinals $\mu$ and $\nu$ as the number of terms in the product of $\alpha$ and $\beta$ when $\alpha$ has $\mu$ terms and $\beta$ has $\nu$ terms. In *114, we shall give a definition of multiplication which is not restricted to a finite number of factors. The advantages of the definition to be given in this number are, that it does not require the factors to be of the same type, and that it enables us to multiply a class by itself without (as in logical addition and multiplication) simply reproducing the class in question. The disadvantage of the definition in this number is the impossibility of extending it to an infinite number of factors.

The arithmetical class-product of two classes $\alpha$ and $\beta$ , which we denote by $\beta \times \alpha$ [5], is the class of all ordinal couples which take their referent from $\alpha$ and their relatum from $\beta$ , i.e. it is the class of all such relations as $x\downarrow y$ , where $x\in \alpha$ and $y\in\beta$ . For a given $y$ , the class of couples we obtain is $\downarrow yʻʻ\alpha$ , which is similar to $\alpha$ ; and the number of such classes, for varying $y$ , is $\text{Nc}ʻ\beta$ . Thus we have $\text{Nc}ʻ\beta$ classes of $\text{Nc}ʻ\alpha$ couples, and $\beta \times \alpha$ is the logical sum of these classes of couples. The class of such classes as $\downarrow yʻʻ\alpha$ , where $y\in \beta$ , is important again in connection with exponentiation; we have $\downarrow yʻʻ\alpha =\alpha \downarrow_{,,}y$ , whence the class of such classes, when $y$ is varied among the $\beta$ 's, is $\alpha \downarrow_{,,}ʻʻ\beta$ , and $\beta \times \alpha =sʻ\alpha \downarrow_{,,}ʻʻ\beta \quad(\text{cf}. *40·7),$ which we take as the definition of $\beta \times \alpha$ .

We represent the arithmetical product of $\mu$ and $\nu$ by $\mu \times _{c}\nu$ . This, as well as $\text{Nc}ʻ\alpha \times_{c}\text{Nc}ʻ\beta$ , is defined in terms of $\alpha \times \beta$ exactly as, in *110, the sum was defined in terms of $\alpha +\beta$ .

The present number contains many propositions which belong to the theory of $\alpha \downarrow_{,,}ʻʻ\beta$ rather than (specially) of $\beta \times \alpha$ ; and many propositions are rather logical than arithmetical in their nature, i.e. they might have been given in *55. The line is, however, so hard to draw that it has seemed better to deal simultaneously with all propositions on $\alpha \downarrow_{,,}ʻʻ\beta$ or on its sum, which is $\beta\times \alpha$ . Thus in the present number, the early propositions, down to *113·118, deal mainly with logical properties of $\alpha\downarrow_{,,}ʻʻ\beta$ and $\beta \times \alpha$ ; the following propositions, down to *113·13, deal mainly with arithmetical properties of $\alpha \downarrow_{,,}ʻʻ\beta$ ; the propositions *113·14—·191 are concerned mainly with arithmetical properties of $\beta \times\alpha$ ; *113·2—·27 deal with the simpler properties of $\mu \times_{c}\nu$ ; *113·3—·34 give propositions involving the multiplicative axiom, and exhibiting the connection (assuming this axiom) of addition and multiplication; *113·4—·491 are concerned with various forms of the distributive law; *113·5—*113·541 deal with the associative law of multiplication, and the remaining propositions deal with multiplication by 0 or 1 or 2.

*113·101. $\vdash :R\in \beta \times \alpha .\equiv .(\exists x,y).x\in \alpha .y\in \beta .R=x\downarrow y$

*113·105. $\vdash :\exists !\alpha .\supset .\alpha \downarrow_{,,}.\in 1\rightarrow 1$

*113·114. $\vdash \colon\ldotp \alpha =\Lambda .\lor.\beta =\Lambda :\equiv .\beta \times \alpha =\Lambda$

It is in virtue of this proposition that a product of a finite number of factors only vanishes when one of its factors vanishes.

*113·118. $\vdash .sʻ\text{D}ʻʻ(\beta \times \alpha )\subset \alpha .sʻ\text{ᗡ}ʻʻ(\beta \times \alpha )\subset \beta$

This proposition is chiefly useful in the analogous theory of ordinal products (*165, *166), where it enables us to apply *74·773. Unless $\beta =\Lambda$ , we have $sʻ\text{D}ʻʻ(\beta \times \alpha)=\alpha$ , and unless $\alpha =\Lambda ,sʻ\text{ᗡ}ʻʻ(\beta \times \alpha )=\beta$ (*113·116).

*113·12. $\vdash :\exists !\alpha .\supset .\alpha \downarrow_{,,}ʻʻ\beta \in \text{Nc}ʻ\beta \cap \text{Cl excl}ʻ\text{Nc}ʻ\alpha$

I.e. unless $\alpha$ is null, $\alpha\downarrow_{,,}ʻʻ\beta$ consists of $\text{Nc}ʻ\beta$ mutually exclusive classes each having $\text{Nc}ʻ\alpha$ members.

*113·127. $\begin{aligned}\vdash :R\upharpoonright y\in \alpha \,\overline{\text{ sm }}\, \gamma .S\upharpoonright \delta \in \beta &\,\overline{\text{ sm }}\, \delta .\supset .\\ &(R\parallel \breve{S} )\upharpoonright (\delta \times \gamma )\in (\alpha \downarrow_{,,}ʻʻ\beta )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \downarrow_{,,}ʻʻ\delta )\end{aligned}$

This is an important proposition, since it gives a double correlator of $\alpha \downarrow_{,,}ʻʻ\beta$ with $\gamma\downarrow_{,,}ʻʻ\delta$ whenever simple correlators of $\alpha$ with $\gamma$ and of $\beta$ with $\delta$ are given. It leads at once to

*113·13. $\vdash : \alpha \text{ sm } \gamma . \beta \text{ sm } \delta . \supset . \alpha \downarrow_{,,} ʻʻ\beta \text{ sm } \text{ sm } \gamma \downarrow_{,,} ʻʻ\delta . (\beta \times \alpha ) \text{ sm } (\delta \times \gamma )$

This proposition is fundamental in the theory of multiplication, since it shows that the number of members of $\beta \times \alpha$ depends only upon the numbers of members of $\alpha$ and $\beta$ . It is also fundamental in the theory of exponentiation, as will appear in *116.

*113·141. $\vdash . \text{Nc}ʻ(\alpha \times \beta ) = \text{Nc}ʻ(\beta \times \alpha )$

*113·146. $\vdash : \alpha \neq \beta . \supset . \alpha \times \beta \text{ sm } {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )$

This connects our present theory of multiplication with the theory of selections.

*113·204. $\vdash \colon\ldotp \mu = \Lambda . \lor . \nu = \Lambda . \lor . {\sim} (\mu , \nu \in \text{NC}) : \supset . \mu \times _{c} \nu = \Lambda$

The use of this proposition, like that of *110·4, is for avoiding trivial exceptions.

*113·25. $\vdash . \text{Nc}ʻ\gamma \times _{c} \text{Nc}ʻ\delta = \text{Nc}ʻ(\gamma \times \delta )$

This proposition enables us to infer propositions on products of cardinals from propositions on products of classes, and is therefore constantly used.

*113·31. $\vdash \colon\ldotp \text{Mult ax} . \supset : \mu , \nu \in \text{NC} . \kappa \in \nu \cap \text{Cl}ʻ\mu . \supset . \Sigma ʻ\kappa \in \mu \times _{c} \nu$

I.e. assuming the multiplicative axiom, the sum of the numbers of members in $\nu$ classes of $\mu$ terms is $\mu \times _{c}\nu$ . If we had taken this sum as defining $\mu \times _{c}\nu$ , almost all propositions on multiplication would have required the multiplicative axiom. The advantage of $\alpha \downarrow_{,,}ʻʻ\beta$ is that, given $\alpha \text{ sm } \gamma$ and $\beta\text{ sm } \delta$ , we can construct a double correlator of $\alpha\downarrow_{,,} ʻʻ\beta$ with $\gamma \downarrow_{,,} ʻʻ\delta$ , without using the multiplicative axiom. This is proved in *113·127 (mentioned above).

The distributive law, which is next considered, has various forms. We have, to begin with,

*113·4. $\vdash . (\beta \cup \gamma ) \times \alpha = (\beta \times \alpha ) \cup (\gamma \times \alpha )$

*113·43. $\vdash . (\nu +_{c} \varpi ) \times _{c} \mu = \mu \times _{c} (\nu +_{c} \varpi ) = (\mu \times _{c} \nu ) +_{c} (\mu \times _{c} \varpi )$

But the distributive law also holds when, instead of enumerated summands $\beta$ , $\gamma$ or $\nu$ , $\varpi$ , the summands are given as the members of a class $\kappa$ , which may be infinite. We have

*113·48. $\vdash . sʻ\alpha \times ʻʻ\kappa = \alpha \times sʻ\kappa = \text{Cnv}ʻʻ(sʻ\kappa \times \alpha )$

*113·491. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \Sigma \text{Nc}ʻ\alpha \times ʻʻ\kappa = \text{Nc}ʻ(\alpha \times \Sigma ʻ\kappa ) = \text{Nc}ʻ\alpha \times _{c} \Sigma \text{Nc}ʻ\kappa$

This is an extension of the distributive law to the case where the number of summands may be infinite.

*113·54. $\vdash . (\mu \times _{c} \nu ) x_{c} \varpi = \mu \times _{c} (\nu \times _{c} \varpi )$

We prove next that $\mu \times _{c} \nu = 0$ when, and only when, $\mu = 0$ or $\nu = 0$ , $\mu$ , $\nu$ being existent cardinals (*113·602); that a cardinal is unchanged when it is multiplied by 1 (*113·62 ·621); that $\mu \times _{c} 2 = \mu +_{c} \mu$ (*113·66) and that $\mu \times _{c} (\nu + 1) = (\mu \times _{c} \nu ) +_{c} \mu$ (*113·671).

*113·02. $\beta \times \alpha = sʻ\alpha \downarrow_{,,} ʻʻ\beta \quad\text{Df}$

*113·03. $\mu \times _{c} \nu = \hat{\xi} \{(\exists \alpha , \beta ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \nu \text{N}_{0}\text{c}ʻ\beta . \xi \text{ sm } (\alpha \times \beta )\} \quad\text{Df}$

*113·04. $\text{Nc}ʻ\beta \times _{c} \mu = \text{N}_{0}\text{c}ʻ\beta \times _{c} \mu \quad\text{Df}$

*113·05. $\mu \times _{c} \text{Nc}ʻ\alpha = \mu \times _{c} \text{N}_{0}\text{c}ʻ\alpha \quad\text{Df}$

In relation to types, *113·03 ·04 ·05 call for similar remarks to those made in *110 for addition.

*113·1. $\vdash . \beta \times \alpha = sʻ\alpha \downarrow_{,,} ʻʻ\beta \quad[(*113·02)]$

*113·101. $\vdash : R \in \beta \times \alpha . \equiv . (\exists x, y) . x \in \alpha . y \in \beta . R = x\downarrow y \quad[*40·7 . *113·1]$

*113·102. $\vdash : y \in \beta . \supset . \alpha \downarrow_{,,} y = (\alpha \uparrow \beta )_{\Delta }ʻ\iota ʻy$

Dem. $\begin{array}{l} \vdash . *35·103 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : x (\alpha \uparrow \beta ) y . \equiv . x \in \alpha :\\ [*85·51] \supset : (\alpha \uparrow \beta )_{\Delta }ʻ\iota ʻy = \downarrow yʻʻ\alpha \\ [(*38·03)] = \alpha \downarrow_{,,} y : \supset \vdash . \text{Prop} \end{array}$

*113·103. $\vdash . \alpha \downarrow_{,,} ʻʻ\beta = (\alpha \uparrow \beta )_{\Delta }ʻʻ\iotaʻʻ\beta = (\alpha \uparrow \beta ) \unicode{x21A7} ʻʻ\beta \quad[*113·102 . *85·52]$

*113·105. $\vdash : \exists ! \alpha . \supset . \alpha \downarrow_{,,} \in 1 \rightarrow 1$

Dem. $\begin{array}{l} \vdash . *113·104. *71·166 . &\supset \vdash . \alpha \downarrow_{,,} \in 1 \rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *38·131. \supset \vdash : \alpha \downarrow_{,,} ʻy = \alpha \downarrow_{,,} ʻz . x \in \alpha . &\supset . x \downarrow y \in \alpha \downarrow_{,,} ʻz .\\ [*38·131] &\supset . (\exists xʻ) . xʻ \in \alpha . x \downarrow y = xʻ \downarrow z.\\ [*55·202] &\supset . y = z &\qquad \text{(2)}\\ \vdash .(2). *10·11·23·35. &\supset \vdash : \exists ! \alpha .\alpha \downarrow_{,,} ʻy = \alpha \downarrow_{,,} ʻz . \supset . y = z &\qquad \text{(3)}\\ \vdash .(1).(3). *71·54. \supset \vdash . \text{Prop} \end{array}$

*113·106. $\vdash : x \in \alpha . y \in \beta . \supset . x \downarrow y \in \beta \times \alpha \quad[*113·101]$

*113·107. $\vdash : \exists ! \alpha . \exists ! \beta . \supset . \exists ! \beta \times \alpha \quad [*113·106]$

*113·11. $\vdash : \exists ! \alpha . \supset . \alpha \downarrow_{,,}ʻʻ\beta \in \text{Nc}ʻ\beta : (y) . \alpha \downarrow_{,,} y \in \text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *113·105·104 . *73·26 . &\supset \vdash : \exists ! \alpha . \supset . \alpha \downarrow_{,,} ʻʻ\beta \text{ sm } \beta &\qquad \text{(1)}\\ \vdash . *38·2. *73·611. & \supset \vdash . \alpha \downarrow_{,,} y \text{ sm } \alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash . \text{Prop} \end{array}$

*113·111. $\vdash . \alpha \downarrow_{,,} ʻʻ\beta \in \text{Cls}^{2} \text{excl} \quad[*113·103 . *85·55]$

*113·112. $\vdash : \alpha = \Lambda . \exists ! \beta . \supset . \alpha \downarrow_{,,} ʻʻ\beta = \iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash . *38·3 . \supset \vdash : \text{Hp} . \supset . \alpha \downarrow_{,,} ʻʻ\beta &= \hat{\mu} \{ (\exists y).y \in \beta . \mu = \downarrow yʻʻ\Lambda \}\\ [*37·29] &= \hat{\mu} \{ (\exists y).y \in \beta . \mu = \Lambda\}\\ [\text{Hp}] & = \iota ʻ\Lambda \end{array}$

*113·113. $\vdash : \beta = \Lambda . \supset . \alpha \downarrow_{,,} ʻʻ\beta = \Lambda \quad[*37·29]$

*113·114. $\vdash \colon\ldotp \alpha = \Lambda .\lor.\beta = \Lambda : \equiv .\beta \times \alpha = \Lambda \quad[*113·1·112·113·107.*53·24]$

Dem. $\begin{array}{l} \vdash . *113·101.*41·11. \supset \\ \vdash : u \{ \dot{s} ʻ(\beta \times \alpha )\} v. &\equiv . (\exists R, x, y) . x \in \alpha . y \in \beta . R = x \downarrow y . uRv .\\ [*13·195.*55·13] &\equiv . (\exists x, y) . x \in \alpha . y \in \beta . u = x . v = y .\\ [*13·22] &\equiv . u \in \alpha . v \in \beta .\\ [*35·103] &\equiv . u (\alpha \uparrow \beta ) v : \supset \vdash . \text{Prop} \end{array}$

*113·116. $\begin{aligned}&\vdash : \exists ! \beta . \supset . sʻ\text{D}ʻʻ(\beta \times \alpha ) = \alpha : \exists ! \alpha . \supset . sʻ\text{ᗡ}ʻʻ(\beta \times \alpha ) = \beta \\ &[*113·115 . *41·43·44. *35·85·86]\end{aligned}$

*113·117. $\begin{aligned}&\vdash \colon\ldotp \alpha = \Lambda . \lor . \beta = \Lambda : \supset . sʻ\text{D}ʻʻ(\beta \times \alpha ) = \Lambda . sʻ\text{ᗡ}ʻʻ(\beta \times \alpha ) = \Lambda\\ &[*113·115 . *41·43·44. *35·88]\end{aligned}$

*113·118. $\vdash . sʻ\text{D}ʻʻ(\beta \times \alpha ) \subset \alpha . sʻ\text{ᗡ}ʻʻ(\beta \times \alpha ) \subset \beta \quad[*113·116·117]$

*113·12. $\vdash : \exists ! \alpha . \supset . \alpha \downarrow_{,,} ʻʻ\beta \in \text{Nc}ʻ\beta \cap \text{Cl excl}ʻ\text{Nc}ʻ\alpha \quad[*113·11·111]$

*113·121. $\vdash . \Sigma ʻ\alpha \downarrow_{,,} ʻʻ\beta \text{ sm } \beta \times \alpha \quad[*112·15 . *113·111·1]$

*113·122. $\begin{aligned}&\vdash : R \upharpoonright \gamma , S \upharpoonright \delta \in \text{Cls} \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \delta \subset \text{ᗡ}ʻS . \supset . (R \parallel \breve{S} ) \upharpoonright (\delta \times \gamma ) \in 1 \rightarrow 1\\ &[*74·773. *113·118]\end{aligned}$

*113·123. $\begin{aligned}\vdash : R \upharpoonright \gamma , S \upharpoonright \delta \in 1 \rightarrow \text{Cls}. \gamma &\subset \text{ᗡ}ʻR . \delta \subset \text{ᗡ}ʻS . z \in \gamma . w \in \delta . \supset .\\ &(R \parallel \breve{S} )ʻ(z \downarrow w) = (Rʻz) \downarrow (Sʻw) \quad[*55·61]\end{aligned}$

*113·124. $\begin{aligned}\vdash : R \upharpoonright \gamma , S \upharpoonright \delta \in 1 \rightarrow \text{Cls}. \gamma &\subset \text{ᗡ}ʻR . \delta \subset \text{ᗡ}ʻS . w \in \delta . \supset .\\ &(R \parallel \breve{S} )ʻʻ\gamma \downarrow_{,,} w = (Rʻʻ\gamma ) \downarrow_{,,} (Sʻw)\end{aligned}$

Dem. $\begin{array}{l} \vdash . *113·123 . *38·131 . \supset \vdash : \text{Hp} . &\supset . (R \parallel \breve{S} )ʻʻ \downarrow wʻʻ\gamma = \downarrow (Sʻw)ʻʻRʻʻ\gamma .\\ [*38·2] &\supset . (R \parallel \breve{S} )ʻʻ\gamma \downarrow_{,,} w = (Rʻʻ\gamma ) \downarrow_{,,} (Sʻw) : \supset \vdash . \text{Prop} \end{array}$

*113·125. $\begin{aligned}\vdash : R \upharpoonright \gamma , S \upharpoonright \delta \in 1 \rightarrow &\text{Cls}. \gamma \subset \text{ᗡ}ʻR . \delta \subset \text{ᗡ}ʻS . \supset .\\ &(R \parallel \breve{S} )_{\in }ʻʻ\gamma \downarrow_{,,} ʻʻ\delta = (Rʻʻ\gamma ) \downarrow_{,,} ʻʻ(Sʻʻ\delta ) \quad[*113·124]\end{aligned}$

*113·126. $\vdash : \text{Hp} *113·125 . \supset . (R \parallel \breve{S} )ʻʻ(\delta \times \gamma ) = (Sʻʻ\delta ) \times (Rʻʻ\gamma )$

Dem. $\begin{array}{l} \vdash . *113·1 . *40·38 . &\supset \vdash . (R \parallel \breve{S} )ʻʻ(\delta \times \gamma ) = sʻ(R \parallel \breve{S} )ʻʻʻ\gamma \downarrow_{,,} ʻʻ\delta &\qquad \text{(1)}\\ \vdash . (1) . *113·125 . \supset \vdash : \text{Hp} . \supset . (R \parallel \breve{S} )ʻʻ(\delta \times \gamma ) &= sʻ(Rʻʻ\gamma ) \downarrow_{,,} ʻʻ(Sʻʻ\delta )\\ [*113·1] &= (Sʻʻ\delta ) \times (Rʻʻ\gamma ) : \supset \vdash . \text{Prop} \end{array}$

*113·127. $\begin{aligned}\vdash : R \upharpoonright \gamma \in \alpha &\,\overline{\text{ sm }}\, \gamma . S \upharpoonright \delta \in \beta \,\overline{\text{ sm }}\, \delta . \supset .\\ &(R \parallel \breve{S} ) \upharpoonright (\delta \times \gamma ) \in (\alpha \downarrow_{,,} ʻʻ\beta ) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \downarrow_{,,} ʻʻ\delta )\\ &[*113·122·125 . *43·302 . *73·142 . *111·14]\end{aligned}$

*113·128. $\begin{aligned}\vdash : \text{Hp} &*113·127 . \supset . (R \parallel \breve{S} ) \upharpoonright (\delta \times \gamma ) \in (\beta \times \alpha ) \,\overline{\text{ sm }}\, (\delta \times \gamma ).\\ &(R \parallel \breve{S} )_{\in } \upharpoonright (\gamma \downarrow_{,,} ʻʻ\delta ) \in (\alpha \downarrow_{,,} ʻʻ\beta ) \,\overline{\text{ sm }}\, (\gamma \downarrow_{,,} ʻʻ\delta ) \quad[*113·127 . *111·15]\end{aligned}$

*113·13. $\begin{aligned}&\vdash : \alpha \text{ sm } \gamma . \beta \text{ sm } \delta . \supset . \alpha \downarrow_{,,} ʻʻ\beta \text{ sm } \text{ sm } \gamma \downarrow_{,,} ʻʻ\delta . (\beta \times \alpha ) \text{ sm } (\delta \times \gamma )\\ &[*113·127 . *111·4·44 . *113·1]\end{aligned}$

*113·14. $\vdash . \alpha \times \beta = \text{Cnv}ʻʻ(\beta \times \alpha ) \quad[*113·101 . *55·14]$

*113·141. $\vdash . \text{Nc}ʻ(\alpha \times \beta ) = \text{Nc}ʻ(\beta \times \alpha ) \quad[*113·14 . *73·4]$

*113·142. $\vdash : \exists ! \beta . \supset . \text{D}ʻʻ(\beta \times \alpha ) = \iotaʻʻ\alpha : \exists ! \alpha . \supset . \text{ᗡ}ʻʻ(\beta \times \alpha ) = \iotaʻʻ\beta$

Dem. $\begin{array}{l} \vdash . *55·261 . *2·02 . &\supset \vdash : y \in \beta .\supset . \text{D}ʻʻ\alpha \downarrow_{,,} y = \iotaʻʻ\alpha \\ [*37·63] &\supset \vdash : \gamma \in \text{D}ʻʻʻ \alpha \downarrow_{,,} ʻʻ\beta . \supset . \gamma = \iotaʻʻ\alpha &\qquad \text{(1)}\\ \vdash . *37·45. \supset \vdash :\exists !\beta .&\supset .\exists !\text{D}ʻʻʻ\alpha \downarrow_{,,}ʻʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).*51·141. \supset \vdash :\exists !\beta .&\supset .\text{D}ʻʻʻ\alpha \downarrow_{,,}ʻʻ\beta = \iota ʻ\iotaʻʻ\alpha .\\ [*40·38.*53·02] &\supset .\text{D}ʻʻsʻ\alpha \downarrow_{,,}ʻʻ\beta = \iotaʻʻ\alpha &\qquad \text{(3)}\\ \vdash . *55·251. \supset \vdash :\exists !\alpha .&\supset .\text{ᗡ}ʻʻ\alpha \downarrow_{,,}y = \iota ʻ\iota ʻy.\\ [*37·355] &\supset .\text{ᗡ}ʻʻʻ\alpha \downarrow_{,,}ʻʻ\beta = \iotaʻʻ\iotaʻʻ\beta .\\ [*40·38.*53·22] &\supset .\text{ᗡ}ʻʻsʻ\alpha \downarrow_{,,}ʻʻ\beta = \iotaʻʻ\beta &\qquad \text{(4)}\\ \vdash .(3).(4).*113·1. \supset \vdash .\text{Prop} \end{array}$

*113·143. $\begin{aligned}\vdash :\alpha \neq \beta .P = x\downarrow y.&R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta .\supset .\\ &P = (Rʻ\alpha )\downarrow (Rʻ\beta ).R = \text{D}ʻP\uparrow \iota ʻ\alpha \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻ\beta\end{aligned}$

Dem. $\begin{array}{l} \vdash .*55·62.\supset \vdash :\text{Hp}.&\supset .Rʻ\alpha = x.Rʻ\beta = y .\\ [*30·19.*13·15] &\supset .P = (Rʻ\alpha )\downarrow (Rʻ\beta ) &\qquad \text{(1)}\\ \vdash .*55·15.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻP = \iota ʻx.\text{ᗡ}ʻP = \iota ʻy.\\ [*55·1] &\supset .R = \text{D}ʻP\uparrow \iota ʻ\alpha \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·144. $\begin{aligned}\vdash :\alpha &\neq \beta .T = \hat{P} \hat{R} \{(\exists x,y).x\in \alpha .y\in \beta .P = x\downarrow y.R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta\}.\\ &\supset .T\in 1\rightarrow 1.\text{D}ʻT = \beta \times \alpha .\text{ᗡ}ʻT = {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\end{aligned}$

Dem. $\begin{array}{l} \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &PTR.QTR.\supset .(\exists x,y,z,w).x,z\in \alpha .y,w\in \beta .P = x\downarrow y.Q = z\downarrow w.\\ &R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta = z\downarrow \alpha \unicode{x228d} w\downarrow \beta .\\ [*113·143]&\supset .P = (Rʻ\alpha )\downarrow (Rʻ\beta ).Q = (Rʻ\alpha )\downarrow (Rʻ\beta ).\\ [*13·172] &\supset .P = Q &\qquad \text{(1)}\\ \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :PTQ.PTR.\supset .\\ &(\exists x,y,z,w).x,z\in \alpha .y,w\in \beta .P = x\downarrow y = w\downarrow z.Q = x\downarrow \alpha \unicode{x228d} y\downarrow \beta .R=z\downarrow \alpha \unicode{x228d} w\downarrow \beta .\\ [*113·143]&\supset .Q = DʻP\uparrow \iota ʻ\alpha \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻ\beta .R = \text{D}ʻP\uparrow \iota ʻ\alpha \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻ\beta .\\ [*13·172] &\supset .Q = R &\qquad \text{(2)}\\ \vdash .*33·13. &\supset \vdash :\text{Hp}.\supset .\\ &\text{D}ʻT = \hat{P} \{(\exists R,x,y).x\in \alpha .y\in \beta .P = x\downarrow y.R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta\}\\ [*11·55.*13·19] &= \hat{P} \{(\exists x,y).x\in \alpha .y\in \beta .P = x\downarrow y\}\\ [*113·101] &= \beta \times \alpha &\qquad \text{(3)}\\ \vdash .*33·131.\supset \vdash :\text{Hp}.\supset .\\ \text{ᗡ}ʻT &= \hat{R} \{(\exists P,x,y).x\in \alpha .y\in \beta .P = x\downarrow y.R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta\}\\ [*11·55.*13·19] &= \hat{R} \{(\exists x,y).x\in \alpha .y\in \beta .R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta \}\\ [*80·9] &= {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

Note to *113·144. In virtue of *113·143 and *55·61 we have $\vdash \colon\ldotp \text{Hp} *113·144.\supset :PTR. \equiv .R\in {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ).P = (R\parallel \breve{R} )ʻ(\alpha \downarrow \beta ).$

At a later stage (in *150) we shall put $R\dagger S = (R\parallel \breve{R} )ʻS \quad\text{Df}.$

Thus we shall have, anticipating this notation, $\vdash : \text{Hp} *113·144.\supset .T = \{\dagger(\alpha \downarrow \beta )\}\upharpoonright {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ).$

Hence we have $\vdash :\alpha \neq \beta .\supset .\{\dagger(\alpha \downarrow \beta )\}\upharpoonright {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\in (\beta \times \alpha )\,\overline{\text{ sm }}\, {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ).$

*113·145. $\vdash :\alpha \neq \beta .\supset .\beta \times \alpha \text{ sm }{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) \quad[*113·144]$

*113·146. $\vdash :\alpha \neq \beta .\supset .\alpha \times \beta \text{ sm } {\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) \quad[*113·141·145]$

*113·147. $\begin{aligned}\vdash :\text{Hp}*133·144.&\beta \times \alpha = \mu .\supset .\\ &T = \hat{P} \hat{R} \{P\in \mu .R = \text{D}ʻP\uparrow \iota ʻsʻ\text{D}ʻʻ\mu \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻsʻ\text{ᗡ}ʻʻ\mu \}\end{aligned}$

Dem. $\begin{array}{l} \vdash .*113·114.\text{Transp}.\supset \vdash :\text{Hp}.P\in \mu .&\supset .\exists !\alpha .\exists !\beta .\\ [*113·142.*53·22]&\supset .\alpha = sʻ\text{D}ʻʻ\mu .\beta = sʻ\text{ᗡ}ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*133·101·143.&\supset \vdash \colon\ldotp \text{Hp}.P\in \mu .\supset :PTR. \equiv .R = \text{D}ʻP\uparrow \iota ʻ\alpha \unicode{x228d} \text{ᗡ}ʻP\uparrow \iota ʻ\beta &\qquad \text{(2)}\\ \vdash .*113·144.&\supset \vdash :\text{Hp}.PTR.\supset .P\in \mu &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*113·101.\supset \vdash .\text{Prop} \end{array}$

The advantage of this proposition is that it exhibits the correlator of $\beta \times \alpha$ and $({\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iotaʻ\beta)$ as a function of $\beta \times \alpha$ .

*113·148. $\vdash :\alpha \cap \beta = \Lambda .\supset .C\upharpoonright (\alpha \times \beta )\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*113·101.*55·15.\supset \\ &\vdash \colon\ldotp \text{Hp}.\supset :R,S\in \alpha \times \beta .CʻR = CʻS.\equiv .\\ &(\exists x,x',y,y').x,x'\in \alpha .y,y'\in \beta .R = y\downarrow x,S = y'\downarrow x'.\iota ʻx\cup \iota ʻy = \iota ʻx'\cup \iota ʻy'.\\ [*54·6] &\supset .(\exists x,x',y,y').x,x'\in \alpha .y,y'\in \beta .R = y\downarrow x.S = y'\downarrow x'.x = x'.y = y'.\\ [*13·22·172] &\supset .R = S &\qquad \text{(1)}\\ \vdash .(1).*71·55.\supset \vdash .\text{Prop} \end{array}$

*113·15. $\vdash .Cʻʻ(\alpha \times \beta ) = Cʻʻ(\beta \times a) = \hat{\xi} \{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\}$

Dem. $\begin{array}{l} \vdash .*113·1.*40·38.\supset \vdash .Cʻʻ(\beta \times \alpha ) &= sʻCʻʻʻ\alpha \downarrow_{,,}ʻʻ\beta \\ [*40·4] &= \hat{\xi} \{(\exists y).y\in \beta .\xi \in Cʻʻ\alpha \downarrow_{,,}y\}\\ [*55·27.*38·2] &= \hat{\xi} \{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\} &\qquad \text{(1)}\\ \vdash .(1)\frac{\beta,\,\alpha}{\alpha,\,\beta}. \supset \vdash .Cʻʻ(\alpha \times \beta ) &= \hat{\xi} \{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·151. $\vdash :\alpha \neq \beta .\supset .Cʻʻ(\alpha \times \beta ) = \text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) \quad[*113·15.*80·92]$

*113·152. $\vdash :\alpha \cap \beta = \Lambda .\supset .Cʻʻ(\alpha \times \beta )\text{ sm }(\alpha \times \beta ).\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\text{ sm }(\alpha \times \beta )$

Dem. $\begin{array}{l} \vdash .*84·41·62.&\supset \vdash :\text{Hp}.\alpha \neq \beta .\supset .\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\text{ sm }{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) &\qquad \text{(1)}\\ \vdash .(1).*113·146·151.\supset \\ \vdash :\text{Hp}.\alpha \neq \beta .&\supset .Cʻʻ(\alpha \times \beta )\text{ sm }(\alpha \times \beta ).\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\text{ sm }\alpha \times \beta &\qquad \text{(2)}\\ \vdash .*24·38.\supset \vdash :\text{Hp}.\alpha = \beta .&\supset .\alpha = \Lambda .\beta = \Lambda .\\ [*113·114.*83·11.*37·29] &\supset .\alpha \times \beta = \Lambda .\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = \Lambda .Cʻʻ(\alpha \times \beta )=\Lambda .\\ [*73·47] &\supset .Cʻʻ(\alpha \times \beta )\text{ sm }(\alpha \times \beta ).\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta )\text{ sm }(\alpha \times \beta ) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following proposition is only significant when $\lambda$ and $\mu$ are classes of relations. It is used in relation-arithmetic (*172·34).

*113·153. $\vdash :\dot{s} ʻ\lambda \dot{\cap} \dot{s} ʻ\mu = \dot{\Lambda} .\supset .\dot{s} \mid C\upharpoonright (\lambda \times \mu )\in (sʻ\lambda \unicode{x228d}_{,,}ʻʻ\mu )\,\overline{\text{ sm }}\, (\lambda \times \mu ).sʻ\lambda \unicode{x228d}_{,,}ʻʻ\mu \text{ sm }\lambda \times \mu$

Dem. $\begin{array}{l} \vdash .*55·15.*53·13.&\supset \vdash :R = T\downarrow S.\supset .\dot{s} ʻCʻR = S\unicode{x228d} T &\qquad \text{(1)}\\ \vdash .(1).*113·101.\supset \\ &\vdash :R,R'\in \lambda \times \mu .\dot{s} ʻCʻR = \dot{s} ʻCʻR'.\supset.\\ &(\exists S,S',T,T').S,S'\in \lambda .T,T'\in \mu .R = T\downarrow S.R'=T'\downarrow S'.S\unicode{x228d} T=S'\unicode{x228d} T' &\qquad \text{(2)}\\ \vdash .(2).*25·48.*41·13.\supset \\ &\vdash \colon\ldotp \text{Hp}.\supset :R,R'\in \lambda \times \mu .\dot{s} ʻCʻR = \dot{s} ʻCʻR'.\supset .R = R' &\qquad \text{(3)}\\ \vdash .(1).*113·101.&\supset \vdash .\dot{s} ʻʻCʻʻ(\lambda \times \mu ) = \hat{M} \{(\exists S,T).S\in \lambda .T\in \mu .M = S\unicode{x228d} T\}\\ [*40·7] & =sʻ\lambda \unicode{x228d}_{,,}ʻʻ\mu &\qquad \text{(4)}\\ \vdash .(3).(4).*73·25.\supset \vdash .\text{Prop} \end{array}$

*113·16. $\begin{aligned}\vdash :&tʻ\alpha = tʻ\beta .\supset .\text{Nc}ʻ(\alpha \times \beta ) =\\ &\hat{\xi} \{(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda .\xi \text{ sm }\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta )\}\end{aligned}$

Dem. $\begin{array}{l} \vdash .*113·152.\supset \vdash \colon\ldotp \gamma \in \text{N}^{1}\text{c}ʻ\alpha .&\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda .\supset :\\ \xi \text{ sm }\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta ). &\equiv .\xi \text{ sm }(\gamma \times \delta ).\\ [*113·13.*104·101] &\equiv .\xi \text{ sm }(\alpha \times \beta ).\\ [*100·31] &\equiv .\xi \in \text{Nc}ʻ(\alpha \times \beta ) &\qquad \text{(1)}\\ \vdash .(1).*5·32.*11·11·341.\supset \\ \vdash \colon\ldotp (\exists \gamma ,\delta ).\gamma \in &\text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda .\xi \text{ sm }\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta ). \equiv :\\ &(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda .\xi \in \text{Nc}ʻ(\alpha \times \beta ):\\ [*11·45] &\equiv :(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda :\xi \in \text{Nc}ʻ(\alpha \times \beta ) &\qquad \text{(2)}\\ \vdash .(2). *104·43.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *113·115.*41·13.\supset \vdash :R\in \beta \times \alpha .&\supset .R\,\unicode{x2abd}\, \alpha \uparrow \beta .\\ [*64·201] &\supset .R\in tʻ(\alpha \uparrow \beta ) &\qquad \text{(1)}\\ \vdash .(1).*63·5.\supset \vdash .\text{Prop} \end{array}$

*113·171. $\vdash :\alpha \cap \beta = \Lambda .\supset .\exists !\text{Nc}(tʻ\alpha )ʻ(\alpha \times \beta )$

Dem. $\begin{array}{l} \vdash .*113·152·15.&\supset \vdash :\text{Hp}.\supset .\hat{\xi}\{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\}\in \text{Nc}ʻ(\alpha \times \beta ) &\qquad \text{(1)}\\ \vdash .*51·16. & \supset \vdash :x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy.\supset .x\in \alpha .x\in \xi .\\ [*63·13] &\supset .\xi \in tʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*11·11·35.\supset \\ &\vdash .\hat{\xi}\{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\}\subset tʻ\alpha .\\ [*63·5] &\supset \vdash .\hat{\xi} \{(\exists x,y).x\in \alpha .y\in \beta .\xi = \iota ʻx\cup \iota ʻy\}\in tʻtʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash :\text{Hp}.\supset .\exists !\text{Nc}ʻ(\alpha \times \beta )\cap tʻtʻ\alpha &\qquad \text{(4)}\\ \vdash .(4).*102·6.\supset \vdash .\text{Prop} \end{array}$

Note that the hypothesis $\alpha \cap \beta = \Lambda$ is only significant when $\alpha$ and $\beta$ are of the same type.

*113·172. $\vdash :\alpha \in tʻ\beta .\supset .\exists !\text{Nc}(t^{2}ʻ\alpha )ʻ(\alpha \times \beta )$

Dem. $\begin{array}{l} \vdash .*113·16. \supset \vdash \colon\ldotp \text{Hp}.\supset :\gamma \in \text{N}^{1}\text{c}ʻ\alpha .&\delta \in \text{N}^{1}\text{c}ʻ\beta .\gamma \cap \delta = \Lambda .\supset .\\ &\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta )\in \text{Nc}ʻ(\alpha \times \beta ) &\qquad \text{(1)}\\ \vdash .(1).*104·43.&\supset \vdash :\text{Hp}.\supset .\\ &(\exists \gamma ,\delta ).\gamma \in \text{N}^{1}\text{c}ʻ\alpha .\delta \in \text{N}^{1}\text{c}ʻ\beta .\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta )\in \text{Nc}ʻ(\alpha \times \beta ) &\qquad \text{(2)}\\ \vdash .*104·1.\supset \vdash :\gamma \in \text{N}^{1}\text{c}ʻ\alpha .&\supset .\gamma \in t^{2}ʻ\alpha .\\ [*63·61·621] &\supset .\iota ʻ\gamma \cup \iota ʻ\delta \in tʻt^{2}ʻ\alpha .\\ [*83·81] &\supset .\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\gamma \cup \iota ʻ\delta )\in tʻt^{2}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash :\text{Hp}.\supset .\exists !\text{Nc}ʻ(\alpha \times \beta )\cap tʻt^{2}ʻ\alpha &\qquad \text{(4)}\\ \vdash .(4).*102·6.\supset \vdash .\text{Prop} \end{array}$

*113·18. $\vdash :\exists !\alpha .\exists !\beta .\alpha \times \beta = \alpha' \times \beta'.\supset .\alpha = \alpha'.\beta = \beta'$

Dem. $\begin{array}{l} \vdash .*113·114.\supset \vdash :\text{Hp}.&\supset .\exists !\alpha' \times \beta'.\\ [*113·114] &\supset .\exists !\alpha'.\exists !\beta' &\qquad \text{(1)}\\ \vdash .*30·37. \supset \vdash :\text{Hp}.&\supset .sʻ\text{ᗡ}ʻʻ(\alpha \times \beta ) = sʻ\text{ᗡ}ʻʻ(\alpha' \times \beta').\\ [*113·142.(1)] & \supset .sʻtʻʻ\alpha = sʻ\iota ʻʻ\alpha'.\\ [*53·22] &\supset .\alpha = \alpha' &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\beta = \beta' &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*113·181. $\vdash :\exists !\alpha .\exists !\alpha'.\alpha \times \beta = \alpha' \times \beta'.\supset .\beta = \beta'$

Dem. $\begin{array}{l} \vdash . *13·172.&\supset \vdash :\beta = \Lambda .\beta' = \Lambda .\supset .\beta = \beta' &\qquad \text{(1)}\\ \vdash . *113·18.&\supset \vdash :\text{Hp}.{\sim}(\beta = \Lambda .\beta' = \Lambda ).\supset .\beta = \beta' &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*113·182. $\begin{aligned}\vdash :&\exists !\beta .\exists !\beta'.\alpha \times \beta = \alpha' \times \beta'.\supset .\alpha = \alpha'\\ &[\text{Proof as in *113·181}]\end{aligned}$

*113·183. $\vdash :\exists !\alpha .\exists !\beta .\supset .Fʻʻ(\alpha \times \beta ) = sʻCʻʻ(\alpha \times \beta ) = \alpha \cup \beta$

Dem. $\begin{array}{l} \vdash .*40·57. \supset \vdash .sʻCʻʻ(\alpha \times \beta ) = sʻ\text{D}ʻʻ(\alpha \times \beta )\cup sʻ\text{ᗡ}ʻʻ(\alpha \times \beta ) &\qquad \text{(1)}\\ \vdash .*40·56. \supset \vdash .Fʻʻ(\alpha \times \beta ) = sʻCʻʻ(\alpha \times \beta ) &\qquad \text{(2)}\\ \vdash . *113·142. \supset \vdash :\text{Hp}.\supset .sʻ\text{ᗡ}ʻʻ(\alpha \times \beta ) = sʻ\iotaʻʻ\alpha\\ [*53·22] = \alpha &\qquad \text{(3)}\\ \vdash . *113·142. \supset \vdash :\text{Hp}.\supset .sʻ\text{D}ʻʻ(\alpha \times \beta ) = sʻ\iotaʻʻ\beta \\ [*53·22] = \beta &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash :\text{Hp}.\supset .sʻ\text{D}ʻʻ(\alpha \times \beta )\cup sʻ\text{ᗡ}ʻʻ(\alpha \times \beta ) = \alpha \cup \beta &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

*113·19. $\vdash :\exists !(\alpha \times \beta )\cap (\gamma \times \delta ). \equiv .\exists !\alpha \cap \gamma .\exists !\beta \cap \delta$

Dem. $\begin{array}{l} \vdash . *113·101.&\supset \vdash \colon\ldotp \exists !(\alpha \times \beta )\cap (\gamma \times \delta ). \equiv :\\ &(\exists x,y,z,w).x\in \alpha .y\in \beta .z\in \gamma .w\in \delta .x\downarrow y = w\downarrow z:\\ [*55·202]&\equiv :(\exists x,y,z,w).x\in \alpha .y\in \beta .z\in \gamma .w\in \delta .x = z.y = w:\\ [*13·22] &\equiv :(\exists x,y).x\in \alpha \cap \gamma .y\in \beta \cap \delta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*113·191. $\vdash \colon\ldotp \exists !\alpha .\supset :\exists !\alpha \downarrow_{,,}ʻʻ\beta \cap \alpha \downarrow_{,,}ʻʻ\gamma . \equiv .\exists !\beta \cap \gamma$

Dem. $\begin{array}{l} \vdash . *37·6.&\supset \vdash :\exists !\alpha \downarrow_{,,}ʻʻ\beta \cap \alpha \downarrow_{,,}ʻʻ\gamma . \equiv .(\exists y,z).y\in \beta .z\in \gamma .a\downarrow_{,,}y = \alpha \downarrow_{,,}z &\qquad \text{(1)}\\ \vdash . *113·105.*71·57.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \downarrow_{,,}y = \alpha \downarrow_{,,}z. \equiv .y = z:\\ [(1)] \supset :\exists !\alpha \downarrow_{,,}ʻʻ\beta \cap \alpha \downarrow_{,,}ʻʻ\gamma . &\equiv .(\exists y,z).y\in \beta .z\in \gamma .y = z.\\ [*13·195] &\equiv .\exists !\alpha \cap \beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*113·2. $\begin{aligned}&\vdash :\xi \in \mu \times _{c} \nu . \equiv .(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\alpha \times \beta )\\ &[(*113·03)]\end{aligned}$

*113·201. $\begin{aligned}&\vdash \colon\ldotp \xi \in \mu \times _{c} \nu . \equiv :\mu ,\nu \in \text{NC}:(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\alpha \times \beta )\\ &[*113·2.*103·27]\end{aligned}$

*113·202. $\vdash \colon\ldotp \xi \in \mu \times _{c} \nu . \equiv :\exists !\mu .\exists !\nu :(\exists \gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\xi \text{ sm }(\gamma \times \delta )$

Dem. $\begin{array}{l} \vdash .*113·201.*100·4.\supset \\ \vdash \colon\ldotp \xi \in \mu \times _{c} \nu . &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\alpha \in \mu .\beta \in \nu.\xi \text{ sm }(\alpha \times \beta ).\\ [*100·31] &\equiv : (\exists \alpha ,\beta ,\gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\alpha \text{ sm }\gamma .\beta \text{ sm }\delta .\xi \text{ sm }(\alpha \times \beta ).\\ [*113·13.*73·37] &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\alpha \text{ sm }\gamma .\beta \text{ sm }\delta .\xi \text{ sm }(\gamma \times \delta ).\\ [*100·31] &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\gamma \times \delta ).\\ [*10·35] &\equiv :\exists !\mu .\exists !\nu :(\exists \gamma ,\delta ).\mu = \text{Nc}ʻ\gamma .\nu = \text{Nc}ʻ\delta .\xi \text{ sm }(\gamma \times \delta )\colon\ldotp \\ &\supset \vdash .\text{Prop} \end{array}$

*113·203. $\vdash :\exists !\mu \times _{c} \nu .\supset .\mu ,\nu \in \text{NC} - \iota ʻ\Lambda .\mu ,\nu \in \text{N}_{0}\text{C} \quad[*113·201·202·2]$

*113·204. $\vdash \colon\ldotp \mu = \Lambda .\lor.\nu = \Lambda .\lor.{\sim}(\mu ,\nu \in \text{NC}):\supset .\mu \times _{c} \nu = \Lambda \quad[*113·203]$

*113·205. $\vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).\supset .\mu \times _{c} \nu = \Lambda \quad[*113·203]$

*113·21. $\begin{aligned}&\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\xi \in \mu \times _{c} \nu . \equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\alpha \times \beta )\\ &[*113·201]\end{aligned}$

*113·22. $\vdash :\xi \in \text{Nc}(\eta )ʻ\gamma \times _{c} \text{Nc}(\zeta )ʻ\delta . \equiv .\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\xi \text{ sm }(\gamma \times \delta )$

Dem. $\begin{array}{l} \vdash .*113·21.*100·41.&\supset \vdash :\xi \in \text{Nc}(\eta )ʻ\gamma \times _{c} \text{Nc}(\zeta )ʻ\delta . \equiv .\\ &(\exists \alpha ,\beta ).\alpha \in \text{Nc}(\eta )ʻ\gamma .\beta \in \text{Nc}(\zeta )ʻ\delta .\xi \text{ sm }(\alpha \times \beta ).\\ [*102·6] &\equiv .(\exists \alpha ,\beta ).\alpha \in \text{Nc}(\eta )ʻ\gamma .\beta \in \text{Nc}(\zeta )ʻ\delta .\alpha \text{ sm }\gamma .\beta \text{ sm }\delta .\xi \text{ sm }(\alpha \times \beta ).\\ [*113·13.*73·37] &\equiv .(\exists \alpha ,\beta ).\alpha \in \text{Nc}(\eta )ʻ\gamma .\beta \in \text{Nc}(\zeta )ʻ\delta .\alpha \text{ sm }\gamma .\beta \text{ sm }\delta .\xi \text{ sm }(\gamma \times \delta ).\\ [*102·6] &\equiv .(\exists \alpha ,\beta ).\alpha \in \text{Nc}(\eta )ʻ\gamma .\beta \in \text{Nc}(\zeta )ʻ\delta .\xi \text{ sm }(\gamma \times \delta ).\\ [*10·35] &\equiv .\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\xi \text{ sm }(\gamma \times \delta ):\supset \vdash .\text{Prop} \end{array}$

*113·221. $\begin{aligned}&\vdash :\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\supset .\text{Nc}(\eta )ʻ\gamma \times _{c} \text{Nc}(\zeta )ʻ\delta = \text{Nc}ʻ(\gamma x \delta )\\ &[*113·22]\end{aligned}$

*113·222. $\vdash .\text{N}_{0}\text{c}ʻ\gamma \times _{c} \text{N}_{0}\text{c}ʻ\delta = \text{Nc}ʻ(\gamma \times \delta )$

Dem. $\begin{array}{l} \vdash .*103·1·13.&\supset \vdash .\text{N}_{0}\text{c}ʻ\gamma = \text{Nc}(\gamma )ʻ\gamma .\text{N}_{0}\text{c}ʻ\delta = \text{Nc}(\delta )ʻ\delta .\exists !\text{N}_{0}\text{c}ʻ\gamma .\exists !\text{N}_{0}\text{c}ʻ\delta .\\ [*113·221] &\supset \vdash .\text{N}_{0}\text{c}ʻ\gamma \times _{c} \text{N}_{0}\text{c}ʻ\delta = \text{Nc}ʻ(\gamma x \delta ).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*113·222.*100·41.&\supset \vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\supset .\mu \times _{c} \nu \in \text{NC} &\qquad \text{(1)}\\ \vdash .*113·205.*102·74.&\supset \vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).\supset .\mu \times _{c} \nu \in \text{NC} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·24. $\vdash .\text{Nc}ʻ\gamma \times _{c} \text{Nc}ʻ\delta = \text{N}_{0}\text{c}ʻ\gamma \times _{c} \text{N}_{0}\text{c}ʻ\delta \quad[(*113·04·05)]$

*113·25. $\vdash .\text{Nc}ʻ\gamma \times _{c} \text{Nc}ʻ\delta = \text{Nc}ʻ(\gamma \times \delta )\quad [*113·24·222]$

This proposition constitutes part of the reason for our definitions. It is obvious that such definitions ought, if possible, to be chosen as will yield this proposition.

*113·251. $\vdash .\gamma \times \delta \in \text{Nc}ʻ\gamma \times _{c} \text{Nc}ʻ\delta \quad[*113·25.*100·3]$

*113·26. $\vdash :\mu ,\nu \in \text{NC}.\exists !\text{ sm }_{\eta }ʻʻ\mu .\exists !\text{ sm }_{\zeta }ʻʻ\nu .\supset .\mu \times _{c} \nu = \text{ sm }_{\eta }ʻʻ\mu \times _{c} \text{ sm }_{\zeta }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*37·29. \text{Transp}.\supset \vdash :\text{Hp}.&\supset .\exists !\mu .\exists !\nu .\\ [*102·64] &\supset .(\exists \alpha ,\beta ,\gamma ,\delta ).\mu = \text{Nc}(\alpha )ʻ\gamma .\nu = \text{Nc}(\beta )ʻ\delta &\qquad \text{(1)}\\ \vdash .*102·88.&\supset \vdash :\mu = \text{Nc}(\alpha )ʻ\gamma .\nu = \text{Nc}(\beta )ʻ\delta .\exists !\text{ sm }_{\eta }ʻʻ\mu .\exists !\text{ sm }_{\zeta }ʻʻ\nu .\supset .\\ &\text{ sm }_{\eta }ʻʻ\mu = \text{Nc}(\eta )ʻ\gamma .\text{ sm }_{\zeta }ʻʻ\nu = \text{Nc}(\zeta )ʻ\delta .\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\\ [*113·221]&\supset .\text{ sm }_{\eta }ʻʻ\mu \times _{c} \text{ sm }_{\zeta }ʻʻ\nu = \text{Nc}ʻ(\gamma \times \delta ) &\qquad \text{(2)}\\ \vdash .*37·29.\text{Transp}.*113·221.\supset \\ \vdash :\mu &= \text{Nc}(\alpha )ʻ\gamma .\nu = \text{Nc}(\beta )ʻ\delta .\exists !\text{ sm }_{\eta }ʻʻ\mu .\exists !\text{ sm }_{\zeta }ʻʻ\nu .\supset .\mu \times _{c} \nu = \text{Nc}ʻ(\gamma \times \delta ) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash :\mu &= \text{Nc}(\alpha )ʻ\gamma .\nu = \text{Nc}(\beta )ʻ\delta .\exists !\text{ sm }_{\eta }ʻʻ\mu .\exists !\text{ sm }_{\varsigma }ʻʻ\nu .\supset .\\&\mu \times _{c} \nu = \text{ sm }_{\eta }ʻʻ\mu \times _{c} \text{ sm }_{\varsigma }ʻʻ\nu &\qquad \text{(4)}\\ \vdash .(4).*11·11·35·45.(1).\supset \vdash .\text{Prop} \end{array}$

*113·261. $\vdash :\mu ,\nu \in \text{NC}.\supset .\mu \times _{c} \nu = \mu ^{(1)} \times _{c} \nu ^{(1)} = \mu _{(00)} \times _{c} \nu _{(00}) = \text{etc}.$

Here " $\text{etc}$ ." includes all ascending derivatives of $\mu$ . We shall only prove the result for $\mu ^{(1)}$ and $\nu ^{(1)}$ , since it is proved in just the same way for the other cases. $\mu^{(1)} \times _{c} \nu ^{(2)}$ or $\mu ^{(1)} \times _{c} \nu_{(00)}$ or etc. will serve equally well; i.e. it is not necessary to take the same derivative of $\mu$ as of $\nu$ .

Dem. $\begin{array}{l} \vdash .*104·264·265.\supset \\ \vdash :\text{Hp}.\exists !\mu .\exists !\nu .\supset .\mu ^{(1)} = \text{ sm }_{\mu }ʻʻ\mu .\nu ^{(1)} = \text{ sm }_{\nu }ʻʻ\mu .\exists !\mu ^{(1)}.\exists !\nu ^{(1)}.\\ [*113·26] \supset :\mu \times _{c} \nu = \mu ^{(1)} \times _{c} \nu ^{(1)} &\qquad \text{(1)}\\ \vdash .*104·264.*113·204.\supset\\ \vdash :{\sim}(\exists !\mu .\exists !\nu ).\supset .\mu \times _{c} \nu = \Lambda .\mu ^{(1)} \times _{c} \nu ^{(1)} = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

As appears in the above proof, if $\mu^{i}$ and $\iota^{j}$ are any derivatives of $\mu$ and $\nu$ , the above proposition holds provided we have $\exists !\mu .\exists !\nu .\supset .\exists !\mu^{i}.\exists !\nu^{j} .$

Thus it holds for all ascending derivatives, but not always for descending derivatives.

Dem. $\begin{array}{l} \vdash .*113·2·141.\supset \\ \vdash :\xi \in \mu \times _{c} \nu . &\equiv .(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\xi \text{ sm }(\beta \times \alpha ).\\ [*113·2] &\equiv .\xi \in \nu \times _{c} \mu :\supset \vdash .\text{Prop} \end{array}$

Note that this proposition is not confined to the case in which $\mu$ and $\nu$ are cardinals. When either or both are not cardinals, $\mu \times _{c} \nu = \Lambda = \nu \times _{c} \mu .$

*113·3. $\vdash \colon\ldotp \text{Mult ax}.\supset :\kappa \in \text{Nc}ʻ\beta \cap \text{Cl}ʻ\text{Nc}ʻ\alpha .\supset .\Sigma ʻ\kappa \in \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*112·24.*113·12.\supset \\ \vdash \colon\ldotp \text{Mult ax}.\exists !\alpha .\supset :\kappa \in \text{Nc}ʻ\beta \cap \text{Cl}ʻ\text{Nc}ʻ\alpha .&\supset .\Sigma ʻ\kappa \text{ sm }\Sigma ʻ\alpha \downarrow_{,,}ʻʻ\beta .\\ [*113·121]& \supset .\Sigma ʻ\kappa \text{ sm } \beta \times \alpha .\\ [*113·141·25] & \supset .\Sigma ʻ\kappa \in \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash .*113·114·25.&\supset \vdash :\alpha = \Lambda .\supset .\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta = 0 &\qquad \text{(2)}\\ \vdash .*101·14.\supset \vdash \colon\ldotp \alpha = \Lambda .\kappa \in \text{Nc}ʻ\beta \cap \text{Cl}ʻ\text{Nc}ʻ\alpha .&\supset :\kappa \in \text{Cl}ʻ\iota ʻ\Lambda :\\ [*60·362] & \supset :\kappa = \iota ʻ\Lambda .\lor.\kappa = \Lambda: \\ [*112·3·301] &\supset :\Sigma ʻ\kappa = \Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).*54·102.&\supset \vdash :\alpha = \Lambda.\kappa \in \text{Nc}ʻ\beta \cap \text{Cl}ʻ\text{Nc}ʻ\alpha .\supset .\Sigma ʻ\kappa \in \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*113·31. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Sigma ʻ\kappa \in \mu \times _{c} \nu \quad[*113·3]$

*113·32. $\begin{aligned}&\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa \in \nu \cap \text{Cl excl}ʻ\mu .\supset .sʻ\kappa \in \mu \times _{c} \nu \\ &[*112·15.*113·31·23]\end{aligned}$

*113·33. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax} .\supset :\mu ,\nu \in &\text{NC}.\kappa \in \nu \cap \text{Cl}ʻ\mu .\lambda\in \mu \cap \text{Cl}ʻ\nu .\supset .\\ &\Sigma \text{Nc}ʻ\kappa = \Sigma \text{Nc}ʻ\lambda = \mu \times _{c} \nu \quad[*113·31·27·23]\end{aligned}$

*113·34. $\begin{aligned}\vdash \colon\ldotp \text{Mult ax} .\supset :\mu ,\nu \in &\text{NC}.\kappa \in \nu \cap \text{Cl excl}ʻ\mu .\lambda \in \mu \cap \text{Cl excl}ʻ\nu .\supset .\\ &\text{Nc}ʻsʻ\kappa = \text{Nc}ʻsʻ\lambda = \mu \times _{c} \nu \quad[*113·32·27]\end{aligned}$

The following propositions are concerned with various forms of the distributive law.

*113·4. $\vdash .(\beta \cup \gamma ) \times \alpha = (\beta \times \alpha )\cup (\gamma \times \alpha )$

Dem. $\begin{array}{l} \vdash .*113·1.\supset \vdash .(\beta \cup \gamma ) \times \alpha &= sʻ\alpha \downarrow_{,,}ʻʻ(\beta \cup \gamma )\\ [*40·31] & = sʻ\alpha \downarrow_{,,}ʻʻ\beta \cup sʻ\alpha \downarrow_{,,}ʻʻ\gamma \\ [*113·1] &= (\beta \times \alpha )\cup (\gamma \times \alpha ).\supset \vdash .\text{Prop} \end{array}$

*113·401. $\vdash :\beta \cap \gamma = \Lambda .\supset .(\beta \times \alpha )\cap (\gamma \times \alpha ) = \Lambda \quad[*113·19.\text{Transp}]$

*113·41. $\begin{aligned}\vdash .\text{Nc}ʻ(\beta + \gamma ) \times _{c} \text{Nc}ʻ\alpha = \text{Nc}ʻ\{(\beta + \gamma ) \times \alpha\} &= \text{Nc}ʻ\{(\beta \times \alpha ) + (\gamma \times \alpha )\}\\ &= \text{Nc}ʻ(\beta \times \alpha ) +_{c} \text{Nc}ʻ(\gamma \times \alpha )\end{aligned}$

Dem. $\begin{array}{l} \vdash . *113·25.*110·3. &\supset \vdash .\text{Nc}ʻ(\beta + \gamma ) \times _{c} \text{Nc}ʻ\alpha = \text{Nc}ʻ\{(\beta + \gamma ) \times \alpha\}.\\ &\text{Nc}ʻ\{(\beta \times \alpha ) + (\gamma \times \alpha )\} = \text{Nc}ʻ(\beta \times \alpha ) +_{c} \text{Nc}ʻ(\gamma \times \alpha ) &\qquad \text{(1)}\\ \vdash .*113·4.(*110·01). & \supset \vdash .(\beta + \gamma ) \times \alpha = (\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \times \alpha )\cup (\Lambda _{\beta }\downarrow ʻʻ\iotaʻʻ\gamma \times \alpha ) &\qquad \text{(2)}\\ \vdash .*113·13.*110·12. &\supset \vdash .\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \times \alpha \text{ sm }\beta \times \alpha .\Lambda _{\beta }\downarrow ʻʻ\iotaʻʻ\gamma \times \alpha \text{ sm }\gamma \times \alpha &\qquad \text{(3)}\\ \vdash .*113·401.*110·11. & \supset \vdash .(\downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta \times \alpha )\cap (\Lambda _{\beta }\downarrow ʻʻ\iotaʻʻ\gamma \times \alpha ) = \Lambda &\qquad \text{(4)}\\ \vdash .*110·152.(2).(3).(4). &\supset \vdash .(\beta + \gamma ) \times \alpha \text{ sm }{(\beta \times \alpha ) + (\gamma \times \alpha )} &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*113·42. $\begin{aligned}\vdash .(\text{Nc}ʻ\beta +_{c} \text{Nc}ʻ\gamma ) \times _{c} \text{Nc}ʻ\alpha &= \text{Nc}ʻ(\beta + \gamma ) \times _{c} \text{Nc}ʻ\alpha \\ &= (\text{Nc}ʻ\beta \times _{c} \text{Nc}ʻ\alpha ) +_{c} (\text{Nc}ʻ\gamma \times _{c} \text{Nc}ʻ\alpha )\\ [*110·3.*113·25.*113·41]\end{aligned}$

*113·421. $\begin{aligned}\vdash . \text{Nc}ʻ\alpha \times _{c} (\text{Nc}ʻ\beta &+_{c} \text{Nc}ʻ\gamma ) = \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ(\beta + \gamma )\\ &= (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) +_{c} (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\gamma ) \quad[*113·42·27]\end{aligned}$

*113·43. $\vdash .(\nu +_{c} \varpi ) \times _{c} \mu = \mu \times _{c} (\nu +_{c} \varpi ) = (\mu \times _{c} \nu ) +_{c} (\mu \times _{c} \varpi )$

Dem. $\begin{array}{l} \vdash . *113·27·421 .\supset \vdash :\mu ,\nu ,\varpi \in \text{NC}.\supset .(\nu +_{c} \varpi ) \times _{c} \mu &= \mu \times _{c} (\nu +_{c} \varpi )\\ &= (\mu \times _{c} \nu ) +_{c} (\mu \times _{c} \varpi ) &\qquad \text{(1)}\\ \vdash .*113·204.*110·4.\supset\\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{NC}).\supset .(\nu +_{c} \varpi ) \times _{c} \mu = \Lambda .\mu \times _{c} &(\nu +_{c} \varpi ) = \Lambda .\\ &(\mu \times _{c} \nu ) +_{c} (\mu \times _{c} \varpi ) = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with various forms of the distributive law, when the summands are not enumerated, but given as the members of a class.

The first of them (*113·44) gives the distributive law with regard to arithmetical class-multiplication and logical addition of classes.

Dem. $\begin{array}{l} \vdash .*113·1 .\supset \vdash .sʻ(\times \alpha )ʻʻ\kappa &= sʻsʻʻ\alpha \downarrow_{,,}ʻʻʻ\kappa \\ [*42·1] &= sʻsʻ\alpha \downarrow_{,,}ʻʻʻ\kappa \\ [*40·38] &= sʻ\alpha \downarrow_{,,}ʻʻsʻ\kappa \\ [*113·1] &= (sʻ\kappa ) \times \alpha .\supset \vdash .\text{Prop} \end{array}$

*113·45. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset . \times \alpha ʻʻ\kappa \in \text{Cls}^{2} \text{excl}$

Dem. $\begin{array}{l} \vdash . *113·19. &\supset \vdash :\exists ! \times \alpha ʻ\beta \cap \times \alpha ʻ\gamma .\supset .\exists !\supset \cap \gamma &\qquad \text{(1)}\\ \vdash .(1).*84·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta ,\gamma \in \kappa .\exists ! \times \alpha ʻ\beta \cap \times \alpha ʻ\gamma .&\supset_{\beta,\gamma}.\beta = \gamma .\\ [*30·37] &\supset_{\beta,\gamma}. \times \alpha ʻ\beta = \times \alpha ʻ\gamma :\\ [*37·63] &\supset :\rho ,\sigma \in \times \alpha ʻʻ\kappa .\exists !\rho \cap \sigma .\supset _{\rho ,\sigma}.\rho = \sigma &\qquad \text{(2)}\\ \vdash .(2).*84·11.\supset \vdash .\text{Prop} \end{array}$

*113·46. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Sigma ʻ \times \alpha ʻʻ\kappa \text{ sm }(\Sigma ʻ\kappa ) \times \alpha$

Dem. $\begin{array}{l} \vdash .*112·15. \supset \vdash :\text{Hp}.&\supset .\Sigma ʻ\kappa \text{ sm }sʻ\kappa .\\ [*113·13] &\supset .(\Sigma ʻ\kappa ) \times \alpha \text{ sm }(sʻ\kappa ) \times \alpha &\qquad \text{(1)}\\ \vdash . *112·15 . *113·45. &\supset \vdash :\text{Hp}.\supset .\Sigma ʻ \times \alpha ʻʻ\kappa \text{ sm }sʻ \times \alpha ʻʻ\kappa &\qquad \text{(2)}\\ \vdash .(1).(2).*113·44.\supset \vdash .\text{Prop} \end{array}$

*113·47. $\begin{aligned}&\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Sigma \text{Nc}ʻ \times \alpha ʻʻ\kappa = \text{Nc}ʻ{(\Sigma ʻ\kappa ) \times \alpha } = \Sigma \text{Nc}ʻ\kappa \times _{c} \text{Nc}ʻ\alpha \\ &[*113·46]\end{aligned}$

This is the distributive law for arithmetical multiplication and arithmetical addition of the kind defined in *112.

*113·48. $\vdash .sʻ\alpha \times ʻʻ\kappa = \alpha \times (sʻ\kappa ) = \text{Cnv}ʻʻ\{(sʻ\kappa ) \times \alpha\}$

Dem. $\begin{array}{l} \vdash .*113·14. \supset \vdash .sʻ\alpha \times ʻʻ\kappa & = sʻ\text{Cnv}ʻʻʻ \times \alpha ʻʻ\kappa \\ [*40·38] &= \text{Cnv}ʻʻsʻ \times \alpha ʻʻ\kappa \\ [*113·44] &= \text{Cnv}ʻʻ{(sʻ\kappa ) \times \alpha } &\qquad \text{(1)}\\ [*113·14] &= \alpha \times sʻ\kappa &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·49. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Sigma ʻ\alpha \times ʻʻ\kappa \text{ sm }\alpha \times (\Sigma ʻ\kappa )$

Dem. $\begin{array}{l} \vdash . *113·14.&\supset \vdash .\alpha \times ʻʻ\kappa = \text{Cnv}ʻʻʻ \times \alpha ʻʻ\kappa &\qquad \text{(1)}\\ \vdash .(1).*113·45.*72·11.*84·53.\supset \\ \vdash :\text{Hp}.&\supset .\alpha \times ʻʻ\kappa \in \text{Cls}^{2} \text{excl}.\\ [*112·15] &\supset . \Sigma ʻ\alpha \times ʻʻ\kappa \text{ sm }sʻ\alpha \times ʻʻ\kappa .\\ [*113·48] &\supset .\Sigma ʻ\alpha \times ʻʻ\kappa \text{ sm }\alpha \times (sʻ\kappa ).\\ [*112·15.*113·13] &\supset .\Sigma ʻ\alpha \times ʻʻ\kappa \text{ sm }\alpha \times (\Sigma ʻ\kappa ):\supset \vdash .\text{Prop} \end{array}$

*113·491. $\begin{aligned}&\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Sigma \text{Nc}ʻ\alpha \times ʻʻ\kappa = \text{Nc}ʻ{\alpha \times (\Sigma ʻ\kappa )} = \text{Nc}ʻ\alpha \times _{c} \Sigma \text{Nc}ʻ\kappa \\ &[*113·49·25]\end{aligned}$

The following propositions are concerned with the associative law for arithmetical multiplication.

*113·5. $\vdash .(\gamma \times \beta ) \times \alpha = \hat{R} \{(\exists x,y,z).x\in \alpha .y\in \beta .z\in \gamma .R = x\downarrow (y\downarrow z)\}$

Dem. $\begin{array}{l} \vdash .*113·101.\supset \\ \vdash .(\gamma \times \beta ) \times \alpha &= \hat{R} \{(\exists x,P).x\in \alpha .P\in (\gamma \times \beta ).R = x\downarrow P\}\\ [*113·101] &= \hat{R} \{(\exists x,y,z).x\in \alpha .y\in \beta .z\in \gamma .R = x\downarrow (y\downarrow z)\}.\supset \vdash .\text{Prop} \end{array}$

*113·51. $\vdash .(\alpha \times \beta ) \times \gamma \text{ sm }\alpha \times (\beta \times \gamma )$

Dem. $\begin{array}{l} \vdash .*113·141.&\supset \vdash .\alpha \times (\beta \times \gamma )\text{ sm }(\beta \times \gamma ) x \alpha &\qquad \text{(1)}\\ \vdash .*113·5. \supset \vdash .(\alpha \times \beta ) \times \gamma &= \hat{R} \{(\exists x,y,z).x\in \alpha .y\in \beta .z\in \gamma .R = z\downarrow (y\downarrow x)\} .\\ (\beta \times \gamma ) \times \alpha &= \hat{P} \{(\exists x,y,z).x\in \alpha .y\in \beta .z\in \gamma .P = x\downarrow (z\downarrow y)\} &\qquad \text{(2)}\\ \vdash .(2).\supset \vdash :T &= \hat{R} \hat{P} \{(\exists x,y,z).x\in \alpha .y\in \beta .z\in \gamma .R = z\downarrow (y\downarrow x).P =x\downarrow (y\downarrow z)\}.\supset .\\ &\text{D}ʻT = (\alpha \times \beta ) \times \gamma .\text{ᗡ}ʻT = (\beta \times \gamma ) \times \alpha &\qquad \text{(3)}\\ \vdash .*21·33.&\supset \vdash :\text{Hp}(3).RTP.RTQ.\supset\\ &(\exists x,x',y,y',z,z').x,x'\in \alpha .y,y'\in \beta .z,z'\in \gamma .R = z\downarrow (y\downarrow x) = z'\downarrow (y'\downarrow x').\\ &P = x\downarrow (z\downarrow y).Q = x'\downarrow (z'\downarrow y').\\ [*55·202]&\supset .P = Q &\qquad \text{(4)}\\ \text{Similarly}\qquad &\vdash :\text{Hp}(3).RTP.QTP.\supset .R = Q &\qquad \text{(5)}\\ \vdash .(3).(4).(5).&\supset \vdash .(\alpha \times \beta ) \times \gamma \text{ sm }(\beta \times \gamma ) \times \alpha &\qquad \text{(6)}\\ \vdash .(1).(6).\supset \vdash .\text{Prop} \end{array}$

*113·511. $\alpha \times \beta \times \gamma = (\alpha \times \beta ) \times \gamma \quad\text{Df}$

*113·52. $\vdash . (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) \times _{c} \text{Nc}ʻ\gamma = \text{Nc}ʻ(\alpha \times \beta \times \gamma ) \quad[*113·25]$

*113·53. $\vdash . (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) \times _{c} \text{Nc}ʻ\gamma = \text{Nc}ʻ\alpha \times _{c} (\text{Nc}ʻ\beta \times _{c} \text{Nc}ʻ\gamma )$

Dem. $\begin{array}{l} \vdash . *113·52·51 . \supset \\ \vdash . (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) \times _{c} \text{Nc}ʻ\gamma &= \text{Nc}ʻ\{\alpha \times (\beta \times \gamma )\}\\ [*113·25] &= \text{Nc}ʻ\alpha \times _{c} (\text{Nc}ʻ\beta \times _{c} \text{Nc}ʻ\gamma ).\supset \vdash .\text{Prop} \end{array}$

*113·531. $\begin{aligned}&\vdash . (\text{N}_{0}\text{c}ʻ\alpha \times _{c} \text{N}_{0}\text{c}ʻ\beta ) \times _{c} \text{N}_{0}\text{c}ʻ\gamma = \text{N}_{0}\text{c}ʻ\alpha \times _{c} (\text{N}_{0}\text{c}ʻ\beta \times _{c} \text{N}_{0}\text{c}ʻ\gamma )\\ &[*113·53.(*113·04·05)]\end{aligned}$

*113·54. $\vdash . (\mu \times _{c} \nu ) \times _{c} \varpi = \mu \times _{c} (\nu \times _{c} \varpi )$

Dem. $\begin{array}{l} \vdash .*113·531.*103·2.\supset \\ \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}.\supset .(\mu \times _{c} \nu ) \times _{c} \varpi = \mu \times _{c} (\nu \times _{c} \varpi ) &\qquad \text{(1)}\\ \vdash .*113·204.\supset \\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .(\mu \times _{c} \nu ) \times _{c} \varpi = \Lambda .\mu \times _{c} (\nu \times \varpi ) = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·541. $\mu \times _{c} \nu \times _{c} \varpi = (\mu \times _{c} \nu ) \times _{c} \varpi \quad\text{Df}$

Dem. $\begin{array}{l} \vdash .*113·25.*101·1.\supset \vdash .\text{Nc}ʻ\alpha \times _{c} 0 &= \text{Nc}ʻ(\alpha \times \Lambda )\\ [*113·114.*101·1] &= 0.\supset \vdash .\text{Prop} \end{array}$

*113·601. $\vdash :\mu \in \text{NC} - \iota ʻ\Lambda .\supset .\mu \times _{c} 0 = 0$

Dem. $\begin{array}{l} \vdash .*103·26.\supset \vdash :\text{Hp}.\supset .(\exists \alpha ).\mu = \text{N}_{0}\text{c}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*101·11·13.*103·27.\supset \vdash .0 = \text{N}_{0}\text{c}ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.\supset .(\exists \alpha ).\mu \times _{c} 0 = \text{N}_{0}\text{c}ʻ\alpha \times _{c} \text{N}_{0}\text{c}ʻ\Lambda \\ [*113·222] = \text{Nc}ʻ(\alpha x \Lambda )\\ [*113·114.*101·1] = 0:\supset \vdash .\text{Prop} \end{array}$

*113·602. $\vdash \colon\ldotp \mu \times _{c} \nu = 0. \equiv :\mu ,\nu \in \text{NC} -{℩} ʻ\Lambda :\mu = 0.\lor.\nu = 0$

Dem. $\begin{array}{l} \vdash .*113·203.*101·12.\supset \\ \vdash :\mu \times _{c} \nu = 0.&\supset .\mu ,\nu \in \text{NC}-\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .(1).*113·201.\supset\\ \vdash \colon\colon \mu \times _{c} \nu = 0.&\supset \colon\ldotp \xi \in 0. \equiv _{\xi } :(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\alpha \times \beta )\colon\ldotp \\ [*54·102] &\supset \colon\ldotp \xi = \Lambda . \equiv _{\xi } :(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm }(\alpha \times \beta )\colon\ldotp \\ [*10·1.*13·15] &\supset \colon\ldotp (\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\Lambda \text{ sm }(\alpha \times \beta )\colon\ldotp \\ [*73·47] &\supset \colon\ldotp (\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\alpha \times \beta = \Lambda \colon\ldotp \\ [*113·114] &\supset \colon\ldotp (\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu :\alpha = \Lambda .\lor.\beta = \Lambda \colon\ldotp \\ [*13·195] &\supset \colon\ldotp \Lambda \in \mu .\lor.\Lambda \in \nu \colon\ldotp \\ [(1).*100·45] &\supset \colon\ldotp \mu = \text{Nc}ʻ\Lambda .\lor.\nu = \text{Nc}ʻ\Lambda \colon\ldotp \\ [*101·1] &\supset \colon\ldotp \mu = 0.\lor.\nu = 0 &\qquad \text{(2)}\\ \vdash . *113·601·27. &\supset \vdash \colon\ldotp \mu ,\nu \in \text{NC} - \iota ʻ\Lambda :\mu = 0.\lor.\nu = 0:\supset .\mu \times _{c} \nu = 0 &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with multiplication by a unit class or by 1 or 2.

Dem. $\begin{array}{l} \vdash .*113·1.\supset \vdash .\iota ʻz \times \alpha &= sʻ\alpha \downarrow_{,,}ʻʻ\iota ʻz\\ [*53·31·02] &= \alpha \downarrow_{,,}ʻz\\ [*38·2] &= \downarrow zʻʻ\alpha .\supset \vdash .\text{Prop} \end{array}$

*113·611. $\vdash .\iota ʻz \times \alpha \text{ sm }\alpha \quad[*113·61.*73·611]$

*113·612. $\vdash .\alpha \times \iota ʻz\text{ sm }\alpha \quad[*113·611·141]$

Dem. $\begin{array}{l} \vdash .*101·2.\supset \vdash .\text{Nc}ʻ\alpha \times _{c} 1 &= \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\iota ʻz\\ [*113·25] &= \text{Nc}ʻ(\alpha \times \iota ʻz)\\ [*113·612] &= \text{Nc}ʻ\alpha .\supset \vdash .\text{Prop} \end{array}$

*113·621. $\vdash :\mu \in \text{NC}.\supset .\mu \times _{c} 1 = \text{ sm }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*113·204.\supset \vdash :\mu = \Lambda .\supset .\mu \times _{c} 1 &= \Lambda \\ [*37·29] &= \text{ sm }ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*103·26. \supset \vdash :\text{Hp}.\alpha \in \mu .&\supset .\mu = \text{N}_{0}\text{c}ʻ\alpha . &\qquad \text{(2)}\\ [(*113·04)] \supset .\mu \times _{c} 1 &= \text{Nc}ʻ\alpha \times _{c} 1\\ [*113·62] &= \text{Nc}ʻ\alpha \\ [*103·4.(2)] &= \text{ sm }ʻʻ\mu &\qquad \text{(3)}\\ \vdash .(2).*10·11·23·35.&\supset \vdash :\text{Hp}.\exists !\mu .\supset .\mu \times _{c} 1 = \text{ sm }ʻʻ\mu &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

Observe that if $\mu$ is a typically definite cardinal, $\text{ sm }ʻʻ\mu$ is the "same" cardinal rendered typically ambiguous; while if $\mu$ is typically ambiguous, $\mu = \text{ sm }ʻʻ\mu$ in every type.

*113·63. $\vdash :z{\sim}\in \alpha .\supset .\downarrow zʻʻ\alpha \text{ sm } \text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\iota ʻz)$

Dem. $\begin{array}{l} \vdash .*113·152.\supset \vdash :\text{Hp}.\supset .\text{D}ʻʻ{\in}_{\Delta}ʻ(\iota ʻ\alpha \cup \iota ʻ\iota ʻz)\text{ sm } \alpha \times \iota ʻz &\qquad \text{(1)}\\ \vdash .(1).*113·61·141.\supset \vdash .\text{Prop} \end{array}$

*113·64. $\vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta \text{ sm } \alpha \times \beta .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta \text{ sm }\downarrow zʻʻ(\alpha \times \beta )$

Dem. $\begin{array}{l} \vdash .*73·611.*113·13.&\supset \vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta \text{ sm } \alpha \times \beta &\qquad \text{(1)}\\ \vdash .(1).*73·611.&\supset \vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta \text{ sm }\downarrow zʻʻ(\alpha \times \beta ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*113·65. $\vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta = (\downarrow z\parallel \text{Cnv}ʻ\downarrow z)ʻʻ(\alpha \times \beta )$

Dem. $\begin{array}{l} \vdash .*72·184.*55·21.&\supset \vdash .\downarrow z\in 1\rightarrow 1.\alpha \subset \text{ᗡ}ʻ\downarrow z.\beta \subset \text{ᗡ}ʻ\downarrow z.\\ [*113·126] &\supset \vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta = (\downarrow z\parallel \text{Cnv}ʻ\downarrow z)ʻʻ(\alpha \times \beta ).\\ &\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*110·643.\supset \vdash .\mu \times _{c} 2 &= \mu \times _{c} (1 +_{c} 1)\\ [*113·43] &= (\mu \times _{c} 1) +_{c} (\mu \times _{c} 1) &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash \colon\ldotp \mu = \text{N}_{0}\text{c}ʻ\alpha .\supset .\mu \times _{c} 2 &= (\text{N}_{0}\text{c}ʻ\alpha \times _{c} 1) +_{c} (\text{N}_{0}\text{c}ʻ\alpha \times _{c} 1)\\ [*113·62.(*113·04)] &= \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\alpha \\ [*110·3] &= \mu +_{c} \mu &\qquad \text{(2)}\\ \vdash .(2).*103·2. &\supset \vdash :\mu \in \text{N}_{0}\text{C}.\supset .\mu \times _{c} 2 = \mu +_{c} \mu &\qquad \text{(3)}\\ \vdash .*113·205.*110·4. &\supset \vdash :\mu {\sim}\in \text{N}_{0}\text{C}.\supset .\mu \times _{c} 2 = \Lambda .\mu +_{c} \mu = \Lambda &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*113·67. $\vdash .\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ(\beta + \iota ʻy) = (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) +_{c} \text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*113·421.*101·2.\supset \\ \vdash .\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ(\beta + \iota ʻy) &= (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) +_{c} (\text{Nc}ʻ\alpha \times _{c} 1)\\ [*113·62] &= (\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta ) +_{c} \text{Nc}ʻ\alpha .\supset \vdash .\text{Prop} \end{array}$

*113·671. $\vdash .\mu \times _{c} (\nu +_{c} 1) = (\mu \times _{c} \nu ) +_{c} \mu \quad[*113·67·205.*110·4]$

FOOTNOTES:

[5] We define this as $\beta \times \alpha$ , rather than $\alpha \times \beta$ , for the sake of certain analogies with products in relation-arithmetic. Cf. *166.

The kind of multiplication defined in *113 cannot be extended beyond a finite number of factors. We therefore, as in the case of addition, introduce another definition, defining the product of the numbers of a class of classes, and capable of being applied to an infinite number of factors. We define the product of the numbers of members of $\kappa$ as $\text{Nc}ʻ{\in}_{\Delta }ʻ\kappa$ ; thus we put $\Pi \text{Nc}ʻ\kappa = \text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \quad\text{Df}.$

It is to be observed that $\Pi \text{Nc}ʻ\kappa$ is not a function of $\text{Nc}ʻʻ\kappa$ , because, if two members of $\kappa$ have the same number, this will count only once in $\text{Nc}ʻʻ\kappa$ , but will count twice in $\Pi \text{Nc}ʻ\kappa$ .

It is very easy to see that, in case $\kappa$ is finite, $\text{Nc}ʻ{\in}_{\Delta }ʻ\kappa$ will be what we should ordinarily regard as the product of the numbers of members of $\kappa$ . For suppose (e.g.) $\kappa = \iota ʻ\alpha \cup \iota ʻ\beta \cup \iota ʻ\gamma ,$ where $\alpha \neq \beta . \alpha \neq \gamma . \beta \neq \gamma$ . Then ${\in}_{\Delta }ʻ\kappa = \hat{R} \{(\exists x,y,z).R = x\downarrow \alpha \unicode{x228d} y\downarrow \beta \unicode{x228d} z\downarrow \gamma .x\in \alpha .y\in \beta .z\in \gamma\}.$

Thus if $R$ is a member of ${\in}_{\Delta }ʻ\kappa$ , $R$ is determinate when $x$ , $y$ , $z$ are given, $x$ , $y$ , $z$ being the referents to $\alpha$ , $\beta$ , $\gamma$ . Whether $\alpha$ , $\beta$ , $\gamma$ overlap or not, the choice of any one of $x$ , $y$ , $z$ is entirely independent of the choice of the other two, and therefore the total number of choices possible is obviously the product of the numbers of $\alpha$ , $\beta$ , $\gamma$ . Thus our definition will not conflict with what is commonly understood by a product.

The propositions of this number are less numerous and less important than those of *113. We shall deal first with products of a single factor, and products in which one factor is null (*114·2—·27). We shall then deal (*114·3—·36) with the relations between the sort of multiplication here defined and the sort defined in *113. Then we have a few propositions (*114·4—*114·43) showing that unit factors make no difference to the value of a product. Then we prove (*114·5—·52) that the value of the product is the same for two classes having double similarity, and then (*114·53—·571) we give extensions of this result which depend upon the multiplicative axiom. Finally, we give some new forms of the associative law of multiplication.

I.e. a product vanishes if one of its factors is zero. The converse requires the multiplicative axiom, as appears from the proposition

*114·26. $\vdash \colon\ldotp \text{Mult ax}. \equiv :\Pi \text{Nc}ʻ\kappa = 0. \equiv _{\kappa } .\Lambda \in \kappa$

I.e. the multiplicative axiom is equivalent to the assumption that a product vanishes when, and only when, one of its factors is zero.

*114·301. $\vdash :\kappa \cap \lambda = \lambda .\supset .{\in}_{\Delta}ʻ(\kappa \cup \lambda )\text{ sm } {\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta} ʻ\lambda$

*114·31. $\vdash :\kappa \cap \lambda = \Lambda .\supset .\Pi \text{Nc}ʻ\kappa \times _{c} \Pi \text{Nc}ʻ\lambda = \Pi \text{Nc}ʻ(\kappa \cup \lambda )$

*114·35. $\vdash :\alpha \neq \beta .\supset .\Pi \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta$

*114·41. $\vdash :\lambda \subset 1.\supset .\Pi \text{Nc}ʻ(\kappa \cup \lambda ) = \Pi \text{Nc}ʻ\kappa$

*114·51. $\vdash :T\upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .(T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\lambda \in ({\in}_{\Delta}ʻ\kappa )\,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\lambda )$

This proposition gives a correlator of ${\in}_{\Delta }ʻ\kappa$ and ${\in}_{\Delta }ʻ\lambda$ as a function of a double correlator of $\kappa$ and $\lambda$ , and thus leads to

*114·52. $\vdash :\kappa \text{ sm }\text{ sm }\lambda .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda .{\in}_{\Delta}ʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\lambda$

*114·571. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda$

I.e. assuming the multiplicative axiom, if $\kappa$ and $\lambda$ each consist of $\mu$ classes of $\nu$ terms each, their products are equal.

*114·6. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \Pi \text{Nc}ʻ{\in}_{\Delta }ʻʻ\kappa = \Pi \text{Nc}ʻsʻ\kappa$

*114·632. $\begin{aligned}\vdash :S\upharpoonright &\gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻS.\gamma \cap Sʻʻ\gamma = \Lambda .\supset .\\ &{\in}_{\Delta }ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\text{ sm }{\in}_{\Delta}ʻ(\gamma \cup Sʻʻ\gamma )\end{aligned}$

As to the sense in which this is a form of the associative law, see the observations following *114·6.

*114·01. $\Pi \text{Nc}ʻ\kappa = \text{Nc}ʻ{\in}_{\Delta }ʻ\kappa \quad\text{Df}$

*114·1. $\vdash . \Pi \text{Nc}ʻ\kappa = \text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \quad[(*114·01)]$

*114·11. $\vdash :\beta \in \Pi \text{Nc}ʻ\kappa . \equiv .\beta \text{ sm }{\in}_{\Delta}ʻ\kappa . \equiv .\beta \in \text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \quad[*114·1.*100·31]$

*114·12. $\vdash .{\in}_{\Delta}ʻ\kappa \in \Pi \text{Nc}ʻ\kappa \quad[*100·3.*114·1]$

Thus a product of no factors is 1. This is the source of $\mu^{0} =1$ , as we shall see later.

*114·21. $\vdash .\Pi \text{Nc}ʻ\iota ʻ\alpha = \text{Nc}ʻ\alpha \quad[*83·41]$

*114·23. $\vdash :\Lambda \in \kappa .\supset .\Pi \text{Nc}ʻ\kappa = 0 \quad[*83·11.*101·1]$

Thus an arithmetical product is zero if any of its factors is zero. To prove the converse, we have to assume the multiplicative axiom, which, in fact, is equivalent to the proposition that an arithmetical product is only zero when at least one of its factors is zero.

*114·24. $\vdash :\Pi \text{Nc}ʻ\lambda \neq 0.\kappa \subset \lambda .\supset .\Pi \text{Nc}ʻ\kappa \neq 0$

Dem. $\begin{array}{l} \vdash .*114·1.*101·1. &\supset \vdash :\Pi \text{Nc}ʻ\lambda \neq 0.\supset .\exists !{\in}_{\Delta}ʻ\lambda &\qquad \text{(1)}\\ \vdash . (1) . *80·6. \supset \vdash :\Pi \text{Nc}ʻ\lambda \neq 0.\kappa \subset \lambda .&\supset .\exists !{\in}_{\Delta}ʻ\kappa .\\ [*114·1.*101·1] &\supset .\Pi \text{Nc}ʻ\kappa \neq 0:\supset \vdash .\text{Prop} \end{array}$

*114·25. $\vdash \colon\ldotp \text{Mult ax}. \equiv :\Pi \text{Nc}ʻ\kappa = 0.\supset _{\kappa }.\Lambda \in \kappa$

Dem. $\begin{array}{l} \vdash .*88·37.\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Mult ax}. &\equiv :{\in}_{\Delta}ʻ\kappa = \Lambda .\supset _{\kappa }.\Lambda \in \kappa :\\ [*114·1.*101·1] &\equiv :\Pi \text{Nc}ʻ\kappa = 0.\supset _{\kappa }.\Lambda \in \kappa \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·26. $\vdash \colon\ldotp \text{Mult ax}. \equiv :\Pi \text{Nc}ʻ\kappa = 0. \equiv _{\kappa } .\Lambda \in \kappa \quad[*88·372.*101·1]$

*114·261. $\vdash \colon\ldotp \text{Mult ax}. \equiv :\Pi \text{Nc}ʻ\kappa = 0. \equiv _{\kappa } .0\in \text{Nc}ʻʻ\kappa \quad[*114·26.*101·1]$

*114·27. $\begin{aligned}&\vdash \colon\colon \text{Mult ax}. \equiv \colon\ldotp \alpha \in \kappa .\supset _{\alpha }.\exists !\alpha : \equiv _{\kappa } .\Pi \text{Nc}ʻ\kappa \neq 0\\ &[*114·26. \text{Transp}.*24·63]\end{aligned}$

*114·3. $\vdash :\kappa \neq \lambda .\supset .{\in}_{\Delta}ʻ(\iota ʻ{\in}_{\Delta}ʻ\kappa \cup \iota ʻ{\in}_{\Delta}ʻ\lambda )\text{ sm }{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*113·146. \supset \vdash :{\in}_{\Delta}ʻ\kappa \neq {\in}_{\Delta}ʻ\lambda .\supset .{\in}_{\Delta}ʻ(\iota ʻ{\in}_{\Delta}ʻ\kappa \cup \iota ʻ{\in}_{\Delta}ʻ\lambda )\text{ sm }{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda &\qquad \text{(1)}\\ \vdash .*80·81. \supset \vdash \colon\ldotp \exists !{\in}_{\Delta}ʻ\kappa .\lor.\exists !{\in}_{\Delta}ʻ\lambda :\kappa \neq \lambda :\supset .{\in}_{\Delta}ʻ\kappa \neq {\in}_{\Delta}ʻ\lambda &\qquad \text{(2)}\\ \vdash .*83·903.*113·114.\supset \\ \vdash :{\in}_{\Delta}ʻ\kappa = \Lambda .{\in}_{\Delta}ʻ\lambda = \Lambda .\supset .{\in}_{\Delta}ʻ(\iota ʻ{\in}_{\Delta}ʻ\kappa \cup \iota ʻ{\in}_{\Delta}ʻ\lambda ) = \Lambda .{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda = \Lambda &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*114·301. $\vdash :\kappa \cap \lambda = \Lambda .\supset .{\in}_{\Delta}ʻ(\kappa \cup \lambda )\text{ sm }{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*85·45.*114·3.\supset\\ \vdash :\kappa \cap \lambda = \Lambda .\kappa \neq \lambda .\supset .{\in}_{\Delta}ʻ(\kappa \cup \lambda )\text{ sm }{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda &\qquad \text{(1)}\\ \vdash .*22·5. \supset \vdash :\kappa \cap \lambda = \Lambda .\kappa = \lambda .\supset .\kappa = \Lambda .\lambda = \Lambda .\\ [*83·15] \supset .{\in}_{\Delta}ʻ(\kappa \cup \lambda ) = \iota ʻ\dot{\Lambda} .{\in}_{\Delta}ʻ\kappa = \iota ʻ\dot{\Lambda} .{\in}_{\Delta}ʻ\lambda = \iota ʻ\dot{\Lambda} .\\ [*113·611] \supset .{\in}_{\Delta}ʻ(\kappa \cup \lambda )\text{ sm }{\in}_{\Delta}ʻ\kappa \times {\in}_{\Delta}ʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*114·31. $\begin{aligned}&\vdash :\kappa \cap \lambda = \Lambda .\supset .\Pi \text{Nc}ʻ\kappa \times _{c} \Pi \text{Nc}ʻ\lambda = \Pi \text{Nc}ʻ(\kappa \cup \lambda )\\ &[*114·301·1.*113·25]\end{aligned}$

*114·311. $\vdash .\Pi \text{Nc}ʻ(\kappa \cup \lambda ) = \Pi \text{Nc}ʻ\kappa \times _{c} \Pi \text{Nc}ʻ(\lambda - \kappa ) \quad[*114·31.*22·91]$

*114·32. $\vdash :\Pi \text{Nc}ʻ(\kappa \cup \lambda ) \neq 0. \equiv .\Pi \text{Nc}ʻ\kappa \neq 0.\Pi \text{Nc}ʻ\lambda \neq 0$

Dem. $\begin{array}{l} \vdash .*114·311.*113·602.\supset \\ \vdash :\Pi \text{Nc}ʻ(\kappa \cup \lambda ) \neq 0.\supset .\Pi \text{Nc}ʻ\kappa \neq 0 &\qquad \text{(1)}\\ \vdash .(1) \frac{\lambda ,\kappa}{\kappa ,\lambda}. \supset \vdash :\Pi \text{Nc}ʻ(\kappa \cup \lambda ) \neq 0.\supset .\Pi \text{Nc}ʻ\lambda \neq 0 &\qquad \text{(2)}\\ \vdash .*114·24.\supset \vdash :\Pi \text{Nc}ʻ\lambda \neq 0.\supset .\Pi \text{Nc}ʻ(\lambda - \kappa ) \neq 0:\\ [\text{Fact}] \supset \vdash :\Pi \text{Nc}ʻ\kappa \neq 0.\Pi \text{Nc}ʻ\lambda \neq 0.\supset .\Pi \text{Nc}ʻ\kappa \neq 0.\Pi \text{Nc}ʻ(\lambda -\kappa ) \neq 0.\\ [*113·602.*114·311] \supset .\Pi \text{Nc}ʻ(\kappa \cup \lambda ) \neq 0 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*114·33. $\vdash :\alpha {\sim}\in \kappa .\supset .\Pi \text{Nc}ʻ(\kappa \cup \iota ʻ\alpha ) = \Pi \text{Nc}ʻ\kappa \times _{c} \text{Nc}ʻ\alpha \quad[*114·31·21]$

*114·34. $\begin{aligned}&\vdash :\Pi \text{Nc}ʻ\kappa \neq 0.\exists !\alpha . \equiv .\Pi \text{Nc}ʻ(\kappa \cup \iota ʻ\alpha ) \neq 0\\ &[*114·32·21.*101·14]\end{aligned}$

*114·35. $\vdash :\alpha \neq \beta .\supset .\Pi \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta \quad[*114·33·21]$

*114·36. $\begin{aligned}&\vdash :\alpha \neq \beta .\alpha \neq \gamma .\beta \neq \gamma .\supset .\Pi \text{Nc}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta \cup \iota ʻ\gamma ) = \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta \times _{c} \text{Nc}ʻ\gamma \\ &[*114·33·35]\end{aligned}$

*114·4. $\vdash :\lambda \subset 1.\supset .\Pi \text{Nc}ʻ\lambda = 1 \quad[*83·44]$

*114·41. $\vdash :\lambda \subset 1.\supset .\Pi \text{Nc}ʻ(\kappa \cup \lambda ) = \Pi \text{Nc}ʻ\kappa \quad[*83·57]$

Dem. $\begin{array}{l} \vdash .*24·41.\supset \vdash .\kappa = (\kappa - 1)\cup (\kappa \cap 1) &\qquad \text{(1)}\\ \vdash .(1).*114·41.\supset \vdash .\text{Prop} \end{array}$

*114·43. $\vdash .\Pi \text{Nc}ʻ(\kappa \cup \iotaʻʻ\alpha ) = \Pi \text{Nc}ʻ\kappa \quad[*114·41.*52·3]$

*114·5. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .(T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\lambda \in ({\in}_{\Delta}ʻ\kappa )\,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\lambda )$

Dem. $\begin{array}{l} \vdash .*111·1·11. &\supset \vdash :\text{Hp}.\supset .T,T_{\in }\upharpoonright \lambda \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*80·14.*83·21.&\supset \vdash sʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\lambda \subset sʻ\lambda .sʻ\text{ᗡ}ʻʻ{\in}_{\Delta}ʻ\lambda \subset \lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*74·773.\supset \\ \vdash :\text{Hp}.&\supset .(T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\lambda \in \{(T\parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda \},\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\lambda ) &\qquad \text{(3)}\\ \vdash .*82.43 \frac{\in,T_{\in}}{P,\,Q}.*62·3.\supset \\ \vdash :T,T_{\in }\upharpoonright \lambda \in 1\rightarrow 1.sʻ\lambda \subset \text{ᗡ}ʻT.\lambda \subset \text{ᗡ}ʻT_{\in }.\kappa &= T_{\in }ʻʻ\lambda .\supset .\\ &(T\mid \in \upharpoonright \lambda \mid \breve{T} _{\in })_{\Delta }ʻ\kappa = (T\parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &\qquad \text{(4)}\\ \vdash.(4).(1).*111·1.*37·111.\supset \vdash :\text{Hp}.\supset .&(T\mid \in \upharpoonright \lambda \mid \breve{T} _{\in })_{\Delta }ʻ\kappa = (T\parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &\qquad \text{(5)}\\ \vdash .*34·1.*37·101.\supset \\ \vdash :x(T\mid \in \upharpoonright \lambda \mid \breve{T} _{\in }\alpha . &\equiv .(\exists y,\beta ).xTy.y\in \beta .\beta \in \lambda .\alpha = Tʻʻ\beta &\qquad \text{(6)}\\ \vdash .(6).*72·52.*111·1.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x(T\mid \in \upharpoonright \lambda \mid \breve{T} _{\in })\alpha . &\equiv .(\exists y,\beta ).xTy.y\in \beta .\beta \in \lambda .\beta = \breve{T} ʻʻ\alpha .\alpha \subset \text{D}ʻT.\\ [*111·1·131.*13·195] &\equiv .(\exists y).xTy.y\in \breve{T} ʻʻ\alpha .\alpha \in \kappa .\\ [*37·1] &\equiv .x\in Tʻʻ\breve{T} ʻʻ\alpha .a\in \kappa .\\ [*72·502.*111·1] &\equiv .x(\in \upharpoonright \kappa )\alpha &\qquad \text{(7)}\\ \vdash .(5).(7).\supset \vdash :\text{Hp}.&\supset .(\in \upharpoonright \kappa )_{\Delta }ʻ\kappa = (T\parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda .\\ [*83·12] &\supset .{\in}_{\Delta}ʻ\kappa = (T \parallel ]\breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &\qquad \text{(8)}\\ \vdash .(3).(8).\supset \vdash .\text{Prop} \end{array}$

*114·501. $\vdash :S = T\upharpoonright sʻ\lambda .\supset .(S\parallel \breve{S} _\in )\upharpoonright {\in}_{\Delta}ʻ\lambda = (T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*80·14.*83·21.\supset \\ \vdash \colon\ldotp R\in {\in}_{\Delta}ʻ\lambda .\supset :yR\beta .&\supset .y\in sʻ\lambda .\beta \in \lambda .\\ [*40·13] &\supset .y\in sʻ\lambda .\beta \subset sʻ\lambda : &\qquad \text{(1)}\\ [*4·71 . \text{Fact}] &\supset :xTy.yR\beta .\beta \breve{T} _{\in }\alpha . \equiv .xTy.y\in sʻ\lambda .yR\beta .\beta \breve{T} _{\in }\alpha .\beta \subset sʻ\lambda .\\ [*37·101.*22·621] &\equiv .x(T\upharpoonright sʻ\lambda )y.yR\beta .\alpha = Tʻʻ\beta .\beta = \beta \cap sʻ\lambda .\\ [(1).*37·412] &\equiv .x(T\upharpoonright sʻ\lambda )y.yR\beta .\alpha = (T\upharpoonright sʻ\lambda )ʻʻ\beta &\qquad \text{(2)}\\ \vdash .(2).\supset \vdash \colon\ldotp \text{Hp}.&\supset :R\in {\in}_{\Delta}ʻ\kappa .\supset .T\mid R\mid \breve{T} _{\in } = S\mid R\mid \breve{S} _{\in }:\\ [*35·71] &\supset :(T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\kappa = (S\parallel \breve{S} _{\in })\upharpoonright {\in}_{\Delta}ʻ\kappa \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·51. $\begin{aligned}&\vdash :T\upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .(T\parallel \breve{T} _{\in })\upharpoonright {\in}_{\Delta}ʻ\lambda \in ({\in}_{\Delta}ʻ\kappa )\,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\lambda )\\ &[*114·5·501]\end{aligned}$

*114·52. $\vdash :\kappa \text{ sm }\text{ sm } \lambda .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda .{\in}_{\Delta}ʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\lambda \quad[*114·51 .*111·4]$

*114·53. $\begin{aligned}\vdash \colon\colon &\text{Mult ax}.\supset \colon\ldotp \kappa ,\lambda \in \text{Cls}^{2} \text{excl}:\\ &(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda :\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda\\ &[*114·52.*111·5]\end{aligned}$

*114·54. $\begin{aligned}&\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl excl}ʻ\nu .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda \\ &[*114·52.*111·53]\end{aligned}$

The condition $\kappa$ , $\lambda \in \text{Cls}^{2} \text{excl}$ , which is involved in the hypothesis of *114·54 (through $\kappa$ , $\lambda \in \text{Cl excl}ʻ\nu$ ), is not necessary. The following propositions enable us to remove it. We first prove ${\in}_{\Delta}ʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\in \unicode{x21A7}ʻʻ\kappa$ and then we use *114·54 to take us from ${\in}_{\Delta}ʻ\in\unicode{x21A7}ʻʻ\kappa$ to ${\in}_{\Delta}ʻ\in\unicode{x21A7}ʻʻ\lambda$ . Thence we arrive at ${\in}_{\Delta}ʻ\kappa \text{ sm } {\in}_{\Delta}ʻ\lambda$ .

*114·56. $\vdash .{\in}_{\Delta}ʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\in \unicode{x21A7}ʻʻ\kappa .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\in \unicode{x21A7}ʻʻ\kappa \quad[*85·54]$

*114·561. $\begin{aligned}&\vdash :S\in \kappa \,\overline{\text{ sm }}\, \lambda \cap \text{ᗡ}ʻʻʻ\text{ sm }.\supset .\in \unicode{x21A7}\mid S\mid \text{Cnv}ʻ(\in \unicode{x21A7})\in (\in \unicode{x21A7}ʻʻ\kappa )\,\overline{\text{ sm }}\, (e\unicode{x21A7}ʻʻ\lambda )\cap \text{ᗡ}ʻʻʻ\text{ sm }\\ &[*73·63.*85·601.*38·12.*33·432]\end{aligned}$

*114·562. $\vdash \colon\ldotp \text{Mult ax}.\supset : (\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\supset .\in \unicode{x21A7}ʻʻ\kappa \text{ sm }\text{ sm }\in \unicode{x21A7}ʻʻ\lambda$

Dem. $\begin{array}{l} \vdash .*114·561.*85·61.\supset \\ \vdash \colon\ldotp (\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\supset :\\ \in \unicode{x21A7}ʻʻ\kappa ,\in \unicode{x21A7}ʻʻ\lambda \in \text{Cls}^{2} \text{excl}:(\exists T).T\in 1\rightarrow 1.T\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻT = \in \unicode{x21A7}ʻʻ\kappa .\text{ᗡ}ʻT = \in \unicode{x21A7}ʻʻ\lambda :\\ [*111·5] \supset :\text{Mult ax}.\supset .\in \unicode{x21A7}ʻʻ\kappa \text{ sm } \text{ sm }\in \unicode{x21A7}ʻʻ\lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·57. $\begin{aligned}\vdash \colon\ldotp &\text{Mult ax}.\supset :\\ &(\exists S).S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda \end{aligned}$

Dem. $\begin{array}{l} \vdash .*114·562·52.\supset \\ \vdash \colon\ldotp \text{Mult ax}.\supset :(\exists S).&S\in 1\rightarrow 1.S\,\unicode{x2abd}\, \text{ sm }.\text{D}ʻS = \kappa .\text{ᗡ}ʻS = \lambda .\supset .\\ &\Pi \text{Nc}ʻ\in \downarrow ʻʻ\kappa = \Pi \text{Nc}ʻ\in \downarrow ʻʻ\lambda .\\ [*114·56] &\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·571. $\begin{aligned}&\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}.\kappa ,\lambda \in \mu \cap \text{Cl}ʻ\nu .\supset .\Pi \text{Nc}ʻ\kappa = \Pi \text{Nc}ʻ\lambda \\ &[*111·52 . *114·57]\end{aligned}$

*114·6. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Pi \text{Nc}ʻ{\in}_{\Delta}ʻʻ\kappa = \Pi \text{Nc}ʻsʻ\kappa \quad[*85·44]$

This is the most general form of the associative law for arithmetical multiplication.

Owing to the fact that we have two kinds of multiplication, namely $\alpha \times \beta$ and ${\in}_{\Delta}ʻ\kappa$ , we have four forms of the associative law of multiplication, namely:

(2) *113·54, i.e. $\vdash .(\mu \times _{c} \nu ) \times _{c}\varpi = \mu \times _{c} (\nu \times _{c} \varpi )$ ,

(3) *114·31, i.e. $\vdash :\kappa \cap \lambda = \Lambda.\supset .\Pi \text{Nc}ʻ\kappa \times _{c} \Pi \text{Nc}ʻ\lambda = \Pi \text{Nc}ʻ(\kappa \cup \lambda )$ ,

(4) a form of the associative law which has not yet been proved, which may be explained as follows.

Suppose we have a number of pairs of classes, e.g. $(\alpha_{1}, \beta _{1})$ , $(\alpha _{2}, \beta _{2})$ , $(\alpha _{3},\beta _{3})$ ,.... Suppose we form the products $\alpha _{1} \times\beta _{1}$ , $\alpha _{2} \times \beta _{2}$ , $\alpha _{3} \times\beta _{3}$ , ... and multiply all these products together. We wish to prove that (with a suitable hypothesis) the result is similar to the product of all the $\alpha$ 's and all the $\beta$ 's taken together as one class; i.e. if we call $\lambda$ the class of products $\alpha _{1} \times \beta _{1}$ , $\alpha _{2} \times \beta _{2}$ , $\alpha _{3} \times \beta _{3}$ , ..., and $\mu$ the class whose members are $\alpha _{1}$ , $\alpha _{2}$ , $\alpha _{3}$ , ..., $\beta _{1}$ , $\beta _{2}$ , $\beta _{3}$ , ..., we wish to prove $\Pi \text{Nc}ʻ\lambda = \Pi \text{Nc}ʻ\mu .$ In order to express this proposition in symbols, let $S$ be the correlator of the $\alpha$ 's and $\beta$ 's, so that $\beta_{\nu} =Sʻ\alpha_{\nu}$ . (The suffix $\nu$ will not be used further, since it implies that the number of $\alpha$ 's and of $\beta$ 's is finite or denumerable.) Then our class of products of the form $\alpha \times \beta$ is $\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\},$ [Pg 130] where $\gamma$ is the class of all the $\alpha$ 's ; and the product of this class of products is ${\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}.$ On the other hand, the class of all the $\alpha$ 's and $\beta$ 's is $\gamma \cup Sʻʻ\gamma$ , and the product of this class is ${\in}_{\Delta}ʻ(\gamma \cup Sʻʻ\gamma ).$ Thus what we have to prove (with a suitable hypothesis) is ${\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\} \text{ sm } {\in}_{\Delta}ʻ(\gamma \cup Sʻʻ\gamma ).$ The hypothesis required is $S\upharpoonright \gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻS.\gamma \cap Sʻʻ\gamma = \Lambda .$

A smaller hypothesis suffices, however, for a proposition which, in virtue of *114·301, is closely allied to the above, namely ${\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma \text{ sm } {\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}.$ For this, a sufficient hypothesis is $S\upharpoonright \gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻS.$ Thus e.g. we may write $I$ for $S$ , and we find $\vdash .{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻ\gamma \text{ sm } {\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times \alpha\}.$

We shall now prove the above propositions. What follows, down to *114·621, consists of lemmas.

For convenience, we write $S_{\times }ʻ\alpha$ for $\alpha \times Sʻ\alpha$ in the course of these lemmas; this notation is introduced in the hypotheses of the lemmas.

*114·601. $\begin{aligned}\vdash \colon\ldotp S\upharpoonright \gamma &\in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻS.\Lambda {\sim}\in \gamma .S_{\times } = \hat{\mu} \hat{\alpha} (\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha ).\supset :\\ &S_{\times }\in 1\rightarrow 1.\text{ᗡ}ʻS_{\times } = \gamma .\text{D}ʻS_{\times } = \hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}:\\ &\alpha \in \gamma .\supset _{\alpha }.S_{\times }ʻ\alpha = \alpha \times Sʻ\alpha\end{aligned}$

Dem. $\begin{array}{l} \vdash .*33·11. &\supset \vdash :\text{Hp}.\supset .\text{D}ʻS_{\times } = \hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\} &\qquad \text{(1)}\\ \vdash .*21·33 \supset \vdash \colon\ldotp \text{Hp}.\alpha \in \gamma .&\supset :\mu (S_{\times })\alpha . \equiv _{\mu } .\mu = \alpha \times Sʻ\alpha :\\ [*30·3] &\supset :S_{\times }ʻ\alpha = \alpha \times Sʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*14·204. \supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \gamma .&\supset _{\alpha }.\text{E}!S_{\times }ʻ\alpha . &\qquad \text{(3)}\\ [*33·43] &\supset _{\alpha }.\alpha \in \text{ᗡ}ʻS_{\times } &\qquad \text{(4)}\\ \vdash .*21·33.*33·131.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{ᗡ}ʻS_{\times }.\supset _{\alpha }.\alpha \in \gamma &\qquad \text{(5)}\\ \vdash .(4).(5). \supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻS_{\times } = \gamma . &\qquad \text{(6)}\\ [(3).*71·16] &\supset .S_{\times }\in 1\rightarrow \text{Cls} &\qquad \text{(7)}\\ \vdash .*113·181. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\alpha'\in \gamma .\alpha \times Sʻ\alpha = \alpha'\times Sʻ\alpha'.\supset .Sʻ\alpha = Sʻ\alpha'.\\ [*71·59] &\supset .\alpha = \alpha' &\qquad \text{(8)}\\ \vdash .(8).*71·55.(2).(6).(7).&\supset \vdash :\text{Hp}.\supset .S_{\times }\in 1\rightarrow 1 &\qquad \text{(9)}\\ \vdash .(1).(2).(6).(9).\supset \vdash .\text{Prop} \end{array}$

*114·602. $\vdash :\text{Hp}*114·601.A = \hat{R} \hat{\alpha} \{\alpha \in \gamma .R = (Sʻ\alpha )\downarrow \alpha\}.\supset .A\in 1\rightarrow 1.\text{ᗡ}ʻA = \gamma$

$\begin{array}{l} \vdash :\text{Hp}.&\supset .A\in 1\rightarrow \text{Cls}.\text{ᗡ}ʻA = \gamma &\qquad \text{(1)}\\ \vdash .*21·33.*13·171.\supset \vdash \colon\ldotp \text{Hp}.\supset :RA\alpha .RA\beta .&\supset .(Sʻ\alpha )\downarrow \alpha = (Sʻ\beta )\downarrow \beta .\\ [*55·202] &\supset .\alpha = \beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*114·603. $\vdash :\text{Hp}*114·602.X\in {\in}_{\Delta}ʻ\gamma .Y\in {\in}_{\Delta}ʻSʻʻ\gamma .P = (Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times }.\supset .P\in {\in}_{\Delta}ʻ\text{D}ʻS_{\times }$

Dem. $\begin{array}{l} \vdash .*43·122.*71·166.*144·601·602.&\supset \vdash :\text{Hp}.\supset .P\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .*43·122.*37·32·322.*33·431.\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻP &= S_{\times }ʻʻ\text{ᗡ}ʻA\\ [*114·601·602] &= \text{D}ʻS_{\times } &\qquad \text{(2)}\\ \vdash .*34·1.\supset \colon\ldotp \text{Hp}.\supset :\\ MP\mu . &\equiv .(\exists R,\alpha ).M = Y\mid R\mid \breve{X} .R = (Sʻ\alpha )\downarrow \alpha .\alpha \in \gamma .\mu = S_{\times }ʻ\alpha .\\ [*113·123.*80·14] &\equiv .(\exists \alpha ).M = (YʻSʻ\alpha )\downarrow (Xʻ\alpha ).\mu = S_{\times }ʻ\alpha .\alpha \in \gamma .\\ [*13·195.*114·601] &\equiv .(\exists \alpha ,\beta ).\beta = Sʻ\alpha .\alpha \in \gamma .M = (Yʻ\beta )\downarrow (Xʻ\alpha ).\mu = \alpha \times \beta .\\ [*83·2] &\supset .(\exists \alpha ,\beta ,u,v).\beta = Sʻ\alpha .\alpha \in \gamma .u\in \alpha .v\in \beta .\\ &M = (v\downarrow u).\mu = \alpha \times \beta .\\ [*113·101] &\supset .M\in \mu &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*80·14.\supset \vdash .\text{Prop} \end{array}$

*114·604. $\begin{aligned}\vdash :\text{Hp}*114·602.T = &\hat{P} \hat{Q}\{(\exists X,Y).X\in {\in}_{\Delta}ʻ\gamma .Y\in {\in}_{\Delta}ʻSʻʻ\gamma\}.\\ &\{Q = Y\downarrow X.P = (Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times }\}.\\ &\supset .T\in 1\rightarrow \text{Cls}.\text{ᗡ}ʻT = {\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma .\text{D}ʻT\subset {\in}_{\Delta}ʻ\text{D}ʻS_{\times }\end{aligned}$

The relation $T$ here defined is the correlator required for proving ${\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\text{ sm }{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma .$

Besides what is proved in the present proposition, we shall have to prove $T\in \text{Cls}\rightarrow 1.{\in}_{\Delta}ʻ\text{D}ʻS_{\times }\subset \text{D}ʻT.$

Dem. $\begin{array}{l} \vdash .*21·33.*13·171.\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ PTQ.P'TQ.&\supset .(\exists X,Y,X',Y').Y\downarrow X = Y'\downarrow X'.P = (Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times }.\\ &P' = (Y'\parallel \breve{X}')\mid A\mid \breve{S} _{\times }.\\ [*55·202] &\supset .P = P' &\qquad \text{(1)}\\ \vdash .*21·33.*114·603.&\supset \vdash \colon\ldotp \text{Hp}.\supset :PTQ.\supset .P\in {\in}_{\Delta}ʻ\text{D}ʻS_{\times } &\qquad \text{(2)}\\ \vdash .(1).(2).*113·101.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*114·601.&\supset \vdash :\text{Hp}.\supset .S_{\times }\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*74·71.*114·601·602.\supset \\ \vdash \colon\ldotp \text{Hp}.X,X'\in {\in}_{\Delta}ʻ\gamma .&Y,Y'\in {\in}_{\Delta}ʻSʻʻ\gamma .(Y\parallel \breve{X})\mid A\mid \breve{S} _{\times } = (Y'\parallel \breve{X}')\mid A\mid \breve{S} _{\times }.\supset :\\ &(Y\parallel \breve{X} )\mid A = (Y'\parallel \breve{X}')\mid A:\\ [*74·7] &\supset :(Y\parallel \breve{X} )\upharpoonright \text{D}ʻA = (Y'\parallel \breve{X}')\upharpoonright \text{D}ʻA:\\ [*114·602] \supset :\alpha \in \gamma .&\supset _{\alpha }.(Y\parallel \breve{X})ʻ(Sʻ\alpha )\downarrow \alpha = (Y'\parallel \breve{X}')ʻ(Sʻ\alpha )\downarrow \alpha .\\ [*113·123] &\supset _{\alpha }.(YʻSʻ\alpha )\downarrow (Xʻ\alpha ) = (Y'ʻSʻ\alpha )\downarrow (X'ʻ\alpha ).\\ [*55·202] &\supset _{\alpha }.Xʻ\alpha = X'ʻ\alpha .YʻSʻ\alpha = Y'ʻSʻ\alpha :\\ [*80·14.*33·45] &\supset :X = X'.Y = Y':\\ [*55·202] &\supset :Y\downarrow X = Y'\downarrow X' &\qquad \text{(2)}\\ \vdash . (2) . *13·22. *21·33. \supset \vdash \colon\ldotp \text{Hp}.&\supset :PTQ.PTQ'.\supset .Q = Q'\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The following propositions are required for proving that, with the same hypothesis, ${\in}_{\Delta}ʻ\text{D}ʻS_{\times }\subset \text{D}ʻT$ .

*114·61. $\begin{aligned}\vdash :\text{Hp}*114·602.P\in {\in}_{\Delta}ʻ\text{D}ʻS_{\times }.&X = \breve{\iota} \mid \text{ᗡ}\mid P\mid S_{\times }.Y = \breve{\iota} \mid \text{D}\mid P\mid S_{\times }\mid \breve{S} .\supset .\\ &X\in {\in}_{\Delta}ʻ\gamma .Y\in {\in}_{\Delta}ʻSʻʻ\gamma\end{aligned}$

Dem. $\begin{array}{l} \vdash .*72·181·13·131.*80·14.*114·601.\supset \vdash :\text{Hp}.\supset .X,Y\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .*72·2·181·13·131.*80·14.*114·601.\supset\\ \vdash \colon\ldotp \text{Hp}.\supset :xX\alpha . \equiv .x = \breve{\iota} ʻ\text{ᗡ}ʻPʻS_{\times }ʻ\alpha . &\qquad \text{(2)}\\ [*51·53] \supset .x\in \text{ᗡ}ʻPʻS_{\times }ʻ\alpha .\\ [*83·2. *114·601] \supset .(\exists R).R\in \alpha \times Sʻ\alpha .x\in \text{ᗡ}ʻR.\\ [*113·142] \supset .x\in \alpha &\qquad \text{(3)}\\ \vdash . *114·601. \supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \gamma . \equiv .S_{\times }ʻ\alpha \in \text{D}ʻS_{\times }.\\ [*83·2] \equiv .\text{E}!PʻS_{\times }ʻ\alpha &\qquad \text{(4)}\\ \vdash . *83·2. \supset \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!PʻS_{\times }ʻ\alpha . \equiv .PʻS_{\times }ʻ\alpha \in S_{\times }ʻ\alpha .\\ [*113·142] \supset .\text{ᗡ}ʻPʻS_{\times }ʻ\alpha \in 1.\\ [*52·15] \supset .\text{E}!\breve{\iota} ʻ\text{ᗡ}ʻPʻS_{\times }ʻ\alpha &\qquad \text{(5)}\\ \vdash .(2).(4).(5). \supset \vdash :\text{Hp}.\supset .\gamma \subset \text{ᗡ}ʻX &\qquad \text{(6)}\\ \vdash . *34·36. *114·601. \supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻX\subset \gamma &\qquad \text{(7)}\\ \vdash .(1).(3).(6).(7). \supset \vdash :\text{Hp}.\supset .X\in {\in}_{\Delta}ʻ\gamma &\qquad \text{(8)}\\ \text{Similarly}\qquad \vdash :\text{Hp}.\supset .Y\in {\in}_{\Delta}ʻSʻʻ\gamma &\qquad \text{(9)}\\ \vdash .(8).(9).\supset \vdash .\text{Prop} \end{array}$

*114·611. $\vdash \colon\ldotp \text{Hp}*114·61.\supset :\alpha \in \gamma .\supset .(YʻSʻ\alpha )\downarrow (Xʻ\alpha ) = PʻS_{\times }ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*72·2. \supset \vdash :\text{Hp}.\alpha \in \gamma .&\supset .Xʻ\alpha = \breve{\iota} ʻ\text{ᗡ}ʻPʻS_{\times }ʻ\alpha .YʻSʻ\alpha = \breve{\iota} ʻ\text{D}ʻPʻS_{\times }ʻ\alpha .\\ [*55·16. *51·51] &\supset .(YʻSʻ\alpha )\downarrow (Xʻ\alpha ) = PʻS_{\times }ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*114·612. $\vdash :\text{Hp} *114·61.\supset .(Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times } = P$

Dem. $\begin{array}{l} \vdash .*83·15.\supset \vdash :\text{Hp}.\dot{\exists} !P.&\supset .\exists !\text{D}ʻS_{\times } .\\ [*114·601] &\supset .\exists !\gamma &\qquad \text{(1)}\\ \vdash .*34·1.\supset \vdash \colon\ldotp \text{Hp}.\supset :&M\{(Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times }\}\mu . \equiv .\\ &(\exists Q,\alpha ).M = (Y\parallel \breve{X} )ʻQ.QA\alpha .\mu = S_{\times }ʻ\alpha .\\ [*114·601·602] &\equiv .(\exists \alpha ).M = (Y\parallel \breve{X} )ʻ(Sʻ\alpha )\downarrow \alpha .\mu = S_{\times }ʻ\alpha .\alpha \in \gamma .\\ [*113·123] &\equiv .(\exists \alpha ).M = (YʻSʻ\alpha )\downarrow (Xʻ\alpha ).\mu = S_{\times }ʻ\alpha .\alpha \in \gamma .\\ [*114·611] &\equiv .(\exists \alpha ).M = PʻS_{\times }ʻ\alpha .\mu = S_{\times }ʻ\alpha .\alpha \in \gamma .\\ [*13·193.*114·601.*71·16] &\equiv .M = Pʻ\mu .\exists !\gamma .\\ [*71·36.*80·14.(1)] &\equiv .MP\mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·613. $\begin{aligned}\vdash :\text{Hp}*114·61.&\text{Hp}*114·604.\supset .\\ &P = Tʻ(Y\downarrow X).(Y\downarrow X)\in {\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma \end{aligned}$

Dem. $\begin{array}{l} \vdash .*21·33.*114·604.\supset \vdash \colon\ldotp \text{Hp}*114·604.\supset :\\ X\in {\in}_{\Delta}ʻ\gamma .Y\in {\in}_{\Delta}ʻSʻʻ\gamma .\supset .Tʻ(Y\downarrow X) = (Y\parallel \breve{X} )\mid A\mid \breve{S} _{\times } &\qquad \text{(1)}\\ \vdash .(1).*114·61·612.*113·106.\supset \vdash .\text{Prop} \end{array}$

*114·614. $\vdash :\text{Hp}*114·604.\supset .{\in}_{\Delta}ʻ\text{D}ʻS_{\times }\subset \text{D}ʻT$

Dem. $\begin{array}{l} \vdash .*114·613.\supset \vdash \colon\ldotp \text{Hp}.&\supset :P\in {\in}_{\Delta}ʻ\text{D}ʻS_{\times }.\supset .(\exists Q).P = TʻQ.\\ [*33·43] &\supset .P\in \text{D}ʻT\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*114·62. $\begin{aligned}&\vdash :\text{Hp}*114·604.\supset .T\in 1\rightarrow 1.\text{D}ʻT = {\in}_{\Delta}ʻ\text{D}ʻS_{\times }.\text{ᗡ}ʻT = {\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma \\ &[*114·604·605·614]\end{aligned}$

*114·621. $\begin{aligned}\vdash :S\upharpoonright \gamma \in 1\rightarrow 1.&\gamma \subset \text{ᗡ}ʻS.\Lambda {\sim}\in \gamma .\supset .\\ &{\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\text{ sm }{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma \\ &[*114·62·601]\end{aligned}$

The hypothesis $\Lambda {\sim}\in \gamma$ is not necessary, since, when $\Lambda \in \gamma$ , ${\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\,\,\text{and}\,\,{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma$

*114·63. $\begin{aligned}\vdash :S\upharpoonright \gamma \in 1\rightarrow& 1.\gamma \subset \text{ᗡ}ʻS.\supset .\\ &{\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\text{ sm }{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma\end{aligned}$

Dem. $\begin{array}{l} \vdash .*10·24.*83·11.\supset \\ \vdash :\text{Hp}.\Lambda \in \gamma .&\supset .\Lambda \times Sʻ\Lambda \in \hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}.{\in}_{\Delta}ʻ\gamma = \Lambda .\\ [*113·114] &\supset .\Lambda \in \hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}.{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma = \Lambda .\\ [*83·11] &\supset .{\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\} = \Lambda .{\in}_{\Delta}ʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma = \Lambda &\qquad \text{(1)}\\ \vdash .(1).*73·47.*114·621.\supset \vdash .\text{Prop} \end{array}$

The above is one of the two variants of the associative law for ${\in}_{\Delta}$ and $\times$ .

*114·631. $\vdash .{\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times \alpha \}\text{ sm }{\in}_{\Delta}ʻ\alpha \times {\in}_{\Delta}ʻ\alpha \quad\left[*114·63 \frac{I}{S}\right]$

*114·632. $\begin{aligned}\vdash :S\upharpoonright &\gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻS.\gamma \cap Sʻʻ\gamma = \Lambda .\supset .\\ &{\in}_{\Delta}ʻ\hat{\mu}\{(\exists \alpha ).\alpha \in \gamma .\mu = \alpha \times Sʻ\alpha\}\text{ sm }{\in}_{\Delta}ʻ(\gamma \cup Sʻʻ\gamma ) \quad[*114·63·301]\end{aligned}$

This is the second variant of the associative law for ${\in}_{\Delta}$ and $\times$ .

*114·64. $\begin{align}\vdash :(Rʻʻ\gamma )&\upharpoonleft R,S\upharpoonright \gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻR.\gamma \subset \text{ᗡ}ʻS.\supset .\\ &{\in}_{\Delta}ʻRʻʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma \text{ sm }{\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu = Rʻz \times Sʻz\}\end{align}$

Dem. $\begin{array}{l} \vdash . *114·63 \frac{S\mid\, \breve{R},\,Rʻʻ\gamma}{S,\,\gamma}. \supset \\ \vdash :S\mid \breve{R} \upharpoonright &Rʻʻ\gamma \in 1\rightarrow 1.Rʻʻ\gamma \subset \text{ᗡ}ʻ(S\mid \breve{R} ).\supset .\\ &{\in}_{\Delta}ʻRʻʻ\gamma \times {\in}_{\Delta}ʻSʻʻRʻʻRʻʻ\gamma \text{ sm }{\in}_{\Delta}ʻ\hat{\mu} \{(\exists \alpha ).\alpha \in Rʻʻ\gamma .\mu = \alpha \times (S\mid \breve{R} )ʻ\alpha\} &\qquad \text{(1)}\\ \vdash .*74·14 .*35·354. \supset \vdash :\text{Hp}.&\supset .S\mid \breve{R} \upharpoonright Rʻʻ\gamma = S\upharpoonright \gamma \mid \gamma \upharpoonleft \breve{R} .\breve{R} \upharpoonright Rʻʻ\gamma = \gamma \upharpoonleft \breve{R} .\\ [*71·252] &\supset .S\mid \breve{R} \upharpoonright Rʻʻ\gamma \in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*37·2.\supset \vdash :\text{Hp}.&\supset .Rʻʻ\gamma \subset Rʻʻ\text{ᗡ}ʻS.\\ [*37·32] &\supset .Rʻʻ\gamma \subset \text{ᗡ}ʻ(S\mid \breve{R} ) &\qquad \text{(3)}\\ \vdash .*74·171. &\supset \vdash :\text{Hp}.\supset .\breve{R} ʻʻRʻʻ\gamma = \gamma &\qquad \text{(4)}\\ \vdash .(4).*74·14. \supset \vdash :\text{Hp}.&\supset .(Rʻʻ\gamma )\upharpoonleft R = R\upharpoonright \gamma .\\ [*35·7.*71·4] &\supset .\hat{\mu} \{(\exists \alpha ).\alpha \in Rʻʻ\gamma .\mu = \alpha \times (S\mid \breve{R} )ʻ\alpha \}\\ &= \hat{\mu} \{(\exists z).z\in \gamma .\mu = Rʻz \times Sʻ\breve{R} ʻRʻz\}\\ [*74·53] &= \hat{\mu} \{(\exists z).z\in \gamma .\mu = Rʻz \times Sʻz\} &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

In the above proposition, the hypothesis has to be such as to yield $\breve{R} ʻʻRʻʻ\gamma = \gamma$ . Various other forms of hypothesis will secure this result, and will give other forms of the above proposition. This subject is treated in *74, above.

*114·65. $\begin{align}\vdash \colon\ldotp &(Rʻʻ\gamma )\upharpoonleft R,S\upharpoonright \gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻR.\gamma \subset \text{ᗡ}ʻS.Rʻʻ\gamma \cap Sʻʻ\gamma = \Lambda .\supset .\\ &{\in}_{\Delta}ʻ(Rʻʻ\gamma \cup Sʻʻ\gamma )\text{ sm }{\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu = Rʻz \times Sʻz\}\\ &[*114·64·301]\end{align}$

Whenever $\kappa$ is a class of mutually exclusive classes, ${\in}_{\Delta}ʻ\kappa$ is similar to $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ ; hence $\Pi \text{Nc}ʻ\kappa = \text{Nc}ʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa .$

Now $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ is of the same type as $\kappa$ ; and when $\kappa$ is a class of mutually exclusive classes, $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ consists of all classes formed by selecting one representative from each member of $\kappa$ . It often happens that $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ is easier to deal with than ${\in}_{\Delta}ʻ\kappa$ ; hence when possible (i.e. when $\kappa \in \text{Cls}^{2} \text{excl})$ , it is convenient to use $\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa$ , rather than ${\in}_{\Delta}ʻ\kappa$ , as the standard member of $\Pi\text{Nc}ʻ\kappa$ . We therefore put $\text{Prod}ʻ\kappa = \text{D}ʻʻ{\in}_{\Delta}ʻ\kappa \quad\text{Df}.$

The associative law, $\text{Prod}ʻsʻ\kappa \text{ sm } \text{Prod}ʻ\text{Prod}ʻʻ\kappa ,$ requires not merely $\kappa \in \text{Cls}^{2} \text{excl}$ , but also $sʻ\kappa \in \text{Cls}^{2} \text{excl}$ . The combination of these two hypotheses gives a completely disjointed class of classes of classes, i.e. a class of classes of classes $\kappa$ which can be obtained by dividing a given class $(sʻsʻ\kappa)$ into mutually exclusive portions, and then dividing each of those portions into mutually exclusive portions. For example, take a square (a class of points) and divide it by horizontal lines, and then divide each of the resulting rectangles by vertical lines; then the resulting rows of little rectangles form such a class, each row of rectangles being one member of the class. Such a class we call an "arithmetical" class, and denote by " $\text{Cls}^{3}\,\text{arithm}$ ."

The present number is concerned with the properties of multiplicative classes and arithmetical classes. Some of these properties will be useful in dealing with exponentiation.

The present number begins with various propositions concerning $\text{Prod}ʻ\kappa$ which are merely repetitions of previous propositions of *83, *84, *85 or *113. Thus we have

*115·141. $\vdash :\exists !\text{Prod}ʻ\kappa .\supset .sʻ\text{Prod}ʻ\kappa = sʻ\kappa \quad\text{by *83·66}$ ,

*115·142. $\vdash .\text{Prod}ʻ\iota ʻ\alpha = \iotaʻʻ\alpha \quad\text{by *83·7}$ ,

*115·143. $\vdash .\text{Prod}ʻ\iotaʻʻ\alpha = \iota ʻ\alpha \quad\text{by *83·71}$ ,

*115·16. $\vdash .\kappa \in \text{Cls}^{2} \text{excl}.\supset .\text{Prod}ʻ\kappa \subset \text{Nc}ʻ\kappa \quad\text{by *100·64}$ ,

*115·22. $\vdash \colon\ldotp \kappa \in \text{Cls}^{3}\,\text{arithm}.\supset :sʻʻ\kappa \in \text{Cls}^{2} \text{excl}:\alpha ,\beta \in \kappa .\exists !sʻ\alpha \cap sʻ\beta .\supset _{\alpha ,\beta }.\alpha =\beta$

and *115·23 gives a similar proposition substituting " $\text{Prod}$ " for $s$ .

After a few more propositions on $\text{Cls}^{3}\,\text{arithm}$ , we proceed to the associative law for $\text{Prod}$ (*115·34), i.e. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}ʻʻ\kappa \text{ sm }\text{Prod}ʻsʻ\kappa .$

(This proposition, *115·34, also states that, with the same hypothesis, $\text{Prod}ʻsʻ\kappa \text{ sm }{\in}_{\Delta}ʻsʻ\kappa)$ . Hence we have

*115·35. $\begin{align}\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Nc}ʻ\text{Prod}ʻ\text{Prod}ʻʻ\kappa &=\text{Nc}ʻ\text{Prod}ʻsʻ\kappa =\Pi \text{Nc}ʻ\text{Prod}ʻʻ\kappa \\ &=\Pi \text{Nc}ʻ{\in}_{\Delta}ʻʻ\kappa =\Pi \text{Nc}ʻsʻ\kappa\end{align}$

*115·42. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}ʻʻ\kappa =\text{D}ʻʻʻ\text{Prod}ʻ{\in}_{\Delta}ʻʻ\kappa =\text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa$

*115·44. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻsʻ\kappa =sʻʻ\text{Prod}ʻ\text{Prod}ʻʻ\kappa$

We have next to prove that if two classes of classes have double similarity, so have their multiplicative classes. The proof is simple, since the double correlator is the same as for the original classes, i.e.

*115·502. $\vdash :T\upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .T\upharpoonright sʻ\text{Prod}ʻ\lambda \in (\text{Prod}ʻ\kappa )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\text{Prod}ʻ\lambda )$

*115·51. $\vdash :\kappa \text{ sm }\text{ sm }\lambda .\supset .\text{Prod}ʻ\kappa \text{ sm }\text{ sm }\text{Prod}ʻ\lambda$

The number ends with some propositions which result from *114·64 ·65 and are analogous to them. One of these is used in the following number, in proving $\mu ^{\varpi }\times _{c}\nu ^{\varpi }=(\mu \times _{c}\nu)^{\varpi }$ , namely,

*115·6. $\begin{align}\vdash :(Rʻʻ\gamma )&\upharpoonleft R,S\upharpoonright \gamma \in 1\rightarrow 1.\gamma \subset \text{ᗡ}ʻR.\gamma \subset \text{ᗡ}ʻS.Rʻʻ\gamma ,Sʻʻ\gamma \in \text{Cls}^{2} \text{excl}.\supset .\\ &\text{Prod}ʻRʻʻ\gamma \times \text{Prod}ʻSʻʻ\gamma \text{ sm }{\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu =Rʻz\times Sʻz\}\end{align}$

The subject of this number will be useful in dealing with exponentiation, since we shall define $\mu ^\nu$ by means of $\text{Prod}ʻ\alpha\downarrow_{,,}ʻʻ\beta$ , where $\mu=\text{N}_{0}\text{c}ʻ\alpha$ and $\nu =\text{N}_{0}\text{c}ʻ\beta$ .

*115·01. $\text{Prod}ʻ\kappa =\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa \quad\text{Df}$

*115·02. $\text{Cls}^{3}\,\text{arithm}=\hat{\kappa} (\kappa ,sʻ\kappa \in \text{Cls}^{2} \text{excl}) \quad\text{Df}$

*115·1. $\vdash .\text{Prod}ʻ\kappa =\text{D}ʻʻ{\in}_{\Delta}ʻ\kappa \quad[(*115·01)]$

*115·101. $\vdash \colon\ldotp \alpha \in \kappa .\supset _{\alpha }.\varpi \cap \alpha \in 1:\varpi \subset sʻ\kappa :\supset .\varpi \in \text{Prod}ʻ\kappa \quad[*84·411]$

*115·11. $\begin{align}&\vdash \colon\colon \kappa \in \text{Cls}^{2} \text{excl}.\supset \colon\ldotp \varpi \in \text{Prod}ʻ\kappa .\equiv :\alpha \in \kappa .\supset _{\alpha }.\varpi \cap \alpha \in 1:\varpi \subset sʻ\kappa\\ &[*84·412]\end{align}$

Owing to this proposition, $\text{Prod}ʻ\kappa$ can be treated without any reference to ${\in}_{\Delta}ʻ\kappa$ whenever $\kappa\in \text{Cls}^{2} \text{excl}$ .

*115·12. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \text{Prod}ʻ\kappa \in \Pi \text{Nc}ʻ\kappa . \text{Prod}ʻ\kappa \text{ sm } {\in}_{\Delta}ʻ\kappa \quad[*84·41]$

It is this proposition that makes the notation $\text{Prod}ʻ\kappa$ appropriate for the multiplicative class.

*115·13. $\vdash : \alpha \cap \beta = \Lambda . \supset . \text{Prod}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) \text{ sm } (\alpha \times \beta ) \quad[*113·152]$

*115·131. $\vdash : \alpha \neq \beta . \supset . \text{Prod}ʻ(\iota ʻ\alpha \cup \iota ʻ\beta ) = Cʻʻ(\alpha \times \beta ) \quad[*113·151]$

*115·14. $\begin{align}\vdash \colon\ldotp &\kappa \cap \lambda = \Lambda . \lor . sʻ\kappa \cap sʻ\lambda = \Lambda : \supset :\\ &\varpi \in \text{Prod}ʻ(\kappa \cup \lambda ) . \equiv . (\exists \rho , \sigma ) . \rho \in \text{Prod}ʻ\kappa . \sigma \in \text{Prod}ʻ\lambda . \varpi = \rho \cup \sigma\\ &[*83·64·641]\end{align}$

*115·141. $\vdash : \exists ! \text{Prod}ʻ\kappa . \supset . sʻ\text{Prod}ʻ\kappa = sʻ\kappa \quad[*83·66]$

*115·142. $\vdash . \text{Prod}ʻ\iota ʻ\alpha = \iotaʻʻ\alpha \quad[*83·7]$

*115·143. $\vdash . \text{Prod}ʻ\iotaʻʻ\alpha = \iota ʻ\alpha \quad[*83·71]$

*115·144. $\vdash : \kappa \subset 1 . \supset . \text{Prod}ʻ\kappa = \iota ʻsʻ\kappa \quad[*83·72]$

*115·145. $\begin{align}&\vdash \colon\ldotp \kappa \in \text{Cls}^{2} \text{excl} . \alpha \in \kappa . \mu \cap \alpha \in 1 . \supset : \mu - \alpha \in \text{Prod}ʻ(\kappa - \iota ʻ\alpha ) . \equiv . \mu \in \text{Prod}ʻ\kappa\\ &[*84·422]\end{align}$

*115·15. $\begin{align}&\vdash \colon\ldotp \kappa , \lambda \in \text{Cls}^{2} \text{excl} . sʻ\kappa = sʻ\lambda . \supset : \kappa \subset \text{Prod}ʻ\lambda . \equiv . \lambda \subset \text{Prod}ʻ\kappa \\ &[*84·43]\end{align}$

*115·151. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . {\in}_{\Delta}ʻsʻ\kappa = \dot{s}ʻʻ\text{Prod}ʻ{\in}_{\Delta}ʻʻ\kappa \quad[*85·28]$

*115·152. $\vdash . P_{\Delta }ʻ\alpha \text{ sm } \text{Prod}ʻP \unicode{x21A7}ʻʻ\alpha \quad[*85·55]$

*115·153. $\vdash . {\in}_{\Delta}ʻ\kappa \text{ sm } \text{Prod}ʻ\in \unicode{x21A7}ʻʻ\kappa \quad[*115·152]$

*115·154. $\vdash . \text{Prod}ʻ\in \unicode{x21A7}ʻʻ\kappa \in \Pi \text{Nc}ʻ\kappa \quad[*115·153]$

*115·16. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \text{Prod}ʻ\kappa \subset \text{Nc}ʻ\kappa \quad[*100·64]$

The following proposition is used in the theory of well-ordered series (*250·5).

*115·17. $\vdash : \exists ! {\in}_{\Delta}ʻ\text{Cl ex}ʻ\alpha . \supset . \text{Prod}ʻ\text{Cl ex}ʻ\alpha = \iota ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *80·14 . *115·1 . *37·45 . &\supset \vdash : \text{Hp} . \supset . \exists ! \text{Prod}ʻ\text{Cl ex}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *60·61 . \text{Fact} . \supset \\ \vdash \colon\ldotp R \in 1 \rightarrow \text{Cls}. R \,\unicode{x2abd}\, \in . \text{ᗡ}ʻR = \text{Cl ex}ʻ\alpha . &\supset : R \in 1 \rightarrow \text{Cls} . R \,\unicode{x2abd}\, \in . \iotaʻʻ\alpha \subset \text{ᗡ}ʻR :\\ [*51·15] &\supset : x \in \alpha . \supset _{x} . xR(\iota ʻx) :\\ [*33·14] &\supset : \alpha \subset \text{D}ʻR &\qquad \text{(2)}\\ \vdash . *83·21 . \supset \vdash : \text{Hp} (2) . &\supset . \text{D}ʻR \subset sʻ\text{Cl ex}ʻ\alpha .\\ [*60·501] &\supset . \text{D}ʻR \subset \alpha &\qquad \text{(3)}\\ \vdash . (2) . (3) . &\supset \vdash : R \in 1 \rightarrow \text{Cls}. R \,\unicode{x2abd}\, \in . \text{ᗡ}ʻR = \text{Cl ex}ʻ\alpha . \supset . \text{D}ʻR = \alpha &\qquad \text{(4)}\\ \vdash . (4) . *115·1 . *80·14 . &\supset \vdash . \text{Prod}ʻ\text{Cl ex}ʻ\alpha \subset \iota ʻ\alpha &\qquad \text{(5)}\\ \vdash . (1) . (5) . *51·4 . \supset \vdash . \text{Prop} \end{array}$

*115·2. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}. \equiv .\kappa ,sʻ\kappa \in \text{Cls}^{2} \text{excl} \quad[(*115·02)]$

*115·21. $\begin{align}\vdash \colon\ldotp \kappa \in \text{Cls}^{3}\,\text{arithm}. \equiv :&\alpha ,\beta \in \kappa .\exists !\alpha \cap \beta .\supset _{\alpha ,\beta }.\alpha = \beta :\\ &\alpha ,\beta \in \kappa .\rho \in \alpha .\sigma \in \beta .\exists !\rho \cap \sigma .\supset _{\alpha ,\beta ,\rho ,\sigma }.\rho = \sigma \\ [*115·2.*84·11]\end{align}$

*115·211. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\alpha ,\beta \in \kappa .\rho \in \alpha .\sigma \in \beta .\exists !\rho \cap \sigma .\supset .\alpha = \beta$

Dem. $\begin{array}{l} \vdash .*115·21 .\supset \vdash :\text{Hp}.&\supset .\rho = \sigma .\rho \in \alpha .\sigma \in \beta .\\ [*13·13] &\supset .\rho \in \alpha \cap \beta .\\ [*115·21] &\supset .\alpha = \beta :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*40·11. \supset \vdash :\exists !sʻ\alpha \cap sʻ\beta . &\equiv .(\exists x,\rho ,\sigma ).\rho \in \alpha .\sigma \in \beta .x\in \rho .x\in \sigma .\\ [*10·35] &\equiv .(\exists \rho ,\sigma ).\rho \in \alpha .\sigma \in \beta .\exists !\rho \cap \sigma &\qquad \text{(1)}\\ \vdash .(1).*115·211.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\beta \in \kappa .\exists !sʻ\alpha \cap sʻ\beta .\supset .\alpha = \beta . &\qquad \text{(2)}\\ [*30·37] &\supset .sʻ\alpha = sʻ\beta &\qquad \text{(3)}\\ \vdash .(2).(3).*84·11.\supset \vdash .\text{Prop} \end{array}$

Observe that, although " $sʻʻ\kappa \in \text{Cls}^{2} \text{excl}$ " follows from $\unicode{x201c}\alpha ,\beta \in \kappa .\exists !sʻ\alpha \cap sʻ\beta .\supset _{\alpha ,\beta }.\alpha = \beta ,\unicode{x201d}$ the converse implication does not hold. If there were two different classes $\alpha$ and $\beta$ having the same sum, we might have $\exists !sʻ\alpha \cap sʻ\beta$ , i.e. $\exists !sʻ\alpha$ , without having $\alpha = \beta$ , in spite of " $sʻʻ\kappa \in\text{Cls}^{2} \text{excl}$ ." In proofs, less use can be made of " $sʻʻ\kappa \in \text{Cls}^{2} \text{excl}$ " than of " $\alpha ,\beta \in \kappa .\exists !sʻ\alpha \cap sʻ\beta.\supset_{\alpha,\beta }.\alpha = \beta$ ." If $\Lambda {\sim} \in\kappa$ or $\iota ʻ\Lambda {\sim} \in \kappa$ , the latter implies $s\upharpoonright \kappa \in 1\rightarrow 1$ .

*115·23. $\begin{align}\vdash \colon\ldotp \kappa \in &\text{Cls}^{3}\,\text{arithm}.\supset :\\ &\text{Prod}ʻʻ\kappa \in \text{Cls}^{2} \text{excl}:\alpha ,\beta \in \kappa .\exists !\text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\supset _{\alpha ,\beta }.\alpha = \beta\end{align}$

Dem. $\begin{array}{l} \vdash .*83·62. &\supset \vdash :\varpi \in \text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\supset .\varpi \subset sʻ\alpha \cap sʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*24·58. &\supset \vdash :\varpi \in \text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\exists !\varpi .\supset .\exists !sʻ\alpha \cap sʻ\beta &\qquad \text{(2)}\\ \vdash .(2).*115·22. &\supset \vdash :\text{Hp}.\alpha ,\beta \in \kappa .\varpi \in \text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\exists !\varpi .\supset .\alpha = \beta &\qquad \text{(3)}\\ \vdash .*83·16. \text{Transp}.&\supset \vdash :\Lambda \in \text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\supset .\alpha = \Lambda .\beta = \Lambda &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\beta \in \kappa .\exists !\text{Prod}ʻ\alpha \cap \text{Prod}ʻ\beta .\supset .\alpha = \beta . &\qquad \text{(5)}\\ [*30·37] &\supset .\text{Prod}ʻ\alpha = \text{Prod}ʻ\beta &\qquad \text{(6)}\\ \vdash .(5).(6).*84·11.\supset \vdash .\text{Prop} \end{array}$

*115·24. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}. \equiv .\in \upharpoonright \kappa ,\in \upharpoonright sʻ\kappa \in \text{Cls}\rightarrow 1 \quad[*115·2.*84·14]$

*115·25. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .{\in}_{\Delta}ʻ\kappa \subset 1\rightarrow 1.{\in}_{\Delta}ʻsʻ\kappa \subset 1\rightarrow 1 \quad[*84·3.*115·2]$

*115·26. $\begin{align}\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.&\supset .\\ &{\in}_{\Delta}ʻsʻʻ\kappa \subset 1\rightarrow 1.{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa \subset 1\rightarrow 1.{\in}_{\Delta}ʻ\text{Prod}ʻʻ\kappa \subset 1\rightarrow 1\\ &[*84·3.*115·22.*84·55.*115·23]\end{align}$

In the above proposition, ${\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa\subset 1\rightarrow 1$ does not require the hypothesis $\kappa\in \text{Cls}^{3}\,\text{arithm}$ , being true always. It is merely included here for convenience of reference.

*115·27. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\kappa \subset \text{Cls}^{2} \text{excl} \quad[*115·2.*84·25.*40·13]$

We have now to prove the associative law for " $\text{Prod}$ ," i.e. $\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻsʻ\kappa \text{ sm } \text{Prod}ʻ\text{Prod}ʻʻ\kappa .$

In virtue of *115·12, we have only to prove (under the hypothesis) ${\in}_{\Delta}ʻsʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\text{Prod}ʻʻ\kappa$ which, by *85·44, will follow from ${\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa \text{ sm }{\in}_{\Delta}ʻ\text{Prod}ʻʻ\kappa$ which, by *114·52, will follow from ${\in}_{\Delta}ʻʻ\kappa \text{ sm }\text{ sm }\text{Prod}ʻʻ\kappa .$

Thus the correlator which will give our proposition will be $\text{D}\upharpoonright sʻ{\in}_{\Delta}ʻʻ\kappa$ . We have only to prove that this is a $1\rightarrow 1$ , and the rest follows.

*115·3. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.R,S\in sʻ{\in}_{\Delta}ʻʻ\kappa .\text{D}ʻR = \text{D}ʻS.\supset .R = S$

Dem. $\begin{array}{l} \vdash . *115·23. \supset \vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\alpha ,\beta \in \kappa .R\in {\in}_{\Delta}ʻ\alpha .S\in {\in}_{\Delta}ʻ\beta .\text{D}ʻR = \text{D}ʻS.\supset .\alpha = \beta &\qquad \text{(1)}\\ \vdash .*115·27.*84·4. \supset \vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\alpha \in \kappa .R,S\in {\in}_{\Delta}ʻ\alpha .\text{D}ʻR = \text{D}ʻS.\supset .R = S &\qquad \text{(2)}\\ \vdash . (1) .(2).\supset \vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\alpha ,\beta \in \kappa .R\in {\in}_{\Delta}ʻ\alpha .S\in {\in}_{\Delta}ʻ\beta .\text{D}ʻR = \text{D}ʻS.\supset .R = S &\qquad \text{(3)}\\ \vdash .(3).*10·11·23·35.*40·11.\supset \vdash .\text{Prop} \end{array}$

*115·31. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻʻ\kappa \text{ sm }\text{ sm }{\in}_{\Delta}ʻʻ\kappa$

Dem. $\begin{array}{l} \vdash .*115·3.*71·55.*72·13.&\supset \vdash :\text{Hp}.\supset .\text{D}\upharpoonright sʻ{\in}_{\Delta}ʻʻ\kappa \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash . *33·431. &\supset \vdash .sʻ{\in}_{\Delta}ʻʻ\kappa \subset \text{ᗡ}ʻ\text{D} &\qquad \text{(2)}\\ \vdash .*37·11.*115·1. &\supset \vdash .\text{Prod}ʻʻ\kappa = \text{D}_{\in}ʻʻ{\in}_{\Delta}ʻʻ\kappa &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*111·402. &\supset \vdash .\text{Prop} \end{array}$

*115·32. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .{\in}_{\Delta}ʻ\text{Prod}ʻʻ\kappa \text{ sm }{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa \quad[*115·31.*114·52]$

*115·33. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .{\in}_{\Delta}ʻ\text{Prod}ʻʻ\kappa \text{ sm }{\in}_{\Delta}ʻsʻ\kappa \quad[*115·32. *85·44]$

*115·34. $\begin{align}&\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}ʻʻ\kappa \text{ sm }\text{Prod}ʻsʻ\kappa .\text{Prod}ʻsʻ\kappa \text{ sm }{\in}_{\Delta}ʻsʻ\kappa\\ &[*115·33·12·23]\end{align}$

*115·35. $\begin{align}&\vdash : \kappa \in \text{Cls}^{3}\,\text{arithm} . \supset .\\ &\text{Nc}ʻ\text{Prod}ʻ\text{Prod}ʻʻ\kappa = \text{Nc}ʻ\text{Prod}ʻsʻ\kappa = \Pi \text{Nc}ʻ\text{Prod}ʻʻ\kappa = \Pi \text{Nc}ʻ{\in}_{\Delta}ʻʻ\kappa = \Pi \text{Nc}ʻsʻk\\ &[*115·34·33·32]\end{align}$

In connection with $\text{Prod}ʻsʻ\kappa$ and $\text{Prod}ʻ\text{Prod}ʻʻ\kappa$ , there remain two propositions of sufficient interest to deserve proof, namely $\kappa \in \text{Cls}^{3}\,\text{arithm} . \supset . \text{Prod}ʻsʻ\kappa = sʻʻ\text{Prod}ʻ\text{Prod}ʻʻ\kappa$ and $\kappa \in \text{Cls}^{3}\,\text{arithm} . \supset . \text{Prod}ʻ\text{Prod}ʻʻ\kappa = \text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa$

Of these, the first is deduced from the second, while the second is proved by means of *114·51, putting $\text{D}$ for the $T$ which appears in that proposition, and ${\in}_{\Delta}ʻʻ\kappa$ for the $\lambda$ of that proposition.

*115·4. $\vdash : T \upharpoonright sʻ\lambda \in 1 \rightarrow 1 . sʻ\lambda \subset \text{ᗡ}ʻT . \supset . \text{Prod}ʻTʻʻʻ\lambda = Tʻʻʻ\text{Prod}ʻ\lambda$

Dem. $\begin{array}{l} \vdash . *111·14 . *37·103 . \supset \vdash : \text{Hp} . \kappa = Tʻʻʻ\lambda . &\supset . T \upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\\ [*114·51 . *73·142] &\supset . {\in}_{\Delta}ʻ\kappa = (T \parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &\qquad \text{(1)}\\ \vdash . (1) . *115·1 . &\supset \vdash : \text{Hp} . \supset . \text{Prod}ʻTʻʻʻ\lambda = \text{D}ʻʻ(T \parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &\qquad \text{(2)}\\ \vdash . *37·321·231 . \supset \vdash . \text{D}ʻ(T \mid R \mid \breve{T} _{\in }) &= \text{D}ʻ(T \mid R)\\ [*37·32] &= Tʻʻ\text{D}ʻR &\qquad \text{(3)}\\ \vdash . (3) . *43·112 . \supset \vdash . \text{D}ʻʻ(T \parallel \breve{T} _{\in })ʻʻ{\in}_{\Delta}ʻ\lambda &= Tʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\lambda \\ [*115·1] &= Tʻʻʻ\text{Prod}ʻ\lambda &\qquad \text{(4)}\\ \vdash . (2) . (4) . \supset \vdash . \text{Prop} \end{array}$

*115·41. $\begin{align}&\vdash \colon\ldotp R, S \in sʻ\lambda . \text{D}ʻR = \text{D}ʻS . \supset _{R, S} . R = S : \supset . \text{Prod}ʻ\text{D}ʻʻʻ\lambda = \text{D}ʻʻʻ\text{Prod}ʻ\lambda \\ &\left[*115·4 \frac{\text{D}}{T}. *71·55 . *72·13\right]\end{align}$

*115·42. $\begin{align}\vdash : \kappa \in \text{Cls}^{3}\,\text{arithm} . \supset . \text{Prod}ʻ\text{Prod}ʻʻ\kappa &= \text{D}ʻʻʻ\text{Prod}ʻ{\in}_{\Delta}ʻʻ\kappa\\ &= \text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash . *115·1 . &\supset \vdash . \text{Prod}ʻ\text{Prod}ʻʻ\kappa = \text{Prod}ʻ\text{D}ʻʻʻ{\in}_{\Delta}ʻʻ\kappa &\qquad \text{(1)}\\ \vdash . *115·3·41 . \supset \vdash : \text{Hp} . \supset . \text{Prod}ʻ\text{D}ʻʻʻ{\in}_{\Delta}ʻʻ\kappa & = \text{D}ʻʻʻ\text{Prod}ʻ{\in}_{\Delta}ʻʻ\kappa &\qquad \text{(2)}\\ [*115·1] &= \text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

*115·43. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \text{Prod}ʻsʻ\kappa = sʻʻ\text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa$

Dem. $\begin{array}{l} \vdash . *115·1 . *85·28 . \supset \\ \vdash : \text{Hp} . \supset . \text{Prod}ʻsʻ\kappa &= \text{D}ʻʻ\dot{s} ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa \\ [*41·43] &= sʻʻ\text{D}ʻʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa : \supset \vdash . \text{Prop} \end{array}$

*115·44. $\vdash : \kappa \in \text{Cls}^{3}\,\text{arithm} . \supset . \text{Prod}ʻsʻ\kappa = sʻʻ\text{Prod}ʻ\text{Prod}ʻʻ\kappa \quad[*115·43·42]$

*115·45. $\begin{align}\vdash \colon\ldotp \alpha ,\beta \in \kappa .\exists !&sʻ\alpha \cap sʻ\beta .\supset _{\alpha ,\beta }.\alpha =\beta :\supset .\\ &(s\mid \text{D})\upharpoonright {\in}_{\Delta}ʻ\kappa \in 1\rightarrow 1.s\upharpoonright \text{Prod}ʻ\kappa \in 1\rightarrow 1\end{align}$

Dem. $\begin{array}{l} \vdash .*83·2.*40·13.&\supset \vdash :R\in {\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset .Rʻ\alpha \subset sʻ\alpha &\qquad \text{(1)}\\ \vdash .*83·2.*33·43.&\supset \vdash :R\in {\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset .Rʻ\alpha \subset sʻ\text{D}ʻR &\qquad \text{(2)}\\ \vdash .*83·23.\supset \\ \vdash :R\in {\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .x\in (sʻ\text{D}ʻR\cap sʻ\alpha).&\supset .(\exists \beta ).\beta \in \kappa .x\in Rʻ\beta .x\in sʻ\alpha .\\ [(1)] &\supset .(\exists \beta ).\beta \in \kappa .x\in Rʻ\beta .x\in sʻ\beta . x\in sʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).\supset \vdash \colon\ldotp \text{Hp}.R\in {\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset :x\in (sʻ\text{D}ʻR\cap sʻ\alpha ).&\supset .(\exists \beta ).x\in Rʻ\beta .\beta =\alpha . [*13·195] \supset .x\in Rʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).(2).(4).&\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in {\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset .Rʻ\alpha =sʻ\text{D}ʻR\cap sʻ\alpha &\qquad \text{(5)}\\ \vdash .(5).\supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp R,S\in {\in}_{\Delta}ʻ\kappa .sʻ\text{D}ʻR=sʻ\text{D}ʻS.\supset :\alpha \in \kappa .\supset _{\alpha }.Rʻ\alpha =Sʻ\alpha :\\ [*33·45.*80·14] &\supset :R=S\colon\ldotp &\qquad \text{(6)}\\ [*71·55.*72·13·161]&\supset \colon\ldotp (s\mid \text{D})\upharpoonright {\in}_{\Delta}ʻ\kappa \in 1\rightarrow 1 &\qquad \text{(7)}\\ \vdash .(6).*37·63.*115·1.*30·37.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\mu ,\nu \in \text{Prod}ʻ\kappa .sʻ\mu = sʻ\nu .\supset .\mu =\nu :\\ [*71·55.*72·161] &\supset :s\upharpoonright \text{Prod}ʻ\kappa \in 1\rightarrow 1 &\qquad \text{(8)}\\ \vdash .(7).(8).\supset \vdash .\text{Prop} \end{array}$

*115·46. $\vdash :\kappa \in \text{Cls}^{3}\,\text{arithm}.\supset .s\upharpoonright \text{Prod}ʻ\text{Prod}ʻʻ\kappa \in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*115·141.\supset \\ \vdash :\alpha ,\beta \in \kappa .\exists !sʻ\text{Prod}ʻ\alpha \cap sʻ\text{Prod}ʻ\beta .\supset .\exists !sʻ\alpha \cap sʻ\beta &&\qquad \text{(1)}\\ \vdash .(1).*115·22.\supset \\ \vdash \colon\ldotp \kappa \in \text{Cls}^{3}\,\text{arithm}.\supset :\alpha ,\beta \in \kappa .\exists !sʻ\text{Prod}ʻ\alpha \cap sʻ\text{Prod}ʻ\beta .&\supset .\alpha =\beta .\\ [*30·37] &\supset .\text{Prod}ʻ\alpha =\text{Prod}ʻ\beta :\\ [*37·63] \supset :\mu ,\nu \in \text{Prod}ʻʻ\kappa .\exists !sʻ\mu \cap sʻ\nu .\supset . \mu =\nu :\\ [*115·45] \supset :s\upharpoonright \text{Prod}ʻ\text{Prod}ʻʻ\kappa \in 1\rightarrow 1\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The above proposition is used in dealing with products in relation-arithmetic (*174·42).

*115·5. $\vdash :T\upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .\text{Prod}ʻ\kappa =T_{\in }ʻʻ\text{Prod}ʻ\lambda \quad[*115·4.*111·14]$

*115·501. $\begin{align}&\vdash :T\upharpoonright sʻ\lambda \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\exists !\text{Prod}ʻ\lambda .\supset .T\upharpoonright sʻ\lambda \in (\text{Prod}ʻ\kappa )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\text{Prod}ʻ\lambda )\\ &[*115·5·141.*111·14]\end{align}$

Dem. $\begin{array}{l} \vdash .*35·75.\supset \vdash :{\sim}\exists !\text{Prod}ʻ\lambda .\supset .T\upharpoonright sʻ\text{Prod}ʻ\lambda =\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*115·5.*37·29.\supset \vdash :\text{Hp}.{\sim}\exists !\text{Prod}ʻ\lambda .\supset .\text{Prod}ʻ\kappa =\Lambda .\\ [*37·29.*40·21] \supset .sʻ\text{Prod}ʻ\kappa =(T\upharpoonright sʻ\text{Prod}ʻ\lambda )ʻʻsʻ\text{Prod}ʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).*72·1.(2).*115·5.*111·1.\supset \\ \qquad\qquad\vdash :\text{Hp}.{\sim}\exists !\text{Prod}ʻ\lambda .\supset .T\upharpoonright sʻ\text{Prod}ʻ\lambda \in (\text{Prod}ʻ\kappa )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\text{Prod}ʻ\lambda ) &\qquad \text{(3)}\\ \vdash .(3).*115·501·141.\supset \vdash .\text{Prop} \end{array}$

*115·51. $\vdash : \kappa \text{ sm } \text{ sm } \lambda . \supset . \text{Prod}ʻ\kappa \text{ sm } \text{ sm } \text{Prod}ʻ\lambda \quad[*115·502]$

The above propositions show how, in certain respects, $\text{Prod}ʻ\kappa$ is more convenient than ${\in}_{\Delta}ʻ\kappa$ . We cannot have ${\in}_{\Delta}ʻ\kappa\text{ sm } \text{ sm } {\in}_{\Delta}ʻ\lambda$ , because ${\in}_{\Delta}ʻ\kappa$ is a class of relations, not a class of classes; and the correlator of ${\in}_{\Delta}ʻ\kappa$ and ${\in}_{\Delta}ʻ\lambda$ is by no means so simple a function of the correlator of $\kappa$ and $\lambda$ as $T_{\in } \upharpoonright\text{Prod}ʻ\lambda$ , which correlates $\text{Prod}ʻ\kappa$ and $\text{Prod}ʻ\lambda$ , in virtue of *115·502.

*115·6. $\begin{align}\vdash : &(Rʻʻ\gamma ) \upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Rʻʻ\gamma , Sʻʻ\gamma \in \text{Cls}^{2} \text{excl} . \supset .\\ &\text{Prod}ʻRʻʻ\gamma \times \text{Prod}ʻSʻʻ\gamma \text{ sm } {\in}_{\Delta}ʻ\hat{\mu} \{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\}\end{align}$

Dem. $\begin{array}{l} \vdash . *115·12 . *113·13 . \supset \\ \vdash : \text{Hp} . \supset . \text{Prod}ʻRʻʻ\gamma \times \text{Prod}ʻSʻʻ\gamma \text{ sm } {\in}_{\Delta}ʻRʻʻ\gamma \times {\in}_{\Delta}ʻSʻʻ\gamma &\qquad \text{(1)}\\ \vdash . (1) . *114·64 . \supset \vdash . \text{Prop} \end{array}$

*115·601. $\begin{align}\vdash : (Rʻʻ\gamma ) &\upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Rʻʻ\gamma \in \text{Cls}^{2} \text{excl} . \supset .\\ &\hat{\mu} \{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\} \in \text{Cls}^{2} \text{excl}\end{align}$

Dem. $\begin{array}{l} \vdash . *113·19 . \supset \vdash \colon\ldotp \text{Hp} . \supset :\\ z, w \in \gamma . \exists ! (Rʻz \times Sʻz) \cap (Rʻw \times Sʻw) . &\supset . \exists ! Rʻz \cap Rʻw .\\ [*84·11] &\supset . Rʻz = Rʻw .\\ [*74·53 . *30·37] &\supset . z = w .\\ [*30·37] &\supset . Rʻz \times Sʻz = Rʻw \times Sʻw &\qquad \text{(1)}\\ \vdash . (1) . *84·11 . \supset \vdash . \text{Prop} \end{array}$

*115·602. $\begin{align}\vdash : &(Rʻʻ\gamma ) \upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Sʻʻ\gamma \in \text{Cls}^{2} \text{excl} . \supset .\\ &\hat{\mu} \{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\} \in \text{Cls}^{2} \text{excl}\\ &[\text{Proof as in *115·601}]\end{align}$

*115·61. $\begin{align}\vdash \colon\ldotp &(Rʻʻ\gamma ) \upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Rʻʻ\gamma \cap Sʻʻ\gamma = \Lambda :\\ &Rʻʻ\gamma \in \text{Cls}^{2} \text{excl} . \lor . Sʻʻ\gamma \in \text{Cls}^{2} \text{excl} : \supset .\\ &{\in}_{\Delta}ʻ(Rʻʻ\gamma \cup Sʻʻ\gamma ) \text{ sm } \text{Prod}ʻ\hat{\mu} \{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\}\\ &[*115·601·602·12 . *114·65]\end{align}$

*115·62. $\begin{align}\vdash : &(Rʻʻ\gamma ) \upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Rʻʻ\gamma \cap Sʻʻ\gamma = \Lambda .\\ &(Rʻʻ\gamma \cup Sʻʻ\gamma ) \in \text{Cls}^{2} \text{excl} . \supset .\\ &\text{Prod}ʻ(Rʻʻ\gamma \cup Sʻʻ\gamma ) \text{ sm } \text{Prod}ʻ\hat{\mu} \{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\}\\ &[*115·61·12 . *84·25]\end{align}$

*115·63. $\begin{align}&\vdash : (Rʻʻ\gamma ) \upharpoonleft R, S \upharpoonright \gamma \in 1 \rightarrow 1 . \gamma \subset \text{ᗡ}ʻR . \gamma \subset \text{ᗡ}ʻS . Rʻʻ\gamma , Sʻʻ\gamma \in \text{Cls}^{2} \text{excl} . \supset .\\ &\text{Prod}ʻRʻʻ\gamma \times \text{Prod}ʻSʻʻ\gamma \text{ sm } \text{Prod}ʻ\hat{\mu}\{(\exists z) . z \in \gamma . \mu = Rʻz \times Sʻz\}\\ &[*115·6·601·12]\end{align}$

In this number, we define " $\alpha\, \,\text{exp}\,\, \beta$ ," meaning " $\alpha$ to the exponent $\beta$ ," where $\alpha$ and $\beta$ are classes, as $\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta .$ Now $\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta$ consists of all ways of selecting one each from the members of $\alpha\downarrow_{,,}ʻʻ\beta$ , i.e. from the classes $\downarrow yʻʻ\alpha$ , where $y\in \beta$ . Thus to get a member of $\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta$ , take a set of couples $x\downarrow y$ , where $x$ is always an $\alpha$ , and there is only one $x$ for a given $y$ , and $y$ is each member of $\beta$ in succession. Thus for each member of $\beta$ , we have $\text{Nc}ʻ\alpha$ possible referents; hence it is plain that the number of possible sets of couples consists of $\text{Nc}ʻ\beta$ factors each equal to $\text{Nc}ʻ\alpha$ , and is therefore fit to be taken as defining $(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\beta}$ .

The definitions of $\mu ^\nu$ and $(\text{Nc}ʻ\alpha)^{\text{Nc}ʻ\beta}$ are derived from the definition of $\alpha \,\,\text{exp}\,\, \beta$ exactly as the definitions of $\mu +_{c} \nu$ and $\text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\beta$ , or of $\mu \times_{c} \nu$ and $\text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\beta$ , were derived respectively from $\alpha + \beta$ and $\alpha \times\beta$ .

The chief difficulty in this number lies in the proof of the three formal laws of exponentiation, namely $\begin{aligned} \mu ^\nu \times _{c} \mu ^{\varpi } &= \mu ^{\nu +_{c} \varpi },\\ \mu ^{\varpi } \times _{c} \nu ^{\varpi } &= (\mu \times _{c} \nu )^{\varpi },\\ \text{and}\qquad (\mu ^\nu )^{\varpi } &= \mu ^{\nu \times _{c} \varpi }. \end{aligned}$ The proofs of the second and third of these, in particular, require various lemmas; but there is no difficulty involved except the complexity of the classes and relations concerned.

The definition of $\mu ^\nu$ is so framed as to minimize the necessity for the multiplicative axiom (see the note on **113·31 in the introduction to *113). We have

*116·36. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC} - \iota ʻ\Lambda .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Pi \text{Nc}ʻ\kappa = \mu ^\nu$

that is, assuming the multiplicative axiom, the product of $\nu$ factors each equal to $\mu$ is $\mu ^\nu$ (assuming $\mu$ and $\nu$ to be cardinals which are not null).

If we had defined $\mu ^\nu$ as the product of $\nu$ factors each equal to $\mu$ , we should[Pg 144] have required the multiplicative axiom for almost all propositions on $\mu ^\nu$ but by taking the particular class $\alpha \downarrow_{,,}ʻʻ\beta$ , we avoid the multiplicative axiom except in a few propositions. Among these few is the above proposition connecting exponentiation with multiplication.

Cantor has defined $\mu ^\nu$ by means of the class of "Belegungen," i.e. the class $\hat{R} (R\in 1\rightarrow \text{Cls}.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR = \beta )$ which (*116·12) = $(\alpha \uparrow \beta )_{\Delta }ʻ\beta$ . By *85·53 and *113·103, this class is equal to $\dot{s}ʻʻ(\alpha\,\text{exp}\,\,\beta)$ (as is proved in *116·13), whence, since $\dot{s} \upharpoonright \alpha \,\text{exp}\,\, \beta \in 1\rightarrow1$ , it follows (*116·15) that the class of "Belegungen" is similar to $\alpha\, \,\text{exp}\,\, \beta$ . Hence our definition gives the same value of $\mu^\nu$ as Cantor's.

The propositions of the present number begin with various simple properties of $\alpha\, \,\text{exp}\,\, \beta$ . Its existence follows from

*116·152. $\vdash :x\in \alpha .\supset .x\downarrow ʻʻ\beta \in \alpha\, \,\text{exp}\,\, \beta$

whence (*116·16) $\vdash .\text{Cnv}ʻʻʻ\beta \downarrow_{,,}ʻʻ\alpha \subset \alpha\, \,\text{exp}\,\, \beta$ , and

*116·18. $\vdash \colon\ldotp \exists !\alpha .\lor.\beta = \Lambda : \equiv .\exists !\alpha\, \,\text{exp}\,\, \beta$

*116·19. $\vdash :\alpha \text{ sm }\gamma .\beta \text{ sm }\delta .\supset .(\alpha\, \,\text{exp}\,\, \beta)\text{ sm } \text{ sm }(\gamma \, \,\text{exp}\,\, \delta$

in virtue of *113·13 and *115·51. *116·192 shows that, if $R\upharpoonright \gamma$ correlates $\alpha$ with $\gamma$ , and $S\upharpoonright \delta$ correlates $\beta$ with $\delta$ , then $(R\parallel \breve{S})\upharpoonright (\delta \times \gamma)$ is a double correlator of $\alpha\, \,\text{exp}\,\, \beta$ with $(\gamma\,\,\text{exp}\,\, \delta)$ .

We then proceed to a set of propositions on $\mu ^\nu$ which are analogous to *113·2 ff. on $\mu \times _{c }\nu$ . We have

*116·203. $\vdash :\exists !\mu ^\nu .\supset .\mu ,\nu \in \text{NC} - \iota ʻ\Lambda .\mu ,\nu \in \text{N}_{0}\text{C}$

*116·25. $\vdash .(\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta } = \text{Nc}ʻ(\gamma \, \,\text{exp}\,\, \delta)$

*116·311. $\vdash :\nu \in \text{NC} - \iota ʻ\Lambda - \iota ʻ0.\supset .0^\nu = 0$

*116·321. $\vdash :\mu \in \text{NC} - \iota ʻ\Lambda .\supset .\mu ^{1} = \text{ sm }ʻʻ\mu$

(Observe that $\text{ sm }ʻʻ\mu$ is the same cardinal as $\mu$ , but rendered typically ambiguous.)

After the proposition (*116·36) already quoted, on the connection of exponentiation and multiplication, we proceed to a set of propositions on the case where a number of classes are all given as similar (by assignable correlations) to a given class. In *116·411, we prove that if $\kappa$ is a class of mutually exclusive classes, each of which is similar to a given class $\gamma$ , and if, when $\alpha \in\kappa$ , $Mʻ\alpha$ is a correlator of $\alpha$ and $\gamma$ , and $T$ is the sum of $Mʻʻ\kappa$ , then $\text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻT_{\Delta }ʻ\gamma = \text{Nc}ʻ(\kappa \,\text{exp}\,\, \gamma ) = (\text{Nc}ʻ\kappa )^{\text{Nc}ʻ\gamma }.$ This is a further connection of multiplication and exponentiation. (On the purport of this and following propositions, see the explanation preceding *116·4.) In *116·43, the hypothesis is somewhat modified. We still have a set $\kappa$ of classes which are all similar to $\gamma$ , but the correlator for a given class $\alpha$ is not given as $Mʻ\alpha$ , but is given as $Mʻw$ , where $w$ is a member of a class $\delta$ which is similar to $\kappa$ . Then $\kappa =\text{D}ʻʻMʻʻ\delta$ . We assume that $M\upharpoonright \delta$ is a one-one, and that if $Mʻw$ and $Mʻv$ have domains which overlap, then $w = v$ . Thus $\kappa$ is a class of mutually exclusive classes, each of which has $\text{Nc}ʻ\gamma$ terms, while $\kappa$ has $\text{Nc}ʻ\delta$ terms. Then it is proved in *116·43 that $\text{Prod}ʻ\text{D}ʻʻMʻʻ\delta \text{ sm } \text{ sm } (\gamma \,\text{exp}\,\, \delta ).\Pi \text{Nc}ʻ\text{D}ʻʻMʻʻ\delta = (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta }.$ This proposition and another (*116·45) which follows from it are useful in proving the formal laws of exponentiation. The proof of these occupies the following propositions from *116·5 to *116·68. We have

*116·52. $\vdash .\mu ^\nu \times _{c} \mu ^{\varpi } = \mu ^{\nu +_{c} \varpi }$

*116·55. $\vdash .\mu ^{\varpi } x_{c} \nu ^{\varpi } = (\mu \times _{c} \nu )^{\varpi }$

*116·661. $\vdash .\Pi \text{Nc}ʻ(\alpha \,\text{exp}\,)ʻʻ\kappa = (\text{Nc}ʻ\alpha )^{\Sigma \text{Nc}ʻ\kappa }$

Here the number of members of $\kappa$ need not be finite. The purport of the proposition is as follows: Let $\beta$ , $\gamma$ , $\delta$ , ... be the members of $\kappa$ ; form $\alpha\,\,\text{exp}\,\,\beta$ , $\alpha \, \,\text{exp}\,\, \gamma$ , $\alpha \,\,\text{exp}\,\, \delta$ , ..., and take the product of the numbers of all these; then the resulting number is the same as if we first took the sum of the numbers of all the members of $\kappa$ , thus obtaining (say) a number $\mu$ , and raised $\text{Nc}ʻ\alpha$ to the $\mu$ th power.

An extension of *116·55 is given by *116·68, where we prove $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Pi \text{Nc}ʻ\,\text{exp}\,\gamma ʻʻ\kappa = (\Pi \text{Nc}ʻ\kappa )^{\text{Nc}ʻ\gamma }.$

I.e. the number of combinations of $\mu$ things any number at a time is $2^\mu$ . (Observe that $\mu$ need not be finite.) The remainder of the number is concerned with consequences of this proposition.

*116·01. $\alpha \,\text{exp}\,\,\beta = \text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \quad\text{Df}$

*116·02. $\mu ^\nu =\hat{\gamma}\{(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu = \text{N}_{0}\text{c}ʻ\beta .\gamma \text{ sm }(\alpha \,\text{exp}\,\,\beta )\} \quad\text{Df}$

*116·03. $(\text{Nc}ʻ\alpha )^\nu = (\text{N}_{0}\text{c}ʻ\alpha )^\nu \quad\text{Df}$

*116·04. $\mu ^{\text{Nc}ʻ\beta } = \mu ^{\text{N}_{0}\text{c}ʻ\beta } \quad\text{Df}$

*116·1. $\begin{align}&\vdash :\xi \in (\alpha \,\text{exp}\,\, \beta ). \equiv .(\exists R).R\in {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\beta .\xi = \text{D}ʻR\\ &[*115·1.(*116·01)]\end{align}$

*116·11. $\vdash \colon\ldotp \xi \in (\alpha \,\text{exp}\,\, \beta ). \equiv :y\in \beta .\supset _{y}.\alpha \cap \hat{x} (x\downarrow y\in \xi )\in 1:\xi \subset \beta \times \alpha$

Dem. $\begin{array}{l} \vdash .*113·111.*115·11.\supset \\ \vdash \colon\ldotp \xi \in (\alpha \,\text{exp}\,\, \beta ). &\equiv :\rho \in \alpha \downarrow_{,,}ʻʻ\beta .\supset _{\rho }.\rho \cap \xi \in 1:\xi \subset sʻ\alpha \downarrow_{,,}ʻʻ\beta :\\ [*38·2.*113·1] &\equiv :y\in \beta .\supset _{y}.\downarrow yʻʻ\alpha \cap \xi \in 1:\xi \subset \beta \times \alpha &\qquad \text{(1)}\\ \vdash .*37·6.\supset \\ \vdash :\downarrow yʻʻ\alpha \cap \xi \in 1.& \equiv .\hat{R}\{(\exists x).x\in \alpha .R = x\downarrow y.R\in \xi\}\in 1.\\ [*13·193] &\equiv .\hat{R}\{(\exists x).x\in \alpha .x\downarrow y\in \xi .R = x\downarrow y\}\in 1.\\ [*37·6] &\equiv .\downarrow yʻʻ\hat{x} (x\in \alpha .x\downarrow y\in \xi )\in 1.\\ [*73·611·44] &\equiv .\hat{x} (x\in \alpha .x\downarrow y\in \xi )\in 1 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*116·12. $\vdash .(\alpha \uparrow \beta )_{\Delta }ʻ\beta = \hat{R} \{R\in 1\rightarrow \text{Cls}.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR = \beta\}$

Dem. $\begin{array}{l} \vdash .*80·14.\supset \vdash :R\in (\alpha \uparrow \beta )_{\Delta }ʻ\beta . &\equiv .R\in 1\rightarrow \text{Cls}.R\,\unicode{x2abd}\, \alpha \uparrow \beta .\text{ᗡ}ʻR = \beta .\\ [*35·83] &\equiv .R\in 1\rightarrow \text{Cls}.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR\subset \beta .\text{ᗡ}ʻR = \beta .\\ [*22·42] &\equiv .R\in 1\rightarrow \text{Cls}.\text{D}ʻR\subset \alpha .\text{ᗡ}ʻR = \beta :\supset \vdash .\text{Prop} \end{array}$

*116·13. $\vdash .sʻʻ(\alpha \,\text{exp}\,\, \beta ) = (\alpha\uparrow \beta )_{\Delta }ʻ\beta$

Dem. $\begin{array}{l} \vdash .*85·53.\supset \vdash .(\alpha \uparrow \beta )_{\Delta }ʻ\beta &= \dot{s}ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ(\alpha \uparrow \beta )\unicode{x21A7}ʻʻ\beta \\ [*113·103] &= \dot{s}ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\beta \\ [*115·1.(*116·01)] &= \dot{s}ʻʻ(\alpha \,\text{exp}\,\, \beta ).\supset \vdash .\text{Prop} \end{array}$

$(\alpha \uparrow \beta )_{\Delta }ʻ\beta$ is the class of one-many relations whose converse domain is $\beta$ and whose domain is contained in $\alpha$ . This is what Cantor calls the "Belegungsmenge," and is used by him as the definition of exponentiation. In virtue of *116·15, his definition gives the same results as ours.

*116·131. $\vdash .\dot{s} \upharpoonright (\alpha \,\,\text{exp}\,\, \beta )\in \{(\alpha \uparrow \beta )_{\Delta }ʻ\beta\} \,\overline{\text{ sm }}\, (\alpha \,\,\text{exp}\,\, \beta )$

Dem. $\begin{array}{l} \vdash .*84·241.*113·103.&\supset \vdash .\iotaʻʻ\beta \in \text{Cls}^{2} \text{excl} .\alpha \downarrow_{,,}ʻʻ\beta = (\alpha \uparrow \beta )_{\Delta }ʻʻ\iotaʻʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*85·42.&\supset \vdash :M,N\in {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\beta .\dot{s} ʻ\text{D}ʻM = \dot{s} ʻ\text{D}ʻN.\supset .M = N.\\ [*30·37] &\supset .\text{D}ʻM = \text{D}ʻN &\qquad \text{(2)}\\ \vdash .(2).*37·63.*115·1.(*116·01).&\supset \vdash :\mu ,\nu \in (\alpha \,\,\text{exp}\,\, \beta ).\dot{s} ʻ\mu = \dot{s} ʻ\nu .\supset .\mu = \nu :\\ [*71·55.*72·163] &\supset \vdash .\dot{s} \upharpoonright (\alpha \,\,\text{exp}\,\, \beta )\in 1\rightarrow 1 &\qquad \text{(3)}\\ \vdash .(3).*116·13.\supset \vdash .\text{Prop} \end{array}$

*116·14. $\vdash .(\alpha \,\,\text{exp}\,\, \beta )\text{ sm }{\in}_{\Delta} ʻ\alpha \downarrow_{,,}ʻʻ\beta \quad[*115·12.*113·111]$

*116·15. $\vdash .(\alpha \,\,\text{exp}\,\, \beta )\text{ sm }(\alpha \uparrow \beta )_{\Delta }ʻ\beta \quad[*116·131]$

*116·151. $\vdash :x \in \alpha .\supset .x\downarrow \mid \text{Cnv}ʻ(\alpha \downarrow_{,,}\upharpoonright \beta ) \in {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\beta$

Dem. $\begin{array}{l} \vdash .*113·105.*72·184.\supset \vdash :\text{Hp}.&\supset .x\downarrow \mid \text{Cnv}ʻ(\alpha \downarrow_{,,}\upharpoonright \beta ) \in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .*34·1.*38·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :R{x\downarrow \mid \text{Cnv}ʻ(\alpha \downarrow_{,,}\upharpoonright \beta )} \lambda .\equiv .\\ &(\exists y).R=x\downarrow y.y \in \beta . \lambda =\alpha \downarrow_{,,}y.x \in \alpha .\\ [*38·21] &\supset .R \in \lambda &\qquad \text{(2)}\\ \vdash .*37·322·401. &\supset \vdash .\text{ᗡ}ʻ{x\downarrow \mid \text{Cnv}ʻ(\alpha \downarrow_{,,}\upharpoonright \beta )}=\alpha \downarrow_{,,}ʻʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*80·14.\supset \vdash .\text{Prop} \end{array}$

*116·152. $\vdash :x \in \alpha .\supset .x\downarrowʻʻ\beta \in (\alpha \,\,\text{exp}\,\,\beta )$

Dem. $\begin{array}{l} \vdash .*37·32.*35·65.&\supset \vdash .\text{D}ʻ{x\downarrow \mid \text{Cnv}ʻ(\alpha \downarrow_{,,}\upharpoonright \beta )}=x\downarrowʻʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*116·151·1.&\supset \vdash .\text{Prop} \end{array}$

*116·16. $\vdash .\text{Cnv}ʻʻʻ\beta \downarrow_{,,}ʻʻ\alpha \subset \alpha \,\,\text{exp}\,\,\beta$

Dem. $\begin{array}{l} \vdash .*116·152.*55·14.\supset \vdash :x \in \alpha .&\supset .\text{Cnv}ʻʻ\downarrow xʻʻ\beta \in (\alpha \,\,\text{exp}\,\,\beta ).\\ [*38·2] &\supset .\text{Cnv}ʻʻ\beta \downarrow_{,,}x \in (\alpha \,\,\text{exp}\,\,\beta ):\supset \vdash .\text{Prop} \end{array}$

The above propositions are useful in establishing existence-theorems, as appears in the following propositions.

*116·17. $\vdash :\exists !\beta \downarrow_{,,}ʻʻ\alpha .\supset .\exists !\alpha \,\,\text{exp}\,\,\beta \quad[*116·16.*37·47]$

*116·171. $\vdash \colon\ldotp \exists !\alpha .\lor.\beta =\Lambda :\supset .\exists !\alpha \,\,\text{exp}\,\,\beta$

Dem. $\begin{array}{l} \vdash .*113·113.*83·15.*51·161.&\supset \vdash :\beta =\Lambda .\supset .\exists !\alpha \,\,\text{exp}\,\,\beta &\qquad \text{(1)}\\ \vdash .*116·152. &\supset \vdash :\exists !\alpha .\supset .\exists !\alpha \,\,\text{exp}\,\,\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*116·172. $\vdash \colon\ldotp \exists !\alpha \,\,\text{exp}\,\,\beta .\supset :\exists !\alpha .\lor.\beta =\Lambda$

Dem. $\begin{array}{l} \vdash .*83·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\Lambda {\sim}\in \alpha \downarrow_{,,}ʻʻ\beta :\\ [*113·112] &\supset :{\sim}(\alpha =\Lambda .\exists !\beta ):\\ [*24·51] &\supset :\exists !\alpha .\lor.\beta =\Lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*116·18. $\vdash \colon\ldotp \exists !\alpha .\lor.\beta =\Lambda :\equiv .\exists !\alpha \,\,\text{exp}\,\,\beta \quad[*116·171·172]$

Dem. $\begin{array}{l} \vdash .*113·113.\supset \vdash .\alpha \,\,\text{exp}\,\,\Lambda &=\text{Prod}ʻ\Lambda \\ [*83·15.*33·241] &=\iota ʻ\Lambda .\supset \vdash .\text{Prop} \end{array}$

*116·182. $\vdash : \exists ! \beta . \supset . \Lambda \,\,\text{exp}\,\, \beta = \Lambda \quad[*113·112 . *83·11]$

*116·183. $\vdash . sʻ(\alpha \,\,\text{exp}\,\, \beta ) = \beta \times \alpha$

Dem. $\begin{array}{l} \vdash . *115·141 . *116·18 . \supset \vdash \colon\ldotp \exists ! \alpha . \lor . \beta &= \Lambda : \supset . sʻ(\alpha \,\,\text{exp}\,\, \beta ) = sʻ\alpha \downarrow_{,,}ʻʻ\beta \\ [*113·1] &= \beta \times \alpha &\qquad \text{(1)}\\ \vdash . *116·182 . \supset \vdash \colon\ldotp \alpha &= \Lambda . \exists ! \beta . \supset . sʻ(\alpha \,\,\text{exp}\,\, \beta ) = \Lambda \\ [*113·114] &= \beta \times \alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*116·19. $\vdash : \alpha \text{ sm } \gamma . \beta \text{ sm } \delta . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \text{ sm } \text{ sm } (\gamma \,\,\text{exp}\,\, \delta )$

Dem. $\begin{array}{l} \vdash . *113·13 . \supset \vdash : \text{Hp} . &\supset . \alpha \downarrow_{,,}ʻʻ\beta \text{ sm } \text{ sm } \gamma \downarrow_{,,}ʻʻ\delta .\\ [*115·51] &\supset . (\alpha \,\,\text{exp}\,\, \beta ) \text{ sm } \text{ sm } (\gamma \,\,\text{exp}\,\, \delta ) : \supset \vdash . \text{Prop} \end{array}$

*116·191. $\begin{align}\vdash : R \in \alpha \overline{\text{ sm }} \gamma . S \in \beta \,\overline{\text{ sm }}\, \delta . \supset . &(R \parallel \breve{S} ) \upharpoonright (\delta \times \gamma ) \in (\alpha \,\,\text{exp}\,\, \beta ) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \,\,\text{exp}\,\, \delta ) .\\ &(R \parallel \breve{S} )_{\in}ʻʻ(\gamma \,\,\text{exp}\,\, \delta ) = \alpha \,\,\text{exp}\,\, \beta \\ [*113·127 . *115·502 . *116·183]\end{align}$

*116·192. $\begin{align}\vdash : R \upharpoonright \gamma \in \alpha \,\overline{\text{ sm }}\, \gamma . S \upharpoonright \delta \in \beta &\,\overline{\text{ sm }}\, \delta . \supset .\\ &(R \parallel \breve{S} ) \upharpoonright (\delta \times \gamma ) \in (\alpha \,\,\text{exp}\,\, \beta ) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \,\,\text{exp}\,\, \delta ) .\\ &(R \parallel \breve{S} )_{\in } \upharpoonright (\gamma \,\,\text{exp}\,\, \delta ) \in (\alpha \,\,\text{exp}\,\, \beta ) \,\overline{\text{ sm }}\, (\gamma \,\,\text{exp}\,\, \delta )\\ &[*113·127 . *115·502 . *116·183 . *111·15]\end{align}$

*116·194. $\begin{align}\vdash : R \upharpoonright \gamma \in \alpha \,\overline{\text{ sm }}\, \gamma . &S \upharpoonright \delta \in \beta \,\overline{\text{ sm }}\, \delta . \supset .\\ &(R \parallel \breve{S} ) \upharpoonright {(\gamma \uparrow \delta )_{\Delta }ʻ\delta } \in {(\alpha \uparrow \beta )_{\Delta }ʻ\beta } \,\overline{\text{ sm }}\, {(\gamma \uparrow \delta )_{\Delta }ʻ\delta }\end{align}$

Dem. $\begin{array}{l} \vdash . *116·12 . \supset \vdash : \text{Hp}. &\supset .sʻ\text{D}ʻʻ(\gamma \uparrow \delta )_{\Delta }ʻ\delta \subset \gamma . sʻ\text{ᗡ}ʻʻ(\gamma \uparrow \delta )_{\Delta }ʻ\delta \subset \delta .\\ [*74·773 . *73·142] \supset . (R \parallel \breve{S} ) &\upharpoonright {(\gamma \uparrow \delta )_{\Delta }ʻ\delta } \in \\ &\{(R \parallel \breve{S} )ʻʻ(\gamma \uparrow \delta )_{\Delta }ʻ\delta\} \,\overline{\text{ sm }}\, \{(\gamma \uparrow \delta )_{\Delta }ʻ\delta\} &\qquad \text{(1)}\\ \vdash . *116·192 . *111·14 . \supset \vdash : \text{Hp} . &\supset . \alpha \,\,\text{exp}\,\, \beta = (R \parallel \breve{S} )_{\in}ʻʻ(\gamma \,\,\text{exp}\,\, \delta ) .\\ [*116·13] \supset . (\alpha \uparrow \beta )_{\Delta }ʻ\beta &= \dot{s}ʻʻ(R \parallel \breve{S} )_{\in}ʻʻ(\gamma \,\,\text{exp}\,\, \delta )\\ [*43·43] &= (R \parallel \breve{S} )ʻʻ\dot{s}ʻʻ(\gamma \,\,\text{exp}\,\, \delta )\\ [*116·13] &= (R \parallel \breve{S} )ʻʻ(\gamma \uparrow \delta )_{\Delta }ʻ\delta &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

The following propositions (down to *116·27 exclusive) are the analogues of propositions with the same decimal part in *113.

*116·2. $\vdash : \xi \in \mu ^\nu . \equiv . (\exists \alpha , \beta ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \nu = \text{N}_{0}\text{c}ʻ\beta . \xi \text{ sm } (\alpha \,\,\text{exp}\,\, \beta ) \quad[(*116·02)]$

*116·201. $\begin{align}&\vdash \colon\ldotp \xi \in \mu ^\nu . \equiv : \mu , \nu \in \text{NC} : (\exists \alpha , \beta ) . \alpha \in \mu . \beta \in \nu . \xi \text{ sm } (\alpha \,\,\text{exp}\,\, \beta )\\ &[*116·2 . *103·27]\end{align}$

*116·202. $\begin{align}&\vdash \colon\ldotp \xi \in \mu ^\nu . \equiv :\exists !\mu .\exists !\nu :(\exists \alpha ,\beta ).\mu = \text{Nc}ʻ\alpha .\nu = \text{Nc}ʻ\beta .\xi \text{ sm } (\alpha \,\,\text{exp}\,\, \beta )\\ &[\text{Proof as in}\, *113·202]\end{align}$

*116·203. $\vdash :\exists !\mu ^\nu .\supset .\mu ,\nu \in \text{NC}-\iota ʻ\Lambda .\mu ,\nu \in \text{N}_0\text{C} \quad[*116·201·202·2]$

*116·204. $\vdash \colon\ldotp \mu = \Lambda .\lor.\nu = \Lambda .\lor.{\sim}(\mu ,\nu \in \text{NC}):\supset .\mu ^\nu = \Lambda \quad[*116·203]$

*116·205. $\vdash :{\sim}(\mu ,\nu \in \text{N}_0\text{C}).\supset .\mu ^\nu = \Lambda \quad [*116·203]$

*116*21. $\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\xi \in \mu ^\nu . \equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm } (\alpha \,\,\text{exp}\,\, \beta ) \quad[*116·201]$

*116·22. $\begin{align}&\vdash :\xi \in {\text{Nc}(\eta )ʻ\gamma }^{\text{Nc}(\zeta )ʻ^\delta }. \equiv .\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\xi \text{ sm } (\gamma \,\,\text{exp}\,\, \delta )\\ &[\text{Proof as in *113·22, using *116·19 in place of *113·13}]\end{align}$

*116·221. $\begin{align}&\vdash :\exists !\text{Nc}(\eta )ʻ\gamma .\exists !\text{Nc}(\zeta )ʻ\delta .\supset .{\text{Nc}(\eta )ʻ\gamma }^{\text{Nc}(\zeta )ʻ\delta } = \text{Nc}ʻ(\gamma \,\,\text{exp}\,\, \delta )\\ &[*116·22]\end{align}$

*116·222. $\vdash .(\text{N}_0\text{c}ʻ\gamma )^{\text{N}_0\text{c}ʻ\delta } = \text{Nc}ʻ(\gamma \,\,\text{exp}\,\, \delta ) \quad[\text{Proof as in *113·222}]$

*116·24. $\vdash .(\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta } = (\text{N}_0\text{c}ʻ\gamma )^{\text{N}_0\text{c}ʻ\delta } \quad[(*116·03·04)]$

*116·25. $\vdash .(\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta } = \text{Nc}ʻ(\gamma \,\,\text{exp}\,\, \delta ) \quad[*116·24·222]$

*116·251. $\vdash .(\gamma \,\,\text{exp}\,\, \delta )\in (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta } \quad[*116·25.*100·3]$

*116·26. $\begin{align}&\vdash :\mu ,\nu \in \text{NC}.\exists !\text{ sm }_\eta ʻʻ\mu .\exists !\text{ sm }_\zetaʻʻ\nu .\supset .\mu ^\nu = (\text{ sm }_\eta ʻʻ\mu )^{\text{ sm }_\zetaʻʻ\nu }\\ &[\text{Proof as in *113·26}]\end{align}$

This proposition shows that we may raise or lower the types of $\mu$ and $\nu$ as we please, without affecting the value of $\mu ^\nu$ provided $\mu$ and $\nu$ , or rather $\text{ sm }ʻʻ\mu$ and $\text{ sm }ʻʻ\nu$ , exist in the new types.

*116·261. $\vdash :\mu ,\nu \in \text{NC}.\supset .\mu ^\nu = \{\mu ^{(1)}\}^{\nu ^{(1)}} = \{\mu _{(00)}\}^{\nu _{(00)}} = etc. \quad[\text{Proof as in *113·261}]$

Here "etc." covers any derivative of $\mu$ or $\nu$ whose existence follows from that of $\mu$ or $\nu$ .

*116·27. $\begin{align}&\vdash .\mu ^\nu = \hat{\xi} \{(\exists \alpha ,\beta ).\mu = \text{N}_0\text{c}ʻ\alpha .\nu = \text{N}_0\text{c}ʻ\beta .\xi \text{ sm } (\alpha \uparrow \beta )_{\Delta }ʻ\beta\}\\ &[*116·15.*73·37.(*116·02)]\end{align}$

*116·271. $\vdash :\mu ,\nu \in \text{NC}.\alpha \in \mu .\beta \in \nu .\supset .(\alpha \,\,\text{exp}\,\, \beta )\in \mu ^\nu \quad[*116·21]$

Dem. $\begin{array}{l} \vdash .*101·1.*116·25.\supset \vdash .(\text{Nc}ʻ\alpha )^{0} &= \text{Nc}ʻ(\alpha \,\,\text{exp}\,\, \Lambda )\\ [*116·181] &= \text{Nc}ʻ\iota ʻ\Lambda \\ [*101·2] & = 1.\supset \vdash .\text{Prop} \end{array}$

*116·301. $\vdash :\mu \in \text{NC}-\iota ʻ\Lambda .\supset .\mu ^{0} = 1 \quad[\text{Proof as in *113·601}]$

Dem. $\begin{array}{l} \vdash .*101·1.*116·25.&\supset \vdash .0^{\text{Nc}ʻ\beta } = \text{Nc}ʻ(\Lambda \,\,\text{exp}\,\, \beta )\\ [*116·182] \supset \vdash :\text{Hp}.\supset .0^{\text{Nc}ʻ\beta } &= \text{Nc}ʻ\Lambda\\ [*101·1] &= 0:\supset \vdash .\text{Prop} \end{array}$

*116·311. $\vdash :\nu \in \text{NC}-\iota ʻ\Lambda -\iota ʻ0.\supset .0^{\nu }=0$

Dem. $\begin{array}{l} \vdash .*103·34.*101·1.\supset \vdash :\text{Hp}.&\supset .(\exists \beta ).\beta \neq \Lambda .\nu =\text{N}_{0}\text{c}ʻ\beta .\\ [*13·12·15] \supset .(\exists \beta ).\beta \neq \Lambda .0^{\nu }&=0^{\text{N}_{0}\text{c}ʻ\beta }\\ [*116·31.(*116·04)] &=0:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*116·25.*101·2.\supset \vdash .(\text{Nc}ʻ\alpha )^{1}&=\text{Nc}ʻ{\alpha \,\,\text{exp}\,\, (\iota ʻx)}\\ [(*116·01)] &=\text{Nc}ʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\iota ʻx\\ [*115·142.*53·31] &=\text{Nc}ʻ\iota ʻʻ\alpha \downarrow_{,,}x\\ [*113·11.*100·6] &=\text{Nc}ʻ\alpha .\supset \vdash .\text{Prop} \end{array}$

*116·321. $\vdash .\mu \in \text{NC}-\iota ʻ\Lambda .\supset .\mu ^{1}=\text{ sm }ʻʻ\mu \quad[*116·32]$

It would not be an error to write " $\mu ^{1}=\mu$ " instead of " $\mu ^{1}=\text{ sm }ʻʻ\mu$ " in the above proposition. For if the " $\text{ sm }$ " is typically determined so that $\text{sm}ʻʻ\mu \inʻ\mu$ , then $\text{ sm }ʻʻ\mu =\mu$ . Thus in virtue of *116·321, $\mu ^{1}=\mu$ is true whenever it is significant. But the above form gives more information, since it preserves the typical ambiguity of $\mu ^{1}$ and $\text{ sm }ʻʻ\mu$ .

Dem. $\begin{array}{l} \vdash .*113·11. \supset \vdash :\alpha \in 1.&\supset .\alpha \downarrow_{,,}ʻʻ\beta \subset 1.\\ [*115·144.*101·2] &\supset .\text{Nc}ʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta =1 &\qquad \text{(1)}\\ \vdash .(1).*101·2. &\supset \vdash .\text{Nc}ʻ{(\iota ʻx) \,\,\text{exp}\,\, \beta }=1 &\qquad \text{(2)}\\ \vdash .*101·2.*116·25.&\supset \vdash .1^{\text{Nc}ʻ\beta }=\text{Nc}ʻ\{(\iota ʻx) \,\,\text{exp}\,\, \beta\} &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*103·34.\supset \vdash :\text{Hp}.&\supset .(\exists \beta ).\mu =\text{N}_{0}\text{c}ʻ\beta .\\ [*13·12·15] &\supset .(\exists \beta ).1^{\mu }=1^{\text{N}_{0}\text{c}ʻ\beta }.\\ [(*116·04)] &\supset .(\exists \beta ).1^{\mu }=1^{\text{Nc}ʻ\beta }.\\ [*116·33] &\supset .1^{\mu }=1:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*24·1.*101·3.\supset \vdash .\iota ʻ\Lambda \cup \iota ʻ\text{V}\in 2.\\ [*116·222] \supset \vdash :\mu &=\text{N}_{0}\text{c}ʻ\alpha .\supset .\mu ^{2}=\text{Nc}ʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ(\iota ʻ\Lambda \cup \iota ʻ\text{V})\\ [*53·32] &=\text{Nc}ʻ\text{Prod}ʻ(\iota ʻ\alpha \downarrow_{,,}\Lambda \cup \iota ʻ\alpha \downarrow_{,,}\text{V})\\ [*115·13.*55·233.*38·2] &=\text{Nc}ʻ(\alpha \downarrow_{,,}\Lambda \times \alpha \downarrow_{,,}\text{V})\\ [*113·11·25·13] &=\text{Nc}ʻ\alpha \times _{c}\text{Nc}ʻ\alpha \\ [*113·24] &=\mu \times _{c}\mu &\qquad \text{(1)}\\ \vdash .(1).*103·2.&\supset \vdash :\mu \in \text{N}_{0}\text{C}.\supset .\mu ^{2}=\mu \times _{c}\mu &\qquad \text{(2)}\\ \vdash .*116·205. \supset \vdash :\mu {\sim}\in \text{N}_{0}\text{C}.\supset .\mu ^{2}&=\Lambda \\ [*113·205] &=\mu \times _{c}\mu &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·35. $\vdash :\mu ^{\nu }=0.\equiv .\mu =0.\nu \in \text{NC}-\iota ʻ0-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*116·311.&\supset \vdash :\mu =0.\nu \in \text{NC}-\iota ʻ0-\iota ʻ\Lambda .\supset .\mu ^{\nu }=0 &\qquad \text{(1)}\\ \vdash .*101·12. \supset \vdash :\mu ^{\nu }=0.&\supset .\exists !\mu ^{\nu }.\\ [*116·203] &\supset .\mu ,\nu \in \text{NC}-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(2)*116·21.*54·102.&\supset \\ \vdash \colon\ldotp \mu ^{\nu }=0.&\supset :\xi =\Lambda .\equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\xi \text{ sm } (\alpha \,\,\text{exp}\,\, \beta ):\\ [*73·47] &\supset :(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\alpha \,\,\text{exp}\,\, \beta =\Lambda :\\ [*116·18] &\supset :(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\alpha =\Lambda .\beta \neq \Lambda :\\ [*13·195] &\supset :\Lambda \in \mu .\nu \neq \iota ʻ\Lambda .\exists !\nu :\\ [*101·1.*100·45.(2)] &\supset :\mu =0.\nu \in \text{NC}-\iota ʻ\Lambda -\iota ʻ0 &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*116·351. $\begin{align}&\vdash :\mu \in \text{NC}-\iota ʻ\Lambda .\kappa =\Lambda .\nu =0.\supset .\mu ^\nu =\Pi \text{Nc}ʻ\kappa =1\\ &[*116·301.*114·2]\end{align}$

*116·352. $\begin{align}&\vdash :\mu =0.\nu \in \text{NC}-\iota ʻ\Lambda .\kappa \in \nu .\Lambda \in \kappa .\supset .\mu ^\nu =\Pi \text{Nc}ʻ\kappa =0\\ &[*116·311.*114·23]\end{align}$

*116·353. $\vdash :\mu =0.\nu \in \text{NC}-\iota ʻ\Lambda .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\mu ^\nu =\Pi \text{Nc}ʻ\kappa$

Dem. $\begin{array}{l} \vdash .*60·362.*54·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\kappa =\Lambda .\lor.\kappa =\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*100·45.*101·1.\supset \vdash :\text{Hp}.\kappa =\Lambda .&\supset .\nu =0.\\ [*116·351] &\supset .\mu ^\nu =\Pi \text{Nc}ʻ\kappa &\qquad \text{(2)}\\ \vdash .*51·16. &\supset \vdash :\text{Hp}.\kappa =\iota ʻ\Lambda .\supset .\Lambda \in \kappa .\\ [*116·352] &\supset .\mu ^\nu =\Pi \text{Nc}ʻ\kappa &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·36. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}-\iota ʻ\Lambda .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Pi \text{Nc}ʻ\kappa =\mu ^\nu$

Dem. $\begin{array}{l} \vdash .*113·12.*100·45.\supset \vdash :\mu ,\nu \in \text{NC}.\alpha \in \mu .\beta \in \nu .\exists !\alpha .\supset .\alpha \downarrow_{,,}ʻʻ\beta \in \nu \cap \text{Cl}ʻ\mu &\qquad \text{(1)}\\ \vdash .(1).*114·571. \supset \vdash \colon\ldotp \text{Mult ax}.\supset :\\ \mu ,\nu \in \text{NC}.\alpha \in \mu .\beta \in \nu .\exists !\alpha .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Pi \text{Nc}ʻ\kappa =\Pi \text{Nc}ʻ\alpha \downarrow_{,,}ʻʻ\beta \\ [*116·14.*114·1] =\text{Nc}ʻ(\alpha \,\,\text{exp}\,\, \beta )\\ [*116·271] =\mu ^\nu &\qquad \text{(2)}\\ \vdash .(2).\supset \vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NC}-\iota ʻ\Lambda .\exists !\mu -\iota ʻ\Lambda .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Pi \text{Nc}ʻ\kappa =\mu ^\nu &\qquad \text{(3)}\\ \vdash .*51·4.*54·1.\supset \vdash :\mu \in \text{NC}-\iota ʻ\Lambda .{\sim}\exists !\mu -\iota ʻ\Lambda .\supset .\mu =0 &\qquad \text{(4)}\\ \vdash .(4).*116·353.\supset \\ \vdash :\mu ,\nu \in \text{Nc}-\iota ʻ\Lambda .{\sim}\exists !\mu -\iota ʻ\Lambda .\kappa \in \nu \cap \text{Cl}ʻ\mu .\supset .\Pi \text{Nc}ʻ\kappa =\mu ^\nu &\qquad \text{(5)}\\ \vdash .(3).(5).\supset \vdash .\text{Prop} \end{array}$

In the above proposition, " $\nu \in \text{NC}$ " is sufficient hypothesis as to $\nu$ , since " $\nu \neq \Lambda$ " is implied by $\kappa \in \nu \cap \text{Cl}ʻ\mu$ . But $\mu \neq \Lambda$ is essential, since if $\mu = \Lambda$ , $\mu ^\nu = \Lambda$ and $\kappa= \Lambda$ (provided $\nu = 0)$ , whence $\Pi \text{Nc}ʻ\kappa = 1$ .

*116·361. $\vdash \colon\ldotp \text{Mult ax} . \supset : \mu , \nu \in \text{NC} - \iota ʻ\Lambda . \kappa \in \nu \cap \text{Cl excl}ʻ\mu . \supset . \text{Prod}ʻ\kappa \in \mu ^\nu$

Dem. $\begin{array}{l} \vdash . *115·12 . \supset \vdash : \kappa \in \nu \cap \text{Cl excl}ʻ\mu . \supset . \text{Prod}ʻ\kappa \in \Pi \text{Nc}ʻ\kappa &\qquad \text{(1)}\\ \vdash . (1) . *116·36 . \supset \vdash . \text{Prop} \end{array}$

The following propositions, which illustrate certain generalizations of the relations of rows and columns, may be made clearer by the accompanying figure, in which, for the sake of simplicity, all the classes concerned are taken to be finite.

Let $\kappa$ be a set of classes, constituted by four rows of five dots in the figure, which are each given as similar to a given class $\gamma$ , represented by the top row of five dots in the figure, namely the row enclosed in an oval. We assume that an actual correlating relation is given correlating each member of $\kappa$ with $\gamma$ . Let $\lambda$ be the class of these relations, and assume that $\lambda$ consists of one correlator for each member of $\kappa$ , and that $\kappa \in \text{Cls}^{2} \text{excl}$ . Thus $\text{D}ʻʻ\lambda = \kappa$ , and $R \in \lambda . \supset. \text{ᗡ}ʻR = \gamma$ . Put $T = \dot{s} ʻ\lambda$ . Then, if $z\in \gamma$ , $T$ relates to $z$ every member of the column below $z$ , i.e. $\overrightarrow{T}ʻz$ consists of the four dots which are vertically below $z$ ; assuming, what in the circumstances is possible, that each dot is placed below its correlate in $\gamma$ . Thus $\overrightarrow{T}ʻʻ\gamma$ represents the columns, while $\text{D}ʻʻ\lambda$ represents the rows.

We prove, in *116·41, that $\overrightarrow{T}ʻʻ\gamma$ , the class of rows, has double similarity with $\lambda\downarrow_{,,}ʻʻ\gamma$ , or, what comes to the same thing, with $\kappa\downarrow_{,,}ʻʻ\gamma$ . Hence it follows that $Tʻʻ\gamma$ , which is the whole class of dots, is similar to $\gamma\times \lambda$ or $\gamma \times \kappa$ , and that $\text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma$ , which is the product of [Pg 153]the numbers of the columns, is equal to $(\text{Nc}ʻ\lambda)^{\text{Nc}ʻ\gamma}$ or $(\text{Nc}ʻ\kappa )^{\text{Nc}ʻ\gamma}$ . The correlator which is used for proving these propositions is $W$ , where, if $R$ is a member of $\lambda$ and $z$ is a member of $\gamma$ , $W$ correlates $Rʻz$ with $R\downarrow z$ .

Similarly, by correlating $Rʻz$ with $z\downarrow R$ , calling the correlator $U$ , we have $Uʻʻ\downarrow Rʻʻ\gamma =Rʻʻ\gamma$ , i.e. $U_{\in }ʻ\gamma \downarrow_{,,}R=\text{D}ʻR$ , whence $U_{\in }ʻʻ\gamma \downarrow_{,,}ʻʻ\lambda =\text{D}ʻʻ\lambda$ . Hence $\text{D}ʻʻ\lambda$ , i.e. the class of rows, has double similarity with $\gamma \downarrow_{,,}ʻʻ\lambda$ or $\gamma \downarrow_{,,}ʻʻ\kappa$ , whence the product of the numbers of the rows is $(\text{Nc}ʻ\gamma)^{\text{Nc}ʻ\lambda}$ or $(\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\kappa}$ .

Finally, we take a class $\delta$ similar to $\kappa$ or $\lambda$ (illustrated in the figure by the column of dots enclosed in an oval), and calling $M$ a correlator of $\lambda$ and $\delta$ , we replace $\lambda$ by $Mʻʻ\delta$ and $\kappa$ by $\text{D}ʻʻMʻʻ\delta$ . We thus find that, if $M\upharpoonright\delta$ correlates with $\delta$ a class of relations whose domains are mutually exclusive, and which each correlate their domains with a given class $\gamma$ , then $\text{D}ʻʻMʻʻ\delta$ has double similarity with $\gamma \downarrow_{,,}ʻʻ\delta$ , whence the same results as before with $\delta$ in place of $\kappa$ or $\lambda$ .

The following propositions are useful in connecting multiplication with exponentiation, and in proving the formal laws of exponentiation.

*116·4. $\begin{align}\vdash \colon\ldotp \lambda \subset 1&\rightarrow 1:R,S\in \lambda .\exists !\text{D}ʻR\cap \text{D}ʻS.\supset _{R,S}.R=S:\\ &\text{ᗡ}ʻʻ\lambda \subset \iota ʻ\gamma .W=\hat{x} \hat{P} \{(\exists R,z).R\in \lambda .x=Rʻz.P=R\downarrow z\}:\\ &\supset .W\in 1\rightarrow 1.\text{ᗡ}ʻW=\gamma \times \lambda .\text{D}ʻW=\text{D}ʻ\dot{s} ʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*21·33.\supset \vdash \colon\ldotp \text{Hp}.&\supset :xWP.xWQ.\equiv .\\ &(\exists R,S,z,w).R,S\in \lambda .x=Rʻz=Sʻw.P=R\downarrow z.Q=S\downarrow w.\\ [*33·43] &\equiv .(\exists R,S,z,w).R,S\in \lambda .x=Rʻz=Sʻw.x\in \text{D}ʻR\cap \text{D}ʻS.\\ &P=R\downarrow z.Q=S\downarrow w.\\ [\text{Hp}.*13·195] &\supset .(\exists R,z,w).R\in \lambda .x=Rʻz=Rʻw.P=R\downarrow z.Q=R\downarrow w.\\ [*71·532.*13·195] &\supset .(\exists R,z).R\in \lambda .x=Rʻz.P=R\downarrow z.Q=R\downarrow z.\\ [*13·172] &\supset .P=Q &\qquad \text{(1)}\\ \vdash .*21·33.\supset \vdash \colon\ldotp \text{Hp}.\supset :xWP.yWP.&\equiv .\\ &(\exists R,S,z,w).R,S\in \lambda .x=Rʻz.y=Sʻw.P=R\downarrow z=Q\downarrow w.\\ [*55·202] &\supset .(\exists R,S,z,w).R,S\in \lambda .x=Rʻz.y=Sʻw.R=S.z=w.\\ [*13·22·172] &\supset .x=y &\qquad \text{(2)}\\ \vdash .*33·131.\supset \vdash \colon\ldotp \text{Hp}.\supset :P\in \text{ᗡ}ʻW.&\equiv .(\exists x,R,z).R\in \lambda .x=Rʻz.P=R\downarrow z.\\ [*71·411] &\equiv .(\exists R,z).R\in \lambda .z\in \text{ᗡ}ʻR.P=R\downarrow z.\\ [\text{Hp}] &\equiv .(\exists R,z).R\in \lambda .z\in \gamma .P=R\downarrow z.\\ [*113·101] &\equiv .P\in \gamma \times \lambda &\qquad \text{(3)}\\ \vdash .*33·13. \supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \text{D}ʻW.&\equiv .(\exists P,R,z).R\in \lambda .x=Rʻz.P=R\downarrow z.\\ [*55·12.*71·36] &\equiv .(\exists R,z).R\in \lambda .xRz.\\ [*41·11.*33·13] &\equiv .x\in \text{D}ʻ\dot{s} ʻ\lambda &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*116·401. $\vdash : \text{Hp} *116·4 . T = \dot{s} ʻ\lambda . \supset . \overrightarrow{T}ʻʻ\gamma = W_{\in }ʻʻ\lambda \downarrow_{,,} ʻʻ\gamma$

Dem. $\begin{array}{l} \vdash . *37·11·1 . *38·2 . &\supset \vdash \colon\ldotp \text{Hp} . z \in \gamma . \supset :\\ x \in W_{\in }ʻ\lambda \downarrow_{,,} z . &\equiv . (\exists R) . R \in \lambda . x W (R \downarrow z) .\\ [*21·33] &\equiv . (\exists R, S, w) . R, S \in \lambda . x = Sʻw . R \downarrow z = S \downarrow w .\\ [*55·202 . *13·22] &\equiv . (\exists R) . R \in \lambda . x = Rʻz .\\ [*71·36] &\equiv . (\exists R) . R \in \lambda . xRz .\\ [*41·11] &\equiv . x (\dot{s} ʻ\lambda ) z .\\ [\text{Hp} . *32·18] &\equiv . x \in \overrightarrow{T}ʻz &\qquad \text{(1)}\\ \vdash . (1) . *37·68 . \supset \vdash . \text{Prop} \end{array}$

*116·41. $\begin{align}&\vdash \colon\ldotp \lambda \subset 1 \rightarrow 1 . \text{ᗡ}ʻʻ\lambda \subset \iota ʻ\gamma : R, S \in \lambda . \exists ! \text{D}ʻR \cap \text{D}ʻS . \supset _{R, S} . R = S : T = \dot{s} ʻ\lambda :\\ &\supset . \overrightarrow{T}ʻʻ\gamma \text{ sm } \text{ sm } \lambda \downarrow_{,,} ʻʻ\gamma . Tʻʻ\gamma \text{ sm } \gamma \times \lambda . T \in \text{Cls} \rightarrow 1 . \overrightarrow{T}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻT_{\Delta }ʻ\gamma = \text{Nc}ʻ\text{Prod}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻ(\lambda \,\,\text{exp}\,\, \gamma ) = (\text{Nc}ʻ\lambda )^{\text{Nc}ʻ\gamma }\end{align}$

Dem. $\begin{array}{l} \vdash . *116·4·401 . *111·4 . *113·1 . \supset \vdash : \text{Hp} . &\supset . \overrightarrow{T}ʻʻ\gamma \text{ sm } \text{ sm } \lambda \downarrow_{,,} ʻʻ\gamma . &\qquad \text{(1)}\\ [*111·44 . *40·5] &\supset . Tʻʻ\gamma \text{ sm } \gamma \times \lambda &\qquad \text{(2)}\\ \vdash . *72·321 . *85·14 . &\supset \vdash : \text{Hp} . \supset . T \in \text{Cls} \rightarrow 1 . \text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻT_{\Delta }ʻ\gamma &\qquad \text{(3)}\\ \vdash . (3) . *84·51 . \supset \vdash : \text{Hp} . &\supset .\overrightarrow{T}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} . &\qquad \text{(4)}\\ [*115·12] &\supset . \text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻ\text{Prod}ʻ\overrightarrow{T}ʻʻ\gamma &\qquad \text{(5)}\\ \vdash . (1) . *114·52 . \supset \vdash : \text{Hp} . \supset . \text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma &= \text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \downarrow_{,,} ʻʻ\gamma \\ [*116·14] &= \text{Nc}ʻ(\lambda \,\,\text{exp}\,\, \gamma ) &\qquad \text{(6)}\\ [*116·25] &= (\text{Nc}ʻ\lambda )^{\text{Nc}ʻ\gamma } &\qquad \text{(7)}\\ \vdash . (1) . (2) . (3) . (4) . (5) . (6) . (7) . \supset \vdash . \text{Prop} \end{array}$

*116·411. $\begin{align}&\vdash \colon\ldotp \kappa \in \text{Cls}^{2} \text{excl} : \alpha \in \kappa . \supset _{\alpha } . Mʻ\alpha \in \alpha \,\overline{\text{ sm }}\, \gamma : T = \dot{s} ʻMʻʻ\kappa ʻʻ: \supset .\\ &\overrightarrow{T}ʻʻ\gamma \text{ sm } \text{ sm } \kappa \downarrow_{,,} ʻʻ\gamma . Tʻʻ\gamma \text{ sm } \gamma \times \kappa . T \in \text{Cls} \rightarrow 1 . \overrightarrow{T}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻT_{\Delta }ʻ\gamma = \text{Nc}ʻ\text{Prod}ʻ\overrightarrow{T}ʻʻ\gamma = \text{Nc}ʻ(\kappa \,\,\text{exp}\,\, \gamma ) = (\text{Nc}ʻ\kappa )^{\text{Nc}ʻ\gamma }\end{align}$

Dem. $\begin{array}{l} \vdash . *73·03 . &\supset \vdash : \text{Hp} . \supset . Mʻʻ\kappa \subset 1 \rightarrow 1 . \text{ᗡ}ʻʻMʻʻ\kappa \subset \iota ʻ\gamma &\qquad \text{(1)}\\ \vdash . *111·16 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha , \beta \in \kappa . Mʻ\alpha = Mʻ\beta . \supset . \alpha = \beta &\qquad \text{(2)}\\ \vdash . *14·21 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha \in \kappa . \supset . \text{E}! Mʻ\alpha &\qquad \text{(3)}\\ \vdash . (2) . (3) . *73·24 . &\supset \vdash : \text{Hp} . \supset . Mʻʻ\kappa \text{ sm } \kappa &\qquad \text{(4)}\\ \vdash . *73·03 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha \in \kappa . \supset . \text{D}ʻMʻ\alpha = \alpha :\\ [*13·12] &\supset : \alpha , \beta \in \kappa . \exists ! \text{D} ʻMʻ\alpha \cap \text{D}ʻMʻ\beta . \supset . \exists ! \alpha \cap \beta .\\ [*84·11] &\supset . \alpha = \beta .\\ [*30·37 . (3)] &\supset . Mʻ\alpha = Mʻ\beta :\\ [*37·63] &\supset : R, S \in Mʻʻ\kappa . \exists ! \text{D}ʻR \cap \text{D}ʻS . \supset . R = S &\qquad \text{(5)}\\ \vdash . (1) . (4) . (5) . *116·41 \frac{Mʻʻ\kappa}{\lambda}. *113·13 . *116·19 . \supset \vdash . \text{Prop} \end{array}$

*116·412. $\begin{align}&\vdash \colon\ldotp \lambda \subset 1 \rightarrow 1 : R, S \in \lambda . \exists ! \text{D}ʻR \cap \text{D}ʻS . \supset _{R, S} . R = S : \text{ᗡ}ʻʻ\lambda \subset \iota ʻ\gamma :\\ &U = \hat{x} \hat{P}\{(\exists R, z) . R \in \lambda . x = Rʻz . P = z \downarrow R\} :\\ &\supset . U \in (sʻ\text{D}ʻʻ\lambda ) \,\overline{\text{ sm }}\, (\lambda \times \gamma ) \quad[\text{Proof as in *116·4}]\end{align}$

*116·413. $\vdash : \text{Hp} *116·412 . \supset . \text{D}ʻʻ\lambda = U_{\in}ʻʻ\gamma \downarrow_{,,}ʻʻ\lambda \quad[\text{Proof as in *116·401}]$

*116·414. $\begin{align}&\vdash : \text{Hp} *116·412 . \supset . U \in (\text{D}ʻʻ\lambda ) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \downarrow_{,,}ʻʻ\lambda ) . (\text{D}ʻʻ\lambda ) \text{ sm } \text{ sm } (\gamma \downarrow_{,,}ʻʻ\lambda )\\ &[*116·412·413]\end{align}$

*116·42. $\begin{align}&\vdash \colon\ldotp \lambda \subset 1 \rightarrow 1 : R, S \in \lambda . \exists ! \text{D}ʻR \cap \text{D}ʻS . \supset _{R,S} . R = S : \text{ᗡ}ʻʻ\lambda \subset \iota ʻ\gamma :\\ &\supset . \text{D}ʻʻ\lambda \text{ sm } \text{ sm } (\gamma \downarrow_{,,}ʻʻ\lambda ) . (\text{D}ʻ\dot{s} ʻ\lambda ) \text{ sm } (\lambda \times \gamma ) . ({\in}_{\Delta}ʻ\text{D}ʻʻ\lambda ) \text{ sm } (\gamma \,\,\text{exp}\,\, \lambda ) .\\ &\text{Nc}ʻ\text{Prod}ʻ\text{D}ʻʻ\lambda = \Pi \text{Nc}ʻ\text{D}ʻʻ\lambda = (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\lambda }\\ &[*116·414·25 . *115·51 . *111·44 . *41·43]\end{align}$

*116·422. $\begin{align}&\vdash \colon\ldotp M \upharpoonright \delta \in 1 \rightarrow 1 : w, v \in \delta . \exists ! \text{D}ʻMʻw \cap \text{D}ʻMʻv . \supset _{w,v} . w = v :\\ &w \in \delta . \supset _{w} . Mʻw \in 1 \rightarrow 1 . \text{ᗡ}ʻMʻw = \gamma : \supset . \text{D}ʻʻMʻʻ\delta \text{ sm } \text{ sm } \gamma \downarrow_{,,}ʻʻ\delta\end{align}$

Dem. $\begin{array}{l} \vdash . *116·42 \frac{Mʻʻ\delta}{\lambda}. \supset \\ \vdash \colon\ldotp Mʻʻ\delta \subset 1 \rightarrow 1 : R, S \in Mʻʻ\delta . \exists ! \text{D}ʻR \cap \text{D}ʻS . &\supset _{R, S} . R = S : \text{ᗡ}ʻʻMʻʻ\delta \subset \iota ʻ\gamma :\\ &\supset . \text{D}ʻʻMʻʻ\delta \text{ sm } \text{ sm } \gamma \downarrow_{,,}ʻʻMʻʻ\delta &\qquad \text{(1)}\\ \vdash . *14·21 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : w \in \delta . \supset . \text{E}! Mʻw : &\qquad \text{(2)}\\ [*33·43] &\supset : \delta \subset \text{ᗡ}ʻM :\\ [*73·15] &\supset : (Mʻʻ\delta ) \text{ sm } \delta &\qquad \text{(3)}\\ \vdash . *51·15 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : w \in \delta . \supset . \text{ᗡ}ʻMʻw \in \iota ʻ\gamma :\\ [*37·61] &\supset : \text{ᗡ}ʻʻMʻʻ\delta \subset \iota ʻ\gamma &\qquad \text{(4)}\\ \vdash . (2) . *30·37 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : w,v \in \delta . \exists ! \text{D}ʻMʻw \cap \text{D}ʻMʻv . \supset _{w,v} . Mʻw = Mʻv :\\ [*37·63] &\supset : R, S \in Mʻʻ\delta . \exists ! \text{D}ʻR \cap \text{D}ʻS . \supset _{R, S} . R = S &\qquad \text{(5)}\\ \vdash . (1) . (4) . (5) . \supset \vdash : \text{Hp} . &\supset . \text{D}ʻʻMʻʻ\delta \text{ sm } \text{ sm } \gamma \downarrow_{,,}ʻʻMʻʻ\delta .\\ [(3) . *113·13] &\supset . \text{D}ʻʻMʻʻ\delta \text{ sm } \text{ sm } \gamma \downarrow_{,,}ʻʻ\delta : \supset \vdash . \text{Prop} \end{array}$

*116·43. $\begin{align}&\vdash \colon\ldotp M\upharpoonright \delta \in 1\rightarrow 1:w,v\in \delta .\exists !\text{D}ʻMʻw\cap \text{D}ʻMʻv.\supset _{w,v}.w = v:\\ &w\in \delta .\supset _{w}.Mʻw\in 1\rightarrow 1.\text{ᗡ}ʻMʻw = \gamma :\\ &\supset .\text{Prod}ʻ\text{D}ʻʻMʻʻ\delta \text{ sm }\text{ sm }(\gamma \,\,\text{exp}\,\,\delta ).\Pi \text{Nc}ʻ\text{D}ʻʻMʻʻ\delta = (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta }\end{align}$

Dem. $\begin{array}{l} \vdash .*115·51.*116·422.&\supset \vdash :\text{Hp}.\supset .\text{Prod}ʻ\text{D}ʻʻMʻʻ\delta \text{ sm }\text{ sm }(\gamma \,\,\text{exp}\,\,\delta ) &\qquad \text{(1)}\\ \vdash .*116·422.*114·52.&\supset \vdash :\text{Hp}.\supset .\Pi \text{Nc}ʻ\text{D}ʻʻMʻʻ\delta = \Pi \text{Nc}ʻ\gamma \downarrow_{,,}ʻʻ\delta &\qquad \text{(2)}\\ \vdash .*116·14·25.&\supset \vdash .\Pi \text{Nc}ʻ\gamma \downarrow_{,,}ʻʻ\delta = (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\delta } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·44. $\begin{align}&\vdash \colon\ldotp \exists !\gamma :(z).Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \text{V}:\\ &w,v\in \delta .\exists !(Mʻw)ʻʻ\gamma \cap (Mʻv)ʻʻ\gamma .\supset _{w,v}.w = v:\\ &\supset .\text{D}ʻʻ\upharpoonright \gammaʻʻMʻʻ\delta \text{ sm }\text{ sm }\gamma \downarrow_{,,}ʻʻ\delta .\text{Prod}ʻ\text{D}ʻʻ\upharpoonright \gamma ʻʻMʻʻ\delta \text{ sm }\text{ sm }(\gamma \,\,\text{exp}\,\,\delta )\end{align}$

Dem. $\begin{array}{l} \vdash .*71·29.*35·65.\supset\\ \vdash \colon\ldotp \text{Hp}:(z).Nʻz = (Mʻz)\upharpoonright \gamma :\supset .(z).Nʻz\in 1\rightarrow 1.\text{ᗡ}ʻNʻz = \gamma &\qquad \text{(1)}\\ \vdash .*37·401.\supset \vdash \colon\ldotp \text{Hp}.\text{Hp}(1).\supset :w,v\in \delta .\exists !\text{D}ʻNʻw\cap \text{D}ʻNʻv.\supset _{w,v}.w = v &\qquad \text{(2)}\\ \vdash .*35·7.\supset \vdash \colon\ldotp \text{Hp}.\text{Hp}(1).\supset :x\in \gamma .w,v\in \delta .Nʻw = Nʻv.\supset .(Nʻw)ʻx = (Nʻv)ʻx.\\ [(2)] \supset .w = v &\qquad \text{(3)}\\ \vdash .(3).*10·11·23·35.\supset \vdash \colon\ldotp \text{Hp}.\text{Hp}(1).\supset :w,v\in \delta .Nʻw = Nʻv.\supset .w = v:\\ [*71·55·166] \supset :N\upharpoonright \delta \in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .(1).(2).(4).*116·422.*115·51.\supset\\ \vdash :\text{Hp}.\text{Hp}(1).\supset .\text{D}ʻʻNʻʻ\delta \text{ sm }\text{ sm }\gamma \downarrow_{,,}ʻʻ\delta .\text{Prod}ʻ\text{D}ʻʻNʻʻ\delta \text{ sm }\text{ sm }(\gamma \,\,\text{exp}\,\,\delta ) &\qquad \text{(5)}\\ \vdash .*38·11.\supset \vdash :\text{Hp}.\text{Hp}(1).\supset .\text{D}ʻNʻz = \text{D}ʻ\upharpoonright \gamma ʻMʻz.\\ [*37·353] \supset .\text{D}ʻʻNʻʻ\delta = \text{D}ʻʻ\upharpoonright \gamma ʻʻMʻʻ\delta &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*116·45. $\begin{align}&\vdash \colon\ldotp (z).Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \text{V}:\\ &w,v\in \delta .\exists !(Mʻw)ʻʻ\gamma \cap (Mʻv)ʻʻ\gamma .\supset _{w,v}.w\\ & = v:\supset .\text{Prod}ʻ\text{D}ʻʻ\upharpoonright \gamma ʻʻMʻʻ\delta \text{ sm }(\gamma \,\,\text{exp}\,\,\delta )\end{align}$

Dem. $\begin{array}{l} \vdash .*116·182.*115·142.*37·29.\supset\\ \vdash :\text{Hp}.\gamma &= \Lambda .\exists !\delta .\supset .\text{Prod}ʻ\text{D}ʻʻ\upharpoonright \gamma ʻʻMʻʻ\delta = \Lambda .\gamma \,\,\text{exp}\,\,\delta = \Lambda &\qquad \text{(1)}\\ \vdash .*115·1.*83·15.*116·181.\supset\\ \vdash :\text{Hp}.\delta & = \Lambda .\supset .\text{Prod}ʻ\text{D}ʻʻ\upharpoonright \gamma ʻʻMʻʻ\delta = \iota ʻ\Lambda .\gamma \,\,\text{exp}\,\,\delta = \iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*116·44.\supset \vdash .\text{Prop} \end{array}$

We have now to prove the three formal laws of exponentiation, namely $\begin{aligned} \mu ^\nu \times _{c} \mu ^{\varpi } &= \mu ^{\nu +_{c} \varpi },\\ \mu ^{\varpi } \times _{c} \nu ^{\varpi } &= (\mu \times _{c} \nu )^{\varpi },\\ \text{and}\qquad (\mu ^\nu )^{\varpi } &= \mu ^{\nu \times _{c} \varpi }. \end{aligned}$ [Pg 157] Of these the first is an immediate consequence of the distributive law, while the second and third result from forms of the associative law of multiplication.

*116·5. $\vdash : \beta \cap \gamma = \Lambda . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\, (\beta \cup \gamma )$

Dem. $\begin{array}{l} \vdash . *113·191 . \supset \\ \vdash : \text{Hp} . \exists ! \alpha . &\supset . \alpha \downarrow_{,,}ʻʻ\beta \cap \alpha \downarrow_{,,}ʻʻ\gamma = \Lambda .\\ [*114·301] &\supset . {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\beta \times {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ\gamma \text{ sm } {\in}_{\Delta}ʻ(\alpha \downarrow_{,,}ʻʻ\beta \cup \alpha \downarrow_{,,}ʻʻ\gamma .\\ [*116·14 . *113·13] &\supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } {\in}_{\Delta}ʻ(\alpha \downarrow_{,,}ʻʻ\beta \cup \alpha \downarrow_{,,}ʻʻ\gamma ) .\\ [*37·22] &\supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } {\in}_{\Delta}ʻ\alpha \downarrow_{,,}ʻʻ(\beta \cup \gamma ) .\\ [*116·14] &\supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\, (\beta \cup \gamma ) &\qquad \text{(1)}\\ \vdash . *116·182 . &\supset \vdash : \alpha = \Lambda . \exists ! \beta . \supset . \alpha \,\,\text{exp}\,\, \beta = \Lambda .\\ [*113·114] &\supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) = \Lambda &\qquad \text{(2)}\\ \vdash . *116·182 . *24·56 . &\supset \vdash : \alpha = \Lambda . \exists ! \beta . \supset . \alpha \,\,\text{exp}\,\, (\beta \cup \gamma ) = \Lambda &\qquad \text{(3)}\\ \vdash . (2) . (3) . &\supset \vdash : \alpha = \Lambda . \exists ! \beta . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\, (\beta \cup \gamma ) &\qquad \text{(4)}\\ \text{Similarly}\quad &\vdash : \alpha = \Lambda . \exists ! \gamma . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\,(\beta \cup \gamma ) &\qquad \text{(5)}\\ \vdash . *116·181 . &\supset \vdash : \alpha = \Lambda . \beta = \Lambda . \gamma = \Lambda . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) = \iota ʻ\Lambda \times \iota ʻ\Lambda &\qquad \text{(6)}\\ \vdash . *116·181 . &\supset \vdash : \alpha = \Lambda . \beta = \Lambda . \gamma = \Lambda . \supset . \alpha \,\,\text{exp}\,\, (\beta \cup \gamma ) = \iota ʻ\Lambda &\qquad \text{(7)}\\ \vdash . (6) . (7) . *113·611 . *73·43 . \supset \\ &\vdash : \alpha = \Lambda . \beta = \Lambda . \gamma = \Lambda . \supset . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\, (\beta \cup \gamma ) &\qquad \text{(8)}\\ \vdash . (1) . (4) . (5) . (8) . \supset \vdash . \text{Prop} \end{array}$

In the last line of the above proof, *73·43 is required because the two $\Lambda$ 's involved have not been proved to be of the same type. They are in fact of the same type, but it is unnecessary to prove this.

*116·51. $\vdash . (\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } \alpha \,\,\text{exp}\,\, (\beta + \gamma )$

Dem. $\begin{array}{l} \vdash . *116·19 . *110·12 . \supset \vdash . &(\alpha \,\,\text{exp}\,\, \beta ) \text{ sm } (\alpha \,\,\text{exp}\,\, \downarrow \Lambda _{\gamma } ʻʻ\iota ʻʻ\beta ) .\\ &(\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm } (\alpha \,\,\text{exp}\,\, \Lambda _{\beta } \downarrow ʻʻ\iotaʻʻ\gamma ) .\\ [*113·13] \supset \vdash . &(\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm }\\ &(\alpha \,\,\text{exp}\,\, \downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta ) \times (\alpha \,\,\text{exp}\,\, \Lambda _{\beta } \downarrow ʻʻ\iotaʻʻ\gamma ) .\\ [*110·11 . *116·5] \supset \vdash . &(\alpha \,\,\text{exp}\,\, \beta ) \times (\alpha \,\,\text{exp}\,\, \gamma ) \text{ sm }\\ &\alpha \,\,\text{exp}\,\, (\downarrow \Lambda _{\gamma } ʻʻ\iotaʻʻ\beta \cup \Lambda _{\beta } \downarrow ʻʻ\iotaʻʻ\gamma ) &\qquad \text{(1)}\\ \vdash . (1) . (*110·01) . \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*116·51 .*110·22.\supset \\ \vdash .(\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\beta } \times _{c} (\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\gamma } = (\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\beta +_{c} \text{N}_{0}\text{c}ʻ\gamma } &\qquad \text{(1)}\\ \vdash .(1).*103·2.\supset \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}.\supset .\mu ^\nu \times _{c} \mu ^{\varpi } = \mu ^{\nu +_{c}\varpi } &\qquad \text{(2)}\\ \vdash .*116·205.*113·204.\supset \\ \vdash : \mu {\sim} \in \text{N}_{0}\text{C}.\supset .\mu ^\nu \times _{c} \mu ^{\varpi } = \Lambda = \mu ^{\nu +_{c}\varpi } &\qquad \text{(3)}\\ \vdash .*116·205.*113·204.\supset\\ \vdash : {\sim} (\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .\mu ^\nu \times _{c} \mu ^{\varpi } = \Lambda &\qquad \text{(4)}\\ \vdash .*110·4.*116·204.\supset \vdash :{\sim}(\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .\mu ^{\nu +_{c}\varpi } = \Lambda &\qquad \text{(5)}\\ \vdash . (4).(5).\supset \vdash :{\sim}(\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .\mu ^\nu \times _{c} \mu ^{\varpi } = \mu ^{\nu +_{c}\varpi } &\qquad \text{(6)}\\ \vdash .(2).(3).(6).\supset \vdash .\text{Prop} \end{array}$

The following propositions are lemmas for $\mu ^{\varpi } \times _{c} \nu ^{\varpi } = (\mu \times _{c} \nu )^{\varpi }.$ The principal previous propositions used in the proof are *115·6 and *116·43. The proof proceeds as follows. $(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\,\text{is}\,\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\gamma \times \text{Prod}ʻ\beta \downarrow_{,,}ʻʻ\gamma.$ This, using *115·6, and putting $\alpha \downarrow_{,,}$ , $\beta \downarrow_{,,}$ in place of $R$ and $S$ of that proposition, is similar to ${\in}_{\Delta}ʻ\hat{\mu} \{\exists z).z\in \gamma .\mu = \alpha \downarrow_{,,}z \times \beta \downarrow_{,,}z\},\, \textit{i.e.}\, \text{to}\, {\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu = \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta\}.$ Now by *113·65, putting $R\dagger = R\parallel \breve{R}\quad\text{Dft}$ , $\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta =(\downarrow z)\dagger ʻʻ(\alpha \times \beta)$ . We now apply *116·43, taking $(\downarrow z)\dagger$ as the $Mʻz$ of that proposition, or rather, taking $(\downarrow z)\dagger\upharpoonright (\alpha \times \beta)$ . Thus we find ${\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu = \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta \}\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma .$ Hence our proposition follows.

In *150, this notation will be introduced as a permanent definition. For the present, we only introduce it to avoid $(\downarrow z\parallel\text{Cnv}ʻ\downarrow z)$ , which is awkward.

*116·53. $\begin{align}\vdash :\exists !&\alpha .\exists !\beta .\supset .\\ &(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }{\in}_{\Delta}ʻ\hat{\mu} \{(\exists z).z\in \gamma .\mu = \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta\}\end{align}$

Dem. $\begin{array}{l} \vdash .*113·104·111.&\supset \vdash .\gamma \subset \text{ᗡ}ʻ\alpha \downarrow_{,,}.\gamma \subset \text{ᗡ}ʻ\beta \downarrow_{,,}.\alpha \downarrow_{,,}ʻʻ\gamma ,\beta \downarrow_{,,}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} &\qquad \text{(1)}\\ \vdash .*113·105. &\supset \vdash :\text{Hp}.\supset .(\alpha \downarrow_{,,}ʻʻ\gamma )\upharpoonleft \alpha \downarrow_{,,}, \beta \downarrow_{,,}\upharpoonright \gamma \in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).*115·6 \frac{\alpha \downarrow_{,,},\,\beta \downarrow_{,,}}{R,\,S}.\supset \\ \vdash : \text{Hp}.&\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }{\in}_{\Delta}ʻ\hat{\mu}\{(\exists z).z\in \gamma .\mu = \alpha \downarrow_{,,}z \times \beta \downarrow_{,,}z\} &\qquad \text{(3)}\\ \vdash .(3).*38·2.\supset \vdash .\text{Prop} \end{array}$

The hypothesis $\exists !\alpha .\exists !\beta$ is not necessary in the above proposition; but the proof is simpler with the hypothesis, and we do not need the proposition without the hypothesis.

*116·531. $\begin{align}\vdash \colon\ldotp &M = \hat{R} \hat{z} \{z\in \gamma .R = (\downarrow z)\dagger \upharpoonright (\alpha \times \beta )\}.\supset :\\ &z\in \gamma .\supset _{z}.Mʻz = (\downarrow z)\dagger \upharpoonright (\alpha \times \beta ).Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \alpha \times \beta \end{align}$

Dem. $\begin{array}{l} \vdash .*74·772.*55·12.*72·184 .&\supset \vdash .(\downarrow z)\dagger \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.z\in \gamma .\supset :RMz. \equiv .R = (\downarrow z)\dagger \upharpoonright (\alpha \times \beta ):\\ [*30·3] &\supset :Mʻz = (\downarrow z)\dagger \upharpoonright (\alpha \times \beta ): &\qquad \text{(2)}\\ [(1).*43·122] &\supset :Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \alpha \times \beta &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·532. $\vdash :\text{Hp}*116·531.\exists !\alpha .\exists !\beta .\supset .M\in 1\rightarrow 1.\text{ᗡ}ʻM = \gamma$

Dem. $\begin{array}{l} \vdash .*116·531.*14·21.*71·16.&\supset \vdash :\text{Hp}.\supset .M\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *116·531.\supset \vdash \colon\ldotp \text{Hp}.z,w\in \gamma .Mʻz = Mʻw.\supset :\\ &(\downarrow z)\dagger \upharpoonright (\alpha \times \beta ) = (\downarrow w)\dagger \upharpoonright (\alpha \times \beta ):\\ [*71·35] &\supset :R\in (\alpha \times \beta ).\supset .(\downarrow z)\dagger ʻR = (\downarrow w)\dagger ʻR:\\ [*113·101] \supset :x\in \alpha .y\in \beta .&\supset .(\downarrow z)\dagger ʻ(y\downarrow x) = (\downarrow w)\dagger ʻ(y\downarrow x).\\ [*113·123] &\supset .(y\downarrow z)\downarrow (x\downarrow z) = (y\downarrow w)\downarrow (x\downarrow w).\\ [*55·202] &\supset .z = w &\qquad \text{(2)}\\ \vdash .(2). &\supset \vdash \colon\ldotp \text{Hp}.\supset :z,w\in \gamma .Mʻz = Mʻw.\supset .z = w &\qquad \text{(3)}\\ \vdash .*116·531.*14·21.*33·43.&\supset \vdash :\text{Hp}.z\in \gamma .\supset .z\in \text{ᗡ}ʻR &\qquad \text{(4)}\\ \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :RMz.\supset _{R,z}.z\in \gamma :\\ [*33·351] &\supset :\text{ᗡ}ʻR\subset \gamma &\qquad \text{(5)}\\ \vdash .(1).(3).(4).(5).*71·55.\supset \vdash .\text{Prop} \end{array}$

*116·533. $\begin{align}\vdash \colon\ldotp \text{Hp}*116·531.\supset :\text{D}ʻʻMʻʻ\gamma = \hat{\mu} \{(\exists z).z\in \gamma .\mu = \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta\}:\\ z,w\in \gamma .\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻw.\supset _{z,w}.z = w\end{align}$

Dem. $\begin{array}{l} \vdash .*116·531.\supset \vdash :\text{Hp}.z\in \gamma .\supset .\text{D}ʻMʻz &= \text{D}ʻ\{(\downarrow z)\dagger \upharpoonright (\alpha \times \beta )\}\\ [*37·401] &= (\downarrow z)\dagger ʻʻ(\alpha \times \beta )\\ [*113·65] &= \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*37·6.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻʻMʻʻ\gamma = \hat{\mu} \{(\exists z).z\in \gamma .\mu = \downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta\} &\qquad \text{(2)}\\ \vdash .*113·19.\supset \vdash :&\exists !(\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta )\cap (\downarrow wʻʻ\alpha \times \downarrow wʻʻ\beta ).\supset .\\ &\exists !\downarrow zʻʻ\alpha \cap \downarrow wʻʻ\alpha .\\ [*55·232] &\supset .z = w &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·534. $\vdash :\text{Hp}*116·532.\supset .{\in}_{\Delta}ʻ\text{D}ʻʻMʻʻ\gamma \text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma$

Dem. $\begin{array}{l} \vdash .*116·531·532·533.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :M\in 1\rightarrow 1:z,w\in \gamma .&\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻw.\supset _{z,\omega }.z = w:\\ &z\in \gamma .\supset _{z}.Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \alpha \times \beta :\\ [*116·43] &\supset :\text{Prod}ʻ\text{D}ʻʻMʻʻ\gamma \text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma :\\ [*115·12.*30·37.*84·11]&\supset :{\in}_{\Delta}ʻ\text{D}ʻʻMʻʻ\gamma \text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\, \gamma \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*116·535. $\begin{align}&\vdash :\exists !\alpha .\exists !\beta .\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma\\ &[*116·53·533·534]\end{align}$

The hypothesis $\exists !\alpha .\exists !\beta$ is not necessary, as we shall now prove.

*116·54. $\vdash .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma$

Dem. $\begin{array}{l} \vdash .*116·182.\supset \vdash :\alpha = \Lambda .\exists !\gamma .&\supset .\alpha \,\,\text{exp}\,\,\gamma = \Lambda .\\ [*113·114] &\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma ) = \Lambda &\qquad \text{(1)}\\ \vdash .*113·114.*116·182.&\supset \vdash :\alpha = \Lambda .\exists !\gamma .\supset .(\alpha \times \beta )\,\,\text{exp}\,\,\gamma = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\alpha = \Lambda .\exists !\gamma .\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(3)}\\ \text{Similarly}\quad &\vdash :\beta = \Lambda .\exists !\gamma .\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(4)}\\ \vdash .*116·181. \supset \vdash :\gamma = \Lambda .&\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma ) = \iota ʻ\Lambda \times \iota ʻ\Lambda .\\ [*113·611.*73·43] &\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }\iota ʻ\Lambda &\qquad \text{(5)}\\ \vdash .*116·181. \supset \vdash :\gamma = \Lambda .&\supset .(\alpha \times \beta )\,\,\text{exp}\,\,\gamma = \iota ʻ\Lambda .\\ [(5)] &\supset .(\alpha \,\,\text{exp}\,\,\gamma ) \times (\beta \,\,\text{exp}\,\,\gamma )\text{ sm }(\alpha \times \beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(6)}\\ \vdash .(3).(4).(6).*116·535.&\supset \vdash .\text{Prop} \end{array}$

In obtaining (5), we use *73·43 as well as *113·611, because $\Lambda$ 's of different types are involved.

*116·55. $\vdash .\mu ^{\varpi } \times _{c} \nu ^{\varpi } = (\mu \times _{c} \nu )^{\varpi }$

Dem. $\begin{array}{l} \vdash .*116·54·222.*113·222.&\supset \vdash .(\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\gamma } \times _{c} (\text{N}_{0}\text{c}ʻ\beta )^{\text{N}_{0}\text{c}ʻ\gamma }\\ &=(\text{N}_{0}\text{c}ʻ\alpha \times _{c} \text{N}_{0}\text{c}ʻ\beta )^{\text{N}_{0}\text{c}ʻ\gamma } &\qquad \text{(1)}\\ \vdash .(1).*103·2. &\supset \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}.\supset .\mu ^{\varpi } \times _{c} \nu ^{\varpi } = (\mu \times _{c} \nu )^{\varpi } &\qquad \text{(2)}\\ \vdash .*116·205.*113·204.&\supset \vdash :\varpi {\sim}\in \text{N}_{0}\text{C}.\supset .\mu ^{\varpi } \times _{c} \nu ^{\varpi } = \Lambda = (\mu \times _{c} \nu )^{\varpi } &\qquad \text{(3)}\\ \vdash .*116·205.*113·204.&\supset \vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).\supset .\mu ^{\varpi } \times _{c} \nu ^{\varpi } = \Lambda &\qquad \text{(4)}\\ \vdash .*113·204.*116·204.&\supset \vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).\supset .(\mu \times _{c} \nu )^{\varpi } = \Lambda &\qquad \text{(5)}\\ \vdash .(4).(5) &\supset \vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{C}).\supset .\mu ^{\varpi } \times _{c} \nu ^{\varpi } = (\mu \times _{c} \nu )^{\varpi } &\qquad \text{(6)}\\ \vdash .(2).(3).(6). \supset \vdash .\text{Prop} \end{array}$

This completes the proof of the second of the formal laws of exponentiation. The following propositions are lemmas for the third of these laws, namely $(\mu ^{\nu })^{\varpi } = \mu ^{\nu \times _{c} \varpi }.$

*116·6. $\begin{align}\vdash :\exists !\alpha .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm } \text{Prod}ʻ\text{Prod}ʻʻ&\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma .\\ &\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \in \text{Cls}^{3}\,\text{arithm}\end{align}$

Dem. $\begin{array}{l} \vdash .*113·105.*84·53 \frac{\alpha \downarrow_{,,}}{R}.*113·111.&\supset \vdash :\text{Hp}.\supset .\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} &\qquad \text{(1)}\\ \vdash .*40·38. &\supset \vdash .sʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma = \alpha \downarrow_{,,}ʻʻsʻ\beta \downarrow_{,,}ʻʻ\gamma &\qquad \text{(2)}\\ [*113·111] &\supset \vdash .sʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \in \text{Cls}^{2} \text{excl} &\qquad \text{(3)}\\ \vdash .(1).(3).*115·2. &\supset \vdash :\text{Hp}.\supset .\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \in \text{Cls}^{3}\,\text{arithm} &\qquad \text{(4)}\\ \vdash .*113·141.*116·19. \supset \vdash .&\text{Nc}ʻ\{\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\} = \text{Nc}ʻ\{\alpha \,\,\text{exp}\,\,(\gamma \times \beta )\}\\ [(*116·01.*113·02)] &= \text{Nc}ʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻsʻ\beta \downarrow_{,,}ʻʻ\gamma \\ [(2)] &= \text{Nc}ʻ\text{Prod}ʻsʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \\ [*115·35.(4)] &= \text{Nc}ʻ\text{Prod}ʻ\text{Prod}ʻʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*116·601. $\vdash .\mid (\text{Cnv}ʻ\downarrow z)\in 1\rightarrow 1 \quad[*74·774.*72·184]$

*116·602. $\begin{align}\vdash \colon\ldotp M = \hat{R} \hat{z} &[z\in \gamma .R = \{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in }\upharpoonright (\alpha \,\,\text{exp}\,\,\beta )].\supset :\\ &z\in \gamma .\supset .Mʻz = \{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in }\upharpoonright (\alpha \,\,\text{exp}\,\,\beta ):\text{ᗡ}ʻM = \gamma \end{align}$

Dem. $\begin{array}{l} \vdash .*21·33.\supset \\ \vdash \colon\colon \text{Hp}.\supset \colon\ldotp z\in \gamma .\supset :RMz. \equiv .R = {\mid (\text{Cnv}ʻ\downarrow z)}_{\in }\upharpoonright (\alpha \,\,\text{exp}\,\,\beta ) &\qquad \text{(1)}\\ \vdash .(1).*30·3.\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in \gamma .\supset .Mʻz = {\mid (\text{Cnv}ʻ\downarrow z)}_{\in }\upharpoonright (\alpha \,\,\text{exp}\,\,\beta ) &\qquad \text{(2)}\\ \vdash .*21·33.*33·131.\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻM = \gamma &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*116·603. $\begin{align}&\vdash \colon\ldotp \text{Hp}*116·602.\supset :z\in \gamma .\supset .\text{ᗡ}ʻMʻz = \alpha \,\,\text{exp}\,\,\beta \\ &[*116·602.*37·231.*35·65]\end{align}$

*116·604. $\vdash \colon\ldotp \text{Hp}*116·602.\supset :z\in \gamma .\supset .\text{D}ʻMʻz = \text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}z$

Dem. $\begin{array}{l} \vdash .*37·401.*116·602.\supset \\ \vdash :\text{Hp}.z\in \gamma .\supset .\text{D}ʻMʻz &= \{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in}ʻʻ(\alpha \,\,\text{exp}\,\,\beta )\\ [*115·4.*116·601.*43·301] &= \text{Prod}ʻ\{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in}ʻʻ\alpha \downarrow_{,,}ʻʻ\beta \\ [*113·125 \frac{I}{R}.*50·75·16] &= \text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\downarrow zʻʻ\beta \\ [*38·2] &= \text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}z:\supset \vdash .\text{Prop} \end{array}$

*116·605. $\vdash \colon\ldotp \text{Hp}*116·602.\supset :z\in \gamma .\supset .Mʻz\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*116·601.*72·451.\supset \\ \vdash .{\mid (\text{Cnv}ʻ\downarrow z)}_{\in }\upharpoonright \text{Cl}ʻ\text{ᗡ}ʻ\mid (\text{Cnv}ʻ\downarrow z)\in 1\rightarrow 1.\\ [*43·301]\supset \vdash .{\mid (\text{Cnv}ʻ\downarrow z)}_{\in }\upharpoonright (\alpha \,\,\text{exp}\,\,\beta )\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*116·602.\supset \vdash .\text{Prop} \end{array}$

*116·606. $\begin{align}\vdash \colon\ldotp \text{Hp}*116·602.&\exists !\alpha .\exists !\beta .\supset :\\ &M\in 1\rightarrow 1:z,w\in \gamma .\text{D}ʻMʻz = \text{D}ʻMʻw.\supset _{z,w}.z = w\end{align}$

Dem. $\begin{array}{l} \vdash .*116·602.*14·21.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in \text{ᗡ}ʻM.\supset _{z}.\text{E}!Mʻz:\\ [*71·16] &\supset :M\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .*30·37.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z,w\in \gamma .Mʻz = Mʻw.\supset .\text{D}ʻMʻz = \text{D}ʻMʻw &\qquad \text{(2)}\\ \vdash .*116·604.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z,w\in \gamma .\text{D}ʻMʻz = \text{D}ʻMʻw.\supset .\\ &\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}z = \text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}w.\\ [*30·37] &\supset .sʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}z = sʻ\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}w.\\ [*116·171.*115·141.(*116·01)] &\supset .sʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}z = sʻ\alpha \downarrow_{,,}ʻʻ\beta \downarrow_{,,}w.\\ [*113·1] &\supset .\beta \downarrow_{,,}z \times \alpha = \beta \downarrow_{,,}w \times \alpha .\\ [*113·182] &\supset .\beta \downarrow_{,,}z = \beta \downarrow_{,,}w.\\ [*113·105.\text{Hp}] &\supset .z = w &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*71·55.*116·602.\supset \vdash .\text{Prop} \end{array}$

*116·607. $\begin{align}&\vdash \colon\ldotp \text{Hp}*116·602.\exists !\alpha .\exists !\beta .\supset :\\ &M\in 1\rightarrow 1.\text{D}ʻʻMʻʻ\gamma = \text{Prod}ʻʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma :\\ &z,w\in \gamma .\text{D}ʻMʻz = \text{D}ʻMʻw.\supset _{z,w}.z = w:\\ &z\in \gamma .\supset _{z}.Mʻz\in 1\rightarrow 1.\text{ᗡ}ʻMʻz = \alpha \,\,\text{exp}\,\,\beta \quad[*116·606·604·605·603]\end{align}$

*116·61. $\begin{align}&\vdash :\exists !\alpha .\exists !\beta .\supset .\text{Prod}ʻ\text{Prod}ʻʻ\alpha \downarrow_{,,}ʻʻʻ\beta \downarrow_{,,}ʻʻ\gamma \text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma \\ &[*116·607·43]\end{align}$

*116·611. $\vdash :\exists !\alpha .\exists !\beta .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma \quad[116·6·61]$

*116·62. $\vdash .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma$

Dem. $\begin{array}{l} \vdash .*116·181.*113·114.&\supset \vdash :\beta = \Lambda .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma ) = \iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*116·181.&\supset \vdash :\beta = \Lambda .\supset .(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma = (\iota ʻ\Lambda )\,\,\text{exp}\,\,\gamma &\qquad \text{(2)}\\ \vdash .*116·33·25.&\supset \vdash .\text{Nc}ʻ\{(\iota ʻ\Lambda )\,\,\text{exp}\,\,\gamma\}= 1 &\qquad \text{(3)}\\ \vdash . (1).(2).(3).*55·22.*100·31.&\supset \vdash :\beta = \Lambda .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(4)}\\ \vdash . *113·107.*116·182.&\supset \vdash :\alpha = \Lambda .\exists !\beta .\exists !\gamma .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma ) = \Lambda &\qquad \text{(5)}\\ \vdash .*116·182.&\supset \vdash :\alpha = \Lambda .\exists !\beta .\exists !\gamma .\supset .(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma = \Lambda &\qquad \text{(6)}\\ \vdash .(5).(6).&\supset \vdash :\alpha = \Lambda .\exists !\beta .\exists !\gamma .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(7)}\\ \vdash .*113·114.*116·181.&\supset \vdash :\gamma = \Lambda .\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma ) = \iota ʻ\Lambda .(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma = \iota ʻ\Lambda .\\ [*73·43] &\supset .\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(8)}\\ \vdash .(4).(7).(8).&\supset \vdash \colon\ldotp \alpha = \Lambda .\lor.\beta = \Lambda .\lor.\gamma = \Lambda :\supset .\\ &\alpha \,\,\text{exp}\,\,(\beta \times \gamma )\text{ sm }(\alpha \,\,\text{exp}\,\,\beta )\,\,\text{exp}\,\,\gamma &\qquad \text{(9)}\\ \vdash .(9).*116·611.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *113·222 . \supset \vdash . (\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\beta \times _{c} \text{N}_{0}\text{c}ʻ\gamma } &= (\text{N}_{0}\text{c}ʻ\alpha )^{\text{Nc}ʻ(\beta \times \gamma )}\\ [*116·222 . (*116·04)] &= \text{Nc}ʻ\{\alpha \,\,\text{exp}\,\, (\beta \times \gamma )\}\\ [*116·62] &= \text{Nc}ʻ\{(\alpha \,\,\text{exp}\,\, \beta ) \,\,\text{exp}\,\, \gamma\}\\ [*116·222] &= \{\text{N}_{0}\text{c}ʻ(\alpha \,\,\text{exp}\,\, \beta )\}^{\text{N}_{0}\text{c}ʻ\gamma }\\ [*116·222 . (*116· 03)] &= \{(\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\beta }\}^{\text{N}_{0}\text{c}ʻ\gamma } &\qquad \text{(1)}\\ \vdash . (1) . *103·2 . &\supset \vdash : \mu , \nu , \varpi \in \text{N}_{0}\text{C} . \supset . \mu ^{\nu \times _{c} \varpi } = (\mu ^\nu )^{\varpi } &\qquad \text{(2)}\\ \vdash . *116·204·205 . &\supset \vdash : {\sim} (\mu , \nu \in \text{N}_{0}\text{C}) . \supset . (\mu ^\nu )^{\varpi } = \Lambda &\qquad \text{(3)}\\ \vdash . *113·205 . *116·204·205 . &\supset \vdash : {\sim}(\mu , \nu \in \text{N}_{0}\text{C}) . \supset . \mu ^{\nu \times _{c} \varpi } = \Lambda &\qquad \text{(4)}\\ \vdash . *116·205 . &\supset \vdash : \varpi {\sim} \in \text{N}_{0}\text{C} . \supset . (\mu ^\nu )^{\varpi } = \Lambda &\qquad \text{(5)}\\ \vdash . *113·205 . *116·204 . &\supset \vdash : \varpi {\sim} \in \text{N}_{0}\text{C} . \supset . \mu ^{\nu \times _{c} \varpi } = \Lambda &\qquad \text{(6)}\\ \vdash . (3) . (4) . (5) . (6) . &\supset \vdash : {\sim} (\mu , \nu , \varpi \in \text{N}_{0}\text{C}) . \supset . \mu ^{\nu \times _{c} \varpi } = (\mu ^\nu )^{\varpi } &\qquad \text{(7)}\\ \vdash . (2) . (7) . \supset \vdash . \text{Prop} \end{array}$

*116·64. $\vdash . (\mu ^\nu )^{\varpi } = (\mu ^{\varpi })^\nu \quad[*116·63 . *113·27]$

*116·651. $\vdash : Q \in \text{Cls} \rightarrow 1 . \kappa \in \text{Cls}^{2} \text{excl} . \supset . {\in}_{\Delta}ʻP_{\Delta }ʻʻQʻʻʻ\kappa \text{ sm } P_{\Delta }ʻQʻʻsʻ\kappa$

Dem. $\begin{array}{l} \vdash . *84·53 . \supset \vdash : \text{Hp} . &\supset . Qʻʻʻ\kappa \in \text{Cls}^{2} \text{excl}.\\ [*85·43] &\supset . {\in}_{\Delta}ʻP_{\Delta }ʻʻQʻʻʻ\kappa \text{ sm } P_{\Delta }ʻsʻQʻʻʻ\kappa .\\ [*40·38] &\supset . {\in}_{\Delta}ʻP_{\Delta }ʻʻQʻʻʻ\kappa \text{ sm } P_{\Delta }ʻQʻʻsʻ\kappa : \supset \vdash . \text{Prop} \end{array}$

*116·652. $\begin{align}&\vdash : Q \in \text{Cls} \rightarrow 1 . \kappa \in \text{Cls}^{2} \text{excl} . \supset . {\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻQʻʻʻ\kappa \text{ sm } {\in}_{\Delta}ʻQʻʻsʻ\kappa \\ &\left[*116·651 \frac{\in}{P}\right]\end{align}$

The following propositions are lemmas for *116·661, which is an extension of *116·52.

*116·653. $\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . \alpha \downarrow_{,,}ʻʻʻ\kappa \in \text{Cls}^{2} \text{arithm}$

Dem. $\begin{array}{l} \vdash . *113·105 . *84·53 . &\supset \vdash : \text{Hp} . \exists ! \alpha . \supset . \alpha \downarrow_{,,}ʻʻʻ\kappa \in \text{Cls}^{2} \text{excl} &\qquad \text{(1)}\\ \vdash . *113·111 . &\supset \vdash . \alpha \downarrow_{,,}ʻʻsʻ\kappa \in \text{Cls}^{2} \text{excl} .\\ [*40·38] &\supset \vdash . sʻ\alpha \downarrow_{,,}ʻʻʻ\kappa \in \text{Cls}^{2} \text{excl} . &\qquad \text{(2)}\\ \vdash . *113·112·113 . \supset \vdash \colon\ldotp \alpha = \Lambda . \supset : &\beta \in \kappa . \exists ! \beta . \supset . \alpha \downarrow_{,,}ʻʻ\beta = \iota ʻ\Lambda :\\ &\beta \in \kappa . \beta = \Lambda . \supset . \alpha \downarrow_{,,}ʻʻ\beta = \Lambda &\qquad \text{(3)}\\ \vdash . (3) . \supset \vdash \colon\ldotp \alpha = \Lambda . &\supset : \alpha \downarrow_{,,}ʻʻʻ\kappa \subset \iota ʻ\iota ʻ\Lambda \cup \iota ʻ\Lambda :\\ [*24·43·561] &\supset : \rho , \sigma \in \alpha \downarrow_{,,}ʻʻʻ\kappa . \exists ! \rho \cap \sigma . \supset . \rho , \sigma \in \iota ʻ\iota ʻ\Lambda .\\ [*51·15] &\supset . \rho = \sigma :\\ [*84·11] &\supset : \alpha \downarrow_{,,}ʻʻʻ\kappa \in \text{Cls}^{2} \text{excl} &\qquad \text{(4)}\\ \vdash . (1) . (4) . &\supset \vdash : \text{Hp} . \supset . \alpha \downarrow_{,,}ʻʻʻ\kappa \in \text{Cls}^{2} \text{excl} &\qquad \text{(5)}\\ \vdash . (2) . (5) . \supset \vdash . \text{Prop} \end{array}$

*116·654. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\{\text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa \}\text{ sm }\{\alpha \,\,\text{exp}\,\,(sʻ\kappa )\}$

Dem. $\begin{array}{l} \vdash .*38·13.(*116·01).\supset \vdash .\text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa = \text{Prod}ʻ\text{Prod}ʻʻ\alpha \downarrow_{,,}ʻʻʻ\kappa &\qquad \text{(1)}\\ \vdash .(1).*116·653.*115·34.\supset \\ \vdash .\{\text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa \}\text{ sm }\{\text{Prod}ʻsʻ\alpha \downarrow_{,,}ʻʻʻ\kappa\} &\qquad \text{(2)}\\ \vdash .(2).*40·38.(*116·01).\supset \vdash .\text{Prop} \end{array}$

*116·655. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\Pi \text{Nc}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa = (\text{Nc}ʻ\alpha )^{\Sigma \text{Nc}ʻ\kappa } \quad[*116·654]$

The hypothesis $\kappa \in \text{Cls}^{2} \text{excl}$ is unnecessary in the above proposition, as we shall now prove.

*116·656. $\vdash :\exists !\alpha \,\,\text{exp}\,\,\beta \cap \alpha \,\,\text{exp}\,\,\gamma .\supset .\beta = \gamma$

Dem. $\begin{array}{l} \vdash .*116·11.*52·16.\supset \\ \vdash \colon\ldotp \mu \in (\alpha \,\,\text{exp}\,\, \beta )\cap (\alpha \,\,\text{exp}\,\, \gamma ).&\supset :y\in \beta .\supset .(\exists x).x\in \alpha .x\downarrow y\in \mu :\mu \subset \gamma \times \alpha :\\ [*113·101] &\supset :y\in \beta .\supset .(\exists x).x\in \alpha .x\downarrow y\in \mu :x\downarrow y\in \mu .\supset .y\in \gamma :\\ [\text{Syll}] &\supset :y\in \beta .\supset .(\exists x).x\in \alpha .x\downarrow y\in \mu .y\in \gamma .\\ [*10·35] &\supset .y\in \gamma &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \mu \in \alpha \,\,\text{exp}\,\, \beta \cap \alpha \,\,\text{exp}\,\, \gamma .\supset :y\in \gamma .\supset .y\in \beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*116·657. $\vdash .(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa \in \text{Cls}^{2} \text{excl} \quad[*116·656]$

*116·658. $\vdash .\alpha \,\,\text{exp}\,\, (\in \unicode{x21A7}\beta ) = {\mid (\text{Cnv}ʻ\downarrow \beta )}_{\in}ʻʻ(\alpha \,\,\text{exp}\,\, \beta )$

Dem. $\begin{array}{l} \vdash .*116·602·604.*37·401.\supset \vdash .\{\mid (\text{Cnv}ʻ\downarrow \beta )\}_{\in}ʻʻ(\alpha \,\,\text{exp}\,\,\beta ) &= \alpha \,\,\text{exp}\,\,(\beta \downarrow_{,,}\beta )\\ [*85.601] &= \alpha \,\,\text{exp}\,\,(\in \unicode{x21A7}\beta ).\supset \vdash .\text{Prop} \end{array}$

*116·659. $\begin{align}T = \hat{\nu} \hat{\mu}\{(\exists \beta ).\beta \in \kappa .\mu \in \alpha \,\,\text{exp}\,\,\beta .&\nu = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu\}.\supset .\\ &T\in (\alpha \,\,\text{exp}\,\,)ʻʻ\in \unicode{x21A7}ʻʻ\kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\alpha \,\,\text{exp}\,\,)ʻʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash .*40·4. \supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻT = sʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa &\qquad \text{(1)}\\ \vdash .*21·33.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\nu T\mu .\varpi T\mu .\supset .\\ &(\exists \beta ,\gamma ).\beta ,\gamma \in \kappa .\mu \in \alpha \,\,\text{exp}\,\,\beta .\mu \in \alpha \,\,\text{exp}\,\,\gamma .\\ &\nu = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu .\varpi = \mid (\text{Cnv}ʻ\downarrow \gamma )ʻʻ\mu .\\ [*116·656] &\supset .(\exists \beta ,\gamma ).\beta = \gamma .\nu = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu .\varpi = \mid (\text{Cnv}ʻ\downarrow \gamma )ʻʻ\mu .\\ [*13·195] &\supset .\nu = \varpi &\qquad \text{(2)}\\ \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\varpi T\mu .\varpi T\nu .\supset .\\ &(\exists \beta ,\gamma ).\beta ,\gamma \in \kappa .\mu \in \alpha \,\,\text{exp}\,\,\beta .\nu \in \alpha \,\,\text{exp}\,\,\gamma .\\ &\varpi = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu = \mid (\text{Cnv}ʻ\downarrow \gamma )ʻʻ\nu .\\ [*116·658] &\supset .(\exists \beta ,\gamma ).\beta ,\gamma \in \kappa .\mu \in \alpha \,\,\text{exp}\,\, \beta .\nu \in \alpha \,\,\text{exp}\,\, \gamma .\\ &\varpi = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu = \mid (\text{Cnv}ʻ\downarrow \gamma )ʻʻ\nu .\\ &\varpi \in \alpha \,\,\text{exp}\,\, (\in \unicode{x21A7}\beta )\cap \alpha \,\,\text{exp}\,\, (\in \unicode{x21A7}\gamma ).\\ [*116·656] & \supset .(\exists \beta ,\gamma ).\beta ,\gamma \in \kappa .\mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu = \mid (\text{Cnv}ʻ\downarrow \gamma )ʻʻ\nu .\\ &\in \unicode{x21A7}\beta = \in \unicode{x21A7}\gamma .\\ [*85·601] &\supset .(\exists \beta ).\beta \in \kappa .\mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\mu = \mid (\text{Cnv}ʻ\downarrow \beta )ʻʻ\nu .\\ [*116·601.*72·441] &\supset .\mu = \nu &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\supset .T\in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .*116·658.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \kappa .\supset .Tʻʻ(\alpha \,\,\text{exp}\,\, \beta ) = \alpha \,\,\text{exp}\,\, (\in \unicode{x21A7}\beta ):\\ [*37·69] &\supset :\tau _{\in }ʻʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa = (\alpha \,\,\text{exp}\,\,)ʻʻ\in \unicode{x21A7}ʻʻ\kappa &\qquad \text{(5)}\\ \vdash .(1).(4).(5).*111·1 .\supset \vdash .\text{Prop} \end{array}$

*116·66. $\vdash .\text{Prod}ʻ(\alpha \,\,\text{exp}\,)ʻʻ\kappa \text{ sm } \{\alpha \,\,\text{exp}\,\, (\Sigma ʻ\kappa )\}$

Dem. $\begin{array}{l} \vdash .*116·659.*115·51. &\supset \vdash .\text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa \text{ sm } \text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\in \unicode{x21A7}ʻʻ\kappa &\qquad \text{(1)}\\ \vdash .*85·61.*116·654. &\supset \vdash .\text{Prod}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\in \unicode{x21A7}ʻʻ\kappa \text{ sm } \{\alpha \,\,\text{exp}\,\, (sʻ\in \unicode{x21A7}ʻʻ\kappa )\} &\qquad \text{(2)}\\ \vdash .(1).(2).*112·1. \supset \vdash .\text{Prop} \end{array}$

*116·661. $\vdash .\Pi \text{Nc}ʻ(\alpha \,\,\text{exp}\,\,)ʻʻ\kappa = (\text{Nc}ʻ\alpha )^{\Sigma \text{Nc}ʻ\kappa } \quad[*116·66·657.*115·12.*112·101]$

The following propositions are concerned in proving *116·68, which is an extension of *116·54, where the $\alpha$ and $\beta$ of that proposition are replaced by the members of a class $\kappa$ .

*116·67. $\vdash \colon\ldotp \rho = \hat{\lambda} \{(\exists \alpha ).\alpha \in \kappa .\lambda = \alpha \downarrow ʻʻ\gamma\}.\supset :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\rho \in \text{Cls}^{3}\,\text{arithm}$

Dem. $\begin{array}{l} \vdash .*20·3 .\supset \vdash :&\text{Hp}.\lambda ,\mu \in \rho .\exists !\lambda \cap \mu .\supset .\\ &(\exists \alpha ,\beta ).\alpha ,\beta \in \kappa .\lambda = \alpha \downarrow_{,,}ʻʻ\gamma .\mu = \beta \downarrow_{,,}ʻʻ\gamma .\exists !\lambda \cap \mu .\\ [*37·6] &\supset .(\exists \alpha ,\beta ,z,w).\alpha ,\beta \in \kappa .z,w\in \gamma .\alpha \downarrow_{,,}z = \beta \downarrow_{,,}w.\lambda = \alpha \downarrow_{,,}ʻʻ\gamma .\\ &\mu = \beta \downarrow_{,,}ʻʻ\gamma .\\ [*55·262.*38·2]&\supset .(\exists \alpha ,z,w).\alpha \in \kappa .z,w\in \gamma .\lambda = \alpha \downarrow_{,,}ʻʻ\gamma .\mu = \alpha \downarrow_{,,}ʻʻ\gamma .\\ [*13·172] &\supset .\lambda =\mu &\qquad \text{(1)}\\ \vdash .*37·6.*40·11.\supset \\ \vdash :\text{Hp}.\xi ,\eta \in sʻ\rho .\exists !\xi \cap \eta .\supset .\\ &(\exists \alpha ,\beta ,z,w).\alpha ,\beta \in \kappa .z,w\in \gamma .\xi = \alpha \downarrow_{,,}z.\eta = \beta \downarrow_{,,}w.\exists !\xi \cap \eta .\\ [*55·232.*38·2]&\supset .(\exists \alpha ,\beta ,z).\alpha ,\beta \in \kappa .z\in \gamma .\xi = \alpha \downarrow_{,,}z.\eta = \beta \downarrow_{,,}z.\exists !\alpha \cap \beta &\qquad \text{(2)}\\ \vdash .(2).*84·11.\supset \\ \vdash :\text{Hp}.\kappa \in \text{Cls}^{2} \text{excl}.\xi ,\eta \in sʻ\rho .\exists !\xi \cap \eta .&\supset .(\exists \alpha ,\beta ,z).\xi = \alpha \downarrow_{,,}z.\eta = \beta \downarrow_{,,}z.\alpha = \beta .\\ [*13·195·172] &\supset :\xi = \eta &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*116·671. $\vdash \colon\ldotp \sigma = \hat{\mu} \{(\exists z) . z \in \gamma . \mu = \downarrow zʻʻʻ\kappa\} . \supset : \text{Hp} *116·67 . \supset . sʻ\rho = sʻ\sigma$

Dem. $\begin{array}{l} \vdash . *40·11 . \supset \vdash \colon\ldotp \text{Hp} *116·67 . \supset : \xi \in sʻ\rho . &\equiv . (\exists \alpha ) . \alpha \in \kappa . \xi \in \alpha \downarrow_{,,} ʻʻ\gamma .\\ [*38·3] &\equiv . (\exists \alpha , z) . \alpha \in \kappa . z \in \gamma . \xi = \downarrow zʻʻ\alpha .\\ [*37·103] &\equiv . (\exists z) . z \in \gamma . \xi \in \downarrow zʻʻʻ\kappa .\\ [*40·11] &\equiv . \xi \in sʻ\hat{\mu}\{(\exists z) . z \in \gamma . \mu = \downarrow zʻʻʻ\kappa\} \colon\ldotp \\ \supset \vdash . \text{Prop} \end{array}$

*116·672. $\vdash : \text{Hp} *116·671 . \kappa \in \text{Cls}^{2} \text{excl} . \Lambda {\sim} \in \kappa . \supset . \sigma \in \text{Cls}^{2} \text{excl}$

Dem. $\begin{array}{l} \vdash . *37·103 . \supset \vdash : &\text{Hp} . \mu , \nu \in \sigma . \exists ! \mu \cap \nu . \supset .\\ &(\exists z, w, \alpha , \beta ) . z, w \in \gamma . \alpha , \beta \in \kappa . \downarrow zʻʻ\alpha = \downarrow wʻʻ\beta .\\ \mu = \downarrow zʻʻʻ\alpha . \nu = \downarrow wʻʻʻ\beta .\\ [*55·262] &\supset . (\exists z, w, \alpha ) . z, w \in \gamma . \alpha \in \kappa . \downarrow zʻʻ\alpha = \downarrow wʻʻ\alpha .\\ \mu = \downarrow zʻʻʻ\alpha . \nu = \downarrow wʻʻʻ\alpha .\\ [*113·105 . *38·2 . \text{Hp}] &\supset . (\exists z, \alpha ) . \mu = \downarrow zʻʻʻ\alpha . \nu = \downarrow zʻʻʻ\alpha .\\ [*13·172] &\supset . \mu = \nu : \supset \vdash . \text{Prop} \end{array}$

*116·673. $\vdash : \text{Hp} *116·672 . \supset . {\in}_{\Delta}ʻ(\,\,\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } {\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\sigma$

Dem. $\begin{array}{l} \vdash . *38·131 . (*116·01) . \supset \vdash . {\in}_{\Delta}ʻ(\,\,\text{exp}\,\, \gamma )ʻʻ\kappa &= {\in}_{\Delta}ʻ\hat{\xi} \{(\exists \alpha ) . \alpha \in \kappa . \xi = \text{Prod}ʻ\alpha \downarrow_{,,} ʻʻ\gamma\}\\ [*37·6] &= {\in}_{\Delta}ʻ\text{Prod}ʻʻ\hat{\lambda} \{(\exists \alpha ) . \alpha \in \kappa . \lambda = \alpha \downarrow_{,,} ʻʻ\gamma\} &\qquad \text{(1)}\\ \vdash . (1) . *115·33 . *116·67 . \supset \\ \vdash : \text{Hp} . &\supset . {\in}_{\Delta}ʻ(\,\,\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } {\in}_{\Delta}ʻsʻ\hat{\lambda} \{(\exists \alpha ) . \alpha \in \kappa . \lambda = \alpha \downarrow_{,,} ʻʻ\gamma\} .\\ [*116·671] &\supset . {\in}_{\Delta}ʻ(\,\,\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } {\in}_{\Delta}ʻsʻ\sigma .\\ [*85·44 . *116·672] &\supset . {\in}_{\Delta}ʻ(\,\,\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } {\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\sigma : \supset \vdash . \text{Prop} \end{array}$

*116·674. $\begin{align}\vdash \colon\ldotp &M = \hat{R} \hat{z} \{R = (\downarrow z) \parallel \text{Cnv}ʻ(\downarrow z)_{\in }\} . \supset :\\ &(z) . Mʻz \in 1 \rightarrow 1 . \text{D}ʻ(Mʻz) \upharpoonright {\in}_{\Delta}ʻ\kappa = {\in}_{\Delta}ʻ \downarrow zʻʻʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash . *30·3 . &\supset \vdash : \text{Hp} . \supset . Mʻz = (\downarrow z) \parallel \text{Cnv}ʻ(\downarrow z)_{\in } &\qquad \text{(1)}\\ \vdash . *72·184 . *111·14 . &\supset \vdash . \downarrow z \upharpoonright \kappa \in (\downarrow zʻʻʻ\kappa ) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \kappa .\\ [*114·51] &\supset \vdash . {\downarrow z \parallel \text{Cnv}ʻ(\downarrow z)_{\in }} \upharpoonright {\in}_{\Delta}ʻ\kappa \in ({\in}_{\Delta}ʻ \downarrow zʻʻʻ\kappa ) \,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\kappa ) &\qquad \text{(2)}\\ \vdash . (1) . (2) . *73·03 . &\supset \vdash . \text{Prop} \end{array}$

*116·675 . $\vdash \colon\ldotp \text{Hp} *116·674 . \exists ! sʻ\kappa . \supset : \exists ! (Mʻw)ʻʻ{\in}_{\Delta}ʻ\kappa \cap (Mʻ\nu )ʻʻ{\in}_{\Delta}ʻ\kappa . \supset . w = v$

Dem. $\begin{array}{l} \vdash . *116·674 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : \exists ! (Mʻw)ʻʻ{\in}_{\Delta}ʻ\kappa \cap (Mʻv)ʻʻ{\in}_{\Delta}ʻ\kappa . \supset .\\ &\exists ! {\in}_{\Delta}ʻ \downarrow wʻʻʻ\kappa \cap {\in}_{\Delta}ʻ \downarrow vʻʻʻ\kappa .\\ [*80·32] &\supset . \downarrow wʻʻʻ\kappa = \downarrow vʻʻʻ\kappa .\\ [*40·38] &\supset . \downarrow wʻʻsʻ\kappa = \downarrow vʻʻsʻ\kappa .\\ [*113·105 . *38·2] &\supset . w = v \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*116·676. $\begin{align}\vdash : \text{Hp} *116·672·675 . \supset . \text{Prod}ʻ&\text{D}ʻʻ\upharpoonright ({\in}_{\Delta}ʻ\kappa )ʻʻMʻʻ\gamma \text{ sm } ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma .\\ &\text{D}ʻʻ \upharpoonright ({\in}_{\Delta}ʻ\kappa )ʻʻMʻʻ\gamma = {\in}_{\Delta}ʻʻ\sigma\end{align}$

Dem. $\begin{array}{l} \vdash . *116·674·675 . *116·45 \frac{{\in}_{\Delta}ʻ\kappa,\,\gamma} {\gamma,\,\delta}. \supset \\ \vdash : \text{Hp} . &\supset . \text{Prod}ʻ\text{D}ʻʻ \upharpoonright ({\in}_{\Delta}ʻ\kappa )ʻʻMʻʻ\gamma \text{ sm } ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma &\qquad \text{(1)}\\ \vdash . *116·674 . &\supset \vdash : \text{Hp} . \supset . \text{D}ʻʻ \upharpoonright ({\in}_{\Delta}ʻ\kappa )ʻʻMʻʻ\gamma = \hat{\mu} \{(\exists z) . z \in \gamma . \mu = {\in}_{\Delta}ʻ \downarrow zʻʻʻ\kappa\}\\ [*37·6 . \text{Hp}] &= {\in}_{\Delta}ʻʻ\sigma &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*116·68. $\begin{align}\vdash : \kappa \in \text{Cls}^{2} \text{excl} . \supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } &({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma .\\ &\Pi \text{Nc}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa = (\Pi \text{Nc}ʻ\kappa )^{\text{Nc}ʻ\gamma }\end{align}$

Dem. $\begin{array}{l} \vdash . *115·12 . *84·55 . &\supset \vdash . \text{Prod}ʻ{\in}_{\Delta}ʻʻ\sigma \text{ sm } {\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\sigma &\qquad \text{(1)}\\ \vdash . (1) . *116·673·676 . \supset \\ \vdash : \text{Hp} . \Lambda {\sim} \in \kappa . \exists ! sʻ\kappa . &\supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma)ʻʻk \text{ sm } ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma &\qquad \text{(2)}\\ \vdash . *53·24 . \supset \vdash : \Lambda {\sim} \in \kappa . {\sim} \exists ! sʻ\kappa . &\supset . \kappa = \Lambda .\\ [*83·15 . *116·33] &\supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa = \iota ʻ\dot{\Lambda} . ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma \in 1 .\\ [*73·45] &\supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma &\qquad \text{(3)}\\ \vdash . *83·11 . *116·182 . \supset \vdash : \Lambda \in \kappa . \exists ! \gamma . &\supset . {\in}_{\Delta}ʻ\kappa = \Lambda . \Lambda \in (\text{exp}\,\, \gamma )ʻʻ\kappa .\\ [*116·182 . *83·11] &\supset . ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma = \Lambda . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa = \Lambda &\qquad \text{(4)}\\ \vdash . *116·181 . &\supset \vdash : \Lambda \in \kappa . \gamma = \Lambda . \supset . ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma = \iota ʻ\Lambda &\qquad \text{(5)}\\ \vdash . *116·181 . &\supset \vdash : \Lambda \in \kappa . \gamma = \Lambda . \supset . (\text{exp}\,\, \gamma )ʻʻ\kappa = \iota ʻ\iota ʻ\Lambda .\\ [*83·41] &\supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } \iota ʻ\Lambda &\qquad \text{(6)}\\ \vdash . (4) . (5) . (6) . &\supset \vdash : \Lambda \in \kappa . \supset . {\in}_{\Delta}ʻ(\text{exp}\,\, \gamma )ʻʻ\kappa \text{ sm } ({\in}_{\Delta}ʻ\kappa ) \,\,\text{exp}\,\, \gamma &\qquad \text{(7)}\\ \vdash . (2) . (3) . (7) . *114·1 . *116·25 . \supset \vdash . \text{Prop} \end{array}$

The following propositions are lemmas for $\text{Nc}ʻ\text{Cl}ʻ\alpha = 2^{\text{Nc}ʻ\alpha } .$

*116·7. $\vdash . \text{Nc}ʻ\{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha \}_{\Delta }ʻ\alpha = 2^{\text{Nc}ʻ\alpha }$

Dem. $\begin{array}{l} \vdash . *24·1 .*101·3 . \supset \vdash . \text{Nc}ʻ(\iota ʻ\Lambda \cup \iota ʻ\text{V}) &= 2 &\qquad \text{(1)}\\ \vdash . *116·15 . \supset \vdash . \text{Nc}ʻ{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha }_{\Delta }ʻ\alpha &= \text{Nc}ʻ\{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \,\,\text{exp}\,\, \alpha\}\\ [*116·25] &= {\text{Nc}ʻ(\iota ʻ\Lambda \cup \iota ʻ\text{V})}^{\text{Nc}ʻ\alpha }\\ [(1)] &= 2^{\text{Nc}ʻ\alpha } . \supset \vdash . \text{Prop} \end{array}$

In this and following propositions, the class $\iota ʻ\Lambda \cup\iota ʻ\text{V}$ is introduced solely as a known class consisting of two terms. Any other class of two terms will serve equally well.

*116·71. $\vdash : R \in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha\}_{\Delta }ʻ\alpha . \supset . \overleftarrow{R}ʻ\text{V} = \alpha - \overleftarrow{R}ʻ\Lambda$

Dem. $\begin{array}{l} \vdash . *116·12 . \supset \vdash : \text{Hp} . &\supset . R \in 1 \rightarrow \text{Cls} . \text{D}ʻR \subset \iota ʻ\Lambda \cup \iota ʻ\text{V} . \text{ᗡ}ʻR = \alpha &\qquad \text{(1)}\\ [*37·271] \supset . \alpha &= \breve{R} ʻʻ(\iota ʻ\Lambda \cup \iota ʻ\text{V})\\ [*53·302] &= \overleftarrow{R}ʻ\Lambda \cup \overleftarrow{R}ʻ\text{V} &\qquad \text{(2)}\\ \vdash . (1) . *71·18 . &\supset \vdash : \text{Hp} . \supset . \overleftarrow{R}ʻ\Lambda \cap \overleftarrow{R}ʻ\text{V} = \Lambda &\qquad \text{(3)}\\ \vdash . (2) . (3) . *24·47 . \supset \vdash . \text{Prop} \end{array}$

*116·711. $\vdash : R, S \in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha\}_{\Delta }ʻ\alpha . \overleftarrow{R}ʻ\Lambda = \overleftarrow{S}ʻ\Lambda . \supset . R = S$

Dem. $\begin{array}{l} \vdash . *116·71 . &\supset \vdash : \text{Hp} . \supset . \overleftarrow{R}ʻ\text{V} = \overleftarrow{S}ʻ\text{V} &\qquad \text{(1)}\\ \vdash . (1) . *116·12 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : \gamma \in \text{D}ʻR \cup \text{D}ʻS . \supset _{\gamma } . \overleftarrow{R}ʻ\gamma = \overleftarrow{S}ʻ\gamma :\\ [*33·48] &\supset : R = S \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*116·712. $\begin{align}&\vdash \colon\ldotp T = \hat{\mu} \hat{R} [R \in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha \}_{\Delta }ʻ\alpha . \mu = \overleftarrow{R}ʻ\Lambda ] . \supset :\\ &R \in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha\}_{\Delta }ʻ\alpha . \supset . TʻR = \overleftarrow{R}ʻ\Lambda :\text{ᗡ}ʻT = \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha\}_{\Delta }ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash . *21·33 .& \supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp R \in {(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha }_{\Delta }ʻ\alpha . \supset : \mu TR . \equiv _{\mu } . \mu = \overleftarrow{R}ʻ\Lambda :\\ [*30.3] &\supset : TʻR = \overleftarrow{R}ʻ\Lambda &\qquad \text{(1)}\\ \vdash . (1) . *14·21 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : R \in {(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha }_{\Delta }ʻ\alpha . \supset . \text{E}! TʻR .\\ [*33·43] &\supset . R \in \text{ᗡ}ʻT &\qquad \text{(2)}\\ \vdash . *21·33 . *33·131 . &\supset \vdash : \text{Hp} . \supset · \text{ᗡ}ʻT \subset {(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha }_{\Delta }ʻ\alpha &\qquad \text{(3)}\\ \vdash (1) . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *116·712 . *14·21 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : R \in \text{ᗡ}ʻT . \supset . \text{E}! TʻR :\\ [*71·16] &\supset : R \in 1 \rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *116·712.711 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : R, S \in \text{ᗡ}ʻT . TʻR = TʻS . \supset . R = S &\qquad \text{(2)}\\ \vdash . (1) . (2) . *71·55 . \supset \vdash . \text{Prop} \end{array}$

*116.714. $\begin{align}\vdash : \text{Hp} *116·712 . \mu \in \text{Cl}ʻ\alpha . &R = \hat{\gamma} \hat{x} \{\gamma = \Lambda . x \in \mu . \lor . \gamma = \text{V} . x \in \alpha - \mu\} . \supset .\\ &R \in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V}) \uparrow \alpha\}_{\Delta }ʻ\alpha . \mu = TʻR\end{align}$

Dem. $\begin{array}{l} \vdash . *21·33 . *33·13 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : \gamma \in \text{D}ʻR . \supset . \gamma \in \iota ʻ\Lambda \cup \iota ʻ\text{V} &\qquad \text{(1)}\\ \vdash . *21·33 . *33·131 . &\supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp x \in \text{ᗡ}ʻR . \equiv :\\ &(\exists \gamma ) : \gamma = \Lambda . x \in \mu . \lor . \gamma = \text{V} . x \in \alpha - \mu :\\ [*10·42 . *13·19] &\equiv : x \in \mu . \lor . x \in \alpha - \mu : &\qquad \text{(2)}\\ [*24·411 . \text{Hp}] &\equiv : x \in \alpha &\qquad \text{(3)}\\ \vdash .*21·33.*30·3.&\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \mu .\supset _{x}.Rʻx=\Lambda :x\in \alpha -\mu .\supset _{x}.Rʻx =\text{V}:\\ [(2).*14·21] &\supset :x\in \text{ᗡ}ʻR.\supset _{x}.\text{E}!Rʻx:\\ [*71·16] &\supset :R\in 1\rightarrow \text{Cls} &\qquad \text{(4)}\\ \vdash .*21·33. &\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \gamma =\Lambda .\supset :\gamma Rx.\equiv _{x}.x\in \mu :\\ [*32·181] &\supset :\overleftarrow{R}ʻ\gamma =\mu &\qquad \text{(5)}\\ \vdash .(1).(3).(4).*116·12.&\supset \vdash :\text{Hp}.\supset .R\in \{(\iota ʻ\Lambda \cup \iota ʻ\text{V})\uparrow \alpha\}_{\Delta }ʻ\alpha &\qquad \text{(6)}\\ \vdash .(5).(6).*116·712. & \supset \vdash :\text{Hp}.\supset .\mu =TʻR &\qquad \text{(7)}\\ \vdash .(6).(7).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*116·714.*33·43.&\supset \vdash :\text{Hp}.\supset .\text{Cl}ʻ\alpha \subset \text{D}ʻT &\qquad \text{(1)}\\ \vdash .*21·33. *33·13.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\mu \in \text{D}ʻT.\supset .(\exists R).R\in {(\iota ʻ\Lambda \cup \iota ʻ\text{V})\uparrow \alpha }_{\Delta }ʻ\alpha .\mu =\overleftarrow{R}ʻ\Lambda .\\ [*33·151] &\supset .(\exists R).R\in {(\iota ʻ\Lambda \cup \iota ʻ\text{V})\uparrow \alpha }_{\Delta }ʻ\alpha .\mu \subset \text{ᗡ}ʻR.\\ [*80·14] &\supset .\mu \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*116·712·713·715.\supset \vdash .\text{Cl}ʻ\alpha \text{ sm }\{(\iota ʻ\Lambda \cup \iota ʻ\text{V})\uparrow \alpha\}_{\Delta }ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*116·7.\supset \vdash . \text{Prop} \end{array}$

*116·8. $\vdash .\text{Rl}ʻ(\rho \uparrow \sigma )=\dot{s} ʻʻ\text{Cl}ʻ(\sigma \times \rho )$

Dem. $\begin{array}{l} \vdash .*60·2.&\supset \vdash \colon\ldotp R\in \dot{s} ʻʻ\text{Cl}ʻ(\sigma x\rho ).\equiv :(\exists \lambda ).\lambda \subset \sigma \times \rho .R=\dot{s} ʻ\lambda :\\ [*113·101]&\equiv :(\exists \lambda ):P\in \lambda .\supset _{P}.(\exists x,y).x\in \rho .y\in \sigma .P=x\downarrow y:R=\dot{s} ʻ\lambda :\\ [*41·11]&\equiv :(\exists \lambda ):P\in \lambda .\supset _{P}.(\exists x,y).x\in \rho .y\in \sigma .P=x\downarrow y:\\ uRv.\equiv _{u,v}.(\exists P).P\in \lambda .uPv:\\ [*10·56] &\supset :uRv.\supset _{u,v}.(\exists x,y).x\in \rho .y\in \sigma .u(x\downarrow y)v:\\ [*55·13] &\supset :uRv.\supset _{u,v}.u\in \rho .v\in \sigma :\\ [*35·103]. &\supset :R\,\unicode{x2abd}\, \rho \uparrow \sigma &\qquad \text{(1)}\\ \vdash .*35·103.*113·101.\supset \\ \vdash :R\,\unicode{x2abd}\, \rho \uparrow \sigma .\lambda& =\hat{P} \{(\exists x,y).xRy.P=x\downarrow y\}.\supset .\lambda \subset \sigma \times \rho &\qquad \text{(2)}\\ \vdash .*41·11.*13·195.\supset \\ \vdash \colon\ldotp \text{Hp}(2).\supset :u(\dot{s} ʻ\lambda )v.&\equiv .(\exists x,y).xRy.u(x\downarrow y)v.\\ [*55·13] &\equiv .uRv &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash :R\,\unicode{x2abd}\, \rho \uparrow \sigma .\supset .(\exists \lambda ).\lambda \subset \sigma \times \rho .R=\dot{s} ʻ\lambda &\qquad \text{(4)}\\ \vdash .(1).(4).&\supset \vdash .\text{Prop} \end{array}$

*116·81. $\vdash .\dot{s} \upharpoonright \text{Cl}ʻ(\sigma \times \rho )\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*41·13.&\supset \vdash \colon\ldotp \alpha ,\beta \in \text{Cl}ʻ(\sigma \times \rho ).\dot{s} ʻ\alpha =\dot{s} ʻ\beta .x\downarrow y\in \alpha .\supset :x\downarrow y\,\unicode{x2abd}\, \dot{s} ʻ\beta :\\ [*41·11] &\supset :(\exists P).P\in \beta .x\downarrow y\,\unicode{x2abd}\, P:\\ [*113·101.\text{Hp}] &\supset :(\exists P,u,v).P\in \beta .P=u\downarrow v.x\downarrow y\,\unicode{x2abd}\, u\downarrow v:\\ [*55·134·34] &\supset :(\exists P,u,v).P\in \beta .P=u\downarrow v.x\downarrow y=u\downarrow v:\\ [*13·172·13] &\supset :x\downarrow y\in \beta &\qquad \text{(1)}\\ \vdash .(1)\frac{\beta,\,\alpha}{\alpha,\,\beta}.&\supset \vdash :\alpha ,\beta \in \text{Cl}ʻ(\sigma \times \rho ).\dot{s} ʻ\alpha =\dot{s} ʻ\beta .x\downarrow y\in \beta .\supset .x\downarrow y\in \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*113·101.&\supset \vdash :\alpha ,\beta \in \text{Cl}ʻ(\sigma \times \rho ).\dot{s} ʻ\alpha =\dot{s} ʻ\beta .\supset .\alpha =\beta &\qquad \text{(3)}\\ \vdash .(3).*71·55.*72·163.\supset \vdash .\text{Prop} \end{array}$

*116·82. $\vdash .\text{Rl}ʻ(\rho \uparrow \sigma )\text{ sm } \text{Cl}ʻ(\sigma \times \rho ) \quad[*116·8·81]$

*116·83. $\vdash .\text{Nc}ʻ\text{Rl}ʻ(\rho \uparrow \sigma )=2^{\text{Nc}ʻ\rho \times _{c}\text{Nc}ʻ\sigma } \quad[*116·82·72 .*113·25]$

*116·9. $\vdash :\text{Nc}ʻtʻx=\mu .\supset .\text{Nc}ʻt^{2}ʻx=2^\mu \quad[*116·72.*63·66]$

*116·901. $\vdash :\text{Nc}ʻt_{0}ʻ\alpha =\mu .\supset .\text{Nc}ʻtʻ\alpha =2^\mu \quad[*116·72.*63·65]$

*116·91. $\vdash :\text{Nc}ʻt_{0}ʻ\alpha =\mu .\supset .\text{Nc}ʻt_{00}ʻ\alpha =2^{\mu ^{2}} \quad[*116·83.*64·5·11]$

*116·92. $\begin{align}&\vdash :\text{Nc}ʻt_{0}ʻ\alpha =\mu .\supset .\text{Nc}ʻt_{0}^{1}ʻ\alpha =2^{\mu \times _{c}2^\mu }.\text{Nc}ʻt^{11}ʻ\alpha =2^{2^\mu \times _{c}2^\mu }.\text{etc}.\\ &[*116·83.*64·16.*116·901]\end{align}$

A cardinal $\mu$ is said to be greater than another cardinal $\nu$ when there is a class $\alpha$ which has $\mu$ terms and has a part which has $\nu$ terms, while there is no class $\beta$ which has $\nu$ terms and has a part which has $\mu$ terms. The relation "greater than" is transitive and asymmetrical; and by the Schröder-Bernstein theorem, if $\mu$ is greater than or equal to $\nu$ , and $\nu$ is greater than or equal to $\mu$ , then $\mu = \nu$ . But we cannot prove that of any two cardinals one must be the greater, unless we assume the multiplicative axiom. The proof then follows from Zermelo's theorem that on that assumption every class can be well-ordered. This subject will be dealt with at a later stage.

The form of the definitions is so arranged as to allow of the inequality of two cardinals in different types. The relevant considerations are the same as for the definitions of addition, multiplication and exponentiation.

*117·01. $\begin{align}\mu \gt \nu .=.(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =&\text{N}_{0}\text{c}ʻ\beta .\\ &\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha \quad\text{Df}\end{align}$

We also define " $\mu \gt \text{Nc}ʻ\alpha$ " as meaning " $\mu \gt \text{N}_{0}\text{c}ʻ\alpha$ ," and " $\text{Nc}ʻ\alpha \gt \nu$ " as meaning " $\text{N}_{0}\text{c}ʻ\alpha \gt \nu$ ," for the reasons explained in *110. It then easily follows that if $\mu \gt \nu$ , $\mu$ and $\nu$ must be homogeneous cardinals (this is part of *117·15); that if $\mu$ and $\nu$ are homogeneous cardinals, and $\mu \gt \nu$ , the same holds if we substitute $\text{ sm }ʻʻ\mu$ and $\text{ sm }ʻʻ\nu$ for one or both of $\mu$ and $\nu$ (*117·16); that

*117·13. $\vdash :\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta .\equiv .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha$

*117·14. $\vdash :\mu \gt \nu .\equiv .(\exists \alpha ,\beta ).\mu = \text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta$

We cannot define " $\mu \geq \nu$ " as " $\mu \gt \nu .\lor.\mu =\nu$ ," because " $\mu =\nu$ " restricts $\mu$ and $\nu$ too much by requiring that they should be of the same type, and restricts them too little by not requiring that they should both be existent cardinals. To avoid both these inconveniences, we put

*117·05. $\mu \geq \nu .=:\mu \gt \nu .\lor.\mu ,\nu \in \text{N}_{0}\text{C}.\mu =\text{ sm }ʻʻ\nu \quad\text{Df}$

*117·108. $\vdash \colon\ldotp \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv :\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta .\lor.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

*117·24. $\vdash :\mu \geq \nu .\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta$

In *117·2, we repeat the Schröder-Bernstein theorem (*73·88), which is required in most of the remaining propositions of this number. It leads at once to the propositions

*117·22. $\vdash :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta$

*117·221. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv .(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta$

*117·222. $\vdash :\beta \subset \alpha .\supset .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta$

*117·23. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\beta \geq \text{Nc}ʻ\alpha .\equiv .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

This last proposition may be called the Schröder-Bernstein theorem with as much propriety as *73·88; the two are scarcely different.

If we now revert to the definition of $\mu \gt \nu$ , or to *117·13, and apply *117·22, we see (*117·26) that " $\text{Nc}ʻ\alpha>\text{Nc}ʻ\beta$ " may be conveniently regarded as asserting $\text{Nc}ʻ\alpha \geq\text{Nc}ʻ\beta .{\sim}(\text{Nc}ʻ\beta \geq \text{Nc}ʻ\alpha)$ ; in fact, the best ideas to work with are $\geq$ and its converse $\leq$ , which for practical purposes we regard as defined by *117·22, and from which we derive $\gt$ and $\lt$ . The relation $\gt$ will be the product of $\geq$ into the negation of its converse; this holds for $\mu$ and $\nu$ (*117·281) as well as for $\text{Nc}ʻ\alpha$ and $\text{Nc}ʻ\beta$ .

*117·3 ·31 constitute an important use of *110·72, namely to prove that one existent cardinal is greater than another or equal to it when the first can be obtained by adding to the second (where what is added must be a cardinal). That is to say, we have

*117·3. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv .(\exists \varpi ).\varpi \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\varpi$

*117·31. $\vdash \colon\ldotp \mu \geq \nu .\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \varpi ).\varpi \in \text{NC}.\mu =\nu +_{c}\varpi$

*117·4—·471 are concerned in proving that $\gt$ and $\geq$ are transitive, that $\gt$ is asymmetrical (*117·42), and allied propositions.

Our next set of propositions is concerned with 0 and 1 and 2. We prove that a homogeneous cardinal is whatever is greater than or equal to 0 (*117·501); that a homogeneous cardinal other than 0 is whatever is greater than 0 (*117·511); that a homogeneous cardinal other than 0 is whatever is greater than or equal to 1 (*117·531); and that a homogeneous cardinal other than 0 and 1 is whatever is greater than 1 (*117·55), and is whatever is greater than or equal to 2 (*117·551).

We next prove a set of propositions concerning $\geq$ which have no analogues for $\gt$ , except when the cardinals concerned are finite. Thus e.g. we prove

*117·561. $\vdash :\mu \geq \nu .\varpi \in \text{N}_{0}\text{C}.\supset .\mu +_{c}\varpi \geq \nu +_{c}\varpi$

If we substitute $\gt$ for $\geq$ , this no longer holds. Thus e.g. put $\mu =2$ , $\nu =1$ , $\varpi =\aleph _{0}$ (cf. *123); then $\mu >\nu$ , but $\mu +_{c}\varpi =\nu +_{c}\varpi =\varpi$ . Similar remarks apply to the analogous propositions (*117·571 ·581 ·591) on multiplication and exponentiation.

We prove next that a sum is greater than or equal to either of its summands (*117·6); that a product neither of whose factors vanishes is greater than or equal to either of its factors (*117·62); that, assuming $\mu$ and $\nu$ are existent cardinals, then if they are neither 0 nor 1, their product is greater than or equal to their sum (*117·631), and if $\mu$ is neither 0 nor 1, then $\mu ^\nu \geq \mu\times _{c} \nu$ (*117·652).

The propositions of this number are much used in the following section, on finite and infinite.

*117·01. $\begin{align}\mu \gt \nu . = . (\exists \alpha , \beta ) . &\mu = \text{N}_{0}\text{c}ʻ\alpha . \nu = \text{N}_{0}\text{c}ʻ\beta .\\ &\exists ! \text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta . {\sim} \exists ! \text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha \quad\text{Df}\end{align}$

*117·02. $\mu \gt \text{Nc}ʻ\alpha . = . \mu \gt \text{N}_{0}\text{c}ʻ\alpha \quad\text{Df}$

*117·03. $\text{Nc}ʻ\alpha \gt \nu . = . \text{N}_{0}\text{c}ʻ\alpha \gt \nu \quad\text{Df}$

*117·05. $\mu \geq \nu . = : \mu \gt \nu . \lor . \mu , \nu \in \text{N}_{0}\text{C} .\mu = \text{ sm }ʻʻ\nu \quad\text{Df}$

*117·1. $\begin{align}\vdash : \mu \gt \nu . &\equiv . (\exists \alpha , \beta ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \nu = \text{N}_{0}\text{c}ʻ\beta .\\ &\exists ! \text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta . {\sim} \exists ! \text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha \quad[(*117·01)]\end{align}$

*117·101. $\vdash : \mu \gt \text{Nc}ʻ\beta . \equiv . \mu \gt \text{N}_{0}\text{c}ʻ\beta \quad[(*117·02)]$

*117·102. $\vdash : \text{Nc}ʻ\alpha > \nu . \equiv . \text{N}_{0}\text{c}ʻ\alpha > \nu \quad[(*117·03)]$

*117·104. $\vdash \colon\ldotp \mu \geq \nu . \equiv : \mu > \nu . \lor . \mu , \nu \in \text{N}_{0}\text{C} . \mu = \text{ sm }ʻʻ\nu \quad[(*117·05)]$

*117·106. $\vdash : \text{Nc}ʻ\alpha > \text{Nc}ʻ\beta . \equiv . \text{N}_{0}\text{c}ʻ\alpha > \text{N}_{0}\text{c}ʻ\beta \quad [*117·101·102]$

*117·107. $\vdash : \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta . \equiv . \text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta$

Dem. $\begin{array}{l} \vdash . *117·104·106 . \supset \\ \vdash \colon\ldotp \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta . &\equiv : \text{N}_{0}\text{c}ʻ\alpha > \text{N}_{0}\text{c}ʻ\beta . \lor . \text{Nc}ʻ\alpha , \text{Nc}ʻ\beta \in \text{N}_{0}\text{C} . \text{Nc}ʻ\alpha = \text{ sm }ʻʻ\text{Nc}ʻ\beta :\\ [*100·511 . *103·22] &\equiv : \text{N}_{0}\text{c}ʻ\alpha > \text{N}_{0}\text{c}ʻ\beta . \lor . \text{Nc}ʻ\alpha , \text{Nc}ʻ\beta \in \text{N}_{0}\text{C} . \text{Nc}ʻ\alpha = \text{Nc}ʻ\beta :\\ [*103·16] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \gt \text{N}_{0}\text{c}ʻ\beta . \lor . \text{Nc}ʻ\alpha , \text{Nc}ʻ\beta \in \text{N}_{0}\text{C} . \text{Nc}ʻ\alpha = \text{N}_{0}\text{c}ʻ\beta :\\ [*103·21] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \gt \text{N}_{0}\text{c}ʻ\beta . \lor . \text{Nc}ʻ\beta \in \text{N}_{0}\text{C} . \text{Nc}ʻ\alpha = \text{N}_{0}\text{c}ʻ\beta :\\ [*103·16] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \gt \text{N}_{0}\text{c}ʻ\beta . \lor . \text{Nc}ʻ\beta \in \text{N}_{0}\text{C} . \text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta :\\ [*103·2] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \gt \text{N}_{0}\text{c}ʻ\beta . \lor . \text{N}_{0}\text{c}ʻ\alpha = \text{Nc}ʻ\beta :\\ [*103·4] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \gt \text{N}_{0}\text{c}ʻ\beta . \lor . \text{N}_{0}\text{c}ʻ\alpha = \text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\beta :\\ [*103·21 . *117·104] &\equiv : \text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*117·108. $\begin{align}&\vdash \colon\ldotp \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv :\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta .\lor.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta \\ &[*117·107·106·104. *103·16·4]\end{align}$

*117·11. $\vdash \colon\ldotp \alpha \text{ sm } \alpha'.\beta \text{ sm } \beta'. \supset : \exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\equiv .\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta'$

Dem. $\begin{array}{l} \vdash .*100·321.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta .\equiv .\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta' &\qquad \text{(1)}\\ \vdash .*73·21.\supset \\ \vdash : R\in 1\rightarrow &1.\text{D}ʻR=\alpha .\text{ᗡ}ʻR=\alpha'.\gamma \subset \alpha .\gamma \in \text{Nc}ʻ\beta .\supset .\\ &\breve{R} ʻʻ\gamma \subset \alpha'.\breve{R} ʻʻ\gamma \in \text{Nc}ʻ\beta .\\ [*60·2]&\supset .\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35.*73·1.\supset \\ \vdash :\alpha \text{ sm } \alpha'.\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .&\supset .\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta &\qquad \text{(3)}\\ \vdash .(3)\frac{\alpha',\,\alpha}{\alpha,\,\alpha'}.&\supset \vdash :\alpha \text{ sm } \alpha'.\exists !\text{Cl}ʻ\alpha'\cap \text{Nc}ʻ\beta .\supset .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash \colon\ldotp \alpha \text{ sm } \alpha '.\supset :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\equiv .\exists !\text{Cl}ʻ\alpha ʻ\cap \text{Nc}ʻ\beta &\qquad \text{(5)}\\ \vdash .(1).(5).&\supset \vdash . \text{Prop} \end{array}$

*117·12. $\begin{align}\vdash \colon\ldotp \mu >&\nu .\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:\\ &\gamma \in \mu .\delta \in \nu .\supset _{\gamma ,\delta }.\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*117·1·11.\supset \\ \vdash \colon\ldotp \mu >\nu .\equiv :(\exists \alpha ,\beta ):&\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha :\\ &\gamma \in \mu .\delta \in \nu .\supset _{\gamma ,\delta }.\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma :\\ [*103·12]&\equiv :(\exists \alpha ,\beta ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\alpha \in \mu .\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\\ &{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha :\\ &\gamma \in \mu .\delta \in \nu .\supset _{\gamma ,\delta }.\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma :\\ [*10·55] &\equiv :(\exists \alpha ,\beta ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\alpha \in \mu .\beta \in \nu :\\ &\gamma \in \mu .\delta \in \nu .\supset _{\gamma ,\delta }.\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma :\\ [*103·12·2]&\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:\gamma \in \mu .\delta \in \nu .\supset _{\gamma ,\delta }.\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma \colon\ldotp \\ &\supset \vdash . \text{Prop} \end{array}$

*117·121. $\begin{align}\vdash \colon\ldotp \mu >&\nu .\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:\\ &\alpha \in \mu .\supset _{\alpha }.(\exists \beta ).\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*117·1·11.\supset \\ \vdash \colon\ldotp \mu >\nu .\equiv :&(\exists \alpha ,\beta ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\\ &{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha :\\ &\gamma \in \mu .\supset _{\gamma }.(\exists \delta ).\delta \in \nu .\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma \\ [*103·12.*10·55]&\equiv :(\exists \alpha ,\beta ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\alpha \in \mu :\\ &\gamma \in \mu .\supset _{\gamma }.(\exists \delta ).\delta \in \nu .\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}^\gamma \\ [*103·12·2] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:\gamma \in \mu .\supset _{\gamma }.(\exists \delta ).\delta \in \nu .\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .\\ &{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The above proof is given shortly because it proceeds on the same lines as *117·12. In applying *10·55, the $\phi x$ of that proposition is replaced by $\alpha \in \mu$ , and the $\psi x$ is replaced by $(\exists \beta ).\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha .$

*117·13. $\vdash :\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\equiv .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*117·106.\supset \\ \vdash \colon\ldotp \text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .&\equiv :\text{N}_{0}\text{c}ʻ\alpha >\text{N}_{0}\text{c}ʻ\beta :\\ [*103·2.*117·12] &\equiv :\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\delta \in \text{N}_{0}\text{c}ʻ\beta .\supset _{\gamma ,\delta }.\\ &\exists !\text{Cl}ʻ\gamma \cap \text{Nc}ʻ\delta .{\sim}\exists !\text{Cl}ʻ\delta \cap \text{Nc}ʻ\gamma :\\ [*100·31.*117·11] &\equiv :\gamma \in \text{N}_{0}\text{c}ʻ\alpha .\delta \in \text{N}_{0}\text{c}ʻ\beta .\supset _{\gamma ,\delta }.\\ &\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha :\\ [*10·23] &\equiv :\exists !\text{N}_{0}\text{c}ʻ\alpha .\exists !\text{N}_{0}\text{c}ʻ\beta .\supset .\\ &\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha :\\ [*103·13] &\equiv :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*117·14. $\begin{align}&\vdash :\mu \gt \nu .\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \gt \text{Nc}ʻ\beta \\ &[*117·1·13]\end{align}$

*117·15. $\vdash :\mu \gt \nu .\equiv .\mu ,\nu \in \text{N}_{0}\text{C}.\exists !sʻ\text{Cl}ʻʻ\mu \cap \text{ sm }ʻʻ\nu .{\sim}\exists !sʻ\text{Cl}ʻʻ\nu \cap \text{ sm }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*103·4.*117·1.\supset \\ \vdash \colon\ldotp \mu >\nu .&\equiv :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !\text{Cl}ʻ\alpha \cap \text{ sm }ʻʻ\nu .\\ &{\sim}\exists !\text{Cl}ʻ\beta \cap \text{ sm }ʻʻ\mu :\\ [*103·2·26] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{ sm }ʻʻ\nu .\\ &{\sim}\exists !\text{Cl}ʻ\beta \cap \text{ sm }ʻʻ\mu :\\ [*117·11] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{ sm }ʻʻ\nu :\\ &\delta \in \nu .\supset _{\delta }.{\sim}\exists !\text{Cl}ʻ\delta \cap \text{ sm }ʻʻ\mu :\\ [*103·13.*10·51] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \alpha ).\alpha \in \mu .\exists !\text{Cl}ʻ\alpha \cap \text{ sm }ʻʻ\nu :\\ &{\sim}(\exists \delta ).\delta \in \nu .\exists !\text{Cl}ʻ\delta \cap \text{ sm }ʻʻ\mu :\\ [*40·4.*60·2] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}.\exists !sʻ\text{Cl}ʻʻ\mu \cap \text{ sm }ʻʻ\nu .\\ &{\sim}\exists !sʻ\text{Cl}ʻʻ\nu \cap \text{ sm }ʻʻ\mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The advantage of this proposition is that it expresses " $\mu \gt \nu$ " in terms of $\mu$ and $\nu$ alone, without the auxiliary $\alpha$ and $\beta$ of the definition.

*117·16. $\begin{align}&\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{C}.\supset :\mu \gt \nu .\equiv .\text{ sm }ʻʻ\mu \gt \nu .\equiv .\mu >\text{ sm }ʻʻ\nu .\equiv .\text{ sm }ʻʻ\mu >\text{ sm }ʻʻ\nu \\ &[*117·14.*103·4]\end{align}$

*117·2. $\vdash :\alpha \text{ sm } \alpha ʻ.\beta \text{ sm } \beta ʻ. \beta ʻ\subset \alpha .\alpha ʻ\subset \beta .\supset .\alpha \text{ sm } \beta \quad[*73·88]$

This proposition (which is the Schröder-Bernstein theorem) is fundamental in the theory of greater and less.

*117·21. $\begin{align}&\vdash :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha .\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta \\ &[*117·2.*100·321]\end{align}$

*117·211. $\vdash :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha .\equiv .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*100·3.*60·34.\supset \vdash :\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\supset .\alpha \in \text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\beta \in \text{Cl}ʻ\beta\\ \cap \text{Nc}ʻ\alpha &\quad \text{(1)}\\ \vdash .(1).*117·21.\supset \vdash .\text{Prop} \end{array}$

*117·22. $\vdash :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*117·13. &\supset \vdash :\text{Hp}.{\sim}\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha .\equiv .\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash .*117·211.&\supset \vdash :\text{Hp}.\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\alpha .\equiv .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).*117·108.\supset \vdash .\text{Prop} \end{array}$

*117·221. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv .(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta \quad[*117·22.*60·2.*100·1]$

*117·222. $\vdash :\beta \subset \alpha .\supset .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta \quad[*117·221]$

*117·23. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\beta \geq \text{Nc}ʻ\alpha .\equiv .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta \quad[*117·211·22]$

*117·24. $\vdash :\mu \geq \nu .\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*117·104·14.\supset \vdash \colon\ldotp \mu \geq \nu .&\equiv :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\lor.\\ &(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\mu =\text{ sm }ʻʻ\nu \\ [*103·4.*13·193] &\equiv :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\lor.\\ &(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{N}_{0}\text{c}ʻ\alpha =\text{Nc}ʻ\beta :\\ [*103·16] &\equiv :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\lor.\\ &(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta :\\ [*11·41.*117·108] &\equiv :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta \colon\ldotp \\ &\supset \vdash .\text{Prop} \end{array}$

*117·241. $\begin{align}&\vdash :\mu \geq \nu .\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta \\ &[*117·24·22]\end{align}$

*117·242. $\begin{align}&\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :\mu \geq \nu .\equiv .(\exists \alpha ,\beta ).\alpha \in \mu .\beta \in \nu .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta \\ &[*117·241.*103·26]\end{align}$

*117·243. $\begin{align}&\vdash \colon\ldotp \mu \geq \nu .\equiv :(\exists \alpha ,\beta ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta :(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta \\ &[*117·24·221]\end{align}$

*117·244. $\begin{align}\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{C}.\supset :\mu \geq \nu .\equiv .&\text{ sm }ʻʻ\mu \geq \nu .\equiv .\mu \geq \text{ sm }ʻʻ\nu .\equiv .\\ &\text{ sm }ʻʻ\mu \geq \text{ sm }ʻʻ\nu \quad[*117·24.*103·4]\end{align}$

*117·25. $\vdash :\mu \geq \nu .\nu \geq \mu .\equiv .\mu ,\nu \in \text{N}_{0}\text{C}.\text{ sm }ʻʻ\mu =\text{ sm }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*117·24.\supset \\ \vdash :\mu \geq \nu .\nu \geq \mu .&\equiv .(\exists \alpha ,\beta ,\gamma ,\delta ).\mu =\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻ\delta .\\ &\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\delta \geq \text{Nc}ʻ\gamma .\\ [*117·107] &\equiv .(\exists \alpha ,\beta ,\gamma,\delta ).\mu =\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻ\delta .\\ &\text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta .\text{N}_{0}\text{c}ʻ\delta \geq \text{N}_{0}\text{c}ʻ\gamma .\\ [*13·193] &\equiv .(\exists \alpha ,\beta ,\gamma ,\delta ).\mu =\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻ\delta .\\ &\text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta .\text{N}_{0}\text{c}ʻ\beta \geq \text{N}_{0}\text{c}ʻ\alpha .\\ [*117·107·23] &\equiv .(\exists \alpha ,\beta ,\gamma ,\delta ).\mu =\text{N}_{0}\text{c}ʻ\alpha =\text{N}_{0}\text{c}ʻ\gamma .\nu =\text{N}_{0}\text{c}ʻ\beta =\text{N}_{0}\text{c}ʻ\delta .\\ &\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\\ [*11·45.*103·2] &\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\mu ,\nu \in \text{N}_{0}\text{C}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\\ [*103·4] &\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\mu ,\nu \in \text{N}_{0}\text{C}.\text{ sm }ʻʻ\mu =\text{ sm }ʻʻ\nu .\\ [*11·45.*103·2] &\equiv .\mu ,\nu \in \text{N}_{0}\text{C}.\text{ sm }ʻʻ\mu =\text{ sm }ʻʻ\nu :\supset \vdash .\text{Prop} \end{array}$

*117·26. $\vdash :\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\alpha \neq \text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*117·13.*13·12.\text{Transp}.&\supset \vdash :\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\supset .\text{Nc}ʻ\alpha \neq \text{Nc}ʻ\beta :\\ [*117·108] &\supset \vdash :\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\supset .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\alpha \neq \text{Nc}ʻ\beta &\qquad \text{(1)}\\ \vdash .*117·108.*5·6.&\supset \vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\text{Nc}ʻ\alpha \neq \text{Nc}ʻ\beta .\supset .\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*117·27. $\begin{align}&\vdash :\text{Nc}ʻ\alpha <\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \leq \text{Nc}ʻ\beta .\text{Nc}ʻ\alpha \neq \text{Nc}ʻ\beta \\ &[*117·26·103·105]\end{align}$

*117·28. $\begin{align}&\vdash :\text{Nc}ʻ\alpha >\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .{\sim}(\text{Nc}ʻ\beta \geq \text{Nc}ʻ\alpha )\\ &[*117·22·13]\end{align}$

*117·2. $\vdash :\mu >\nu .\equiv .\mu \geq \nu .{\sim}(\nu \geq \mu ) \quad[*117·14·28·24]$

*117·29. $\vdash :\text{Nc}ʻ\alpha <\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\alpha \leq \text{Nc}ʻ\beta .{\sim}(\text{Nc}ʻ\beta \leq \text{Nc}ʻ\alpha ) \quad[*117·28]$

*117·291. $\vdash :\mu <\nu .\equiv .\mu \leq \nu .{\sim}(\nu \leq \mu ) \quad[*117·281]$

*117·3. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\equiv .(\exists \varpi ).\varpi \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\varpi$

Dem. $\begin{array}{l} \vdash .*117·221.\supset \vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta &.\equiv .(\exists \delta ).\delta \text{ sm }\beta .\delta \subset \alpha .\\ [*110·72] &\equiv .(\exists \varpi ).\varpi \in \text{NC}.\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\varpi :\\ &\supset \vdash .\text{Prop} \end{array}$

*117·31. $\vdash \colon\ldotp \mu \geq \nu .\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \varpi ).\varpi \in \text{NC}.\mu =\nu +_{c}\varpi$

Dem. $\begin{array}{l} \vdash .*117·24·3.\supset \\ \vdash \colon\ldotp \mu \geq \nu .&\equiv :(\exists \alpha ,\beta ,\varpi ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\varpi :\\ [(*110·03)] &\equiv :(\exists \alpha ,\beta ,\varpi ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha =\nu +_{c}\varpi :\\ [*103·16.*110·42] &\equiv :(\exists \alpha ,\beta ,\varpi ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\mu =\nu +_{c}\varpi :\\ [*103·2] &\equiv :\mu ,\nu \in \text{N}_{0}\text{C}:(\exists \varpi ).\mu =\nu +_{c}\varpi \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*117·32. $\vdash :\mu \geq \nu .\exists !\text{ sm }ʻʻ\mu \cap tʻ\alpha .\supset .\exists !\text{ sm }ʻʻ\nu \cap tʻ\alpha$

Dem. $\begin{array}{l} \vdash .*117·241.*103·4.\supset \\ \vdash :\text{Hp}.\supset .(\exists \beta ,\gamma ).\mu =\text{N}_{0}\text{c}ʻ\beta .\nu =\text{N}_{0}\text{c}ʻ\gamma .\exists !\text{Cl}ʻ\beta \cap \text{Nc}ʻ\gamma .\text{ sm }ʻʻ\mu =\text{Nc}ʻ\beta .\\ \text{ sm }ʻʻ\nu =\text{Nc}ʻ\gamma &\qquad \text{(1)}\\ \vdash .*63·105·371.*73·12.\supset \\ \vdash :R\in \rho \,\overline{\text{ sm }}\, \beta .\rho \in tʻ\alpha .\sigma \subset \beta .\sigma \text{ sm }\gamma .\supset .Rʻʻ\sigma \in tʻ\alpha .Rʻʻ\sigma \text{ sm }\gamma &\qquad \text{(2)}\\ \vdash .(2).*73·04.\supset \vdash :\rho \in \text{Nc}ʻ\beta \cap tʻ\alpha .\sigma \in \text{Cl}ʻ\beta \cap \text{Nc}ʻ\gamma .\supset .\exists !\text{Nc}ʻ\gamma \cap tʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash . \text{Prop} \end{array}$

The above proposition shows that if a cardinal $\mu$ exists in a given type, so do all smaller cardinals.

Dem. $\begin{array}{l} \vdash .*117·243.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists \alpha ,\beta ,\gamma ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\varpi =\text{N}_{0}\text{c}ʻ\gamma :\\ &(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta :(\exists \sigma ).\sigma \subset \beta .\sigma \text{ sm }\gamma :\\ [*117·11.*60·2.*100·1] &\supset :(\exists \alpha ,\beta ,\gamma ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\varpi =\text{N}_{0}\text{c}ʻ\gamma :\\ &(\exists \rho ,\tau ).\rho \subset \alpha .\rho \text{ sm }\beta .\tau \subset \rho .\tau \text{ sm }\gamma :\\ [*22·44] &\supset :(\exists \alpha ,\gamma ):\mu =\text{N}_{0}\text{c}ʻ\alpha .\varpi =\text{N}_{0}\text{c}ʻ\gamma :(\exists \tau ).\tau \subset \alpha .\tau \text{ sm }\gamma :\\ [*117·243] &\supset :\mu \geq \varpi \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*117·41. $\vdash :\mu \leq \nu .\nu \leq \varpi .\supset .\mu \leq \varpi \quad[*117·4]$

Dem. $\begin{array}{l} \vdash .*117·15.*13·12.\text{Transp}.\supset \vdash :\mu >\nu .\supset .\mu \neq \nu :\supset \vdash . \text{Prop} \end{array}$

*117·43. $\vdash :\mu \geq \nu .{\sim}(\mu \geq \varpi ).\supset .{\sim}(\nu \geq \varpi ) \quad[*117·4.\text{Transp}]$

*117·44. $\vdash :\nu \geq \varpi .{\sim}(\mu \geq \varpi ).\supset .{\sim}(\mu \geq \nu ) \quad[*117·4.\text{Transp}]$

Dem. $\begin{array}{l} \vdash .*117·281.\supset \vdash :\text{Hp}.&\supset .\mu \geq \nu .\nu \geq \varpi .{\sim}(\varpi \geq \nu ).\\ [*117·4·44] &\supset .\mu \geq \varpi .{\sim}(\varpi \geq \mu ).\\ [*117·281] &\supset .\mu >\varpi :\supset \vdash . \text{Prop} \end{array}$

*117·46. $\vdash :\mu >\nu .\nu \geq \varpi .\supset .\mu >\varpi \quad[\text{Proof as in *117·45}]$

*117·47. $\vdash :\mu >\nu .\nu >\varpi .\supset .\mu >\varpi \quad[*117·45·104]$

*117·471. $\vdash :\mu <\nu .\nu <\varpi .\supset .\mu <\varpi \quad[*117·47·103]$

Dem. $\begin{array}{l} \vdash .*60·3.*100·3.&\supset \vdash .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\Lambda .\\ [*117·22] &\supset \vdash .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\Lambda .\\ [*117·107.*101·1]&\supset \vdash .\text{N}_{0}\text{c}ʻ\alpha \geq 0 &\qquad \text{(1)}\\ \vdash .(1).*103·2. &\supset \vdash .\text{Prop} \end{array}$

*117·501. $\vdash :\mu \in \text{N}_{0}\text{C}.\equiv .\mu \geq 0 \quad[*117·5·104]$

Dem. $\begin{array}{l} \vdash .*101·15.\supset \vdash :\text{Hp}.\supset .\mu \neq \text{ sm }ʻʻ0 &\qquad \text{(1)}\\ \vdash .(1).*117·5·104.\supset \vdash .\text{Prop} \end{array}$

*117·511. $\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0.\equiv .\mu >0 \quad[*117·51·15·42]$

Dem. $\begin{array}{l} \vdash .*51·2.\supset \vdash :\text{Hp}.&\supset .(\exists x).\iota ʻx\subset \xi .\\ [*117·222] &\supset .(\exists x).\text{Nc}ʻ\xi \geq \text{Nc}ʻ\iota ʻx.\\ [*101·2] &\supset .\text{Nc}ʻ\xi \geq 1:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*101·16.*103·2.\supset \vdash :\text{Hp}.&\supset .(\exists \alpha ).\text{N}_{0}\text{c}ʻ\alpha =\mu .\exists !\alpha .\\ [*117·52] &\supset .(\exists \alpha ).\text{N}_{0}\text{c}ʻ\alpha =\mu .\text{Nc}ʻ\alpha \geq 1.\\ [*117·107] &\supset .\mu \geq 1:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*117·104. &\supset \vdash :\mu \geq 1.\supset .\mu \in \text{N}_{0}\text{C} &\qquad \text{(1)}\\ \vdash .*117·51.*101·22.&\supset \vdash .1>0.\\ [*117·45] &\supset \vdash :\mu \geq 1.\supset .\mu >0.\\ [*117·42] &\supset .\mu \neq 0 &\qquad \text{(2)}\\ \vdash .(1).(2).*117·53.&\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*117·241.*101·2.*52·22.\supset \\ \vdash \colon\ldotp 1\geq \mu .&\equiv :(\exists \alpha ,x).\mu =\text{N}_{0}\text{c}ʻ\alpha .\exists !\text{Nc}ʻ\alpha \cap \text{Cl}ʻ\iota ʻx:\\ [*60·362] &\equiv :(\exists \alpha ,x):\mu =\text{N}_{0}\text{c}ʻ\alpha :\exists !\text{Nc}ʻ\alpha \cap \iota ʻ\Lambda .\lor.\exists !\text{Nc}ʻ\alpha \cap \iota ʻ\iota ʻx:\\ [*51·31] &\equiv :(\exists \alpha ,x):\mu =\text{N}_{0}\text{c}ʻ\alpha :\Lambda \in \text{Nc}ʻ\alpha .\lor.\iota ʻx\in \text{Nc}ʻ\alpha :\\ [*101·17·29] &\equiv :(\exists \alpha ,x):\mu =\text{N}_{0}\text{c}ʻ\alpha :\text{Nc}ʻ\alpha =\text{Nc}ʻ\Lambda .\lor.\text{Nc}ʻ\alpha =\text{Nc}ʻ\iota ʻx:\\ [*103·16] &\equiv :(\exists \alpha ,x).\mu =\text{N}_{0}\text{c}ʻ\alpha :\mu =\text{Nc}ʻ\Lambda .\lor.\mu =\text{Nc}ʻ\iota ʻx:\\ [*101·1·2] &\equiv :(\exists \alpha ).\mu =\text{N}_{0}\text{c}ʻ\alpha :\mu =0.\lor.\mu =1:\\ [*103·2·5·51] &\equiv :\mu =0.\lor.\mu =1\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*117·55. $\vdash : \mu > 1 . \equiv . \mu \in \text{N}_{0}\text{C} - \iota ʻ0 - \iota ʻ1$

Dem. $\begin{array}{l} \vdash . *117·281 . \supset \vdash : \mu > 1 . &\equiv . \mu \geq 1 . {\sim} (1 \geq \mu ) .\\ [*117·531·54] &\equiv . \mu \in \text{N}_{0}\text{C} - \iota ʻ0 . \mu \neq 0 . \mu \neq 1 .\\ [*51·15] &\equiv . \mu \in \text{N}_{0}\text{C} - \iota ʻ0 - \iota ʻ1 : \supset \vdash . \text{Prop} \end{array}$

*117·551. $\begin{align}\vdash \colon\ldotp \mu \in \text{N}_{0}\text{C} - \iota ʻ0 - &\iota ʻ1 . \equiv :\\ &(\exists \alpha ) : \mu = \text{N}_{0}\text{c}ʻ\alpha : (\exists x, y) . x, y \in \alpha . x \neq y : \equiv . \mu \geq 2\end{align}$

Dem. $\begin{array}{l} \vdash . *103·2 . \supset \vdash \colon\ldotp &\mu \in \text{N}_{0}\text{C} - \iota ʻ0 - \iota ʻ1 . \equiv :\\ &(\exists \alpha ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \text{N}_{0}\text{c}ʻ\alpha \neq 0 . \text{N}_{0}\text{c}ʻ\alpha \neq 1 :\\ [*101·14] &\equiv : (\exists \alpha ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \exists ! \alpha . \text{N}_{0}\text{c}ʻ\alpha \neq 1 :\\ [*103·26] &\equiv : (\exists \alpha ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \exists ! \alpha . \alpha {\sim} \in 1 :\\ [*52·41] &\equiv : (\exists \alpha ) : \mu = \text{N}_{0}\text{c}ʻ\alpha : (\exists x, y) . x, y \in \alpha . x \neq y : &\qquad \text{(1)}\\ [*54·26 . *51·2] &\equiv : (\exists \alpha ) : \mu = \text{N}_{0}\text{c}ʻ\alpha : (\exists x, y) . \iota ʻx \cup \iota ʻy \subset \alpha . \iota ʻx \cup \iota ʻy \in 2 :\\ [*13·195] &\equiv : (\exists \alpha ) : \mu = \text{N}_{0}\text{c}ʻ\alpha : (\exists x, y, \beta ) . \beta = \iota ʻx \cup \iota ʻy . \beta \subset \alpha . \beta \in 2 :\\ [*54·101] &\equiv : (\exists \alpha ) : \mu = \text{N}_{0}\text{c}ʻ\alpha : (\exists \beta ) . \beta \subset \alpha . \beta \in 2 :\\ [*117·241] &\equiv : \mu \geq 2 &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*117·56. $\vdash : \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta . \supset . \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\gamma \geq \text{Nc}ʻ\beta +_{c} \text{Nc}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *110·12 . *117·221 . \supset \\ \vdash : \text{Hp} . &\supset . (\exists \delta ) . \delta \subset \downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\alpha . \delta \text{ sm } \downarrow \Lambda _{\gamma }ʻʻ\iotaʻʻ\beta .\\ [*110·11 . *73·71 . (*110·01)] &\supset . (\exists \delta ) . \delta \cup \Lambda _{\alpha } \downarrow ʻʻ\iotaʻʻ\gamma \subset \alpha + \gamma .\\ &\delta \cup \Lambda _{\alpha } \downarrow ʻʻ\iotaʻʻ\gamma \text{ sm } (\beta + \gamma ) .\\ [*117·221] &\supset . \text{Nc}ʻ(\alpha + \gamma ) \geq \text{Nc}ʻ(\beta + \gamma ) .\\ [*110·3] &\supset . \text{Nc}ʻ\alpha +_{c} \text{Nc}ʻ\gamma \geq \text{Nc}ʻ\beta +_{c} \text{Nc}ʻ\gamma : \supset \vdash . \text{Prop} \end{array}$

*117·561. $\vdash : \mu \geq \nu . \varpi \in \text{N}_{0}\text{C} . \supset . \mu +_{c} \varpi \geq \nu +_{c} \varpi \quad[*117·56]$

The proof of *117·561 follows from *117·56 in the same way as the proof of *117·31 follows from *117·3. In the remainder of this number we shall omit proofs of this kind.

*117·57. $\vdash : \text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta . \supset . \text{Nc}ʻ\alpha \times _{c} \text{Nc}ʻ\gamma \geq \text{Nc}ʻ\beta \times _{c} \text{Nc}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *37·2 . &\supset \vdash : \rho \subset \alpha . \supset . \gamma \downarrow_{,,}ʻʻ\rho \subset \gamma \downarrow_{,,}ʻʻ\alpha .\\ [*40·161 . *113·1] &\supset . \rho \times \gamma \subset \alpha \times \gamma &\qquad \text{(1)}\\ \vdash . *113·13 . &\supset \vdash \rho \text{ sm } \beta . \supset . \rho \times \gamma \text{ sm } \beta \times \gamma &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash : \rho \subset \alpha . \rho \text{ sm } \beta . \supset . \rho \times \gamma \subset \alpha \times \gamma . \rho \times \gamma \text{ sm } \beta \times \gamma .\\ [*117·221] &\supset . \text{Nc}ʻ(\alpha \times \gamma ) \geq \text{Nc}ʻ(\beta \times \gamma ) &\qquad \text{(3)}\\ \vdash . (3) . *117·221 . \supset \vdash . \text{Prop} \end{array}$

*117·571. $\vdash .\mu \geq \nu .\varpi \in \text{N}_{0}\text{C}.\supset .\mu \times _{c}\varpi \geq \nu \times _{c}\varpi \quad[*117·57]$

*117·58. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\supset .(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\gamma }\geq (\text{Nc}ʻ\beta )^{\text{Nc}ʻ\gamma }$

Dem. $\begin{array}{l} \vdash .*35·432·82.\supset \vdash : \rho \subset \alpha .&\supset .\rho \uparrow \gamma \,\unicode{x2abd}\, \alpha \uparrow \gamma .\\ [*80·15] &\supset .(\rho \uparrow \gamma )_{\Delta }ʻ\gamma \subset (\alpha \uparrow \gamma )_{\Delta }ʻ\gamma &\qquad \text{(1)}\\ \vdash .*116·15·19.&\supset \vdash :\rho \text{ sm }\beta .\supset .(\rho \uparrow \gamma )_{\Delta }ʻ\gamma \text{ sm }(\beta \uparrow \gamma )_{\Delta }ʻ\gamma &\qquad \text{(2)}\\ \vdash .(1).(2).*117·221.\supset \\ \vdash :\rho \subset \alpha .\rho \text{ sm }\beta .&\supset .\text{Nc}ʻ(\alpha \uparrow \gamma )_{\Delta }ʻ\gamma \geq \text{Nc}ʻ(\beta \uparrow \gamma )_{\Delta }ʻ\gamma .\\ [*116·15·25] &\supset .(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\gamma }\geq (\text{Nc}ʻ\beta )^{\text{Nc}ʻ\gamma } &\qquad \text{(3)}\\ \vdash .(3).*117·221.&\supset \vdash . \text{Prop} \end{array}$

*117·581. $\vdash :\mu \geq \nu .\varpi \in \text{N}_{0}\text{C}.\supset .\mu ^{\varpi }\geq \nu ^{\varpi } \quad[*117·58]$

*117·582. $\begin{align}\vdash :\exists !\gamma .\beta \subset \alpha .\sigma \in \gamma \,\,\text{exp}\,\,(\alpha -\beta ).\supset .&(\cup \sigma )\upharpoonright (\gamma \,\,\text{exp}\,\,\beta )\in 1\rightarrow 1.\\ &(\cup \sigma )ʻʻ(\gamma \,\,\text{exp}\,\,\beta )\subset \gamma \,\,\text{exp}\,\,\alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*116·183.&\supset \vdash :\rho \in (\gamma \,\,\text{exp}\,\,\beta ).\sigma \in \gamma \,\,\text{exp}\,\,(\alpha -\beta ).\supset .\rho \subset \beta \times \gamma .\sigma \subset (\alpha -\beta )\times \gamma .\\ [*113·19.*24·21] &\supset .\rho \cap \sigma =\Lambda &\qquad \text{(1)}\\ \vdash .(1).*24·481.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \rho ,\rho ʻ\in (\gamma \,\,\text{exp}\,\,\beta ).\supset :\rho \cup \sigma =\rho ʻ\cup \sigma .\equiv .\rho =\rho ʻ\colon\ldotp \\ [*71·58] &\supset \colon\ldotp (\cup \sigma )\upharpoonright (\gamma \,\,\text{exp}\,\,\beta )\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*113·191.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\gamma \downarrow_{,,}ʻʻ\beta \cap \gamma \downarrow_{,,}ʻʻ(\alpha -\beta )=\Lambda :\\ [*115·14.(*116·01)] &\supset :\rho \in (\gamma \,\,\text{exp}\,\,\beta ).\supset .\rho \cup \sigma \in \text{Prod}ʻ\{\gamma \downarrow_{,,}ʻʻ\beta \cup \gamma \downarrow_{,,}ʻʻ(\alpha -\beta )\}.\\ [*37·22.*24·411] &\supset .\rho \cup \sigma \in (\gamma \,\,\text{exp}\,\,\alpha ):\\ [*37·61] & \supset :(\cup \sigma )ʻʻ(\gamma \,\,\text{exp}\,\,\beta )\subset \gamma \,\,\text{exp}\,\,\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*117·583. $\vdash :\beta \subset \alpha .\exists !\gamma .\supset .(\exists \tau ).\tau \subset \gamma \,\,\text{exp}\,\,\alpha .\tau \text{ sm }(\gamma \,\,\text{exp}\,\,\beta )$

Dem. $\begin{array}{l} \vdash .*116·171.\supset \vdash :\text{Hp}.\supset .\exists !\gamma \,\,\text{exp}\,\,(\alpha -\beta ) &\qquad \text{(1)}\\ \vdash .(1).*117·582.*73·15.\supset \vdash .\text{Prop} \end{array}$

*117·59. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\exists !\gamma .\supset .(\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\alpha }\geq (\text{Nc}ʻ\gamma )^{\text{Nc}ʻ\beta }$

Dem. $\begin{array}{l} \vdash .*117·221.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta :\exists !\gamma :\\ [*117·583] &\supset :(\exists \rho ,\tau ).\rho \subset \alpha .\rho \text{ sm }\beta .\tau \subset \gamma \,\,\text{exp}\,\,\alpha .\tau \text{ sm }(\gamma \,\,\text{exp}\,\,\rho ):\\ [*116·19] &\supset :(\exists \tau ).\tau \subset \gamma \,\,\text{exp}\,\,\alpha .\tau \text{ sm }(\gamma \,\,\text{exp}\,\,\beta ):\\ [*117·221] &\supset :\text{Nc}ʻ(\gamma \,\,\text{exp}\,\,\alpha )\geq \text{Nc}ʻ(\gamma \,\,\text{exp}\,\,\beta ) &\qquad \text{(1)}\\ \vdash .(1).*116·25.\supset \vdash . \text{Prop} \end{array}$

The hypothesis is essential in the above proposition, for $0^{0} = 1$ while $0^{1} = 0$ , so that $0^{0} > 0^{1}$ .

*117·591. $\vdash :\mu \geq \nu .\varpi \in \text{N}_{0}\text{C}-\iota ʻ0.\supset .\varpi ^{\mu } \geq \varpi ^{\nu } \quad[*117·59]$

*117·592. $\vdash :\alpha ^{\delta } = 1.\alpha \neq 0.\alpha \neq 1.\supset .\delta = 0$

Dem. $\begin{array}{l} \vdash .*116·203.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\delta \in \text{N}_{0}\text{C}:\\ [*117·551·53] &\supset :\alpha \geq 2:\delta \neq 0.\supset .\delta \geq 1:\\ [*117·581·591] &\supset :\delta \neq O.\supset .\alpha ^{\delta } \geq 2^{1}.\\ [*116·321.*117·244] &\supset .\alpha ^{\delta } \geq 2.\\ [*117·551] &\supset .\alpha ^{\delta } \neq 1 &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

*117·6. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\supset .\mu +_{c}\nu \geq \mu .\mu +_{c}\nu \geq \nu$

Dem. $\begin{array}{l} \vdash .*117·561·5.\supset \vdash :\text{Hp}.\supset .\mu +_{c}\nu \geq \mu +_{c}0.\mu +_{c}\nu \geq 0+_{c}\nu &\qquad \text{(1)}\\ \vdash .(1).*110·6.*117·244.\supset \vdash .\text{Prop} \end{array}$

*117·62. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}-\iota ʻ0.\supset .\mu \times _{c}\nu \geq \mu .\mu \times _{c}\nu \geq \nu$

Dem. $\begin{array}{l} \vdash .*117·571·53.\supset \vdash :\text{Hp}.\supset .\mu \times _{c}\nu \geq \mu \times _{c}1.\mu \times _{c}\nu \geq 1\times _{c}\nu &\qquad \text{(1)}\\ \vdash .(1).*113·621.*117·244.\supset \vdash .\text{Prop} \end{array}$

*117·63. $\vdash :\alpha ,\beta {\sim}\in 0\cup 1.\supset .\text{Nc}ʻ\alpha \times _{c}\text{Nc}ʻ\beta \geq \text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*52·4.\text{Transp}.&\supset \vdash :\text{Hp}.\supset .(\exists x,x',y,y').x,x'\in \alpha .y,y'\in \beta .x \neq x'.y \neq y' &\qquad \text{(1)}\\ \vdash .*113·101. &\supset \vdash :\text{Hp}.x,x'\in \alpha .y,y'\in \beta .x \neq x'.y \neq y'.\rho = \downarrow yʻʻ\alpha .\\ &\sigma = x\downarrow ʻʻ(\beta -\iota ʻy)\cup \iota ʻx'\downarrow y'.\supset .\rho \cup \sigma \subset \beta \times \alpha &\qquad \text{(2)}\\ \vdash .*55·15.&\supset \vdash \colon\ldotp \text{Hp}(2).\supset :R\in \rho .\supset _{R}.\text{ᗡ}ʻR = \iota ʻy:\\ &S\in x\downarrow ʻʻ(\beta -\iota ʻy).\supset _{S}.\text{ᗡ}ʻS\in \beta -\iota ʻy:\text{ᗡ}ʻx'\downarrow y' = \iota ʻy':\\ [*51·23] &\supset :R\in \rho .S\in \sigma .\supset _{R,S}.\text{ᗡ}ʻR \neq \text{ᗡ}ʻS:\\ [*24·37.*30·37] &\supset :\rho \cap \sigma = \Lambda &\qquad \text{(3)}\\ \vdash .*73·61·611. &\supset \vdash :\text{Hp}(2).\supset .\rho \text{ sm } \alpha .x\downarrow ʻʻ(\beta -\iota ʻy) \text{ sm } (\beta -\iota ʻy) &\qquad \text{(4)}\\ \vdash .*55·202. &\supset \vdash :\text{Hp}(2).\supset .x'\downarrow y'{\sim}\in x\downarrow ʻʻ(\beta -\iota ʻy) &\qquad \text{(5)}\\ \vdash .(4).(5).*73·71. &\supset \vdash :\text{Hp}(2).\supset .\rho \text{ sm } \alpha .\sigma \text{ sm } \beta &\qquad \text{(6)}\\ \vdash .(3).(6).*110·13. &\supset \vdash :\text{Hp}(2).\supset .\rho \cup \sigma \in \text{Nc}ʻ(\alpha +\beta ) &\qquad \text{(7)}\\ \vdash .(2).(7).*117·221. &\supset \vdash :\text{Hp}(2).\supset .\text{Nc}ʻ(\beta \times \alpha ) \geq \text{Nc}ʻ(\alpha +\beta ) &\qquad \text{(8)}\\ \vdash .(1).(8).*113·141·25.*110·3.\supset \vdash .\text{Prop} \end{array}$

*117·631. $\vdash :\mu ,\nu \in \text{N}_{0}\text{C}-\iota ʻ0-\iota ʻ1.\supset .\mu \times _{c}\nu \geq \mu +_{c}\nu \quad[*117·63]$

*117·632. $\begin{align}&\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\kappa {\sim}\in 0\cup 1.\rho ,\sigma \in \text{Prod}ʻ\kappa .\rho \cap \sigma =\Lambda .\\ &T=\hat{\mu} \hat{x} \{(\exists \alpha ,\beta ).\alpha ,\beta \in \kappa .\alpha \neq \beta .x\in \beta .\mu =(\rho -\alpha -\beta )\cup (\sigma \cap \alpha )\cup \iota ʻx\}.\\ &\supset .T\in 1\rightarrow 1.\text{D}ʻT\subset \text{Prod}ʻ\kappa .\text{ᗡ}ʻT=sʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash .*115·11·145. &\supset \vdash \colon\ldotp \text{Hp}.\alpha ,\beta \in \kappa .\alpha \neq \beta .\supset :\rho -\alpha -\beta \in \text{Prod}ʻ(\kappa -\iota ʻ\alpha -\iota ʻ\beta ):\\ [*115·11·145] &\supset :(\rho -\alpha -\beta )\cup (\sigma \cap \alpha )\in \text{Prod}ʻ(\kappa -\iota ʻ\beta ):\\ [*115·145] &\supset :x\in \beta .\supset .(\rho -\alpha -\beta )\cup (\sigma \cap \alpha )\cup \iota ʻx\in \text{Prod}ʻ\kappa &\qquad \text{(1)}\\ \vdash .(1).*21·33. &\supset \vdash :\text{Hp}.\mu Tx.\supset .\mu \in \text{Prod}ʻ\kappa &\qquad \text{(2)}\\ \vdash .*52·4.\text{Transp}. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \kappa .x\in \beta .\supset .(\exists \alpha ).\alpha \in \kappa .\alpha \neq \beta .\\ [*21·33.*33·131] &\supset .x\in \text{ᗡ}ʻT &\qquad \text{(3)}\\ \vdash .*21·33.*33·131. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x \in\text{ᗡ}ʻT.\supset .(\exists \beta ).\beta \in \kappa .x\in \beta &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻT=sʻ\kappa &\qquad \text{(5)}\\ \vdash :*21·33.*13·172. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu Tx.\nu Tx.\supset .\mu =\nu &\qquad \text{(6)}\\ \vdash .*21·33.*13·171. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu Tx.\mu Tx'.\supset .\\ &(\exists \alpha ,\alpha',\beta ,\beta').\alpha ,\alpha'\in \kappa .\beta ,\beta'\in \kappa .\alpha \neq \beta .\alpha'\neq \beta'.\\ &(\rho -\alpha -\beta )\cup (\sigma \cap \alpha )\cup \iota ʻx=(\rho -\alpha'-\beta')\cap (\sigma \cap \alpha')\cup \iota ʻx'.\\ [*24·48.\text{Hp}] &\supset .\iota ʻx=\iota ʻx' &\qquad \text{(7)}\\ \vdash .(2).(5).(6).(7).\supset \vdash . \text{Prop} \end{array}$

*117·633. $\begin{align}&\vdash \colon\ldotp \kappa \in \text{Cls}^{2} \text{excl}.\kappa {\sim}\in 0\cup 1:(\exists \rho ,\sigma ).\rho ,\sigma \in \text{Prod}ʻ\kappa .\rho \cap \sigma =\Lambda :\supset .\\ &\Pi \text{Nc}ʻ\kappa \geq \Sigma \text{Nc}ʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash .*117·632.\supset \vdash :\text{Hp}.&\supset .(\exists \gamma ).\gamma \subset \text{Prod}ʻ\kappa .\gamma \text{ sm } sʻ\kappa .\\ [*117·221] &\supset .\text{Nc}ʻ\text{Prod}ʻ\kappa \geq \text{Nc}ʻsʻ\kappa &\qquad \text{(1)}\\ \vdash .(1).*115·12.*112·15.\supset \vdash . \text{Prop} \end{array}$

*117·64. $\begin{align}\vdash \colon\ldotp \kappa \in \text{Cls}^{2} \text{excl}:(\exists \rho ,\sigma ).\rho ,\sigma \in \text{Prod}ʻ\kappa .\rho \cap \sigma =&\Lambda :\supset .\\ &\Pi \text{Nc}ʻ\kappa \geq \Sigma \text{Nc}ʻ\kappa\end{align}$

Dem. $\begin{array}{l} \vdash .*112·321.*114·21. \supset \vdash :\kappa \in 1.&\supset .\Pi \text{Nc}ʻ\kappa =\Sigma \text{Nc}ʻ\kappa &\qquad \text{(1)}\\ \vdash .*114·2.*112·3. \supset \vdash :\kappa \in 0.&\supset .\Pi \text{Nc}ʻ\kappa =1.\Sigma \text{Nc}ʻ\kappa =0.\\ [*117·51] &\supset .\Pi \text{Nc}ʻ\kappa >\Sigma \text{Nc}ʻ\kappa &\qquad \text{(2)}\\ \vdash .(1).(2).*117·633.\supset \vdash . \text{Prop} \end{array}$

*117·651. $\vdash :\alpha {\sim}\in 0\cup 1.\supset .(\text{Nc}ʻ\alpha )^{\text{Nc}ʻ\beta }\geq \text{Nc}ʻ\alpha x_{c}\text{Nc}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*52·4.\text{Transp}. &\supset \vdash :\text{Hp}.\supset .(\exists x,y).x,y\in \alpha .x\neq y &\qquad \text{(1)}\\ \vdash .*116·152.*55·23·202. \supset \vdash :x,y\in \alpha .x\neq y.\supset .&x\downarrowʻʻ\beta ,y\downarrowʻʻ\beta \in (\alpha \,\,\text{exp}\,\,\beta ).\\ &x\downarrowʻʻ\beta \cap y\downarrowʻʻ\beta =\Lambda &\qquad \text{(2)}\\ \vdash .*113·111. &\supset \vdash .\alpha \downarrow_{,,}ʻʻ\beta \in \text{Cls}^{2} \text{excl} &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*117·64.*113·1·141·25.*116·25.(*116·01).\supset \vdash . \text{Prop} \end{array}$

*117·652. $\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0-\iota ʻ1.\nu \in \text{N}_{0}\text{C}.\supset .\mu ^\nu \geq \mu \times _{c} \nu \quad[*117·651]$

Dem. $\begin{array}{l} \vdash .*102·72. &\supset \vdash .{\sim}(\exists \beta ).\beta \subset \alpha .\beta \text{ sm }\text{Cl}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*100·6.*60·61. &\supset \vdash .\iotaʻʻ\alpha \subset \text{Cl}ʻ\alpha .\iotaʻʻ\alpha \text{ sm }\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*117·13. &\supset \vdash .\text{Prop} \end{array}$

*117·661. $\vdash :\mu \in \text{N}_{0}\text{C}.\supset .2^\mu >\mu \quad[*117·66.*116·72]$

*117·67. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\exists !\text{Prod}ʻ\kappa .\supset .\text{Nc}ʻsʻ\kappa \geq \text{Nc}ʻ\kappa$

Dem. $\begin{array}{l} \vdash .*115·16·11.&\supset \vdash :\kappa \in \text{Cls}^{2} \text{excl}.\mu \in \text{Prod}ʻ\kappa .\supset .\mu \text{ sm }\kappa .\mu \subset sʻ\kappa \\ . [*117·22] &\supset .\text{Nc}ʻsʻ\kappa \geq \text{Nc}ʻ\kappa :\supset \vdash .\text{Prop} \end{array}$

*117·68. $\begin{align}\vdash :R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} .T=\hat{P} &\hat{\rho} \{\rho \in \kappa .P=R\upharpoonright -\iota ʻ\rho \unicode{x228d} S\upharpoonright \iota ʻ\rho\}.\\ &\supset .T\in 1\rightarrow 1.\text{D}ʻT\subset {\in}_{\Delta}ʻ\kappa .\text{ᗡ}ʻT=\kappa\end{align}$

Dem. $\begin{array}{l} \vdash .*21·33.*13·172. &\supset \vdash \colon\ldotp \text{Hp}.\supset :PT\rho .QT\rho .\supset .P=Q &\qquad \text{(1)}\\ \vdash .*23·631. &\supset \vdash :\text{Hp}.\rho \in \kappa .\supset .(Tʻ\rho )\dot{\cap} S=S\upharpoonright \iota ʻ\rho :\\ [*13·17] &\supset \vdash :\text{Hp}.\rho ,\sigma \in \kappa .Tʻ\rho =Tʻ\sigma .\supset .S\upharpoonright \iota ʻ\rho =S\upharpoonright \iota ʻ\sigma .\\ [*35·65] &\supset .\iota ʻ\rho =\iota ʻ\sigma .\\ [*51·23] &\supset .\rho =\sigma &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .T\in 1\rightarrow 1 &\qquad \text{(3)}\\ \vdash .*21·33.*33·131. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻT=\kappa &\qquad \text{(4)}\\ \vdash .*80·36. &\supset \vdash :\text{Hp}.\supset .\text{D}ʻT\subset {\in}_{\Delta}ʻ\kappa &\qquad \text{(5)}\\ \vdash .(3).(4).(5). \supset \vdash .\text{Prop} \end{array}$

*117·681. $\vdash :(\exists R,S).R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} .\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \geq \text{Nc}ʻ\kappa \quad [*117·68·22]$

*117·682. $\vdash :\kappa \subset \lambda .\exists !{\in}_{\Delta}ʻ(\lambda -\kappa ).\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \text{Nc}ʻ{\in}_{\Delta}ʻ\kappa$

Dem. $\begin{array}{l} \vdash .*80·65. &\supset \vdash \colon\ldotp \text{Hp}.\supset :R \in {\in}_{\Delta}ʻ\kappa .S\in {\in}_{\Delta}ʻ(\lambda -\kappa ).\supset .R\unicode{x228d} S\in {\in}_{\Delta}ʻ\lambda &\qquad \text{(1)}\\ \vdash .*80·14. &\supset \vdash :R\in {\in}_{\Delta}ʻ\lambda .S\in {\in}_{\Delta}ʻ(\lambda -\kappa ).\supset .\text{ᗡ}ʻR\cap \text{ᗡ}ʻS=\Lambda .\\ [*33·33] &\supset .R\dot{\cap} S=\dot{\Lambda} .\\ [*25·4] &\supset .(R\unicode{x228d} S)\dot{-} S=R &\qquad \text{(2)}\\ \vdash .(2).*13·171. &\supset \vdash :Q,R\in {\in}_{\Delta}ʻ\lambda .S\in {\in}_{\Delta}ʻ(\lambda -\kappa ).Q\unicode{x228d} S=R\unicode{x228d} S.\supset .Q=R &\qquad \text{(3)}\\ \vdash .(1).(3). &\supset \vdash :\text{Hp}.S\in {\in}_{\Delta}ʻ(\lambda -\kappa ).\supset .(\unicode{x228d} S)\upharpoonright {\in}_{\Delta}ʻ\kappa \in 1\rightarrow 1.(\unicode{x228d} S)ʻʻ{\in}_{\Delta}ʻ\kappa \subset {\in}_{\Delta}ʻ\lambda .\\ [*117·22] &\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \text{Nc}ʻ{\in}_{\Delta}ʻ\kappa :\supset \vdash .\text{Prop} \end{array}$

*117·683. $\begin{align}\vdash \colon\ldotp \kappa \subset \lambda .\exists !{\in}_{\Delta}ʻ(\lambda -\kappa ):(\exists R,S).&R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} :\supset .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \text{Nc}ʻ\kappa \quad[*117·681·682]\end{align}$

*117·684. $\begin{align}\vdash :\kappa \subset \lambda .\exists !{\in}_{\Delta}ʻ\lambda :(\exists R,S).&R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} :\supset .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \text{Nc}ʻ\kappa \quad[*117·683.*88·22]\end{align}$

The correlators established at various stages throughout Section B present certain analogies to each other, and they or others closely resembling them will be found to be the correlators required in relation-arithmetic (Part IV). We shall therefore here collect together the most important propositions hitherto proved on correlators.

When we have to deal with correlators of two different functions of a single class, as e.g. ${\in}_{\Delta}ʻ\kappa$ and $\text{Prod}ʻ\kappa$ , the correlator is usually $\text{D}$ or $\dot{s}$ or $\dot{s} \mid \text{D}$ , with a suitable limitation on the converse domain. Sometimes it is $\breve{\iota} \mid \text{D}$ or $\breve{\in}\mid \text{D}$ . Thus for example the class ${\in}\unicode{x21A7}ʻʻ\kappa$ , by means of which $\Sigma ʻ\kappa$ is defined (*112), has double similarity with $\kappa$ if $\kappa\in \text{Cls}^{2} \text{excl}$ (*112·14); in this case, the double correlator is $\breve{\iota} \mid \text{D}$ with its converse domain limited, i.e. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\breve{\iota} \mid \text{D}\upharpoonright \Sigma ʻ\kappa \in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\in \unicode{x21A7}ʻʻ\kappa ) .$ In the case of $\text{Prod}ʻ\kappa$ and ${\in}_{\Delta}ʻ\kappa$ , the correlator is $\text{D}$ , i.e. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\text{D}\upharpoonright {\in}_{\Delta}ʻ\kappa \in (\text{Prod}ʻ\kappa )\,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ\kappa ) .$ In the case of ${\in}_{\Delta}ʻsʻ\kappa$ and ${\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa$ , the correlator is $\dot{s}\mid \text{D}$ , i.e. $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\supset .\dot{s} \mid \text{D}\upharpoonright {\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa \in ({\in}_{\Delta}ʻsʻ\kappa )\,\overline{\text{ sm }}\, ({\in}_{\Delta}ʻ{\in}_{\Delta}ʻʻ\kappa ).$ $\dot{s} \mid \text{D}$ also correlates ${\in}_{\Delta}ʻ\kappa$ with ${\in}_{\Delta}ʻ\in \unicode{x21A7}ʻʻ\kappa$ (*85·61) and $P_{\Delta }ʻ\alpha$ with ${\in}_{\Delta}ʻP\unicode{x21A7}ʻʻ\alpha$ (*85·53), and $P_{\Delta }ʻsʻ\kappa$ with ${\in}_{\Delta}ʻP_{\Delta}ʻʻ\kappa$ (*85·27·42) if $\kappa \in \text{Cls}^{2} \text{excl}$ .

The correlator of $(\alpha \uparrow \beta )_{\Delta }ʻ\beta$ with $(\alpha \,\,\text{exp}\,\,\beta)$ is $\dot{s}$ (*116·131).

Another kind of correlators arises where we are given a correlator of $\kappa$ and $\lambda$ , and we wish to construct a correlator for some associated classes $Wʻ\kappa$ and $Wʻ\lambda$ where we are given correlators of $\alpha$ with $\gamma$ and of $\beta$ with $\delta$ , and we wish to construct a correlator of $\alpha\unicode{x2640}\beta$ with $\gamma \unicode{x2640}\delta$ , where $\unicode{x2640}$ is some double descriptive function in the sense of *38. In this case, the correlator will usually be of the form $R\parallel \breve{S}$ (with a limited converse domain). Sometimes $R$ and $S$ will be identical; sometimes $S$ will be $R_{\in}$ . Such correlators always depend upon

*55·61. $\vdash :\text{E}!Rʻx.\text{E}!Sʻy.\supset .(R\parallel \breve{S} )ʻ(x\downarrow y)=(Rʻx)\downarrow (Sʻy)$

together with the propositions *74·77 seq. giving cases in which $(R\parallel \breve{S})\upharpoonright \lambda$ is a one-one relation. It follows from *55·61 that if $R$ and $S$ are correlators whose converse domains include the domain and converse domain respectively[Pg 186] of a relation $P$ , then $(R\parallel\breve{S})ʻP$ will be a relation holding between $Rʻx$ and $Sʻy$ whenever $P$ holds between $x$ and $y$ . Examples of such correlators as $R\parallel \breve{S}$ are

*112·153. $\vdash :T\in \kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \lambda .\supset .(T\parallel \breve{T} _{\in })\upharpoonright sʻ\in \unicode{x21A7}ʻʻ\lambda \in (\in \unicode{x21A7}ʻʻ\kappa )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\in \unicode{x21A7}ʻʻ\lambda )$

*113·127. $\begin{align}\vdash :R\upharpoonright \gamma \in \alpha \,\overline{\text{ sm }}\, \gamma .S\upharpoonright \delta \in &\beta \,\overline{\text{ sm }}\, \delta .\supset .\\ &(R\parallel \breve{S} )\upharpoonright (\delta \times \gamma )\in (\alpha \downarrow_{,,}ʻʻ\beta )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \downarrow_{,,}ʻʻ\delta )\end{align}$

*113·65. $\vdash .\downarrow zʻʻ\alpha \times \downarrow zʻʻ\beta =(\downarrow z\parallel \text{Cnv}ʻ\downarrow z)ʻʻ(\alpha \times \beta )$

*116·192. $\begin{align}\vdash :R\upharpoonright \gamma \in \alpha \,\overline{\text{ sm }}\, \gamma .S\upharpoonright \delta \in &\beta \,\overline{\text{ sm }}\, \delta .\supset .\\ &(R\parallel \breve{S} )\upharpoonright (\delta \times \gamma )\in (\alpha \,\,\text{exp}\,\,\beta )\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (\gamma \,\,\text{exp}\,\,\delta ).\\ &(R\parallel \breve{S} )_{\in }\upharpoonright (\gamma \,\,\text{exp}\,\,\delta )\in (\alpha \,\,\text{exp}\,\,\beta )\,\overline{\text{ sm }}\, (\gamma \,\,\text{exp}\,\,\delta )\end{align}$

*73·63. $\begin{align}\vdash :S\in \alpha \,\overline{\text{ sm }}\, \beta .T\upharpoonright \alpha ,T\upharpoonright \beta \in 1\rightarrow 1.\alpha \cup &\beta \subset \text{ᗡ}ʻT.\supset .\\ &T\mid S\mid \breve{T} \in (Tʻʻ\alpha )\,\overline{\text{ sm }}\, (Tʻʻ\beta )\end{align}$

By means of the above correlators, most correlators that are required can be calculated. Thus it will be seen that *116·192 in the above list is an immediate consequence of *113·127 and *115·502, since $\alpha \,\,\text{exp}\,\,\beta =\text{Prod}ʻ\alpha \downarrow_{,,}ʻʻ\beta\,\text{and}\,sʻ\text{Prod}ʻ\gamma \downarrow_{,,}ʻʻ\delta =\delta \times \gamma .$

In order to develop the subject, it is almost always necessary, not merely to prove that two classes are similar, but actually to construct a correlator of the two classes. This applies equally to relation-arithmetic, in which analogous correlators are used to prove ordinal similarity.

The distinction of finite and infinite is not required, as appears from Section B, for the definition of the arithmetical operations or for the proof of their formal laws. There are, however, many important respects in which finite cardinals and classes differ respectively from infinite cardinals and classes, and these differences must now be investigated.

There are two different ways in which we may define the finite and the infinite, and these two ways cannot (so far as is known at present) be shown to be equivalent except by assuming the multiplicative axiom. As there seems no good reason for regarding one of these ways as giving more exactly than the other what is usually meant by the words "finite" and "infinite," we shall, to avoid confusion, give other names than these to each of the two ways of dividing classes and cardinals. The division effected by the first method of definition we shall call the division into inductive and non-inductive; that effected by the second method we shall call the division into non-reflexive and reflexive.

The division into inductive and non-inductive, which is treated in *120, is defined as follows. An inductive cardinal is one which can be reached from 0 by successive additions of 1; that is, an inductive cardinal is one which has to 0 the relation $(+_{c}1)_{*}$ , where (by *38·02) $+_{c}1$ is the relation of $\alpha +_{c}1$ to $\alpha$ , and the subscript asterisk has the meaning defined in *90. Hence we put $\text{NC induct}=\hat{\alpha}\{\alpha (+_{c}1)_{*}0\} \quad\text{Df}.$ By applying the definition of *90, this gives $\vdash \colon\colon \alpha _{\in }\text{NC induct}.\equiv \colon\ldotp \xi \in \mu .\supset _{\xi }.\xi +_{c}1\in \mu :0\in \mu :\supset _{\mu }.\alpha \in \mu .$ This proposition may be regarded as stating that an inductive cardinal is one which obeys mathematical induction starting from 0, i.e. it is one which possesses every property possessed by 0 and by the numbers obtained by adding 1 to numbers possessing the property. In elementary mathematics, it is customary to regard mathematical induction, as applied to the series of natural numbers, as a principle rather than a definition, but according to[Pg 188] the above procedure it becomes a definition rather than a principle. This procedure is unavoidable as soon as it is perceived that there are cardinals which do not obey mathematical induction starting from 0. (This only holds on the assumption that the total number of objects in any one type is not one of the inductive cardinals. This assumption, in a slightly different form, is introduced below as the "axiom of infinity.") Thus for example $0\neq 1$ , and $\xi \neq \xi +_{c}1.\supset .\xi+_{c}1\neq \xi +_{c}2$ . Hence if $\alpha$ is any inductive cardinal, $\alpha \neq \alpha +_{c}1$ . But we know that $\aleph _{0}$ , the first of Cantor's transfinite cardinals[6], satisfies $\aleph_{0}=\aleph _{0}+_{c}1$ . Thus mathematical induction starting from 0 cannot be validly applied to prove properties of $\aleph _{0}$ . It follows that the inductive cardinals as above defined are only some among cardinals; nor does it appear that there is any way of defining them except as those that obey mathematical induction starting from 0. It follows that mathematical induction is not a principle, to be either proved or assumed as an axiom, but is merely a characteristic defining a certain class of cardinals, namely the class of inductive cardinals.

By a syllogism in Barbara, it is evident that 0 is an inductive cardinal; hence by the definition 1 is an inductive cardinal, and hence 2, 3, ... are inductive cardinals. Thus any given cardinal in the series of natural numbers can be shown to be an inductive cardinal. The usual elementary properties of inductive cardinals, such as the uniqueness of subtraction and division, are easily proved by mathematical induction.

We define an inductive class as a class the number of whose terms is an inductive cardinal. More simply, we put $\text{Cls induct}=sʻ\text{NC induct} \quad\text{Df}.$ It is then easily shown that an inductive class is one which can be reached from $\Lambda$ by successive additions of single members. That is, if we put $\begin{aligned} M=\hat{\eta} \hat{\zeta} \{(\exists y).\zeta =\eta \cup \iota ʻy\},\\ \text{then}\quad \text{Cls induct}=\overleftarrow{M}_{*}ʻ\Lambda . \end{aligned}$

Thus we have $\vdash \colon\colon \rho \in \text{Cls induct}.\equiv \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\Lambda \in \mu :\supset _{\mu }.\rho \in \mu .$ We might equally well have begun by defining inductive classes, and proceeded to define inductive cardinals as the cardinals of inductive classes; in that case, we should have used the above relation $M$ to define inductive classes.

Some of the properties which we expect inductive cardinals to possess, such for example as $\alpha \neq \alpha +_{c}1$ , can only be proved by assuming that no inductive cardinal is null, i.e. that $\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha .$ This amounts to the assumption that, in any fixed type, a class can be found[Pg 189] having any assigned inductive number of terms. If this were false, there would have to be some definite member of the series of natural numbers which gave the total number of objects of the type in question. Thus suppose there were exactly n individuals in the universe, and no more, where n is an inductive cardinal. We should then have $2^{n}$ classes, $2^{2^{n}}$ classes of classes, and so on. In that case, in the type of individuals we should have $n+_{c}1=\Lambda$ , $n+_{c}2=\Lambda$ , etc. Hence we should have $n+_{c}1=(n+_{c}1)+_{c}1,\,\text{etc}.$ In the type of classes, we should get similar results for $2^{n}$ , and so on. It is plain (though not demonstrable except in each particular case) that if the assumption $\alpha \in \text{NC induct}.\supset_{\alpha }.\exists !\alpha$ fails in any one type, it fails in any other type in the same hierarchy, and if it holds in any one, it holds in any other; for if n be the total number of individuals, then if $n$ is an inductive cardinal, the total number of any other type is an inductive cardinal, while if $n$ is not an inductive cardinal, no more is the total number of any other type. Hence the assumption $\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha$ is either true in any type or false in any type in one hierarchy. We shall call it the "axiom of infinity," putting $\text{Infin ax}.=:\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha \quad\text{Df}.$ This assumption, like the multiplicative axiom, will be adduced as a hypothesis whenever it is relevant. It seems plain that there is nothing in logic to necessitate its truth or falsehood, and that it can only be legitimately believed or disbelieved on empirical grounds. When we wish to use a typically definite form of the axiom, we shall employ the definition $\text{Infin ax}(x).=:\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha (x) \quad\text{Df}$ which asserts that, if $\alpha$ is any inductive cardinal, there are at least $\alpha$ terms of the same type as $x$ .

It is important to observe that, although the axiom of infinity cannot (so far as appears) be proved a priori, we can prove that any given inductive cardinal exists in a sufficiently high type. For if the total number of individuals be $n$ , the numbers of objects in succeeding types are $2^{n}$ , $2^{2^{n}}$ , etc., and these numbers grow beyond any assigned inductive cardinal. Owing, however, to the fact that we cannot add together an infinite number of classes whose types increase without limit, we cannot hence show that there is a type in which every inductive cardinal exists, though we can show of every inductive cardinal that there is a type in which it exists. i.e. if $\alpha$ is any inductive cardinal, there must be a type for $x$ such that $\exists !\alpha (x)$ is true; but there need not be a type for $x$ such that if $\alpha$ is any inductive cardinal, $\exists!\alpha (x)$ is true.

The axiom of infinity suffices to prove the existence, in appropriate types, of $\aleph _{0}$ , $2^{\aleph _{0}}$ , $2^{2^{{}\aleph_{0}}}$ , ... $\aleph _{1}$ , $\aleph _{2}$ , ...[7]. It does not [Pg 190]suffice, so far as we know, to prove the existence of $\aleph_{\omega}$ or any Aleph with a greater suffix than $\omega$ , because the existences of $\aleph _{1}$ , $\aleph _{2}$ , ... are proved in successively rising types, and no meaning can be found for a type whose order is infinite.

The other definition of finite and infinite is of less importance in practice than the definition by induction. It is dealt with in *124. According to this definition, we call a class reflexive when it contains a proper part similar to itself, i.e. we put $\text{Cls refl}=\hat{\alpha} \{(\exists R).R\in 1\rightarrow 1.\text{D}ʻR=\alpha .\text{ᗡ}ʻR\subset \alpha .\text{ᗡ}ʻR\neq \alpha\} \quad\text{Df},$ or, what comes to the same thing, $\text{Cls refl}=\hat{\alpha}\{(\exists R).R\in 1\rightarrow 1.\text{ᗡ}ʻR\subset \text{D}ʻR.\exists !\overrightarrow{B}ʻR.\alpha =\text{D}ʻR\} \quad\text{Df}.$ We call a cardinal reflexive when it is the homogeneous cardinal of a reflexive class, i.e. we put $\text{NC refl} = N_{0}ʻʻ\text{Cls refl} \quad\text{Df}.$ It is easy to show that $\text{NC refl} =\hat{\alpha} \{\exists !\alpha .\alpha =\alpha +_{c}1\}.$ We find that inductive classes and cardinals are non-reflexive, and reflexive classes and cardinals are non-inductive. We find also that reflexive cardinals are those that are equal to or greater than $\aleph _{0}$ , while inductive cardinals are those that are less than $\aleph _{0}$ . By assuming the multiplicative axiom, we can show that every cardinal is equal to, greater than, or less than $\aleph_{0}$ , whence it follows that every cardinal is either reflexive or inductive, thus identifying the two definitions of finite and infinite. But so long as we refrain from assuming either the multiplicative axiom or some special axiom ad hoc, it remains possible (so far as is known at present) that there may be cardinals neither greater than, nor equal to, nor less than $\aleph _{0}$ . Such cardinals, if they exist, are neither inductive nor reflexive: they are infinite if we define infinity by the negation of induction, but finite if we define infinity by reflexiveness. It is possible that further investigation may either prove or disprove the existence of such cardinals; for the present, their existence must remain an open question, except for those who regard the multiplicative axiom as a self-evident truth.

In *121 we shall consider intervals in a discrete series; i.e. in a series generated by a one-one relation between consecutive terms. If $P$ be the generating relation of such a series, and $x$ and $y$ be two members of the series, of which $y$ is the later, the terms which lie between $x$ and $y$ are the terms $z$ for which we have $xP_{\text{po}}z.zP_{\text{po}}y,$ where $P_{\text{po}}$ has the meaning defined in *91. Hence we put $P(x-y)=\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{\text{po}}ʻy \quad\text{Df},$ where " $P(x-y)$ " means "the $P$ -interval between $x$ and $y$ ." We want[Pg 191] also symbols for the interval together with one or both of its end-points. For these we put $\begin{aligned} P(x\unicode{x22A3} y)&=\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{*}ʻy &\quad\text{Df},\\ P(x\unicode{x27dd}y)&=\overleftarrow{P}_{*}ʻx\cap \overrightarrow{P}_{\text{po}}ʻy &\quad\text{Df},\\ P(x\vdash\dashv y)&=\overleftarrow{P}_{*}ʻx\cap \overrightarrow{P}_{*}ʻy &\quad\text{Df}. \end{aligned}$ [8] Thus, for example, if $x$ and $y$ be inductive cardinals, and $P$ be the relation of $n$ to $n+_{c}1$ , and $x < y$ , $P(x-y)$ will be the numbers greater than $x$ and less than $y$ , while $P(x\unicode{x27dd} y)$ will be these numbers together with $y$ , $P(x\unicode{x22A2}y)$ will be these numbers together with $x$ , and $P(x\vdash\dashv y)$ will be these numbers together with both $x$ and $y$ . By means of intervals, we define a class of relations $P_{\nu}$ (where $\nu$ is any inductive cardinal), where " $xP_{\nu }z$ " means that we can pass from $x$ to $z$ in $\nu$ steps. In order to fit the case in which $x$ and $z$ are identical, and to insure that no relation such as $P_{\nu}$ shall hold between terms which do not both belong to the field of $P$ , we put $P_{\nu }=\hat{x} \hat{y} \{\text{Nc}ʻP(x\vdash\dashv y)=\nu +_{c}1\} \quad\text{Df}.$ Then, provided $P_{\text{po}}\,\unicode{x2abd}\, J$ , $P_{0}=I\upharpoonright CʻP$ , and if further $P\in 1\rightarrow 1$ , then $P_{1}= P$ , $P_{2}=P^{2}$ , etc. If $P$ is a transitive serial relation, $P_{1}$ is the relation "immediately preceding," which has great importance in well-ordered series. In this case, $P_{1}=P\dot{-} P^{2}$ . If $P$ is a transitive serial relation generating a finite series or a progression or a series of the type of the negative and positive integers in order of magnitude, we have $P=(P_{1})_{\text{po}}.$

In *121 we shall only consider $P_{\nu}$ in the case where $P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1),$ and generally we shall have the further hypothesis $P_{\text{po}}\,\unicode{x2abd}\, J$ . We can then prove that the interval between $x$ and $y$ is always an inductive class (it will be null unless $xP_{*}y$ ); this proposition is useful in its application to the number-series and to progressions generally.

When $P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).P_{\text{po}}\,\unicode{x2abd}\, J$ , [Pg 192]the class of such relations as $P_{\nu }$ (where $\nu$ is an inductive cardinal) is identical with $\text{Potid}ʻP$ , the class of powers of $P$ (cf. *91 seq.). This identification (which does not hold in general without the above hypothesis) leads to many useful propositions. In *91 seq., we treated powers of a relation without the use of numbers, i.e. without defining the $\nu$ th power of $P$ . When the powers of $P$ are the class of such relations as $P_{\nu }$ , we can of course take $P_{\nu }$ as the $\nu$ th power of $P$ . The general definition of the $\nu$ th power of $P$ (where $\nu$ is an inductive cardinal) will be given later, in *301; we shall denote it by $P^\nu$ , thereby including the notation $P^{2}$ already defined.

In *122 we shall deal with progressions, i.e. with series of the type of the series of natural numbers. In this number, we shall deal with such series as generated by one-one relations; they will be dealt with at a later stage (*263) as generated by transitive relations. We define a progression as a one-one relation whose domain is the posterity of its first term, i.e. $\text{Prog} = (1 \rightarrow 1) \cap \hat{R} (\text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR) \quad\text{Df}.$ According to this definition, there must be a first term $BʻR$ ; $\text{ᗡ}ʻR$ will be $\breve{R} ʻʻ\overleftarrow{R}_{*}ʻBʻR$ , i.e. $\overleftarrow{R}_{\text{po}}ʻBʻR$ , which is contained in $\overleftarrow{R}_{*}ʻBʻR$ , i.e. in $\text{D}ʻR$ ; since $\text{ᗡ}ʻR \subset \text{D}ʻR$ , every term of the field of $R$ has a successor, so that there is no end to the series; since $CʻR = \text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR$ , every term of the series can be reached from the beginning by successive steps. These characteristics suffice to define progressions.

In *123 we proceed to the definition and discussion of $\aleph _{0}$ , the smallest of reflexive cardinals. This is the cardinal number of any class whose terms can be arranged in a progression; hence it is the class of domains of progressions, i.e. we may put $\aleph _{0} = \text{D}ʻʻ\text{Prog} \quad\text{Df}.$ With this definition, remembering that $\Lambda$ is a cardinal, we can prove that $\aleph _{0}$ is a cardinal; but to prove that $\aleph _{0}$ is an existent cardinal, we need the axiom of infinity. The existence-theorem for $\aleph _{0}$ is then derived from the inductive cardinals, which, if no one of them is null, form a progression when arranged in order of magnitude. It should be observed that this existence-theorem is for a higher type than that for which the axiom of infinity is assumed. In order to get an existence-theorem for the same type, we need the multiplicative axiom as well.

After a number on reflexive classes and cardinals (*124) and a number on the axiom of infinity (*125), the Section ends with a number (*126) on "typically indefinite inductive cardinals." The constant inductive cardinals are the typically ambiguous symbols 0, 1, 2, ...; thus we want to define the class of inductive cardinals in such a way that a variable member of the class shall be typically ambiguous. This is not possible without a sacrifice of rigour, but in *126 it is shown how to minimize the sacrifice of rigour, and how to obviate the resulting logical dangers. A variable whose values are typically ambiguous is said to be "typically indefinite."

A proof that all inductive cardinals exist has often been derived from *120·57 (below). But according to the doctrine of types, this proof is invalid, since " $\mu +_{0} 1$ " in *120·57 is necessarily of higher type than " $\mu$ ."

FOOTNOTES:

[6] For the definition of $\aleph _{0}$ , cf. *123·01 and p.192 of this summary.

[7] For the definitions of $\aleph _{1}$ , $\aleph _{2}$ , etc., see *265.

[8] These symbols are suggested by those given in Peano's Formulaire, Vol. IV. p. 116. (Algèbre, § 46.)

A difficulty arises respecting substitution in arithmetic. For if $\mu$ is a formal number and its occurrence in $f\mu$ is arithmetical, then by $\text{IIT}$ $\mu$ is always to be taken in an existential type. Hence we can only substitute a real variable $\xi$ for $\mu$ under the hypothesis $\exists !\xi$ , and we can only substitute another formal number $\sigma$ for $\mu$ provided that the equation $\mu = \sigma$ , which justifies the substitution, is arithmetical, i.e. provided that in this equation the type of $\mu$ is such that $\exists !\mu$ .

The result is that the application of *20·18 is apt to lead to fallacies owing to the different meanings which a formal number may possess in different occurrences. Hitherto we have considered each case in detail, e.g. note on *110·61, and proof of *110·56.

*118·01. $\vdash \colon\ldotp \exists !\mu .\mu =\sigma .\supset :f\mu .\equiv .f\sigma \quad[*20·18]$

This question is more fully discussed in the prefatory statement of this volume. The first reference to *118·01 is in *120·222. Another way of evading the difficulty is to work with formal numbers which, together with all their components, are of the same type. This leads to the consideration of Uniform Formal Numbers, which with the exception of *118·01 occupies the rest of the number.

The dominant type of a formal number as used in any context is the type of the formal number itself in that context, and the subordinate types of the formal number are the dominant types of its component formal numbers.

When the dominant types of some of the formal numbers are not expressly indicated by an explicit notation (cf. *65), the rules according to which the dominant types thus left ambiguous are to be related, so far as they are related, including the rules governing the relation of subordinate types, if left ambiguous, to dominant types, are given by conventions $\text{IT}$ , $\text{IIT}$ , and $\text{AT}$ of the prefatory statement in this volume.

We have now to consider an important special case which arises when types are explicitly indicated by the use of *65·01·03. A formal number,[Pg 194] whose subordinate types are the same as its dominant type, is called uniform; and if some of its subordinate types are the same as its dominant type, it is called partially uniform. A formal number can only be partially uniform, or at least so designated as to be necessarily partially uniform, when the dominant type and those subordinate types identical with it are expressly indicated by *65·01·03. For otherwise the conventions $\text{IT}$ , $\text{IIT}$ , and perhaps also $\text{AT}$ , apply; and these do not secure uniformity, and may perhaps in some contexts be inconsistent with it.

Common sense in its consideration of arithmetic habitually disregards the possibility of a formal number representing $\Lambda$ . In other words, it always applies conventions $\text{IIT}$ and $\text{AT}$ . But also, owing to its disregard of types, it assumes that the formal numbers are all uniform. The assumption which is really essential to this common sense reasoning, so far as the form of its arithmetical conclusions are concerned, is the assumption that none of the numerical symbols represent $\Lambda$ . This assumption is secured here, when no types are expressly indicated, by $\text{IIT}$ and $\text{AT}$ . We have now to consider the effect on arithmetical operations of the other assumption, that the formal numbers are uniform, or partially uniform. There is no difficulty arising from any change of convention for symbolism, since, as stated above, partial or complete uniformity is secured by express indication of type. Accordingly conventions $\text{IT}$ , $\text{IIT}$ continue, as always, to apply when the types of formal numbers are left ambiguous.

Convention $\text{AT}$ will not be applied either in *118 or *119 or *120: in *118 the fact is entirely unimportant since the dominant types of equational occurrences are always indicated, so that no case arises when it could apply.

Apart from its intrinsic interest and its bearing on substitution, the arithmetic of uniform formal numbers is necessary for *120, where the fundamental arithmetical properties of inductive numbers are investigated.

The propositions of this number are proved by the use of the results of *117. The basis of the reasoning is

*118·13. $\vdash \colon\ldotp \mu \leq \nu .\supset :\exists !\text{ sm }_{\xi }ʻʻ\nu .\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu$

In *118·2·3·4 the meaning of the symbolism for dominant types is stated, namely

*118·2. $\vdash .(\mu +_{c}\nu )_{\xi }=\hat{\eta} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }_{\xi }(\alpha +\beta )\}$

*118·3. $\vdash .(\mu \times _{c}\nu )_{\xi }=\hat{\eta} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }_{\xi }(\alpha \times \beta )\}$

*118·4. $\vdash .(\mu ^\nu )_{\xi }=\hat{\eta} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }_{\xi }(\alpha \,\,\text{exp}\,\,\beta )\}$

*118·23. $\vdash :\mu ,\nu \in \text{NC}.\supset .(\mu +_{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu)_{\xi }$

*118·24. $\vdash :\nu \in \text{NC}.\supset .(\mu +_{c}\nu )_{\xi }=(\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

*118·241. $\vdash :\mu \in \text{NC}.\supset .(\mu +_{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu +_{c}\nu )_{\xi }$

*118·25. $\vdash .(\mu +_{c}\nu +_{c}\varpi )_{\xi }=\{(\mu +_{c}\nu )_{\xi }+_{c}\varpi\}_{\xi }=\{\mu +_{c}(\nu +_{c}\varpi )_{\xi }\}_{\xi }$

*118·33. $\vdash :\mu ,\nu \in \text{NC}-\iota ʻ0.\supset .(\mu \times _{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

*118·34. $\vdash :\nu \in \text{NC}.\mu \neq 0.\supset .(\mu \times _{c}\nu )_{\xi }=(\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

*118·341. $\vdash :\mu \in \text{NC}.\nu \neq 0.\supset .(\mu \times _{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu \times _{c}\nu )_{\xi }$

*118·35. $\vdash :\varpi \neq 0.\supset .(\mu \times _{c}\nu \times _{c}\varpi )_{\xi }=\{(\mu \times _{c}\nu )_{\xi }\times _{c}\varpi\}_{\xi }$

*118·351. $\vdash :\mu \neq 0.\supset .(\mu \times _{c}\nu \times _{c}\varpi )_{\xi }=\{\mu \times _{c}(\nu \times _{c}\varpi )_{\xi }\}_{\xi}$

*118·43. $\vdash :\mu ,\nu \in \text{NC}-\iota ʻ0.\mu \neq 1.\supset .(\mu ^\nu )_{\xi }=\{(\text{ sm }_{\xi }ʻʻ\mu )^{\text{ sm }_{\xi }ʻʻ\nu }\}_{\xi}$

*118·44. $\vdash :\nu \in \text{NC}.\mu \neq 0.\mu \neq 1.\supset .(\mu ^\nu )_{\xi }=(\mu ^{\text{ sm }_{\xi }ʻʻ\nu })_{\xi }$

*118·441. $\vdash :\mu \in \text{NC}.\nu \neq 0.\supset .(\mu ^\nu )_{\xi }=\{(\text{ sm }_{\xi }ʻʻ\mu )^\nu \}_{\xi}$

*118·45. $\vdash :\mu \neq 0.\mu \neq 1.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi }=\{\mu ^{(\nu \times _{c}\varpi )_{\xi }}\}_{\xi}$

*118·451. $\vdash :\varpi \neq 0.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi }=[\{(\mu ^\nu )_{\xi }\}^{\varpi}]_{\xi }$

*118·46. $\vdash :\mu \neq 0.\mu \neq 1.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{\mu ^{(\nu +_{c}\varpi )_{\xi }}\}_{\xi }$

*118·461. $\vdash .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^{\varpi })_{\xi }\}_{\xi }$

*118·47. $\vdash :\varpi \neq 0.\supset .{(\mu \times _{c}\nu )^{\varpi }}_{\xi }=[\{(\mu \times _{c}\nu )_{\xi }\}^{\varpi }]_{\xi }$

*118·471. $\begin{align}\vdash \colon\ldotp \mu \neq 0.\nu \neq 0.\lor.\varpi =0.\lor.{\sim}&(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}):\supset .\\ &\{(\mu \times _{c}\nu )^{\varpi }\}_{\xi }=\{(\mu ^{\varpi })_{\xi }\times _{c}(\nu ^{\varpi })_{\xi }\}_{\xi }\end{align}$

It is thus seen that, apart from some exceptional cases connected with 0 and 1, in all arithmetical operations uniform, or partially uniform, formal numbers can replace those constructed in obedience to convention $\text{IIT}$ .

*118·01. $\vdash \colon\ldotp \exists !\mu .\mu =\sigma .\supset :f\mu .\equiv .f\sigma \quad[*20·18]$

As far as the symbolism is concerned, this proposition with the omission of $\exists !\mu$ from the hypothesis is a transcript of *20·18. But if $\mu$ or $\sigma$ (not excluding both) is a formal number, $\exists !\mu$ is required in case the occurrence of $\mu$ in $f\mu$ is arithmetical. In fact this proposition embodies the three fundamental propositions of the Principle of Arithmetical Substitution arrived at in the Prefatory Explanations on Types. Its necessity arises from the convention $\text{IIT}$ which is explained there.

*118·11. $\vdash :\exists !\text{Nc}(\xi )ʻ\beta .\alpha \subset \beta .\supset .\exists !\text{Nc}(\xi )ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*100·31.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ \gamma \in \text{Nc}(\xi )ʻ\beta .&\supset .\gamma \text{ sm }_{\xi }\beta .\\ [*73·1] &\supset .(\exists R).R\in 1(\xi )\rightarrow 1.\gamma =\text{D}ʻR.\beta =\text{ᗡ}ʻR.\\ [*22·55] &\supset .(\exists R).R\in 1(\xi )\rightarrow 1.\alpha \subset \text{ᗡ}ʻRʻʻ\alpha =Rʻʻ\alpha .\\ [*73·12] &\supset .(\exists R).Rʻʻ\alpha \text{ sm }_{\xi }\alpha .\\ [*100·31] &\supset .\exists !\text{Nc}(\xi )ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*118·12. $\begin{align}&\vdash \colon\ldotp \text{Nc}ʻ\alpha \leq \text{Nc}ʻ\beta .\supset :\exists !\text{Nc}(\xi )ʻ\beta .\supset .\exists !\text{Nc}(\xi )ʻ\alpha \\ &[*117·32·107.*100·511]\end{align}$

*118·13. $\vdash \colon\ldotp \mu \leq \nu .\supset :\exists !\text{ sm }_{\xi }ʻʻ\nu .\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu \quad[*117·32]$

*118·2. $\begin{align}&\vdash .(\mu +_{c}\nu )_{\xi }=\hat{\eta} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }_{\xi }(\alpha +\beta )\}\\ &[(*65·01·03).*110·2]\end{align}$

*118·201. $\begin{align}&\vdash :\exists !(\mu +_{c}\nu ).\supset .\text{ sm }_{\xi }ʻʻ(\mu +_{c}\nu )=(\mu +_{c}\nu )_{\xi }\\ &[\text{*110·44. Note Erratum in enunciation}]\end{align}$

*118·21. $\vdash :\exists !(\mu +_{c}\nu )_{\xi }.\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu .\exists !\text{ sm }_{\xi }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*110·4.*118·2.\supset \vdash :\text{Hp}.&\supset .\mu ,\nu \in \text{N}_{0}\text{C}.\\ [*117·6] &\supset .\mu +_{c}\nu \geq \mu .\mu +_{c}\nu \geq \nu .\\ [*118·13·201.(\text{IIT})] &\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu .\exists !\text{ sm }_{\xi }ʻʻ\nu :\supset \vdash .\text{Prop} \end{array}$

Here the reference $\text{IIT}$ is to the convention $\text{IIT}$ explained in the prefatory statement.

*118·22. $\begin{align}\vdash \colon\ldotp \mu ,\nu \in \text{NC}.\supset :&\exists !(\mu +_{c}\nu )_{\xi }.\equiv .\exists !(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }.\equiv .\\ &\exists !(\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }.\equiv .\exists !(\text{ sm }_{\xi }ʻʻ\mu +_{c}\nu )_{\xi }\end{align}$

Dem. $\begin{array}{l} \vdash .*118·21.\supset \vdash \colon\ldotp \text{Hp}.\supset :\exists !(\mu +_{c}\nu )_{\xi }.&\equiv .\exists !(\mu +_{c}\nu )_{\xi }.\exists !\text{ sm }_{\xi }ʻʻ\mu .\exists !\text{ sm }_{\xi }ʻʻ\nu .\\ [*110·25·4] &\equiv .\exists !(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(1)}\\ \vdash .*118·21.*103·43.*110·4.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\exists !(\mu +_{c}\nu )_{\xi }.&\equiv .\exists !(\mu +_{c}\nu )_{\xi }.\exists !\text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu .\exists !\text{ sm }_{\xi }ʻʻ\nu .\\ [*103·43.*110·25·4] &\equiv .\exists !(\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(2)}\\ \text{Similarly}\qquad \vdash \colon\ldotp \text{Hp}.&\supset :\exists !(\mu +_{c}\nu )_{\xi }.\equiv .\exists !(\text{ sm }_{\xi }ʻʻ\mu +_{c}\nu )_{\xi } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*118·23. $\vdash :\mu ,\nu \in \text{NC}.\supset .(\mu +_{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash .*118·21.*110·4·25.&\supset \vdash :\exists !(\mu +_{c}\nu )_{\xi }.\supset .(\mu +_{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(1)}\\ \vdash .*118·22.&\supset \vdash :\text{Hp}.{\sim}\exists !(\mu +_{c}\nu )_{\xi }.\supset .(\mu +_{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu +_{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*118·24. $\vdash : \nu \in \text{NC} . \supset . (\mu +_{c} \nu )_{\xi } = (\mu +_{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash . *118·21 . *110·4·25 . *103·43 . \supset \\ &\vdash : \exists ! (\mu +_{c} \nu )_{\xi } . \supset . (\mu +_{c} \nu )_{\xi } = (\mu +_{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(1)}\\ \vdash . *110·4 . &\supset \vdash : \mu {\sim} \in \text{NC} . \supset . (\mu +_{c} \nu )_{\xi } = (\mu +_{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(2)}\\ \vdash . *118·22 . &\supset \vdash : \text{Hp} . \mu \in \text{NC} . {\sim} \exists ! (\mu +_{c} \nu )_{\xi } . \supset . (\mu +_{c} \nu )_{\xi } = (\mu +_{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

*118·241. $\vdash : \mu \in \text{NC} . \supset . (\mu +_{c} \nu )_{\xi } = (\text{ sm }_{\xi }ʻʻ\mu +_{c} \nu )_{\xi } \quad[*118·24 . *110·51]$

*118·25. $\vdash . (\mu +_{c} \nu +_{c} \varpi )_{\xi } = \{(\mu +_{c} \nu )_{\xi } +_{c} \varpi\}_{\xi } = \{\mu +_{c} (\nu +_{c} \varpi )_{\xi }\}_{\xi}$

Dem. $\begin{array}{l} \vdash . *110·42 . *118·241·201 . (\text{IIT}) . \supset \\ &\vdash : \mu , \nu \in \text{N}_{0}\text{C} . \supset . (\mu +_{c} \nu +_{c} \varpi )_{\xi } = \{(\mu +_{c} \nu )_{\xi } +_{c}\varpi\}_{\xi } &\qquad \text{(1)}\\ \vdash . *110·4 . &\supset \vdash : {\sim} (\mu , \nu \in \text{N}_{0}\text{C}) . \supset . \mu +_{c} \nu = \Lambda . (\mu +_{c} \nu )_{\xi } = \Lambda .\\ [*110·4] &\supset . (\mu +_{c} \nu +_{c} \varpi )_{\xi } = \{(\mu +_{c} \nu )_{\xi } +_{c} \varpi\}_{\xi } &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash . (\mu +_{c} \nu +_{c} \varpi )_{\xi } = \{(\mu +_{c} \nu )_{\xi } +_{c} \varpi\}_{\xi } &\qquad \text{(3)}\\ \text{Similarly}\qquad &\vdash . (\mu +_{c} \nu +_{c} \varpi )_{\xi } = \{\mu +_{c} (\nu +_{c} \varpi)_{\xi }\}_{\xi } &\qquad \text{(4)}\\ \vdash . (3) . (4) . &\supset \vdash . \text{Prop} \end{array}$

*118·3. $\begin{align}&\vdash . (\mu \times _{c} \nu )_{\xi } = \hat{\eta} \{(\exists \alpha , \beta ) . \mu = \text{N}_{0}\text{c}ʻ\alpha . \nu = \text{N}_{0}\text{c}ʻ\beta . \eta \text{ sm }_{\xi } (\alpha \times \beta )\}\\ &[(*65·01·03) . *113·2]\end{align}$

*118·301. $\vdash : \exists ! (\mu \times _{c} \nu ) . \supset . \text{ sm }_{\xi }ʻʻ(\mu \times _{c} \nu ) = (\mu \times _{c} \nu )_{\xi } \quad[\text{Proof as in *118·201}]$

*118·31. $\vdash : \exists ! (\mu \times _{c} \nu )_{\xi } . \nu \neq 0 . \supset . \exists ! \text{ sm }_{\xi }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash . *101·15·12. &\supset \vdash : \mu = 0 . \supset . \exists ! \text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(1)}\\ \vdash . *113·203 . *118·3 . &\supset \vdash : \text{Hp} . \mu \neq 0 . \supset . \mu , \nu \in \text{N}_{0}\text{C} - \iota ʻ0 .\\ [*117·62] &\supset . \mu \times _{c} \nu \geq \mu .\\ [*118·13·301 . (\text{IIT})] &\supset . \exists ! \text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*118·311. $\vdash : \exists ! (\mu \times _{c} \nu )_{\xi } . \mu \neq 0 . \supset . \exists ! \text{ sm }_{\xi }ʻʻ\nu \quad[*118·31 . *113·27]$

*118·32. $\vdash \colon\ldotp \nu \in \text{NC} . \mu \neq 0 . \supset : \exists ! (\mu \times _{c} \nu )_{\xi } . \equiv . \exists ! (\mu \times _{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash . *113·203 . &\supset \vdash : \exists ! (\mu \times _{c} \nu )_{\xi } . \supset . \mu \in \text{NC} &\qquad \text{(1)}\\ \vdash . *113·203 . &\supset \vdash : \exists ! (\mu \times _{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } . \supset . \mu \in \text{NC} &\qquad \text{(2)}\\ \vdash . *113·203 . *118·311 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \exists ! (\mu \times _{c} \nu )_{\xi } . \supset . \exists ! \mu . \exists ! \text{ sm }_{\xi }ʻʻ\nu .\\ [*103·43] &\supset . \exists ! \text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu . \exists ! \text{ sm }_{\xi }ʻʻ\nu .\\ [(1) . *113·26 . *103·43] &\supset . \exists ! (\mu \times _{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(3)}\\ \vdash . *113·203 . *103·43 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \exists ! (\mu \times _{c} \text{ sm }_{\xi }ʻʻ\nu )_{\xi } . \supset . \exists ! \text{ sm }ʻʻ\mu \cap t_{0}ʻ\mu . \exists ! \text{ sm }_{\xi }ʻʻ\nu .\\ [(2) . *113·26 . *103·43] &\supset . \exists ! (\mu \times _{c} \nu )_{\xi } &\qquad \text{(4)}\\ \vdash . (3) . (4) . \supset \vdash . \text{Prop} \end{array}$

*118·33. $\begin{align}&\vdash :\mu ,\nu \in \text{NC}-\iota ʻ0.\supset .(\mu \times _{c}\nu )_{\xi }=(\text{ sm }_{\xi }ʻʻ\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }\\ &[\text{Proof as in *118·23, using *118·31·311. *113·203·26}]\end{align}$

*118·34. $\vdash :\nu \in \text{NC}.\mu \neq 0.\supset .(\mu \times _{c}\nu )_{\xi }=(\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash .*118·311.*113·203·26.*103·43.\supset \\ &\vdash :\exists !(\mu \times _{c}\nu )_{\xi }.\mu \neq 0.\supset .(\mu \times _{c}\nu )_{\xi }=(\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }&\qquad \text{(1)}\\ \vdash .*118·32.&\supset \vdash :\text{Hp}.{\sim}\exists !(\mu \times _{c}\nu )_{\xi }.\supset .{\sim}\exists !(\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi }.\\ [*24·51] &\supset .(\mu \times _{c}\nu )_{\xi }=(\mu \times _{c}\text{ sm }_{\xi }ʻʻ\nu )_{\xi } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*118·341. $\vdash :\mu \in \text{NC}.\nu \neq 0.\supset .(\mu \times _{c}\nu )_{\xi }=(\text{sm }_{\xi }ʻʻ\mu \times _{c}\nu )_{\xi } \quad[*118·34.*113·27]$

*118·35. $\begin{align}&\vdash :\varpi \neq 0.\supset .(\mu \times _{c}\nu \times _{c}\varpi )_{\xi }=\{(\mu \times _{c}\nu )_{\xi }\times _{c}\varpi \}_{\xi }\\ &[\text{Proof similar to *118·25, using *118·341·301.*113·203·23}]\end{align}$

*118·351. $\vdash :\mu \neq 0.\supset .(\mu \times _{c}\nu \times _{c}\varpi )_{\xi }=\{\mu \times _{c}(\nu \times _{c}\varpi )_{\xi }\}_{\xi } \quad[*118·35.*113·27]$

*118·352. $\begin{align}&\vdash :\mu \neq 0.\varpi \neq 0.\supset .\{\mu \times _{c}(\nu \times _{c}\varpi )_{\xi }\}_{\xi }=\{(\mu \times _{c}\nu )_{\xi }\times _{c}\varpi \}_{\xi }\\ &[*118·35·351]\end{align}$

*118·4. $\begin{align}&\vdash .(\mu ^\nu )_{\xi }=\hat{\eta} \{(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\eta \text{ sm }_{\xi }(\alpha \,\,\text{exp}\,\,\beta )\}\\ &[(*65·01·03).*116·2]\end{align}$

*118·401. $\vdash :\exists !\mu ^\nu .\supset .\text{ sm }_{\xi }ʻʻ\mu ^\nu =(\mu ^\nu )_{\xi } \quad[\text{Proof as in *118·201}]$

*118·402. $\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{C}.\mu \neq 0.\mu \neq 1.\supset :\exists !(\mu ^\nu )_{\xi }.\supset .\exists !(\mu \times _{c}\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash .*103·2. \supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\alpha {\sim}\in 0\cup 1:\\ [*117·651] &\supset :(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\\ &(\text{N}_{0}\text{c}ʻ\alpha )^{\text{N}_{0}\text{c}ʻ\beta }\geq \text{N}_{0}\text{c}ʻ\alpha \times _{c}\text{N}_{0}\text{c}ʻ\beta :\\ [*118·13·301·401.(\text{IIT})]&\supset :\exists !(\mu ^\nu )_{\xi }.\supset .\exists !(\mu \times _{c}\nu )_{\xi }\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*118·41. $\vdash :\exists !(\mu ^\nu )_{\xi }.\nu \neq 0.\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*118·402·31. \supset \vdash :\text{Hp}.\mu \neq 1.\mu \neq 0.\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*101·12·15·241·28.\supset \vdash \colon\ldotp \mu =0.\lor.\mu =1:\supset .\exists !\text{ sm }_{\xi }ʻʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*118·411. $\vdash :\exists !(\mu ^\nu )_{\xi }.\mu \neq 0.\mu \neq 1.\supset .\exists !\text{ sm }_{\xi }ʻʻ\nu \quad[*118·402·311]$

*118·42. $\begin{align}&\vdash \colon\ldotp \nu \in \text{NC}.\mu \neq 0.\mu \neq 1.\supset :\exists !(\mu ^\nu )_{\xi }.\equiv .\exists !(\mu ^{\text{ sm }_{\xi }ʻʻ\nu })_{\xi }\\ &[\text{Proof as in *118·32, using *116·203·26.*118·411}]\end{align}$

*118·421. $\begin{align}&\vdash \colon\ldotp \mu \in \text{NC}.\nu \neq 0.\supset :\exists !(\mu ^\nu )_{\xi }.\equiv .\exists !\{(\text{ sm }_{\xi }ʻʻ\mu )^\nu\}_{\xi }\\ &[\text{Proof as in *118·32, using *116·203·26.*118·41}]\end{align}$

*118·43. $\begin{align}&\vdash :\mu ,\nu \in \text{NC}-\iota ʻ0.\mu \neq 1.\supset .(\mu ^\nu )_{\xi }=\{(\text{ sm }_{\xi }ʻʻ\mu )^{\text{ sm }_{\xi }ʻʻ\nu }\}_{\xi }\\ &[\text{Proof as in *118·23, using *118·41·411.*116·203·26}]\end{align}$

*118·44. $\begin{align}&\vdash :\nu \in \text{NC}.\mu \neq 0.\mu \neq 1.\supset .(\mu ^\nu )_{\xi }=(\mu ^{\text{ sm }_{\xi }ʻʻ\nu })_{\xi }\\ &[\text{Proof as in *118·34, using *116·203·26.*118·411·42}]\end{align}$

*118·441. $\begin{align}&\vdash :\mu \in \text{NC}.\nu \neq 0.\supset .(\mu ^\nu )_{\xi }=\{(\text{ sm }_{\xi }ʻʻ\mu )^\nu\}_{\xi }\\ &[\text{Proof as in *118·34, using *116·203·26.*118·41·421}]\end{align}$

*118·45. $\vdash :\mu \neq 0.\mu \neq 1.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi }=\{\mu ^{(\nu \times _{c}\varpi )_{\xi }}\}_{\xi }$

Dem. $\begin{array}{l} \vdash .*113·23.*118·44·301.(\text{IIT}).\supset\\ \vdash :\text{Hp}.\nu ,\varpi \in \text{N}_{0}\text{C}.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi }=\{\mu ^{(\nu \times _{c}\varpi )_{\xi }}\}_{\xi } &&\qquad \text{(1)}\\ \vdash .*113·203.\supset \vdash :{\sim}(\nu ,\varpi \in \text{N}_{0}\text{C}).&\supset .\nu \times _{c}\varpi =\Lambda .\\ [*116·203] &\supset . (\mu ^{\nu \times _{c}\varpi })_{\xi }=\{\mu ^{(\nu \times _{c}\varpi )_{\xi }}\}_{\xi } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*118·451. $\vdash :\varpi \neq 0.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi } =[\{(\mu ^\nu )_{\xi }\}^\varpi ]_{\xi }$

Dem. $\begin{array}{l} \vdash .*116·63. \supset \vdash :\text{Hp}.\mu \in \text{NC}.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi } &=\{(\mu ^\nu )^\varpi\}_{\xi }\\ [*116·23.*118·441·401.(\text{IIT})] &=[\{(\mu ^\nu )_{\xi }\}^\varpi ]_{\xi } &\qquad \text{(1)}\\ \vdash .*116·204.\supset \vdash :\mu {\sim}\in \text{NC}.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi } &=[\{(\mu ^\nu )_{\xi }\}^\varpi ]_{\xi } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*118·46. $\begin{align}&\vdash :\mu \neq 0.\mu \neq 1.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{\mu ^{(\nu +_{c}\varpi )}_{\xi}\}_{\xi }\\ &[\text{Proof as in *118·45, using *118·44·201.*116·203.*110·4·42}]\end{align}$

*118·461. $\vdash .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi }$

Dem. $\begin{array}{l} \vdash .*116·52.\supset \vdash :\mu \neq 0.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=(\mu ^\nu \times _{c}\mu ^\varpi )_{\xi }\\ [*116·35·23.*118·33·401.(\text{IIT})] =\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(1)}\\ \vdash .*110·4.*113·203.*116·203.\supset \\ \vdash :{\sim}(\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(2)}\\ \vdash .*116·311.*113·601.*110·62.\supset \\ \vdash :\nu ,\varpi \in \text{N}_{0}\text{C}-\iota ʻ0.\mu =0.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(3)}\\ \vdash .*116·311·301.*110·6.*113·601.\supset \\ \vdash :\nu \in \text{N}_{0}\text{C}-\iota ʻ0.\varpi =0.\mu =0.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(4)}\\ \text{Similarly}\qquad \vdash :\varpi \in \text{N}_{0}\text{C}-\iota ʻ0.\nu =0.\mu =0.\supset .(\mu ^{\nu \times _{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(5)}\\ \vdash .*116·301.*113·621.\supset \\ \vdash :\nu =0.\varpi =0.\mu =0.\supset .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(6)}\\ \vdash .(1).(2).(3).(4).(5).(6).\supset \vdash .\text{Prop} \end{array}$

*118·462. $\vdash .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{\mu ^\nu \times _{c}(\mu ^\varpi )_{\xi }\}_{\xi } \quad[\text{Proof as in *118·461, using *118·34}]$

*118·463. $\vdash .(\mu ^{\nu +_{c}\varpi })_{\xi }=\{(\mu ^\nu )_{\xi }\times _{c}\mu ^\varpi\}_{\xi } \quad[\text{Proof as in *118·461, using *118·341}]$

*118·47. $\begin{align}&\vdash :\varpi \neq 0.\supset .\{(\mu _{c}\nu )^\varpi\}_{\xi }=[\{(\mu \times _{c}\nu )_{\xi }\}^\varpi ]_{\xi }\\ &[\text{Proof as in *118·45, using *118·441}]\end{align}$

*118·471. $\begin{align}\vdash \colon\ldotp \mu \neq 0.\nu \neq 0.\lor.\varpi =0.\lor.{\sim}&(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}):\supset .\\ &\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{(\mu ^\varpi )_{\xi }\times _{c}(\nu ^\varpi )_{\xi }\}_{\xi }\end{align}$

Dem. $\begin{array}{l} \vdash .*116·55.\supset \vdash :\mu \neq 0.\nu \neq 0.\supset .\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{\mu ^\varpi \times _{c}\nu ^\varpi\}_{\xi }\\ [*116·35·23.*118·33·401.(\text{IIT})] =\{(\mu ^\varpi )_{\xi }\times _{c}(\nu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(1)}\\ \vdash .*110·4.*113·203.*116·203.\supset\\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}).\supset .\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{(\mu ^\varpi )_{\xi }\times _{c}(\nu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(2)}\\ \vdash .*116·301.*113·621.\supset \\ \vdash :\mu ,\nu \in \text{N}_{0}\text{C}.\varpi =0.\supset .\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{(\mu ^\varpi )_{\xi }\times _{c}(\nu ^\varpi )_{\xi }\}_{\xi } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*118·472. $\begin{align}&\vdash \colon\ldotp \mu \neq 0.\lor.\varpi =0.\lor.{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}):\supset .\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{\mu ^\varpi \times _{c}\nu ^\varpi )_{\xi }\}_{\xi }\\ &[\text{Proof as in *118·471, using *118·34}]\end{align}$

*118·473. $\begin{align}&\vdash \colon\ldotp \nu \neq 0.\lor.\varpi =0.\lor.{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{C}):\supset .\{(\mu \times _{c}\nu )^\varpi\}_{\xi }=\{(\mu ^\varpi )_{\xi }\times _{c}\nu ^\varpi\}_{\xi }\\ &[\text{Proof as in *118·471, using *118·341}]\end{align}$

The treatment of subtraction follows the same general lines as that of addition, and is simplified by the results in *110. A difficulty arises from the fact that subtraction (in any ordinary sense of the term) is not always possible; and also from the fact that the result, when possible, is not always a cardinal number.

*119·01. $\gamma -_{c}\nu =\hat{\xi} \{\text{Nc}ʻ\xi +_{c}\nu =\gamma .\exists !\text{Nc}ʻ\xi +_{c}\nu\} \quad\text{Df}$

Thus when subtraction (in the ordinary sense of the term) is not possible, $\gamma -_{c}\nu =\Lambda .$

The question of existential adjustment of types is dealt with by $\text{IIT}$ of the prefatory statement combined with the following definitions:

*119·02. $\text{Nc}ʻ\alpha -_{c}\nu =\text{N}_{0}\text{c}ʻ\alpha -_{c}\nu \quad\text{Df}$

*119·03. $\gamma -_{c}\text{Nc}ʻ\beta =\gamma -_{c}\text{N}_{0}\text{c}ʻ\beta \quad\text{Df}$

We then proceed to deduce the elementary properties derivable from these definitions.

*119·11. $\vdash :\exists !\gamma -_{c}\nu .\supset .\gamma ,\nu \in \text{N}_{0}\text{C}$

*119·12 $\vdash :\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta .\equiv .\alpha \text{ sm }\xi +\beta$

*119·14. $\vdash :\xi \in \gamma -_{c}\nu .\supset .\text{N}_{0}\text{c}ʻ\xi \subset \gamma -_{c}\nu$

*119·25. $\vdash :\gamma \geq \nu .\supset .\exists !(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma$

The next group of propositions is concerned with some simple results of subtraction.

*119·32. $\vdash :(\gamma +_{c}\nu )-_{c}\nu \in \text{N}_{0}\text{C}.\supset .\text{ sm }ʻʻ\gamma =(\gamma +_{c}\nu )-_{c}\nu$

*119·34. $\vdash :\gamma -_{c}\nu \in \text{N}_{0}\text{C}.\supset .(\gamma -_{c}\nu )+_{c}\nu =\text{ sm }ʻʻ\gamma$

*119·35. $\vdash :\gamma -_{c}\nu \in \text{N}_{0}\text{C}.\supset .\alpha +_{c}\gamma =(\alpha +_{c}\nu )+_{c}(\gamma -_{c}\nu )$

*119·44. $\vdash :\mu +_{c}(\nu -_{c}\varpi )\subset (\mu +_{c}\nu )-_{c}\varpi$

*119·45. $\vdash :(\mu +_{c}\nu )-_{c}\varpi \in \text{NC}.\exists !\{\mu +_{c}(\nu -_{c}\varpi )\}.\supset .\mu +_{c}(\nu -_{c}\varpi )=(\mu +_{c}\nu )-_{c}\varpi$

*119·52. $\vdash :\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma }=(\mu -_{c}\nu )_{\delta }\cap \text{D}ʻ\text{ sm }_{\delta ,\gamma }$

A difficulty arises from the fact that if $\tau _{1}$ and $\tau_{2}$ are two complete types whose members are classes, we cannot prove that, either $\tau _{1} = \text{ sm }ʻʻ\tau _{2}$ or $\tau _{2}= \text{ sm }ʻʻ\tau _{1}$ . We put

*119·54. $\text{SM}(\delta ,\gamma ).=:tʻ\delta =\text{D}ʻ\text{ sm }_{\delta ,\gamma }.\lor.tʻ\gamma =\text{D}ʻ\text{ sm }_{\gamma ,\delta } \quad\text{Df}$

*119·541. $\begin{align}\vdash :\text{SM}(\delta ,\gamma ).(\mu -_{c}\nu )_{\gamma }&\in \text{N}_{0}\text{C}.(\mu -_{c}\nu )_{\delta }\in \text{NC}.\supset .\\ &\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma }=(\mu -_{c}\nu )_{\delta }\end{align}$

Finally we show that any existential adjustment of types will suffice for the components:

*119·61. $\vdash :\mu \in \text{N}_{0}\text{C}.\exists !\text{ sm }_{\xi }ʻʻ\mu .\supset .\mu -_{c}\nu =\text{ sm }_{\xi }ʻʻ\mu -_{c}\nu$

*119·62. $\vdash :\nu \in \text{N}_{0}\text{C}.\exists !\text{ sm }_{\xi }ʻʻ\nu .\supset .\mu -_{c}\nu =\mu -_{c}\text{ sm }_{\xi }ʻʻ\nu$

*119·64. $\vdash \colon\ldotp \exists !\text{ sm }_{\xi }ʻʻ\mu .\supset :\mu \geq \nu .\equiv .\exists !(\mu -_{c}\nu )_{\xi }$

The only applications of the propositions of this number are in connection with Inductive Cardinals (cf. *120).

*119·01. $\gamma -_{c}\nu =\hat{\xi} \{\text{Nc}ʻ\xi +_{c}\nu =\gamma .\exists !\text{Nc}ʻ\xi +_{c}\nu\} \quad\text{Df}$

Here the suffix to the sign of subtraction is introduced to show that we are concerned with cardinal subtraction. It will be found that $\gamma -_{c}\nu$ is not an $\text{NC}$ except under hypotheses for $\gamma$ and $\nu$ .

*119·02. $\text{Nc}ʻ\alpha -_{c}\nu =\text{N}_{0}\text{c}ʻ\alpha -_{c}\nu \quad\text{Df}$

*119·03. $\gamma -_{c}\text{Nc}ʻ\beta =\gamma -_{c}\text{N}_{0}\text{c}ʻ\beta \quad\text{Df}$

*119·04. $\vdash .\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\alpha -_{c}\text{N}_{0}\text{c}ʻ\beta \quad[*119·02·03]$

Note that the occurrence of a formal number in the place of $\gamma$ or $\nu$ in $\gamma -_{c}\nu$ is an arithmetic occurrence, and accordingly $\text{IIT}$ applies to it.

*119·1. $\vdash :\xi \in \gamma -_{c}\nu .\equiv .\text{Nc}ʻ\xi +_{c}\nu =\gamma .\exists !\text{Nc}ʻ\xi +_{c}\nu \quad [(*119·01)]$

*119·101. $\vdash :\xi \in \text{Nc}ʻ\alpha -_{c}\nu .\equiv .\text{Nc}ʻ\xi +_{c}\nu =\text{N}_{0}\text{c}ʻ\alpha \quad[(*119·02).*103·13]$

*119·102. $\begin{align}&\vdash :\xi \in \gamma -_{c}\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\xi +_{c}\text{Nc}ʻ\beta =\gamma .\exists !\text{Nc}ʻ\xi +_{c}\text{Nc}ʻ\beta\\ &[(*119·03).*110·3]\end{align}$

*119·103. $\begin{align}&\vdash :\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta .\equiv .\text{Nc}ʻ\xi +_{c}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\alpha\\ &[*119·04.*110·3.*103·13]\end{align}$

*119·11. $\vdash :\exists !\gamma -_{c}\nu .\supset .\gamma ,\nu \in \text{N}_{0}\text{C} \quad[*110·4·42.*103·34]$

*119·12. $\vdash :\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta .\equiv .\alpha \text{ sm }\xi +\beta$

Dem. $\begin{array}{l} \vdash .*119·103.\supset \vdash :\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta .&\equiv .\text{Nc}ʻ\xi +_{c}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\alpha .\\ [*110·3] &\equiv .\text{Nc}ʻ(\xi +\beta )=\text{N}_{0}\text{c}ʻ\alpha .\\ [*100·35.*103·13] &\equiv .\alpha \text{ sm }\xi +\beta :\supset \vdash .\text{Prop} \end{array}$

Thus $\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta$ is an $\text{NC}$ when $\hat{\xi} (\alpha \text{ sm }\xi +\beta )$ is an $\text{NC}$ .

*119·13. $\vdash :\text{N}_{0}\text{c}ʻ\gamma \subset \text{Nc}ʻa-_{c}\text{Nc}ʻ\beta .\equiv .\alpha \text{ sm }(\gamma +\beta )$

Dem. $\begin{array}{l} \vdash .*22·1.\supset \vdash \colon\ldotp \text{N}_{0}\text{c}ʻ\gamma \subset \text{Nc}ʻa-_{c}\text{Nc}ʻ\beta .&\equiv :\xi \in \text{N}_{0}\text{c}ʻ\gamma .\supset _{\xi }.\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta :\\ [*103·12.*119·12] &\supset :\alpha \text{ sm }(\gamma +\beta ) &\qquad \text{(1)}\\ \vdash .*110·15.*100·31.&\supset \vdash \colon\ldotp \alpha \text{ sm }(\gamma +\beta ).\supset :\xi \in \text{N}_{0}\text{c}ʻ\gamma .\supset .(\xi +\beta )\text{ sm }(\gamma +\beta ).\\ [*73·32] &\supset .\alpha \text{ sm }(\xi +\beta ).\\ [*119·12] &\supset .\xi \in \text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*119·14. $\vdash :\xi \in \gamma -_{c}\nu .\supset .\text{N}_{0}\text{c}ʻ\xi \subset \gamma -_{c}\nu \quad[*119·1.*100·31·321]$

*119·21. $\vdash :\beta \subset \alpha .\supset .\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\alpha }$

Dem. $\begin{array}{l} \vdash .*24·411·21.\supset \vdash :\text{Hp}.&\supset .\alpha =\beta \cup (\alpha -\beta ).\beta \cap (\alpha -\beta )=\Lambda .\\ [*110·32] &\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\text{Nc}ʻ(\alpha -\beta ).\\ [*10·24] &\supset .(\exists \xi ).\xi \in tʻ\alpha .\text{N}_{0}\text{c}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\text{Nc}ʻ\xi .\\ [*119·103] &\supset .\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\alpha }:\supset \vdash .\text{Prop} \end{array}$

*119·22. $\vdash :\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\supset .\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\alpha }$

Dem. $\begin{array}{l} \vdash .*117·221.&\supset \vdash :\text{Hp}.\supset .(\exists \rho ).\rho \subset \alpha .\rho \text{ sm }\beta .\\ [*119·21] &\supset .(\exists \rho ).\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\rho )_{\alpha }.\rho \text{ sm }\beta .\\ [*100·35.*119·04] &\supset .\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\alpha }:\supset \vdash .\text{Prop} \end{array}$

*119·23. $\vdash :\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta ).\supset .(\exists \delta ).\delta \text{ sm }\beta .\delta \subset \alpha$

Dem. $\begin{array}{l} \vdash .*119·103.\supset \vdash :\text{Hp}.&\supset .(\exists \xi ).\text{N}_{0}\text{c}ʻ\alpha =\text{Nc}ʻ\beta +_{c}\text{Nc}ʻ\xi .\\ [*110·71] &\supset .(\exists \delta ).\delta \text{ sm }\beta .\delta \subset \alpha :\supset \vdash .\text{Prop} \end{array}$

*119·24. $\vdash :\exists !(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta ).\supset .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta \quad[*119·23.*117·221]$

*119·25. $\vdash :\gamma \geq \nu .\supset .\exists !(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma$

Dem. $\begin{array}{l} \vdash .*117·24.\supset \vdash :\text{Hp}.&\supset .(\exists \alpha ,\beta ).\gamma =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta .\\ [*117·107] &\supset .(\exists \alpha ,\beta ).\gamma =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\\ [*119·22·04] &\supset .(\exists \alpha ,\beta ).\gamma =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !(\text{N}_{0}\text{c}ʻ\alpha -_{c}\text{N}_{0}\text{c}ʻ\beta )_{\alpha }.\\ [(*63·02).*13·193] &\supset ·\exists !(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*119·11.\supset \vdash :\text{Hp}.&\supset .(\exists \alpha ,\beta ).\gamma =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\exists !(\text{N}_{0}\text{c}ʻ\alpha -_{c}\text{N}_{0}\text{c}ʻ\beta ).\\ [*119·04·24] &\supset .(\exists \alpha ,\beta ).\gamma =\text{N}_{0}\text{c}ʻ\alpha .\nu =\text{N}_{0}\text{c}ʻ\beta .\text{Nc}ʻ\alpha \geq \text{Nc}ʻ\beta .\\ [*117·107.*13·193] &\supset .\gamma \geq \nu :\supset \vdash .\text{Prop} \end{array}$

*119·27. $\vdash :\gamma \geq \nu .\equiv .\exists !(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma \quad[*119·25·26]$

*119·31. $\vdash :\gamma ,\nu \in \text{N}_{0}\text{C}.\supset .\text{ sm }ʻʻ\gamma \subset (\gamma +_{c}\nu )-_{c}\nu$

Dem. $\begin{array}{l} \vdash .*119·1.(\text{IIT}).\supset \vdash :\xi \in (\gamma +_{c}\nu )-_{c}\nu .&\equiv .\text{Nc}ʻ\xi +_{c}\nu =\gamma +_{c}\nu .\exists !\gamma +_{c}\nu &\qquad \text{(1)}\\ \vdash .*100·51·521. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \text{ sm }ʻʻ\gamma .\supset .\text{Nc}ʻ\xi =\gamma .\\ [*103·22.*118·01] &\supset .\text{Nc}ʻ\xi +_{c}\nu =\gamma +_{c}\nu .\\ [*110·22·03.*103·13] &\supset .\text{Nc}ʻ\xi +_{c}\nu =\gamma +_{c}\nu .\exists !\gamma +_{c}\nu .\\ [(1)] &\supset .\xi \in (\gamma +_{c}\nu )-_{c}\nu :\supset \vdash .\text{Prop} \end{array}$

The penultimate step in the proof employs the principle, explained in the prefatory statement, that, since in the previous line the equation $\text{Nc}ʻ\xi +_{c}\nu =\gamma +_{c}\nu$ has its sides undetermined in type by the conventions $\text{IT}$ and $\text{IIT}$ , any convenient type can be chosen for them. The type chosen in this line is such that $\exists !\gamma +_{c}\nu$ , and the references indicate the existence of at least one such type.

*119·32. $\begin{align}&\vdash :(\gamma +_{c}\nu )-_{c}\nu \in \text{N}_{0}\text{C}.\supset .\text{ sm }ʻʻ\gamma =(\gamma +_{c}\nu )-_{c}\nu\\ &[*119·11·31.*103·22.*100·52·42]\end{align}$

*119·33. $\vdash :\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta \in \text{N}_{0}\text{C}.\supset .(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta =\text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*119·13.&\supset \vdash :\text{N}_{0}\text{c}ʻ\gamma =\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta .\supset .\alpha \text{ sm }(\gamma +\beta ) &\qquad \text{(1)}\\ \vdash .*20·18.*118·01.\supset \vdash \colon\ldotp \text{Hp}(1).\supset : (\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\xi .&\equiv _{\xi }.\text{Nc}ʻ\gamma +_{c}\text{Nc}ʻ\beta =\text{N}_{0}\text{c}ʻ\xi .\\ [*110·3.*100·35] &\equiv _{\xi }.\xi \text{ sm }(\gamma +\beta ).\\ [(1).*103·42] &\equiv _{\xi }.\text{N}_{0}\text{c}ʻ\xi =\text{Nc}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*103·2·34.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\exists !\text{Nc}ʻ\alpha .\supset .(\exists \xi ).\text{N}_{0}\text{c}ʻ\xi =\text{Nc}ʻ\alpha .\\ [(2).*10·1] &\supset .(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta =\text{Nc}ʻ\alpha &\qquad \text{(3)}\\ \vdash .*110·42.*103·34·2.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &\exists !\{(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta \}.\supset .(\exists \xi ).\text{N}_{0}\text{c}ʻ\xi =(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta .\\ [(2).*10·1] &\supset .(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )+_{c}\text{Nc}ʻ\beta =\text{Nc}ʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*119·34. $\begin{align}&\vdash :\gamma -_{c}\nu \in \text{N}_{0}\text{C}.\supset .(\gamma -_{c}\nu )+_{c}\nu =\text{ sm }ʻʻ\gamma\\ &[*119·11·33.*103·2.*100·51.*118·01]\end{align}$

*119·35. $\vdash :\gamma -_{c}\nu \in \text{N}_{0}\text{C}.\supset .\alpha +_{c}\gamma =(\alpha +_{c}\nu )+_{c}(\gamma -_{c}\nu )$

Dem. $\begin{array}{l} \vdash .*110·51·56.\supset \vdash :\text{Hp}.\supset .(\alpha +_{c}\nu )+_{c}(\gamma -_{c}\nu )&=\alpha +_{c}\{(\gamma -_{c}\nu )+_{c}\nu\}\\ [*119·34] &=\alpha +_{c}\text{ sm }ʻʻ\gamma \\ [*118·24.*119·11] &=\alpha +_{c}\gamma :\supset \vdash .\text{Prop} \end{array}$

*119·41. $\begin{align}\vdash \colon\ldotp \delta \in \text{Nc}ʻ\beta& -_{c}\text{Nc}ʻ\gamma .\supset :\\ &\xi \in (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c}\text{Nc}ʻ\gamma .\equiv .{(\alpha +\delta )+\gamma }\text{ sm }(\xi +\gamma )\end{align}$

Dem. $\begin{array}{l} \vdash .*119·12.*110·3. &\supset \vdash :\xi \in (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c}\text{Nc}ʻ\gamma .\equiv .(\alpha +\beta )\text{ sm }(\xi +\gamma ) &\qquad \text{(1)}\\ \vdash .*119·12. &\supset \vdash :\text{Hp}.\equiv .\beta \text{ sm }(\delta +\gamma ) &\qquad \text{(2)}\\ \vdash .(1).(2).*110·15·53.\supset \vdash . \text{Prop} \end{array}$

*119·42. $\begin{align}\vdash \colon\ldotp \text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma &\in \text{N}_{0}\text{C}.\eta \in \text{Nc}ʻ\alpha +_{c}(\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma ).\supset :\\ &\xi \in (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c}\text{Nc}ʻ\gamma .\equiv .(\eta +\gamma )\text{ sm }(\xi +\gamma )\end{align}$

Dem. $\begin{array}{l} \vdash .*118·01.*110·3.*103·2.*100·31.&\supset \vdash \colon\ldotp \text{N}_{0}\text{c}ʻ\delta =\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma .\supset:\\ &\eta \in \text{Nc}ʻ\alpha +_{c}(\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma ).\equiv .\eta \text{ sm }(a+\delta ) &\qquad \text{(1)}\\ \vdash .*119·41.(1).*103·12.*110·15.&\supset \vdash .\text{Prop} \end{array}$

Note that if $\gamma$ be an infinite class, it does not follow from $(\eta +\gamma)\text{ sm }(\xi +\gamma)$ that $\eta \text{ sm }\xi$ . This will be proved, however, when $\gamma$ is an inductive class (cf. *120·41).

*119·43. $\begin{align}\vdash :\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma &\in \text{N}_{0}\text{C}.\supset .\\ &\text{Nc}ʻ\alpha +_{c}(\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma )\subset (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c}\text{Nc}ʻ\gamma \end{align}$

Dem. $\begin{array}{l} \vdash .*119·42.\supset \vdash \colon\ldotp \text{Hp}.&\eta \in \text{Nc}ʻ\alpha +_{c}(\text{Nc}ʻ\beta -_{c}\text{Nc}ʻ\gamma ).\supset :\\ &\eta \in (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c}\text{Nc}ʻ\gamma .\equiv .(\eta +\gamma )\text{ sm }(\eta +\gamma ):\\ [*73·3] \supset :&\eta \in (\text{Nc}ʻ\alpha +_{c}\text{Nc}ʻ\beta )-_{c} \text{Nc}ʻ\gamma &\qquad \text{(1)}\\ \vdash .(1).*22·1.\supset \vdash .\text{Prop} \end{array}$

*119·44. $\vdash :\mu +_{c}(\nu -_{c}\varpi )\subset (\mu +_{c}\nu )-_{c}\varpi$

Dem. $\begin{array}{l} \vdash .*119·11·43.*103·2.&\supset \\ \vdash : \nu -_{c} \varpi \in \text{N}_{0}\text{C}.\mu \in \text{N}_{0}\text{C}.&\supset .\mu +_{c}(\nu -_{c}\varpi )\subset (\mu +_{c}\nu )-_{c}\varpi &\qquad \text{(1)}\\ \vdash . *110·4·42.*119·11.&\supset \\ \vdash :{\sim}\{\nu -_{c}\varpi \in \text{N}_{0}\text{C}.\mu \in \text{N}_{0}\text{C}\}.&\supset .\mu +_{c}(\nu -_{c}\varpi )=\Lambda .\\ [*24·12] &\supset .\mu +_{c}(\nu -_{c}\varpi )\subset (\mu +_{c}\nu )-_{c}\varpi &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*119·45. $\begin{align}&\vdash :(\mu +_{c} \nu )-_{c}\varpi \in \text{NC}.\exists !\{\mu +_{c}(\nu -_{c}\varpi )\}.\supset .\mu +_{c}(\nu -_{c}\varpi )=(\mu +_{c}\nu )-_{c}\varpi \\ &[*119·44.*100·33·321.*110·42]\end{align}$

*119·51. $\vdash :\text{ sm }_{\delta ,\gamma }ʻʻ(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\gamma }=(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\delta }\cap \text{D}ʻ\text{ sm }_{\delta ,\gamma }$

Dem. $\begin{array}{l} \vdash .*119·12. \supset \vdash :\eta \in (\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\gamma }.\zeta \text{ sm }_{\delta ,\gamma }\eta .&\equiv .\alpha \text{ sm }\eta +\beta .\zeta \text{ sm }_{\delta ,\gamma }\eta .\\ [*110·15] &\equiv .\alpha \text{ sm }\zeta +\beta .\zeta \text{ sm }_{\delta ,\gamma }\eta .\\ [*119·12] &\equiv .\zeta \in (\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\delta }.\zeta \text{ sm }_{\delta ,\gamma }\eta :\\ [*37·1.*33·13]\supset \vdash .\text{ sm }_{\delta ,\gamma }ʻʻ(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\gamma }&=(\text{Nc}ʻ\alpha -_{c}\text{Nc}ʻ\beta )_{\delta }\cap \text{D}ʻ\text{ sm }_{\delta ,\gamma }:\supset \vdash .\text{Prop} \end{array}$

*119·52. $\vdash :\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma }=(\mu -_{c}\nu )_{\delta }\cap \text{D}ʻ\text{ sm }_{\delta ,\gamma } \quad[*119·51·11]$

The difficulty in respect to types, which arises from the fact that $\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma }$ and $(\mu-_{c}\nu )_{\delta }$ have not been proved to be identical, does not exist when $\nu$ is an "inductive number"; cf. *120·413.

*119·53. $\vdash \colon\ldotp tʻ\delta =\text{D}ʻ\text{ sm }_{\delta ,\gamma }.\supset :\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma }=(\mu -_{c}\nu )_{\delta } \quad[*119·52.(*65·01)]$

*119·531. $\vdash :tʻ\delta =\text{D}ʻ\text{ sm }_{\delta ,\gamma }.(\mu -_{c}\nu )_{\delta }\in \text{N}_{0}\text{C}.\supset .\text{ sm }_{\gamma ,\delta }ʻʻ(\mu -_{c}\nu )_{\delta }\in \text{N}_{0}\text{C}$

Dem. $\begin{array}{l} \vdash .*65·13. \supset \vdash :\text{Hp}.&\supset .(\mu -_{c}\nu )_{\delta }\subset \text{D}ʻ\text{ sm }_{\delta ,\gamma }.\\ [*37·43.*103·22.(*65·1)]&\supset .\exists !\text{ sm }_{\gamma ,\delta }ʻʻ(\mu -_{c}\nu )_{\delta }.\\ [*100·52.*103·34] &\supset .\text{ sm }_{\gamma ,\delta }ʻʻ(\mu -_{c}\nu )_{\delta }\in \text{N}_{0}\text{C}:\supset \vdash .\text{Prop} \end{array}$

*119·532. $\begin{align}\vdash : tʻ\delta = \text{D}ʻ\text{ sm }_{\delta ,\gamma }.(\mu -_{c}\nu )_{\delta } \in \text{N}_{0}\text{C}.&(\mu -_{c}\nu )_{\gamma } \in \text{NC}.\supset .\\ &\text{ sm }_{\gamma ,\delta }ʻʻ(\mu -_{c}\nu )_{\delta } = (\mu -_{c}\nu )_{\gamma }\end{align}$

Dem. $\begin{array}{l} \vdash . *119·52·531 .\supset \vdash : \text{Hp} . &\supset . \exists ! (\mu -_{c}\nu )_{\gamma }.\\ [*119·52·531·*100·34 &\supset . \text{ sm }_{\gamma ,\delta }ʻʻ(\mu -_{c}\nu )_{\delta } = (\mu -_{c}\nu )_{\gamma } : \supset \vdash . \text{Prop} \end{array}$

*119·54. $\text{SM} (\delta ,\gamma ). = : tʻ\delta = \text{D}ʻ\text{ sm }_{\delta ,\gamma } . \lor . tʻ\gamma = \text{D}ʻ\text{ sm }_{\gamma ,\delta } \quad\text{Df}$

*119·541. $\begin{align}\vdash : SM(\delta ,\gamma ).(\mu -_{c}\nu )_{\gamma } \in &\text{N}_{0}\text{C} . (\mu -_{c}\nu )_{\delta } \in \text{NC}.\supset .\\ &\text{ sm }_{\delta ,\gamma }ʻʻ(\mu -_{c}\nu )_{\gamma } = (\mu -_{c}\nu )_{\delta } \quad[*119·53·532]\end{align}$

*119·61. $\vdash : \mu \in \text{N}_{0}\text{C} . \exists ! \text{ sm }_{\xi }ʻʻ\mu . \supset . \mu -_{c}\nu = \text{ sm }_{\xi }ʻʻ\mu -_{c}\nu$

Dem. $\begin{array}{l} \vdash . *119·1 .\supset \vdash \colon\ldotp \text{Hp}.\supset : \eta \in \mu -_{c}\nu .&\equiv .\text{Nc}ʻ\eta +_{c}\nu = \mu . \exists ! \mu .\\ [*103·16.*118·201.*37·29] &\equiv .(\text{Nc}ʻ\eta +_{c}\nu )_{\xi } = \text{ sm }_{\xi }ʻʻ\mu .\\ [*119·1] &\equiv . \eta \in \text{ sm }_{\xi }ʻʻ\mu -_{c}\nu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*119·62. $\vdash : \nu \in \text{N}_{0}\text{C} . \exists ! \text{ sm }_{\xi }ʻʻ\nu . \supset .\mu -_{c}\nu = \mu -_{c} \text{ sm }_{\xi }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash . *119·1 .\supset \vdash \colon\ldotp \text{Hp}.\supset : \eta \in \mu -_{c}\nu .&\equiv .\text{Nc}ʻ\eta +_{c}\nu = \mu . \exists ! \mu .\\ [*110·25] &\equiv .\text{Nc}ʻ\eta +_{c} \text{ sm }_{\xi }ʻʻ\nu = \mu .\exists !\mu .\\ [*119·1] &\equiv . \eta \in \mu -_{c}\text{ sm }_{\xi }ʻʻ\nu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*119·63. $\vdash : \mu , \nu \in \text{N}_{0}\text{C} . \exists ! \text{ sm }_{\xi }ʻʻ\mu .\supset .\mu -_{c}\nu = \text{ sm }_{\xi }ʻʻ\mu -_{c} \text{ sm }_{\xi }ʻʻ\nu$

Dem. $\begin{array}{l} \vdash . *119·26 . &\supset \vdash : \text{Hp} . \exists !\mu -_{c}\nu . \supset . \mu \geq \nu .\\ [*118·13] & \supset . \exists !\text{ sm }_{\xi }ʻʻ\nu .\\ [*119·61·62] &\supset . \mu -_{c}\nu = \text{ sm }_{\xi }ʻʻ\mu -_{c}\text{ sm }_{\xi }ʻʻ\nu &\qquad \text{(1)}\\ \vdash . *119·11.*103·13. \supset \\ \vdash : \text{Hp}.\exists ! \text{ sm }_{\xi }ʻʻ\mu -_{c}\text{ sm }_{\xi }ʻʻ\nu . &\supset . \exists ! \text{ sm }_{\xi }ʻʻ\nu .\\ [*119·61·62] &\supset . \mu -_{c}\nu = \text{ sm }_{\xi }ʻʻ\mu -_{c} \text{ sm }_{\xi }ʻʻ\nu &\qquad \text{(2)}\\ \vdash . (1).(2).\supset \vdash .\text{Prop} \end{array}$

*119·64. $\vdash \colon\ldotp \exists ! \text{ sm }_{\xi }ʻʻ\mu .\supset :\mu \geq \nu .\equiv . \exists !(\mu -_{c}\nu )_{\xi }$

Dem. $\begin{array}{l} \vdash . *117·24. \supset \vdash \colon\ldotp \text{Hp}.\supset :\mu \geq \nu .&\supset .\mu ,\nu \in \text{N}_{0}\text{C} . \exists ! \text{ sm }_{\xi }ʻʻ\mu .\\ [*119·61] & \supset .(\mu -_{c}\nu )_{\xi } = (\text{ sm }_{\xi }ʻʻ\mu -_{c}\nu )_{\xi } &\qquad \text{(1)}\\ \vdash . *117·24·244 .\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu \geq \nu .&\supset .\text{ sm }_{\xi }ʻʻ\mu \geq \nu .\\ [*119·27] &\supset . \exists ! (\text{ sm }_{\xi }ʻʻ\mu -_{c}\nu )_{\xi }.\\ [(1)] &\supset . \exists !(\mu -_{c}\nu )_{\xi } &\qquad \text{(2)}\\ \vdash .(2).*119·26.\supset \vdash .\text{Prop} \end{array}$

Inductive Cardinals are those that obey mathematical induction starting from 0, i.e. in the language of Part II, Section E, they are the posterity of 0 with respect to the relation of $\nu$ to $\nu+_{c}1$ , or, in more popular language, they are those that can be reached from 0 by successive additions of 1. In former days, these were supposed to be all the cardinals, and mathematical induction was treated as a kind of self-evident axiom. We now know that only certain cardinals obey mathematical induction starting from 0. It is these cardinals which are to be considered in this number. They embrace 0, 1, 2, ... and generally all those cardinals which would be commonly called finite, all those which can be expressed in the usual Arabic system of numeration, and no others. The propositions to be proved concerning them in this number are elementary and familiar; the interest lies entirely in the definition and method of proof, not in the propositions themselves.

Since $(+_{c}1)_{*}$ has necessarily its domain and converse domain of the same type, it is important to be careful in noting the relations of type. Accordingly we also put $\text{N}_{\xi }\text{C induct} = \hat{\alpha} \{\alpha (+_{c}1)_{*}0_{\xi }\} \quad\text{Df}.$

*120·11. $\vdash \colon\ldotp \alpha \in \text{N}_{\eta }\text{C induct}:\phi \xi .\supset _{\xi }.\phi (\xi +_{c}1):\phi 0_{\eta }:\supset .\phi \alpha$

*120·121. $\vdash :\alpha \in \text{N}_{\xi }\text{C induct}.\supset .(\alpha +_{c}1)_{\xi }\in \text{N}_{\xi }\text{C induct}$

*120·13. $\vdash \colon\ldotp \alpha \in \text{N}_{\eta }\text{C induct}:\xi \in \text{N}_{\eta }\text{C induct}.\phi \xi .\supset _{\xi }.\phi (\xi +_{c}1):\phi 0_{\eta }:\supset .\phi \alpha$

*120·15. $\vdash :\alpha \in \text{NC induct}.\exists !\alpha .\supset .\text{ sm }ʻʻ\alpha \in \text{NC induct}$

*120·151. $\vdash :\alpha \in \text{NC induct}.\exists !\alpha .\supset .a+_{c}1\in \text{NC induct}$

*120·152. $\vdash :\alpha \in \text{NC}.\text{ sm }ʻʻ\alpha \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha \in \text{NC induct}-\iota ʻ\Lambda$

We then proceed to deduce the elementary properties of inductive classes, putting $\text{Cls induct} = sʻ\text{NC induct}.$

*120·21. $\vdash :\rho \in \text{Cls induct}.\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}$

*120·211. $\vdash :\text{Nc}ʻ\rho \in \text{NC induct}-\iota ʻ\Lambda .\supset .\rho \in \text{Cls induct}$

(We do not have an equivalence here, because, for aught we know, it might be possible to determine the ambiguity of $\text{Nc}ʻ\rho$ so that $\text{Nc}ʻ\rho = \Lambda$ , even when $\rho \in \text{Cls induct}$ . his will not be possible, however, if the axiom of infinity is assumed.)

*120·214. $\vdash \colon\ldotp \rho \text{ sm }\sigma .\supset :\rho \in \text{Cls induct}.\equiv .\sigma \in \text{Cls induct}$

We have a set of propositions applying induction to classes directly, and not through the intermediary of cardinals. Thus we have

*120·251. $\vdash :\eta \in \text{Cls induct}.\supset .\eta \cup \iota ʻy\in \text{Cls induct}$

*120·26. $\vdash \colon\ldotp \rho \in \text{Cls induct}:\phi\eta .\supset _{\eta ,x}.\phi(\eta \cup \iota ʻx):\phi\Lambda :\supset .\phi\rho$

We then state the axiom of infinity, and prove (*120·33) that it is equivalent to the assumption that if $\alpha$ is an inductive cardinal, $\alpha \neq \alpha +_{c}1$ . To prove this, we first prove various propositions about $\alpha +_{c}1$ , among others the following:

*120·311. $\vdash :\exists !\alpha +_{c}1.a+_{c}1=\beta +_{c}1.\supset .\alpha =\text{ sm }ʻʻ\beta .\exists !\alpha$

*120·322. $\vdash \colon\ldotp \alpha \in \text{NC induct}.\supset :\exists !\alpha .\equiv .\alpha \neq \alpha +_{c}1$

We then proceed to consider subtraction (*120·41—·418), which only gives a cardinal number when the subtrahend is an inductive cardinal. We have

*120·41. $\vdash \colon\ldotp \nu \in \text{NC induct}.\exists !\alpha +_{c}\nu .\supset :\alpha +_{c}\nu =\beta +_{c}\nu .\supset .\alpha =\text{ sm }ʻʻ\beta$

We might validly put $\alpha = \beta$ instead of $\alpha =\text{ sm }ʻʻ\beta$ , since $\alpha = \beta$ will be true whenever it is significant.

*120·411. $\begin{align}\vdash \colon\ldotp \nu \in &\text{NC induct}.\supset :\\ &\exists !\gamma -_{c}\nu .\supset .\gamma -_{c}\nu \in \text{N}_{0}\text{C}:\gamma \geq \nu .\equiv .(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma \in \text{N}_{0}\text{C}\end{align}$

*120·4111. $\vdash \colon\ldotp \nu \in \text{NC induct}.\exists !\text{ sm }_{\xi }ʻʻ\gamma .\supset :\gamma \geq \nu .\equiv .(\gamma -_{c}\nu )_{\xi }\in \text{N}_{0}\text{C}$

Hence we arrive at the conditions requisite for the usual point of view of subtraction; namely,

*120·412. $\vdash :\nu \in \text{NC induct}.\gamma \geq \nu .\exists !\text{ sm }_{\xi }ʻʻ\gamma .\supset .(\gamma -_{c}\nu )_\xi =\{(\iota \alpha )(\alpha +_{c}\nu =\gamma )\}_{\xi }$

*120·414. $\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0.\exists !\text{ sm }_{\xi }ʻʻ\mu .\supset .(\mu -_{c}1)_{\xi }\in \text{N}_{0}\text{C}$

*120·416. $\vdash :\nu \in \text{NC induct}.\exists !\gamma -_{c}\nu .\supset .(\gamma -_{c}\nu )+_{c}\nu =\text{ sm }ʻʻ\gamma$

We prove next that no proper part of an inductive class is similar to the whole (*120·426), i.e. that inductive classes are non-reflexive, and various connected propositions, e.g.

*120·423. $\vdash :\alpha \in \text{N}_{\eta }\text{C induct} -\iota ʻ0.\equiv .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}.\alpha =(\beta +_{c}1)_{\eta }$

*120·4232. $\vdash :\alpha \in \text{N}_{\eta }\text{C induct} -\iota ʻ0.\equiv .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct} -\iota ʻ\Lambda .\alpha =(\beta +_{c}1)_{\eta }$

*120·428. $\vdash :\nu \in \text{NC induct}.\exists !\alpha +_{c}\nu .\alpha \neq 0.\supset .\alpha +_{c}\nu >\nu$

*120·429. $\vdash \colon\ldotp \nu \in \text{NC induct}.\supset :\mu >\nu .\equiv .\mu \geq \nu +_{c}1$

The last two of the above propositions do not hold in general when $\nu$ is a cardinal which is not inductive.

We prove next that if $\alpha$ is an existent inductive cardinal, then any existent cardinal is greater than, equal to, or less than $\alpha$ (*120·441); that if $\alpha$ , $\beta$ are inductive cardinals, so is $\alpha +_{c}\beta$ (*120·45 ·4501), and if $\alpha+_{c}\beta$ is an inductive cardinal other than $\Lambda$ , so are $\alpha$ and $\beta$ (*120·452). We then have some propositions dealing with mathematical induction starting from 1 or 2, e.g.

*120·4622. $\begin{align}\vdash \colon\ldotp \alpha \in \text{NC}.\beta \in &\text{NC}(\eta ).\exists !\text{ sm }_{\xi }ʻʻ\beta .\supset :\\ &\beta (+_{c} 1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\equiv .\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha\end{align}$

*120·47. $\vdash \colon\colon \beta \in \text{N}_{\eta }\text{C induct} -\iota ʻ0.\equiv \colon\ldotp \xi \in \mu .\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \mu :1_{\eta }\in \mu :\supset _{\mu }.\beta \in \mu$

*120·48. $\vdash :\beta \in \text{NC induct}.\beta \geq \alpha .\supset .\alpha \in \text{NC induct}-\iota ʻ\Lambda$

*120·481. $\vdash :\eta \in \text{Cls induct}.\xi \subset \eta .\supset .\xi \in \text{Cls induct}$

*120·491. $\vdash \colon\ldotp \xi {\sim}\in \text{Cls induct}.\equiv :\beta \in \text{NC induct}.\supset _{\beta }.\exists !\beta \cap \text{Cl}ʻ\xi$

We then prove that if $\alpha$ , $\beta$ are inductive cardinals, $\alpha \times _{c}\beta$ and $\alpha ^\beta$ are either inductive cardinals or $\Lambda$ (*120·5 *120·52), while conversely if $\alpha\times _{c} \beta$ or $\alpha ^\beta$ is an existent inductive cardinal, $\alpha$ and $\beta$ are so also, with exceptions for 0 and 1 (*120·512 ·56 ·561). Hence we infer the uniqueness of division and the taking of roots (*120·51 ·53 ·55) so long as inductive numbers are concerned.

We have next a set of propositions on the axiom of infinity and the multiplicative axiom. We prove (*120·61) that if there is any existent cardinal which is not inductive, the axiom of infinity is true. From *83·9·904, we infer by induction that if $\kappa$ is an inductive class of which $\Lambda$ is not a number, ${\in}_{\Delta}ʻ\kappa$ exists (*120·62), whence it follows that either the multiplicative axiom or the axiom of infinity must be true (*120·64).

*120·71. $\vdash :\rho ,\sigma \in \text{Cls induct}.\equiv .\rho \cup \sigma \in \text{Cls induct}.\equiv .\rho +\sigma \in \text{Cls induct}$

*120·74. $\vdash :\rho \in \text{Cls induct}.\equiv .\text{Cl}ʻ\rho \in \text{Cls induct}$

*120·75. $\vdash :sʻ\kappa \in \text{Cls induct}.\equiv .\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}$

with analogous propositions (involving however a hypothesis as to [Pg 210] $\kappa$ ) on the subject of ${\in}_{\Delta}ʻ\kappa$ .

The propositions of the present number are essential to the ordinary arithmetic of finite numbers. In the present work, however, they are not much used after the present section until we reach Part V, Section E, where we deal with the ordinal theory of finite and infinite.

*120·01. $\text{NC induct} = \hat{\alpha}\{\alpha (+_{c}1)_{*}0\} \quad\text{Df}$

Note that in virtue of our general conventions for descriptive functions of two arguments (*38), $+_{c}1=\hat{\alpha} \hat{\beta} (a=\beta +_{c}1).$ That is, $+_{c}1$ is the relation of a cardinal to its immediate predecessor. It is the number written in the usual mathematical notation as +1 in the series of positive and negative integers, just as its converse is the number -1. (It should be observed that if $\nu$ is any cardinal, + $\nu$ is not identical with $\nu$ , since + $\nu$ is a relation, while $\nu$ is a class of classes.)

*120·011. $\text{N}_{\xi }\text{C induct} =\hat{\alpha} \{\alpha (+_{c}1)_{*}0_{\xi }\} \quad\text{Df}$

All members of $\text{N}_{\xi }\text{C induct}$ belong to the same type as $0_{\xi }$ , so that, if $\alpha$ is any member of $\text{N}_{\xi }\text{C induct}$ , " $\xi \in \alpha$ " is significant.

*120·021. $\text{Cls}_{\xi }\text{induct} = sʻ\text{N}_{\xi }\text{C induct} \quad\text{Df}$

In virtue of these definitions an inductive class is one whose cardinal is an inductive cardinal.

*120·03. $\text{Infin ax}.=:\alpha \in \text{NC induct}.\supset _{a}.\exists !\alpha \quad\text{Df}$

" $\text{Infin ax}$ ," like " $\text{Mult ax}$ ," is an arithmetical hypothesis which some will consider self-evident, but which we prefer to keep as a hypothesis, and to adduce in that form whenever it is relevant. Like " $\text{Mult ax}$ ," it states an existence-theorem. In the above form, it states that, if $\alpha$ is any inductive cardinal, there is at least one class (of the type in question) which has $\alpha$ terms. An equivalent assumption would be that, if $\rho$ is any inductive class, there are objects which are not members of $\rho$ . For in that case, if $x$ be such an object, $\text{Nc}ʻ(\rho \cup \iota ʻx)=\text{Nc}ʻ\rho +_{c}1$ . Hence by induction, every inductive cardinal must exist. Another equivalent assumption would be that $\text{V}$ (the class of all objects of the type in question) is not an inductive class. The assumption that $\aleph _{0}$ exists in the type in question is, as we shall see, a stronger assumption than the above, unless we assume the multiplicative axiom.

If the axiom of infinity is true, the inductive cardinals are all different one from another, i.e. $\alpha +_{c}\beta$ , where $\alpha$ and $\beta$ are inductive cardinals, is not equal to $\alpha$ unless $\beta = 0$ . But if the axiom of infinity is false, then, in any assigned type, all the cardinals after a certain one are $\Lambda$ . (Except in the lowest type, the last existent cardinal must be a power of 2.) That is, if (say) 8 were the largest existent cardinal in the type in question, we should[Pg 211] have, in that type, $9 = \Lambda$ , and the same would hold of 10, 11, .... This possibility has to be taken account of in what follows.

*120·04. $\text{Infin ax}(x).=:\alpha \in \text{NC induct}.\supset _{a}.\exists !\alpha (x) \quad\text{Df}$

Then " $\text{Infin ax} (x)$ " states that, if $\alpha$ is any inductive cardinal, there are at least $\alpha$ objects of the same type as $x$ .

*120·1. $\vdash :\alpha \in \text{NC induct}.\equiv .\alpha (+_{c}1)_{*}0 \quad[(*120·01)]$

*120·101. $\begin{align}&\vdash \colon\colon \alpha \in \text{NC induct}. \equiv \colon\ldotp \xi \in \mu .\supset _{\xi }.\xi +_{c}1\in \mu :0\in \mu :\supset _{\mu }.\alpha \in \mu \\ &[*120·1.*90·131.*38·12]\end{align}$

The right-hand side of the above equivalence gives the usual formula for mathematical induction. Observe that the conditions of significance require that $\xi +_{c}1$ should be taken in the same type as $\xi$ . This fact is specially relevant in the proof of *120·15.

The symbol " $\text{NC induct}$ " is of ambiguous type not necessarily the same in different occurrences; also, according to the convention explained in the prefatory statement as holding for $\text{NC}$ and $\text{NC induct}$ , " $\alpha ,\beta \in \text{NC induct}$ " will not imply that $\alpha$ and $\beta$ are of the same type. Accordingly to avoid error in connection with *120·1 ·101 typical definiteness is required as in the three following propositions.

*120·102. $\vdash :\alpha \in \text{N}_{\eta }\text{C induct}. \equiv .\alpha (+_{c} 1)_{*}0_{\eta } \quad[(*120·011)]$

*120·103. $\begin{align}&\vdash \colon\colon \alpha \in \text{N}_{\eta }\text{C induct}. \equiv \colon\ldotp \xi \in \mu .\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \mu :0_{\eta }\in \mu :\supset _{\mu }.\alpha \in \mu \\ &[*120·101]\end{align}$

*120·11. $\begin{align}&\vdash \colon\ldotp \alpha \in \text{N}_{\eta }\text{C induct}:\phi\xi .\supset _{\xi }.\phi (\xi +_{c}1):\phi 0_{\eta }:\supset .\phi \alpha \\ &[*120·102.*90·112]\end{align}$

*120·12. $\vdash .0\in \text{NC induct} \quad\left[*120·101 \frac{0}{\alpha}\right]$

*120·121. $\vdash :\alpha \in \text{N}_{\xi }\text{C induct}.\supset .(\alpha +_{c}1)_{\xi }\in \text{N}_{\xi }\text{C induct} \quad[*90·172.*120·102]$

By means of this proposition and *120·12, any assigned cardinal in the series of natural numbers can be shown to be an inductive cardinal; thus e.g. to show that 27 is an inductive cardinal, we shall only have to use *120·121 twenty-seven times in succession.

*120·123. $\vdash .2\in \text{NC induct}. \text{etc}. \quad[*120·122·121.*110·643]$

Dem. $\begin{array}{l} \vdash .*110·4. \text{Transp}.&\supset \vdash :\alpha {\sim}\in \text{NC}.\supset .\alpha +_{c}1=\Lambda .\\ [*101·12] &\supset .\alpha +_{c}1\neq 0 &\qquad \text{(1)}\\ \vdash .*110·632. &\supset \vdash \colon\ldotp \alpha \in \text{NC}.\supset :\xi \in \alpha +_{c}1.\supset .\exists !\xi :\\ [*24·63] &\supset :\Lambda {\sim}\in \alpha +_{c}1:\\ [*54·102] &\supset :\alpha +_{c}1\neq 0 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*120·13. $\vdash \colon\ldotp \alpha \in \text{N}_{\eta }\text{C induct}:\xi \in \text{N}_{\eta }\text{C induct}.\phi \xi .\supset _{\xi }.\phi (\xi +_{c}1):\phi 0_{\eta }:\supset .\phi \alpha$

Dem. $\begin{array}{l} \vdash .*120·121. &\supset \vdash \colon\ldotp \xi \in \text{N}_{\eta }\text{C induct}.\phi \xi .\supset _{\xi }.\phi (\xi +_{c}1):\supset :\\ &\xi \in \text{N}_{\eta }\text{C induct}.\phi \xi .\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct}.\phi (\xi +_{c}1) &\qquad \text{(1)}\\ \vdash .*120·12. &\supset \vdash :\phi 0_{\eta }.\supset .0_{\eta }\in \text{N}_{\eta }\text{C induct}.\phi 0_{\eta } &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ \xi \in \text{N}_{\eta }\text{C induct}.\phi \xi .&\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct}.\phi (\xi +_{c}1):0_{\eta }\in \text{N}_{\eta }\text{C induct}.\phi 0_{\eta }:\\ \left[*120·11 \frac{\xi \in \text{N}_{\eta }\text{C induct}.\phi \xi}{\phi \xi }\right]&\supset :\alpha \in \text{N}_{\eta }\text{C induct}.\phi \alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash . *110·42. \text{Simp}.\supset \vdash :\alpha \in \text{NC}.\supset .\alpha +_{c}1\in \text{NC} &\qquad \text{(1)}\\ \vdash .(1).*101·11. *120·11 \frac{\alpha \in \text{NC}}{\phi \alpha} .\supset \vdash .\text{Prop} \end{array}$

This proposition does not show that every inductive cardinal is an existent cardinal; to obtain this, we require the axiom of infinity.

*120·15. $\vdash :\alpha \in \text{NC induct}.\exists !\alpha .\supset .\text{ sm }ʻʻ\alpha \in \text{NC induct}$

i.e. a cardinal which is not null and is inductive in any one type is also inductive in any other type.

Dem. $\begin{array}{l} \vdash .*101·15.*120·12.&\supset \vdash .\text{ sm }_{\eta }ʻʻ0_{\xi }\in \text{N}_{\eta }\text{C induct} &\qquad \text{(1)}\\ \vdash .*110·4. &\supset \vdash .\alpha =\Lambda _{\xi }.\supset .(\alpha +_{c}1)_{\xi } = \Lambda _{\xi } &\qquad \text{(2)}\\ \vdash .*118·201. &\supset \vdash :\exists !(\alpha +_{c}1)_{\xi }.\supset .\text{ sm }_{\eta }ʻʻ(\alpha +_{c}1)_{\xi }=(\alpha +_{c}1)_{\eta }\\ [*118·241.*110·4] &= (\text{ sm }_{\eta }ʻʻ\alpha +_{c} 1)_{\eta } &\qquad \text{(3)}\\ \vdash .*120·121. &\supset \vdash :\exists !(\alpha +_{c}1)_{\xi }.\text{ sm }_{\eta }ʻʻ\alpha \in \text{N}_{\eta }\text{C induct}.\supset .(\text{ sm }_{\eta }ʻʻ\alpha +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct}.\\ [(3)] &\supset .\text{ sm }_{\eta }ʻʻ(\alpha +_{c}1)_{\xi }\in 1\,\text{N}_{C}\text{induct} &\qquad \text{(4)}\\ \vdash .(4).*2·2. & \supset \vdash \colon\ldotp \text{ sm }_{\eta }ʻʻ\alpha \in \text{N}_{\eta }\text{C induct}.\supset :\\\\ &(\alpha +_{c}1)_{\xi }=\Lambda _{\xi }.\lor.\text{ sm }_{\eta }ʻʻ(\alpha +_{c}1)_{\xi }\in \text{N}_{\eta }\text{C induct} &\qquad \text{(5)}\\ \vdash .(2).(5).*3·48.&\supset \vdash \colon\ldotp \alpha =\Lambda _{\xi }.\lor.\text{ sm }_{\eta }ʻʻ\alpha \in \text{N}_{\eta }\text{C induct}:\supset :\\ &(\alpha +_{c}1)_{\xi }=\Lambda _{\xi }.\lor.\text{ sm }_{\eta }ʻʻ(\alpha +_{c}1)_{\xi }\in \text{N}_{\eta }\text{C induct} &\qquad \text{(6)}\\ \vdash .(1).(6).*120·11.*4·6.\supset \vdash .\text{Prop} \end{array}$

*120·151. $\vdash :\alpha \in \text{NC induct}.\exists !\alpha .\supset .\alpha +_{c}1\in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*120·15. \supset \vdash :\alpha \in \text{N}_{\xi }\text{C induct}.\exists !\alpha .&\supset .\text{ sm }_\eta ʻʻ\alpha \in \text{N}_{\eta }\text{C induct}.\\ [*120·121] &\supset .(\text{ sm }_{\eta }ʻʻ\alpha +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct}.\\ [*118·241.*120·14] & \supset .(\alpha +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct}:\supset \vdash .\text{Prop} \end{array}$

*120·152. $\vdash :\alpha \in \text{NC}.\text{ sm }ʻʻ\alpha \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha \in \text{NC induct}-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*100·521. \supset \vdash :\text{Hp}.&\supset .\text{ sm }ʻʻ\text{ sm }ʻʻ\alpha =\alpha .\\ [*120·15] &\supset .\alpha \in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*37·29. &\supset \vdash :\text{Hp}.\supset .\exists !\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The following propositions, giving alternative forms for the definition of inductive classes, are inserted in order to show that the theory of inductive classes might be treated in a less arithmetical manner than we have adopted.

*120·2. $\vdash :\rho \in \text{Cls induct}.\equiv .(\exists \alpha ).\alpha \in \text{NC induct}.\rho \in \alpha \quad[(*120·02)]$

*120·201. $\vdash \colon\ldotp \rho \text{ sm }\sigma .\supset :\text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}.\equiv .\text{N}_{0}\text{c}ʻ\sigma \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*100·35.*103·13.*100·511.\supset \\ \vdash :\text{Hp}.\supset .\text{N}_{0}\text{c}ʻ\rho =\text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\sigma .\text{N}_{0}\text{c}ʻ\sigma =\text{ sm }ʻʻ\text{N}_{0}\text{c}ʻ\rho :\\ [*120·152.*103·13] \supset \vdash .\text{Prop} \end{array}$

*120·21. $\vdash :\rho \in \text{Cls induct}.\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*120·14·2. \supset \vdash :\rho \in \text{Cls induct}.&\equiv .(\exists \alpha ).\alpha \in \text{NC induct}.\alpha \in \text{NC}.\rho \in \alpha .\\ [*103·27] &\equiv .(\exists \alpha ).\alpha \in \text{NC induct}. \text{N}_{0}\text{c}ʻ\rho =\alpha .\\ [*13·195] &\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}:\supset \vdash .\text{Prop} \end{array}$

Note that " $\rho \in \text{Cls induct}.\equiv .\text{Nc}ʻ\rho \in\text{NC induct}$ " is not proved above. The proof encounters the difficulty that we may have $\text{Nc}ʻ\rho = \Lambda$ ; in order to establish our proposition in this case, we have to show that if $\Lambda \in \text{NC induct}$ , then every class is an inductive class. We can however prove the following implication.

*120·211. $\vdash :\text{Nc}ʻ\rho \in \text{NC induct} - \iota ʻ\Lambda .\supset .\rho \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*100·511.&\supset \vdash :\text{Hp}.\supset.\text{ sm }ʻʻ\text{Nc}ʻp=\text{N}_{0}\text{c}ʻ\rho .\\ [*120·15] &\supset . \text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}.\\ [*120·21] &\supset .\rho \in \text{Cls induct}:\supset \vdash .\text{Prop} \end{array}$

*120·213. $\vdash .\iota ʻ\alpha \in \text{Cls induct} \quad [*120·211·122]$

*120·214. $\vdash \colon\ldotp \rho \text{ sm }\sigma .\supset :\rho \in \text{Cls induct}.\equiv .\sigma \in \text{Cls induct} \quad[*120·201·21]$

*120·22. $\vdash \colon\colon \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\Lambda \in \mu :\supset _{\mu }.\rho \in \mu \colon\ldotp \supset .\rho \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·212. &\supset \vdash .\Lambda \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*51·2. &\supset \vdash \colon\ldotp y\in \eta .\supset :\eta \cup \iota ʻy=\eta :\\ [*13·12] &\supset :\eta \in \text{Cls induct}.\supset .\eta \cup \iota ʻy\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .*110·63. &\supset \vdash \colon\ldotp y{\sim}\in \eta .\supset :\text{Nc}ʻ(\eta \cup \iota ʻy)=\text{Nc}ʻ\eta +_{c}\\ [(*110·03)] &= \text{N}_{0}\text{c}ʻ\eta +_{c}1:\\ [*120·121] & \supset :\text{N}_{0}\text{c}ʻ\eta \in \text{NC induct}.\supset .\text{N}_{0}\text{c}ʻ(\eta \cup \iota ʻy)\in \text{NC induct}:\\ [*120·21·211] & \supset :\eta \in \text{Cls induct}.\supset .\eta \cup \iota ʻy\in \text{Cls induct} &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\eta \in \text{Cls induct}. \supset . \eta \cup \iota ʻy\in \text{Cls induct} &\qquad \text{(4)}\\ \vdash .*10·1.(1).(4).\supset \vdash .\text{Prop} \end{array}$

*120·221. $\vdash \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\text{Nc}ʻ\rho \subset \mu :\supset .\text{Nc}ʻ\rho +_{c}1\subset \mu$

Dem. $\begin{array}{l} \vdash .*110·63.*100·31.\supset \\ \vdash :\zeta \in \text{Nc}ʻ\rho +_{c}1.&\equiv .(\exists \eta ,y).\eta \in \text{Nc}ʻ\rho .y{\sim}\in \eta .\zeta =\eta \cup \iota ʻy &\qquad \text{(1)}\\ \vdash .*22·1. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\eta \in \text{Nc}ʻ\rho .\supset .\eta \in \mu .\\ [*10·1] & \supset .\eta \cup \iota ʻy\in \mu :\\ [*3·41] & \supset :\eta \in \text{Nc}ʻ\rho .y{\sim}\in \eta .\supset .\eta \cup \iota ʻy\in \mu :\\ [*13·12] &\supset :\eta \in \text{Nc}ʻ\rho .y{\sim}\in \eta .\zeta =\eta \cup \iota ʻy.\supset .\zeta \in \mu &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\zeta \in \text{Nc}ʻ\rho +_{c}1.\supset .\zeta \in \mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·222. $\vdash \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\xi \in \text{NC}.\xi \subset \mu :\supset .\xi +_{c}1\subset \mu$

Dem. $\begin{array}{l} \vdash .*100·4.\supset \vdash :\text{Hp}.\exists !\xi .&\supset .(\exists \alpha ).\xi =\text{Nc}(\zeta )ʻ\alpha .\text{Nc}(\zeta )ʻ\alpha \subset \mu .\\ [*120·221] &\supset .(\exists \alpha ).\xi =\text{Nc}(\zeta )ʻ\alpha .\text{Nc}ʻ\alpha +_{c}1\subset \mu .\\ [*118·01] &\supset .\xi +_{c}1\subset \mu &\qquad \text{(1)}\\ \vdash .*110·4.&\supset \vdash :{\sim}\exists !\xi .\supset .\xi +_{c}1\subset \mu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The proof of this proposition might also proceed by the use of uniform formal numbers, employing *118·241.

*120·23. $\vdash \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\Lambda \in \mu :\supset .\text{Cls induct}\subset \mu$

Dem. $\begin{array}{l} \vdash .*51·2.*54·1. &\supset \vdash :\text{Hp}.\supset .0\subset \mu &\qquad \text{(1)}\\ \vdash .*120·222·14. & \supset \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \text{NC induct}.\xi \subset \mu .\supset _{\xi }.\xi +_{c}1\subset \mu &\qquad \text{(2)}\\ \vdash .(1).(2).*120·13. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \text{NC induct}.\supset .\xi \subset \mu :\\ [*40·151.(*120·02)] &\supset :\text{Cls induct}\subset \mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·24. $\vdash \colon\colon \rho \in \text{Cls induct}.\equiv \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu :\Lambda \in \mu :\supset _{\mu }.\rho \in \mu$

Dem. $\begin{array}{l} \vdash .*120·23.\supset \vdash \colon\colon \rho \in \text{Cls induct}.\supset \colon\ldotp \eta \in \mu .\supset _{\eta ,y}.\mu \cup \iota ʻy\in \mu :\Lambda \in \mu :\supset .\rho \in \mu &\qquad \text{(1)}\\ \vdash .(1).*120·22.\supset \vdash .\text{Prop} \end{array}$

This proposition might be used to define inductive classes. It gives a form of mathematical induction applicable to classes instead of to numbers. Virtually it states that an inductive class is one which can be formed by adding members one at a time, starting from $\Lambda$ . This is made more explicit in *120·25. Instead of $\eta\in \mu .\supset _{\eta ,y}.\mu \cup \iota ʻy\in \mu$ , in the above propositions, as well as in those that follow, we may plainly substitute $\eta \in \mu .y{\sim}\in \eta .\supset _{\eta ,y}.\eta \cup \iota ʻy\in \mu .$

*120·25. $\begin{align}&\vdash :M=\hat{\eta} \hat{\zeta}\{(\exists y).\zeta =\eta \cup \iota ʻy\}.\supset .\text{Cls induct}=\overleftarrow{M}_{*}ʻ\Lambda\\ &[*120·24.*90·131]\end{align}$

*120·251. $\vdash :\eta \in \text{Cls induct}.\supset .\eta \cup \iota ʻy\in \text{Cls induct} \quad[*90·172.*120·25]$

*120*26. $\begin{align}&\vdash \colon\ldotp \rho \in \text{Cls induct}:\phi\eta .\supset _{\eta ,x}.\phi(\eta \cup \iota ʻx):\phi\Lambda :\supset \phi\rho \\ &[*120·25.*90·112]\end{align}$

*120·261. $\begin{align}&\vdash \colon\ldotp \rho \in \text{Cls induct}:\eta \in \text{Cls induct}.\phi\eta .\supset _{\eta ,x}.\phi(\eta \cup \iota ʻx):\phi\Lambda :\supset .\phi\rho \\ &[*120·26·251·212]\end{align}$

*120·27. $\vdash :\rho \in \text{Cls induct}.\supset .\text{Nc}ʻ\rho \cap tʻ\gamma \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*120·12. &\supset \vdash .\text{Nc}ʻ\Lambda \cap tʻ\gamma \in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*13·12. &\supset \vdash :\text{Nc}ʻ\eta \cap tʻ\gamma \in \text{NC induct}.y\in \eta .\supset .\\ &\text{Nc}ʻ(\eta \cup \iota ʻy)\cap tʻ\gamma \in \text{NC induct} &\qquad \text{(2)}\\ \vdash .*110·63.*120·121.\supset\\ &\vdash :\text{Nc}ʻ\eta \cap tʻ\gamma \in \text{NC induct}.y{\sim}\in \eta .\supset .\text{Nc}ʻ(\eta \cup \iota ʻy)\cap tʻ\gamma \in \text{NC induct} &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*120·26.\supset \vdash .\text{Prop} \end{array}$

*120·3. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha \quad[(*120·03)]$

*120·301. $\vdash \colon\ldotp \text{Infin ax}(x).\equiv :\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha (x) \quad[(*120·04)]$

*120·31. $\vdash :\exists !\text{Nc}ʻ\alpha +_{c}1.\text{Nc}ʻ\alpha +_{c}1=\text{Nc}ʻ\beta +_{c}1.\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\beta .\alpha \text{ sm }\beta$

Dem. $\begin{array}{l} \vdash .*110·63. &\supset \vdash \colon\ldotp \text{Nc}ʻ\alpha +_{c}1=\text{Nc}ʻ\beta +_{c}1.\equiv :\\ &(\exists \gamma ,y).\gamma \text{ sm }\alpha .y{\sim}\in \gamma .\xi =\gamma \cup \iota ʻy.\equiv _{\xi }.(\exists \delta ,z).\delta \text{ sm }\beta .z{\sim}\in \delta .\xi =\delta \cup \iota ʻz:\\ [*10·1] &\supset :\gamma \text{ sm }\alpha .y{\sim}\in \gamma .\supset .(\exists \delta ,z).\delta \text{ sm }\beta .z{\sim}\in \delta .\gamma \cup \iota ʻy=\delta \cup \iota ʻz.\\ [*73·72·3] &\supset .(\exists \delta ).\delta \text{ sm }\beta .\gamma \text{ sm }\delta .\\ [*73·32] &\supset .\gamma \text{ sm }\beta .\\ [*73·32] &\supset .\alpha \text{ sm }\beta &\qquad \text{(1)}\\ \vdash .*110·63. &\supset \vdash :\text{Hp}.\supset .(\exists \gamma ,y).\gamma \text{ sm }\alpha .y{\sim}\in \gamma &\qquad \text{(2)}\\ \vdash .(1).(2).*100·321.\supset \vdash .\text{Prop} \end{array}$

*120·311. $\begin{align}&\vdash :\exists !\alpha +_{c}1.\alpha +_{c}1=\beta +_{c}1.\supset .\alpha =\text{ sm }ʻʻ\beta .\exists !\alpha\\ &[*120·31.*110·4.*103·16·4·2]\end{align}$

*120·32. $\vdash :\alpha \in \text{NC induct}.\exists !\alpha .\supset .\alpha \neq \alpha +_{c}1$

Dem. $\begin{array}{l} \vdash .*101·22.*110·641.&\supset \vdash .0_{\xi }\neq 0_{\xi }+_{c}1 &\qquad \text{(1)}\\ \vdash .*120·311.*110·44.&\supset \vdash :\alpha \in \text{NC}.\exists !\alpha +_{c}1.\alpha +_{c}1=\alpha +_{c}1+_{c}1.\supset .\alpha =\alpha +_{c}1:\\ [\text{Transp}] &\supset \vdash :\alpha \in \text{NC}.\exists !\alpha +_{c}1.\alpha \neq \alpha +_{c}1.\supset .\alpha +_{c}1\neq \alpha +_{c}1+_{c}1:\\ [*118·2·25] &\supset \vdash :\alpha \in \text{NC}(\xi ).\exists !(\alpha +_{c}1)_{\xi }.\alpha \neq (\alpha +_{c}1)_{\xi }.\supset .(\alpha +_{c}1)_{\xi }\neq \{(\alpha +_{c}1)_{\xi }+_{c}1\}_{\xi} &\qquad \text{(2)}\\ \vdash .(2).&\supset \vdash \colon\ldotp \alpha \in \text{NC}(\xi ).\alpha \neq (\alpha +_{c}1)_{\xi }.\supset :(\alpha +_{c}1)_{\xi }=\Lambda .\lor.(\alpha +_{c}1)_{\xi }\neq \{(\alpha +_{c}1)_{\xi }+_{c}1\}_{\xi} &\qquad \text{(3)}\\ \vdash .*110·4. \text{Transp}.&\supset \vdash \colon\ldotp \alpha {\sim}\in \text{NC}(\xi ).\lor.\alpha =\Lambda _{\xi }:\supset .(\alpha +_{c}1)_{\xi }=\Lambda _{\xi } &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash \colon\ldotp \alpha =\Lambda _{\xi }.\lor.\alpha \neq (\alpha +_{c}1)_{\xi }:\supset :\\ &(\alpha +_{c}1)_{\xi }=\Lambda _{\xi }.\lor.(\alpha+_{c}1)_{\xi }\neq {(\alpha +_{c}1)_{\xi }+_{c}1}_{\xi } &\qquad \text{(5)}\\ \vdash .(1).(5).*120·11.&\supset \vdash \colon\ldotp \alpha \in \text{N}_{\xi }\text{C induct}.\supset :\alpha =\Lambda _{\xi }.\lor.\alpha \neq (\alpha +_{c}1)_{\xi }\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*110·4. \text{Transp}.&\supset \vdash :\alpha =\Lambda .\supset .\alpha +_{c}1=\Lambda &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}. &\supset \vdash .\text{Prop} \end{array}$

*120·322. $\vdash \colon\ldotp \alpha \in \text{NC induct}.\supset :\exists !\alpha .\equiv .\alpha \neq \alpha +_{c}1 \quad[*120·32·321]$

*120·33. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\alpha \in \text{NC induct}.\supset _{\alpha }.\alpha \neq \alpha +_{c}1 \quad[*120·3·322]$

*120·41. $\vdash \colon\ldotp \nu \in \text{NC induct}.\exists !\alpha +_{c}\nu .\supset :\alpha +_{c}\nu =\beta +_{c}\nu .\supset .\alpha =\text{ sm }ʻʻ\beta$

Dem. $\begin{array}{l} \vdash .*110·4. \text{Transp}.*118·25.&\supset \vdash :(\alpha +_{c}\nu )_{\xi }=\Lambda .\supset .\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi }=\Lambda &\qquad \text{(1)}\\ \vdash .*118·25 .&\supset \vdash \colon\colon \exists !{\alpha +_{c}(\nu +_{c}1)_{\xi }}_{\xi }.\supset \colon\ldotp \exists !\{(\alpha +_{c}\nu )_{\xi }+_{c}1\}_{\xi}\colon\ldotp \\ [*120·311.*110·4.*118·201] &\supset \colon\ldotp \{(\alpha +_{c}\nu )_{\xi }+_{c}1\}_{\xi}=\{(\beta +_{c}\nu )_{\xi }+_{c}1\}_{\xi }.\supset .(\alpha +_{c}\nu )_{\xi}=(\beta +_{c}\nu )_{\xi }\colon\ldotp \\ [\text{Syll}.*118·25] &\supset \colon\ldotp (\alpha +_{c}\nu )_{\xi }=(\beta +_{c}\nu )_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta :\supset :\\ &\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi}=\{\beta +_{c}(\nu +_{c}1)_{\xi }\}_{\xi}.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(2)}\\ \vdash .(2).\text{Comm}.&\supset \vdash \colon\colon (\alpha +_{c}\nu )_{\xi }=(\beta +_{c}\nu )_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta :\supset \colon\ldotp \\ &\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi} = \Lambda :\lor:\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi}=\{\beta +_{c}(\nu +_{c}1)_{\xi }\}_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash \colon\colon (\alpha +_{c}\nu )_{\xi }=\Lambda :\lor:(\alpha +_{c}\nu )_{\xi }=(\beta +_{c}\nu )_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta \colon\ldotp \supset \colon\ldotp \\ &\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi}=\Lambda :\lor:\{\alpha +_{c}(\nu +_{c}1)_{\xi }\}_{\xi }=\{\beta +_{c}(\nu +_{c}1)_{\xi }\}_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(4)}\\ \vdash .*110·4.*118·21.&\supset \vdash \colon\ldotp \exists !(\beta +_{c}0)_{\xi }.\supset :\beta \in \text{NC}.\exists !\text{ sm }_{\xi }ʻʻ\beta :\\ [*102·87.*100·51] &\supset :\text{ sm }_{\xi }ʻʻ\alpha =\text{ sm }_{\xi }ʻʻ\beta .\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(5)}\\ \vdash .*110·6·4.&\supset \vdash :\exists !(\alpha +_{c}0)_{\xi }.(\alpha +_{c}0)_{\xi }=(\beta +_{c}0)_{\xi }.\supset .\text{ sm }_{\xi }ʻʻ\alpha =\text{ sm }_{\xi }ʻʻ\beta .\\ [(5)] &\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(6)}\\ \vdash .(6).\text{Exp}.*4·6.&\supset \vdash \colon\ldotp (\alpha +_{c}0)_{\xi }=\Lambda :\lor:(\alpha +_{c}0)_{\xi }=(\beta +_{c}0)_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(7)}\\ \vdash .(4).(7).*120·11.\supset \\ \vdash \colon\colon \nu \in \text{N}_{\xi }\text{C induct}.&\supset \colon\ldotp (\alpha +_{c}\nu )_{\xi }=\Lambda :\lor:(\alpha +_{c}\nu )_{\xi }=(\beta +_{c}\nu )_{\xi }.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(8)}\\) \vdash .*110·4. &\supset \vdash :\nu =\Lambda_\eta.\supset .(\alpha +_c{\nu} )_\xi=\Lambda &\qquad \text{(9)}\\ \vdash .*120·15.&\supset \vdash \colon\colon \nu \in \text{N}_\eta \text{C induct}-\iota ʻ\Lambda .\supset \colon\ldotp \text{ sm }_\xiʻʻ\nu =\text{N}_\xi\text{C induct}\colon\ldotp \\ [(8)] &\supset \colon\ldotp (\alpha +_c\text{ sm }_\xiʻʻ\nu )_\xi=\Lambda :\lor:(\alpha +_c\text{ sm }_\xiʻʻ\nu )_\xi=(\beta +_c\text{ sm }_\xiʻʻ\nu )_\xi.\supset .\alpha =\text{ sm }ʻʻ\beta \colon\ldotp \\ [*118·24] &\supset \colon\ldotp (\alpha +_c\nu )_\xi=\Lambda :\lor:(\alpha +_c\nu )_\xi=(\beta +_c\nu )_\xi.\supset .\alpha =\text{ sm }ʻʻ\beta &\qquad \text{(10)}\\ \vdash .(9).(10).\supset \vdash .\text{Prop} \end{array}$

The above proposition establishes (with the natural limitations) the uniqueness (within each type) of subtraction (conceived as in *120·412) when the subtrahend is an inductive cardinal. (When the subtrahend is a non-inductive cardinal, subtraction ceases to give a unique result.) Hence we are led to the following extensions of *118 for the case of inductive cardinals:

Dem. $\begin{array}{l} \vdash .*119·1. \supset \vdash \colon\ldotp &\nu \in \text{NC induct}.\supset :\\ &\xi ,\eta \in \gamma -_{c}\nu .\supset .\text{Nc}ʻ\xi +_{c}\nu =\gamma .\text{Nc}ʻ\eta +_{c}\nu =\gamma .\exists !\text{Nc}ʻ\xi +_{c}\nu .\\ [*20·22] &\supset .\text{Nc}ʻ\xi +_{c}\nu =\text{Nc}ʻ\eta +_{c}\nu .\exists !\text{Nc}ʻ\xi +_{c}\nu .\\ [*120·41.*100·511.(*110·03)] &\supset .\text{Nc}ʻ\xi =\text{Nc}ʻ\eta &\qquad \text{(1)}\\ \vdash .(1).*119·14. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\exists !\gamma -_{c}\nu .\supset .\gamma -_{c}\nu \in \text{N}_{0}\text{C} &\qquad \text{(2)}\\ \vdash .*119·27.(2). &\supset \vdash \colon\ldotp \text{Hp}.\supset :\gamma \geq \nu .\supset .(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma \in \text{N}_{0}\text{C} &\qquad \text{(3)}\\ \vdash .*103·22.*119·27. &\supset \vdash \colon\ldotp \text{Hp}.\supset :(\gamma -_{c}\nu )\cap t_{0}ʻ\gamma \in \text{N}_{0}\text{C}.\supset .\gamma \geq \nu &\qquad \text{(4)}\\ \vdash .(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*120·4111. $\vdash \colon\ldotp \nu \in \text{NC induct}.\exists !\text{ sm }_{\xi }ʻʻ\gamma .\supset :\gamma \geq \nu .\equiv .(\gamma -_{c}\nu )_{\xi }\in \text{N}_{0}\text{C}$

Dem. $\begin{array}{l} \vdash .*119·64. \supset \vdash \colon\ldotp \text{Hp}.\supset :\gamma \geq \nu .&\supset .\exists !(\gamma -_{c}\nu )_{\xi }.\\ [*120·411] &\supset .(\gamma -_{c}\nu )_{\xi }\in \text{N}_{0}\text{C} &\qquad \text{(1)}\\ \vdash .(1).*119·26.*103·13.\supset \vdash .\text{Prop} \end{array}$

*120·412. $\vdash :\nu \in \text{NC induct}.\gamma \geq \nu .\exists !\text{ sm }_{\xi }ʻʻ\gamma .\supset .(\gamma -_{c}\nu )_{\xi }=\{({℩}\alpha )(\alpha +_{c}\nu =\gamma )\}_{\xi }$

Dem. $\begin{array}{l} \vdash .*120·4111.\supset \vdash \colon\ldotp \text{Hp}.&\supset .(\gamma -_{c}\nu )_{\xi }\in \text{N}_{0}\text{C}.\\ [*119·34] &\supset .(\gamma -_{c}\nu )_{\xi }+_{c}\nu = \gamma &\qquad \text{(1)}\\ \vdash .*120·41.*103·43.*37·29.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha +_{c}\nu =\gamma .\beta +_{c}\nu =\gamma .\supset _{\alpha ,\beta }.\alpha =\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*120·413. $\vdash :\mu \in \text{N}_{0}\text{C}.\supset .\mu -_{c}0=\text{ sm }ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*119·1 .\supset \vdash \colon\ldotp \text{Hp}.\supset :\xi \in \mu -_{c}0.&\equiv .\text{N}_{0}\text{c}ʻ\xi +_{c}0=\mu .\exists !\mu .\\ [*110·61.*103·13] &\equiv .\text{Nc}ʻ\xi =\mu .\\ [*103·44·4] &\equiv .\text{N}_{0}\text{c}ʻ\xi =\text{ sm }ʻʻ\mu .\\ [*103·26] &\equiv .\xi \in \text{ sm }ʻʻ\mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·414. $\begin{align}&\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0.\exists !\text{ sm }_{\xi }ʻʻ\mu .\supset .(\mu -_{c}1)_{\xi }\in \text{N}_{0}\text{C}\\ &[*120·4111.*117·53]\end{align}$

*120·415. $\begin{align}&\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0-\iota ʻ1.\exists !\text{ sm }_{\xi }ʻʻ\mu .\supset .(\mu -_{c}2)_{\xi }\in \text{N}_{0}\text{C}\\ &[*120·4111.*117·551]\end{align}$

*120·416. $\begin{align}&\vdash :\nu \in \text{NC induct}.\exists !\gamma -_{c}\nu .\supset .(\gamma -_{c}\nu )+_{c}\nu =\text{ sm }ʻʻ\gamma \\ &[*120·411.*119·34]\end{align}$

*120·417. $\begin{align}&\vdash :\mu \in \text{N}_{0}\text{C}-\iota ʻ0 .\exists !\text{ sm }_{\xi }ʻʻ\gamma .\supset .\alpha +_{c}\gamma =(\alpha +_{c}1)+_{c}(\gamma -_{c}1)_{\xi }\\ &[*120·414.*119·35]\end{align}$

*120·418. $\begin{align}&\vdash :\nu \in \text{NC induct}.\exists !\text{ sm }_{\xi }ʻʻ\gamma .\gamma \geq \nu .\supset .\alpha +_{c}\gamma =(\alpha +_{c}\nu )+_{c}(\gamma -_{c}\nu )_{\xi }\\ &[*120·4111.*119·35]\end{align}$

*120·42. $\vdash :\nu \in \text{NC induct}.\exists !\nu .\alpha \neq 0.\supset .\nu \neq \alpha +_{c}\nu$

Dem. $\begin{array}{l} \vdash .*110·61.*120·14.\supset \vdash :\nu\in \text{NC induct}.\supset .\nu =0+_{c}\nu &\qquad \text{(1)}\\ \vdash .*120·41.\supset \vdash :\nu \in \text{NC induct}.\exists !0+_{c}\nu .0+_{c}\nu =\alpha +_{c}\nu .\supset .0=\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\nu \in \text{NC induct}.\exists !\nu .\nu =\alpha +_{c}\nu .\supset .\alpha =0:\supset \vdash .\text{Prop} \end{array}$

*120·422. $\vdash :\alpha +_{c}1\in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha \in \text{NC induct}-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*120·1·124.*91·542.&\supset \vdash :\alpha +_{c}1\in \text{NC induct}.\supset .(\alpha +_{c}1)(+_{c}1)_{\text{po}}0.\\ [*91·52] &\supset .(\exists \beta ).(\alpha +_{c}1)(+_{c}1)\beta .\beta (+_{c}1)_{*}0.\\ [*120·1] &\supset .(\exists \beta ).\alpha +_{c}1=\beta +_{c}1.\beta \in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*120·311. & \supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha +_{c}1=\beta +_{c}1.\supset .\alpha =\text{ sm }ʻʻ\beta .\exists !\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*120·15.&\supset \vdash :\text{Hp}.\supset .\alpha \in \text{NC induct} &\qquad \text{(3)}\\ \vdash .(3).*110·4.\supset \vdash .\text{Prop} \end{array}$

*120·423. $\vdash :\alpha \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\equiv .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}.\alpha =(\beta +_{c}1)_{\eta }$

Dem. $\begin{array}{l} \vdash .*120·121·124. &\supset \vdash :\beta \in \text{N}_{\eta }\text{C induct}.\alpha =(\beta +_{c}1)_{\eta }.\supset .\alpha \in \text{N}_{\eta }\text{C induct}-\iota ʻ0 &\qquad \text{(1)}\\ \vdash .*120·102.*91·542.&\supset \vdash :\alpha \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\supset .\alpha (+_{c}1)_{\text{po}}0_{\eta }.\\ [*91·52] &\supset .(\exists \beta ).\alpha (+_{c}1)\beta .\beta (+_{c}1)_{*}0_{\eta }.\\ [*120·102] &\supset .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}.\alpha =(\beta +_{c}1)_{\eta } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash . \text{Prop} \end{array}$

*120·4231. $\vdash :\alpha \in \text{N}_{\eta }\text{C induct}.\supset .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\alpha +_{c}1)_{\eta }=(\beta +_{c} 1)_{\eta }$

Dem. $\begin{array}{l} &\vdash .*10·24.*101·12.*120·12.\supset \\ &\vdash .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(0+_{c}1)_{\eta }=(\beta +_{c} 1)_{\eta } &\qquad \text{(1)}\\ \vdash .*120·121.&\supset \vdash \colon\ldotp \exists !\xi .\supset :\\ &\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\xi =(\beta +_{c}1)_{\eta }.\supset .\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\xi +_{c}1)_{\eta }=(\xi +_{c}1)_{\eta }:\\ [*10·23·24] &\supset :(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\xi =(\beta +_{c}1)_{\eta }.\supset .\\ &(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\xi +_{c}1)_{\eta }=(\gamma +_{c}1)_{\eta } &\qquad \text{(2)}\\ \vdash .*110·4.*13·17.\supset \\ \vdash \colon\ldotp {\sim}\exists !\xi .&\supset :\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\xi =(\beta +_{c}1)_{\eta }.\supset .(\xi +_{c}1)_{\eta }=(\beta +_{c}1)_{\eta }:\\ [*10·28] &\supset :(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\xi =(\beta +_{c}1)_{\eta }.\supset .\\ &(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\xi +_{c}1)_{\eta }=(\beta +_{c}1)_{\eta } &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash :(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\xi =(\beta +_{c}1)_{\eta }.\supset .\\ &(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\xi +_{c}1)_{\eta }=(\beta +_{c}1)_{\eta } &\qquad \text{(4)}\\ \vdash .(1).(4) \frac{(\xi +_{c}1)_{\eta }}{\xi}.*120·11.\supset \\ &\vdash :\alpha \in \text{N}_{\eta }\text{C induct}.\supset .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .(\alpha +_{c}1)_{\eta }=(\beta +_{c}1)_{\eta }:\\ \supset \vdash .\text{Prop} \end{array}$

*120·4232. $\begin{align}&\vdash :\alpha \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\equiv .(\exists \beta ).\beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\alpha =(\beta +_{c}1)_{\eta }\\ &[*120·423·4231]\end{align}$

*120·424. $\vdash :\beta \neq 0.\exists !(\alpha +_{c}\beta )_{\xi }.\supset .(\alpha +_{c}\beta )_{\xi }-_{c}1=\alpha +_{c}(\beta -_{c}1)_{\xi }$

Dem. $\begin{array}{l} \vdash .*110·42·62.\supset \vdash :\text{Hp}.\supset .(\alpha +_{c}\beta )_{\xi }\in \text{NC}-\iota ʻ\Lambda -\iota ʻ0.\\ [*120·414.*103·13] \supset .\exists !(\alpha +_{c}\beta )_{\xi }-_{c}1 &\qquad \text{(1)}\\ \vdash .*110·4.*118·21.*120·414.*103·13.\supset \vdash :\text{Hp}.\supset .\exists !(\beta -_{c}1)_{\xi } &\qquad \text{(2)}\\ \vdash .(1).(2).*120·416.\supset \\ \vdash :\text{Hp}. \supset .\{(\alpha +_{c}\beta )_{\xi }-_{c}1\}+_{c}1=\alpha +_{c}\beta .(\beta -_{c}1)_{\xi }+_{c}1=\beta . &\qquad \text{(3)}\\ [*110·56]\supset .\{(\alpha +_{c}\beta )_{\xi }-_{c}1\}+_{c}1=\{\alpha +_{c}(\beta -_{c}1)_{\xi }\}+_{c}1 &\qquad \text{(4)}\\ \vdash .(3).\supset \vdash :\text{Hp}.\supset .\exists ![\{(\alpha +_{c}\beta )_{\xi\}-_{c}1}+_{c}1]_{\xi } &\qquad \text{(5)}\\ \vdash .(4).(5).*120·311.*110·44.\supset \\ \vdash :\text{Hp}.\supset .(\alpha +_{c}\beta )_{\xi }-_{c}1=\alpha +_{c}(\beta -_{c}1)_{\xi }:\supset \vdash .\text{Prop} \end{array}$

*120·425. $\begin{align}\vdash \colon\ldotp &(\alpha +_{c}\beta )_{\xi }\in \text{N}_{0}\text{C}-\iota ʻ0.\supset :\\ &(\alpha +_{c}\beta )_{\xi }-_{c}1=\alpha +_{c}(\beta -_{c}1)_{\xi }.\lor.(\alpha +_{c}\beta )_{\xi }-_{c}1=(\alpha -_{c}1)_{\xi }+_{c}\beta \end{align}$

Dem. $\begin{array}{l} \vdash .*110·62.*103·22.\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \neq 0.\lor.\beta \neq 0:\exists !(\alpha +_{c}\beta )_{\xi } &\qquad \text{(1)}\\ \vdash .(1).*120·424.\supset \vdash .\text{Prop} \end{array}$

*120·426. $\vdash :\rho \in \text{Cls induct}.\rho \subset \sigma .\exists !\sigma -\rho .\supset .{\sim}(\rho \text{ sm }\sigma ).\text{Nc}ʻ\rho <\text{Nc}ʻ\sigma$

Dem. $\begin{array}{l} \vdash .*110·32.&\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻ\sigma =\text{Nc}ʻ\rho +_{c}\text{Nc}ʻ(\sigma -\rho ) &\qquad \text{(1)}\\ \vdash .*101·14.&\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻ(\sigma -\rho )\neq 0 &\qquad \text{(2)}\\ \vdash .(1).(2).*120·42.*117·222·26.\supset \vdash .\text{Prop} \end{array}$

*120·427. $\begin{align}&\vdash :R\in 1\rightarrow 1.\text{ᗡ}ʻR\subset \text{D}ʻR.\exists !\text{D}ʻR-\text{ᗡ}ʻR.\supset .\text{D}ʻR{\sim}\in \text{Cls induct}\\ &[*120·426.\text{Transp}]\end{align}$

*120·428. $\vdash :\nu \in \text{NC induct}.\exists !\alpha +_{c}\nu .\alpha \neq 0.\supset .\alpha +_{c}\nu >\nu$

Dem. $\begin{array}{l} \vdash .*117·511.*110·4.\supset \vdash :\text{Hp}.&\supset .\alpha >0.\nu \in \text{N}_{0}\text{C} .\\ [*117·561.*110·6] &\supset .\alpha +_{c}\nu \geq \nu &\qquad \text{(1)}\\ \vdash .*120·42.*110·4. &\supset \vdash :\text{Hp}.\supset .\alpha +_{c}\nu \neq \nu &\qquad \text{(2)}\\ \vdash .(1).(2).*117·26.\supset \vdash .\text{Prop} \end{array}$

*120·429. $\vdash \colon\ldotp \nu \in \text{NC induct}.\supset :\mu >\nu .\equiv .\mu \geq \nu +_{c}1$

Dem. $\begin{array}{l} \vdash .*120·428. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\mu \in \text{N}_{0}\text{C}.\mu =\nu +_{c}1.\supset .\mu >\nu : &\qquad \text{(1)}\\ [*117·47·12] &\supset :\mu >\nu +_{c}1.\supset .\mu >\nu &\qquad \text{(2)}\\ \vdash .*117·31.&\supset \vdash :\mu >\nu .\supset .(\exists \varpi ).\varpi \in \text{N}_{0}\text{C}.\mu =\nu +_{c}\varpi &\qquad \text{(3)}\\ \vdash .*117·26·12.&\supset \vdash :\mu >\nu .\supset .\mu \neq \nu +_{c}0 &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\mu >\nu .\supset .(\exists \varpi ).\varpi \in \text{N}_{0}\text{C}-\iota ʻ0.\mu =\nu +_{c}\varpi .\\ [*117·531] &\supset .(\exists \varpi ).\varpi \geq 1.\mu =\nu +_{c}\varpi .\\ [*117·31] &\supset .(\exists \varpi ,\rho ).\rho \in \text{N}_{0}\text{C}.\varpi =\rho +_{c}1.\mu =\nu +_{c}\varpi .\\ [*13·195] &\supset .(\exists \rho ).\rho \in \text{N}_{0}\text{C}.\mu =\nu +_{c}\rho +_{c}1.\\ [*117·31] &\supset .\mu \geq \nu +_{c}1 &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

The following definition, in which " $\text{spec}$ " stands for " $species$ ," defines the "species" of a cardinal $\beta$ as all cardinals which are less than, equal to, or greater than $\beta$ . We cannot prove, unless by assuming the multiplicative axiom, that all cardinals belong to the species of $\beta$ , except in the case where $\beta$ is an inductive cardinal. In all other cases there may, so far as is known at present, be other cardinals which are neither greater nor less than $\beta$ .

*120·43. $\text{spec}ʻ\beta =\hat{\alpha} \{\alpha <\beta .\lor.\alpha \geq \beta\} \quad\text{Df}$

*120·431. $\vdash \colon\ldotp \alpha \in \text{spec}ʻ\beta .\equiv :\alpha <\beta .\lor.\alpha \geq \beta \quad[(*120·43)]$

*120·432. $\vdash \colon\ldotp \alpha \in \text{spec}ʻ\beta .\equiv :\alpha \leq \beta .\lor.\alpha \geq \beta \quad[*117·281.*120·431]$

*120·433. $\begin{align}&\vdash \colon\ldotp \text{Nc}ʻ\rho \in \text{spec}ʻ\text{Nc}ʻ\sigma .\equiv :\exists !\text{Cl}ʻ\rho \cap \text{Nc}ʻ\sigma .\lor.\exists !\text{Cl}ʻ\sigma \cap \text{Nc}ʻ\rho \\ &[*117·22.*120·432]\end{align}$

*120·434. $\vdash .\text{spec}ʻ\beta \subset \text{N}_{0}\text{C} \quad[*117·105·104·12.*120·432]$

*120·435. $\vdash :\beta \in \text{N}_{0}\text{C}.\equiv .\beta \in \text{spec}ʻ\beta .\equiv .\exists !\text{spec}ʻ\beta \quad[*117·104.*120·434]$

*120·436. $\begin{align}&\vdash \colon\ldotp \alpha \in \text{spec}ʻ\beta .\equiv :\alpha ,\beta \in \text{N}_{0}\text{C}:(\exists \gamma ):\alpha +_{c}\gamma =\beta .\lor.\beta +_{c}\gamma =\alpha \\ &[*120·432 . *117·31]\end{align}$

*120·437. $\vdash :\beta \in \text{N}_{0}\text{C}.\supset .0\in \text{spec}ʻ\beta \quad[*117·5.*120·432]$

*120·438. $\vdash :\alpha \in \text{spec}ʻ\beta .\exists !\alpha +_{c}1.\supset .\alpha +_{c}1\in \text{spec}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*120·436.*110·4.&\supset \vdash \colon\ldotp \text{Hp}.\equiv :\alpha ,\beta \in \text{N}_{0}\text{C}.\exists !\alpha +_{c}1:\\ &(\exists \gamma ):\gamma \in \text{N}_{0}\text{C}:\alpha +_{c}\gamma =\beta .\lor.\beta +_{c}\gamma =\alpha &\qquad \text{(1)}\\ \vdash .*110·61. &\supset \vdash :\alpha ,\beta \in \text{N}_{0}\text{C}.\alpha +_{c}0=\beta .\supset .\alpha =\beta .\\ [*13·12·15] &\supset .\alpha +_{c}1=\beta +_{c}1 .\\ [*120·436] &\supset .\alpha +_{c}1\in \text{spec}ʻ\beta &\qquad \text{(2)}\\ \vdash .*120·417.&\supset \vdash .\alpha ,\beta ,\gamma \in \text{N}_{0}\text{C}.\gamma \neq 0.\alpha +_{c}\gamma =\beta .\supset .\alpha +_{c}1+_{c}(\gamma -_{c}1)=\beta .\\ [*120·436] &\supset .\alpha +_{c}1\in \text{spec}ʻ\beta &\qquad \text{(3)}\\ \vdash .*13·12·15. &\supset \vdash :\alpha ,\beta ,\gamma \in \text{N}_{0}\text{C}.\beta +_{c}\gamma =\alpha .\exists !\alpha +_{c}1.\supset .\beta +_{c}\gamma +_{c}1=\alpha +_{c}1.\\ [*120·436] &\supset .\alpha +_{c}1\in \text{spec}ʻ\beta &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*120·44. $\vdash :\beta \in \text{N}_{0}\text{C}.\supset .\text{NC induct}-\iota ʻ\Lambda \subset \text{spec}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*120·437. &\supset \vdash :\text{Hp}.\supset .0\in \text{spec}ʻ\beta &\qquad \text{(1)}\\ \vdash .*120·438.*110·4.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha =\Lambda .\lor.\alpha \in \text{spec}ʻ\beta :\supset :\\ &\alpha +_{c}1=\Lambda .\lor.\alpha +_{c}1\in \text{spec}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).*120.11.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha \in \text{NC induct}.\supset :\\ &\alpha =\Lambda .\lor.\alpha \in \text{spec}ʻ\beta \colon\colon \supset \vdash .\text{Prop} \end{array}$

*120·441. $\begin{align}&\vdash \colon\ldotp \alpha \in \text{NC induct}-\iota ʻ\Lambda .\beta \in \text{NC}-\iota ʻ\Lambda .\supset :\alpha <\beta .\lor.\alpha =\text{ sm }ʻʻ\beta .\lor.\alpha >\beta \\ &[*120·44.*103·34]\end{align}$

*120·442. $\begin{align}\vdash \colon\ldotp \alpha \in \text{NC induct}&-\iota ʻ\Lambda .\beta \in \text{NC}-\iota ʻ\Lambda .\supset :\\ &\alpha < \beta .\equiv .{\sim}(\alpha \geq \beta ):\alpha >\beta .\equiv .{\sim}(\alpha \leq \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*117·104.*120·441.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha <\beta .\lor.\alpha \geq \beta &\qquad \text{(1)}\\ \vdash .*117·291. &\supset \vdash :\alpha <\beta .\supset .{\sim}(\alpha \geq \beta ) &\qquad \text{(2)}\\ \vdash .(1).(2).*5·17.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha <\beta .\equiv .{\sim}(\alpha \geq \beta ) &\qquad \text{(3)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \text{Hp}.\supset :\alpha >\beta .\equiv .{\sim}(\alpha \leq \beta ) &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*120·45. $\vdash :\alpha ,\beta \in \text{N}_{\xi }\text{C induct}.\supset .(\alpha +_{c}\beta )_{\xi }\in \text{N}_{\xi }\text{C induct}$

Dem. $\begin{array}{l} \vdash .*110·6.\supset \vdash :\alpha \in \text{N}_{\xi }\text{C induct}.\supset .(\alpha +_{c}0_{\xi })_{\xi }\in \text{N}_{\xi }\text{C induct} &\qquad \text{(1)}\\ \vdash .*120·121.*118·25.\supset\\ \vdash :(\alpha +_{c}\beta )_{\xi }\in \text{N}_{\xi }\text{C induct}.\supset .\{\alpha +_{c}(\beta +_{c}1)_{\xi }\}_{\xi }\in \text{N}_{\xi }\text{C induct} &\qquad \text{(2)}\\ \vdash .(1).(2).*120·11.\supset \vdash .\text{Prop} \end{array}$

*120·4501. $\vdash :\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha +_{c}\beta \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*120·15.\supset \vdash :\text{Hp}.&\supset .\text{ sm }_{\xi }ʻʻ\alpha ,\text{ sm }_{\xi }ʻʻ\beta \in \text{N}_{\xi }\text{C induct}.\\ [*120·45] &\supset .(\text{ sm }_{\xi }ʻʻ\alpha +_{c}\text{ sm }_{\xi }ʻʻ\beta )_{\xi }\in \text{N}_{\xi }\text{C induct}.\\ [*118·23] &\supset .(\alpha +_{c}\beta )_{\xi }\in \text{N}_{\xi }\text{C induct}:\supset \vdash .\text{Prop} \end{array}$

*120·451. $\begin{align}&\vdash \colon\ldotp \gamma =(\alpha +_{c}\beta )_{\xi }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda :\\ &\exists !(\gamma +_{c}1)_{\xi }.(\gamma +_{c}1)_{\xi }=(\alpha ʻ+_{c}\beta ʻ)_{\xi }:\supset .\alpha ʻ,\beta ʻ\in \text{NC induct}-\iota ʻ\Lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*120·414·124.*110·42.&\supset \vdash :\exists !(\gamma +_{c}1)_{\xi }.\supset .\{(\gamma +_{c}1)_{\xi }-_{c}1\}_{\xi}\in \text{N}_{0}\text{C}.\\ [*119·32] &\supset .\gamma =\{(\gamma +_{c}1)_{\xi}-_{c}1\}_{\xi } &\qquad \text{(1)}\\ \vdash .(1).*120·124.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\gamma =\{(\alpha'+ \beta')_{\xi}-_{c}1\}_{\xi }.(\alpha'+ \beta')_{\xi }\neq 0.\exists !(\alpha'+ \beta')_{\xi }:\\ [*120·425]&\supset :\gamma =\{\alpha'+_{c}(\beta'-_{c}1)_{\xi }\}_{\xi }.\lor.\gamma =\{(\alpha'-_{c}1)_{\xi }+_{c}\beta'\}_{\xi }:\\ [\text{Hp}] &\supset :\alpha',(\beta'-_{c}1)_{\xi }\in \text{NC induct}-\iota ʻ\Lambda .\lor.(\alpha'-_{c}1)_{\xi },\beta'\in \text{NC induct}-\iota ʻ\Lambda :\\ [*119·11] &\supset :\alpha',\beta'\in \text{NC induct}-\iota ʻ\Lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

This proposition could be extended to greater generality as regards types; but its sole use is as a lemma.

*120·452. $\vdash :\alpha +_{c}\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*110·4.\text{Transp}.&\supset \vdash :\gamma =\Lambda .\supset .(\gamma +_{c}1)_{\eta }=\Lambda &\qquad \text{(1)}\\ \vdash .*120·451.&\supset \vdash \colon\colon \gamma =(\alpha +_{c}\beta )_{\eta }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda :\supset \colon\ldotp \\ &(\gamma +_{c}1)_{\eta }=\Lambda :\lor:(\gamma +_{c}1)_{\eta }=(\alpha ʻ+_{c}\beta ʻ)_{\eta }.\supset _{\alpha ʻ,\beta ʻ}.\alpha ʻ,\beta ʻ\in \text{NC induct}-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\colon \gamma =\Lambda :\lor:\gamma =(\alpha +_{c}\beta )_{\eta }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda \colon\ldotp \supset \colon\ldotp\\ &(\gamma +_{c}1)_{\eta }=\Lambda :\lor:(\gamma +_{c}1)_{\eta }=(\alpha ʻ+_{c}\beta ʻ)_\eta .\supset _{\alpha ʻ,\beta ʻ}.\alpha ʻ,\beta ʻ\in \text{NC induct}-\iota ʻ\Lambda &\qquad \text{(3)}\\ \vdash .*110·62.*120·12.&\supset \vdash :0=(\alpha +_{c}\beta )_{\eta }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda &\qquad \text{(4)}\\ \vdash .(3).(4).*120·11.&\supset \vdash \colon\colon \gamma \in \text{N}_{\eta }\text{C induct}.\supset \colon\ldotp \\ &\gamma =\Lambda :\lor:\gamma =(\alpha +_{c}\beta )_{\eta }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda \colon\colon \\ [*13·15] &\supset \vdash \colon\ldotp (\alpha +_{c}\beta )_{\eta }\in \text{N}_{\eta }\text{C induct}.\supset :\\ &(\alpha +_{c}\beta )_{\eta }=\Lambda .\lor.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

In the last line but one of the above proof, we substitute for the $\phi \xi$ of *120·11 the function $\xi =\Lambda :\lor:\xi =(\alpha +_{c}\beta )_{\eta }.\supset _{\alpha ,\beta }.\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda .$

The following propositions are chiefly required as leading to *120·4621 ·4622 ·47, which are useful in proving propositions concerning all inductive cardinals other than zero.

*120·46. $\vdash :\alpha \in \text{NC}.\gamma \in \text{N}_{\eta }\text{C induct}.\supset .(\alpha +_{c}\gamma )_{\eta }(+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*110·6.*118·241.&\supset \vdash :\alpha \in \text{NC}.\supset .(\alpha +_{c}0)_{\eta }(+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*90·172.*118·25.&\supset \vdash :(\alpha +_{c}\gamma )_{\eta }(+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\supset .\\ &\{\alpha +_{c}(\gamma +_{c}1)_{\eta }\}_{\eta }(+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*120·11.&\supset \vdash .\text{Prop} \end{array}$

*120·461. $\vdash :\alpha \in \text{NC}.\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\supset .(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}.\beta =(\alpha +_{c}\gamma )_{\eta }$

Dem. $\begin{array}{l} \vdash .*110·6.*118·23. &\supset \vdash :\alpha \in \text{NC}.\beta =\text{ sm }_{\eta }ʻʻ\alpha .\supset .\beta =(a+_{c}0)_{\eta } &\qquad \text{(1)}\\ \vdash .*120·121.*118·25.&\supset \vdash :\beta =(\alpha +_{c}\gamma )_{\eta }.\gamma \in \text{N}_{\eta }\text{C induct}.\supset .\\ &(\beta +_{c}1)_{\eta }=\{\alpha +_{c}(\gamma +_{c}1)_{\eta }\}_{\eta }.(\gamma +_{c}1)_{\eta }\in \text{N}_{\eta }\text{C induct} &\qquad \text{(2)}\\ \vdash .(1).(2).*90·112.\supset \vdash .\text{Prop} \end{array}$

*120·462. $\begin{align}&\vdash \colon\ldotp \alpha \in \text{NC}.\supset :(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}.\beta =(\alpha +_{c}\gamma )_{\eta }.\equiv .\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha \\ &[*120·46·461]\end{align}$

*120·4621. $\vdash \colon\ldotp \alpha \in \text{NC}.\exists !\beta .\supset :\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\supset .\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*120·461.\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ \beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .&\supset .(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}.\beta =(\alpha +_{c}\gamma )_{\eta }.\\ [*110·4] &\supset .(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}-\iota ʻ\Lambda .\beta =(\alpha +_{c}\gamma )_{\eta }.\\ [*120·15.*118·201] &\supset .(\exists \gamma ).\text{ sm }_{\xi }ʻʻ\gamma \in \text{N}_{\xi }\text{C induct}.\text{ sm }_{\xi }ʻʻ\beta =(\alpha +_{c}\gamma )_{\xi }.\\ [*118·24.*120·14] &\supset .(\exists \gamma').\gamma'\in \text{N}_{\xi }\text{C induct}.\text{ sm }_{\xi }ʻʻ\beta =(\alpha +_{c}\gamma')_{\xi }.\\ [*120·462]& \supset .\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·4622. $\begin{align}&\vdash \colon\ldotp \alpha \in \text{NC}.\beta \in \text{NC}(\eta ).\exists !\text{ sm }_{\xi }ʻʻ\beta .\supset :\\ &\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\equiv .\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*110·4.*37·29.*120·461.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha .\supset .\exists !\text{ sm }_{\xi }ʻʻ\alpha .\exists !\alpha . &\qquad \text{(1)}\\ [*100·52] &\supset .\text{ sm }_{\xi }ʻʻ\alpha \in \text{NC} &\qquad \text{(2)}\\ \vdash .*120·4621.(2).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha .\supset .\text{ sm }_{\eta }ʻʻ\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\text{ sm }_{\xi }ʻʻ\alpha .\\ [*102·87.\text{Hp}.(1)] &\supset .\text{ sm }_{\eta }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\\ [*103·34] &\supset .\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*37·29.*120·4621.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta (+_{c}1)_{*}\text{ sm }_{\eta }ʻʻ\alpha .\supset .\text{ sm }_{\xi }ʻʻ\beta (+_{c}1)_{*}\text{ sm }_{\xi }ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

It is on this proposition that the irrelevance of types in the consideration of inductive cardinals depends.

*120·463. $\begin{align}\vdash \colon\colon .\alpha \in \text{NC}.\supset \colon\colon &(\exists \gamma ).\gamma \in \text{N}_{\eta }\text{C induct}.\beta =(\alpha +_{c}\gamma )_{\eta }.\equiv \colon\ldotp \\ &\xi \in \mu .\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \mu :\text{ sm }_{\eta }ʻʻ\alpha \in \mu :\supset _{\mu }.\beta \in \mu \\ [*120·462.*90·11]\end{align}$

*120·47. $\begin{align}&\vdash \colon\colon \beta \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\equiv \colon\ldotp \xi \in \mu .\supset _{\xi }.(\xi +_{c}1)_{\eta }\in \mu :1_{\eta }\in \mu :\supset _{\mu }.\beta \in \mu \\ &[*120·423·463]\end{align}$

Thus mathematical induction starting from 1 will apply to all inductive cardinals except 0. Similar propositions can be similarly proved for 2, 3, ....

*120·471. $\vdash :(\exists \alpha ).\alpha \in \text{NC induct}-\iota ʻ0.f\alpha .\equiv .(\exists \beta ).\beta \in \text{NC induct}.f(\beta +_{c}1)$

Dem. $\begin{array}{l} \vdash .*120·423.\supset \\ \vdash :(\exists \alpha ).\alpha \in \text{NC induct}-\iota ʻ0.f\alpha .&\equiv .(\exists \beta ).\beta \in \text{NC induct}.\alpha =\beta +_{c}1.f\alpha .\\ [*13·195] &\equiv .(\exists \beta ).\beta \in \text{NC induct}.f(\beta +_{c}1):\supset \vdash .\text{Prop} \end{array}$

*120·472. $\begin{align}\vdash :&(\exists \alpha ).\alpha \in \text{NC induct}-\iota ʻ0-\iota ʻ1.f\alpha .\equiv .\\ &(\exists \beta ).\beta \in \text{NC induct}-\iota ʻ0.f(\beta +_{c}1).\equiv .(\exists \gamma ).\gamma \in \text{NC induct}.f(\gamma +_{c}2)\end{align}$

Dem. $\begin{array}{l} \vdash .*120·471.\supset \\ \vdash :(\exists \alpha ).\alpha \in &\text{NC induct}-\iota ʻ0-\iota ʻ1.f\alpha .\equiv .\\ &(\exists \beta ).\beta \in \text{NC induct}.\beta +_{c}1\neq 1.f(\beta +_{c}1).\\ [*120·42.*110·641] &\equiv .(\exists \beta ).\beta \in \text{NC induct}-\iota ʻ0.f(\beta +_{c}1). &\qquad \text{(1)}\\ [*120·471] &\equiv .(\exists \gamma ).\gamma \in \text{NC induct}.f(\gamma +_{c}1+_{c}1).\\ [*110·643] &\equiv .(\exists \gamma ).\gamma \in \text{NC induct}.f(\gamma +_{c}2) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*120·473. $\begin{align}\vdash \colon\ldotp \phi 1:\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi \xi .&\supset _{\xi }.\phi (\xi +_{c}1):\supset :\\ &\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\supset .\phi \xi\end{align}$

Dem. $\begin{array}{l} \vdash .*120·122.*101·22.&\supset \vdash :\phi 1.\supset .1\in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi 1 &\qquad \text{(1)}\\ \vdash .*120·121·124.&\supset \vdash :\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\supset .\xi +_{c}1\in \text{N}_{\eta }\text{C induct}-\iota ʻ0 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :1\in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi 1:\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi \xi .\supset _{\xi }.\\ &\xi +_{c}1\in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi (\xi +_{c}1) &\qquad \text{(3)}\\ \vdash .(3).*120·47 \frac{\hat{\xi} (\xi \in \text{N}_{\eta }\text{C induct}-\iota ʻ0.\phi \xi )}{\mu}.&\supset \vdash .\text{Prop} \end{array}$

*120·48. $\begin{align}&\vdash :\beta \in \text{NC induct}.\beta \geq \alpha .\supset .\alpha \in \text{NC induct}-\iota ʻ\Lambda \\ &[*120·452.*117·31]\end{align}$

Thus every cardinal which is not greater than every inductive cardinal is an inductive cardinal.

*120·481. $\vdash :\eta \in \text{Cls induct}.\xi \subset \eta .\supset .\xi \in \text{Cls induct} \quad[*117·222.*120·21·48]$

Thus if any inductive class can be found which contains a given class, the given class is also inductive.

*120·49. $\vdash :\alpha \in \text{NC}-\text{NC induct}-\iota ʻ\Lambda .\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha >\beta$

Dem. $\begin{array}{l} \vdash .*120·48.\text{Transp}.&\supset \vdash :\text{Hp}.\supset .{\sim}(\beta \geq \alpha ) &\qquad \text{(1)}\\ \vdash .*120·441. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha >\beta .\lor.\beta \geq \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

Thus every non-inductive cardinal (except $\Lambda$ ) is greater than every inductive cardinal (except $\Lambda$ ).

*120·491. $\vdash \colon\ldotp \xi {\sim}\in \text{Cls induct}.\equiv :\beta \in \text{NC induct}.\supset _{\beta }.\exists !\beta \cap \text{Cl}ʻ\xi$

Dem. $\begin{array}{l} \vdash .*120·49.&\supset \vdash :\xi {\sim}\in \text{Cls induct}.\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\text{N}_{0}\text{c}ʻ\xi >\beta .\\ [*120·429.*117·12]&\supset .\text{N}_{0}\text{c}ʻ\xi \geq \beta +_{c}1.\exists !\beta \cap \text{Cl}ʻ\xi &\qquad \text{(1)}\\ \vdash .(1).*117·104·12.*103·13.&\supset \vdash :\xi {\sim}\in \text{Cls induct}.\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\beta +_{c}1\neq \Lambda &\qquad \text{(2)}\\ \vdash .(2).*101·12.*102·13.\supset \\ \vdash \colon\ldotp \xi {\sim}\in \text{Cls induct}.&\supset :\beta \in \text{NC induct}.\supset .\beta \neq \Lambda &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash :\xi {\sim}\in \text{Cls induct}.\beta \in \text{NC induct}.\supset .\exists !\beta \cap \text{Cl}ʻ\xi &\qquad \text{(4)}\\ \vdash .*120·121.\supset \\ \vdash \colon\ldotp \beta \in \text{NC induct}.&\supset _{\beta }.\exists !\beta \cap \text{Cl}ʻ\xi :\supset :\beta \in \text{NC induct}.\supset _{\beta }.\exists !(\beta +_{c}1)\cap \text{Cl}ʻ\xi .\\ [*117·242.*120·429] &\supset _{\beta }.\text{Nc}ʻ\xi > \beta .\\ [*117·42.(*117·03)] &\supset _{\beta }.\text{N}_{0}\text{c}ʻ\xi \neq \beta :\\ [*13·196] &\supset :\text{N}_{0}\text{c}ʻ\xi {\sim}\in \text{NC induct}:\\ [*120·21] &\supset :\xi {\sim}\in \text{Cls induct} &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*120·492. $\begin{align}&\vdash :\alpha \in \text{NC}-\text{NC induct}.\beta \geq \alpha .\supset .\beta \in \text{NC}-\text{NC induct}\\ &[*120·48.\text{Transp}]\end{align}$

In virtue of *120·491, a class $\xi$ which is not inductive contains sub-classes having 0, 1, 2, 3, ... terms. If we take the successive classes of sub-classes $0\cap \text{Cl}ʻ\xi , 1\cap \text{Cl}ʻ\xi , 2\cap \text{Cl}ʻ\xi , ...,$ these are mutually exclusive, and all exist provided $\Lambda$ is not an inductive[Pg 225] cardinal, i.e. provided the axiom of infinity holds. Thus if the axiom of infinity holds, we get $\aleph_{0}$ classes of sub-classes contained in any non-inductive class. It follows, as we shall see later, that if $\xi$ is a non-inductive class, $\text{Cl}ʻ\text{Cl}ʻ\xi$ is a reflexive class. This seems to be the nearest approach possible to identifying the two definitions of finite and infinite when the multiplicative axiom is not assumed. When the multiplicative axiom is assumed as well as the axiom of infinity, we pick out one class from $1\cap \text{Cl}ʻ\xi$ , one from $2\cap\text{Cl}ʻ\xi$ , and so on; then, forming the logical sum of all these classes, we get $\aleph _{0}$ terms which are members of $\xi$ . Hence it follows that $\xi$ is a reflexive class; for, as we shall see later, a reflexive class is one which contains sub-classes of $\aleph _{0}$ terms. Thus with the help of the multiplicative axiom, the two definitions of finite and infinite can be identified.

*120·493. $\begin{align}&\vdash \colon\ldotp \sigma \in \text{Cls induct}.\supset :\\ &\text{Nc}ʻ\xi <\text{Nc}ʻ\sigma .\equiv .(\exists \rho ).\rho \text{ sm }\xi .\rho \subset \sigma .\exists !\sigma -\rho .\equiv .\exists !\text{Nc}ʻ\xi \cap \text{Cl}ʻ\sigma -\iota ʻ\sigma\end{align}$

Dem. $\begin{array}{l} \vdash .*117·26·221.&\supset \vdash \colon\ldotp \text{Nc}ʻ\xi <\text{Nc}ʻ\sigma .\supset :{\sim}(\xi \text{ sm }\sigma ):(\exists \rho ).\rho \text{ sm }\xi .\rho \subset \sigma :\\ [*73·3·37] &\supset :(\exists \rho ).\rho \text{ sm }\xi .\rho \subset \sigma .\rho \neq \sigma &\qquad \text{(1)}\\ \vdash .*120·481.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\rho \subset \sigma .\exists !\sigma -\rho .\supset .\rho \in \text{Cls} \text{induct}.\rho \subset \sigma .\exists !\sigma -\rho .\\ [*120·426] &\supset .\text{Nc}ʻ\rho <\text{Nc}ʻ\sigma :\\ [*100*321] &\supset :\rho \text{ sm }\xi .\rho \subset \sigma .\exists !\sigma -\rho .\supset .\text{Nc}ʻ\xi <\text{Nc}ʻ\sigma &\qquad \text{(2)}\\ \vdash .(1).(2).*24·6.\supset \vdash .\text{Prop} \end{array}$

*120·5. $\vdash :\alpha ,\beta \in \text{NC induct}.\exists !\alpha \times _{c}\beta .\supset .\alpha \times _{c}\beta \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*113·203.&\supset \vdash :\alpha \in \text{NC induct}.\exists !\alpha \times _{c}0.\supset .\alpha \in \text{NC}-\iota ʻ\Lambda .\\ [*113·601] &\supset .\alpha \times _{c}0=0.\\ [*120·12] &\supset .\alpha \times _{c}0\in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*113·671. &\supset \vdash .\alpha \times _{c}(\beta +_{c}1)=(\alpha \times _{c}\beta )+_{c}\alpha .\\ [*120·4501.*113·203] &\supset \vdash :\alpha \in \text{NC induct}.\alpha \times _{c}\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\\ &\alpha \times _{c}(\beta +_{c}1)\in \text{NC induct} &\qquad \text{(2)}\\ \vdash .(1).(2).*120·13.\supset \vdash .\text{Prop} \end{array}$

The restriction involved in $\exists !\alpha \times _{c}\beta$ in the hypothesis of the above proposition is not necessary if we assume that the axiom of infinity must fail in any one type if it fails in any other, i.e. $\Lambda \cap tʻ\alpha \in \text{NC induct}.\supset .\Lambda \cap tʻ\beta \in \text{NC induct},$ [Pg 226]where $\alpha$ and $\beta$ are any two objects of any two types. To prove this proposition would require assumptions, as to the interrelation of various types, which have not been made in our previous proofs.

*120·51. $\vdash :\alpha ,\beta ,\gamma ,\in \text{NC induct}.\alpha \neq 0.\exists !\alpha \times _{c}\beta .\alpha\times _{c}\beta =\alpha \times _{c}\gamma .\supset .\beta =\text{ sm }ʻʻ\gamma$

This proposition establishes the uniqueness of division among inductive cardinals.

Dem. $\begin{array}{l} \vdash . *120·44·436. &\supset \vdash \colon\ldotp \text{Hp}.\supset :(\exists \delta ):\beta =\gamma +_{c}\delta .\lor.\gamma =\beta +_{c}\delta &\qquad \text{(1)}\\ \vdash . *113·43. &\supset \vdash :\text{Hp}.\beta =\gamma +_{c}\delta .\supset .\alpha \times _{c}\gamma =(\alpha \times _{c}\gamma )+_{c}(\alpha \times _{c}\delta ).\\ [*120·42.\text{Transp}] &\supset .\alpha \times _{c}\delta =0.\\ [*113·602] &\supset .\delta =0.\\ [*110·6] &\supset .\beta = \text{ sm }ʻʻ\gamma &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\gamma =\beta +_{c}\delta .\supset .\gamma =\text{ sm }ʻʻ\beta .\\ [*100·53.*113·203] &\supset .\beta =\text{ sm }ʻʻ\gamma &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

If $\beta$ , $\gamma$ in the above are typically ambiguous symbols, such as $0, 1, 2, ... \text{Nc}ʻ\rho , \text{Nc}ʻ\sigma , ...,$ we have $\beta = \gamma$ ; for in this case, $\beta =\text{ sm }ʻʻ\beta.\gamma =\text{ sm }ʻʻ\gamma$ . Also if $\beta$ and $\gamma$ are of the same type, we have $\beta=\gamma$ , in virtue of *103·43. Hence " $\beta =\gamma$ " may, with truth, be substituted for " $\beta =\text{ sm }ʻʻ\gamma$ " in the above proposition, since the result is true whenever significant. But in this form the proposition gives less information, since it tells us nothing as to what happens when $\beta$ and $\gamma$ are not of the same type.

*120·511. $\vdash :\alpha ,\beta \in \text{NC induct}.\alpha \neq 0.\exists !\alpha .\alpha \times _{c}\beta =\alpha .\supset .\beta =1$

Dem. $\begin{array}{l} \vdash .*113·621. \supset \vdash :\text{Hp}.\supset .\alpha \times _{c}\beta =\alpha \times _{c} 1 &\qquad \text{(1)}\\ \vdash .(1).*120·51.*101·28.\supset \vdash .\text{Prop} \end{array}$

*120·512. $\vdash :\alpha \times _{c}\beta \in \text{NC induct}-\iota ʻ0-\iota ʻ\Lambda .\supset .\alpha ,\beta \in \text{NC induct}-\iota ʻ0-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash . *113·602·203.\supset \vdash :\text{Hp}.&\supset .\alpha ,\beta \in \text{NC}-\iota ʻ0-\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .(1).*117·62.\supset \vdash :\text{Hp}.&\supset .\alpha \times _{c}\beta \geq \alpha .\alpha \times _{c}\beta \geq \beta .\\ [*120·48] &\supset .\alpha ,\beta \in \text{NC induct} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*120·513. $\vdash :\alpha \in \text{NC induct}-\iota ʻ0-\iota ʻ\Lambda .\alpha \times _{c}\beta =\alpha .\supset .\beta =1 \quad[*120·511·512]$

*120·52. $\vdash :\alpha ,\beta \in \text{NC induct}.\exists !\alpha ^\beta .\supset .\alpha ^\beta \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*116·203·301.&\supset \vdash :\alpha \in \text{NC induct}.\exists !\alpha ^{0}.\supset .\alpha ^{0}=1.\\ [*120·122] &\supset .\alpha ^{0}\in \text{NC induct} &\qquad \text{(1)}\\ \vdash . *116·321·52. &\supset \vdash :\exists !\alpha ^{\beta +_{c}1}.\supset .\alpha ^{\beta +_{c}1}=\alpha ^\beta \times _{c}\alpha .\\ [*120·5] &\supset \vdash :\alpha \in \text{NC induct}.\alpha ^\beta \in \text{NC induct}.\exists !\alpha ^{\beta +_{c}1}.\supset .\\ &\alpha ^{\beta +_{c}1}\in \text{NC induct} &\qquad \text{(2)}\\ \vdash .*116·52.*113·204.&\supset \vdash :\alpha ^\beta =\Lambda .\supset .\alpha ^{\beta +_{c}1}=\Lambda &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*120·11.\supset \vdash .\text{Prop} \end{array}$

*120·53. $\vdash :\alpha ,\beta ,\gamma \in \text{NC induct}.\alpha \neq 0.a\neq 1.\exists !\alpha ^\beta .\alpha ^\beta =\alpha ^\gamma .\supset .\beta =\text{ sm }ʻʻ\gamma$

Dem. $\begin{array}{l} \vdash .*116·203. &\supset \vdash :\exists !\alpha ^\beta .\supset .\exists !\beta &\qquad \text{(1)}\\ \vdash .*120·44·436. &\supset \vdash \colon\ldotp \text{Hp}.\supset :(\exists \delta ):\beta =\gamma +_{c}\delta .\lor.\gamma =\beta +_{c}\delta &\qquad \text{(2)}\\ \vdash .*118·01.*116·52. &\supset \vdash :\beta =\gamma +_{c}\delta .\exists !\beta .\supset .\alpha ^\beta =\alpha ^\gamma \times _{c}\alpha ^\delta :\\ [*13·171.*118·01.(1)] & \supset \vdash :\alpha ^\beta =\alpha ^\gamma .\beta =\gamma +_{c}\delta .\exists !\alpha ^\beta .\supset .\alpha ^\gamma =\alpha ^\gamma \times _{c}\alpha ^\delta &\qquad \text{(3)}\\ \vdash .*120·52.*116·35.(1).&\supset :\text{Hp}.\beta =\gamma +_{c}\delta .\supset .a^\gamma \in \text{NC induct}-\iota ʻ\Lambda -\iota ʻ0.\exists !\beta .\\ [(3).*120·513] & \supset .\alpha ^\delta =1.\\ [*117·592] &\supset .\delta =0.\\ [*110·6] &\supset .\beta =\text{ sm }ʻʻ\gamma &\qquad \text{(4)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\gamma =\beta +_{c}\delta .\supset .\gamma =\text{ sm }ʻʻ\beta .\\ [*100·53.(1)] &\supset .\beta =\text{ sm }ʻʻ\gamma &\qquad \text{(5)}\\ \vdash .(2).(4).(5).\supset \vdash .\text{Prop} \end{array}$

If $\alpha$ , $\beta$ , $\gamma$ are typically ambiguous symbols, we have $\beta =\gamma$ in the conclusion of the above proposition, instead of $\beta =\text{ sm }ʻʻ\gamma$ . Also if $\beta$ and $\gamma$ are of the same type, $\beta =\gamma$ ; thus $\beta=\gamma$ whenever " $\beta =\gamma$ " is significant.

*120·54. $\vdash :\xi ,\rho \in \text{Cls induct}.\exists !\xi .\rho \subset \sigma .\exists !\sigma - \rho .\supset .(\text{Nc}ʻ\rho )^{\text{Nc}ʻ\xi }<(\text{Nc}ʻ\sigma )^{\text{Nc}ʻ\xi }$

Dem. $\begin{array}{l} \vdash .*35·432·82.*80·15.*116·12. &\supset \vdash :\text{Hp}.\supset .(\rho \uparrow \xi )_{\Delta }ʻ\xi \subset (\sigma \uparrow \xi )_{\Delta }ʻ\xi .\\ &\exists !(\sigma \uparrow \xi )_{\Delta }ʻ\xi -(\rho \uparrow \xi )_{\Delta }ʻ\xi &\qquad \text{(1)}\\ \vdash .*120·52.*116·15·251.*120·2.&\supset \vdash :\text{Hp}.\supset .(\rho \uparrow \xi )_{\Delta }ʻ\xi \in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2).*120·426.&\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻ(\rho \uparrow \xi )_{\Delta }ʻ\xi < \text{Nc}ʻ(\sigma \uparrow \xi )_{\Delta }ʻ\xi :\supset \vdash .\text{Prop} \end{array}$

*120·541. $\vdash :\alpha ,\beta \in \text{NC induct}-\iota ʻ\Lambda .\alpha \neq 0.\beta <\gamma .\supset .\beta ^\alpha <\gamma ^\alpha \quad[*120·54·493]$

*120·542. $\vdash :\alpha ,\gamma \in \text{NC induct}-\iota ʻ\Lambda .\alpha \neq 0.\beta >\gamma .\supset .\beta ^\alpha >\gamma ^\alpha \quad[*120·541]$

*120·55. $\vdash :\alpha ,\beta ,\gamma \in \text{NC induct}.\alpha \neq 0.\exists !\beta ^\alpha .\beta ^\alpha =\gamma ^\alpha .\supset .\beta =\text{ sm }ʻʻ\gamma$

Dem. $\begin{array}{l} \vdash .*120·541·542.\supset \vdash :\text{Hp}.&\supset .{\sim}(\beta <\gamma ).{\sim}(\beta >\gamma ).\\ [*120·441] &\supset .\beta =\text{ sm }ʻʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

*120·56. $\vdash :\alpha \geq 2.\alpha ^\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\beta \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*117·581.\supset \vdash :\text{Hp}.&\supset .\alpha ^\beta \geq 2^\beta .\\ [*117·661] & \supset .\alpha ^\beta >\beta &\qquad \text{(1)}\\ \vdash .(1).*120·48.\supset \vdash .\text{Prop} \end{array}$

*120·561. $\vdash :\beta \geq 1.\alpha ^\beta \in \text{NC induct}-\iota ʻ\Lambda .\supset .\alpha \in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*117·591.*116·321.\supset \vdash :\text{Hp}.\supset .\alpha ^\beta \geq \alpha &\qquad \text{(1)}\\ \vdash .(1).*120·48.\supset \vdash .\text{Prop} \end{array}$

*120·57. $\vdash :\mu \in \text{NC induct}-\iota ʻ\Lambda .\supset .\text{Nc}ʻ\hat{\nu} (\nu \leq \mu )=\mu +_{c}1$

Here " $\mu +_{c}1$ " is necessarily in a higher type than " $\mu$ ," because it applies to a class of which $\mu$ is a member.

Dem. $\begin{array}{l} \vdash .*117·511.&\supset \vdash .\text{Nc}ʻ\hat{\nu} (\nu \leq 0)\in 1 &\qquad \text{(1)}\\ \vdash . *110·4. &\supset \vdash :\mu =\Lambda .\supset .\mu +_{c}1=\Lambda &\qquad \text{(2)}\\ \vdash .*120·429·442.\supset \\ &\vdash :\mu \in \text{NC induct}.\exists !\mu +_{c}1.\supset .\hat{\nu} (\nu \leq \mu )=\hat{\nu} (\nu <\mu +_{c}1).\\ [*117·104·105] &\supset .\hat{\nu} (\nu \leq \mu +_{c}1)=\hat{\nu} (\nu \leq \mu )\cup \iota ʻ(\mu +_{c}1) &\qquad \text{(3)}\\ \vdash .*120·428.&\supset \vdash :\text{Hp}(3).\supset .\mu +_{c}1{\sim}\in \hat{\nu} (\nu \leq \mu ) &\qquad \text{(4)}\\ \vdash .(3).(4).*110·631.\supset \\ &\vdash :\text{Hp}(3).\text{Nc}ʻ\hat{\nu} (\nu \leq \mu )=\mu +_{c}1.\supset .\text{Nc}ʻ\hat{\nu} (\nu \leq \mu +_{c}1)=\mu +_{c}2 &\qquad \text{(5)}\\ \vdash .(2).(5).&\supset \vdash \colon\ldotp \mu \in \text{NC induct}:\mu =\Lambda .\lor.\text{Nc}ʻ\hat{\nu} (\nu \leq \mu )=\mu +_{c}1:\supset :\\ &\mu +_{c}1=\Lambda .\lor.\text{Nc}ʻ\hat{\nu} (\nu \leq \mu +_{c}1)=\mu +_{c}2 &\qquad \text{(6)}\\ \vdash .(1).(6).*120·13.\supset \vdash .\text{Prop} \end{array}$

*120·6. $\vdash :(\exists \gamma ).\gamma >\alpha .\gamma \subset tʻ\eta .\supset .\exists !(\alpha +_{c}1)\cap tʻ\eta$

Dem. $\begin{array}{l} \vdash .*117·1.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :(\exists \gamma ,\rho ,\sigma ).\text{N}_{0}\text{c}ʻ\rho =\alpha .\text{N}_{0}\text{c}ʻ\sigma =\gamma .\exists !\text{Nc}ʻ\rho \cap \text{Cl}ʻ\sigma .{\sim}\exists !\text{Nc}ʻ\sigma \cap \text{Cl}ʻ\rho :\\ [*100·1]&\supset :(\exists \gamma ,\rho ,\sigma ,\xi ).\text{N}_{0}\text{c}ʻp=\alpha .\text{N}_{0}\text{c}ʻ\sigma =\gamma .\xi \text{ sm }\rho .\xi \subset \sigma .\xi \neq \sigma :\\ [*24·6] &\supset :(\exists \gamma ,\rho ,\sigma ,\xi ,x).\text{N}_{0}\text{c}ʻp=\alpha .\text{N}_{0}\text{c}ʻ\sigma =\gamma .\xi \text{ sm }\rho .x\in \sigma -\xi :\\ [*110·631]&\supset :(\exists \xi ,x).\xi \cup \iota ʻx\in \alpha +_{c}1\cap tʻ\eta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·61. $\vdash :\exists !\text{N}_{0}\text{C}\cap t^{3}ʻx-\text{NC induct}.\supset .\text{Infin ax}(x)$

Dem. $\begin{array}{l} \vdash .*120·49.&\supset \vdash \colon\ldotp \gamma \in \text{N}_{0}\text{C}\cap t^{3}ʻx-\text{NC induct}.\supset :\\ &\alpha \in \text{NC induct}.\exists !\alpha . \supset _{\alpha }.\gamma >\alpha .\gamma \subset t^{2}ʻx.\\ [*120·6] &\supset _{\alpha }.\exists !\alpha +_{c}1\cap t^{2}ʻx &\qquad \text{(1)}\\ \vdash .(1).*101·12.*120·13.\supset \\ \vdash \colon\ldotp \gamma \in \text{N}_{0}\text{C}-\text{NC induct}.&\supset :\alpha \in \text{NC induct}. \supset _{\alpha }.\exists !\alpha (x)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·611. $\vdash :\beta \in \text{Cls induct}.\beta \subset \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ\beta$

Dem. $\begin{array}{l} \vdash .*80·26.&\supset \vdash .\exists !P_{\Delta }ʻ\Lambda .\\ [\text{Simp}] &\supset \vdash :\Lambda \subset \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*80·94.&\supset \vdash :\exists !P_{\Delta }ʻ\beta .z\in \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ(\beta \cup \iota ʻz):\\ [\text{Syll}] &\supset \vdash \colon\ldotp \beta \subset \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ\beta :\supset :\beta \subset \text{ᗡ}ʻP.z\in \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ(\beta \cup \iota ʻz):\\ [*51·238] &\supset :\beta \cup \iota ʻz\subset \text{ᗡ}ʻP.\supset .\exists !P_{\Delta }ʻ(\beta \cup \iota ʻz) &\qquad \text{(2)}\\ \vdash .(1).(2).*120·26.\supset \vdash .\text{Prop} \end{array}$

*120·62. $\vdash :\kappa \in \text{Cls induct}.\Lambda {\sim}\in \kappa .\supset .\exists !{\in}_{\Delta}ʻ\kappa$

Dem. $\begin{array}{l} \vdash .*83·9. &\supset \vdash .\exists !{\in}_{\Delta}ʻ\Lambda &\qquad \text{(1)}\\ \vdash . *83·904. &\supset \vdash :\exists !{\in}_{\Delta}ʻ\kappa .\exists !\alpha .\supset .\exists !{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ):\\ [\text{Syll}] &\supset \vdash \colon\ldotp \Lambda {\sim}\in \kappa .\supset .\exists !{\in}_{\Delta}ʻ\kappa :\supset :\Lambda {\sim}\in \kappa .\exists !\alpha .\supset .\exists !{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ):\\ [*24·54] &\supset :\Lambda {\sim}\in (\kappa \cup \iota ʻ\alpha ).\supset .\exists !{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).*120·26.\supset \vdash .\text{Prop} \end{array}$

*120·63. $\vdash .\text{Cls induct} - \overleftarrow{{\in}}ʻ\Lambda \subset \text{Cls}^{2}\, \text{mult} \quad[*120·62.*88·2]$

In virtue of this proposition the multiplicative axiom is not required in dealing with a finite number of factors, even when some or all of the factors are themselves infinite.

Dem. $\begin{array}{l} \vdash .*120·61.\text{Transp}.&\supset \vdash \colon\ldotp {\sim}\text{Infin ax}.\supset :\text{N}_{0}\text{C}\subset \text{NC induct}:\\ [*120·21] &\supset :(\kappa ).\kappa \in \text{Cls induct}:\\ [*120·62] &\supset :(\kappa ):\Lambda {\sim}\in \kappa .\supset .\exists !{\in}_{\Delta}ʻ\kappa :\\ [*88·37] &\supset :\text{Mult ax}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Thus of our two arithmetical axioms, the multiplicative axiom and the axiom of infinity, at least one must be true.

*120·7. $\vdash :\alpha \in \text{Cls induct}.\alpha \subset \beta .\alpha \neq \beta .\supset .\text{Nc}ʻ\alpha < \text{Nc}ʻ\beta \quad[*120·426.*24·6]$

*120·71. $\vdash :\rho ,\sigma \in \text{Cls induct}.\equiv .\rho \cup \sigma \in \text{Cls induct}.\equiv .\rho + \sigma \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·481.&\supset \vdash :\rho \cup \sigma \in \text{Cls induct}.\supset .\rho ,\sigma \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*120·481.&\supset \vdash :\rho ,\sigma \in \text{Cls induct}.\supset .\rho ,\sigma - \rho \in \text{Cls induct}.\\ [*120·21] & \supset .\text{N}_{0}\text{c}ʻ\rho ,\text{N}_{0}\text{c}ʻ(\sigma - \rho )\in \text{NC induct}.\\ [*120.45] &\supset .\text{N}_{0}\text{c}ʻ\rho +_{c} \text{N}_{0}\text{c}ʻ(\sigma - \rho )\in \text{NC induct}.\\ [*110·32] & \supset .\text{Nc}ʻ(\rho \cup \sigma )\in \text{NC induct}.\\ [*120·211] & \supset .\rho \cup \sigma \in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2). & \supset \vdash :\rho ,\sigma \in \text{Cls induct}.\equiv .\rho \cup \sigma \in \text{Cls induct} &\qquad \text{(3)}\\ \vdash .*110·12.*120·214.&\supset \vdash :\rho ,\sigma \in \text{Cls induct}.\equiv .\\ &\downarrow (\Lambda \cap \sigma )ʻʻ\iota ʻʻ\rho ,(\Lambda \cap \rho )\downarrow ʻʻ\iota ʻʻ\sigma \in \text{Cls induct}.\\ [(3).(*110·01)] & \equiv .\rho + \sigma \in \text{Cls induct} &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*120·72. $\vdash :\rho ,\sigma \in \text{Cls induct}.\supset .\rho \times \sigma \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·21.\supset \vdash :\text{Hp}.&\supset .\text{N}_{0}\text{c}ʻ\rho ,\text{N}_{0}\text{c}ʻ\sigma \in \text{NC induct}.\\ [*120·5] &\supset .\text{Nc}ʻ(\rho \times \sigma )\in \text{NC induct}.\\ [*120·211] & \supset .\rho \times \sigma \in \text{Cls induct}:\supset \vdash .\text{Prop} \end{array}$

*120·721. $\vdash \colon\ldotp \exists !\rho .\exists !\sigma .\supset :\rho ,\sigma \in \text{Cls induct}.\equiv .\rho \times \sigma \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·512.*113·107.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\rho \times \sigma \in \text{Cls induct}.\supset .\text{Nc}ʻ\rho ,\text{Nc}ʻ\sigma \in \text{NC induct}.\\ [*120·211] &\supset .\rho ,\sigma \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*120·72.\supset \vdash .\text{Prop} \end{array}$

*120·73. $\vdash :\rho ,\sigma \in \text{Cls induct}.\supset .(\rho \,\,\text{exp}\,\,\sigma )\in \text{Cls induct} \quad[*120·52.*116·251]$

*120·731. $\begin{align}&\vdash \colon\ldotp \exists !\rho .\exists !\sigma .\rho {\sim}\in 1.\supset :\rho ,\sigma \in \text{Cls induct}.\equiv .(\rho \,\,\text{exp}\,\,\sigma )\in \text{Cls induct}\\ &[*120·56·561·73]\end{align}$

*120·74. $\vdash :\rho \in \text{Cls induct}.\equiv .\text{Cl}ʻ\rho \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*116·72.*120·21.\supset \vdash :\text{Cl}ʻ\rho \in \text{Cls induct}.&\equiv .2^{\text{Nc}ʻ\rho }\cap tʻ\text{Cl}ʻ\rho \in \text{NC induct}.\\ [*120·123·52·56.*116·72.(*116·04)] &\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC induct}.\\ [*120·21] &\equiv .\rho \in \text{Cls induct}.:\supset \vdash .\text{Prop} \end{array}$

*120·741. $\vdash :sʻ\kappa \in \text{Cls induct}.\supset .\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·74. &\supset \vdash :\text{Hp}.\supset .\text{Cl}ʻsʻ\kappa \in \text{Cls induct}.\\ [*60·57.*120·481] &\supset .\kappa \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*40·13.*120·481.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\rho \in \kappa .\supset .\rho \in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*120·75. $\vdash :sʻ\kappa \in \text{Cls induct}.\equiv .\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*22·58. &\supset \vdash :\exists !\kappa -\text{Cls induct}.\supset .\exists !(\kappa \cup \iota ʻ\alpha )-\text{Cls induct} &\qquad \text{(1)}\\ \vdash .*120·71.*53·15.&\supset \vdash :sʻ\kappa \in \text{Cls induct}.\alpha \in \text{Cls induct}.\supset .\\ &sʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct}:\\ [*5·6] &\supset \vdash \colon\ldotp sʻ\kappa \in \text{Cls induct}.\supset :\\ &\alpha {\sim}\in \text{Cls induct}.\lor.sʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct}:\\ [*51·16]&\supset :\exists !(\kappa \cup \iota ʻ\alpha )-\text{Cls induct}.\lor.sʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp \exists !\kappa -\text{Cls induct}.\lor.sʻ\kappa \in \text{Cls induct}:\supset :\\ &\exists !(\kappa \cup \iota ʻ\alpha )-\text{Cls induct}.\lor.sʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(3)}\\ \vdash .*40·21.*120·212.&\supset \vdash .sʻ\Lambda \in \text{Cls induct} &\qquad \text{(4)}\\ \vdash .(3).(4).*120·26.&\supset \vdash \colon\ldotp \kappa \in \text{Cls induct}.\supset :\\ &\exists !\kappa -\text{Cls induct}.\lor.sʻ\kappa \in \text{Cls induct}\colon\ldotp \\ [*5·6]&\supset \vdash :\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}.\supset .sʻ\kappa \in \text{Cls induct} &\qquad \text{(5)}\\ \vdash .(5).*120·741.\supset \vdash .\text{Prop} \end{array}$

*120·76. $\vdash :\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}.\supset .{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*51·2. &\supset \vdash \colon\ldotp \alpha \in \kappa .\supset :\kappa =\kappa \cup \iota ʻ\alpha :\\ [*13·12] &\supset :{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}.\supset .{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*83·41.*114·301. &\supset \vdash :\alpha {\sim}\in \kappa .\supset .{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\text{ sm }{\in}_{\Delta}ʻ\kappa \times \alpha &\qquad \text{(2)}\\ \vdash .(2).*120·214. &\supset \vdash \colon\ldotp \alpha {\sim}\in \kappa .\supset :\\ &{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct}.\equiv .{\in}_{\Delta}ʻ\kappa \times \alpha \in \text{Cls induct} &\qquad \text{(3)}\\ \vdash .(3).*120·72. &\supset \vdash \colon\ldotp \alpha {\sim}\in \kappa .\supset :\\ &{\in}_{\Delta}ʻ\kappa ,\alpha \in \text{Cls induct}.\supset .{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(4)}\\ \vdash .(1).(4). &\supset \vdash :{\in}_{\Delta}ʻ\kappa ,\alpha \in \text{Cls induct}.\supset .{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(5)}\\ \vdash .(5).*51·2.\text{Syll}. &\supset \vdash \colon\ldotp \kappa \subset \text{Cls induct}.\supset .{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}:\supset :\\ &\kappa \cup \iota ʻ\alpha \subset \text{Cls induct}.\supset .{\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(6)}\\ \vdash .*83·15.*120·213. &\supset \vdash .{\in}_{\Delta}ʻ\Lambda \in \text{Cls induct}.\\ [\text{Simp}] &\supset \vdash :\Lambda \subset \text{Cls induct}.\supset .{\in}_{\Delta}ʻ\Lambda \in \text{Cls induct} &\qquad \text{(7)}\\ \vdash .(6).(7).*120·26. &\supset \vdash \colon\ldotp \kappa \in \text{Cls induct}.\supset :\\ &\kappa \subset \text{Cls induct}.\supset .{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned in establishing the converse of *120·76 subject to a suitable hypothesis. The final outcome is given in *120·77.

*120·761. $\vdash :\exists !{\in}_{\Delta}ʻ\kappa .{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}.\supset .\kappa \subset \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*83·41.*114·301. &\supset \vdash \colon\ldotp \alpha \in \kappa .\supset :{\in}_{\Delta}ʻ\kappa \text{ sm }\alpha \times {\in}_{\Delta}ʻ(\kappa -\iota ʻ\alpha ): &\qquad \text{(1)}\\ [*120·214] &\supset :{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}.\equiv .\alpha \times {\in}_{\Delta}ʻ(\kappa -\iota ʻ\alpha )\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).*113·114. &\supset \vdash :\exists !{\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset .\exists !\alpha .\exists !{\in}_{\Delta}ʻ(\kappa -\iota ʻ\alpha ) &\qquad \text{(3)}\\ \vdash .(2).(3).*120·721. & \supset \vdash \colon\ldotp \exists !{\in}_{\Delta}ʻ\kappa .\alpha \in \kappa .\supset :\\ &{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}.\supset .\alpha \in \text{Cls induct} &\qquad \text{(4)}\\ \vdash .(4).\text{Comm}.\supset \vdash .\text{Prop} \end{array}$

*120·762. $\vdash :\kappa \in \text{Cls induct}.\Lambda {\sim}\in \kappa .{\sim}\exists !1\cap \kappa .\supset .(\exists R,S).R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*51·2. & \supset \vdash :R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} .\alpha \in \kappa .\supset .R,S\in {\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ).R\dot{\cap} S=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*83·5.*55·201.\supset \\ &\vdash :R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} .x,y\in \alpha .x\neq y.\alpha {\sim}\in \kappa .\supset .\\ &R\unicode{x228d} x\downarrow \alpha ,S\unicode{x228d} y\downarrow \alpha \in {\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ).(R\unicode{x228d} x\downarrow \alpha )\dot{\cap} (S\unicode{x228d} y\downarrow \alpha )=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).*52·41. &\supset \vdash :R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} .\alpha \neq \Lambda .\alpha {\sim}\in 1.\supset .\\ &(\exists P,Q).P,Q\in {\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ).P\dot{\cap} Q=\dot{\Lambda} &\qquad \text{(3)}\\ \vdash .*51·16.&\supset \vdash \colon\ldotp \alpha =\Lambda .\lor.\alpha \in 1:\supset :\Lambda \in (\kappa \cup \iota ʻ\alpha ).\lor.\exists !1\cap (\kappa \cup \iota ʻ\alpha ) &\qquad \text{(4)}\\ \vdash .*22·58.&\supset \vdash \colon\ldotp \Lambda \in \kappa .\lor.\exists !1\cap \kappa :\supset :\Lambda \in (\kappa \cup \iota ʻ\alpha ).\lor.\exists !1\cap (\kappa \cup \iota ʻ\alpha ) &\qquad \text{(5)}\\ \vdash .(3).(4).(5).&\supset \vdash \colon\ldotp \Lambda \in \kappa .\lor.\exists !1\cap \kappa .\lor.(\exists R,S).R,S\in {\in}_{\Delta}ʻ\kappa .R\dot{\cap} S=\dot{\Lambda} :\supset :\\ &\Lambda \in (\kappa \cup \iota ʻ\alpha ).\lor.\exists !1\cap (\kappa \cup \iota ʻ\alpha ).\lor.(\exists R,S).R,S\in {\in}_{\Delta}ʻ(\kappa \cup \iota ʻ\alpha ).R\dot{\cap} S=\dot{\Lambda} &\qquad \text{(6)}\\ \vdash .*83·15.&\supset \vdash .(\exists R,S).R,S\in {\in}_{\Delta}ʻ\Lambda .R\dot{\cap} S=\dot{\Lambda} &\qquad \text{(7)}\\ \vdash .(6).(7).*120·26.\supset \vdash .\text{Prop} \end{array}$

*120·764. $\begin{align}&\vdash :\kappa \in \text{Cls induct}.\Lambda {\sim}\in \kappa .{\sim}\exists !(1\cap \kappa ).\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\kappa \geq \text{Nc}ʻ\kappa \\ &[*120·762.*117·681]\end{align}$

*120·765. $\begin{align}\vdash :\kappa \in \text{Cls induct}.\Lambda {\sim}\in \kappa .{\sim}&\exists !(1\cap \kappa ).\kappa \subset \lambda .\exists !{\in}_{\Delta}ʻ\lambda .\supset .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \text{Nc}ʻ\kappa \quad[*120·762.*117·684]\end{align}$

*120·766. $\begin{align}\vdash :\lambda {\sim}\in \text{Cls induct}.\Lambda {\sim}\in \lambda.{\sim}\exists !(1\cap \lambda ).&\exists !{\in}_{\Delta}ʻ\lambda .\supset .\\ &\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda {\sim}\in \text{NC induct}\end{align}$

Dem. $\begin{array}{l} \vdash .*120·491.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\nu \in \text{NC induct}.\supset .\\ &(\exists \kappa ).\kappa \subset \lambda .\text{Nc}ʻ\kappa =\nu .\Lambda {\sim}\in \kappa .{\sim}\exists !(1\cap \kappa ).\\ [*120·765] &\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \nu :\\ [*120·121] &\supset :\nu \in \text{NC induct}.\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda \geq \nu +_{c}1.\\ [*120·429] &\supset .\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda >\nu :\\ [*117·42] &\supset :\text{Nc}ʻ{\in}_{\Delta}ʻ\lambda {\sim}\in \text{NC induct}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*120·767. $\begin{align}&\vdash :{\in}_{\Delta}ʻ\lambda \in \text{Cls induct}.\Lambda {\sim}\in \lambda .{\sim}\exists !(1\cap \lambda ).\exists !{\in}_{\Delta}ʻ\lambda .\supset .\lambda \in \text{Cls induct}\\ &[*120·766.\text{Transp}]\end{align}$

*120·77. $\begin{align}\vdash \colon\ldotp \Lambda {\sim}\in \kappa .{\sim}&\exists !(1\cap \kappa ).\exists !{\in}_{\Delta}ʻ\kappa .\supset :\\ &{\in}_{\Delta}ʻ\kappa \in \text{Cls induct}.\equiv .\kappa \in \text{Cls induct}.\kappa \subset \text{Cls induct}\\ &[*120·76·761·767]\end{align}$

The present number is concerned with the class of terms between $x$ and $y$ with respect to some relation $P$ , i.e. those terms which lie on a road from $x$ to $y$ on which any two consecutive terms have the relation $P$ . Such a road may be called a $P$ -road, and if $zPw$ , the step from $z$ to $w$ may be called a $P$ -step. In order that a $P$ -road from $x$ to $y$ should exist, it is necessary and sufficient that we should have $xP_{\text{po}}y$ . When this condition is fulfilled, there will in general be many $P$ -roads from $x$ to $y$ . But if $P\in \text{Cls}\rightarrow 1.{\sim}(yP_{\text{po}}y)$ , or if $P\in 1\rightarrow \text{Cls}.{\sim}(xP_{\text{po}}x)$ ,then at most one road leads from $x$ to $y$ . This follows from the propositions of *96. In virtue of those propositions, if $P\in \text{Cls}\rightarrow 1.{\sim}(yP_{\text{po}}y).xP_{\text{po}}y$ , $P$ is $1\rightarrow 1$ throughout the road from $x$ to $y$ , and this road forms an open series. The two other possibilities with a $\text{Cls}\rightarrow 1$ are (assuming $xP_{\text{po}}y$ ) $\begin{aligned} &(1)\quad xP_{\text{po}}x,\\ &(2) \quad yP_{\text{po}}y.{\sim}(xP_{\text{po}}x). \end{aligned}$

In the first case, there is a cyclic road from $x$ to $x$ , and there are two roads from $x$ to $y$ , one consisting of that part of the cycle which is required to reach $y$ , the other consisting of this part together with the whole cycle required to travel from $y$ back to $y$ . Thus the class of terms which can be reached in some journey from $x$ to $y$ is the whole class of descendants of $x$ , i.e. the class $\overleftarrow{R}_{*}ʻx$ , which is the cycle composing the road from $x$ to $x$ .

In the second case, the descendants of $x$ form a $Q$ , and $y$ is in the circular part of the $Q$ . Here, as before, there are two roads from $x$ to $y$ , of which the first stops as soon as it reaches $y$ , while the second proceeds to travel round the circle until it comes to $y$ again. Thus here again, all the descendants of $x$ lie on some road between $x$ and $y$ .

The interval between $x$ and $y$ is defined as the class of terms lying on some road from $x$ to $y$ . There will be four kinds of interval, according as we do or do not include the end-points as such. We denote the kind including both end-points by $P(x\vdash\dashv y),$ that excluding both by $P(x\unicode{x2013} y)$ and the other two respectively by $P(x\dashv y), P(x \unicode{x27dd} y).$

The definitions are $\overleftarrow{P}_{*}ʻx\cap \overrightarrow{P}_{*}ʻy, \quad\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{\text{po}}ʻy, \quad\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{*}ʻy, \quad\overleftarrow{P}_{*}ʻx\cap \overrightarrow{P}_{\text{po}}ʻy.$

If $P$ is either one-many or many-one, it will be one-one throughout the interval $P(x\vdash\dashv y)$ , except at most at one exceptional point, namely the junction of the tail and circle of the $Q$ . If $xP_{\text{po}}x$ or ${\sim}(yP_{\text{po}}y)$ , the interval between $x$ and $y$ cannot be $Q$ -shaped, but must be either open or cyclic; in either case, $P$ is $1\rightarrow 1$ throughout $P(x\vdash\dashv y)$ , with no exceptions; for if $P\in \text{Cls}\rightarrow 1$ , $P$ is $1\rightarrow 1$ throughout the interval because the interval is contained in $\overleftarrow{P}_{*}ʻx$ , and if $P\in 1\rightarrow \text{Cls}$ , because the interval is contained in $\overrightarrow{P}_{*}ʻy$ . Thus throughout this number we shall constantly have the hypothesis $P\in(\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls})$ ; if $P\in\text{Cls}\rightarrow 1$ , the interval is to be supposed traversed from $x$ to $y$ , while if $P\in 1\rightarrow \text{Cls}$ , it is to be supposed traversed from $y$ to $x$ . In either case the interval between $x$ and $y$ must be an inductive class. This is proved in *121·47. If, however, $P$ is serial (cf. *204), and thus neither many-one nor one-many, the interval between $x$ and $y$ is the stretch of the series between $x$ and $y$ , with or without end-points according to the definition chosen, and need not be an inductive class.

If the interval between $x$ and $y$ (both included) has $\nu +_{c}1$ members, we say that $xP_{\nu }y$ . Thus if there is only one road from $x$ to $y$ , " $xP_{\nu }y$ " means that it requires $\nu$ steps to get from $x$ to $y$ . Assuming $P\in \text{Cls}\rightarrow 1$ , if we also have $P_{\text{po}}\,\unicode{x2abd}\, J$ (i.e. if none of the families of $P$ are cyclic), then if $xP_{\nu }y$ and $yPz$ , we shall have $xP_{\nu +_{c}1}z$ . On this basis an inductive theory of $P_{\nu}$ is built up, and it is shown that the class of such relations as $P_{\nu }$ for different inductive values of $\nu$ is the same as $\text{Potid}ʻP$ , the class of powers of $P$ including $I\upharpoonright CʻP$ (*121·5). The definition of $P_{\nu }$ is $P_{\nu } = \hat{x} \hat{y} \{\text{N}_{0}\text{c}ʻP(x\vdash\dashv y)=v+_{c}1\} \quad\text{Df}.$

The whole class of such relations as $P_{\nu}$ for different inductive values of $\nu$ is called $\text{finid}ʻP$ , i.e. we put $\text{finid}ʻP=\hat{R} \{(\exists \nu ).\nu \in \text{NC induct}-\iota ʻ\Lambda .R=P_{\nu }\} \quad\text{Df}.$

If $BʻP$ exists, and if $P\in \text{Cls}\rightarrow 1$ , then the descendants of $BʻP$ , so long as we do not reach a term $y$ for which $yP_{\text{po}}y$ , may be unambiguously described as the 2nd, 3rd, ... $\nu$ th, ... terms of the posterity of $BʻP$ , $BʻP$ itself being the 1st term. The correlation thus effected with the inductive cardinals is the logical essence of the process of counting; the last cardinal used in the correlation is the cardinal number of terms counted. We will call these terms $1_{P}$ , $2_{P}$ , ... $\nu_{P}$ , ..., defining $\nu _{P}$ as follows: $\nu _{P} = \breve{P} _{\nu -_{c}1}ʻBʻP \quad\text{Df},$

This notation does not conflict with $\nu _{\xi }$ as defined in *65.01. There $\xi$ must be a class if $\nu$ is a cardinal, here $\nu$ must be a cardinal and $P$ a relation.

Hence whenever $\nu _{P}$ exists, the number of terms from the beginning to $\nu _{P}$ (both included) is $\nu$ . This is the fact upon which counting relies. If $P$ is a many-one and $P_{\text{po}}$ is contained in diversity, and $\nu$ is any inductive cardinal other than 0, then $\nu _{P}$ exists when and only when $\overleftarrow{P}_{*}ʻBʻP$ has at least $\nu$ members; i.e. roughly speaking, $\nu _{P}$ exists whenever it could possibly be expected to exist. In this case the whole posterity of $BʻP$ is contained in the series $1_{P}$ , $2_{P}$ , ... $\nu_{P}$ , ... (*121·62). If the posterity is an inductive class, this series stops; if not, it forms a progression (cf. *122).

The propositions of the present number are very useful, not only in this section, but in the ordinal theory of finite and infinite and in parts of the book subsequent to that theory.

After some propositions which merely repeat definitions and give immediate consequences, we proceed (*121·3 ff.) to the theory of $P_{\nu }$ . We have

*121·302. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{0}=I\upharpoonright CʻP$

*121·305. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{1}\,\unicode{x2abd}\, P$

*121·31. $\vdash :P\in (l\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{1}=P$

When $P$ is a transitive serial relation, we shall have $P_{1}=P\dot{-} P^{2}$ .

*121·333. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{\nu +_{c}1}=P\mid P_{\nu }$

*121·35·351·352. $\begin{align}\vdash :P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).&P_{\text{po}}\,\unicode{x2abd}\, J.\mu ,\nu \in \text{NC induct}.\supset .\\ &P_{\mu }\mid P_{\nu }=P_{\nu }\mid P_{\mu }=P_{\mu +_{c}\nu }\end{align}$

A similar result holds for $(P_{\mu })_{\nu }$ , which = $P_{\mu x_{c}\nu }$ n the same circumstances.

We next proceed to the proof that an interval (under a similar hypothesis) is always an inductive class. This occupies *121·4—·47, being summed up in the proposition

*121·47. $\vdash :R\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).\supset .R(x \vdash\dashv z)\in \text{Cls induct}$

*121·481. $\begin{align}\vdash \colon\ldotp R\in \text{Cls}\rightarrow 1.\supset :\text{Nc}ʻR(x\vdash\dashv y)\leq \text{Nc}ʻ&R(x \vdash\dashv z).\equiv .\\ &R(x \vdash\dashv y)\subset R(x \vdash\dashv z)\end{align}$

The next set of propositions (*121·5—·52) is concerned with $\text{finid}ʻP$ . Assuming $P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).P_{\text{po}}\,\unicode{x2abd}\, J$ , we prove that $\text{finid}ʻP=\text{Potid}ʻP$ and $\text{finid}ʻP-\iotaʻP_{0}\subset \text{Pot}ʻP$ (*121·5); that if $P$ is not null, $\text{finid}ʻP-\iota ʻP_{0}=\text{Pot}ʻP$ (*121·501); that $\dot{s}ʻ\text{finid}ʻP=P_{*}$ (*121·52) and $\dot{s} ʻ(\text{finid}ʻP-\iotaʻP_{0})=P_{\text{po}}$ (*121·502); and that $P_{2}=P^{2}.P_{3}=P^{3}$ etc. (*121·51).

Our next set of propositions is concerned with $\nu _{P}$ (*121·6—·638). We have

*121·601. $\vdash : \text{E}! BʻP . \supset . BʻP = 1_{P} . {\sim} \{(BʻP) P_{\text{po}} (BʻP)\}$

*121·602. $\vdash : \text{E}! BʻP . P \in 1 \rightarrow 1 . \supset . \breve{P} ʻBʻP = 2_{P}$

*121·634. $\begin{align}\vdash \colon\ldotp P \in \text{Cls} \rightarrow 1 . P_{\text{po}} \,\unicode{x2abd}\, J . \nu \in &\text{NC induct} - \iota ʻ0 . \supset :\\ &\nu _{P} \in \text{D} ʻP . \equiv . \text{E}! (\nu +_{c} 1)_{P}\end{align}$

Finally we have three propositions (*121·7—*121·72) on $\overrightarrow{R}_{*}ʻx$ , of which the most useful is

*121·7. $\vdash : R \in 1 \rightarrow 1 . aBR . aR_{*}x . \supset . \overrightarrow{R}_{*}ʻx = R(a \vdash\dashv x) . \overrightarrow{R}_{*}ʻx \in \text{Cls induct}$

*121·01. $P(x \unicode{x2013} y) = \overleftarrow{P}_{\text{po}}ʻx \cap \overrightarrow{P}_{\text{po}}ʻy \quad\text{Df}$

*121·011. $P(x \dashv y) = \overleftarrow{P}_{\text{po}} ʻx \cap \overrightarrow{P}_{*} ʻy \quad\text{Df}$

*121·012. $P(x \unicode{x27dd} y) = \overleftarrow{P}_{*} ʻx \cap \overrightarrow{P}_{\text{po}} ʻy \quad\text{Df}$

*121·013. $P(x \vdash\dashv y) = \overleftarrow{P}_{*} ʻx \cap \overrightarrow{P}_{*} ʻy \quad\text{Df}$

*121·02. $P_\nu = \hat{x} \hat{y} \{\text{N}_0\text{c} ʻP (x \vdash\dashv y) = \nu +_{c} 1\} \quad\text{Df}$

*121·03. $\text{finid} ʻP = \hat{R} \{(\exists \nu ) . \nu \in \text{NC induct} - \iota ʻ\Lambda . R = P_{\nu }\} \quad\text{Df}$

*121·031. $\text{fin} ʻP = \hat{R} \{(\exists \nu ). \nu \in \text{NC induct} - \iota ʻ\Lambda - \iota ʻ0 . R = P_{\nu }\} \quad\text{Df}$

*121·1. $\vdash : z \in P (x \unicode{x2013} y) . \equiv . xP_{\text{po}}z . zP_{\text{po}}y \quad[(*121·01)]$

*121·102. $\vdash : z \in P (x \unicode{x27dd} y) . \equiv . xP_{*}z . zP_{\text{po}}y$

*121·11. $\vdash : xP_{\nu }y . \equiv . \text{N}_0\text{c} ʻP (x \vdash\dashv y) = \nu +_{c} 1 \quad[(*121·02)]$

*121·12. $\vdash : R \in \text{finid} ʻP . \equiv . (\exists \nu ) . \nu \in \text{NC induct} - \iota ʻ\Lambda . R = P_\nu \quad[(*121·03)]$

*121·121. $\vdash : R \in \text{fin} ʻP . \equiv . (\exists \nu ) . \nu \in \text{NC induct} - \iota ʻ\Lambda - \iota ʻ0 . R = P_\nu \quad[(*121·031)]$

*121·13. $\vdash : f (\nu _{P}) . \equiv . f(\breve{P} _{\nu -_{c} 1} ʻBʻP) \quad[(*121·04)]$

*121*131. $\vdash : \text{E}! \breve{P} _{\nu -_{c} 1} ʻBʻP . \supset . \nu _{P} = \breve{P} _{\nu -_{c} 1}ʻBʻP \quad[*121·13.*14·28]$

*121·14. $\vdash . P (x \unicode{x2013} y) = \breve{P} (y \unicode{x2013} x) \quad[*121·1 . *91·53]$

*121·2. $\vdash : {\sim} (xP_{\text{po}}x) . \supset . x {\sim} \in P (x \unicode{x2013} y) \quad[*121·1]$

*121·201. $\vdash : {\sim} (yP_{\text{po}}y) . \supset . y {\sim} \in P (x \unicode{x2013} y)$

*121·202. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .x,y{\sim}\in P(x\unicode{x2013}y) \quad[*121·2·201]$

*121*21. $\vdash :xP_{\text{po}}y.\equiv .y\in P(x\dashv y).\equiv .\exists !P(x\dashv y)$

Dem. $\begin{array}{l} \vdash .*90·12.*91·54.\supset \vdash :xP_{\text{po}}y.&\equiv .xP_{\text{po}}y.yP_{*}y.\\ [*121·101] &\equiv .y\in P(x\dashv y) &\qquad \text{(1)}\\ \vdash .*121·101.\supset \vdash :\exists !P(x\dashv y).&\equiv .xP_{\text{po}}\mid P_{*}y.\\ [*91·574] &\equiv .xP_{\text{po}}y &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·22. $\vdash :xP_{\text{po}}y.\equiv .x\in P(x\unicode{x27dd} y).\equiv .\exists !P(x\unicode{x27dd} y)$

*121·23. $\vdash :xP_{*}y.\equiv .x,y\in P(x\vdash\dashv y).\equiv .\exists !P(x\vdash\dashv y)$

*121·231. $\vdash :x\in CʻP.\equiv .x\in P(x\vdash\dashv x).\equiv .\exists !P(x\vdash\dashv x) \quad[*121·23.*90·12]$

*121·24. $\vdash :xP_{\text{po}}y.\supset .P(x\dashv y)=P(x\unicode{x2013}y)\cup \iota ʻy$

Dem. $\begin{array}{l} \vdash .*91·54.*121·101.\supset \\ \vdash \colon\ldotp z\in P(x\dashv y). &\equiv :xP_{\text{po}}z:zP_{\text{po}}y.\lor.z=y.y\in CʻP:\\ [*13·193.*91·504]&\equiv:xP_{\text{po}}z.zP_{\text{po}}y.\lor.xP_{\text{po}}y.z=y &\qquad \text{(1)}\\ \vdash .(1).*4·73.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp z\in P(x\dashv y).&\equiv :xP_{\text{po}}z.zP_{\text{po}}y.\lor.z=y\colon\colon \supset \vdash .\text{Prop} \end{array}$

*121·241. $\vdash :xP_{\text{po}}y.\supset .P(x \unicode{x27dd} y)=P(x\unicode{x2013}y)\cup \iota ʻx$

*121·242. $\begin{align}\vdash :xP_{*}y.\supset .P(x\vdash\dashv y)&=P(x\dashv y)\cup \iota ʻx=P(x \unicode{x27dd} y)\cup \iota ʻy\\ &=P(x-y)\cup \iota ʻx\cup \iota ʻy\end{align}$

*121*25. $\vdash .P_{\text{po}}(x\unicode{x2013}y)=P(x\unicode{x2013}y) \quad[*91·601.*121·1]$

Dem. $\begin{array}{l} \vdash .*121·11·143.\supset \vdash :x\breve{P} _{\nu }y.&\equiv .\text{N}_{0}\text{c}ʻ\breve{P} (x\vdash\dashv y)=\nu +_{c}1.\\ [*90·132.*121·11] &\equiv .x(\breve{P} )_{\nu }y:\supset \vdash .\text{Prop} \end{array}$

*121·27. $\vdash :xP_{\nu }y.\supset .\nu ,\nu +_{c}1\in \text{NC}-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*121·11.*103·12.\supset \vdash :\text{Hp}.\supset .P(x\vdash\dashv y)\in \nu +_{c}1 &\qquad \text{(1)}\\ \vdash .(1).*110·4·42.\supset \vdash .\text{Prop} \end{array}$

*121·271. $\vdash :{\sim}(\nu ,\nu +_{c}1\in \text{NC}-\iota ʻ\Lambda ).\supset .P_{\nu }=\dot{\Lambda} \quad[*121·27.\text{Transp}]$

*121·272. $\vdash :\dot{\exists} !P_{\nu }.\supset .\nu \geq 0.\nu +_{c}1>0.\nu +_{c}1\geq 1$

Dem. $\begin{array}{l} \vdash .*117·5.*121·27.\supset \vdash :\text{Hp}.&\supset .\nu \geq 0. &\qquad \text{(1)}\\ [*117·561.*110·641] &\supset .\nu +_{c}1\geq 1. &\qquad \text{(2)}\\ [*117·511·531] &\supset .\nu +_{c}1>0 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*121·27.*110·4.\supset \vdash :\text{Hp}.&\supset .\nu \in \text{NC}-{℩}ʻ\Lambda .\\ [*117·6] &\supset .\nu +_{c}1\geq 1.\\ [*117·511·531] &\supset .\nu +_{c}1>0:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*121·11.\supset \vdash :xP_{0}y.&\equiv .P(x\vdash\dashv y)\in 1.\\ [*121·23] &\supset .xP_{*}y.x=y.\\ [*90·12] &\supset .x(I\upharpoonright CʻP)y:\supset \vdash .\text{Prop} \end{array}$

*121·301. $\vdash :{\sim}(xP_{\text{po}}x).\supset :xP_{0}y.\equiv .x\in CʻP.x=y$

Dem. $\begin{array}{l} \vdash .*91·542·56. &\supset \vdash :xP_{*}z.zP_{*}x.x\neq z.\supset .xP_{\text{po}}x &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}. \supset \vdash \colon\ldotp \text{Hp}.&\supset :xP_{*}z.zP_{*}x.\supset _{x,z}.x=z:\\ [*121·231] &\supset :x\in CʻP.\supset .P(x\vdash\dashv x)={℩}ʻx:\\ [*13·12.*52·22] &\supset :x\in CʻP.x=y.\supset .P(x\vdash\dashv y)\in 1.\\ [*121·11] &\supset .xP_{0}y &\qquad \text{(2)}\\ \vdash .(2).*121·3.\supset \vdash .\text{Prop} \end{array}$

*121·302. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{0}=I\upharpoonright CʻP \quad[*121·301]$

Dem. $\begin{array}{l} \vdash .*121·23.*52·22.*117·42.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in P(x\vdash\dashv y).P(x\vdash\dashv y)\neq {℩}ʻx:\\ [*51·4.\text{Transp}] &\supset :(\exists z).z\neq x.z\in P(x\vdash\dashv y):\\ [*121·103.*91·542] &\supset :(\exists z).xP_{\text{po}}z.zP_{*}y:\\ [*91·574] &\supset :xP_{\text{po}}y\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*121·304. $\vdash \colon\ldotp P_{\text{po}}\,\unicode{x2abd}\, J.\supset :xP_{1}y.\equiv .P(x\vdash\dashv y)={℩}ʻx\cup {℩}ʻy.x\neq y$

Dem. $\begin{array}{l} \vdash .*121·303·11.\supset \vdash :\text{Hp}.xP_{1}y.&\supset .xP_{\text{po}}y.\\ [\text{Hp}] &\supset .x\neq y &\qquad \text{(1)}\\ \vdash .(1).*54·53·101.*121·23·11.&\supset \vdash .\text{Prop} \end{array}$

*121·305. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{1}\,\unicode{x2abd}\, P$

Dem. $\begin{array}{l} \vdash .*121·303.\supset \vdash :\text{Hp}.xP_{1}y.&\supset .xP_{\text{po}}y.\\ [*91·52] &\supset .(\exists z).xPz.zP_{*}y &\qquad \text{(1)}\\ \vdash .*121·304.*91·542.\supset \\ \vdash \colon\ldotp \text{Hp}.xP_{1}y.&\supset :xP_{\text{po}}z.zP_{*}y.\supset .z=y:\\ [*91*502] &\supset :xPz.zP_{*}y.\supset .z=y &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·306. $\vdash :P\in 1\rightarrow \text{Cls}.{\sim}(xP_{\text{po}}x).xPy.\supset .P(x\vdash\dashv y)=\iota ʻx\cup \iota ʻy.x\neq y$

Dem. $\begin{array}{l} \vdash .*91·542. &\supset \vdash :xP_{*}z.zP_{*}y.z\neq x.z\neq y.xPy.\supset :xP_{\text{po}}z.zP_{\text{po}}y.xPy:\\ [*34·1] &\supset :xP_{\text{po}}z.zP_{\text{po}}\mid \breve{P} x:\\ [*92·11] &\supset :P\in 1\rightarrow \text{Cls}.\supset .xP_{\text{po}}z.zP_{*}x:\\ [*91·574] &\supset :P\in 1\rightarrow \text{Cls}.\supset .xP_{\text{po}}x &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp xP_{*}z.zP_{*}y.\supset _{z}:z=x.\lor.z=y &\qquad \text{(2)}\\ \vdash .*121·23. &\supset \vdash :\text{Hp}.\supset .x,y\in P(x\vdash\dashv y) &\qquad \text{(3)}\\ \vdash .*91·502.& \supset \vdash :\text{Hp}.\supset .x\neq y &\qquad \text{(4)}\\ \vdash .(2).(3).(4).*121·103.\supset \vdash .\text{Prop} \end{array}$

*121·307. $\begin{align}&\vdash :P\in \text{Cls}\rightarrow 1.{\sim}(yP_{\text{po}}y).xPy.\supset .P(x\vdash\dashv y)=\iota ʻx\cup \iota ʻy.x\neq y\\ &[*121·306·143]\end{align}$

*121·308. $\begin{align}&\vdash :P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P\,\unicode{x2abd}\, P_{1}\\ &[*121·306·307·11.*54·101]\end{align}$

*121·31. $\vdash :P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{1}=P \quad[*121·305·308]$

Dem. $\begin{array}{l} \vdash .*121·11.*120·421.*101·14.\text{Transp}.&\supset \vdash :xP_{\nu }y.\supset .\exists !P(x\vdash\dashv y).\\ [*121·23] &\supset .xP_{*}y:\supset \vdash .\text{Prop} \end{array}$

If $\nu$ is not a cardinal, or if $\nu +_{c}1=\Lambda$ , $P_{\nu}=\dot{\Lambda}$ .

Dem. $\begin{array}{l} \vdash .*120·428.*121·11.\supset \vdash :\text{Hp}.xP_{\nu }y.&\supset .\text{Nc}ʻP(x\vdash\dashv y)>1.\\ [*117·55.*52·181.*121·23] &\supset .(\exists z).z\in P(x\vdash\dashv y).z\neq x.\\ [*121·103.*91·542] &\supset .(\exists z).xP_{\text{po}}z.zR_{*}y.\\ [*91·574] &\supset .xP_{\text{po}}y:\supset \vdash .\text{Prop} \end{array}$

*121·323. $\vdash :\nu >0.\supset .\text{D}ʻP_{\nu }\subset \text{D}ʻP.\text{ᗡ}ʻP_{\nu }\subset \text{ᗡ}ʻP \quad[*121·321.*91·504]$

*121·324. $\vdash .\text{D}ʻP_{\nu +_{c}1}\subset \text{D}ʻP.\text{ᗡ}ʻP_{\nu +_{c}1}\subset \text{ᗡ}ʻP$

Dem. $\begin{array}{l} \vdash .*121·273·323.\supset \vdash :\dot{\exists} !P_{\nu +_{c}1}.\supset .\text{D}ʻP_{\nu +_{c}1}\subset \text{D}ʻP.\text{ᗡ}ʻP_{\nu +_{c}1}\subset \text{ᗡ}ʻP &\qquad \text{(1)}\\ \vdash .(1).*33·241.\supset \vdash .\text{Prop} \end{array}$

*121·325. $\vdash :\dot{\exists} !P_{\mu }\dot{\cap} P_{\nu }.\supset .\mu =\nu$

Dem. $\begin{array}{l} \vdash .*121·11.&\supset \vdash :\text{Hp}.\supset .\exists !(\mu +_{c}1)\cap (\nu +_{c}1)\cap t_{0}ʻ\mu .\\ [*100·42.*110·4] &\supset .\exists !(\mu +_{c}1)\cap t_{0}ʻ\mu .(\mu +_{c}1)\cap t_{0}ʻ\mu =\nu +_{c}1.\\ [*120·311] &\supset .\mu =\nu :\supset \vdash .\text{Prop} \end{array}$

*121·326. $\vdash .\text{fin}ʻP\subset \text{finid}ʻP.\text{finid}ʻP-\iota ʻP_{0}\subset \text{fin}ʻP \quad[*121·12·121]$

*121·327. $\vdash :\dot{\exists} !P_{0}.\supset .\text{fin}ʻP=\text{finid}ʻP-\iota ʻP_{0}$

Dem. $\begin{array}{l} \vdash .*121·325.\text{Transp}.*121·121.\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in \text{fin}ʻP.\supset .R\neq P_{0} &\qquad \text{(1)}\\ \vdash .(1).*121·326.\supset \vdash .\text{Prop} \end{array}$

*121·33. $\begin{align}\vdash \colon\ldotp P\in 1\rightarrow \text{Cls}.\supset :&z\in P(x-y).\equiv .z\in P(x\dashv Pʻy):\\ &z\in P(x \unicode{x27dd} y).\equiv .z\in P(x\vdash\dashv Pʻy)\end{align}$

Dem. $\begin{array}{l} \vdash .*71·7.\supset \vdash \colon\ldotp \text{Hp}.\supset :zP_{*}(Pʻy).&\equiv .zP_*\mid Py.\\ [*91·52] &\equiv .zP_{\text{po}}y &\qquad \text{(1)}\\ \vdash .(1).*121·1·101·102·103.\supset \vdash .\text{Prop} \end{array}$

From the above proposition it follows that $P\in 1\rightarrow \text{Cls}.y\in \text{ᗡ}ʻP.\supset .P(x-y)=P(x\dashv Pʻy).P(x \unicode{x27dd} y)=P(x\vdash\dashv Pʻy).$

This does not follow unless $y\in \text{ᗡ}ʻP$ , because $\begin{aligned} P&(x\unicode{x2013}y)=P(x\dashv Pʻy).\supset .\text{E}!Pʻy,\\ \text{whereas}\qquad &z\in P(x\unicode{x2013}y).\equiv _{z}.z\in P(x\dashv Pʻy) \end{aligned}$ will always be true if $y{\sim}\in \text{ᗡ}ʻP$ , and therefore (when $P\in 1\rightarrow \text{Cls}$ ) if ${\sim}\text{E}!Pʻy$ .

*121·331. $\vdash \colon\ldotp P \in 1\rightarrow \text{Cls}.P_{\text{po}}\,\unicode{x2abd}\, J.\supset :xP_{\nu }(Pʻy).\equiv .xP_{\nu +_{c}1}y$

Dem. $\begin{array}{l} \vdash .*121·324.*71·16. &\supset \vdash \colon\ldotp \text{Hp}.\supset :xP_{\nu +_{c}1}y.\supset .\text{E}!Pʻy &\qquad \text{(1)}\\ \vdash .*121·33. &\supset \vdash :\text{Hp}.\text{E}!Pʻy.\supset .P(x \unicode{x27dd} y)=P(x\vdash\dashv Pʻy) &\qquad \text{(2)}\\ \vdash .*121·242·32.(2). &\supset \vdash :\text{Hp}(2).xP_{*}y.\supset .P(x\vdash\dashv y)=P(x\vdash\dashv Pʻy)\cup \iota ʻy &\qquad \text{(3)}\\ \vdash .*91·52. \supset \vdash :\text{Hp}.&\supset .{\sim}(yP_{*}\mid Py).\\ [*71·7] &\supset .{\sim}\{yP_{*} (Pʻy)\} .\\ [*121·103] &\supset .{\sim}\{y\in P(x\vdash\dashv Pʻy)\} &\qquad \text{(4)}\\ \vdash .(3).(4).*110·63.&\supset \vdash :\text{Hp}(3).\supset .\text{Nc}ʻP(x\vdash\dashv y)=\text{Nc}ʻP(x\vdash\dashv Pʻy)+_{c}1 &\qquad \text{(5)}\\ \vdash .(1).(5).*121·11·32.\supset \\ \vdash :\text{Hp}.xP_{\nu +_{c} 1}y.&\supset .(\nu +_{c} 1) +_{c} 1 = \text{Nc}ʻP(x\vdash\dashv Pʻy)+_{c} 1.\\ [*120·311.*121·27] &\supset . \nu +_{c} 1 = \text{Nc}ʻP(x \vdash\dashv Pʻy).\\ [*121·11] &\supset .xP_{\nu } (Pʻy) &\qquad \text{(6)}\\ \vdash .(5).*14·21.*121·11·32. &\supset \vdash : \text{Hp}.xP_{\nu } (Pʻy).\supset .\text{Nc}ʻP(x \vdash\dashv y)=(\nu +_{c} 1) +_{c} 1.\\ [*121·11] &\supset . xP_{\nu +_{c} 1}y &\qquad \text{(7)}\\ \vdash .(6).(7).\supset \vdash . \text{Prop} \end{array}$

*121·332. $\vdash : P \in 1 \rightarrow \text{Cls}. P_{\text{po}} \,\unicode{x2abd}\, J. \supset . P_{\nu +_{c} 1} = P_{\nu } \mid P \quad[*121·331]$

*121·333. $\vdash : P \in \text{Cls} \rightarrow 1. P_{\text{po}} \,\unicode{x2abd}\, J. \supset . P_{\nu +_{c} 1} = P \mid P_{\nu }$

*121·34. $\vdash : P \in 1 \rightarrow \text{Cls}. P_{\text{po}} \,\unicode{x2abd}\, J. \nu \in \text{NC induct}. \supset . P_{\nu } \in 1 \rightarrow \text{Cls}$

Dem. $\begin{array}{l} \vdash . *121·3. &\supset \vdash . P_{0} \in 1 \rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *121·332. &\supset \vdash \colon\ldotp \text{Hp}. \supset : P_{\nu } \in 1 \rightarrow \text{Cls}. \supset . P_{\nu +_{c} 1} \in 1 \rightarrow \text{Cls} &\qquad \text{(2)}\\ \vdash . (1).(2). *120·11.\supset \vdash . \text{Prop} \end{array}$

*121·341. $\vdash : P \in \text{Cls} \rightarrow 1. P_{\text{po}} \,\unicode{x2abd}\, J. \nu \in \text{NC induct}. \supset . P_{\nu } \in \text{Cls} \rightarrow 1$

*121·342. $\vdash : P \in 1 \rightarrow 1. P_{\text{po}} \,\unicode{x2abd}\, J. \nu \in \text{NC induct}. \supset . P_{\nu } \in 1 \rightarrow 1 \quad[*121·34·341]$

*121·35. $\vdash : P \in 1 \rightarrow \text{Cls}. P_{\text{po}} \,\unicode{x2abd}\, J. \mu , \nu \in \text{NC induct}. \supset . P_{\mu } \mid P_{\nu } = P_{\mu +_{c} \nu }$

Dem. $\begin{array}{l} \vdash . *50·62. *121·302·322. &\supset \vdash : \text{Hp}. \supset . P_{\mu } \mid P_{0} = P_{\mu +_{c} 0} &\qquad \text{(1)}\\ \vdash . *121·332. &\supset \vdash \colon\ldotp \text{Hp}. \supset : \mu ,\nu \in \text{NC induct}. P_{\mu } \mid P_{\nu } = P_{\mu +_{c} \nu }. \supset .\\ &P_{\mu } \mid P_{\nu +_{c} 1} = P_{\mu +_{c} \nu } \mid P\\ [*121·332] &= P_{\mu +_{c} \nu +_{c} 1} &\qquad \text{(2)}\\ \vdash . (1).(2). *120·13.\supset \vdash . \text{Prop} \end{array}$

*121·351. $\vdash : P \in \text{Cls} \rightarrow 1. P_{\text{po}} \,\unicode{x2abd}\, J. \mu , \nu \in \text{NC induct}. \supset . P_{\mu } \mid P_{\nu } = P_{\mu +_{c} \nu }$

*121·352. $\begin{align}\vdash : P \in (1 \rightarrow \text{Cls}) \cup (\text{Cls} \rightarrow 1). &P_{\text{po}} \,\unicode{x2abd}\, J. \mu , \nu \in \text{NC induct}. \supset .\\ &P_{\mu } \mid P_{\nu } = P_{\nu } \mid P_{\mu } \quad[*121·35·351.*110·51]\end{align}$

*121·36. $\begin{align}\vdash : P \in (1 \rightarrow \text{Cls}) \cup (\text{Cls} \rightarrow 1). &P_{\text{po}} \,\unicode{x2abd}\, J. \mu , \nu \in \text{NC induct} -\iota ʻ0.\supset .\\ &(P_{\mu })_{\nu } = P_{\mu \times _{c} \nu }\end{align}$

Dem. $\begin{array}{l} \vdash . *121·321.\supset \vdash : \text{Hp}. &\supset . P_{\mu }\,\unicode{x2abd}\, P_{\text{po}}.\\ [*91·59·601] &\supset . (P_{\mu })_{\text{po}} \,\unicode{x2abd}\, J. &\qquad \text{(1)}\\ [*121·31·34·341] &\supset .(P_{\mu })_1 = P_{\mu } &\qquad \text{(2)}\\ \vdash . *121·332·333·352 . (1). \supset \\ \vdash \colon\ldotp \text{Hp}. \supset : (P_{\mu })_{\nu +_{c} 1} &= (P_{\mu })_{\nu } \mid P_{\mu } :\\ [*34·27] \supset : (P_{\mu })_{\nu } = P_{\mu \times _{c} \nu } . \supset . (P_{\mu })_{\nu +_{c} 1} &= P_{\mu \times _{c} \nu } \mid P_{\mu }\\ [*121·35·351] &= P_{(\mu \times _{c} \nu ) +_{c} \mu}\\ [*113·671] &= P_{\mu \times _{c} (\nu +_{c} 1)} &\qquad \text{(3)}\\ \vdash . (2). (3). *120·47. \supset \vdash . \text{Prop} \end{array}$

*121·361. $\begin{align}\vdash :P\in (1\rightarrow \text{Cls})\cup (\text{Cls}\rightarrow 1).&P_{\text{po}}\,\unicode{x2abd}\, J.\mu ,\nu \in \text{NC induct}-\iota ʻ0.\supset .\\ &(P_{\mu })_{\nu }=(P_{\nu })_{\mu } [*121·36.*113·27]\end{align}$

*121·37. $\vdash :P\in \text{Cls}\rightarrow 1.y\in P(x\vdash\dashv z).\supset .P(x\vdash\dashv z)=P(x\vdash\dashv y)\cup P(y\vdash\dashv z)$

Dem. $\begin{array}{l} \vdash .*121·103.&\supset \vdash :\text{Hp}.\supset .xP_{*}y.yP_{*}z &\qquad \text{(1)}\\ \vdash .(1).*121·103.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :w\in P(x\vdash\dashv z).\equiv .xP_{*}w.wP_{*}z.xP_{*}y.yP_{*}z &\qquad \text{(2)}\\ \vdash .*96·302.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp xP_{*}w.xP_{*}y.\supset :wP_{*}y.\lor.yP_{*}w &\qquad \text{(3)}\\ \vdash .(2).(3).*4·73.\supset \\ \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp w\in P(x\vdash\dashv z).\equiv :xP_{*}w.wP_{*}z.xP_{*}y.yP_{*}z.wP_{*}y.\lor.\\ &xP_{*}w.wP_{*}z.xP_{*}y.yP_{*}z.yP_{*}w &\qquad \text{(4)}\\ \vdash .*90·17.*4·73.\supset \vdash :wP_{*}y.yP_{*}z.&\equiv .wP_{*}z.wP_{*}y.yP_{*}z:\\ &yP_{*}w.wP_{*}z.\equiv .yP_{*}z.wP_{*}z.yP_{*}w &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp w\in P(x\vdash\dashv z).\equiv :xP_{*}w.xP_{*}y.yP_{*}z.wP_{*}y.\lor.\\ &xP_{*}w.wP_{*}z.xP_{*}y.yP_{*}w:\\ [*90·17.*4·73] &\equiv:xP_{*}w.wP_{*}y.yP_{*}z.\lor.xP_{*}y.yP_{*}w.wP_{*}z:\\ [(1).*4·73] &\equiv :xP_{*}w.wP_{*}y.\lor.yP_{*}w.wP_{*}z:\\ [*121·103] &\equiv :w\in P(x\vdash\dashv y)\cup P(y\vdash\dashv z)\colon\colon \supset \vdash .\text{Prop} \end{array}$

*121·371. $\begin{align}\vdash :&P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).y\in P(x\vdash\dashv z).\supset .\\ &P(x\vdash\dashv z)=P(x\vdash\dashv y)\cup P(y\vdash\dashv z)=P(x \unicode{x27dd} y)\cup P(y\vdash\dashv z)\\ &=P(x\vdash\dashv y)\cup P(y\dashv z) \quad [\text{Proof as in *121·37}]\end{align}$

*121·372. $\begin{align}\vdash :&P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).y\in P(x\dashv z).\supset .\\ &P(x\dashv z)=P(x\dashv y)\cup P(y\dashv z)=P(x\dashv y)\cup P(y\vdash\dashv z)\end{align}$

*121·373. $\begin{align}\vdash :&P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).y\in P(x \unicode{x27dd} z).\supset .\\ &P(x \unicode{x27dd} z)=P(x \unicode{x27dd} y)\cup P(y \unicode{x27dd} z)= P(x\vdash\dashv y)\cup P(y \unicode{x27dd} z)\end{align}$

*121·374. $\begin{align}\vdash :&P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).y\in P(x\unicode{x2013}z).\supset .\\ &P(x\unicode{x2013}z)=P(x\dashv y)\cup P(y-z)=P(x\unicode{x2013}y)\cup P(y \unicode{x27dd} z)\\ &=P(x\dashv y)\cup P(y \unicode{x27dd} z)\end{align}$

*121·38. $\vdash :R\in \text{Cls}\rightarrow 1.xR_{\text{po}}x.\supset .R(x\vdash\dashv x)=\overleftarrow{R}_{*}ʻx \quad[*97·5]$

*121·381. $\vdash :R\in 1\rightarrow \text{Cls}.xR_{\text{po}}x.\supset .R(x\vdash\dashv x)=\overrightarrow{R}_{*}ʻx \quad[*97·501]$

*121·382. $\begin{align}\vdash :&R\in \text{Cls}\rightarrow 1.xR_{\text{po}}x.xR_{\text{po}}y.\supset .\\ &R(x\vdash\dashv x)=R(x\vdash\dashv y)=\overleftarrow{R}_{*}ʻx= R(y\vdash\dashv y) \quad[*97·5.*91·56]\end{align}$

*121·383. $\begin{align}\vdash :&R\in 1\rightarrow \text{Cls}.xR_{\text{po}}x.yR_{\text{po}}x.\supset .\\ &R(x\vdash\dashv x)=R(y\vdash\dashv x)=\overrightarrow{R}_{*}ʻx=R(y\vdash\dashv y)\end{align}$

*121·384. $\begin{align}\vdash :&R\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).xR_{\text{po}}x.y\in R(x\vdash\dashv x).\supset .\\ &R(x\vdash\dashv x)= R(x\vdash\dashv y)=R(y\vdash\dashv x)=R(y\vdash\dashv y) \quad[*121·382·383]\end{align}$

*121·39. $\vdash \colon\ldotp R\in \text{Cls}\rightarrow 1.\supset :R(x\vdash\dashv y)\subset R(x\vdash\dashv z).\lor.R(x\vdash\dashv z)\subset R(x\vdash\dashv y)$

Dem. $\begin{array}{l} \vdash .*96·302. &\supset \vdash \colon\ldotp \text{Hp}.xR_{*}y.xR_{*}z.\supset :yR_{*}z.\lor.zR_{*}y &\qquad \text{(1)}\\ \vdash .*121·37. &\supset \vdash :\text{Hp}.xR_{*}y.yR_{*}z.\supset .R(x\vdash\dashv y)\subset R(x\vdash\dashv z) &\qquad \text{(2)}\\ \vdash .*121·37. &\supset \vdash :\text{Hp}.xR_{*}z.zR_{*}y.\supset .R(x\vdash\dashv z)\subset R(x\vdash\dashv y) &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash \colon\ldotp \text{Hp}.xR_{*}y.xR_{*}z.\supset :\\ &R(x\vdash\dashv y)\subset R(x\vdash\dashv z).\lor.R(x\vdash\dashv z)\subset R(x\vdash\dashv y) &\qquad \text{(4)}\\ \vdash .*121·23. &\supset \vdash :{\sim}(xR_{*}y).\supset .R(x\vdash\dashv y)=\Lambda .\\ [*24·12] &\supset .R(x\vdash\dashv y)\subset R(x\vdash\dashv z) &\qquad \text{(5)}\\ \vdash .(5)\frac{z,\,y}{y,\,z}. &\supset \vdash :{\sim}(xR_{*}z).\supset .R(x\vdash\dashv z)\subset R(x\vdash\dashv y) &\qquad \text{(6)}\\ \vdash .(4).(5).(6).\supset \vdash .\text{Prop} \end{array}$

The following series of propositions are concerned with proving *121·47, i.e. $R\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).\supset .R(x\vdash\dashv z)\in \text{Cls induct}.$ The proof for $R\in 1\rightarrow \text{Cls}$ follows from that for $R\in \text{Cls}\rightarrow 1$ by *121·143. Confining ourselves, therefore, to $R\in \text{Cls}\rightarrow 1$ , we proceed as follows.

We prove first that, starting from z and going backwards, each new step adds only one term (which may not be distinct from all its predecessors); i.e. we have $R\in \text{Cls}\rightarrow 1.xRy.yR_{*}z.\supset .R(x\vdash\dashv z)=\iota ʻx\cup R(y\vdash\dashv z).$ From this it follows by induction that if $R(z\vdash\dashv z)$ is an inductive class, so is $R(x\vdash\dashv z)$ . Thus we only have to prove that $R(z\vdash\dashv z)$ is an inductive class. Here we must distinguish two cases, according as ${\sim}(zR_{\text{po}}z)$ or $zR_{\text{po}}z$ . In the former case, we have $\exists !R(z\vdash\dashv z).\supset .R(z\vdash\dashv z)=\iota ʻz,$ whence $R(z\vdash\dashv z)$ is an inductive class, and therefore so is $R(x\vdash\dashv z)$ .

But in the latter case, when $zR_{\text{po}}z$ , the matter is more difficult. In this case, $z$ is a member of a cycle, the cycle being $R(z\vdash\dashv z)$ . We have to prove that this cycle must be an inductive class. Given $xR_{*}z$ , $x$ will be a member of this cycle if $xR_{\text{po}}x$ , and may be at the end of the tail of a $Q$ , if ${\sim}(xR_{\text{po}}x)$ . (Cf. *96.)

By *96·453, we know that $R$ is $1\rightarrow 1$ when confined to $R(z\vdash\dashv z)$ . Hence[Pg 244] in $R(z\vdash\dashv z)$ , $z$ has a unique predecessor, say $a$ . Assume $a\neq z$ . We then imagine a barrier placed between $a$ and $z$ , i.e. we construct a relation $S$ which is to hold between any two consecutive members of $R(z\vdash\dashv z)$ except $a$ and $z$ . Putting $\alpha=R(z\vdash\dashv z)-\iota ʻa$ , we have $S=\alpha \upharpoonleft R$ . Then the relation $S$ generates an open series consisting of all the terms of $R(z\vdash\dashv z)$ ; i.e. we have ${\sim}(aS_{\text{po}}a).S(z\vdash\dashv a)=R(z\vdash\dashv z).$ Hence, by our previous case, since $S(z\vdash\dashv a)$ is an inductive class, so is $R(z\vdash\dashv z)$ .

If $a = z$ , then by *96·33 the cycle reduces to the single term $z$ , and therefore $R(z\vdash\dashv z)$ is still an inductive class.

Hence $R(z\vdash\dashv z)$ , and therefore $R(x\vdash\dashv z)$ , is always an inductive class when $R\in \text{Cls}\rightarrow 1$ , which was to be proved.

*121·4. $\vdash :R\in \text{Cls}\rightarrow 1.xRy.yR_{*}z.\supset .R(x\vdash\dashv z)=\iota ʻx\cup R(y\vdash\dashv z)$

Dem. $\begin{array}{l} \vdash .*90·311.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp xR_{*}w.&\equiv :x=w.\lor.xR\mid R_{*}w:\\ [*71·701.\text{Hp}] &\equiv :x=w.\lor.yR_{*}w &\qquad \text{(1)}\\ \vdash .*90·172.&\supset \vdash \colon\ldotp \text{Hp}.\supset :x=w.\supset .wR_{*}z &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp xR_{*}w.wR_{*}z.&\equiv :x=w.\lor.yR_{*}w.wR_{*}z &\qquad \text{(3)}\\ \vdash .(3).*121·103.\supset \vdash .\text{Prop} \end{array}$

*121·41. $\vdash :R\in \text{Cls}\rightarrow 1.R(z\vdash\dashv z)\in \text{Cls induct}.\supset .R(x\vdash\dashv z)\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*121·4.*120·251.*90·172.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &yR_{*}z.R(y\vdash\dashv z)\in \text{Cls induct}.xRy.\supset .xR_{*}z.R(x\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*90·112 \frac{\breve{R}}{R}.&\supset \vdash :\text{Hp}.xR_{*}z.\supset .R(x\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .*121·23.*120·212.&\supset \vdash :{\sim}(xR_{*}z).\supset .R(x\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

In virtue of this proposition, we have only to prove $R(z\vdash\dashv z)\in \text{Cls induct}$ . This is obvious when ${\sim}(zR_{\text{po}}z)$ , for then either $R(z\vdash\dashv z)=\iotaʻz$ or $R(z\vdash\dashv z=\Lambda$ . But when $zR_{\text{po}}z$ , it is more difficult.

*121·42. $\vdash :R\in \text{Cls}\rightarrow 1.{\sim}(zR_{\text{po}}z).\supset .R(x\vdash\dashv z)\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*121·303.\text{Transp}.*120·441.&\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻR(z\vdash\dashv z)\leq 1.\\ [*120·48] &\supset .\text{Nc}ʻR(z\vdash\dashv z)\in \text{NC induct}.\\ [*120·211] & \supset .R(z\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*121·41.\supset \vdash .\text{Prop} \end{array}$

*121·43. $\vdash :R\in \text{Cls}\rightarrow 1.zR_{\text{po}}z.\supset .\text{E}!\breve{\iota} ʻ(\overrightarrow{R}ʻz\cap \overleftarrow{R}_{*}ʻz)$

Dem. $\begin{array}{l} \vdash .*91·52. \supset \vdash :\text{Hp}.&\supset .(\exists a).zR_{*}a.aRz &\qquad \text{(1)}\\ \vdash .*96·453. &\supset \vdash :\text{Hp}.\supset .(\overleftarrow{R}_{*}ʻz)\upharpoonleft R\in 1\rightarrow 1.\\ [*71·122] &\supset .\hat{a}(zR_{*}a.aRz)\in 1\cup \iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\text{Hp}.&\supset .\hat{a}(zR_{*}a.aRz)\in 1.\\ [*52·15] &\supset .\text{E}!\breve{\iota} ʻ(\overrightarrow{R}ʻz\cap \overleftarrow{R}_{*}ʻz):\supset \vdash .\text{Prop} \end{array}$

*121·431. $\begin{align}\vdash :R\in \text{Cls}\rightarrow 1.zR_{\text{po}}z.a=\breve{\iota} ʻ(\overrightarrow{R}ʻz\cap \overleftarrow{R}_{*}ʻz).&\alpha =\overleftarrow{R}_{*}ʻz-\iota ʻa.\\ &S=\alpha \upharpoonleft R.\supset .{\sim}(aS_{\text{po}}a)\end{align}$

Dem. $\begin{array}{l} \vdash .*35·61. \supset \vdash :\text{Hp}.&\supset .a{\sim}\in \text{D}ʻS.\\ [*91·504] &\supset .a{\sim}\in \text{D}ʻS_{\text{po}}.\\ [*33·14] &\supset .{\sim}(aS_{\text{po}}a):\supset \vdash .\text{Prop} \end{array}$

*121·432. $\vdash :\text{Hp}*121·431.\supset .S(z\vdash\dashv a)\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*71·261.\supset \vdash :\text{Hp}.\supset .S\in \text{Cls}\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*121·431·42.\supset \vdash .\text{Prop} \end{array}$

*121·433. $\vdash :\text{Hp}*121·431.z\neq a.\supset .S(z\vdash\dashv a)=\overleftarrow{R}_{*}ʻz=R(z\vdash\dashv z)$

Dem. $\begin{array}{l} \vdash .*96·11. \supset \vdash \colon\ldotp \text{Hp}.&\supset :zS_{*}w.\supset .zR_{*}w &\qquad \text{(1)}\\ \vdash .*51·3.*91·504. \supset \vdash \colon\ldotp \text{Hp}.&\supset :z\in a.z\in \text{D}ʻR:\\ [*35·61] &\supset :z\in \text{D}ʻS:\\ [*90·12] &\supset :zS_{*}z &\qquad \text{(2)}\\ \vdash .(1).*90·16. \supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp zS_{*}w.wRy.\supset :w\in \alpha \cup \iota ʻa.wRy:\\ [*35·1] &\supset :wSy.\lor.w=a.wRy:\\ [\text{Hp}.*71·171] &\supset :wSy.\lor.y=z:\\ [*90·16·17.(2)] &\supset :zS_{*}y &\qquad \text{(3)}\\ \vdash .(2).(3).*90·112. \supset \vdash \colon\ldotp \text{Hp}.&\supset :zR_{*}w.\supset .zS_{*}w: &\qquad \text{(4)}\\ [\text{Hp}] &\supset \vdash :zS_{*}a &\qquad \text{(5)}\\ \vdash .*71·171. \supset \vdash :\text{Hp}.&aRy.\supset .y=z &\qquad \text{(6)}\\ \vdash .*91·542·504.*35·61. &\supset \vdash \colon\ldotp \text{Hp}.\supset :wS_{*}a.w\neq a.wRy.\supset .wS_{\text{po}}a.wSy.\\ [*92·111] &\supset .yS_{*}a &\qquad \text{(7)}\\ \vdash .(5).(6).(7). &\supset \vdash \colon\ldotp \text{Hp}.\supset :wS_{*}a.wRy.\supset .yS_{*}a &\qquad \text{(8)}\\ \vdash .(5).(8).*90·112. &\supset \vdash \colon\ldotp \text{Hp}.\supset :zR_{*}y.\supset .yS_{*}a &\qquad \text{(9)}\\ \vdash .(4).(9). &\supset \vdash \colon\ldotp \text{Hp}.\supset :zR_{*}y.\supset .zS_{*}y.yS_{*}a &\qquad \text{(10)}\\ \vdash .(1) \frac{y}{w}.(10). &\supset \vdash \colon\ldotp \text{Hp}.\supset :zS_{*}y.yS_{*}a.\equiv .zR_{*}y:\\ [*121·103] \supset :S(z\vdash\dashv a)&=\overleftarrow{R}_{*}ʻz\\ [*121·38] &=R(z\vdash\dashv z)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*121·434. $\vdash :\text{Hp}*121·431.z=a.\supset .\overleftarrow{R}_{*}ʻz=R(z\vdash\dashv z)=\iota ʻz$

Dem. $\begin{array}{l} \vdash .*32·18.&\supset \vdash :\text{Hp}.\supset .zRz.\\ [*96·33] &\supset .\overleftarrow{R}_{*}ʻz=\iota ʻz. &\qquad \text{(1)}\\ [*121·38] &\supset .R(z\vdash\dashv z)=\iota ʻz &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·44. $\vdash :R\in \text{Cls}\rightarrow 1.zR_{\text{po}}z.\supset .R(z\vdash\dashv z)\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*121·43·432·433.\supset \\ \vdash :\text{Hp}.z\neq \breve{\iota} ʻ(\overrightarrow{R}ʻz\cap \overleftarrow{R}_{*}ʻz).\supset .R(z\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*121·434.*120·213.\supset \\ \vdash :\text{Hp}.z=\breve{\iota} ʻ(\overrightarrow{R}ʻz\cap \overleftarrow{R}_{*}ʻz).\supset .R(z\vdash\dashv z)\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·441. $\vdash :R\in \text{Cls}\rightarrow 1.zR_{\text{po}}z.\supset .R(x\vdash\dashv z)\in \text{Cls induct} \quad[*121·44·41]$

*121·45. $\vdash :R\in \text{Cls}\rightarrow 1.\supset .R(x\vdash\dashv z)\in \text{Cls induct} \quad[*121·42·441]$

*121·46. $\vdash :R\in 1\rightarrow \text{Cls}.\supset .R(x\vdash\dashv z)\in \text{Cls induct} \quad[*121·45·143]$

*121·47. $\vdash :R\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).\supset .R(x\vdash\dashv z)\in \text{Cls induct} \quad[*121·45·46]$

*121·48. $\begin{align}\vdash \colon\ldotp &R\in \text{Cls}\rightarrow 1.\supset :\\ &\text{Nc}ʻR(x\vdash\dashv y)<\text{Nc}ʻR(x\vdash\dashv z).\equiv .\exists !R(x\vdash\dashv z)-R(x\vdash\dashv y)\end{align}$

Dem. $\begin{array}{l} \vdash .*121·39.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !R(x\vdash\dashv z)-R(x\vdash\dashv y).\equiv .\\ &R(x\vdash\dashv y)\subset R(x\vdash\dashv z).R(x\vdash\dashv y)\neq R(x\vdash\dashv z).\\ [*120·7.*121·45] &\supset .\text{Nc}ʻR(x\vdash\dashv y)<\text{Nc}ʻR(x\vdash\dashv z) &\qquad \text{(1)}\\ \vdash .*117·222·29.&\supset \vdash :\text{Nc}ʻR(x\vdash\dashv y)<\text{Nc}ʻR(x\vdash\dashv z).\supset .\\ &{\sim}\{R(x\vdash\dashv z)\subset R(x\vdash\dashv y)\}.\\ [*24·55] &\supset .\exists !R(x\vdash\dashv z)-R(x\vdash\dashv y) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·481. $\begin{align}\vdash \colon\ldotp R\in \text{Cls}\rightarrow 1.\supset :\text{Nc}ʻR(x\vdash\dashv y)\leq \text{Nc}ʻ&R(x\vdash\dashv z).\equiv .\\ &R(x\vdash\dashv y)\subset R(x\vdash\dashv z)\end{align}$

Dem. $\begin{array}{l} \vdash .*121·45.*120·441.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{Nc}ʻR(x\vdash\dashv y)\leq \text{Nc}ʻR(x\vdash\dashv z).&\equiv .{\sim}\{\text{Nc}ʻR(x\vdash\dashv z)<\text{Nc}ʻR(x\vdash\dashv y)\}.\\ [*121·48] &\equiv .{\sim}\exists !R(x\vdash\dashv y)-R(x\vdash\dashv z).\\ [*24·55] &\equiv .R(x\vdash\dashv y)\subset R(x\vdash\dashv z)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The above proposition is used in the proof of *122·35, which is an important proposition in the theory of progressions.

The following propositions are concerned with the identification of such relations as $P_{\nu }$ with powers of $P$ in the sense of *91.

*121·5. $\begin{align}\vdash :P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).&P_{\text{po}}\,\unicode{x2abd}\, J.\supset .\\ &\text{finid}ʻP=\text{Potid}ʻP.\text{fin}ʻP=\text{Pot}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*121·302·31. \supset \vdash :\text{Hp}.&\supset .P_{0}=I\upharpoonright CʻP.P_{1}=P &\qquad \text{(1)}\\ \vdash .(1).*121·332·333·352.&\supset \vdash \colon\ldotp \text{Hp}.\nu \in \text{NC induct}.\supset :P_{\nu +_{c}1}=P_{\nu }\mid P: &\qquad \text{(2)}\\ [*91·341] &\supset :P_{\nu }\in \text{Potid}ʻP.\supset .P_{\nu +_{c}1}\in \text{Potid}ʻP:P_{\nu }\in \text{Pot}ʻP.\supset .P_{\nu +_{c}1}\in \text{Pot}ʻP &\qquad \text{(3)}\\ \vdash .(1).*91·35.&\supset \vdash :\text{Hp}.\supset .P_{0}\in \text{Potid}ʻP.P_{1}\in \text{Pot}ʻP &\qquad \text{(4)}\\ \vdash .(3).(4).*120·13·47.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\nu \in \text{NC induct}.\supset .P_{\nu }\in \text{Potid}ʻP:\\ &\nu \in \text{NC induct}-\iota ʻ0.\supset .P_{\nu }\in \text{Pot}ʻP:\\ [*121·12·121] &\supset :\text{finid}ʻP\subset \text{Potid}ʻP.\text{fin}ʻP\subset \text{Pot}ʻP &\qquad \text{(5)}\\ \vdash .(2).*121·121.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\nu \in \text{NC induct}.\supset .P_{\nu }\mid P\in \text{fin}ʻP:\\ [*121·12] & \supset :Q\in \text{finid}ʻP.\supset .Q\mid P\in \text{fin}ʻP:\\ [(1).*91·17·171] & \supset :\text{Potid}ʻP\subset \text{finid}ʻP.\text{Pot}ʻP\subset \text{fin}ʻP &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*121·501. $\begin{align}\vdash :P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).P_{\text{po}}\,\unicode{x2abd}\, &J.\dot{\exists} !P.\supset .\\ &\text{Pot}ʻP=\text{finid}ʻP-\iota ʻP_{0}=\text{fin}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*121·302.\supset \vdash :\text{Hp}.\supset .\dot{\exists} !P_{0} &\qquad \text{(1)}\\ \vdash .(1).*121·5·327.\supset \vdash .\text{Prop} \end{array}$

*121·502. $\begin{align}\vdash :P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).P_{\text{po}}&\,\unicode{x2abd}\, J.\supset .\\ &\dot{s} ʻ(\text{finid}ʻP-\iota ʻP_{0})=P_{\text{po}}=\dot{s} ʻ\text{fin}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*91·504.*33·24.*121·5.\supset \vdash :P=\dot{\Lambda} .\supset .\dot{s} ʻ(\text{finid}ʻP-\iota ʻP_{0})=\dot{\Lambda} =P_{\text{po}} &\qquad \text{(1)}\\ \vdash .(1).*121·501·5.\supset \vdash .\text{Prop} \end{array}$

*121·51. $\vdash :P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{2}=P^{2}.P_{3}=P^{3}.\text{etc}.$

Dem. $\begin{array}{l} \vdash .*121·31. \supset \vdash :\text{Hp}.&\supset .P_{1}=P &\qquad \text{(1)}\\ \vdash .*121·332·333. \supset \vdash :\text{Hp}.\supset .P_{2}&=P_{1}\mid P_{1}\\ [(1)] & =P^{2} &\qquad \text{(2)}\\ \vdash .*121·332·333·352. \supset \vdash :\text{Hp}.\supset .P_{3}&=P_{2}\mid P_{1}\\ [(1).(2)] &=P^{3} &\qquad \text{(3)}\\ \vdash .(2).(3). \text{etc.} .\supset \vdash .\text{Prop} \end{array}$

*121·52. $\begin{align}&\vdash :P\in (\text{Cls}\rightarrow 1)\cup (1\rightarrow \text{Cls}).P_{\text{po}}\,\unicode{x2abd}\, J.\supset .\dot{s} ʻ\text{finid}ʻP=P_{*}\\ &[*121·5.*91·55]\end{align}$

We shall at a later stage (*301) give a general definition of $P^\nu$ . When this definition has been introduced, we shall be able to prove, with the hypothesis of *121·51, $\nu \in \text{NC induct}.\supset .P_{\nu }=P^\nu .$ The definition of $P^\nu$ is postponed on account of various complications which render a general definition of $P^\nu$ difficult. The chief difficulty arises when[Pg 248] $\dot{\exists} !P\dot{\cap} I$ . Thus suppose we have $yPy$ ; we shall also have $yP^{2}y$ , $yP^{3}y$ , etc. Hence if we have $xPy$ , we have $\nu \in \text{NC induct}-\iota ʻ0.\supset _{\nu }.xP^\nu y.$ Again, suppose this case excluded, but suppose $(\exists \mu ,y).\mu \in \text{NC induct}.y\in P(x\vdash\dashv z).yP^\mu y .$ Then we shall have $\nu \in \text{NC induct}-\iota ʻ0-\iota ʻ\Lambda .\supset .yP^{\mu \times _{c}\nu }y.$ Thus the general definition of $P^\nu$ has to be complicated, except when $P_{\text{po}}\,\unicode{x2abd}\, J$ .

The following propositions are concerned with the series of relations $P_{\nu }$ and the series of terms $\nu _{P}$ . The relation $P_{\nu }$ holds between two terms (roughly speaking) when it requires $\nu$ steps to get from the first to the second; the term $\nu _{P}$ is the $\nu$ th term starting from $BʻP$ , which, when it exists, is $1_{P}$ . In order that $\nu _{P}$ should exist, it is necessary that $BʻP$ should exist, and that there should be just one term $x$ in the field of $P$ such that the interval from $BʻP$ to $x$ (both included) consists of $\nu$ terms. When this is the case for all inductive cardinals from 1 to $\nu$ , we can say that $P$ generates a series starting from $BʻP$ and having at least $\nu$ terms, each correlated with one of the cardinals in the interval from 1 to $\nu$ , both included; i.e. the series has a $\mu$ th term, whenever $1\leq \mu \leq \nu$ . If this holds for all inductive values of $\nu$ , the family of $BʻP$ is a progression[9]. (It will be observed that all such terms as $\nu _{P}$ belong to the family of $BʻP$ , which need not form the whole field of $P$ .)

*121·6. $\vdash \colon\ldotp \nu \neq 0.\supset .f(\nu _{P}).\equiv .f[\breve{\iota} ʻ\hat{y} \{\text{N}_{0}\text{c}ʻP(BʻP\vdash\dashv y)=\nu\}]$

Dem. $\begin{array}{l} \vdash .*121·11.*120·414·416.\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ f[\breve{\iota} ʻ\hat{y} \{\text{Nc}ʻP (BʻP \vdash\dashv y) = \nu\}] . &\equiv . f[\breve{\iota} ʻ\hat{y} \{(BʻP)P_{\nu -_{c}1}y\}].\\ [*121·13] &\equiv.f(\nu _{P}):\supset \vdash .\text{Prop} \end{array}$

*121·601. $\vdash :\text{E}!BʻP.\supset .BʻP=1_{P}.{\sim}{(BʻP)P_{\text{po}}(BʻP)}$

Dem. $\begin{array}{l} \vdash .*91·504.*93·1.&\supset \vdash .{\sim}\{(BʻP)P_{\text{po}}(BʻP)\}. &\qquad \text{(1)}\\ [*121·301] \supset \vdash \colon\ldotp \text{E}!BʻP.&\supset :(BʻP)P_{0}y.\equiv _{y}.BʻP=y:\\ [*31·17] &\supset :BʻP=\breve{P} _{0}ʻBʻP:\\ [*121·13] &\supset :BʻP=1_{P} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·602. $\vdash :\text{E}!BʻP.P\in 1\rightarrow 1.\supset \breve{P} ʻBʻP=2_{P}$

Dem. $\begin{array}{l} \vdash .*121·306·601.&\supset \vdash :\text{Hp}.\supset .P(BʻP\vdash\dashv \breve{P} ʻBʻP)\in 2 &\qquad \text{(1)}\\ \vdash .*121·23·601.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp (BʻP)P_{\text{po}}y.\supset .BʻP,y\in P(BʻP\vdash\dashv y).BʻP\neq y\colon\ldotp \\ [*54·53.*121·303] \supset \colon\ldotp P(BʻP\vdash\dashv y)\in 2.&\supset :P(BʻP\vdash\dashv y)=\iota ʻBʻP\cup \iota ʻy.(BʻP)P_{\text{po}}y:\\ [*92·111] &\supset :(\breve{P} ʻBʻP)P_{*}y.P(BʻP\vdash\dashv y)=\iota ʻBʻP\cup \iota ʻy:\\ [*121·103·601] &\supset :\breve{P} ʻBʻP\in \iota ʻBʻP\cup \iota ʻy.\breve{P} ʻBʻP\neq BʻP:\\ [*51·232] &\supset :y=\breve{P} ʻBʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*121·6.\supset \vdash .\text{Prop} \end{array}$

*121·61. $\begin{align}\vdash :P\in 1\rightarrow \text{Cls}.P_{\text{po}}\,\unicode{x2abd}\, J.x\in &sʻ\text{gen}ʻP.\supset .\\ &(\exists a,\nu ).a BP.\nu \in \text{NC induct}.a P_{\nu }x\end{align}$

Dem. $\begin{array}{l} \vdash .*93·36. &\supset \vdash \colon\ldotp P\in 1\rightarrow \text{Cls}.x\in sʻ\text{gen}ʻP.\supset .(\exists a).a BP.a P_{*}x &\qquad \text{(1)}\\ \vdash .*121·52. &\supset \vdash \colon\ldotp P\in 1\rightarrow \text{Cls}.P_{\text{po}}\,\unicode{x2abd}\, J.\supset :a P_{*}x.\equiv .a(\dot{s} ʻ\text{finid}ʻP)x &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{Hp}.\supset .(\exists a).\alpha BP.a (\dot{s} ʻ\text{finid}ʻP)x.\\ [*121·12] &\supset .(\exists a,\nu ).a BP.\nu \in \text{NC induct}.a P_{\nu }x:\supset \vdash .\text{Prop} \end{array}$

*121·62. $\begin{align}\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.(BʻP)&P_{*}x.\supset .\\ &(\exists \nu ).\nu \in \text{NC induct}-\iota ʻ0.x=\nu _{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*121·52. \supset \vdash :\text{Hp}.&\supset .(BʻP)(\dot{s} ʻ\text{finid}ʻP)x.\\ [*121·12] &\supset .(\exists \nu ).\nu \in \text{NC induct}.(BʻP)P_{\nu }x &\qquad \text{(1)}\\ \vdash .*121·341.&\supset \vdash :\text{Hp}.\nu \in \text{NC induct}.\supset .P_{\nu }\in \text{Cls}\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\text{Hp}.&\supset .(\exists \nu ).\nu \in \text{NC induct}.x=\breve{P} _{\nu }ʻBʻP.\\ [*121·13] &\supset .(\exists \nu ).\nu \in \text{NC induct}.x=(\nu +_{c}1)_P.\\ [*120·471] &\supset .(\exists \mu ).\mu \in \text{NC induct}-\iota ʻ0.x=\mu _{P}:\supset \vdash .\text{Prop} \end{array}$

*121·63. $\vdash :\text{E}!\nu _{P}.\supset .\text{N}_{0}\text{c}ʻP(BʻP\vdash\dashv \nu _{P})=\nu$

Dem. $\begin{array}{l} \vdash .*121·13·131.\supset \vdash :\text{Hp}.&\supset .(BʻP)P_{\nu -_{c}1}\nu _{P}.\\ [*121·11] &\supset .\text{N}_{0}\text{c}ʻP(BʻP\vdash\dashv \nu _{P})=\nu :\supset \vdash .\text{Prop} \end{array}$

*121·631. $\begin{align}\vdash \colon\ldotp P\in \text{Cls}\rightarrow 1.&P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in \text{NC induct}-\iota ʻ0.\supset :\\ &\text{N}_{0}\text{c}ʻP(BʻP\vdash\dashv y)=\nu .\equiv .y=\nu _{P}.\equiv .(BʻP)P_{\nu -_{c}1}y\end{align}$

Dem. $\begin{array}{l} \vdash .*120·414·416.*121·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{N}_{0}\text{c}ʻP(BʻP\vdash\dashv y)=\nu .&\equiv .(BʻP)P_{\nu -{c}1}y. &\qquad \text{(1)}\\ [*121·341] &\equiv .y=\breve{P} _{\nu -_{c}1}ʻBʻP.\\ [*121·13] &\equiv .y=\nu _{P} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·632. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in \text{NC induct}-\iota ʻ0.y=\nu _{P}.yPz.\supset .z=(\nu +_{c}1)_{P}$

Dem. $\begin{array}{l} \vdash .*121·13. \supset \vdash :\text{Hp}.&\supset .(BʻP)P_{\nu -_{c}1}y.yPz.\\ [*121·333·352] &\supset .(BʻP)P_{\nu }z.\\ [*121·631] &\supset .z=(\nu +_{c}1)_{P}:\supset \vdash .\text{Prop} \end{array}$

*121·633. $\begin{align}\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in &\text{NC induct}-\iota ʻ0.\nu _{P}\in \text{D}ʻP.\supset .\\ &\text{E}!(\nu +_{c}1)_{P}.(\nu +_{c}1)_{P}=\breve{P} ʻ\nu _{P}\\ &[*121·632]\end{align}$

*121·634. $\begin{align}&\vdash \colon\ldotp P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in \text{NC induct}-\iota ʻ0.\supset :\nu _{P}\in \text{D}ʻP.\equiv .\text{E}!(\nu +_{c}1)_{P}\\ &[*121·633·631·333·352]\end{align}$

*121·635. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\text{E}!\nu _{P}.\supset .\nu \in \text{NC induct}-\iota ʻ0$

Dem. $\begin{array}{l} \vdash .*121·63·45. &\supset \vdash :\text{Hp}.\supset .\nu \in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*121·13. \supset \vdash :\text{E}!\nu _{P}.&\supset .\dot{\exists} !P_{(\nu -_{c}1)}.\\ [*121·272] &\supset .(\nu -_{c}1)+_{c}1>0.\\ [*120·416] &\supset .\nu >0 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·636. $\begin{align}\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.&\text{E}!\nu _{P}.{\sim}\text{E}!(\nu +_{c}1)_{P}.\supset .\\ &\overleftarrow{P}_{*}ʻBʻP=P(BʻP\vdash\dashv \nu _{P}).\text{N}_{0}\text{c}ʻ\overleftarrow{P}_{*}ʻBʻP=\nu\end{align}$

Dem. $\begin{array}{l} \vdash .*121·635. \supset \vdash :\text{Hp}.&\supset .\nu \in \text{NC induct}-\iota ʻ0. &\qquad \text{(1)}\\ [*121·634.\text{Hp}] &\supset .\nu _{P}{\sim}\in \text{D}ʻP &\qquad \text{(2)}\\ \vdash .(1).*121·63. \supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp \exists !P(BʻP\vdash\dashv \nu _{P})\colon\ldotp \\ [*121·23] &\supset \colon\ldotp (BʻP)P_{*}\nu _{P}\colon\ldotp \\ [*96·302.*91·542] &\supset \colon\ldotp (BʻP)P_{*}z.\supset :zP_{*}\nu _{P}.\lor.\nu _{P}P_{\text{po}}z &\qquad \text{(3)}\\ \vdash .(2).(3).*91·504. \supset \vdash \colon\ldotp \text{Hp}.&\supset :(BʻP)P_{*}z.\supset .zP_{*}\nu _{P}:\\ [*4·71] &\supset :(BʻP)P_{*}z.\equiv .(BʻP)P_{*}z.zP_{*}v_{P}:\\ [*121·103] &\supset :\overleftarrow{P}_{*}ʻBʻP=P(BʻP\vdash\dashv \nu _{P}): &\qquad \text{(4)}\\ [*121·63] &\supset :\text{N}_{0}\text{c}ʻ\overleftarrow{P}_{*}ʻBʻP=\nu &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*121·13.*14·28. \supset \vdash :\text{E}!\nu _{P}.&\equiv .\nu _{P}.=\breve{P} _{\nu -_{c}1}ʻBʻP.\\ [*121·322] &\supset .\nu _{P}\in CʻP:\supset \vdash .\text{Prop} \end{array}$

*121·638. $\vdash \colon\ldotp \text{E}!(\nu +_{c}1)_{P}.\supset :(BʻP)P_{\nu }x.\equiv .x=(\nu +_{c}1)_{P}:(\nu +_{c}1)-_{c}1=\nu$

Dem. $\begin{array}{l} \vdash .*121·13.\supset \vdash :\text{E}!(\nu +_{c}1)_{P}.&\equiv .\text{E}!\breve{P}_\{(\nu +_{c}1)\}-_{c}1ʻBʻP. &\qquad \text{(1)}\\ [*121·272] &\supset .(\nu +_{c}1)-_{c}1\geq 0.\\ [*14·21] &\supset .\text{E}!(\nu +_{c}1)-_{c} 1.\\ [*14·22.(*120·411)] &\supset .(\nu +_{c}1)-_{c}1=\nu &\qquad \text{(2)}\\ \vdash .(2).\supset \vdash \colon\ldotp \text{Hp}.\supset :(BʻP)P_{\nu }x.&\equiv .(BʻP)P_{(\nu +_{c}1)-_{c}1}x.\\ [(1).*30·4] &\equiv .x=\breve{P} _{(\nu +_{c}1)-_{c}1}ʻBʻP.\\ [*121·13] &\equiv .x=(\nu +_{c}1)_{P} &\qquad \text{(3)}\\ \vdash .(3).(2).\supset \vdash . \text{Prop} \end{array}$

*121*64. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in \text{NC induct}-\iota ʻ0.\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu .\supset .\text{E}!\nu _{P}$

Dem. $\begin{array}{l} \vdash .*121·636.&\supset \vdash \colon\ldotp \text{Hp}.\text{E}!\nu _{P}.\supset :{\sim}\text{E}!(\nu +_{c} 1)_{P}.\supset .\text{N}_{0}\text{c}ʻ\overleftarrow{P}_{*}ʻBʻP=\nu &\qquad \text{(1)}\\ \vdash .*120·428.\supset \vdash :\nu \in \text{NC induct}.\exists !\nu +_{c}1.&\supset .\nu +_{c}1>\nu .\\ [*117·281] &\supset .{\sim}(\nu \geq \nu +_{c}1) &\qquad \text{(2)}\\ \vdash .*117·15. &\supset \vdash ·{\sim} \exists !\nu +_{c}1.\supset .{\sim}(\nu \geq \nu +_{c}1) &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\nu \in \text{NC induct}.\supset .{\sim}(\nu \geq \nu +_{c}1)&\qquad \text{(4)}\\ \vdash .(1).(4). &\supset \vdash \colon\ldotp \text{Hp}.\text{E}!\nu _{P}.\supset :\\ &{\sim}\text{E}!(\nu +_{c}1)_{P}.\supset .{\sim}(\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu +_{c}1):\\ [\text{Transp}] &\supset :\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu +_{c}1.\supset .\text{E}!(\nu +_{c}1)_{P} &\qquad \text{(5)}\\ \vdash .(5).\text{Syll}.*117·6.\supset \vdash \colon\ldotp \text{Hp}:&\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu .\supset .\text{E}!\nu _{p}:\supset :\\ &\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu +_{c}1.\supset .\text{E}!(\nu +_{c}1)_{P} &\qquad \text{(6)}\\ \vdash .*14·21.*121·601.&\supset \vdash :\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq 1.\supset .\text{E}!1_{P} &\qquad \text{(7)}\\ \vdash .(6).(7).*120·473.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu .\supset .\text{E}!\nu _{P}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*121·641. $\begin{align}\vdash \colon\ldotp P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\nu \in &\text{NC induct}-\iota ʻ0.\supset :\\ &\text{Nc}ʻ\overleftarrow{P}_{*}ʻBʻP\geq \nu .\equiv .\text{E}!\nu _{P}\\ &[*121·64·63·32]\end{align}$

*121·65. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\mu \neq 0.\text{E}!(\mu +_{c}\nu )_{P}.\supset .\mu _{P}P_{\nu }(\mu +_{c}\nu )_{P}$

Dem. $\begin{array}{l} \vdash .*121·631·635·64.*120·452.\supset \\ \vdash :\text{Hp}.&\supset .(BʻP)P_{\mu -_{c}1}\mu _{P}.(BʻP)P_{\mu +_{c}\nu -_{c}1}(\mu +_{c}\nu )_{P}.\\ [*121·351.*120·424]&\supset .(BʻP)P_{\mu -_{c}1}\mu _{P}.(BʻP)(P_{\mu -_{c}1}\mid P_{\nu })(\mu +_{c}\nu )_{P}.\\ [*121·341.*72·591] &\supset .\mu _{P}P_{\nu }(\mu +_{c}\nu )_{P}:\supset \vdash .\text{Prop} \end{array}$

*121·66. $\vdash :P\in \text{Cls}\rightarrow 1.P_{\text{po}}\,\unicode{x2abd}\, J.\text{Nc}ʻP(BʻP\vdash\dashv x)>\nu .\supset .x\in \text{ᗡ}ʻP_{\nu }$

Dem. $\begin{array}{l} \vdash .*121·45.*120·48.\supset \vdash :\text{Hp}.&\supset .\nu \in \text{NC induct}.\\ [*120·429] &\supset .\text{Nc}ʻP(BʻP\vdash\dashv x)\geq \nu +_{c}1.\\ [*117·31] &\supset .(\exists \mu ).\text{Nc}ʻP(BʻP\vdash\dashv x)=\nu +_{c}1+_{c}\mu .\\ [*121·11] &\supset .(\exists \mu ).(BʻP)P_{\nu +_{c}\mu }x.\\ [*121·351·352] &\supset .(\exists \mu ).(BʻP)(P_{\mu }\mid P_{\nu })x.\\ [*34·36] &\supset .x\in \text{ᗡ}ʻP_{\nu }:\supset \vdash .\text{Prop} \end{array}$

*121·7. $\vdash :R\in 1\rightarrow 1.aBR.aR_{*}x.\supset .\overrightarrow{R}_{*}ʻx=R(a\vdash\dashv x).\overrightarrow{R}_{*}ʻx\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*96·25.\supset \vdash \colon\ldotp \text{Hp}.&\supset :yR_{*}x.\supset .aR_{*}y:\\ [*4·71] &\supset :yR_{*}x.\equiv .aR_{*}y.yR_{*}x:\\ [*121·103] &\supset :\overrightarrow{R}_{*}ʻx=R(a\vdash\dashv x) &\qquad \text{(1)}\\ \vdash .(1).*121·45.\supset \vdash .\text{Prop} \end{array}$

*121·71. $\begin{align}\vdash \colon\ldotp R\in 1\rightarrow 1:x\in sʻ\text{gen}ʻR.\lor.(\exists y).y\in &\overleftrightarrow{R}_{*}ʻx.yR_{\text{po}}y:\supset .\\ &\overrightarrow{R}_{*}ʻx\in \text{Cls induct}\end{align}$

Dem. $\begin{array}{l} \vdash .*121·7.*93·36.&\supset \vdash :R\in 1\rightarrow 1.x\in sʻ\text{gen}ʻR.\supset .\overrightarrow{R}_{*}ʻx\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .*97·55·111.\supset \vdash \colon\ldotp R\in 1\rightarrow 1:(\exists y).&y\in \overleftrightarrow{R}_{*}ʻx.yR_{\text{po}}y:\supset :\\ &y\in \overleftrightarrow{R}_{*}ʻx .\supset _{y}.yR_{\text{po}}y:x\in \overleftrightarrow{R}_{*}ʻx:\\ [*10·26] &\supset :xR_{\text{po}}x:\\ [*121·381] &\supset :\overrightarrow{R}_{*}ʻx=R(x\vdash\dashv x):\\ [*121·45] &\supset :\overrightarrow{R}_{*}ʻx\in \text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*121·72. $\begin{align}&\vdash :R\in 1\rightarrow 1.\overrightarrow{R}_{*}ʻx{\sim}\in \text{Cls induct}.\supset .x\in pʻ\text{ᗡ}ʻʻ\text{Pot}ʻR.R_{\text{po}}\unicode{x0294f}\overleftrightarrow{R}_{*}ʻx\,\unicode{x2abd}\, J\\ &[*121·71.\text{Transp}.*93·271.*120·212.*50·24]\end{align}$

By a "progression" we mean a series which is like the series of the inductive cardinals in order of magnitude (assuming that all inductive cardinals exist), i.e. a series whose terms can be called $1_{R}, 2_{R}, 3_{R}, ... \nu _{R}, ...,$ where every term of the series is correlated with some inductive cardinal, and every inductive cardinal is correlated with some term of the series. Such series belong to the relation-number (cf. *152 and *263) which Cantor calls $\omega$ . Their generating relation may be taken to be the transitive relation of earlier and later, or the one-one relation of immediate predecessor to immediate successor. We shall reserve the notation $\omega$ for the transitive generating relations of progressions; for the present, we are concerned with the one-one relations which generate progressions. The class of these relations we shall call " $\text{Prog}$ ."

It is not convenient to define a progression as a series which is ordinally similar to that of the inductive cardinals, both because this definition only applies if we assume the axiom of infinity, and because we have in any case to show that (assuming the axiom of infinity) the series of inductive cardinals has certain properties, which can be used to afford a direct definition of progressions. The existence of progressions, however, is only obtainable by means of the axiom of infinity, and is then most easily obtained from the fact that the inductive cardinals form a progression. We shall not consider the existence-theorem until the next number (*123).

From this number onwards convention $\text{Infin}\,T$ of the Prefatory Statement is used when relevant.

The characteristics of the generating relation $R$ of a progression, which we employ in the definition, are the following:

(3) the whole field is contained in the posterity of the first term, i.e. $CʻR=\overleftarrow{R}_{*}ʻBʻR$ . (If this failed, $CʻR$ would consist of two or more distinct families, of which, since we have $\text{E}!BʻR$ , all but one would have to be cyclic families.)

(4) every term of the field has a successor, i.e. the series is endless. This is secured $\text{ᗡ}ʻR\subset \text{D}ʻR$ , or (what is equivalent) $CʻR=\text{D}ʻR$ .

These four properties suffice to define the one-one generating relations of progressions. It will be observed that (2), (3) and (4) are all secured by $\text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR.$

This secures $\text{E}!BʻR$ , by *14·21; it secures $\text{ᗡ}ʻR\subset \text{D}ʻR$ , by *37·25 and *90·163; hence, by *33·181, $\text{D}ʻR=CʻR$ , and therefore $CʻR=\overleftarrow{R}_{*}ʻBʻR.$

Hence our definition of progressions is $\text{Prog}=(1\rightarrow 1)\cap \hat{R} (\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR) \quad\text{Df}.$

Instead of stating in the definition that $R$ is to be a one-one relation, it is sufficient to put $R\in\text{Cls}\rightarrow 1.R_{\text{po}}\,\unicode{x2abd}\, J$ , which, with $\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR$ , implies $R\in 1\rightarrow 1$ , and may be substituted for $R\in 1\rightarrow 1$ without altering the force of the definition (*122·17).

In the present number we shall prove, among other propositions, that every existent class contained in a progression has a first term (*122·23), i.e. that progressions are well-ordered series; that in a progression $R_{\text{po}}\,\unicode{x2abd}\, J$ (*122·16), which makes the propositions of *121 available; that if $\nu$ is any inductive cardinal other than 0, $\nu _{R}$ exists (*122·33), i.e. the series has a $\nu$ th term; that any class contained in $\text{D}ʻR$ and having a last term is an inductive class (*122·43), and that any class contained in $\text{D}ʻR$ and not having a last term is itself the domain of a progression (*122·45), so that every class contained in $\text{D}ʻR$ is either inductive or the domain of a progression (*122·46); that if $P$ is a many-one, and $x$ a member of its domain, and if the descendants of $x$ have no last term and are none of them descendants of themselves, then $P$ arranges these descendants in a progression (*122·51); and that the same holds if $P$ is a one-one and ${\sim}(xPx)$ (*122·52); and that if $P\in 1\rightarrow 1$ and $x$ belongs to one of the generations of $P$ , but not to one of the generations of $\breve{P}$ , then $P$ arranges the whole family of $x$ in a progression (*122·54).

The following general observations on the families of one-one relations may serve to elucidate the bearing of the propositions of this section.

Given any relation $P$ , we call $\overleftrightarrow{P}_{*}ʻx$ , i.e. $\overrightarrow{P}_{*}ʻx\cup \overleftarrow{P}_{*}ʻx$ the family of $x$ . If $P$ is a one-one, this family may be of four different kinds. (1) It may be a closed series, like the angles of a polygon. This occurs if $xP_{\text{po}}x$ . In this case the family forms an inductive class. (2) It may be an open series with a beginning and an end; this occurs if ${\sim}(xP_{\text{po}}x).\text{E}!\text{min}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.\text{E}!\text{max}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.$

In this case also the family forms an inductive class. (3) It may be an[Pg 255] open series with a beginning and no end, or an end and no beginning. This occurs if ${\sim}(xP_{\text{po}}x).\text{E}!\text{min}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.{\sim}\text{E}!\text{max}_{P}ʻ\overleftrightarrow{P}_{*}ʻx,$ or if ${\sim}(xP_{\text{po}}x).{\sim}\text{E}!\text{min}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.\text{E}!\text{max}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.$ In this case, the series is of the type $\omega$ or $\text{Cnv}ʻʻ\omega$ , and is non-inductive and reflexive. (4) The series may be open and have neither beginning nor end. This occurs if ${\sim}(xP_{\text{po}}x).{\sim}\text{E}!\text{min}_{P}ʻ\overleftrightarrow{P}_{*}ʻx.{\sim}\text{E}!\text{max}_{P}ʻ\overleftrightarrow{P}_{*}ʻx$ In this case we get a series whose relation-number is the sum (in the sense of *180) of $\text{Cnv}ʻʻ\omega$ and $\omega$ , which again is non-inductive and reflexive. In all four cases, if $y$ and $z$ be any two members of the family of $x$ , the interval between $y$ and $z$ is an inductive class.

If $x$ is a member of $\overrightarrow{B}ʻP$ , or if the family of $x$ contains a member of $\overrightarrow{B}ʻP$ , cases (1) and (4) are excluded, since the series has a beginning. In this case the number of predecessors of any term is an inductive number. It will be observed that every family is either wholly contained in $sʻ\text{gen}ʻP$ or wholly contained in $pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP$ ; families of kinds (2) and (3) (excluding, in (2), those which have an end but no beginning) are contained in $sʻ\text{gen}ʻP$ , while families of kinds (1) and (4), and those of (2) which have an end but no beginning, are contained in $pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP$ ; families containing a member of $\overrightarrow{B}ʻP$ are contained in $sʻ\text{gen}ʻP$ , while all others are contained in $pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP$ .

Thus a one-one relation in general gives rise to a number of wholly disconnected series, some closed, others open and with or without a beginning or an end. The condition that all the series should be open is $P_{\text{po}}\,\unicode{x2abd}\, J$ .

The case of a $Q$ -shaped family, considered in *96, cannot arise when $P\in 1\rightarrow 1$ , for in a $Q$ -shaped family the term at the junction of the tail and the circle has two predecessors, one in the tail and one in the circle, so that the relation in question is not $1\rightarrow 1$ . It follows that, when $P\in 1\rightarrow 1$ , if $\alpha$ is a family containing a member of $\overrightarrow{B}ʻP$ , $\alpha \upharpoonleft P_{\text{po}}\,\unicode{x2abd}\, J$ (cf. *96·23).

When $BʻP$ exists, there is only one family which has a beginning. In this case, ignoring the other families (if any), we call the members of the family of $BʻP$ respectively $1_{P}$ , $2_{P}$ , $3_{P}$ , .... If the family has $\nu$ members, where $\nu$ is an inductive cardinal, its last member will be $\nu_{P}$ . If on the other hand the number of members of the family is not an inductive cardinal, it must be $\aleph _{0}$ ; in this case, the family forms a progression, whose members are $1_{P}$ , $2_{P}$ , $3_{P}$ , ..., $\nu _{P}$ , ..., where $\nu _{P}$ always exists when $\nu$ is an inductive cardinal.

*122·21. $\vdash \colon\ldotp R\in \text{Prog}.x,y\in CʻR.\supset :xR_{\text{po}}y.\lor.x = y.\lor.yR_{\text{po}}x$

*122·34. $\vdash \colon\ldotp R\in \text{Prog}.\supset :\nu \in \text{NC induct} - \iota ʻ0.\equiv .\text{E}!\nu _{R}$

*122·341. $\vdash :R\in \text{Prog}.\supset .\text{D}ʻR = \hat{x} \{(\exists \nu ).\nu \in \text{NC induct} - \iota ʻ0.x = \nu _{R}\}$

In virtue of these two propositions, the terms of a progression are $1_{R},\,\, 2_{R},\,\, 3_{R},\,\, ... \nu _{R},\,\, ...,$ where every inductive cardinal occurs. This is the same fact as is usually assumed when the terms are represented as $x_{1},\,\, x_{2},\,\, x_{3},\,\, ... x_{\nu }, ....$

*122·35. $\vdash :R\in \text{Prog}.\nu \in \text{NC induct} - \iota ʻ0.\supset .\overrightarrow{B}ʻR_{\nu } = R(1_{R}\vdash\dashv \nu _{R}).\overrightarrow{B}ʻR_{\nu }\in \nu$

*122·36. $\vdash :\exists !\text{Prog} \cap t^{11}ʻx.\supset .\text{Infin ax}(x)$

*122·37. $\vdash :R\in \text{Prog}.\supset .\text{D}ʻR{\sim}\in \text{Cls induct}.\text{N}_{0}\text{c}ʻ\text{D}ʻR{\sim}\in \text{NC induct}$

*122·38. $\vdash :R\in \text{Prog}.\supset .\overrightarrow{R}_{*}ʻx\in \text{Cls induct}$

*122·01. $\text{Prog} = (1\rightarrow 1)\cap \hat{R} (\text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR) \quad\text{Df}$

*122·1. $\vdash :R\in \text{Prog}.\equiv .R\in 1\rightarrow 1.\text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR \quad[(*122·01)]$

*122·11. $\vdash \colon\ldotp R\in \text{Prog}.\equiv :R\in 1\rightarrow 1.\text{E}!BʻR:x\in \text{D}ʻR.\equiv _{x}.x\in \overleftarrow{R}_{*}ʻBʻR$

Dem. $\begin{array}{l} \vdash .*122·1.*14·205.\supset \\ \vdash \colon\colon R\in \text{Prog}.&\equiv \colon\ldotp R\in 1\rightarrow 1:(\exists a).a = BʻR.\text{D}ʻR = \overleftarrow{R}_{*}ʻa\colon\ldotp \\ [*20·43] &\equiv \colon\ldotp R\in 1\rightarrow 1\colon\ldotp (\exists a):a = BʻR:x\in \text{D}ʻR.\equiv _{x}.x\in \overleftarrow{R}_{*}ʻa\colon\ldotp \\ [*14·15] &\equiv \colon\ldotp R\in 1\rightarrow 1\colon\ldotp (\exists a):a = BʻR:x\in \text{D}ʻR.\equiv _{x}.x\in \overleftarrow{R}_{*}ʻBʻR\colon\ldotp \\ [*14·204] &\equiv \colon\ldotp R\in 1\rightarrow 1.\text{E}!BʻR:x\in \text{D}ʻR.\equiv _{x}.x\in \overleftarrow{R}_{*}ʻBʻR\colon\colon \supset \vdash .\text{Prop} \end{array}$

Observe that, by the conventions as to descriptive symbols, $\text{D}ʻR = \overleftarrow{R}_{*}ʻBʻR$ involves the existence of $BʻR$ , whereas $x\in \text{D}ʻR.\equiv _{x}.x\in\overleftarrow{R}_{*}ʻBʻR$ does not, since, if $BʻR$ does not exist, we have $(x).x{\sim}\in \overleftarrow{R}_{*}ʻBʻR$ , and therefore $(x).x{\sim}\in \text{D}ʻR$ will satisfy the equivalence, i.e. $\dot{\Lambda}$ will satisfy the equivalence although it has no first term. This is the reason why $\text{E}!BʻR$ appears explicitly in *122·11, though it was only implicit in *122·1.

*122·12. $\begin{align}\vdash \colon\colon R\in \text{Prog}.&\equiv \colon\ldotp R\in 1\rightarrow 1.\text{E}!BʻR\colon\ldotp x\in \text{D}ʻR.\equiv _{x}:\\ &BʻR\in \alpha .\breve{R} ʻʻ\alpha \subset \alpha .\supset _{\alpha }.x\in \alpha \quad[*122·11.*90·1]\end{align}$

*122·14. $\vdash :R\in \text{Prog}.\supset .\overleftarrow{R}_{\text{po}}ʻBʻR=\text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*122·1.*37·25. \supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻR&=\breve{R} ʻʻ\overleftarrow{R}_{*}ʻBʻR\\ [*91·52] & =\overleftarrow{R}_{\text{po}}ʻBʻR:\supset \vdash .\text{Prop} \end{array}$

*122·141. $\vdash :R\in \text{Prog}.\supset .\text{ᗡ}ʻR\subset \text{D}ʻR.CʻR=\text{D}ʻR$

Dem. $\begin{array}{l} \vdash .*122·1.*37·25. \supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻR=\breve{R} ʻʻ\overleftarrow{R}_{*}ʻBʻR.\\ [*90·163] &\supset .\text{ᗡ}ʻR\subset \overleftarrow{R}_{*}ʻBʻR.\\ [*122·1.*33·181] &\supset .\text{ᗡ}ʻR\subset \text{D}ʻR.CʻR=\text{D}ʻR:\supset \vdash .\text{Prop} \end{array}$

*122·142. $\vdash :R\in \text{Prog}.P\in \text{Pot}ʻR.\supset .\text{D}ʻP=\text{D}ʻR \quad[*122·141.*92·14]$

*122·143. $\vdash :R\in \text{Prog}.P\in \text{Pot}ʻR.\supset .\text{ᗡ}ʻP\subset \text{D}ʻP \quad[*122·142·141.*91·271]$

*122·15. $\vdash :R\in \text{Prog}.\supset .R=(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R=R\upharpoonright (\overleftarrow{R}_{\text{po}}ʻBʻR)=R\upharpoonright (\overleftarrow{R}_{*}ʻBʻR)$

Dem. $\begin{array}{l} \vdash .*122·1.*35·63. \supset \vdash :\text{Hp}.\supset .R&=(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R\\ [*96·2] &=R\upharpoonright (\overleftarrow{R}_{\text{po}}ʻBʻR)\\ [*96·21] &=R\upharpoonright (\overleftarrow{R}_{*}ʻBʻR):\supset \vdash .\text{Prop} \end{array}$

*122·151. $\begin{align}&\vdash :R\in \text{Prog}.\supset .R_{*}=(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R_{*}=R_{*}\upharpoonright (\overleftarrow{R}_{*}ʻBʻR)\\ &[35·63·66.*90·14.*122·141·1]\end{align}$

*122·152. $\begin{align}\vdash :R\in \text{Prog}.\supset .R_{\text{po}}=(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R_{\text{po}}&=R_{\text{po}}\upharpoonright (\overleftarrow{R}_{\text{po}}ʻBʻR)\\ &=R_{\text{po}}\upharpoonright (\overleftarrow{R}_{*}ʻBʻR)\\ [*35·63·66.*91·504.*121·1·14]\end{align}$

*122·16. $\vdash :R\in \text{Prog}.\supset .R_{\text{po}}\,\unicode{x2abd}\, J \quad[*96·23.*122·152]$

This proposition enables us to apply to progressions all the propositions of *121 in which we have as hypothesis $R\in \text{Cls}\rightarrow 1.R_{\text{po}}\,\unicode{x2abd}\, J, or R\in 1\rightarrow \text{Cls}.R_{\text{po}}\,\unicode{x2abd}\, J.$

*122·17. $\vdash :R\in \text{Prog}.\equiv .R\in \text{Cls}\rightarrow 1.R_{\text{po}}\,\unicode{x2abd}\, J.\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR$

Dem. $\begin{array}{l} \vdash .*35·63. \supset \vdash :\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR.\supset .R=(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R &\qquad \text{(1)}\\ \vdash .*96·453. \supset \vdash :R\in \text{Cls}\rightarrow 1.(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R_{\text{po}}\,\unicode{x2abd}\, J.\supset .(\overleftarrow{R}_{*}ʻBʻR)\upharpoonleft R\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).*122·1. \supset \vdash :\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR.R\in \text{Cls}\rightarrow 1.R_{\text{po}}\,\unicode{x2abd}\, J.\supset .R\in \text{Prog} &\qquad \text{(3)}\\ \vdash .(3).*122·1·16.\supset \vdash .\text{Prop} \end{array}$

To illustrate this proposition, consider its application to the inductive cardinals arranged in order of magnitude; i.e. take as a value of $R$ the relation $\hat{\mu} \hat{\nu} (\mu \in \text{NC induct}.\nu =\mu +_{c}1).$

We then have $R\in \text{Cls}\rightarrow 1.0=BʻR$ ; also $\text{NC induct}=\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR.$

We have also $\exists !\mu +_{c}1.\mu +_{c}1=\nu +_{c}1.\supset .\mu =\nu ,$ so that $R\upharpoonright (-\iota ʻ\Lambda )\in 1\rightarrow \text{Cls}$ .

Again $\mu R_{\text{po}}\nu .\equiv .(\exists \varpi ).\varpi \in \text{NC induct}-\iota ʻ0.\nu =\mu +_{c}\varpi ,$ whence $\mu R_{\text{po}}\nu .\exists !\mu .\supset .\mu \neq \nu ,$ i.e. $(-\iota ʻ\Lambda )\upharpoonleft R_{\text{po}}\,\unicode{x2abd}\, J.$

But we do not get $R\in 1\rightarrow \text{Cls}$ or $R_{\text{po}}\,\unicode{x2abd}\, J$ unless we have $\Lambda {\sim}\in \text{NC induct},$ which is the axiom of infinity. If this condition fails, we reach at last an inductive cardinal which = $\Lambda$ , and we have $\Lambda =\Lambda +_{c}1,$ so that $\Lambda$ has two immediate predecessors, namely itself and the last existent cardinal. The posterity of 0, in this case, is a $Q$ in which the circle has narrowed to a single term, namely $\Lambda$ .

Thus we need the axiom of infinity in order to prove $\hat{\mu} \hat{\nu} (\mu \in \text{NC induct}.\nu =\mu +_{c}1)\in \text{Prog}.$

*122·2. $\vdash \colon\ldotp R\in \text{Prog}.x,y\in CʻR.\supset :xR_{*}y.\lor.yR_{*}x \quad[*96·302.*122·1·141]$

*122·21. $\begin{align}\vdash \colon\ldotp R\in \text{Prog}.x,y\in CʻR.\supset :xR_{\text{po}}y.&\lor.x=y.\lor.yR_{\text{po}}x\\ &[*96·303.*122·1·141]\end{align}$

This proposition, together with *122·16 and *91·56, shows that if $R\in \text{Prog}$ , $R_{\text{po}}$ has the three properties by which transitive serial relations are defined (cf. *204), namely it is (1) transitive, (2) contained in diversity, (3) connected, i.e. such that it relates any two distinct members of its field. We shall at a later stage define the ordinal number $\omega$ as the class of such relations as $R_{\text{po}}$ , where $R\in \text{Prog}$ .

*122·22. $\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.x,y\in \alpha -\breve{R} _{\text{po}}ʻʻ\alpha .\supset .x=y$

Dem. $\begin{array}{l} \vdash .*122·21.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xR_{\text{po}}y.\lor.x=y.\lor.yR_{\text{po}}x &\qquad \text{(1)}\\ \vdash .*37·105.&\supset \vdash :x\in \alpha .xR_{\text{po}}y.\supset .y\in \breve{R} _{\text{po}}ʻʻ\alpha :\\ [\text{Transp}] &\supset \vdash :x\in \alpha .y{\sim}\in \breve{R} _{\text{po}}ʻʻ\alpha .\supset .{\sim}(xR_{\text{po}}y) &\qquad \text{(2)}\\ \vdash .(2). &\supset \vdash :\text{Hp}.\supset .{\sim}(xR_{\text{po}}y).{\sim}(yR_{\text{po}}x) &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash .\text{Prop} \end{array}$

*122·23. $\begin{align}\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.&\exists !\alpha .\supset .\\ &\text{E}!\text{min}(R_{\text{po}})ʻ\alpha .\alpha -\breve{R} _{\text{po}}ʻʻ\alpha =\iota ʻ\text{min}(R_{\text{po}})ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*96·52. &\supset \vdash :\text{Hp}.\supset .\exists !\overrightarrow{\text{min}}(R_{\text{po}})ʻ\alpha &\qquad \text{(1)}\\ \vdash .*93·111.*122·22. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x,y\in \overrightarrow{\text{min}}(R_{\text{po}})ʻ\alpha .\supset _{x,y}.x=y &\qquad \text{(2)}\\ \vdash .(1).(2).*32·4.*93·111.\supset \vdash .\text{Prop} \end{array}$

This proposition shows that every existent class contained in a progression has a first term, i.e. that a progression is a well-ordered series (cf. *250).

*122·231. $\vdash :R\in \text{Prog}.\alpha \subset \breve{R} _{\text{po}}ʻʻ\alpha .\supset .\alpha =\Lambda$

Dem. $\begin{array}{l} \vdash .*91·504.&\supset \vdash :\text{Hp}.\supset .\alpha \subset \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash .*93·11. &\supset \vdash :\text{Hp}.\supset.{\sim}\text{E}!\overrightarrow{\text{min}}(R_{\text{po}})ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*122·23·141.\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

*122·24. $\vdash :R\in \text{Prog}.P\in PotʻR.\supset .\text{D}ʻP=\breve{P} _{*}ʻʻ\overrightarrow{B}ʻP=sʻ\text{gen}ʻP$

Dem. $\begin{array}{l} \vdash .*122·1.*92·102.\supset \vdash :\text{Hp}.&\supset .P\in 1\rightarrow 1.\\ [*93·42] &\supset .pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP=\breve{P} ʻʻpʻ\text{ᗡ}ʻʻ\text{Pot}ʻP.\\ [*91·581] &\supset .pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP\subset \breve{R} _{\text{po}}ʻʻpʻ\text{ᗡ}ʻʻ\text{Pot}ʻP.\\ [*122·231] &\supset .pʻ\text{ᗡ}ʻʻ\text{Pot}ʻP=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*93·37·36. \supset \vdash :\text{Hp}.&\supset .CʻP=\breve{P} _{*}ʻʻ\overrightarrow{B}ʻP=sʻ\text{gen}ʻP &\qquad \text{(2)}\\ \vdash .(2).*122·143.\supset \vdash .\text{Prop} \end{array}$

Except when $P=R$ , $\overrightarrow{B}ʻP$ will not reduce to a single term. In fact, if $P=R_{\nu }$ , $\overrightarrow{B}ʻP=R(1_{R}\vdash\dashv \nu _{R})$ , i.e. $\overrightarrow{B}ʻP$ consists of the first $\nu$ terms of the progression.

*122·25. $\begin{align}\vdash :R\in \text{Prog}.P\in \text{Pot}ʻR.x\in &\text{D}ʻR.\supset .\\ &(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}.x=Bʻ\{(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\}\end{align}$

Dem. $\begin{array}{l} \vdash .*122·1.*92·102.&\supset \vdash :\text{Hp}.\supset .(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*122·143.& \supset \vdash :\text{Hp}.\supset .\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP.\\ [*35·62] &\supset .\text{D}ʻ\{(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\}=\overleftarrow{P}_{*}ʻx &\qquad \text{(2)}\\ \vdash .*37·4.*91·52. &\supset \vdash .\text{ᗡ}ʻ\{(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\}=\overleftarrow{P}_{\text{po}}ʻx &\qquad \text{(3)}\\ \vdash .*122·16.*91·6. &\supset \vdash :\text{Hp}.\supset .x{\sim}\in \overleftarrow{P}_{\text{po}}ʻx &\qquad \text{(4)}\\ \vdash .*91·542. &\supset \vdash :y\in \overleftarrow{P}_{*}ʻx.y\neq x.\supset .y\in \overleftarrow{P}_{\text{po}}ʻx &\qquad \text{(5)}\\ \vdash .(2).(3).(4).(5).&\supset \vdash :\text{Hp}.\supset .x=Bʻ\{(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\} &\qquad \text{(6)}\\ \vdash .(1).(2).(6).*96·131.\supset \vdash .\text{Prop} \end{array}$

The above proposition shows that what we may call an "arithmetical progression" in a progression is a progression, i.e. if, starting from any term of a progression, we take every other term, or every third term, or every $\nu$ th term, we still have a progression.

*122·26. $\vdash :R\in \text{Prog}.\alpha \subset R_{\text{po}}ʻʻ\alpha .\exists !\alpha .\supset .\text{D}ʻR=R_{\text{po}}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash . *22·1 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : BʻR \in \alpha . \supset BʻR \in R_{\text{po}}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*91·542.*122·11.&\supset \vdash \colon\ldotp \text{Hp}.BʻR{\sim}\in \alpha .\supset :y\in \alpha \cap \text{D}ʻR.\supset _{y}.(BʻR)R_{\text{po}}y:\\ [*91·504.*37·15] &\supset :y\in \alpha .\supset _{y}.(BʻR)R_{\text{po}}y:\\ [*10·55.\text{Hp}] &\supset :(\exists y).y\in \alpha .(BʻR)R_{\text{po}}y:\\ [*37·1] &\supset :BʻR\in R_{\text{po}}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2) .&\supset \vdash :\text{Hp}.\supset .BʻR\in R_{\text{po}}ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*92·111. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in R_{\text{po}}ʻʻ\alpha .xRy.\supset .y\in R_{*}ʻʻ\alpha .\\ [*91·545] &\supset .y\in \alpha \cup R_{\text{po}}ʻʻ\alpha .\\ [\text{Hp}] &\supset .y\in R_{\text{po}}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).*90·112.&\supset \vdash \colon\ldotp \text{Hp}.\supset :(BʻR)R_{*}y.\supset .y\in R_{\text{po}}ʻʻ\alpha &\qquad \text{(5)}\\ \vdash .(5).*122·1.\supset \vdash .\text{Prop} \end{array}$

The above proposition shows that if an existent class contained in a progression has no maximum, then any assigned member of the progression is succeeded by members of the class.

The following proposition states that if $\alpha$ has members belonging to a progression, and there are members of the progression which do not precede any member of $\alpha$ , then there is in the progression a last member of $\alpha$ .

*122·27. $\begin{align}\vdash :R\in \text{Prog}.\exists !\text{D}ʻR-R_{\text{po}}ʻʻ\alpha .&\exists !\alpha \cap \text{D}ʻR.\supset .\\ &\text{E}!\text{max}(R_{\text{po}})ʻ\alpha .\exists !\alpha \cap \text{D}ʻR-R_{\text{po}}ʻʻ\alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*122·26.\text{Transp}.*37·265. &\supset \vdash :\text{Hp}.\supset .\exists !\alpha \cap CʻR-R_{\text{po}}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*122·21. &\supset \vdash :\text{Hp}.x,y\in \alpha \cap CʻR-R_{\text{po}}ʻʻ\alpha .\supset .x=y &\qquad \text{(2)}\\ \vdash .(1).(2).*93·115.*122·141. &\supset \vdash .\text{Prop} \end{array}$

*122·28. $\vdash :R\in \text{Prog}.\alpha \subset \overrightarrow{R}_{*}ʻx.\exists !\alpha .\supset .\text{E}!\text{max}(R_{\text{po}})ʻ\alpha .\exists !\alpha \cap \text{D}ʻR-R_{\text{po}}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*90·13.*122·141. &\supset \vdash :\text{Hp}.\supset .\alpha \subset \text{D}ʻR &\qquad \text{(1)}\\ \vdash .*90·14.*122·141. &\supset \vdash :\text{Hp}.\supset .x\in \text{D}ʻR.\\ [*71·161.*122·16] &\supset .\breve{R} ʻx{\sim}\in R_{\text{po}}ʻʻ\alpha .\\ [*122·1] &\supset .\exists !\text{D}ʻR-R_{\text{po}}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*122·27.\supset \vdash .\text{Prop} \end{array}$

*122·3. $\begin{align}&\vdash :R\in \text{Prog}.\supset .\text{D}ʻR=\hat{x} \{(\exists \nu ).\nu \in \text{NC induct}.(BʻR)R_{v}x\}\\ &[*121·52.*122·1·16]\end{align}$

*122·31. $\vdash :R\in \text{Prog}.\nu \in \text{NC induct}-\iota ʻ0.\supset .\text{ᗡ}ʻR_{\nu }=\hat{y} \{\text{Nc}ʻR(BʻR\vdash\dashv y)>\nu\}$

Dem. $\begin{array}{l} \vdash .*120·429.\supset \vdash \colon\ldotp \text{Hp}.\supset :&\text{Nc}ʻR(BʻR\vdash\dashv y)>\nu .\equiv .\text{Nc}ʻR(BʻR\vdash\dashv y)\geq \nu +_{c}1.\\ [*117·31] &\equiv .(\exists \mu ).\mu \in \text{NC}.\text{Nc}ʻR(BʻR\vdash\dashv y)=\mu +_{c}\nu +_{c}1.\\ &\nu +_{c}1,\mu +_{c}\nu +_{c}1\in \text{N}_{0}\text{C}.\\ [*121·45.*120·452.*110·4] &\equiv .(\exists \mu ).\mu \in \text{NC induct}.\\ &\text{Nc}ʻR(BʻR\vdash\dashv y)=\mu +_{c}\nu +_{c}1.\mu +_{c}\nu +_{c}1\in \text{N}_{0}\text{C}.\\ [*121·11·35.*110·43.*100·3] &\equiv .(\exists \mu ).\mu \in \text{NC induct}.(BʻR)R_{\mu }\mid R_{\nu }y.\\ [*34·1] &\equiv .(\exists \mu ,x).\mu \in \text{NC induct}.(BʻR)R_{\mu }x.xR_{\nu }y.\\ [*122·3] &\equiv .(\exists x).x\in \text{D}ʻR.xR_{\nu }y.\\ [*121·323] &\equiv .(\exists x).xR_{\nu }y.\\ [*33·131] &\equiv .y\in \text{ᗡ}ʻR_{\nu }\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*122·32. $\begin{align}\vdash :R\in \text{Prog}.\nu \in &\text{NC induct}-\iota ʻ0.\supset .\\ &\overrightarrow{B}ʻR_{\nu }=\text{D}ʻR\cap \hat{x} \{\text{Nc}ʻR(BʻR\vdash\dashv x)\leq \nu\}\end{align}$

Dem. $\begin{array}{l} \vdash .*122·142.*121·501.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻR_{\nu }=\text{D}ʻR &\qquad \text{(1)}\\ \vdash .*122·31.*120·442.&\supset \vdash :\text{Hp}.\supset .-\text{ᗡ}ʻR_{\nu }=\hat{x} \{\text{Nc}ʻR(BʻR\vdash\dashv x)\leq \nu\} &\qquad \text{(2)}\\ \vdash .(1).(2).*93·101.\supset \vdash .\text{Prop} \end{array}$

*122·33. $\vdash :R\in \text{Prog}.\nu \in \text{NC induct}-\iota ʻ0.\supset .\text{E}!\nu _{R}$

Dem. $\begin{array}{l} \vdash .*121·601.*122·11. &\supset \vdash :\text{Hp}.\supset .\text{E}!1_{R} &\qquad \text{(1)}\\ \vdash .*121·634·637.*122·141.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\nu _{R}.\supset .\text{E}!(\nu +_{c}1)_{R} &\qquad \text{(2)}\\ \vdash .(1).(2).*120·473.\supset \vdash .\text{Prop} \end{array}$

*122·34. $\vdash \colon\ldotp R\in \text{Prog}.\supset :\nu \in \text{NC induct}-\iota ʻ0.\equiv .\text{E}!\nu _{R} \quad[*122·33.*121·635]$

*122·341. $\vdash :R\in \text{Prog}.\supset .\text{D}ʻR=\hat{x} \{(\exists \nu ).\nu \in \text{NC induct}-\iota ʻ0.x=\nu _{R}\}$

Dem. $\begin{array}{l} \vdash .*122·3·34.*121·638.\supset \\ \vdash :\text{Hp}.\supset .\text{D}ʻR&=\hat{x} \{(\exists \nu ).\nu \in \text{NC induct}.x=(\nu +_{c}1)_{R}\}\\ [*120·471] &=\hat{x} \{(\exists \nu ).\nu \in \text{NC induct}-\iota ʻ0.x=\nu _{R}\}:\supset \vdash .\text{Prop} \end{array}$

In virtue of *122·34 ·341, all the terms of a progression occur in the series $1_{R}$ , $2_{R}$ , ... $\nu _{R}$ , ..., and every inductive cardinal except 0 is used in forming this series.

*122·35. $\vdash :R\in \text{Prog}.\nu \in \text{NC induct}-\iota ʻ0.\supset .\overrightarrow{B}ʻR_{\nu }=R(1_{R}\vdash\dashv \nu _{R}).\overrightarrow{B}ʻR_{\nu }\in \nu$

Dem. $\begin{array}{l} \vdash .*121·63.*122·33.&\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻR(BʻR\vdash\dashv \nu _{R})=\nu . &\qquad \text{(1)}\\ [*122·32] \supset .\overrightarrow{B}ʻR_{\nu }&=\text{D}ʻR\cap \hat{x} \{\text{Nc}ʻR(BʻR\vdash\dashv x)\leq \text{Nc}ʻR(BʻR\vdash\dashv \nu _{R})\}\\ [*121·481] &=\text{D}ʻR\cap \hat{x} \{R(BʻR\vdash\dashv x)\subset R(BʻR\vdash\dashv \nu _{R})\}\\ [*122·1.*121·103] &=\hat{x} \{(BʻR)R_{*}x:yR_{*}x.\supset _{y}.yR_{*}\nu _{R}\}\\ [*90·17·13.*10·1] &=\hat{x} \{(BʻR)R_{*}x.xR_{*}\nu _{R}\}\\ [*121·103] &=R(BʻR\vdash\dashv \nu _{R}) &\qquad \text{(2)}\\ [*121·601.*122·11] &=R(1_{R}\vdash\dashv \nu _{R}) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*122·36. $\vdash :\exists !\text{Prog}\cap t^{11}ʻx.\supset .\text{Infin ax}(x)$

Dem. $\begin{array}{l} \vdash .*122·35. &\supset \vdash :R\in \text{Prog}\cap t^{11}ʻx.\nu \in \text{NC induct}-\iota ʻ0.\supset .\exists !\nu (x) &\qquad \text{(1)}\\ \vdash .(1).*101·12. &\supset \vdash \colon\ldotp R\in \text{Prog}\cap t^{11}ʻx.\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\nu (x):\\ [*120·301] &\supset :\text{Infin ax}(x)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*122·37. $\vdash :R\in \text{Prog}.\supset .\text{D}ʻR{\sim}\in \text{Cls induct}.\text{N}_{0}\text{c}ʻ\text{D}ʻR{\sim}\in \text{NC induct}$

Dem. $\begin{array}{l} \vdash .*122·35. \supset \vdash \colon\ldotp R\in \text{Prog}.&\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\text{Cl}ʻ\text{D}ʻR\cap (\nu +_{c}1).\\ [*117·22·107] &\supset _{\nu }.\text{N}_{0}\text{c}ʻ\text{D}ʻR\geq \nu +_{c}1.\\ [*120·429] &\supset _{\nu }.\text{N}_{0}\text{c}ʻ\text{D}ʻR>\nu .\\ [*117·42] &\supset _{\nu }.\text{N}_{0}\text{c}ʻ\text{D}ʻR\neq \nu :\\ [*13·196] &\supset :\text{N}_{0}\text{c}ʻ\text{D}ʻR{\sim}\in \text{NC induct} &\qquad \text{(1)}\\ \vdash .(1).*120·21.\supset \vdash .\text{Prop} \end{array}$

*122·38. $\vdash :R\in \text{Prog}.\supset .\overrightarrow{R}_{*}ʻx\in \text{Cls induct} \quad[*121·7.*90·13.*120·212]$

*122·381. $\begin{align}&\vdash :R\in \text{Prog}.\nu \in \text{NC induct}-\iota ʻ0.\supset .\overrightarrow{R}_{*}ʻ\nu _{R}=R(1_{R}\vdash\dashv \nu _{R}).\overrightarrow{R}_{*}ʻ\nu _{R}\in \nu \\ &[*121·7.*122·35]\end{align}$

The following series of propositions are concerned in proving that any class contained in a progression is inductive if it has a last term, and is a progression if it has no last term. In the latter case, it is supposed arranged in the same order as it had in the original progression. A certain complication is necessary in order to define its one-one generating relation. If $R$ is the generating relation of the original progression, we proceed first to $R_{\text{po}}$ , then to $R_{\text{po}}\unicode{x0294f}\alpha$ , where $\alpha$ is the class in question; this gives us a transitive generating relation for $\alpha$ . Calling this relation $P$ , we then proceed to $P\dot{-} P^{2}$ , i.e. the relation of consecutive members of the series generated by $P$ . This relation turns out to be one-one, and to arrange $\alpha$ in a progression; hence our proposition is proved. The reason for the necessity of this detour is that consecutive members of $\alpha$ may not be consecutive members of the original progression.

*122*41. $\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.y\in \alpha -R_{\text{po}}ʻʻ\alpha .\supset .\alpha \subset R(BʻR\vdash\dashv y)$

Dem. $\begin{array}{l} \vdash .*37·1.*10·51.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in \alpha .\supset _{z}.{\sim}(yR_{\text{po}}z).\\ [*122·21] &\supset _{z}.zR_{*}y &\qquad \text{(1)}\\ \vdash .*122·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in \alpha .\supset _{z}.(BʻR)R_{*}z &\qquad \text{(2)}\\ \vdash .(1).(2).*121·103.\supset \vdash .\text{Prop} \end{array}$

*122·42. $\vdash :R\in \text{Prog}.\alpha \subset R(BʻR\vdash\dashv y).y\in \alpha .\supset .y= \text{max}_{R}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*121·103.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in \alpha .\supset _{z}.zR_{*}y.\\ [*91·574.*122·16] &\supset _{z}.{\sim}(yR_{\text{po}}z):\\ [*37·1.*10·51] &\supset :y{\sim}\in R_{\text{po}}ʻʻ\alpha : &\qquad \text{(1)}\\ [*96·303] &\supset :z\in \alpha -R_{\text{po}}ʻʻ\alpha .\supset _{z}.z=y &\qquad \text{(2)}\\ \vdash .(1).(2).*93·115.\supset \vdash .\text{Prop} \end{array}$

*122·43. $\begin{align}&\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.\exists !\alpha -R_{\text{po}}ʻʻ\alpha .\supset .\alpha \in \text{Cls induct}\\ &[*122·41.*121·45.*120·481]\end{align}$

Thus every class which is contained in a progression and has a last term is inductive. We have next to prove $R\in \text{Prog} .\alpha \subset \text{D}ʻR.\exists !\alpha .{\sim}\exists !\alpha -R_{\text{po}}ʻʻ\alpha .\supset .\alpha \in \text{D}ʻʻ\text{Prog}.$ This is effected in the following propositions.

*122·44. $\begin{align}\vdash :R\in \text{Prog} .\alpha \subset R_{\text{po}}ʻʻ\alpha .\exists !\alpha .P=R_{\text{po}}\unicode{x0294f}\alpha .Q&=P\dot{-} P^{2}.\supset .\\ &Q\in 1\rightarrow 1.Q\,\unicode{x2abd}\, R_{\text{po}}\end{align}$

Note. The hypothesis here exceeds what is necessary for the conclusion, but is the hypothesis required for *122·45, for which the present and the following propositions are lemmas.

Dem. $\begin{array}{l} \vdash .*23·43.*35·442.\supset \vdash :\text{Hp}.&\supset .Q\,\unicode{x2abd}\, R_{\text{po}} &\qquad \text{(1)}\\ \vdash .*36·13. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x,y,z\in \alpha .xR_{\text{po}}y.yR_{\text{po}}z.\supset .xP^{2}z:\\ [\text{Transp}] &\supset :x,y,z\in \alpha .xR_{\text{po}}y.{\sim}(xP^{2}z).\supset .{\sim}(yR_{\text{po}}z):\\ [*36·13] &\supset :xPy.{\sim}(xP^{2}z).\supset .{\sim}(yR_{\text{po}}z):\\ [*3·47] &\supset :xQy.xQz.\supset .{\sim}(yR_{\text{po}}z).{\sim}(zR_{\text{po}}y).\\ [*122·21.(1)] &\supset .y=z &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp}.&\supset :xQz.yQz.\supset .x=y &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*37·41.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻQ\subset \alpha &\qquad \text{(1)}\\ \vdash .*37·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \alpha .\supset .(\exists y).y\in \alpha .xR_{\text{po}}y.\\ [*36·13] &\supset .\exists !\overleftarrow{P}ʻx.\\ [*122·23.*93·11] &\supset .\exists !\overleftarrow{P}ʻx-\breve{R} _{\text{po}}ʻʻ\overleftarrow{P}ʻx.\\ [*35.442] &\supset .\exists !\overleftarrow{P}ʻx-\breve{P} ʻʻ\overleftarrow{P}ʻx.\\ [*37·311.*32·31·35] &\supset .\exists !\overleftarrow{Q}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).*33·4.\supset \vdash .\text{Prop} \end{array}$

In proving $P\,\unicode{x2abd}\, Q_{\text{po}}$ below, we assume $xPz$ and consider the maximum of $\overrightarrow{R}_{\text{po}}ʻz\cap\overleftarrow{Q}_{*}ʻx$ , which is shown to exist and be $Qʻz$ , whence $xQ_{\text{po}}z$ .

Dem. $\begin{array}{l} \vdash . *23·43.&\supset \vdash :\text{Hp}.\supset .Q\,\unicode{x2abd}\, P &\qquad \text{(1)}\\ \vdash . *91·56.&\supset \vdash \colon\ldotp \text{Hp}.\supset :P^{2}\,\unicode{x2abd}\, P:\\ [(1)] &\supset :S\,\unicode{x2abd}\, P.\supset .S\mid Q\,\unicode{x2abd}\, P &\qquad \text{(2)}\\ \vdash .(1).(2).*91·171.*41·151.&\supset \vdash \colon\ldotp \text{Hp}.\supset .Q_{\text{po}}\,\unicode{x2abd}\, P &\qquad \text{(3)}\\ \vdash .*36·13.*121·1.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xP^{2}z.\equiv .x,z\in \alpha .\exists !\alpha \cap R(x-z):\\ [\text{Transp}.\text{Fact}] &\supset :xQz.\equiv .x,z\in \alpha .xR_{\text{po}}z.\alpha \cap R(x-z)=\Lambda &\qquad \text{(4)}\\ \vdash .*122·441.&\supset \vdash \colon\ldotp \text{Hp}.xPz.\supset :x\in (\overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx):\\ [*122·27] &\supset :\exists !\overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx-R_{\text{po}}ʻʻ(\overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx):\\ [*37·461] &\supset :(\exists y).y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx.\overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx=\Lambda :\\ [*90·151] &\supset :(\exists y).y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx.\overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}ʻy=\Lambda :\\ [(4)] &\supset :(\exists y):y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx:\\ &{\sim}(\exists w).w\in \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz.\alpha \cap \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻw=\Lambda :\\ [*22·43.*91·56] &\supset :(\exists y).y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx:\\ &{\sim}(\exists w).w\in \alpha \cap \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz.\alpha \cap \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz\cap \overrightarrow{R}_{\text{po}}ʻw=\Lambda :\\ [*37·461] &\supset :(\exists y).y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx.\\ &{\sim}\exists !\alpha \cap :\overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz-\breve{R} _{\text{po}}ʻʻ(\alpha \cap \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz):\\ [*122*28.\text{Transp}] &\supset :(\exists y).y\in \overrightarrow{R}_{\text{po}}ʻz\cap \overleftarrow{Q}_{*}ʻx.\alpha \cap \overleftarrow{R}_{\text{po}}ʻy\cap \overrightarrow{R}_{\text{po}}ʻz=\Lambda :\\ [(4)] &\supset :(\exists y).y\in \overleftarrow{Q}_{*}ʻx.yQz:\\ [*91·52] &\supset :xQ_{\text{po}}z &\qquad \text{(5)}\\ \vdash .(3).(5).\supset \vdash .\text{Prop} \end{array}$

*122·443. $\vdash :\text{Hp}*122·44.\supset .\text{min}(R_{\text{po}})ʻ\alpha =BʻQ.\text{ᗡ}ʻQ=\alpha \cap \breve{R} _{\text{po}}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash . *91·504.*122·442. \supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻQ &= \text{ᗡ}ʻP\\ [*37·41] &=\alpha \cap \breve{R} _{\text{po}}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*122·441. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻQ=\alpha -\breve{R} _{\text{po}}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*122·23. &\supset \vdash .\text{Prop} \end{array}$

*122·444. $\vdash :\text{Hp}*122·44.\supset .\text{D}ʻQ=\overleftarrow{Q}_{*}ʻBʻQ$

Dem. $\begin{array}{l} \vdash .*122·443.*14·21.\supset \vdash :\text{Hp}.&\supset .\text{Hp}.\supset .\text{E}!BʻQ.\\ [*90·13] &\supset .\overleftarrow{Q}_{*}ʻBʻQ\subset CʻQ.\\ [*122·441·443] &\supset .\overleftarrow{Q}_{*}ʻBʻQʻ\subset \alpha &\qquad \text{(1)}\\ \vdash .*122·443.*96·303.&\supset \\ \vdash :\text{Hp}.x\in \alpha .x\neq BʻQ.&\supset .(BʻQ)R_{\text{po}}x.BʻQ.x\in \alpha .\\ [\text{Hp}] &\supset .(BʻQ)Px.\\ [*122·442] &\supset .(BʻQ)Q_{\text{po}}x &\qquad \text{(2)}\\ \vdash .(2).*91·54.&\supset \vdash :\text{Hp}.x\in \alpha .\supset .(BʻQ)Q_{*}x &\qquad \text{(3)}\\ \vdash .(1).(3). \supset \vdash :\text{Hp}.\supset .\overleftarrow{Q}_{*}ʻBʻQ&=\alpha \\ [*122·441] &= \text{D}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*122·45. $\begin{align}&\vdash :R\in \text{Prog}.\alpha \subset R_{\text{po}}ʻʻ\alpha .\exists !\alpha .P = R_{\text{po}}\unicode{x0294f}\alpha .Q = P\dot{-} P^{2}.\supset .\\ &Q\in \text{Prog}.\text{D}ʻQ = \alpha \quad[*122·44·444·441]\end{align}$

This proposition shows that every series extracted from a progression and having no last term is a progression.

*122·46. $\begin{align}&\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.\supset :\alpha \in \text{Cls induct} \cup \text{D}ʻʻ\text{Prog}\\ &[*122·43·45.*120·212]\end{align}$

This proposition shows that any number less than the number of terms in a progression is inductive. This result will be developed in the next number (*123).

*122·47. $\vdash \colon\ldotp R\in \text{Prog}.\alpha \subset \text{D}ʻR.\supset :\alpha \in \text{Cls induct} - \iota ʻ\Lambda .\equiv .\exists !\alpha -R_{\text{po}}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*122·45.&\supset \vdash :\text{Hp}.\exists !\alpha .{\sim}\exists !\alpha -R_{\text{po}}ʻʻ\alpha .\supset .\alpha \in \text{D}ʻʻ\text{Prog}.\\ [*122·37] &\supset .\alpha {\sim}\in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*122·43.\supset \vdash .\text{Prop} \end{array}$

*122·48. $\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.\alpha \in \text{Cls induct}.\supset .\text{D}ʻR-\alpha {\sim}\in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*120·71.&\supset \vdash :\alpha \subset \text{D}ʻR.\alpha ,\text{D}ʻR-\alpha \in \text{Cls induct}.\supset .\text{D}ʻR\in \text{Cls induct}:\\ [\text{Transp}] &\supset \vdash :\alpha \subset \text{D}ʻR.\alpha \in \text{Cls induct}.\text{D}ʻR{\sim}\in \text{Cls induct}.\supset .\\ &\text{D}ʻR-\alpha {\sim}\text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*122·37.\supset \vdash .\text{Prop} \end{array}$

*122·49. $\begin{align}&\vdash :R\in \text{Prog}.\alpha \subset \text{D}ʻR.\alpha \in \text{Cls induct}.\supset .\text{D}ʻR-\alpha \in \text{D}ʻʻ\text{Prog}\\ &[*122·46·48]\end{align}$

The following propositions are concerned with circumstances under which the posterity or the family of a term forms a progression.

*122·51. $\vdash :P\in \text{Cls}\rightarrow 1.I_{P}ʻx=\Lambda .x\in \text{D}ʻP.\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP.\supset .(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}$

Dem. $\begin{array}{l} \vdash .*71·261.*96·13.\supset \vdash :\text{Hp}.Q&=(\overleftarrow{P}_{*}ʻx)\upharpoonleft P.\supset .\\ &Q\in \text{Cls}\rightarrow 1.Q_{\text{po}}=(\overleftarrow{P}_{*}ʻx)\upharpoonleft P_{\text{po}}. &\qquad \text{(1)}\\ [*96·104] &\supset .Q_{\text{po}}\,\unicode{x2abd}\, J &\qquad \text{(2)}\\ \vdash .*35·61.*37·4. \supset \vdash :\text{Hp}(1).\supset .\text{D}ʻQ=\overleftarrow{P}_{*}ʻx.\text{ᗡ}ʻQ&=\breve{P} ʻʻ\overleftarrow{P}_{*}ʻx &\qquad \text{(3)}\\ [*91·52] &=\overleftarrow{P}_{\text{po}}ʻx\\ [(1)] &=\overleftarrow{Q}_{\text{po}}ʻx\\ [(2).*91·542] &=\overleftarrow{Q}_{*}ʻx-\iota ʻx &\qquad \text{(4)}\\ \vdash .(1).(3).(4). &\supset \vdash :\text{Hp}(1).\supset .\text{D}ʻQ=\overleftarrow{Q}_{*}ʻx.\text{ᗡ}ʻQ=\overleftarrow{Q}_{*}ʻx-\iota ʻx.\\ [*93·101] &\supset .\overrightarrow{B}ʻQ=\iota ʻx.\text{D}ʻQ=\overleftarrow{Q}_{*}ʻx &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \\ \vdash :\text{Hp}.Q&=(\overleftarrow{P}_{*}ʻx)\upharpoonleft P.\supset .Q\in \text{Cls} \rightarrow 1.Q_{\text{po}}\,\unicode{x2abd}\, J.\text{D}ʻQ=\overleftarrow{Q}_{*}ʻBʻQ.\\ [*122·17] &\supset .Q\in \text{Prog} :\supset \vdash . \text{Prop} \end{array}$

The following proposition (*122·52) is used in *123·191, *261·4 and *264·22.

*122·52. $\vdash :P\in 1\rightarrow 1.x\in \text{D}ʻP.{\sim}(xP_{\text{po}}x).\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP.\supset .(\overleftarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}$

Dem. $\begin{array}{l} \vdash .*96·492.\supset \vdash :\text{Hp}.\supset .I_{P}ʻx=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*122·51.\supset \vdash . \text{Prop} \end{array}$

*122·53. $\vdash :P\in 1\rightarrow 1.x\in sʻ \text{gen}ʻP.\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP.\supset .(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}$

Dem. $\begin{array}{l} \vdash .*97·21.&\supset \vdash :\text{Hp}.\supset .(\exists y).yBP.\overleftrightarrow{P}_{*}ʻx=\overleftarrow{P}_{*}ʻy.\\ [*96·23.*93·1] &\supset .(\exists y).y\in \text{D}ʻP.\overleftrightarrow{P}_{*}ʻx=\overleftarrow{P}_{*}ʻy.I_{P}ʻy=\Lambda .\\ [*97·17.*91·504.\text{Hp}] &\supset .(\exists y).y\in \text{D}ʻP.\overleftarrow{P}_{*}ʻy\subset \text{D}ʻP.I_{P}ʻy=\Lambda .\overleftrightarrow{P}_{*}ʻx=\overleftarrow{P}_{*}ʻy.\\ [*122·51] &\supset .(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog} :\supset \vdash . \text{Prop} \end{array}$

*122·54. $\vdash :P\in 1\rightarrow 1.x\in sʻ \text{gen}ʻP-sʻ \text{gen}ʻ\breve{P} .\supset .(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}$

Dem. $\begin{array}{l} \vdash .*93·27·272.\supset \vdash :\text{Hp}.&\supset .x\in sʻ \text{gen}ʻP\cap pʻ\text{ᗡ}ʻʻ \text{Pot} ʻ\breve{P} .\\ [*93·381] &\supset .x\in sʻ \text{gen}ʻP.\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP &\qquad \text{(1)}\\ \vdash .(1).*122·53.\supset \vdash . \text{Prop} \end{array}$

*122·55. $\vdash \colon\ldotp P\in 1\rightarrow 1.\supset :x\in sʻ \text{gen}ʻP-sʻ \text{gen}ʻ\breve{P} .\equiv .(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P\in \text{Prog}$

Dem. $\begin{array}{l} \vdash .*35·61. &\supset \vdash :Q=(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P.\supset .\text{D}ʻQ=\overleftrightarrow{P}_{*}ʻx\cap \text{D}ʻP &\qquad \text{(1)}\\ \vdash .*37·4. &\supset \vdash \colon\ldotp Q=(\overleftrightarrow{P}_{*}ʻx)\upharpoonleft P.\supset :\text{ᗡ}ʻQ=\breve{P} ʻʻ\overleftrightarrow{P}_{*}ʻx:\\ [*97·17.*92·111.*91·54·52] &\supset :Q\in 1\rightarrow 1.\supset .\text{ᗡ}ʻQ=\overleftrightarrow{P}_{*}ʻx\cap \text{ᗡ}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash \colon\ldotp \text{Hp}.\text{Hp}(1).&\supset :\exists !\overrightarrow{B}ʻQ.\supset .\exists !\overleftrightarrow{P}_{*}ʻx-\text{ᗡ}ʻP .\\ [*97·17.*91·504] &\supset .\exists !\overrightarrow{P}_{*}ʻx-\text{ᗡ}ʻP.\\ [*93·38·27] &\supset .x\in sʻ\text{gen}ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp \text{Hp}(3).&\supset :\text{D}ʻQ=CʻQ.\supset .\overleftrightarrow{P}_{*}ʻx\cap \text{D}ʻP=\overleftrightarrow{P}_{*}ʻx.\\ [*22·621] &\supset .\overleftrightarrow{P}_{*}ʻx\subset \text{D}ʻP.\\ [*97·13] &\supset .\overleftarrow{P}_{*}ʻx\subset \text{D}ʻP.\\ [*93·381·275] &\supset .x{\sim}\in sʻ\text{gen}ʻ\breve{P} &\qquad \text{(4)}\\ \vdash .(3).(4).*122·11·141·54.\supset \vdash .\text{Prop} \end{array}$

In this number we are concerned with the arithmetical properties of $\aleph _{0}$ , the smallest of Cantor's transfinite cardinals. Cantor defines $\aleph _{0}$ as the cardinal number of any class which can be put into one-one relation with the inductive cardinals. This definition assumes that $\nu \neq \nu +_{c}1$ , when $\nu$ is an inductive cardinal; in other words, it assumes the axiom of infinity; for without this, the inductive cardinals would form a finite series, with a last term, namely $\Lambda$ . For this reason among others, we do not make similarity with the inductive cardinals our definition. We define $\aleph _{0}$ as the class of those classes which can be arranged in progressions, i.e. as $\text{D}ʻʻ\text{Prog}$ . We then have to prove that $\aleph _{0}$ so defined is a cardinal, and that if it is not null, it is the number of the inductive numbers.

For convenience we put for the moment $N$ for the relation of $\mu$ to $\mu +_{c}1$ when $\mu$ is an inductive cardinal. We then easily prove

*123·21·23. $\vdash .N\in \text{Cls}\rightarrow 1.\text{D}ʻN=\text{NC induct}.BʻN=0.\overleftarrow{N}_{*}ʻ0=\text{NC induct}$

The only thing further required to prove $N\in \text{Prog}$ is $N\in 1\rightarrow \text{Cls}$ , i.e. $\mu ,\nu \in \text{NC induct}.\mu +_{c}1=\nu +_{c}1.\supset .\mu =\nu .$

By *120·311, this holds if $\exists !\mu +_{c}1$ , which holds if $\text{Infin ax}$ holds. Hence

*123·25·26. $\vdash :\text{Infin ax}(x).\supset .N\unicode{x0294f}t^{3}ʻx\in \text{Prog}.\text{NC induct}\cap t^{3}ʻx\in \aleph _{0}$

*123·27. $\vdash :\exists !\aleph _{0}(x).\supset .\text{NC induct}\cap t^{3}ʻx\in \aleph _{0}$

Again it is obvious from *122·34 ·341 that if $R$ is a progression, $\text{D}ʻR$ can always be put into a $1\rightarrow 1$ relation to the inductive cardinals (*123·3) since $\text{D}ʻR$ consists of the terms $1_{R}$ , $2_{R}$ , ... $\nu _{R}$ , ..., and all the inductive cardinals are used in putting $\text{D}ʻR$ into this form. Hence

*123·31. $\vdash :\alpha \in \aleph _{0}.\supset .\alpha \text{ sm }\text{NC induct}$

*123·311. $\vdash :\alpha ,\beta \in \aleph _{0}.\supset .\alpha \text{ sm }\beta$

It remains to prove that any class similar to the inductive cardinals is an $\aleph _{0}$ ; this can only be proved by assuming the axiom of infinity. We prove[Pg 269] first (*120·32) that if $R$ is a progression, and $S$ is a one-one whose converse domain is $\text{D}ʻR$ , then $S\mid R\mid \breve{S}$ is a progression whose domain is $\text{D}ʻS$ . Hence

*123·321. $\vdash :\alpha \in \aleph _{0}.\alpha \text{ sm }\beta .\supset .\beta \in \aleph _{0}$

From this and $\alpha$ , $\beta \in \aleph _{0}.\supset .\alpha\text{ sm }\beta$ , we obtain

*123·322. $\vdash :\alpha \in \aleph _{0}.\supset .\aleph _{0}=\text{Nc}ʻ\alpha$

*123·34. $\vdash :\text{Infin ax}(x).\supset .\aleph _{0}=\text{Nc}ʻ(\text{NC induct}\cap t^{3}ʻx)$

Also we have, by *120·322 above, $\exists !\aleph _{0}.\supset .\aleph _{0}\in \text{NC},$ whence, since $\Lambda \in \text{NC}$ , we obtain at last

As to the existence of $\aleph _{0}$ in various types, if $\text{Infin ax}(x)$ holds, i.e. if, given any inductive cardinal $\nu$ , there are classes having $\nu$ terms and composed of terms of the same type as $x$ , then $\text{NC induct}(tʻx)\in\aleph _{0}(t^{2}ʻx)$ . Thus

*123·37. $\vdash :\text{Infin ax}(x).\supset .\exists !\aleph _{0}(t^{2}ʻx).\aleph _{0}(t^{2}ʻx)\in \text{N}_{0}\text{C}$

The arithmetical properties of $\aleph _{0}$ in regard to addition, multiplication and exponentiation by an inductive cardinal are easily proved. We have

*123·41. $\vdash :\nu \in \text{NC induct}.\supset .\aleph _{0}=\aleph _{0}+_{c}\nu$

*123·421. $\vdash .\aleph _{0}=\aleph _{0}+_{c}\aleph _{0}=2\times _{c}\aleph _{0}$

*123·422. $\vdash :\nu \in \text{NC induct}-\iota ʻ0.\supset .\nu \times _{c}\aleph _{0}=\aleph _{0}$

*123·52. $\vdash .\aleph _{0}=\aleph _{0}\times _{c}\aleph _{0}=\aleph _{0}^{2}$

*123·53. $\vdash :\nu \in \text{NC induct}-\iota ʻ0.\supset .\aleph _{0}^\nu =\aleph _{0}$

The early propositions of the present number are for the most part immediate consequences of propositions proved in *122.

*123·02. $N=\hat{\mu} \hat{\nu} \{\mu \in \text{NC induct}.\nu =(\mu +_{c}1)\cap t_{0}ʻ\mu\} \quad\text{Dft} [*123—4]$

*123·1. $\vdash :\alpha \in \aleph _{0}.\equiv .(\exists R).R\in \text{Prog}.\alpha =\text{D}ʻR \quad[*37·1.(*123·01)]$

*123·101. $\vdash :R\in \text{Prog}.\supset .\text{D}ʻR\in \aleph _{0} \quad[*123·1]$

*123·11. $\vdash :R\in 1\rightarrow 1.\text{D}ʻR=\overleftarrow{R}_{*}ʻBʻR.\supset .\text{D}ʻR\in \aleph _{0} \quad[*123·101.*122·1]$

*123·12. $\begin{align}\vdash :\alpha \in \aleph _{0}.\supset .(\exists R).\text{D}ʻR=\alpha .R\in 1\rightarrow 1.\text{ᗡ}ʻR&\subset \text{D}ʻR.\overrightarrow{B}ʻR\in 1\\ &[*123·1.*122·141·11]\end{align}$

*123·13. $\vdash :\alpha \in \aleph _{0}.\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\alpha +_{c}1$

Dem. $\begin{array}{l} \vdash .*123·12.*110·32.&\supset \\ \vdash :\alpha \in \aleph _{0}.&\supset .(\exists R).\text{D}ʻR=\alpha .R\in 1\rightarrow 1.\text{Nc}ʻ\text{D}ʻR=\text{Nc}ʻ\text{ᗡ}ʻR+_{c}1.\\ [*100·321] &\supset .(\exists R).\text{D}ʻR=\alpha .\text{Nc}ʻ\text{D}ʻR=\text{Nc}ʻ\text{D}ʻR+_{c}1.\\ [*35·94.*13·195] &\supset .\text{Nc}ʻ\alpha =\text{Nc}ʻ\alpha +_{c}1:\supset \vdash .\text{Prop} \end{array}$

*123·14. $\vdash :\alpha \in \aleph _{0}.\nu \in \text{NC induct}.\supset .\exists !\nu \cap \text{Cl}ʻ\alpha \quad[*122·35]$

*123·15. $\vdash :\alpha \in \aleph _{0}.\supset .\alpha {\sim}\in \text{Cls induct} \quad[*122·37]$

*123·16. $\vdash :\alpha \in \aleph _{0}.\supset .\text{Cl}ʻ\alpha \subset \text{Cls induct}\cup \aleph _{0} \quad[*122·46]$

*123·17. $\vdash :\alpha \in \aleph _{0}.\beta \in \text{Cls induct}.\supset .\alpha -\beta \in \aleph _{0}$

Dem. $\begin{array}{l} \vdash .*120·481.\supset \vdash :\text{Hp}.&\supset .\alpha \cap \beta \in \text{Cls induct}.\\ [*122·49] &\supset .\alpha -(\alpha \cap \beta )\in \aleph _{0}:\supset \vdash .\text{Prop} \end{array}$

*123·18. $\vdash :\exists !\aleph _{0}(x).\supset .\text{Infin ax}(x) \quad[*122·36]$

*123·19. $\vdash :R\in \text{Prog}.\exists !\alpha .\alpha \subset R_{\text{po}}ʻʻ\alpha .\supset .\alpha \in \aleph _{0} \quad[*122·45]$

*123·191. $\begin{align}&\vdash :R\in 1\rightarrow 1.x\in \text{D}ʻR.{\sim}(xR_{\text{po}}x).&\overleftarrow{R}_{*}ʻx\subset \text{D}ʻR.\supset .\overleftarrow{R}_{*}ʻx\in \aleph _{0}\\ &[*122·52]\end{align}$

*123·192. $\vdash :R\in 1\rightarrow 1.\text{ᗡ}ʻR\subset \text{D}ʻR.\supset .\overleftarrow{R}_{*}ʻʻ\overrightarrow{B}ʻR\subset \aleph _{0}$

Dem. $\begin{array}{l} \vdash .*93·101. &\supset \vdash :x\in \overrightarrow{B}ʻR.\supset .x\in \text{D}ʻR &\qquad \text{(1)}\\ \vdash .*91·504.*93·101. &\supset \vdash :x\in \overrightarrow{B}ʻR.\supset .{\sim}(xR_{\text{po}}x) &\qquad \text{(2)}\\ \vdash .*90·13. &\supset \vdash :\text{ᗡ}ʻR\subset \text{D}ʻR.\supset .\overleftarrow{R}_{*}ʻx\subset \text{D}ʻR &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*123·191. &\supset \vdash :\text{Hp}.x\in \overrightarrow{B}ʻR.\supset .\overleftarrow{R}_{*}ʻx\in \aleph _{0}:\supset \vdash .\text{Prop} \end{array}$

*123·2. $\vdash :\mu N\nu .\equiv .\mu \in \text{NC induct}.\nu =(\mu +_{c}1)\cap t_{0}ʻ\mu \quad[(*123·02)]$

*123·21. $\vdash .N\in \text{Cls}\rightarrow 1.\text{D}ʻN=\text{NC induct}.\text{ᗡ}ʻN=\text{NC induct}-\iota ʻ0.BʻN=0$

Dem. $\begin{array}{l} \vdash .*123·2.*13·172. &\supset \vdash :\mu N\nu .\mu N\varpi .\supset .\nu =\varpi :\\ [*71·171] &\supset \vdash .N\in \text{Cls}\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*123·2. &\supset \vdash .\text{D}ʻN=\text{NC induct} &\qquad \text{(2)}\\ \vdash .*123·2. \supset \vdash .\text{ᗡ}ʻN&=\hat{\nu} \{(\exists \mu ).\mu \in \text{NC induct}.\nu =\mu +_{c}1\}\\ [*120·423] &=\text{NC induct}-\iota ʻ0 &\qquad \text{(3)}\\ \vdash .(2).(3).*93·101.&\supset \vdash .BʻN=0 &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).&\supset \vdash .\text{Prop} \end{array}$

*123·22. $\vdash .\breve{N} =(+_{c}1)\upharpoonright \text{NC induct} \quad[*123·2]$

Dem. $\begin{array}{l} \vdash .*123·22.\supset \vdash .\overleftarrow{N}_{*}ʻ0&=\hat{\mu} [\mu \{(+_{c}1)\upharpoonright \text{NC induct}\}_{*}0]\\ [*120·1.*96·21·131]&=\hat{\mu} [\mu \{\text{NC induct}\upharpoonleft (+_{c}1)_{*}\}0]\\ [*120·1] &=\text{NC induct} &\qquad \text{(1)}\\ \vdash .(1).*123·21.\supset \vdash .\text{Prop} \end{array}$

*123·24. $\vdash :\text{Infin ax}(x).\supset .N\unicode{x0294f}t^{3}ʻx\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*120·301·121.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \mu \in &\text{NC induct}.\supset :\exists !(\mu +_{c}1)\cap t^{2}ʻx:\\ [*120·311] &\supset :(\mu +_{c}1)\cap t^{2}ʻx=\nu +_{c}1.\supset .\mu =\nu :\\ [*123·2.*71·17] &\supset :N\unicode{x0294f}t^{3}ʻx\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .(1).*123·21.\supset \vdash .\text{Prop} \end{array}$

*123·25. $\vdash :\text{Infin ax}(x).\supset .N\unicode{x0294f}t^{3}ʻx\in \text{Prog} \quad[*123·21·23·24.*122·1]$

*123·26. $\vdash :\text{Infin ax}(x).\supset .\text{NC induct}\cap t^{3}ʻx\in \aleph _{0} \quad[*123·25·21·101]$

*123·27. $\vdash :\exists !\aleph _{0}(x).\supset .\text{NC induct}\cap t^{3}ʻx\in \aleph _{0} \quad[*123·26·18]$

*123·3. $\begin{align}\vdash :R\in \text{Prog}.&S=\hat{x} \hat{\nu} \{\nu \in \text{NC induct}.x=(\nu +_{c}1)_{R}\}.\supset .\\ &S\in 1\rightarrow 1.\text{D}ʻS=\text{D}ʻR.\text{ᗡ}ʻS=\text{NC induct}\end{align}$

Dem. $\begin{array}{l} \vdash .*120·423.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻS=\hat{x} \{(\exists \mu ).\mu \in \text{NC induct}-\iota ʻ0.x=\mu _{R}\}\\ [*122·341] &=\text{D}ʻR &\qquad \text{(1)}\\ \vdash .*14·204.*122·34.&\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻS=\hat{\nu} \{\text{E}!(\nu +_{c}1)_{R}\}\\ [*122·34] &=\hat{\nu} \{\nu +_{c}1\in \text{NC induct}-\iota ʻ0\} &\qquad \text{(2)}\\ \vdash .*122·36.*120·3. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\nu +_{c}1\in \text{NC induct}.\supset .\exists !\nu +_{c}1.\\ [*120·422] &\supset .\nu \in \text{NC induct} &\qquad \text{(3)}\\ \vdash .(3).*120·421·121.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\nu +_{c}1\in \text{NC induct}-\iota ʻ0.\equiv .\\ &\nu \in \text{NC induct} &\qquad \text{(4)}\\ \vdash .(2).(4). &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻS=\text{NC induct} &\qquad \text{(5)}\\ \vdash .*13·172.*71·17. &\supset \vdash :\text{Hp}.\supset .S\in 1\rightarrow \text{Cls} &\qquad \text{(6)}\\ \vdash .*121·631. &\supset \vdash \colon\ldotp \text{Hp}.\supset :xS\mu .xS\nu .\supset .\\ &\text{Nc}ʻR(BʻR\vdash\dashv x)=\mu +_{c}1.\text{Nc}ʻR(BʻR\vdash\dashv x)=\nu +_{c}1.\\ [*13·171] &\supset .\mu +_{c}1=\nu +_{c}1 &\qquad \text{(7)}\\ \vdash .(5).*122·36.*120·3.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xS\mu .\supset .\exists !\mu +_{c}1:\\ [*120·41] &\supset :xS\mu .\mu +_{c}1=\nu +_{c}1.\supset .\mu =\nu :\\ [(7)] &\supset :xS\mu .xS\nu .\supset .\mu =\nu :\\ [*71·171] &\supset :S\in \text{Cls}\rightarrow 1 &\qquad \text{(8)}\\ \vdash .(1).(5).(6).(8).\supset \vdash .\text{Prop} \end{array}$

*123·31. $\vdash :\alpha \in \aleph _{0}.\supset .\alpha \text{ sm }\text{NC induct} \quad[*123·3]$

*123·311. $\vdash :\alpha ,\beta \in \aleph _{0}.\supset .\alpha \text{ sm }\beta \quad[*123·31.*73·31·32]$

*123·312. $\begin{align}\vdash :R\in &\text{Prog}.S\in 1\rightarrow 1.\text{ᗡ}ʻS=\text{D}ʻR.\supset .\\ &S\mid R\mid \breve{S} \in 1\rightarrow 1.\text{D}ʻS=\text{D}ʻ(S\mid R\mid \breve{S} ).SʻBʻR=Bʻ(S\mid R\mid \breve{S} )\end{align}$

Dem. $\begin{array}{l} \vdash .*71·252.*122·1. &\supset \vdash :\text{Hp}.\supset .S\mid R\mid \breve{S} \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*122·141.*37·321.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻ(R\mid \breve{S} )=\text{D}ʻR =\text{ᗡ}ʻS. &\qquad \text{(2)}\\ [*37·323] &\supset .\text{D}ʻ(S\mid R\mid \breve{S} )=\text{D}ʻS &\qquad \text{(3)}\\ \vdash .(2).*37·32. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻ(S\mid R\mid \breve{S} ) = Sʻʻ\text{ᗡ}ʻR &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ(S\mid R\mid \breve{S} )&=\text{D}ʻS-Sʻʻ\text{ᗡ}ʻR\\ [*37·25.\text{Hp}] &=Sʻʻ\text{D}ʻR-Sʻʻ\text{ᗡ}ʻR\\ [*71·381] &=Sʻʻ\overrightarrow{B}ʻR\\ [*122·11.*53·31] &=\iota ʻSʻBʻR &\qquad \text{(5)}\\ \vdash .(1).(3).(5).\supset \vdash .\text{Prop} \end{array}$

*123·313. $\vdash :R\in \text{Prog}.S\in 1\rightarrow 1.\text{ᗡ}ʻS=\text{D}ʻR.P= S\mid R\mid \breve{S} .\supset .\text{D}ʻP=\overleftarrow{P}_{*}ʻBʻP$

Dem. $\begin{array}{l} \vdash .*34·36.*123·312.\supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻP\subset \text{D}ʻP.\text{E}!BʻP.\\ [*90·13] &\supset .\overleftarrow{P}_{*}ʻBʻP\subset \text{D}ʻP &\qquad \text{(1)}\\ \vdash .*123·312. &\supset \vdash :\text{Hp}.\supset .SʻBʻR \in \overleftarrow{P}_{*}ʻBʻP &\qquad \text{(2)}\\ \vdash .*33·14. &\supset \vdash :\text{Hp}.Sʻx\in \overleftarrow{P}_{*}ʻBʻP.xRy.\supset .y\in \text{ᗡ}ʻR.\\ [*122·141.\text{Hp}] &\supset .y\in \text{ᗡ}ʻS.\\ [*71·16] &\supset .\text{E}!Sʻy.\\ [*30·32.*34·1] &\supset .Sʻx(S\mid R\mid \breve{S} )Sʻy.\\ [\text{Hp}] &\supset .SʻxPSʻy.\\ [*90·163] &\supset .Sʻy\in \overleftarrow{P}_{*}ʻBʻP &\qquad \text{(3)}\\ \vdash .(2).(3).*90·112.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(BʻR)R_{*}x.\supset .Sʻx\in \overleftarrow{P}_{*}ʻBʻP:\\ [*37·63] &\supset :Sʻʻ\overleftarrow{R}_{*}ʻBʻR\subset \overleftarrow{P}_{*}ʻBʻP:\\ [*122·1] &\supset :Sʻʻ\text{D}ʻR\subset \overleftarrow{P}_{*}ʻBʻP:\\ [*37·25.\text{Hp}] &\supset :\text{D}ʻS\subset \overleftarrow{P}_{*}ʻBʻP:\\ [*123·312] &\supset :\text{D}ʻP\subset \overleftarrow{P}_{*}ʻBʻP &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*123·32. $\begin{align}&\vdash :R\in \text{Prog}.S\in 1\rightarrow 1.\text{ᗡ}ʻS=\text{D}ʻR.\supset .\\ &S\mid R\mid \breve{S} \in \text{Prog}.\text{D}ʻS=\text{D}ʻS\mid R\mid \breve{S} .SʻBʻR=Bʻ(S\mid R\mid \breve{S} ) \quad[*123·312·313]\end{align}$

*123·321. $\vdash :\alpha \in \aleph _{0}.\alpha \text{ sm }\beta .\supset .\beta \in \aleph _{0} \quad[*123·32]$

*123·322. $\vdash :\alpha \in \aleph _{0}.\supset .\aleph _{0}=\text{Nc}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*123·311·321.&\supset \vdash \colon\ldotp \alpha \in \aleph _{0}.\supset :\beta \in \aleph _{0}.\equiv .\beta \text{ sm }\alpha &\qquad \text{(1)}\\ \vdash .(1).*100·1.&\supset \vdash .\text{Prop} \end{array}$

*123·323. $\vdash :R\in \text{Prog}.\supset .\aleph _{0}=\text{Nc}ʻ\text{D}ʻR \quad[*123·322]$

*123·33. $\vdash \colon\ldotp \text{Infin ax}(x).\supset :\alpha \in \aleph _{0}.\equiv .\alpha \text{ sm }(\text{NC induct}\cap t^{3}ʻx) \quad[*123·26·321·31]$

*123·34. $\vdash :\text{Infin ax}(x).\supset .\aleph _{0}=\text{Nc}ʻ(\text{NC induct}\cap t^{3}ʻx) \quad[*123·33]$

*123·35. $\vdash :\exists !\aleph _{0}(x).\supset .\aleph _{0}(x)=\text{Nc}ʻ(\text{NC induct}\cap t^{3}ʻx) \quad[*123·34·18]$

*123·361. $\vdash :\exists !\aleph _{0}.\supset .\aleph _{0}{\sim}\in \text{NC induct} \quad[*123·15·322.*120·211]$

*123·37. $\vdash :\text{Infin ax}(x).\supset .\exists !\aleph _{0}(t^{2}ʻx).\aleph _{0}(t^{2}x)\in \text{N}_{0}\text{C}$

Dem. $\begin{array}{l} \vdash .*120·301.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\nu (x):\\ [*65·13] &\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\nu .\nu =\nu (x):\\ [(*65·02)] &\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\nu :\text{NC induct}\subset t^{3}ʻx:\\ [*123·34] &\supset :\text{NC induct}\in \aleph _{0}.\text{NC induct}\subset t^{3}ʻx:\\ [(*65·02)] &\supset :\text{NC induct}\in \aleph _{0}(t^{2}ʻx) &\qquad \text{(1)}\\ \vdash .(1).*103·34.*123·36.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*118·12.*117·6.*123·322.&\supset \vdash :(\aleph _{0})_{\eta }=\Lambda .\supset .(\aleph _{0}+_{c}1)_{\eta }=\Lambda &\qquad \text{(1)}\\ \vdash .*123·13·322. &\supset \vdash :\exists !(\aleph _{0})_{\eta }.\supset .(\aleph _{0})_{\eta }=(\aleph _{0}+_{c}1)_\eta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*123·401. $\vdash :\exists !\aleph _{0}.\supset .\aleph _{0}=\aleph _{0}-_{c}1$

Dem. $\begin{array}{l} \vdash .*120·124.*123·36·4.\supset \vdash :\exists !\aleph _{0}.&\supset. \aleph _{0}\in \text{NC}-\iota ʻ0.\\ [*120·414·416] \supset .(\aleph _{0}-_{c}1)+_{c}1&=\aleph _{0}\\ [*123·4] &=\aleph _{0}+_{c}1.\\ [*120·311] &\supset .\aleph _{0}-_{c}1=\aleph _{0} &\qquad \text{(1)}\\ \vdash .*119·11.&\supset \vdash :(\aleph _{0})_{\eta }=\Lambda .\supset .(\aleph _{0})_{\eta }=(\aleph _{0}-_{c}1)_{\eta } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*123·41. $\vdash :\nu \in \text{NC induct}.\supset .\aleph _{0}=\aleph _{0}+_{c}\nu \quad[*123·4.*120·11]$

*123·411. $\vdash :\nu \in \text{NC induct}.\supset .\aleph _{0}=\aleph _{0}-_{c}\nu \quad[*123·401.*120·11]$

*123·42. $\vdash :P\in \text{Prog}.Q=P^{2}.\supset .\overleftarrow{Q}_{*}ʻ1_{P},\overleftarrow{Q}_{*}ʻ2_{P}\in \aleph _{0}.\overleftarrow{Q}_{*}ʻ1_{P}\cap \overleftarrow{Q}_{*}ʻ2_{P}=\Lambda$

Note that $\overleftarrow{Q}_{*}ʻ1_{P}$ is the odd terms and $\overleftarrow{Q}_{*}ʻ2_{P}$ the even terms of $\text{D}ʻP$ .

Dem. $\begin{array}{l} \vdash .*91·6. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\overleftarrow{Q}_{*}ʻ1_{P}\subset \overleftarrow{P}_{*}ʻ1_{P}.\overleftarrow{Q}_{*}ʻ2_{P}\subset \overleftarrow{P}_{*}ʻ2_{P}:\\ [*122·1] &\supset :\overleftarrow{Q}_{*}ʻ1_{P}\subset \text{D}ʻP:\\ [*33·13] \supset :y\in \overleftarrow{Q}_{*}ʻ1_{P}.&\supset .(\exists z).yPz.\\ [*122·141] &\supset .(\exists z,w).yPz.zPw.\\ [\text{Hp}.*90·163.*91·503] &\supset .(\exists w).yQw.w\in \overleftarrow{Q}_{*}ʻ1_{P}.yP_{\text{po}}w:\\ [*37·1] &\supset :\overleftarrow{Q}_{*}ʻ1_{P}\subset P_{\text{po}}ʻʻ\overleftarrow{Q}_{*}ʻ1_{P}:\\ [*123·19] &\supset :\overleftarrow{Q}_{*}ʻ1_{P}\in \aleph _{0} &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\overleftarrow{Q}_{*}ʻ2_{P}\in \aleph _{0} &\qquad \text{(2)}\\ \vdash .*121·601·602. \supset \vdash :\text{Hp}.&\supset .1_{P}P2_{P}.\\ [*122·16.*91·52·6] &\supset .{\sim}(2_{P}Q_{*}1_{P}) &\qquad \text{(3)}\\ \vdash .*121·602.*53·31.*93·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\overrightarrow{Q}ʻ2_{P}=\overrightarrow{P}ʻ1_{P}=\Lambda :\\ [*13·14] &\supset :yQz.\supset .z\neq 2_{P}:\\ [*91·542] &\supset :2_{P}Q_{*}z.yQz.\supset .2_{P}Q_{\text{po}}z.yQz.\\ [*92·11] &\supset .2_{P}Q_{*}y:\\ [\text{Transp}] &\supset :{\sim}(2_{P}Q_{*}y).yQz.\supset .{\sim}(2_{P}Q_{*}z) &\qquad \text{(4)}\\ \vdash .(3).(4).*90·112.&\supset \vdash \colon\ldotp \text{Hp}.\supset :1_{P}Q_{*}z.\supset .{\sim}(2_{P}Q_{*}z) &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

*123·421. $\vdash .\aleph _{0}=\aleph _{0}+_{c}\aleph _{0}=2\times _{c}\aleph _{0}$

Dem. $\begin{array}{l} \vdash .*123*42. \supset \vdash :\alpha \in \aleph _{0}.&\supset .(\exists \beta ,\gamma ).\beta ,\gamma \in \aleph _{0}.\beta \cap \gamma =\Lambda .\beta \cup \gamma \subset \alpha .\\ [*110·32.*117·22] &\supset .\text{Nc}ʻa\geq \aleph _{0}+_{c}\aleph _{0} &\qquad \text{(1)}\\ \vdash .(1).*117·6·23. \supset \vdash :\exists !\aleph _{0}.&\supset .\aleph _{0}=\aleph _{0}+_{c}\aleph _{0} &\qquad \text{(2)}\\ \vdash .(2).*118·12.*117·6.&\supset \vdash .\aleph _{0}=\aleph _{0}+_{c}\aleph _{0} &\qquad \text{(3)}\\ \vdash .(3).*113·66.\supset \vdash .\text{Prop} \end{array}$

*123·422. $\vdash :\nu \in \text{NC induct}-\iota ʻ0.\supset .\nu \times _{c}\aleph _{0}=\aleph _{0}$

Dem. $\begin{array}{l} \vdash :*113·671. \supset \vdash :\nu \times _{c}\aleph _{0}=\aleph _{0}.\supset .(\nu +_{c}1)\times \aleph _{0}&=\aleph _{0}+_{c}\aleph _{0}\\ [*123·421] &=\aleph _{0} &\qquad \text{(1)}\\ \vdash .(1).*120·47. \supset \vdash .\text{Prop} \end{array}$

*123·43. $\vdash \colon\ldotp \exists !\aleph _{0}.\supset :\nu \in \text{NC induct}.\supset _{\nu }.\aleph _{0}>\nu$

Dem. $\begin{array}{l} \vdash .*123·18·36·361. &\supset \vdash :\text{Hp}.\supset .\aleph _{0}\in \text{NC}-\text{NC induct}-\iota ʻ\Lambda .\\ &\text{NC induct}\subset -\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .(1).*120·49.\supset \vdash .\text{Prop} \end{array}$

*123·44. $\vdash \colon\ldotp \exists !\aleph _{0}.\supset :\nu \in \text{NC induct} \cup \iota ʻ\aleph _{0}.\equiv .\aleph _{0}\geq \nu$

Dem. $\begin{array}{l} \vdash .*123·322. \supset \vdash \colon\ldotp \alpha \in \aleph _{0}.&\supset :\aleph _{0}\geq \nu .\supset .\text{Nc}ʻ\alpha \geq \nu .\\ [*117·22·104·12] &\supset .\exists !\nu \cap \text{Cl}ʻ\alpha .\nu \in \text{N}_{0}\text{C}.\\ [*123·16] &\supset .\exists !\nu \cap (\text{Cls induct} \cup \aleph _{0}).\nu \in \text{N}_{0}\text{C}.\\ [*103·26] &\supset .(\exists \beta ).\nu =\text{N}_{0}\text{c}ʻ\beta .\beta \in \text{Cls induct} \cup \aleph _{0}.\\ [*120·21.*103·26] &\supset .\nu \in \text{NC induct} \cup \iota ʻ\aleph _{0} &\qquad \text{(1)}\\ \vdash .(1).*123·43. \supset \vdash .\text{Prop} \end{array}$

*123·45. $\vdash \colon\ldotp \exists !\aleph _{0}.\supset :\nu \in \text{NC induct} .\equiv .\aleph _{0}>\nu .\equiv .\nu <\aleph _{0} \quad[*123·43·44]$

*123·46. $\vdash :\alpha \in \text{Cls induct} .\beta \in \aleph _{0}.\supset .\alpha \cup \beta \in \aleph _{0}$

Dem. $\begin{array}{l} \vdash .*110·32.*22·91. &\supset \vdash .\text{Nc}ʻ(\alpha \cup \beta )=\text{Nc}ʻ\beta +_{c}\text{Nc}ʻ(\alpha -\beta ) &\qquad \text{(1)}\\ \vdash .*120·481·21. &\supset \vdash :\text{Hp}.\supset .\text{N}_{0}\text{c}ʻ(\alpha -\beta )\in \text{NC induct} &\qquad \text{(2)}\\ \vdash .*123·322. &\supset \vdash :\text{Hp}.\supset .\aleph _{0}=\text{Nc}ʻ\beta &\qquad \text{(3)}\\ \vdash .(2).(3).(*110·04).*123·41. &\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻ\beta +_{c}\text{Nc}ʻ(\alpha -\beta )=\aleph _{0} &\qquad \text{(4)}\\ \vdash .(1).(4).*100·44.&\supset \vdash . \text{Prop} \end{array}$

*123·47. $\begin{align}\vdash \colon\ldotp \exists !\aleph _{0}.\supset :\alpha \in \text{Cls induct} \cup \aleph _{0}.&\equiv .(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma .\\ &\equiv .\text{Nc}ʻ\alpha \leq \aleph _{0}\end{align}$

Dem. $\begin{array}{l} \vdash .*123·46. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{Cls induct} .\supset .(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma &\qquad \text{(1)}\\ \vdash .*22·42. &\supset \vdash :\alpha \in \aleph _{0}.\supset .(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma &\qquad \text{(2)}\\ \vdash .*123·16. &\supset \vdash :(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma .\supset .\alpha \in \text{Cls induct} \cup \aleph _{0} &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{Cls induct} \cup \aleph _{0}.\equiv .(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma &\qquad \text{(4)}\\ \vdash .*123·44·322. &\supset \vdash \colon\ldotp \beta \in \aleph _{0}.\supset :\text{N}_{0}\text{c}ʻ\alpha \in \text{NC induct} \cup \iota ʻ\aleph _{0}.\equiv .\text{N}_{0}\text{c}ʻ\alpha \leq \text{N}_{0}\text{c}ʻ\beta :\\ [*103·26.*120·21.*117·107] \supset :\alpha \in \text{Cls induct} \cup \aleph _{0}.&\equiv .\text{Nc}ʻ\alpha \leq \text{Nc}ʻ\beta .\\ [*123·322] &\equiv .\text{Nc}ʻ\alpha \leq \aleph _{0} &\qquad \text{(5)}\\ \vdash .(5).*10·11·23. &\supset \vdash \colon\ldotp \exists !\aleph _{0}.\supset :\alpha \in \text{Cls induct} \cup \aleph _{0}.\equiv .\text{Nc}ʻ\alpha \leq \aleph _{0} &\qquad \text{(6)}\\ \vdash .(4).(6).\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned in proving $\aleph_{0}^{2}=\aleph _{0}$ . The proof given is roughly Cantor's. It consists in showing that the relation $R$ defined in the hypothesis of *123·5 is a progression.

*123·5. $\begin{align}\vdash :P,Q\in \text{Prog}.\\ R=\hat{X} \hat{Y} [(\exists \mu ,\nu ):&X=\mu _{P}\downarrow \nu _{Q}.Y=(\mu +_{c}1)_{P}\downarrow (\nu -_{c}1)_{Q}.\lor.\\ &X=\mu _{P}\downarrow 1_{Q}.Y=1_{P}\downarrow (\mu +_{c}1)_{Q}].\supset .R\in 1\rightarrow 1\end{align}$

Dem. $\begin{array}{l} \vdash .*122·34. \supset \vdash \colon\ldotp \text{Hp}.\supset :X&=\mu _{P}\downarrow \nu _{Q}.Y=(\mu +_{c}1)_{P}\downarrow (\nu -_{c}1)_{Q}.\supset .\\ &\mu ,\nu \in \text{NC induct}-\iota ʻ0.\nu \neq 1 &\qquad \text{(1)}\\ \vdash .(1). \supset \vdash \colon\ldotp \text{Hp}.\supset :&(\exists \mu ,\nu ).X=\mu _{P}\downarrow \nu _{Q}.Y=(\mu +_{c}1)_{P}\downarrow (\nu -_{c}1)_{Q}.\supset .\\ &{\sim}(\exists \mu ).X=\mu _{P}\downarrow 1_{Q}.Y=1_{P}\downarrow (\mu +_{c}1)_{Q} &\qquad \text{(2)}\\ \vdash .(2).*123·3.\supset \\ \vdash \colon\colon \text{Hp}.\supset \colon\ldotp (\exists \mu ,\nu ).&X=\mu _{P}\downarrow \nu _{Q}.Y=(\mu +_{c}1)_{Q}\downarrow (\nu -_{c}1)_{Q}:XRYʻ.XʻRY:\supset .\\ &X=Xʻ.Y=Yʻ &\qquad \text{(3)}\\ \vdash .(2).\text{Transp}.*123·3.\supset \\ \vdash \colon\colon \text{Hp}.\supset \colon\ldotp (\exists \mu ).&X=\mu _{P}\downarrow 1_{Q}.Y=1_{P}\downarrow (\mu +_{c}1)_{Q}:XRYʻ.XʻRY:\supset .\\ &X=Xʻ.Y=Yʻ &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash :\text{Hp}.\supset .R\in 1\rightarrow 1:\supset \vdash .\text{Prop} \end{array}$

*123·501. $\vdash :\text{Hp}*123·5.\supset .\text{D}ʻR=\text{D}ʻP\times \text{D}ʻQ$

Dem. $\begin{array}{l} \vdash .*122·34.\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu ,\nu \in &\text{NC induct}-\iota ʻ0.\nu \neq 1.\supset .\\ &(\mu _{P}\downarrow \nu _{Q})R{(\mu +_{c}1)_{P}\downarrow (\nu -_{c}1)_{Q}} &\qquad \text{(1)}\\ \vdash .*122·34. \supset \vdash \colon\ldotp \text{Hp}.\supset :\mu \in &\text{NC induct}-\iota ʻ0.\supset .\\ &(\mu _{P}\downarrow 1_{Q})R{1_{P}\downarrow (\mu +_{c}1)_{Q}} &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\text{Hp}.&\supset :\mu ,\nu \in \text{NC induct}-\iota ʻ0.\supset .\mu _{P}\downarrow \nu _{Q}\in \text{D}ʻR:\\ [*122·341] &\supset :x\in \text{D}ʻP.y\in \text{D}ʻQ.\supset .x\downarrow y\in \text{D}ʻR &\qquad \text{(3)}\\ \vdash .*21·33. \supset \vdash \colon\ldotp \text{Hp}.\supset :X\in \text{D}ʻR.&\supset .(\exists \mu ,\nu ).X=\mu _{P}\downarrow \nu _{Q}.\\ [*122·341] &\supset .(\exists x,y).x\in \text{D}ʻP.y\in \text{D}ʻQ.X=x\downarrow y. &\qquad \text{(4)}\\ \vdash .(3).(4).*113·101.\supset \vdash .\text{Prop} \end{array}$

*123·502. $\vdash :\text{Hp}*123·5.\supset .\text{ᗡ}ʻR\subset \text{D}ʻR.\overleftarrow{R}_{*}ʻ(1_{P}\downarrow 1_{Q})\subset \text{D}ʻR$

Dem. $\begin{array}{l} \vdash .*21·33.&\supset \vdash :\text{Hp}.Y=(\mu +_{c}1)_{P}\downarrow (\nu -_{c}1)_{Q}.\nu -_{c}1\neq 1.\supset .\\ &YR\{(\mu +_{c}2)_{P}\downarrow (\nu -_{c}2)_{Q}\} &\qquad \text{(1)}\\ \vdash .*21·33.&\supset \vdash :\text{Hp}.Y=(\mu +_{c}1)_{P}\downarrow 1_{Q}.\supset .YR\{1_{P}\downarrow (\mu +_{c}2)_{Q}\} &\qquad \text{(2)}\\ \vdash .*21·33.&\supset \vdash :\text{Hp}.Y=1_{P}\downarrow (\mu +_{c}1)_{Q}.\supset .YR2_{P}\downarrow \mu _{Q} &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻR\subset \text{D}ʻR:\supset \vdash .\text{Prop} \end{array}$

*123·503. $\vdash : \text{Hp} *123·5 . \supset . \text{D}ʻR \subset \overleftarrow{R}_{*}ʻ(1_{P} \downarrow 1_{Q})$

Dem. $\begin{array}{l} \vdash . *123·501 . *122·11 . &\supset \vdash : \text{Hp} . \supset . 1_{P} \downarrow 1_{Q} \in \overleftarrow{R}_{*}ʻ(1_{P} \downarrow 1_{Q}) &\qquad \text{(1)}\\ \vdash . *90·16 . \supset \vdash : \text{Hp} . (1_{P} \downarrow 1_{Q}) &R_{*} (\mu _{P} \downarrow \nu _{Q}) . \nu \neq 1 . \supset .\\ &(1_p \downarrow 1_{Q}) R_{*} {(\mu +_{c} 1)_{P} \downarrow (\nu -_{c} 1)_{Q}} &\qquad \text{(2)}\\ \vdash . (2) . *120·47 . \supset \\ \vdash : \text{Hp} . (1_{P} \downarrow 1_{Q}) R_{*} (\mu _{P} \downarrow \nu _{Q}) . &\supset . (1_{P} \downarrow 1_{Q}) R_{*} \{(\mu +_{c} \nu -_{c} 1)_{P} \downarrow 1_{Q}\} .\\ [*90·16] &\supset . (1_{P} \downarrow 1_{Q}) R_{*} \{1_{P} \downarrow (\mu +_{c} \nu )_{Q}\} .\\ [(2) . *120·47] &\supset . (1_{P} \downarrow 1_{Q}) R_{*} \{\mu _{P} \downarrow (\nu +_{c} 1)_{Q}\} . &\qquad \text{(3)}\\ [*90·16] &\supset . (1_{P} \downarrow 1_{Q}) R_{*} \{(\mu +_{c} 1)_{P} \downarrow \nu _{Q}\} &\qquad \text{(4)}\\ \vdash . (1) . (3) . (4) . *120·47 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \mu , \nu \in \text{NC induct} - \iota ʻ0 . \supset . (1_{P} \downarrow 1_{Q}) R_{*} (\mu _{P} \downarrow \nu _{Q}) &\qquad \text{(5)}\\ \vdash . (5) . *122·341 . \supset \vdash . \text{Prop} \end{array}$

*123·504. $\vdash : \text{Hp} *123·5 . \supset . BʻR = 1_{P} \downarrow 1_{Q} \quad[*123·34 . *120·414]$

*123·51. $\begin{align}\vdash : \text{Hp} *123·5 . \supset . R \in \text{Prog} . \text{D}ʻR = &\text{D}ʻP \times \text{D}ʻQ\\ &[*123·5·501·502·503·504]\end{align}$

*123·52. $\vdash . \aleph _{0} = \aleph _{0} \times _{c} \aleph _{0} = \aleph _{0}^{2} \quad[*123·51 . *116·34 . *113·25·204]$

*123·53. $\vdash : \nu \in \text{NC induct} - \iota ʻO . \supset . \aleph _{0}^\nu = \aleph _{0} \quad[*123·52 . *116·52]$

*123·7. $\vdash : \text{Infin ax} (x) . \text{Mult ax} . \supset . \exists ! \aleph _{0} (tʻx)$

Dem. $\begin{array}{l} \vdash . *123·34 . *120·301 . &\supset \vdash : \text{Hp} . \supset . \text{NC induct} (tʻx) \in \aleph _{0} &\qquad \text{(1)}\\ \vdash . *100·43 . *120·301 . &\supset \vdash : \text{Hp} . \supset . \text{NC induct} (tʻx) \in \text{Cls ex}^{2}\,\text{excl}&\qquad \text{(2)}\\ \vdash . (1) . (2) . *88·32 . &\supset \vdash : \text{Hp} . \supset . \exists ! \text{Prod}ʻ\text{NC induct} (tʻx) &\qquad \text{(3)}\\ \vdash . (1) . (2) . *115·16 . &\supset \vdash : \text{Hp} . \supset . \text{Prod}ʻ\text{NC induct} (tʻx) \subset \aleph _{0} &\qquad \text{(4)}\\ \vdash . *115·18 . (*65·02) . &\supset \vdash : \kappa \in \text{Prod}ʻ\text{NC induct} (tʻx) . \supset . \kappa \in tʻtʻtʻx &\qquad \text{(5)}\\ \vdash . (3) . (4) . (5) . (*65·02) . \supset \vdash . \text{Prop} \end{array}$

In this number, we have to take up the second definition of infinity mentioned in the introduction to this Section. A class which is infinite according to this definition we propose to call a reflexive class, because a class which is of this kind is capable of reflexion into a part of itself. A class is called reflexive when there is a one-one relation which correlates the class with a proper part of itself. (A proper part is a part not the whole.) A reflexive cardinal is the homogeneous cardinal of a reflexive class.

We prove easily that reflexive classes are not inductive (*124·271), that reflexive cardinals are such as are greater than or equal to $\aleph _{0}$ (*124·23), and such as are unchanged by adding 1 (excepting $\Lambda$ ) (*124·25). To prove that classes which are not inductive must be reflexive has not hitherto been found possible without assuming the multiplicative axiom. We do not need, however, to assume the axiom generally, but only as applied to products of $\aleph _{0}$ factors. With this assumption, the result follows by a series of propositions explained below. Thus if a product of $\aleph_{0}$ factors, no one of which is zero, is never zero, then the two definitions of the finite and the infinite coincide (*124·56).

We will call a cardinal $\nu$ a "multiplicative cardinal" if a product of $\nu$ factors none of which are zero is never zero. Thus all inductive cardinals are multiplicative cardinals; and the assumption needed for identifying the two definitions of finite and infinite is that $\aleph _{0}$ should be a multiplicative cardinal.

For a reflexive class we use the notation " $\text{Cls refl}$ ," and for a reflexive cardinal we use " $\text{NC refl}$ ." We define a reflexive cardinal as the homogeneous cardinal of a reflexive class, i.e. we put $\text{NC refl} = \text{N}_{0}\text{c}ʻʻ\text{Cls refl} \quad\text{Df}.$ The only effect of this is to exclude $\Lambda$ from reflexive cardinals, which is convenient. We then need (on the analogy of *110·03 *110·04) a definition of what is meant when an ambiguous symbol such as $\text{Nc}ʻ\alpha$ is said to be reflexive, and we therefore put $\text{Nc}ʻ\rho \in \text{NC refl} . = . \text{N}_{0}\text{c}ʻ\rho \in \text{NC refl} \quad\text{Df}.$

For the class of multiplicative cardinals we use the notation " $\text{NC mult}$ ." Thus we put $\text{NC mult} = \text{NC} \cap \hat{\alpha} \{\kappa \in \alpha \cap \text{Cls}^{2} \text{excl}. \supset _{\kappa } . \exists ! {\in}_{\Delta}ʻ\kappa \} \quad\text{Df},$ whence it follows that if $\alpha \in \text{NC mult}$ , a product of $\alpha$ factors, none of which is zero, will never be zero.

We begin, in this number, with the more obvious properties of $\text{Cls refl}$ , proving that a $\text{Cls refl}$ is one which contains sub-classes of $\aleph _{0}$ terms (*124·15), that it is one whose number is unchanged when a single term is taken away (*124·17), and that it remains reflexive if any inductive class is taken away from it (*124·182).

We then give corresponding propositions concerning $\text{NC refl}$ (*124·23 ·25 ·252), proving, in addition to propositions already mentioned, that a reflexive cardinal is greater than every inductive cardinal (*124·26), and that a class which is neither inductive nor reflexive (if there be such) is one which neither contains nor is contained in any progression (*124·34). On such classes, see the remarks at the end of this number.

We then (*124·4 ·41) give a proposition merely embodying the definition of $\text{NC mult}$ , and show that all inductive cardinals are multiplicative, which follows immediately from *120·62.

The following series of propositions (*124·51 ff.) are concerned with the proof that, if $\aleph _{0}$ is a multiplicative cardinal, then the two definitions of finite and infinite coalesce. The proof, which is somewhat complicated, proceeds as follows.

To begin with, we know that if $\rho$ is a class which is not inductive, it contains classes having $\nu$ terms, if $\nu$ is any inductive cardinal. Thus we have $\exists ! 0 \cap \text{Cl}ʻ\rho , \exists ! 1 \cap \text{Cl}ʻ\rho , ... \exists ! \nu \cap \text{Cl}ʻ\rho , ....$ The classes of classes $0 \cap \text{Cl}ʻ\rho$ , $1 \cap\text{Cl}ʻ\rho$ , ... $\nu \cap \text{Cl}ʻ\rho$ , ... thus form a progression, which is contained in $\text{Cl}ʻ\text{Cl}ʻ\rho$ . Hence (*124·511) $\vdash : \rho {\sim} \in \text{Cls induct} . \supset . \text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}.$ So far, the multiplicative axiom is not required.

The above progression of classes of classes is $(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}.$ If $P$ is a selective relation for this class of classes, $\text{D}ʻP$ is a progression contained in $\text{Cl}ʻ\rho$ . Hence

*124·513. $\vdash : \exists ! {\in}_{\Delta}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct} . \supset . \text{Cl}ʻ\rho \in \text{Cls refl}$

*124·514. $\vdash \colon\ldotp \aleph _{0} \in \text{NC mult} . \supset : \rho {\sim} \in \text{Cls induct} . \supset . \text{Cl}ʻ\rho \in \text{Cls refl}$

To prove the next step, namely $\aleph _{0} \in \text{NC mult} . \exists ! \aleph _{0} \cap \text{Cl}ʻ\text{Cl}ʻ\rho . \supset . \exists ! \aleph _{0} \cap \text{Cl}ʻ\rho ,$ [Pg 280] we make a fresh start. We have, by hypothesis, a progression $R$ whose domain is contained in $\text{Cl}ʻ\rho$ ; hence $sʻ\text{D}ʻR\subset \rho$ . Thus it will suffice to prove $\aleph _{0} \in \text{NC mult} . R \in \text{Prog} . \text{D}ʻR \subset \text{Cls induct} . \supset . \exists ! \aleph _{0} \cap sʻ\text{D}ʻR,$ where the conditions of significance require that $\text{D}ʻR$ should consist of classes.

For this purpose, we prove that no member of $\text{D}ʻR$ can be the last that has new members which have not occurred before. The proof proceeds by showing that if this were not so, $sʻ\text{D}ʻR$ would be an inductive class, and therefore, by *120·75, $\text{D}ʻR$ would be an inductive class. Hence (*124·534) the members of $\text{D}ʻR$ which introduce new terms form an $\aleph _{0}$ , by *123·19; and so therefore do the classes of new terms which they introduce (*124·535). Hence (*124·536) a selection from these classes of new terms, which is a sub-class of $sʻ\text{D}ʻR$ , is also an $\aleph_{0}$ , and therefore (*124·54) there is a progression contained in $sʻ\text{D}ʻR$ if the selection in question exists. This completes the proof.

*124·6. $\vdash : \rho {\sim} \in \text{Cls induct} . \equiv . \text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}$

Hence if it could be shown that $\text{Cl}ʻ\rho$ cannot be reflexive unless $\rho$ is reflexive, a double application of this would enable us, by means of *124·6, to identify the two definitions of the finite without the multiplicative axiom.

*124·01. $\text{Cls refl} = \hat{\rho} \{(\exists R) . R \in 1 \rightarrow 1 . \text{ᗡ}ʻR \subset \text{D}ʻR . \exists ! \overrightarrow{B}ʻR . \rho = \text{D}ʻR\} \quad\text{Df}$

An equivalent definition would be $\text{Cls refl} = \text{D}ʻʻ{(1 \rightarrow 1) \cap \text{ᗡ}ʻB - \text{Cnv}ʻʻ\text{ᗡ}ʻB} \text{Df}.$

*124·02. $\text{NC refl} = \text{N}_{0}\text{c}ʻʻ\text{Cls refl} \quad\text{Df}$

*124·021. $\text{Nc}ʻ\rho \in \text{NC refl} . = . \text{N}_{0}\text{c}ʻ\rho \in \text{NC refl} \quad\text{Df}$

*124·03. $\text{NC mult} = \text{NC} \cap \hat{\alpha} \{\kappa \in \alpha \cap \text{Cls ex}^{2}\,\text{excl}. \supset _{\kappa } . \exists ! {\in}_{\Delta}ʻ\kappa \} \quad\text{Df}$

*124·1. $\begin{align}&\vdash : \rho \in \text{Cls refl} . \equiv . (\exists R). R \in 1 \rightarrow 1 . \text{ᗡ}ʻR \subset \text{D}ʻR . \exists ! \overrightarrow{B}ʻR . \rho = \text{D}ʻR\\ &[(*124·01)]\end{align}$

*124·11. $\vdash : R \in 1 \rightarrow 1 . \text{ᗡ}ʻR \subset \text{D}ʻR . \exists ! \overrightarrow{B}ʻR . \supset . \text{D}ʻR \in \text{Cls refl} \quad[*124·1]$

*124·12. $\vdash . \aleph _{0} \subset \text{Cls refl} \quad[*123·12 . *124·1]$

*124·13. $\vdash : \rho \in \text{Cls refl} . \supset . \exists ! \aleph _{0} \cap \text{Cl}ʻ\rho \quad[*124·1 . *123·192]$

*124·14. $\vdash :\rho \in \text{Cls refl} .\supset .\rho \cup \sigma \in \text{Cls refl}$

Dem. $\begin{array}{l} \vdash .*71·242.*50·5·52.\supset \\ \vdash :R\in \rightarrow 1.&\text{ᗡ}ʻR\subset \text{D}ʻR.\exists !\overrightarrow{B}ʻR.\text{D}ʻR=\rho .S=I\upharpoonright (\sigma -\rho ).\supset .\\ &R\unicode{x228d} S\in 1\rightarrow 1.\text{D}ʻ(R\unicode{x228d} S)=\text{D}ʻR\cup \sigma .\text{ᗡ}ʻ(R\unicode{x228d} S)=\text{ᗡ}ʻR\cup (\sigma -\rho ).\\ [\text{Hp}.*93·101] &\supset .R\unicode{x228d} S\in 1\rightarrow 1.\text{D}ʻ(R\unicode{x228d} S)=\rho \cup \sigma .\overrightarrow{B}ʻ(R\unicode{x228d} S)=\overrightarrow{B}ʻR.\\ [\text{Hp}.*13·12] &\supset .R\unicode{x228d} S\in 1\rightarrow 1.\text{D}ʻ(R\unicode{x228d} S)=\rho \cup \sigma .\exists !\overrightarrow{B}ʻ(R\unicode{x228d} S).\\ [*124·11] &\supset .\rho \cup \sigma \in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .(1).*124·1.\supset \vdash . \text{Prop} \end{array}$

*124·141. $\vdash :\exists ! Cl ʻ\rho \cap \text{Cls refl} .\supset .\rho \in \text{Cls refl}$

Dem. $\begin{array}{l} \vdash .*124·14.&\supset \vdash :\mu \in \text{Cls refl} .\supset .\mu \cup (\rho -\mu )\in \text{Cls refl}.\\ [*24·411] &\supset \vdash :\mu \subset \rho .\mu \in \text{Cls refl} .\supset .\rho \in \text{Cls refl} :\supset \vdash . \text{Prop} \end{array}$

*124·15. $\vdash :\rho \in \text{Cls refl} .\equiv .\exists !\aleph _{0}\cap \text{Cl} ʻ\rho$

Dem. $\begin{array}{l} \vdash .*124·12.\supset \vdash :\exists !\aleph _{0}\cap \text{Cl} ʻ\rho .&\supset .\exists ! \text{Cls refl} \cap \text{Cl} ʻ\rho .\\ [*124·141] &\supset .\rho \in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .(1).*124·13.\supset \vdash . \text{Prop} \end{array}$

*124·151. $\vdash :\rho \in \text{Cls refl} .\equiv .\text{Nc}ʻ\rho \geq \aleph _{0} \quad[*124·15.*117·22]$

*124·16. $\begin{align}\vdash :\rho \in \text{Cls refl} .&\equiv .(\exists \sigma ).\sigma \subset \rho .\exists !\rho -\sigma .\rho \text{ sm } \sigma.\\ &\equiv .\exists ! \text{Nc} ʻ\rho \cap \text{Cl} ʻ\rho -\iota ʻ\rho \end{align}$

Dem. $\begin{array}{l} \vdash .*73·1.\supset \vdash :&(\exists \sigma ).\sigma \subset \rho .\exists !\rho -\sigma .\rho \text{ sm } \sigma .\equiv .\\ &(\exists R,\sigma ).\sigma \subset \rho .\exists !\rho -\sigma .R\in 1\rightarrow 1.\text{D}ʻR=\rho .\text{ᗡ}ʻR=\sigma .\\ [*13·195] &\equiv .(\exists R).\text{ᗡ}ʻR\subset \rho .\exists !\rho -\text{ᗡ}ʻR.R\in 1\rightarrow 1.\text{D}ʻR=\rho .\\ [*13·193] &\equiv .(\exists R).\text{ᗡ}ʻR\subset \text{D}ʻR.\exists !\text{D}ʻR-\text{ᗡ}ʻR.R\in 1\rightarrow 1.\text{D}ʻR=\rho .\\ [93·101.*124·1] &\equiv .\rho \in \text{Cls refl} :\supset \vdash . \text{Prop} \end{array}$

*124·17. $\vdash :\rho \in \text{Cls refl} .\equiv .(\exists x).x\in \rho .\rho -\iota ʻx \text{ sm } \rho$

Dem. $\begin{array}{l} \vdash .*124·16.&\supset \vdash :(\exists x).x\in \rho .\rho -\iota ʻx \text{ sm } \rho .\supset .\rho \in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .*123·17·192·311.\supset \\ \vdash :R\in 1\rightarrow 1.\text{ᗡ}ʻR&\subset \text{D}ʻR.x\in \overrightarrow{B}ʻR.\supset .\overleftarrow{R}_{*}ʻx \text{ sm } \overleftarrow{R}_{*}ʻx-\iota ʻx.\\ [*73·7] &\supset .(\text{D}ʻR-\overleftarrow{R}_{*}ʻx)\cup \overleftarrow{R}_{*}ʻx \text{ sm } (\text{D}ʻR-\overleftarrow{R}_{*}ʻx)\cup (\overleftarrow{R}_{*}ʻx-\iota ʻx).\\ [*24·411·412] &\supset .\text{D}ʻR \text{ sm } \text{D}ʻR-\iota ʻx &\qquad \text{(2)}\\ \vdash .(2).*124·1.&\supset \vdash :\rho \in \text{Cls refl} .\supset .(\exists x).x\in \rho .\rho \text{ sm } \rho -\iota ʻx &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash . \text{Prop} \end{array}$

*124·18. $\vdash :\rho \in \text{Cls refl}.\rho \text{ sm }\sigma .\supset .\sigma \in \text{Cls refl} \quad[*124·151.*100·321]$

*124·181. $\vdash :\rho \in \text{Cls refl}.\supset .\rho -\iota ʻx\in \text{Cls refl}.\rho -\iota ʻx\text{ sm }\rho$

Dem. $\begin{array}{l} \vdash .*124·17·18.*73·72.\supset \\ \vdash :\rho \in \text{Cls refl}.x\in \rho .\supset .\rho -\iota ʻx\text{ sm }\rho .\rho -\iota ʻx\in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .(1).*51·222.\supset \vdash .\text{Prop} \end{array}$

*124·182. $\begin{align}&\vdash :\rho \in \text{Cls refl}.\sigma \in \text{Cls induct}.\supset .\rho -\sigma \in \text{Cls refl}.\rho -\sigma \text{ sm }\rho \\ &[*124·181.*120·26]\end{align}$

*124·2. $\vdash :\mu \in \text{NC refl}.\equiv .(\exists \rho ).\rho \in \text{Cls refl}.\mu =\text{N}_{0}\text{c}ʻ\rho \quad[(*124·02)]$

*124·21. $\begin{align}&\vdash :\mu \in \text{NC refl}.\equiv .\\ &(\exists R).R\in 1\rightarrow 1.\text{ᗡ}ʻR\subset \text{D}ʻR.\exists !.\overrightarrow{B}ʻR.\mu =\text{N}_{0}\text{c}ʻ\text{D}ʻR \quad[*124·2·1]\end{align}$

Dem. $\begin{array}{l} \vdash .*117·241. \supset \vdash :\mu \geq \aleph _{0}.&\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\aleph _{0}=\text{N}_{0}\text{c}ʻ\beta .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻ\beta .\\ [*123·36·322.*103·26] &\equiv .(\exists \alpha ,\beta ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\beta \in \aleph _{0}.\exists !\text{Cl}ʻ\alpha \cap \aleph _{0}.\\ [*10·35] &\equiv .(\exists \alpha ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\exists !\text{Cl}ʻ\alpha \cap \aleph _{0}.\\ [*124·15] &\equiv .(\exists \alpha ).\mu =\text{N}_{0}\text{c}ʻ\alpha .\alpha \in \text{Cls refl}.\\ [*124·2] &\equiv .\mu \in \text{NC refl}:\supset \vdash .\text{Prop} \end{array}$

*124·231. $\vdash :\exists !\text{NC refl}.\equiv .\exists !\text{Cls refl}.\equiv .\exists !\aleph _{0} \quad[*124·2·12·13]$

*124·232. $\vdash :\exists !\text{NC refl}.\supset .\text{Infin ax} \quad[*124·231.*123·18]$

*124·24. $\vdash \colon\ldotp \mu \in \text{NC refl}.\equiv :\mu \in \text{N}_{0}\text{C}:(\exists \nu ).\mu =\aleph _{0}+_{c}\nu .\nu \in \text{NC}$

Dem. $\begin{array}{l} \vdash .*124·23.*117·31.\supset \\ \vdash \colon\ldotp \mu \in \text{NC refl}.\equiv :\mu ,\aleph _{0}\in \text{N}_{0}\text{C}:(\exists \nu ).\nu \in \text{NC}.\mu =\aleph _{0}+_{c}\nu &\qquad \text{(1)}\\ \vdash .*110·4.\supset \vdash :\mu =\aleph _{0}+_{c}\nu .\mu \in \text{N}_{0}\text{C}.\supset .\aleph _{0}\in \text{N}_{0}\text{C} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*124·25. $\begin{align}&\vdash :\mu \in \text{NC refl}.\equiv .\mu \in \text{N}_{0}\text{C}.\mu =\mu +_{c}1.\equiv .\exists !\mu .\mu =\mu +_{c}1 \\ &[*124·17·2]\end{align}$

*124·251. $\vdash :\mu \in \text{NC refl}.\supset .\mu =\mu +_{c}1 \quad[*124·25]$

*124·252. $\vdash :\mu \in \text{NC refl}.\nu \in \text{NC induct}.\supset .\mu =\mu +_{c}\nu$

Dem. $\begin{array}{l} \vdash .*124·251.\supset \vdash :\mu \in \text{NC refl}.\mu =\mu +_{c}\nu .\supset .\mu =\mu +_{c}\nu +_{c}1 &\qquad \text{(1)}\\ \vdash .(1).*120·11.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*124·24. \supset \vdash :\text{Hp}.&\supset .(\exists \nu ).\mu =\aleph _{0}+_{c}\nu .\\ [*123·421] &\supset .(\exists \nu ).\mu =\aleph _{0}+_{c}\aleph _{0}+_{c}\nu .\mu =\aleph _{0}+_{c}\nu .\\ [*13·13] &\supset .\mu =\aleph _{0}+_{c}\mu :\supset \vdash .\text{Prop} \end{array}$

*124·26. $\vdash \colon\ldotp \mu \in \text{NC refl}.\supset :\nu \in \text{NC induct}.\supset _{\nu }.\mu >\nu$

Dem. $\begin{array}{l} \vdash .*124·231. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\aleph _{0}:\\ [*123·43] &\supset :\nu \in \text{NC induct}.\supset _{\nu }.\aleph _{0}>\nu &\qquad \text{(1)}\\ \vdash .(1).*124·23.\supset \vdash .\text{Prop} \end{array}$

*124·27. $\vdash .\text{NC refl}\cap \text{NC induct}=\Lambda \quad[*124·26.*117·42]$

Dem. $\begin{array}{l} \vdash .*124·2. \supset \vdash :\rho \in \text{Cls refl}.&\supset .\text{N}_{0}\text{c}ʻ\rho \in \text{NC refl}.\\ [*124·27] &\supset .\text{N}_{0}\text{c}ʻ\rho {\sim}\in \text{NC induct}.\\ [*120·21] &\supset .\rho {\sim}\in \text{Cls induct}:\supset \vdash .\text{Prop} \end{array}$

*124·28. $\vdash :\rho \in \text{Cls refl}.\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC refl}.\equiv .\text{Nc}ʻ\rho \in \text{NC refl}$

Dem. $\begin{array}{l} \vdash .*4·2.(*124·021). \supset \vdash :\text{Nc}ʻ\rho \in \text{NC refl}.&\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC refl}.\\ [*124·2] &\equiv .(\exists \sigma ).\sigma \in \text{Cls refl}.\text{N}_{0}\text{c}ʻ\rho =\text{N}_{0}\text{c}ʻ\sigma .\\ [*103·14] &\equiv .(\exists \sigma ).\sigma \in \text{Cls refl}.\rho \text{ sm }\sigma .\rho \in tʻ\sigma .\\ [*124·18.*73·3.*63·103] &\equiv .\rho \in \text{Cls refl}:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*40·11. \supset \vdash :\rho \in sʻ\text{NC refl}.&\equiv .(\exists \mu ).\mu \in \text{NC refl}.\rho \in \mu .\\ [*103·26] &\equiv .(\exists \mu ).\mu \in \text{NC refl}.\mu =\text{N}_{0}\text{c}ʻ\rho .\\ [*13·195] &\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC refl}.\\ [*124·28] &\equiv .\rho \in \text{Cls refl}:\supset \vdash .\text{Prop} \end{array}$

*124·3. $\begin{align}\vdash \colon\colon \exists !\aleph _0.\supset \colon\ldotp \mu <\aleph _0.\lor.\mu \geq \aleph _0:\equiv .\mu \in &\text{NC induct}\cup \text{NC refl}\\ &[*123·45.*124·23]\end{align}$

*124·31. $\vdash :\exists !\aleph _{0}.\supset .\text{spec}ʻ\aleph _{0}=\text{NC induct}\cup \text{NC refl} \quad[*124·3.*120·431]$

In virtue of the above proposition, if there are any numbers which are neither inductive nor reflexive, they are such as are neither greater than, less than, nor equal to $\aleph _{0}$ . (The existence of $\aleph _{0}$ in a suitable type can be deduced from the existence of numbers which are neither inductive nor reflexive; cf. *124·6.) Two further propositions (*124·33 ·34) are given below on non-inductive non-reflexive classes and cardinals. The subject is resumed in the remarks at the end of the number.

*124·33. $\begin{align}\vdash \colon\ldotp \exists !\aleph _{0}.\supset :&\mu \in \text{NC}-\text{NC induct}-\text{NC refl}.\equiv .\\ &\mu \in \text{NC}.{\sim}(\mu <\aleph _{0}).{\sim}(\mu \geq \aleph _{0}) \quad[*124·3.\text{Transp}]\end{align}$ [Pg 284]

*124·34. $\begin{align}\vdash \colon\colon \exists !\aleph _{0}.\supset \colon\ldotp \alpha {\sim}\in &(\text{Cls induct} \cup \text{Cls refl}).\equiv :\\ &{\sim}(\exists \gamma ):\gamma \in \aleph _{0}:\alpha \subset \gamma .\lor.\gamma \subset \alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*120·21.*124·28.&\supset \vdash :\alpha {\sim}\in (\text{Cls induct} \cup \text{Cls refl}).\equiv .\\ &\text{N}_{0}\text{c}ʻ\alpha {\sim}\in (\text{NC induct} \cup \text{NC refl}) &\qquad \text{(1)}\\ \vdash .*123·36.*103·26.&\supset \vdash :\beta \in \aleph _{0}.\supset .\aleph _{0}=\text{N}_{0}\text{c}ʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).*124·31.&\supset \vdash \colon\colon \beta \in \aleph _{0}.\supset \colon\ldotp \alpha {\sim}\in (\text{Cls induct} \cup \text{Cls refl}).\equiv :\\ &\text{N}_{0}\text{c}ʻ\alpha {\sim}\in \text{spec}ʻ\text{N}_{0}\text{c}ʻ\beta :\\ [*120·432] &\equiv :{\sim}(\text{N}_{0}\text{c}ʻ\alpha \leq \text{N}_{0}\text{c}ʻ\beta ).{\sim}(\text{N}_{0}\text{c}ʻ\alpha \geq \text{N}_{0}\text{c}ʻ\beta ):\\ [*117·107·22] &\equiv :{\sim}(\text{Nc}ʻ\alpha \leq \text{Nc}ʻ\beta ):{\sim}(\exists \gamma ).\gamma \in \text{Nc}ʻ\beta .\gamma \subset \alpha :\\ [*123·322] &\equiv :{\sim}(\text{Nc}ʻ\alpha \leq \aleph _{0}):{\sim}(\exists \gamma ).\gamma \in \aleph _{0}.\gamma \subset \alpha :\\ [*123·47] &\equiv :{\sim}(\exists \gamma ).\gamma \in \aleph _{0}.\alpha \subset \gamma :{\sim}(\exists \gamma ).\gamma \in \aleph _{0}.\gamma \subset \alpha &\qquad \text{(3)}\\ \vdash .(3).*10·11·21.\supset \vdash .\text{Prop} \end{array}$

*124·4. $\begin{align}&\vdash \colon\ldotp \mu \in \text{NC mult}.\equiv :\mu \in \text{NC}:\kappa \in \mu \cap \text{Cls ex}^{2}\, \text{excl}.\supset _{\kappa }.\exists !{\in}_{\Delta}ʻ\kappa\\ &[(*124·03)]\end{align}$

*124·41. $\vdash .\text{NC induct}\subset \text{NC mult}\quad[*120·62 . *124·4]$

The following propositions give the proof of *124·56, which identifies the two definitions of the finite, on the assumption that $\aleph_{0}$ is a multiplicative cardinal. (*124·513, however, is only used in proving *124·514, and *124·514 is not used in the proof. It is retained as marking a stage in the argument, although the actual propositions subsequently used are not it, but the lemmas which lead to it.)

*124·51. $\begin{align}\vdash :\rho {\sim}\in &\text{Cls induct}.Q=(\cap \text{Cl}ʻ\rho )\mid N\mid \text{Cnv}ʻ(\cap \text{Cl}ʻ\rho ).\supset .\\ &Q\in \text{Prog}.\text{D}ʻQ\subset \text{Cl}ʻ\text{Cl}ʻ\rho .\text{D}ʻQ=(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}\end{align}$

Dem. $\begin{array}{l} \vdash .*120·61·21.*123·25.&\supset \vdash :\text{Hp}.\supset .N\in \text{Prog} &\qquad \text{(1)}\\ \vdash .*120·491.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\mu ,\nu \in \text{NC induct}.\supset _{\mu ,\nu }.\exists !\mu \cap \text{Cl}ʻ\rho .\exists !\nu \cap \text{Cl}ʻ\rho :\\ [*22·5] &\supset :\mu ,\nu \in \text{NC induct}.\mu \cap \text{Cl}ʻ\rho =\nu \cap \text{Cl}ʻ\rho .\supset _{\mu ,\nu }.\\ &\exists !\mu \cap \nu \cap \text{Cl}ʻ\rho .\\ [*100·43] &\supset {\mu ,\nu }.\mu =\nu \\ [*71*55] &\supset :(\cap \text{Cl}ʻ\rho )\upharpoonright \text{NC induct}\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).*123·32.&\supset \vdash :\text{Hp}.\supset .Q\in \text{Prog} &\qquad \text{(3)}\\ \vdash .*22·43.&\supset \vdash :\alpha \in \text{D}ʻQ.\supset .\alpha \subset \text{Cl}ʻ\rho &\qquad \text{(4)}\\ \vdash .(3).(4).*37·32·321.\supset \vdash .\text{Prop} \end{array}$

*124·511. $\begin{align}\vdash :\rho {\sim}\in &\text{Cls induct}.\supset .\\ &\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}.(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}\in \aleph _{0}\cap \text{Cls}^{2} \text{excl}\\ &[*124·51·15. *120·491.*100·43]\end{align}$

*124·512. $\begin{align}\vdash :P\in {\in}_{\Delta}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ&\text{NC induct}.\supset .\\ &\text{D}ʻP\in \aleph _{0}\cap \text{Cl}ʻ\text{Cl}ʻ\rho .\text{D}ʻP\subset \text{Cls induct}\end{align}$

Dem. $\begin{array}{l} \vdash .*83·11.\text{Transp}.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\nu \in \text{NC induct}.\supset _{\nu }.\exists !\nu \cap \text{Cl}ʻ\rho &\qquad \text{(1)}\\ \vdash .*115·16.(1).*124·511.*120·491.\supset \\ \vdash :\text{Hp}.&\supset .\text{D}ʻP\in \text{Nc}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}.p{\sim}\in \text{Cls induct}.\\ [*124·511] &\supset .\text{D}ʻP\in\aleph_{0} &\qquad \text{(2)}\\ \vdash .*83·21.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{D}ʻP.\supset .(\exists \nu ).\nu \in \text{NC induct}.\alpha \in \nu \cap \text{Cl}ʻ\rho .\\ [*10·5.*120·2] &\supset .\alpha \in \text{Cls induct}.\alpha \in \nu \text{Cl}ʻ\rho . &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*124·513. $\vdash :\exists !{\in}_{\Delta}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}.\supset .\text{Cl}ʻ\rho \in \text{Cls refl} \quad[*124·512·15]$

*124·514. $\begin{align}\vdash \colon\ldotp \aleph _{0}\in \text{NC mult}.\supset :\rho {\sim}\in &\text{Cls induct}.\supset .\text{Cl}ʻ\rho \in \text{Cls refl}\\ &[*124·511·513·4]\end{align}$

The following propositions are concerned in proving that, if $\aleph _{0}$ is a multiplicative cardinal, then a class such as $\text{D}ʻP$ in *124·512 must be such that a progression is contained in $sʻ\text{D}ʻP$ . The characteristics of $\text{D}ʻP$ which are used in the proof are $\text{D}ʻP\in \aleph _{0}.\text{D}ʻP\subset\text{Cls induct}$ . Since $\text{D}ʻP\in \aleph _{0}$ , we have $(\exists R).R\in \text{Prog}.\text{D}ʻP = \text{D}ʻR$ . Hence the hypothesis with which the following series of propositions is concerned is $R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct},$ but the earlier propositions do not need the full hypothesis.

In what follows, note that if $\gamma \in \text{D}ʻR,\gamma-sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma$ is the class of those terms which occur in $\gamma$ and have never occurred before in any earlier member of $\text{D}ʻR$ . We prove that, with our hypothesis, members of $\text{D}ʻR$ for which this class of new terms is not null form a class which has no last member, and therefore form a progression.

*124·52. $\begin{align}&\vdash \colon\ldotp R\in \text{Prog}.\sigma = \hat{\beta} \{(\exists \gamma ).\gamma \in \text{D}ʻR.\beta = \gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta \}.\supset :\\ &\sigma \in \text{Cls ex}^{2} \text{excl}:\gamma ,\delta \in \text{D}ʻR.\gamma \neq \delta .\supset .(\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma )\cap (\delta -sʻ\overrightarrow{R}_{\text{po}}ʻ\delta ) = \Lambda \end{align}$

Dem. $\begin{array}{l} \vdash .*20·33. & \supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in \sigma .\supset _{\beta }.\exists !\beta &\qquad \text{(1)}\\ \vdash .*122·21. & \supset \vdash \colon\ldotp \text{Hp}.\gamma ,\delta \in \text{D}ʻR.\gamma \neq \delta .\supset :\gamma R_{\text{po}}\delta .\lor.\delta R_{\text{po}}\gamma &\qquad \text{(2)}\\ \vdash .*40·13. \supset \vdash \colon\ldotp \text{Hp}.\gamma R_{\text{po}}\delta .&\supset :\gamma \subset sʻ\overrightarrow{R}_{\text{po}}ʻ\delta :\\ [*24·3] &\supset :(\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma )\cap (\delta -sʻ\overrightarrow{R}_{\text{po}}ʻ\delta = \Lambda &\qquad \text{(3)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \text{Hp}.\delta R_{\text{po}}\gamma .\supset :(\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma )\cap (\delta -sʻ\overrightarrow{R}_{\text{po}}ʻ\delta ) = \Lambda &\qquad \text{(4)}\\ \vdash .(2).(3).(4).&\supset \vdash :\text{Hp}.\gamma ,\delta \in \text{D}ʻR.\gamma \neq \delta .\supset .\\ &(\gamma -sʻ\overrightarrow{R}_{\text{po}})\cap (\delta -sʻ\overrightarrow{R}_{\text{po}}ʻ\delta ) = \Lambda &\qquad \text{(5)}\\ \vdash .(5).*20·33. &\supset \vdash :\text{Hp}.\beta ,\beta'\in \sigma .\beta \neq \beta'.\supset .\beta \cap \beta' = \Lambda &\qquad \text{(6)}\\ \vdash .(1).(6).(5).\supset \vdash .\text{Prop} \end{array}$

*124·521. $\vdash :\text{Hp}*124·52.\pi =\hat{\gamma}\{\gamma \in \text{D}ʻR.\exists !\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma \}.\supset .\sigma \text{ sm }\pi$

Dem. $\begin{array}{l} \vdash .*124·52.*24·57.\supset \\ \vdash :\text{Hp}.\gamma ,\delta \in \pi .\gamma \neq \delta .&\supset .\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma \neq \delta -sʻ\overrightarrow{R}_{\text{po}}ʻ\delta &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash :\text{Hp}.&S=\hat{\beta} \hat{\gamma}\{\gamma \in \text{D}ʻR.\beta =\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta\}.\supset .\\ &S\in 1\rightarrow 1.\text{D}ʻS=\sigma .\text{ᗡ}ʻS=\pi \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*124·53. $\vdash :R\in \text{Prog}.\supset .sʻ\text{D}ʻR{\sim}\in \text{Cls induct} \quad[*120·75.*122·37]$

*124*531. $\vdash :R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct}.\supset .sʻ\overrightarrow{R}_{*}ʻ\gamma \in \text{Cls induct}$

Dem. $\begin{array}{l} \vdash .*122·38.\supset \vdash :\text{Hp}.\supset .\overrightarrow{R}_{*}ʻ\gamma \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash .(1).*120·75.\supset \vdash .\text{Prop} \end{array}$

*124·532. $\begin{align}&\vdash :R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct}.\supset .\exists !sʻ\text{D}ʻR-sʻ\overrightarrow{R}_{*}ʻ\gamma \\ &[*124·53·531.*120·481.\text{Transp}]\end{align}$

*124·533. $\begin{align}\vdash :R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct}.\gamma \in &\text{D}ʻR.\supset .\\ &(\exists \beta ).\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{\text{po}}ʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*124·532.&\supset \vdash :\text{Hp}.\supset .(\exists \beta ).\beta \in \text{D}ʻR.\exists !\beta -sʻ\overrightarrow{R}_{*}ʻ\gamma &\qquad \text{(1)}\\ \vdash .*40·13. &\supset \vdash :\beta R_{*}\gamma .\supset .\beta \subset sʻ\overrightarrow{R}_{*}\gamma :\\ [\text{Transp}] &\supset \vdash :\exists !\beta -sʻ\overrightarrow{R}_{*}\gamma .\supset .{\sim}(\beta R_{*}\gamma ):\\ [*122·21] &\supset \vdash :\text{Hp}.\beta \in \text{D}ʻR.\exists !\beta -sʻ\overrightarrow{R}_{*}ʻ\gamma .\supset .\gamma R_{\text{po}}\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :(\exists \beta ).\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{*}ʻ\gamma :\\ [*122·23] &\supset :\text{E}!\text{min}(R_{\text{po}})ʻ\hat{\beta}\{\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{\text{po}}ʻ\beta \}:\\ [*93·111] &\supset :(\exists \beta ):\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{*}\gamma :\delta R_{\text{po}}\beta .\supset _{\delta }.\delta \subset sʻ\overrightarrow{R}_{*}ʻ\gamma :\\ [*40*151] &\supset :(\exists \beta ).\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{*}\gamma .sʻ\overrightarrow{R}_{\text{po}}ʻ\beta \subset sʻ\overrightarrow{R}_{*}ʻ\gamma :\\ [*22*81] &\supset :(\exists \beta ).\gamma R_{\text{po}}\beta .\exists !\beta -sʻ\overrightarrow{R}_{\text{po}}\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*124·534. $\begin{align}\vdash :R\in \text{Prog}.\text{D}ʻR\subset &\text{Cls induct}.\\ &\pi =\hat{\gamma}\{\gamma \in \text{D}ʻR.\exists !\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma\}.\supset .\pi \in \aleph _{0}\end{align}$

Dem. $\begin{array}{l} \vdash .*124·533. \supset \vdash :\text{Hp}.\supset .\exists !\pi .\pi \subset R_{\text{po}}ʻʻ\pi &\qquad \text{(1)}\\ \vdash .(1).*123·19.\supset \vdash .\text{Prop} \end{array}$

*124·535. $\begin{align}\vdash :R\in \text{Prog}.&\text{D}ʻR\subset \text{Cls induct}.\\ &\sigma =\hat{\beta}\{(\exists y).\gamma \in \text{D}ʻR.\beta =\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta\}.\supset .\sigma \in \aleph _{0}\\ &[*124·534·521.*123·321]\end{align}$

*124·536. $\begin{align}\vdash :R\in \text{Prog}.\text{D}ʻR\subset &\text{Cls induct}.\\ &\sigma =\hat{\beta} \{(\exists \gamma ).\gamma \in \text{D}ʻR.\beta =\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta \}.\\ &S\in {\in}_{\Delta}ʻ\sigma .\supset .\text{D}ʻS\in \aleph _{0}.\text{D}ʻS\subset sʻ\text{D}ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*115·16.*124·52·535. &\supset \vdash :\text{Hp}.\supset .\text{D}ʻS\in \aleph _{0} &\qquad \text{(1)}\\ \vdash .*83·21. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{D}ʻS\subset sʻ\sigma :\\ [*40·11] \supset :x\in \text{D}ʻS.&\supset .(\exists \beta ,\gamma ).\gamma \in \text{D}ʻR.\beta =\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta .x\in \beta .\\ [*13·195] &\supset .(\exists \gamma ).\gamma \in \text{D}ʻR.x\in \gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\\ [*22·43] &\supset .(\exists \gamma ).\gamma \in \text{D}ʻR.x\in \gamma\\ [*40·11] &\supset .x\in sʻ\text{D}ʻR &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*124·54. $\vdash :\aleph _{0}\in \text{NC mult}.R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct}.\supset .\exists !\aleph _0\cap \text{Cl}ʻsʻ\text{D}ʻR$

Dem. $\begin{array}{l} \vdash .*124·52·535·4.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\sigma =\hat{\beta} \{(\exists \gamma ).\gamma \in \text{D}ʻR.\beta &=\gamma -sʻ\overrightarrow{R}_{\text{po}}ʻ\gamma .\exists !\beta\}.\supset .\exists !\in _{\Delta }ʻ\sigma .\\ [*124·536] &\supset .\exists !\aleph _{0}\cap \text{Cl}ʻsʻ\text{D}ʻR\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*124·541. $\begin{align}\vdash :\aleph _{0}\in \text{NC mult}.P\in {\in}_{\Delta}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ&\text{NC induct}.\supset .\\ &\exists !\aleph _{0}\cap \text{Cl}ʻsʻ\text{D}ʻP.sʻ\text{D}ʻP\subset \rho\end{align}$

Dem. $\begin{array}{l} \vdash .*124·512. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP\in \aleph _{0}.\text{D}ʻP\subset \text{Cls induct}.\\ [*123·1] &\supset .(\exists R).\text{D}ʻP=\text{D}ʻR.R\in \text{Prog}.\text{D}ʻR\subset \text{Cls induct}.\\ [*124·54] &\supset .(\exists R).\text{D}ʻP=\text{D}ʻR.\exists !\aleph _{0}\cap \text{Cl}ʻsʻ\text{D}ʻR.\\ [*13·193.*10·35] &\supset .\exists !\aleph _{0}\cap \text{Cl}ʻsʻ\text{D}ʻP &\qquad \text{(1)}\\ \vdash .*124·512. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP\in \text{Cl}ʻ\text{Cl}ʻ\rho .\\ [*60·2] &\supset .\text{D}ʻP\subset \text{Cl}ʻ\rho .\\ [*60·52] &\supset .sʻ\text{D}ʻP\subset \rho &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*124·55. $\vdash :\aleph _{0}\in \text{NC mult}.\rho {\sim}\in \text{Cls induct}.\supset .\exists !\aleph _{0}\cap \text{Cl}ʻ\rho$

Dem. $\begin{array}{l} \vdash .*124·511·4.\supset \vdash :\text{Hp}.&\supset .\exists !{\in}_{\Delta}ʻ(\cap \text{Cl}ʻ\rho )ʻʻ\text{NC induct}.\\ [*124·541.*60·4] &\supset .\exists !\aleph _{0}\cap \text{Cl}ʻ\rho :\supset \vdash .\text{Prop} \end{array}$

*124·56. $\vdash :\aleph _{0}\in \text{NC mult}.\supset .-\text{Cls induct}=\text{Cls refl}.\text{N}_{0}\text{C}-\text{NC induct}=\text{NC refl}$

Dem. $\begin{array}{l} \vdash .*124·55·15. \supset \vdash :\text{Hp}.&\supset .-\text{Cls induct}\subset \text{Cls refl} &\qquad \text{(1)}\\ \vdash .*124·271. \supset \vdash :\text{Hp}.&\supset .\text{Cls refl}\subset -\text{Cls induct} &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash \colon\ldotp \text{Hp}.&\supset :-\text{Cls induct}=\text{Cls refl}: &\qquad \text{(3)}\\ [*120·21.*124·28] &\supset :\text{N}_{0}\text{c}ʻ\rho {\sim}\in \text{NC induct}.\equiv .\text{N}_{0}\text{c}ʻ\rho \in \text{NC refl}:\\ [*103·2.*124·2] &\supset :\alpha \in \text{N}_{0}\text{C}-\text{NC induct}.\equiv .\alpha \in \text{NC refl} &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

The above proposition identifies the two definitions of the finite, on the hypothesis $\aleph _{0}\in \text{NC mult}$ .

*124·57. $\vdash :\mu \in \text{N}_{0}\text{C}-\text{NC induct}.\supset .2^{2^\mu }\in \text{NC refl} \quad[*124·511.*116·72]$

*124·58. $\vdash \colon\ldotp 2^\mu \in \text{NC refl}.\supset _{\mu }.\mu \in \text{NC refl}:\supset .\text{N}_{0}\text{C}-\text{NC induct}=\text{NC refl}$

Dem. $\begin{array}{l} \vdash .*124·57.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\mu \in \text{N}_{0}\text{C}-\text{NC induct}.\supset .2^\mu \in \text{NC refl}.\\ [\text{Hp}] &\supset .\mu \in \text{NC refl} &\qquad \text{(1)}\\ \vdash .(1).*124·2·27.\supset \vdash .\text{Prop} \end{array}$

The above proposition gives another hypothesis which would enable us to identify the two definitions of the finite if it could be proved, namely $2^\mu \in \text{NC refl}.\supset _{\mu }.\mu \in \text{NC refl},$ or, what comes to the same thing, $\text{Cl}ʻ\rho \in \text{Cls refl}.\supset .\rho \in \text{Cls refl}.$

*124·6. $\vdash :\rho {\sim}\in \text{Cls induct}.\equiv .\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}$

Dem. $\begin{array}{l} \vdash .*124·511.&\supset \vdash :\rho {\sim}\in \text{Cls induct}.\supset .\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .*120·74. &\supset \vdash :\rho \in \text{Cls induct}.\supset .\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls induct}.\\ [*124·271] &\supset .\text{Cl}ʻ\text{Cl}ʻ\rho {\sim}\in \text{Cls refl} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*124·61. $\vdash \colon\ldotp \aleph _{0}\in \text{NC mult}.\supset :\rho \in \text{Cls refl}.\equiv .\text{Cl}ʻ\rho \in \text{Cls refl}.\equiv .\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}$

Dem. $\begin{array}{l} \vdash .*124·6·271.&\supset \vdash :\rho \in \text{Cls refl}.\supset .\text{Cl}ʻ\rho \in \text{Cls refl}.\supset .\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .*124·6·56. &\supset \vdash \colon\ldotp \aleph _{0}\in \text{NC mult}.\supset :\text{Cl}ʻ\text{Cl}ʻ\rho \in \text{Cls refl}.\supset .\rho \in \text{Cls refl}. &\qquad \text{(2)}\\ [(1)] &\supset .\text{Cl}ʻ\rho \in \text{Cls refl} &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following properties of cardinals which are neither inductive nor reflexive (supposing there are such) are easily proved. Let us put $\begin{aligned} \text{NC med}&=\text{N}_{0}\text{C}-\text{NC induct}-\text{NC refl} \quad\text{Df},\\ \text{Cls med}&=-\text{Cls induct}-\text{Cls refl} \quad\text{Df}, \end{aligned}$

where " $\text{med}$ " stands for "mediate." Then $\mu \in \text{NC med}.\supset .\mu +_{c}1\in \text{NC med}.\mu -_{c}1\in \text{NC med}.\mu \neq \mu +_{c}1.\mu \neq \mu -_{c}1.$ Hence mediate cardinals have no maximum or minimum. $\begin{aligned} \mu ,\nu \in &\text{NC med}.\supset .\mu +_{c}\nu \in &\quad\text{NC med},\\ \mu \in &\text{NC med}.\nu \in \text{NC med}\cup \text{NC induct}-\iota ʻ0.\supset .\mu \times _{c}\nu \in &\quad\text{NC med}, \end{aligned}$ whence $\begin{aligned} &\mu \in \text{NC med}.\supset .\mu ^{2},\mu ^{3},...\in \text{NC med},\\ &\mu ^\nu \in \text{NC med}.\supset :\mu \in \text{NC med}.\lor.\nu \in \text{NC med},\\ &\mu \in \text{NC med}.\supset .2^{2^\mu }\in \text{NC refl},\\ &\text{whence}\qquad \exists !\text{NC med}.\supset .(\exists \nu ).\nu \in \text{NC med}.2^\nu \in \text{NC refl}, \end{aligned}$ since we have either $\mu \in \text{NC med}.2^\mu \in \text{NC refl}$ or $2^\mu \in \text{NC med}.2^{2^\mu }\in \text{NC refl}$ .

The present number is merely concerned to give a few equivalent forms of the axiom of infinity, and of the kindred assumption of the existence of $\aleph _{0}$ .

In virtue of *125·24 ·25 below, if the axiom of infinity holds in any one type, then it holds in any other type which can be derived from this one, or from any type from which this one can be derived. Hence if we assume, as it seems natural to do, that all extensional types are derived from a first type, namely that of individuals, then the axiom of infinity in any such type is equivalent to the assumption that the number of individuals is not inductive.

We deal, in this number, first with equivalent forms of $\text{Infin ax}$ , then with equivalent forms of $\text{Infin ax} (x)$ , then with equivalent forms of $\exists !\aleph _{0}$ or $\exists !\aleph_{0}(x)$ . When " $\text{Infin ax}$ " or " $\exists !\aleph _{0}$ " occurs in this number without typical definition, it and all other typically ambiguous symbols are to be taken in the lowest logically possible types, or with the same relative types as if this had been done. The propositions of this number are often not referred to in the sequel, but are here collected together on account of their intrinsic interest.

*125·1. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\alpha \in \text{NC induct}.\supset _{\alpha } .\exists !\alpha \quad[*120·3]$

*125·11. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\alpha \in \text{NC induct}.\supset _{\alpha }.\alpha \neq \alpha +_{c}1 \quad[*120·33]$

*125·12. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha +_{c}1$

Dem. $\begin{array}{l} \vdash . *101·12. *125·1.\supset \\ \vdash \colon\ldotp \text{Infin ax}.&\equiv :\alpha \in \text{NC induct}-\iota ʻ0.\supset_\alpha.\exists !\alpha :\\ [*120·423]&\equiv :\alpha \in \text{NC induct}.\supset_\alpha.\exists !\alpha +_c 1\colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*125·13. $\vdash :\text{Infin ax}.\equiv .\Lambda {\sim}\in \text{NC induct} \quad[*125·1. *24·63]$

*125·14. $\vdash :\text{Infin ax}.\equiv .(+_{c}1)\upharpoonright \text{NC induct}\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*123·22·24.&\supset \vdash :\text{Infin ax}.\supset .(+_{c}1)\upharpoonright \text{NC induct}\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*71·55. &\supset \vdash \colon\ldotp (+_{c}1)\upharpoonright \text{NC induct}\in 1\rightarrow 1.\supset :\\ &\alpha ,\beta \in \text{NC induct}.\alpha +_{c}1=\beta +_{c}1.\supset _{\alpha ,\beta }.\alpha =\beta :\\ [\text{Transp}] &\supset :\alpha ,\beta \in \text{NC induct}.\alpha \neq \beta .\supset _{\alpha ,\beta }.\alpha +_{c}1\neq \beta +_{c}1:\\ [*10·1] &\supset :\Lambda ,\beta \in \text{NC induct}.\Lambda \neq \beta .\supset _{\beta }.\Lambda +_{c}1\neq \beta +_{c}1:\\ [*110·4.\text{Transp}]&\supset : \Lambda \in \text{NC induct}. \beta \in \text{NC induct}. \exists !\beta .\supset _{\beta }.\exists ! (\beta +_{c}1) &\qquad \text{(2)}\\ \vdash .(2).*101·12.*120·13.\supset \\ \vdash \colon\ldotp (+_{c}1) \upharpoonright \text{NC induct} \in 1 \rightarrow 1 . \Lambda \in \text{NC induct}.&\supset : \beta \in \text{NC induct}.\supset _{\beta }.\exists !\beta :\\ [*24·63] &\supset : \Lambda {\sim}\in \text{NC induct} &\qquad \text{(3)}\\ \vdash .(3).*2·01.*125·13.&\supset \vdash :(+_{c}1) \upharpoonright \text{NC induct} \in 1 \rightarrow 1.\supset . \text{Infin ax} &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash . \text{Prop} \end{array}$

*125·15. $\vdash \colon\ldotp \text{Infin ax}.\equiv :\rho \in \text{Cls induct}.\supset _{p}.\exists !-\rho$

Dem. $\begin{array}{l} \vdash .*110·63.&\supset \vdash :x{\sim}\in \rho .\supset _{x}.\rho \cup \iota ʻx\in \text{Nc}ʻ\rho +_{c}1:\\ [*10·28]&\supset \vdash :\exists !-\rho .\supset .\exists ! \text{Nc}ʻ\rho +_{c}1:\\ [\text{Syll}] &\supset \vdash \colon\ldotp \rho \in \text{Cls induct}.\supset _{\rho }.\exists !-\rho :\supset :\\ &\rho \in \text{Cls induct}.\supset _{\rho }.\exists ! \text{Nc}ʻ\rho +_{c}1:\\ [*120·2] &\supset :\alpha \in \text{NC induct} .\rho \in \alpha .\supset _{\alpha ,\rho }.\exists ! \text{Nc}ʻ\rho +_{c}1 :\\ [*100·45]&\supset :\alpha \in \text{NC induct}.\exists !\alpha .\supset _{\alpha } .\exists !\alpha +_{c}1:\\ [*120·13.*101·12] &\supset :\alpha \in \text{NC induct}.\supset _{\alpha }.\exists !\alpha &\qquad \text{(1)}\\ \vdash .*13·12.&\supset \vdash \colon\ldotp \alpha \in \text{NC induct}.\supset _{\alpha }.\exists !(\alpha +_{c}1):\supset :\\ &\alpha \in \text{NC induct}. \text{N}_{0}\text{c}ʻ\rho = \alpha .\supset _{\alpha ,\rho }.\exists !(\text{N}_{0}\text{c}ʻ\rho +_{c}1) :\\ [*120·21] &\supset :\rho \in \text{Cls induct}.\supset _{\rho }.\exists ! (\text{N}_{0}\text{c}ʻ\rho +_{c}1).\\ [*103·11.*63·101.*110·63] &\supset _{\rho }. (\exists \gamma ,z) . \gamma \text{ sm } \rho .z{\sim} \in \gamma .\gamma \in \iota ʻ\rho \cup -\iota ʻ\rho &\qquad \text{(2)}\\ \vdash .*13·12.*10·24. &\supset \vdash :\gamma =\rho .z{\sim} \in \gamma .\supset .\exists !-\rho &\qquad \text{(3)}\\ \vdash .*120·426.*24·6. &\supset \vdash :\rho \in \text{Cls induct} .\gamma \neq \rho .\gamma \subset \rho .\supset .{\sim}(\gamma \text{ sm } \rho ) :\\ [\text{Transp}] &\supset \vdash : \rho \in \text{Cls induct}.\gamma \text{ sm } \rho .\gamma \neq \rho .\supset .\exists !\gamma -\rho .\\ [*24·561] &\supset .\exists !-\rho &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash \colon\ldotp \rho \in \text{Cls induct}: (\exists \gamma , z). \gamma \text{ sm } \rho . z {\sim} \in \gamma .\gamma \in \iota ʻ\rho \cup -\iota ʻ\rho :\supset . \exists !-\rho &\qquad \text{(5)}\\ \vdash .(2).(5).&\supset \vdash \colon\ldotp \alpha \in \text{NC induct}.\supset _{\alpha } . \exists ! (\alpha +_{c} 1) : \supset :\\ &\rho \in \text{Cls induct}. \supset _{\rho } . \exists ! - \rho &\qquad \text{(6)}\\ \vdash .(1).(6).*125·12·1.\supset \vdash . \text{Prop} \end{array}$

*125·16. $\begin{align}\vdash : \text{Infin ax} . \equiv . \exists ! \text{Cls} - \text{Cls induct}. \equiv . &\exists ! \text{N}_{0}\text{C} - \text{NC induct}. \equiv .\\ &\text{V} {\sim} \in \text{Cls induct}\end{align}$

Dem. $\begin{array}{l} \vdash . *125·15 . \supset \vdash \colon\ldotp \text{Infin ax} . &\equiv : \rho \in \text{Cls induct}. \supset _{\rho }. \rho \neq \text{V} :\\ [*13·196] &\equiv :\text{V} {\sim} \in \text{Cls induct} &\qquad \text{(1)}\\ \vdash . *120·481 . \text{Transp} . &\supset \vdash : \exists ! \text{Cls} - \text{Cls induct}. \supset . \text{V} {\sim} \in \text{Cls induct} &\qquad \text{(2)}\\ \vdash . (1). (2). *120·21. \supset \vdash . \text{Prop} \end{array}$

*125·2. $\vdash \colon\ldotp \text{Infin ax} (x). \equiv : \alpha \in \text{NC induct}. \supset _{\alpha } . \exists ! \alpha (x) \quad[*120·301]$

Dem. $\begin{array}{l} \vdash .*125·15.\supset \vdash \colon\ldotp \text{Infin ax}(x).&\equiv :\rho \in \text{Cls induct}\cap \text{Cl}ʻtʻx.\supset _{\rho }.\exists !-\rho :\\ [*63·102] &\equiv :\rho \in \text{Cls induct}\cap \text{Cl}ʻtʻx.\supset _{\rho }.\rho \neq tʻx:\\ [*13·196] &\equiv :tʻx{\sim}\in \text{Cls induct}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*125·22. $\vdash :\text{Infin ax}(x).\equiv .t^{3}ʻx\in \text{Cls refl} \quad[*125·21.*63·66.*124·6]$

*125·23. $\vdash :\text{Infin ax}(x).\equiv .\exists !\aleph _{0}(t^{2}ʻx) \quad[*125·22.*124·15]$

*125·24. $\vdash :\text{Infin ax}(x).\equiv .\text{Infin ax}(tʻx).\equiv .\text{Infin ax}(t^{2}ʻx).\equiv .\text{etc}.$

Dem. $\begin{array}{l} \vdash .*125·21. \supset \vdash :\text{Infin ax}(x).&\equiv .tʻx{\sim}\in \text{Cls induct}.\\ [*120·74] &\equiv .\text{Cl}ʻtʻx{\sim}\in \text{Cls induct}.\\ [*63·66] &\equiv .t^{2}ʻx{\sim}\in \text{Cls induct}.\\ [*125·21] &\equiv .\text{Infin ax}(tʻx):\supset \vdash .\text{Prop} \end{array}$

*125·25. $\begin{align}\vdash :\text{Infin ax}(\alpha ).\equiv .\text{Infin ax}(t_{00}ʻ\alpha ).\equiv .&\text{Infin ax}(t_{0}^{1}ʻ\alpha ).\equiv .\\ &\text{Infin ax}(t^{11}ʻ\alpha ).\equiv .\text{etc}.\\ [*116·91·92.*120·56·52.*125·21]\end{align}$

*125·3. $\vdash :\exists !\aleph _{0}.\equiv .\exists !(1\rightarrow 1)\cap \hat{R} (\exists !\overrightarrow{B}ʻR.{\sim}\exists !\overrightarrow{B}ʻ\breve{R} )$

Dem. $\begin{array}{l} \vdash .*123·1. \supset \vdash :\exists !\aleph _{0}.&\equiv .\exists !\text{Prog}.\\ [*122·11·141] &\supset .\exists !(1\rightarrow 1)\cap \hat{R} (\exists !\overrightarrow{B}ʻR.{\sim}\exists !\overrightarrow{B}ʻ\breve{R} ) &\qquad \text{(1)}\\ \vdash .*123·192. &\supset \vdash :\exists !(1\rightarrow 1)\cap \hat{R} (\exists !\overrightarrow{B}ʻR.{\sim}\exists !\overrightarrow{B}ʻ\breve{R} ).\supset .\exists !\aleph _{0} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*125·31. $\vdash :\exists !\aleph _{0}(x).\equiv .tʻx\in \text{Cls refl} \quad[*124·15]$

*125·32. $\vdash :\exists !\aleph _{0}(x).\equiv \exists !(1\rightarrow 1)\cap \overleftarrow{\text{D}}ʻtʻx-\overleftarrow{\text{ᗡ}}ʻtʻx$

Dem. $\begin{array}{l} \vdash .*63·102. \supset \vdash :\exists !&(1\rightarrow 1)\cap -\overleftarrow{\text{D}}ʻtʻx-\overleftarrow{\text{ᗡ}}ʻtʻx.\equiv .\\ &(\exists R).R\in 1\rightarrow 1.\text{D}ʻR=tʻx.\text{ᗡ}ʻR\subset tʻx.\exists !tʻx-\text{ᗡ}ʻR.\\ [*124·1] &\equiv .tʻx\in \text{Cls refl} &\qquad \text{(1)}\\ \vdash .(1).*125·31.\supset \vdash .\text{Prop} \end{array}$

*125·33. $\vdash \colon\ldotp \exists !\aleph _{0}(x).\equiv :\alpha \subset tʻx.\exists !\alpha .\supset _{\alpha }.\exists !(1\rightarrow 1)\cap \overleftarrow{\text{D}}ʻ\alpha -\overleftarrow{\text{ᗡ}}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*73·7.51·222. &\supset \vdash :\alpha \subset tʻx.y\in \alpha .z\in tʻx-\alpha .\supset .\alpha \text{ sm }(\alpha -\iota ʻy)\cup \iota ʻz.\\ [*73·1] &\supset .(\exists R).R\in 1\rightarrow 1.\text{D}ʻR=\alpha .\text{ᗡ}ʻR=(\alpha -\iota ʻy)\cup \iota ʻz.\\ [*33·6·61] &\supset .\exists !(1\rightarrow 1)\cap \overleftarrow{\text{D}}ʻ\alpha -\overleftarrow{\text{ᗡ}}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1). &\supset \vdash :\exists !\alpha .\exists !tʻx-\alpha .\supset .\exists !(1\rightarrow 1)\cap \overleftarrow{\text{D}}ʻ\alpha -\overleftarrow{\text{ᗡ}}ʻ\alpha :\\ [*63·102]& \supset \vdash :\exists !\alpha .\alpha \subset tʻx.\alpha \neq tʻx.\supset .\exists !(1\rightarrow 1)\cap \overleftarrow{\text{D}}ʻ\alpha -\overleftarrow{\text{ᗡ}}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*125·32.\supset \vdash .\text{Prop} \end{array}$

*125·34. $\vdash :\exists !\aleph _{0}(x).\equiv .\iota ʻtʻx{\sim}\in \text{NC}$

Dem. $\begin{array}{l} \vdash .*125·32.\supset \vdash \colon\ldotp {\sim}\exists !\aleph _{0}(x).&\equiv :R\in 1\rightarrow 1.\text{D}ʻR=tʻx.\supset _{R}.\text{ᗡ}ʻR=tʻx:\\ [*100·13] &\equiv :\text{Nc}ʻtʻx=\iota ʻtʻx.\\ [*100·41·45] &\equiv :\iota ʻtʻx\in \text{NC} &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

*125·35. $\vdash \colon\ldotp \aleph _{0}\text{NC mult}.\supset :\exists !\aleph _{0}(x).\equiv .\text{Infin ax}(x)$

Dem. $\begin{array}{l} \vdash .*125·21.*124·56.\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{Infin ax}(x).&\equiv .tʻx\in \text{Cls refl}.\\ [*125·31] &\equiv .\exists !\aleph _{0}(x)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*125·36. $\vdash :\text{Infin ax}(\text{Cls}).\equiv .\exists !\aleph _{0}(\text{Cls})$

Dem. $\begin{array}{l} \vdash .*24·14.*63·102·66.\supset \vdash .t^{2}ʻx&=\text{Cl}ʻ\text{V} [*24·11] &=\text{Cls} &\qquad \text{(1)}\\ \vdash .(1).*125·24.\supset \vdash :\text{Infin ax}(\text{Cls}).&\equiv .\text{Infin ax}(x).\\ [*125·23.(1)] &\equiv .\exists !\aleph _{0}(\text{Cls}):\supset \vdash .\text{Prop} \end{array}$

We have now arrived at the stage where we can adopt the standpoint of ordinary arithmetic, and can for the future in arithmetical operations with cardinals ignore differences of type. In order to understand how this is so, it will be necessary briefly to recall the line of thought of some of the previous numbers and the conventions upon which the symbolism is based.

The symbolism of *102, though perfectly precise as to the typical relations of the various symbols, is in fact too complex for use, except in cases of absolute necessity. It is better to use the typically ambiguous symbols $\text{Nc}$ and $\text{sm}$ , combined with some simple rules of interpretation of the symbolism, so as to secure that the various occurrences of the same symbols are in their proper relationships of type. This is the course followed in *100, *101, and in every number from *110 onwards.

The important symbols which involve an explicit or implicit use of $\text{Nc}$ or $\text{ sm }$ are called 'formal numbers,' and it is only necessary to make the rules of interpretation apply to them.

A constant formal number is any symbol representing a typically ambiguous constant such that there is a constant $\alpha$ such that, however the ambiguities of type may be determined, the former constant is identical with $\text{Nc}ʻ\alpha$ . The variable formal numbers are defined by enumeration. They are divided into three Sets, the Primary Set, the Argumental Set, and the Arithmetical Set.

The Primary Set consists of $\text{Nc}ʻ\alpha$ , $\Sigma\text{Nc}ʻ\kappa$ , $\Pi \text{Nc}ʻ\kappa$ , where $\alpha$ is a variable $\text{Cls}$ of any type and $\kappa$ is a variable $\text{Cls}^{2}$ of any type. Also $\alpha$ and $\kappa$ may themselves be complex symbols which in some way involve variables.

The Argumental Set has only one member $\text{ sm }ʻʻ\mu$ , where $\mu$ is a variable $\text{Cls}^{2}$ of any type. In its capacity of a formal number $\text{ sm }ʻʻ\mu$ is only interesting when $\mu$ is an $\text{NC}$ ; then $\text{ sm }ʻʻ\mu$ gives the corresponding $\text{NC}$ in another type, provided that $\mu$ is not $\Lambda$ . Also $\mu$ may be a complex symbol which in some way involves a variable, e.g. $\text{ sm }ʻʻ\text{Nc}ʻ\alpha$ is a formal number of the Argumental Set: $\mu$ is called the argument of $\text{ sm }ʻʻ\mu$ .

The Arithmetical Set consists of $\mu +_{c}\nu$ , $\mu \times_{c}\nu$ , $\mu ^\nu$ , $\mu -_{c}\nu$ . These formal numbers are only interesting when $\mu$ and $\nu$ are also members of $\text{NC}$ . Also $\mu$ and $\nu$ may be complex symbols, so long as one of them at least involves a variable. For example $2^{3+_{c}\nu}$ is a formal number, and so is $\alpha +_{c}(3+_{c}\nu)$ .

The Primary and Argumental and Arithmetical Sets of Formal Numbers are derived from the corresponding sets of variable formal numbers, by adding to them the constant formal numbers obtained by substituting constants for the variables occurring in the expressions for the members of the variable set in question.

In the formal numbers of the arithmetical set as written above, $\mu$ and $\nu$ are called the first components. Thus every formal number of this set has two first components. The first components (if any) of the first components are also called components of the original formal number, and so on; so that components of components are components of the original symbol.

A formal number of the arithmetical set, whose components are all formal numbers, either constant or variable but not belonging to the argumental set, is called a pure arithmetical formal number. These are the formal numbers which it is important in arithmetic to secure from assuming the value $\Lambda$ owing to lowness of type.

The logical investigation of *100 and *101, where typically ambiguous formal numbers are used, is directly concerned in investigating the premisses necessary to secure various propositions from fluctuating truth-values owing to the intrusion of null-values among the cardinals. The convention, necessary to avoid determinations of type which we never wish to consider, is as follows, where the terms used are explained fully in the prefatory statement:

$\text{IT}$ . Argumental occurrences are bound to logical and attributive occurrences; and, if there are no argumental occurrences, equational occurrences are bound to logical occurrences. This rule only applies so far as meaning permits after the assignment of types to the real variables.

In *110, *113, *116, *119 we consider the arithmetical operations of addition, multiplication, exponentiation, and subtraction. Also in *117 we consider the comparison of cardinal numbers in respect to the relation of greater and less.

There is no interest in complicating our theorems by allowing for the cases when a pure arithmetical formal number, whose components are ambiguous as to type, becomes equal to $\Lambda$ owing to the low type of one of its components. Also in the theory of greater and less the possibility of null-values in low types has no real interest. Accordingly these are excluded from any consideration by the definitions

[Pg 295] as far as members of the primary set of formal numbers are concerned; and for other formal numbers by the following convention:

$\text{IIT}$ . Whenever a formal number $\sigma$ occurs, so that, if it were replaced by $\text{Nc}ʻ\alpha$ , the dominant type of $\text{Nc}ʻ\alpha$ would by definition have to be adequate, then the dominant type of $\sigma$ is also to be adequate.

When $\sigma$ is a pure arithmetical formal number, this convention secures that the type of every component is adequate.

But in arithmetic we also wish to avoid the intrusion of null-values into the consideration of equations, so far as this avoidance can be attained by the use of high types. Accordingly when we are concerned with the purely arithmetical point of view, we add also the following definition and convention ( $\text{AT}$ ).

Definition. An arithmetical equation is an equation between pure arithmetical formal numbers whose dominant types are both determined adequately.

$\text{AT}$ . All equations involving pure arithmetical formal numbers are to be arithmetical.

This convention is used in *117 and in some earlier propositions which are noted in the prefatory statement.

Its effect is to render the statement of hypotheses often unnecessary. Examples of its application to the numbers where it is not used in the symbolism are also considered in the prefatory statement.

In the case of the inductive numbers we cannot logically prove, apart from $\text{Infin ax}$ , that one type exists which is adequate for all the formal numbers 0, 1, 2, 3, etc. But we can prove that for any particular inductive number, say 521, a type exists for which 521 is not equal to $\Lambda$ . Accordingly for a given symbolic form, in which the symbolism necessarily has only finite complexity, when the types of variables which by hypothesis represent inductive classes or inductive numbers, not $\Lambda$ , have been settled, it is always possible to fix on a type which will be adequate for all the pure arithmetical formal numbers produced by the symbolism of the form, and also at the same time (and here the peculiar properties of inductive numbers come in) to have chosen the original types of the variables so that any of the variables can assume the value of any assigned constant inductive number, say 521, without being null.

The result is that we may assume that the symbols representing inductive numbers are never null, and thereby obtain the stable truth-values of propositions about them.

We make the rule that when $\text{NC ind}$ appears, convention $\text{AT}$ is always applied. The result is that when a formal number is an $\text{NC ind}$ we need never think about its type, and accordingly all the conventions vanish from the mind, as far as pure arithmetical indefinite inductive cardinals are concerned. We supersede all other conventions by the single one that, if it has been proved or assumed that a formal number represents an inductive cardinal, the types are so arranged that that formal number is not equal to $\Lambda$ . The proofs of propositions in this number consist largely of the production of a definite type in which this result is attained.

*126·12. $\vdash :\nu \in \text{NC ind}.\supset .(\nu +_{c}1)\cap tʻ\nu \in \text{NC ind}$

*126·13·14·15. $\vdash :\alpha ,\beta \in \text{NC ind}.\supset .\alpha +_{c}\beta ,\alpha \times _{c}\beta ,\alpha ^\beta \in \text{NC ind}$

*126·141. $\vdash :\alpha ,\beta \in \text{NC ind}-\iota ʻ0.\equiv .\alpha \times _{c}\beta \in \text{NC ind}-\iota ʻ0$

*126·151. $\vdash :\alpha ,\beta \in \text{NC ind}-\iota ʻ0.\alpha \neq 1.\equiv .\alpha ^\beta \in \text{NC ind}-\iota ʻ0-\iota ʻ1$

Also *126·4 ·42 ·43 give the fundamental propositions for subtraction, division, and "inverse exponentiation"; and *126·5 ·51 ·52 ·53 the fundamental propositions for the relations of greater and less.

Whenever the symbol $\text{NC ind}$ is used the Rule of Indefinite Numbers is adhered to, so that all consideration of distinctions in type among inductive cardinals can be laid aside (cf. Prefatory Statement and also the Summary of this number).

*126·011. $\vdash :\nu \in \text{NC ind}.\equiv .\nu \in \text{NC induct}-\iota ʻ\Lambda \quad[(*126·01)]$

*126·1. $\vdash :\nu \in \text{NC ind}.\equiv .(\exists \alpha ).\alpha \in \text{Cls induct}.\nu =\text{Nc}ʻ\alpha .\exists !\nu$

Dem. $\begin{array}{l} \vdash .*120·14.*100·4.*126·011.\supset \\ \vdash :\nu \in \text{NC ind}.&\supset .(\exists \alpha ).\nu =\text{Nc}ʻ\alpha .\nu \in \text{NC induct}-\iota ʻ\Lambda .\\ [*118·01] &\supset .(\exists \alpha ).\nu =\text{Nc}ʻ\alpha .\text{Nc}ʻ\alpha \in \text{NC induct}-\iota ʻ\Lambda .\exists !\nu .\\ [*120·211] &\supset .(\exists \alpha ).\alpha \in \text{Cls induct}.\nu =\text{Nc}ʻ\alpha .\exists !\nu &\qquad \text{(1)}\\ \vdash .*120·21. &\supset \vdash :(\exists \alpha ).\alpha \in \text{Cls induct}.\nu =\text{Nc}ʻ\alpha .\exists !\nu .\\ &\supset .(\exists \alpha ).N _{0}cʻ\alpha \in \text{Nc induct}.\nu =\text{Nc}ʻ\alpha .\exists !\nu .\\ [*120·15.*100·511] &\supset .\nu \in \text{NC induct}-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*126·101. $\begin{align}&\vdash \colon\ldotp \mu ,\nu \in \text{NC ind}.\exists !\mu _{\lambda }.\supset :\mu _{\lambda }=\nu _{\lambda }.\equiv .\mu _{\lambda }=\nu .\equiv .\mu =\nu \\ &[*126·1.*103·16]\end{align}$

*126·12. $\vdash :\nu \in \text{NC ind}.\supset .(\nu +_{c}1)\cap tʻ\nu \in \text{NC ind}$

Dem. $\begin{array}{l} \vdash .*120·151. &\supset \vdash :\nu \in \text{NC ind}.\supset .\nu +_{c}1\in \text{NC induct} &\qquad \text{(1)}\\ \vdash .*117·66.*118·01. &\supset \vdash :\alpha \in \text{Cls induct}.\nu =\text{N}_{0}\text{c}ʻ\alpha .\exists !\nu .\supset .\text{Nc}ʻ\text{Cl}ʻ\alpha >\nu .\\ [*126·1.*120·429] &\supset .\text{Nc}ʻ\text{Cl}ʻ\alpha \geq \nu +_{c}1.\\ [*103·13.*117·32] &\supset .\exists !(\nu +_{c}1)\cap tʻ\text{Cl}ʻ\alpha .\\ [*103·12.*60·34] &\supset .\exists !(\nu +_{c}1)\cap tʻ\nu &\qquad \text{(2)}\\ \vdash .(1).(2).*126·1.\supset \vdash .\text{Prop} \end{array}$

This proposition, taken in connection with *120·4232, embodies the convention named the Rule of Indefinite Numbers and its justification. The convention is that 1, 2, 3, ... are always in future to be used in existential types. In other words whenever any particular inductive number is employed, it is determined in a type in which it is not $\Lambda$ . The justification is that by *126·11 ·12 such a type can always be found for each particular inductive number.

The convention is also applied to arithmetical formal numbers in *126·13 ·14 ·15.

For all arithmetical and equational occurrences this convention is really the outcome of $\text{IT}$ , $\text{IIT}$ , and $\text{AT}$ .

*126·13. $\begin{align}&\vdash :\alpha ,\beta \in \text{NC ind}.\equiv .\alpha +_{c}\beta \in \text{NC ind}\\ &[*120·71.*126·1.*110·3.*103·13]\end{align}$

*126·14. $\begin{align}&\vdash :\alpha ,\beta \in \text{NC ind}.\supset .\alpha \times _{c}\beta \in \text{NC ind}\\ &[*120·72.*126·1.*113·25.*103·13]\end{align}$

*126·141. $\begin{align}&\vdash :\alpha ,\beta \in \text{NC ind}-\iota ʻ0.\equiv .\alpha \times _{c}\beta \in \text{NC ind}-\iota ʻ0\\ &[*120·721.*113·114]\end{align}$

*126·15. $\vdash :\alpha ,\beta \in \text{NC ind}.\supset .\alpha ^\beta \in \text{NC ind} \quad[*120·73.*116·25.*103·13]$

*126·151. $\begin{align}&\vdash :\alpha ,\beta \in \text{NC ind}-\iota ʻ0.\alpha \neq 1.\equiv .\alpha ^\beta \in \text{NC ind}-\iota ʻ0-\iota ʻ1\\ &[*120·731.*116·35.*117·592]\end{align}$

*126·23. $\vdash :\mu \in \text{NC}.\exists !\mu \cap tʻ\alpha .\supset .\exists !2^\mu \cap tʻtʻ\alpha .\exists !(\mu +_{c}1)\cap tʻtʻ\alpha$

Dem. $\begin{array}{l} \vdash .*63·661.*116·72.\supset \\ \vdash :\mu \in \text{NC}.\beta \in \mu \cap tʻ\alpha .\supset .\text{Cl}ʻ\beta \in 2^\mu \cap tʻtʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*117·32.\supset \\ \vdash :\text{Hp}(1).2^\mu \geq \nu .\supset .\exists !\text{ sm }ʻʻ\nu \cap tʻtʻ\alpha &\qquad \text{(2)}\\ \vdash .*117·661·31.\supset \vdash :\text{Hp}(1).\supset .2^\mu \geq \mu +_{c}1 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*100·511.\supset \vdash .\text{Prop} \end{array}$

*126·31. $\vdash :\alpha +_{c}1\in \text{NC ind}.\equiv .\alpha \in \text{NC ind} \quad[*126·12·13·121.*120·452]$

Note that the specification of the type of $\alpha +_{c}1$ is omitted in accordance with the convention. The reference to *126·12 shows that it is always possible to apply the convention.

*126·32. $\vdash :\alpha \in \text{NC}-\iota ʻ0-\iota ʻ\Lambda .\nu \in \text{NC ind}.\supset .\alpha +_{c}\nu >\nu \quad[*120·428.*110·3]$

*126·33. $\vdash \colon\ldotp \alpha \in \text{NC ind}.\beta \in \text{NC}-\iota ʻ\Lambda .\supset :\alpha <\beta .\lor.\alpha =\beta .\lor.\alpha >\beta \quad[*120·441]$

*126·4. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\supset :\mu +_{c}\varpi =\nu +_{c}\varpi .\equiv .\mu =\nu \\ &[*126·13.*120·41]\end{align}$

*126·41. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\supset :\mu \times _{c}\varpi =\nu \times _{c}\varpi .\equiv .\mu =\nu \\ &[*120·51.*126·14]\end{align}$

*126·42. $\begin{align}&\vdash \colon\ldotp \mu \nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\supset :\mu ^{\varpi }=\nu ^{\varpi }.\equiv .\mu =\nu \\ &[*120·55.*126·15]\end{align}$

*126·43. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\omega \neq 1·\supset :\varpi ^\mu =\varpi ^\nu .\equiv .\mu =\nu \\ &[*120·53.*126·15]\end{align}$

*126·5. $\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\supset :\mu +_{c}\varpi >\nu +_{c}\varpi .\equiv .\mu >\nu$

Dem. $\begin{array}{l} \vdash .*117·561. &\supset \vdash :\text{Hp}.\mu >\nu .\supset .\mu +_{c}\varpi \geq \nu +_{c}\varpi &\qquad \text{(1)}\\ \vdash .*126·4. &\supset \vdash :\text{Hp}.\mu >\nu .\supset .\mu +_{c}\varpi \neq \nu +_{c}\varpi &\qquad \text{(2)}\\ \vdash .(1).(2).*117·26. &\supset \vdash :\text{Hp}.\mu >\nu .\supset .\mu +_{c}\varpi >\nu +_{c}\varpi &\qquad \text{(3)}\\ \vdash .*117·561.\text{Transp}.*117·281.\supset\\ \vdash :\text{Hp}.\mu +_{c}\varpi >\nu +_{c}\varpi .&\supset .{\sim}(\nu \geq \mu ).\\ [*126·33] &\supset .\mu >\nu &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*126·51. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\supset :\mu \times _{c}\varpi >\nu \times _{c}\varpi .\equiv .\mu >\nu \\ &[*117·571.*126·41]\end{align}$

*126·52. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\supset :\mu ^{\varpi }>\nu ^{\varpi }.\equiv .\mu >\nu \\ &[*117·581.*126·42]\end{align}$

*126·53. $\begin{align}&\vdash \colon\ldotp \mu ,\nu ,\varpi \in \text{NC ind}.\varpi \neq 0.\varpi \neq 1.\supset :\varpi ^\mu >\varpi ^\nu .\equiv .\mu >\nu \\ &[*117·591.*126·43]\end{align}$

The subject to be treated in this Part is a general kind of arithmetic of which ordinal arithmetic is a particular application. The form of arithmetic to be treated in this Part is applicable to all relations, though its chief importance is in regard to such relations as generate series. The analogy with cardinal arithmetic is very close, and the reader will find that what follows is much facilitated by bearing the analogy in mind.

The outlines of relation-arithmetic are as follows. We first define a relation between relations, which we shall call ordinal similarity or likeness, and which plays the same part for relations as similarity plays for classes. Likeness between $P$ and $Q$ is constituted by the fact that the fields of $P$ and $Q$ can be so correlated by a one-one relation that if any two terms have the relation $P$ , their correlates have the relation $Q$ , and vice versa. If $P$ and $Q$ generate series, we may express this by saying that $P$ and $Q$ are like if their fields can be correlated without change of order. Having defined likeness, our next step is to define the relation-number of a relation $P$ as the class of relations which are like $P$ , just as the cardinal number of a class $\alpha$ is the class of classes which are similar to $\alpha$ . We then proceed to addition. The ordinal sum of two relations $P$ and $Q$ is defined as the relation which holds between $x$ and $y$ when $x$ and $y$ have the relation $P$ or the relation $Q$ , or when $x$ is a member of $CʻP$ and $y$ is a member of $CʻQ$ . If $P$ and $Q$ generate series, it will be seen that this defines the sum of $P$ and $Q$ as the series resulting from adding the $Q$ -series after the end of the $P$ -series. The sum is thus not commutative. The sum of the relation-numbers of $P$ and $Q$ is of course the relation-number of their sum, provided $CʻP$ and $CʻQ$ have no common terms.

The ordinal product of two relations $P$ and $Q$ is the relation between two couples $z\downarrow x$ , $w\downarrow y$ , when $x$ , $y$ belong to $CʻP$ and $z$ , $w$ belong to $CʻQ$ and either $xPy$ or $x=y.zQw$ . Thus, for example, if the field of $P$ consists of $1_{P}$ , $2_{P}$ , $3_{P}$ , and the field of $Q$ consists of $1_{Q}$ , $2_{Q}$ , the relation $P \times Q$ will hold from any earlier to any later term of the following series: $1_{Q}\downarrow 1_{P},\, 2_{Q}\downarrow 1_{P},\, 1_{Q}\downarrow 2_{P},\, 2_{Q}\downarrow 2_{P},\, 1_{Q}\downarrow 3_{P},\, 2_{Q}\downarrow 3_{P}.$ It is plain that, denoting the ordinal product of $P$ and $Q$ by $P \times Q$ , we have $Cʻ(P\times Q)=CʻP\times CʻQ,$ [Pg 302] where the second " $\times$ " as standing between classes has the meaning defined in *113·01.

Infinite ordinal sums and products will also be defined, but the definitions are somewhat complicated.

The arithmetic which results from the above definitions satisfies all those of the formal laws which are satisfied in ordinal arithmetic, when this is not confined to finite ordinals; that is to say, relation-numbers satisfy the associative law for addition and for multiplication[10], they satisfy the distributive law in the shape (where the + and $\times$ are those appropriate to relation-numbers) $(\beta +\gamma )\times \alpha =(\beta \times \alpha )+(\gamma \times \alpha ),$ and they satisfy the exponential laws $\begin{aligned} \alpha ^\beta \times \alpha ^\gamma &=\alpha ^{(\beta +\gamma )},\\ (\alpha ^\beta )^\gamma &=\alpha ^{\beta \times \gamma }. \end{aligned}$ They do not in general satisfy the commutative law either in addition or in multiplication, nor do they satisfy the distributive law in the form $\alpha \times (\beta +\gamma )=(\alpha \times \beta )+(\alpha \times \gamma ),$ nor the exponential law $\alpha ^\gamma \times \beta ^\gamma =(\alpha \times \beta )^\gamma .$ But in the particular case in which the relations concerned are finite serial relations, the corresponding relation-numbers do satisfy these additional formal laws; hence the arithmetic of finite ordinals is exactly analogous to that of inductive cardinals (cf. Part V, Section E).

If the relations concerned are limited to well-ordered relations, relation-arithmetic becomes ordinal arithmetic as developed by Cantor; but many of Cantor's propositions, as we shall see in this Part, do not require the limitation to well-ordered relations.

FOOTNOTES:

[10] For the associative law of multiplication, a hypothesis is required as to the kind of relation concerned. Cf. *174·241 ·25.

Two series generated by the relations $P$ and $Q$ respectively are said to be ordinally similar when their terms can be correlated as they stand, without change of order. In the accompanying figure, the relation $S$ correlates the members of $CʻP$ and $CʻQ$ in such a way that if $xPy$ , then $(\breve{S} ʻx)Q(\breve{S} ʻy)$ , and if $zQw$ , then $(Sʻz)P(Sʻw)$ . It is evident that the journey from $x$ to $y$ (where $xPy$ ) may, in such a case, be taken by going first to $\breve{S} ʻx$ , thence to $\breve{S} ʻy$ , and thence back to $y$ , so that $xPy.\equiv .x(S\mid Q\mid \breve{S})y$ , i.e. $P=S\mid Q\mid \breve{S}$ . Hence to say that $P$ and $Q$ are ordinally similar is equivalent to saying that there is a one-one relation $S$ which has $CʻQ$ for its converse domain and gives $P=S\mid Q\mid \breve{S}$ . In this case we call $S$ a correlator of $Q$ and $P$ .

We denote the relation of ordinal similarity by " $\text{smor}$ ," which is short for "similar ordinally." Thus $P\,\text{smor}\,Q.\equiv .(\exists S).S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S\mid Q\mid \breve{S} .$

It will be found that the relation $S\mid Q\mid \breve{S}$ plays the same part in relation to $Q$ in relation-arithmetic as $Sʻʻ\beta$ plays in relation to $\beta$ in cardinal arithmetic. It is therefore desirable to have a simpler notation for $S\mid Q\mid \breve{S}$ . We put $S^{;}Q=S\mid Q\mid \breve{S} \quad\text{Df}.$ [Pg 304] We shall find that the semi-colon so defined has the same kind of properties in relation-arithmetic as the two inverted commas have in cardinal arithmetic. Corresponding to the notation $S_{\in }ʻ\beta$ , we put $S\dagger Q = S\mid Q\breve{S} \quad\text{Df}.$ We shall thus have $S\dagger =S\parallel\breve{S}$ . It will appear that $S\dagger$ has ordinal properties analogous to the cardinal properties of $S_{\in }$ . Thus e.g. where $S\parallel\breve{S} _{\in }$ appears as a cardinal correlator, $S\parallel \text{Cnv}ʻS\dagger$ will appear as an ordinal correlator (in each case with the converse domain suitably limited).

The elementary properties of $S^{;}Q$ will be considered in *150. We shall then, in *151, be able to study ordinal similarity, taking as our definition of an ordinal correlator $P\,\overline{\text{smor}}\,Q=\hat{S}\{S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q\} \quad\text{Df},$ and defining two relations as ordinally similar when they have at least one ordinal correlator, i.e. putting (on the analogy of *73) $\text{smor}=\hat{P} \hat{Q}\{\exists !P\,\overline{\text{smor}}\,Q\} \quad\text{Df}.$

There is no need to confine the notion of ordinal similarity (or likeness, as we shall also call it) to serial relations. When two relations have ordinal similarity, their internal structures are analogous, and they therefore have many common properties. Whenever similarity has been proved between two classes $\alpha$ and $\beta$ , then if $\beta$ is given as the field of some relation $Q$ , and $S$ is the correlating relation, $S^{;}Q$ is like $Q$ , and has $\alpha$ for its field. Hence similar classes are the fields of like relations. It must not be supposed, however, that like relations are coextensive with relations whose fields are similar. This does not hold even when we confine ourselves to serial relations, except in the special case of finite serial relations.

The definition of relation-numbers (*152) is as follows: The relation-number of $P$ , which we call $\text{Nr}ʻP$ , is the class of relations which are ordinally similar to $P$ ; and the class of relation-numbers, which we denote by $\text{N}R$ , is the class of all classes of the form $\text{Nr}ʻP$ . The elementary properties of relation-numbers, treated in *152, are closely analogous to those of cardinal numbers treated in *100.

After a few propositions about the ordinal 0 and the ordinal 2, which we call $0_{r}$ and $2_{r}$ (*153), we pass to the consideration of relation-numbers of various types. It will be observed that " $\text{smor}$ ," like " $\text{sm}$ ," is a relation which is ambiguous as to the type both of its domain and of its converse domain. Thus " $P \,\text{smor} \,Q$ " only has an unambiguous meaning when the types of $P$ and $Q$ are determined. $P$ and $Q$ may or may not be of the same type; the only restriction upon the type of either is that both must be "homogeneous" relations, i.e. relations whose domain and converse domain[Pg 305] are of the same type. This restriction results from the fact that $CʻQ$ occurs in the definition of " $P\,\text{smor}\,Q$ ," and a relation does not have a field unless it is homogeneous; hence $Q$ must be homogeneous, and therefore, whatever $S$ may be, $S\mid Q\mid \breve{S}$ must be homogeneous, i.e. $P$ must be homogeneous. Thus e.g. such relations as $\text{D}$ , $\iota$ , or $\in$ are not ordinally similar either to themselves or to anything else. Whenever " $P\,\text{smor}\,Q$ " is significant for a suitable $Q$ , we have $P\,\text{smor}\,P$ ; but if $P$ is not homogeneous, " $P\,\text{smor}\,Q$ " is never significant. Hence throughout the theory of ordinal similarity, the relations of which ordinal similarity is affirmed or denied must be homogeneous. The correlators, on the contrary, need not be homogeneous.

Owing to the homogeneity of our relations, the types of relation-numbers are much more easily dealt with than they otherwise would be; for the type of a homogeneous relation is determined by that of a single class, namely its field, whereas the type of a relation in general depends upon the types of two classes, namely its domain and its converse domain. Since, where likeness is concerned, the type of the field determines the type of the relation, propositions concerning the relations between different typical determinations of a given relation-number are, for the most part, exactly analogous to and deducible from those for cardinals. In fact, a relation ordinally similar to $Q$ exists in the type of $P$ when, and only when, a class similar to $CʻQ$ exists in the type of $CʻP$ , i.e. $\exists !\text{Nr}(P)ʻQ.\equiv .\exists !\text{Nc}(CʻP)ʻCʻQ.$ The half of this proposition follows from the fact that, if $P$ is like $Q$ , $CʻP$ is similar to $CʻQ$ . The other half follows from the fact, mentioned above, that if $\beta =CʻQ$ and $\alpha\text{ sm } \beta$ , then there is a relation like $Q$ and having $\alpha$ for its field. Now if $\alpha$ belongs to the type of $CʻP$ , any relation having $\alpha$ for its field is contained in $t_{0}ʻCʻP\uparrow t_{0}ʻCʻP$ . Hence in the case supposed there is a relation like $Q$ and contained in $t_{0}ʻCʻP\uparrow t_{0}ʻCʻP$ . But the relations contained in $t_{0}ʻCʻP\uparrow t_{0}ʻCʻP$ constitute $tʻP$ . Hence there is a relation which is like $Q$ and is a member of $tʻP$ , whence our proposition results. By means of this proposition and those of *102—6, the properties of relation-numbers with respect to types follow easily. The conventions $\text{IT}$ , $\text{IIT}$ and $\text{AT}$ apply to relation-numbers as to cardinals; they are to be applied in the same way as in the analogous propositions of Part III, Section A.

In this number we introduce two notations which have uses in regard to relations closely analogous to the uses of $Rʻʻ\alpha$ and $R_{\in}$ in regard to classes. These two notations are defined as follows: $\begin{aligned} S^{;}Q&=S\mid Q\mid \breve{S} \quad\text{Df},\\ S\dagger Q&=S\mid Q\mid \breve{S} \quad\text{Df}. \end{aligned}$ We then have $\vdash .S\dagger Q=S^{;}Q=S\mid Q\mid \breve{S}=(S\parallel \breve{S})ʻQ$ .

$S\dagger Q$ is merely an alternative to $S^{;}Q$ , just as $R_{\in}ʻ\alpha$ is an alternative to $Rʻʻ\alpha$ . Also $S\dagger =S\parallel \breve{S}$ , in virtue of *38·01 and *43·01.

The uses of $S^{;}Q$ occur chiefly when $S$ is a one-one relation and $CʻQ\subset \text{ᗡ}ʻS$ . This case is illustrated in the figure in the introduction to this section. Here if $Q$ relates $x$ and $y$ , $S^{;}Q$ relates $Sʻx$ and $Sʻy$ . Thus given a class $\alpha$ similar to $CʻQ$ , if $S$ is the correlating relation, $S^{;}Q$ has $\alpha$ for its field, and has, in very many respects, properties analogous to those of $Q$ .

$S^{;}Q$ is important for many special values of $S$ . For example, let $Q$ be a relation between relations; then $C^{;}Q$ will be the corresponding relation of the fields of these relations. If $Q$ be any relation, $\downarrow x^{;}Q$ will be the corresponding relation between ordered couples of which $x$ is the relatum; i.e. if $yQz$ , the relation $\downarrow x^{;}Q$ will hold between $y\downarrow x$ and $z\downarrow x$ . If $Q$ is a relation between classes, and we have $\beta Q\gamma$ , then the relation $\alpha\cup ^{;}Q$ will hold between $\alpha \cup \beta$ and $\alpha\cup \gamma$ . In short, whenever $S$ is a one-many relation, and therefore gives rise to a descriptive function, then $S^{;}Q$ is the relation which holds between $Sʻy$ and $Sʻz$ whenever $Q$ holds between $y$ and $z$ .

We introduce one other new notation in this number, corresponding to $\alpha \unicode{x2640}_{,,}y$ in *38. This notation is thus defined: $Q\unicode{x2640}_{.,}y=\unicode{x2640}y^{;}Q \quad\text{Df}.$ The purpose of this notation is to enable us to proceed to $Q\unicode{x2640}_{.,}^{;}P$ and other similar notations; or, otherwise stated, to enable us to treat $\unicode{x2640}y^{;}Q as$ a function of y rather than of $Q$ . Take for example the case of $x\downarrow^{;}Q$ . [Pg 307]We may wish to consider various relations $x\downarrow ^{;}Q$ , $y\downarrow ^{;}Q$ , where we are to have (say) $xPy$ . To express the relation of $x\downarrow ^{;}Q$ to $y\downarrow ^{;}Q$ resulting from $xPy$ , we need the above notation. By its help, we have $\begin{aligned} x\downarrow ^{;}Q&=Q\downarrow_{.,} ʻx.y\downarrow ^{;}Q=Q\downarrow_{.,} ʻy.\\ \text{Hence}\qquad xPy.&\equiv .(Q\downarrow_{.,} ʻx)(Q\downarrow_{.,} ^{;}P)(Q\downarrow_{.,} ʻy). \end{aligned}$ Thus $Q\downarrow_{.,} ^{;}P$ is the relation between $x\downarrow^{;}Q$ and $y\downarrow ^{;}Q$ corresponding to the relation $P$ between $x$ and $y$ . $Q\downarrow_{.,} ^{;}P$ plays the same part in relation-arithmetic as is played by $\alpha\downarrow_{,,}ʻʻ\beta$ in cardinal arithmetic.

The notations of this number are capable of occasional uses in cardinal arithmetic[11], but their chief utility is in relation-arithmetic, in which they are fundamental.

In order to minimize the use of brackets, we put $\begin{aligned} RʻS^{;}Q&=Rʻ(S^{;}Q) &\quad\text{Df},\\ R^{;}S^{;}Q&=R^{;}(S^{;}Q) &\quad\text{Df}. \end{aligned}$

This proposition, which is the analogue of $(P\mid Q)ʻʻ\gamma=PʻʻQʻʻy$ (*37·33), is very often used. We have also

The remaining propositions of this number (with a few exceptions) may be thus classified:

(1) Propositions concerning the domain, converse domain, and field of $S^{;}Q$ (*150·2—·23). Owing to the fact that the chief applications of this subject are to cases where $Q$ and $S^{;}Q$ are serial, the field of $S^{;}Q$ is more important than its domain or converse domain. Thus the chief propositions here are

The hypothesis $CʻQ\subset \text{ᗡ}ʻS$ is verified in almost all applications of $S^{;}Q$ . When it is not verified, the part of $CʻQ$ not contained in $\text{ᗡ}ʻS$ is irrelevant to the value of $S^{;}Q$ . The hypothesis $CʻQ=\text{ᗡ}ʻS$ is very often verified in practice, [Pg 308]since it is verified when $S$ is a correlator of $S^{;}Q$ and $Q$ .

(2) Propositions concerning relations with limited domains, converse domains, or fields (*150·32—·38). Broadly speaking, a limitation on the field of $Q$ is equivalent to a limitation on the converse domain of $S$ , and both are equivalent to a corresponding limitation on the field of $S^{;}Q$ provided $S\in\text{Cls}\rightarrow 1$ . The limitations that occur in practice are limitations on the converse domain of $S$ , with consequent limitations on the fields of $Q$ and $S^{;}Q$ .

*150·35. $\vdash \colon\ldotp y\in CʻQ.\supset _{y}.Rʻy=Sʻy:\supset .R^{;}Q=S^{;}Q$

*150·36. $\vdash .(S\upharpoonright \beta )^{;}Q=S^{;}(Q\unicode{x0294f}\beta )$

*150·37. $\vdash :S\in \text{Cls}\rightarrow 1.\supset .S^{;}(Q\unicode{x0294f}\beta )=(S^{;}Q)\unicode{x0294f}Sʻʻ\beta =(S\upharpoonright \beta )^{;}Q=\{(Sʻʻ\beta )\upharpoonleft S\}^{;}Q$

(3) Propositions on $S^{;}Q$ when $S$ is one-many or many-one (*150·4—·56). We have

*150·4. $\vdash \colon\ldotp S\in 1\rightarrow \text{Cls}.\supset :x(S^{;}Q)y.\equiv .(\exists z,w).x=Sʻz.y=Sʻw.zQw$

*150·41. $\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1.\supset :x(S^{;}Q)y.\equiv .(\breve{S} ʻx)Q(\breve{S} ʻy)$

The remaining propositions of this set are chiefly applications of *150·4 ·41 to special cases.

(4) A few propositions on $Q\unicode{x2640}_{.,}y$ (*150·6—·62). These are immediate consequences of the definition.

(5) A set of propositions on couples and matters connected with them (*150·7—·75). The chief of these is

*150·71. $\vdash :S\in 1\rightarrow \text{Cls}.z,w\in \text{ᗡ}ʻS.\supset .S^{;}(z\downarrow w)=(Sʻz)\downarrow (Sʻw)$

(6) We next have four propositions (*150·8—·83) on $S^{;}P$ when $P$ is a power of $Q$ . These belong with the propositions of *92; they are useful in the ordinal theory of finite and infinite. We have

*150·82·83. $\begin{align}\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1:\text{D}ʻQ\subset &\text{ᗡ}ʻS.\lor.\text{ᗡ}ʻQ\subset \text{ᗡ}ʻS:\supset .\\ \text{Pot}ʻS^{;}Q=S\daggerʻʻ\text{Pot}ʻQ.(S^{;}Q)_{\text{po}}=S^{;}Q_{\text{po}}\end{align}$

It follows that, in the hypothesis supposed, if $S$ is a correlator of $P$ and $Q$ , it is also a correlator of $P_{\text{po}}$ and $Q_{\text{po}}$ .

(7) Propositions concerning the relation $S\dagger$ (*150·14—·171 and *150·9—·94). These have uses analogous to those of propositions concerning $S_{\in }$ . The most important are

*150·16. $\vdash .\dot{s} ʻR\dagger ʻʻ\lambda =R\dagger (\dot{s} ʻ\lambda )=R^{;}\dot{s} ʻ\lambda$

This proposition is analogous to $sʻRʻʻʻ\kappa =Rʻʻsʻ\kappa$ (*40·38), i.e. to $sʻR_{\in }ʻʻ\kappa =R_{\in }ʻsʻ\kappa =Rʻʻsʻ\kappa ,$ as appears on substituting $\dot{s}$ and $R\dagger$ for $s$ and $R_{\in }$ in this variant of *40·38.

The remaining propositions are mainly of the nature of lemmas, to be used once or twice each in relation-arithmetic.

Here, as in *38, " $\unicode{x2640}$ " stands for any sign which, when placed between two letters, defines a descriptive function of the arguments represented by those letters. Thus for example " $\unicode{x2640}$ " may represent any of the following: $\cap ,\, \cup ,\, \dot{\cap} ,\, \unicode{x228d} ,\, \mid ,\, \upharpoonleft ,\, \upharpoonright ,\, \unicode{x0294f},\, \uparrow ,\, \downarrow .$

*150·1. $\begin{align}&\vdash .S^{;}Q=S\mid Q\mid \breve{S} =(S\parallel \breve{S} )ʻQ=S\dagger Q=S\dagger ʻQ\\ &[*43·112.*38·11.(*150·01·02)]\end{align}$

*150·11. $\vdash :x(S^{;}Q)y.\equiv .(\exists z,w).xSz.ySw.zQw \quad[*34·1.*31·11]$

Dem. $\begin{array}{l} \vdash .*150·1.(*150·05). \supset \vdash .R^{;}S^{;}Q&=R^{;}(S\mid Q\mid \breve{S} )\\ [*150·1] &=R\mid S\mid Q\mid \breve{S} \mid \breve{R}\\ [*34·2] &=R\mid S\mid Q\mid \text{Cnv}ʻ(R\mid S)\\ [*150·1] &=(R\mid S)^{;}Q.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*150·13. \supset \vdash .R^{;}(S\mid \breve{R} )^{;}Q&=(R\mid S\mid \breve{R} )^{;}Q\\ [*150·1] & =(R^{;}S)^{;}Q.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*150·1·13. \supset \vdash .R\dagger ʻS\dagger ʻQ=(R\mid S)\dagger ʻQ &\qquad \text{(1)}\\ \vdash .(1).*34·42.\supset \vdash .\text{Prop} \end{array}$

*150·151. $\vdash \colon\ldotp (x).\text{E}!Sʻx: S\in \text{Cls}\rightarrow 1:\supset .S\dagger \in 1\rightarrow 1 \quad[*74·772.*150·141]$

The following proposition is used in the theory of double ordinal similarity (*164·13).

*150·152. $\vdash :S\upharpoonright sʻCʻʻ\lambda \in \text{Cls}\rightarrow 1.sʻCʻʻ\lambda \subset \text{ᗡ}ʻS.\supset .(S\dagger )\upharpoonright \lambda \in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*74·775 \frac{S,S}{Q,R}.\supset \\ \vdash :S\upharpoonright sʻCʻʻ\lambda \in \text{Cls}\rightarrow 1.sʻ\text{D}ʻʻ\lambda \subset \text{ᗡ}ʻS.sʻ\text{ᗡ}ʻʻ\lambda &\subset \text{ᗡ}ʻS.\supset .\\ &(S\parallel \breve{S} )\upharpoonright \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*40·57.*150·141.\supset \vdash .\text{Prop} \end{array}$

*150·153. $\begin{align}\vdash \colon\ldotp S\upharpoonright sʻCʻʻ\lambda \in \text{Cls}\rightarrow 1.sʻCʻʻ\lambda \subset \text{ᗡ}ʻS.Q,&R\in \lambda .\supset :\\ &S^{;}Q=S^{;}R.\supset .Q=R\end{align}$

Dem. $\begin{array}{l} \vdash .*150·152.*71·55.\supset \vdash \colon\ldotp \text{Hp}.&\supset :S\dagger ʻQ=S\dagger ʻR.\supset .Q=R:\\ [*150·1] &\supset :S^{;}Q=S^{;}R.\supset .Q=R\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The above proposition is used in dealing with relations of relations of couples (*165·23).

*150·16. $\vdash .\dot{s} ʻR\dagger ʻʻ\lambda =R\dagger (\dot{s} ʻ\lambda )=R^{;}\dot{s} ʻ\lambda \left[*43·43\frac{\breve{R}}{S}.*150·141·1\right]$

*150·17. $\vdash .(R\upharpoonright \lambda )\dagger =R\dagger \mid \unicode{x0294f}\lambda$

Dem. $\begin{array}{l} \vdash .*150·1.\supset \vdash .(R\upharpoonright \lambda )\dagger ʻP&=(R\upharpoonright \lambda )\mid P\mid (\lambda \upharpoonleft \breve{R} )\\ [*35·354] &=R\mid \lambda \upharpoonleft P\upharpoonright \lambda \mid \breve{R} \\ [*150·1.*36·11] &=R\dagger (P\unicode{x0294f}\lambda )\\ [*38·11] & =R\dagger ʻ\unicode{x0294f}\lambda ʻP &\qquad \text{(1)}\\ \vdash .(1).*34·42.\supset \vdash .\text{Prop} \end{array}$

*150·171. $\vdash :sʻCʻʻCʻQ\subset \lambda .\supset .(R\upharpoonright \lambda )\dagger ^{;}Q=R\dagger ^{;}Q.\unicode{x0294f}\lambda ^{;}Q=Q$

Dem. $\begin{array}{l} \vdash .*150·17·13.&\supset \vdash .(R\upharpoonright \lambda )\dagger ^{;}Q=R\dagger ^{;}\unicode{x0294f}\lambda ^{;}Q &\qquad \text{(1)}\\ \vdash . *150·11. &\supset \vdash :M(\unicode{x0294f}\lambda ^{;}Q)N.\equiv .(\exists S,T).M=S\unicode{x0294f}\lambda .N=T\unicode{x0294f}\lambda .SQT &\qquad \text{(2)}\\ \vdash .*33·17. \supset \vdash :SQT.&\supset .S,T\in CʻQ.\\ [*37·62] &\supset .CʻS,CʻT\in CʻʻCʻQ.\\ [*40·13] &\supset .CʻS\subset sʻCʻʻCʻQ.CʻT\subset sʻCʻʻCʻQ &\qquad \text{(3)}\\ \vdash .(3). \supset \vdash \colon\ldotp \text{Hp}.&\supset :SQT.\supset .CʻS\subset \lambda .CʻT\subset \lambda .\\ [*36·25] &\supset .S\unicode{x0294f}\lambda =S.T\unicode{x0294f}\lambda =T &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash \colon\ldotp \text{Hp}.\supset :M(\unicode{x0294f}\lambda ^{;}Q)N.&\equiv .(\exists S,T).M=S.N=T.SQT.\\ [*13·22] &\equiv .MQT:\\ [*21·43] &\supset :\unicode{x0294f}\lambda ^{;}Q=Q &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

The above proposition is required in the theory of double ordinal similarity. It is used in proving *164·141, which is used in *164·18, which is a fundamental proposition in the theory of double ordinal similarity.

The following propositions, on the domain, converse domain and field of $S^{;}Q$ , are much used, especially *150·202 ·22 ·23. *150·201 is hardly ever used, but is inserted in order that the general case may not remain unconsidered.

*150·2. $\vdash .\text{D}ʻS^{;}Q=SʻʻQʻʻ\text{ᗡ}ʻS.\text{ᗡ}ʻS^{;}Q=Sʻʻ\breve{Q} ʻʻ\text{ᗡ}ʻS \quad[*37·32.*150·1]$

*150·201. $\vdash .CʻS^{;}Q=Sʻʻ(Q\unicode{x228d} \breve{Q} )ʻʻ\text{ᗡ}ʻS=\text{D}ʻS^{;}(Q\unicode{x228d} \breve{Q} )$

Dem. $\begin{array}{l} \vdash .*150·2.*37·22.\supset \vdash .CʻS^{;}Q&=Sʻʻ(Qʻʻ\text{ᗡ}ʻS\cup \breve{Q} ʻʻ\text{ᗡ}ʻS)\\ [*37·221] &=Sʻʻ(Q\unicode{x228d} \breve{Q} )ʻʻ\text{ᗡ}ʻS\\ [*150·2] &=\text{D}ʻS^{;}(Q\unicode{x228d} \breve{Q} ).\supset \vdash .\text{Prop} \end{array}$

*150·202. $\vdash .\text{D}ʻS^{;}Q\subset Sʻʻ\text{D}ʻQ.\text{ᗡ}ʻS^{;}Q\subset Sʻʻ\text{ᗡ}ʻQ.CʻS^{;}Q\subset SʻʻCʻQ$

Dem. $\begin{array}{l} \vdash .*37·15·16. &\supset \vdash .Qʻʻ\text{ᗡ}ʻS\subset \text{D}ʻQ.\breve{Q} ʻʻ\text{ᗡ}ʻS\subset \text{ᗡ}ʻQ.\\ [*37·2.*150·2] &\supset \vdash .\text{D}ʻS^{;}Q\subset Sʻʻ\text{D}ʻQ.\text{ᗡ}ʻS^{;}Q\subset Sʻʻ\text{ᗡ}ʻQ &\qquad \text{(1)}\\ [*37·22] &\supset \vdash .CʻS^{;}Q\subset SʻʻCʻQ &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash .\text{Prop} \end{array}$

*150·21. $\vdash :\text{ᗡ}ʻQ\subset \text{ᗡ}ʻS.\supset .\text{D}ʻS^{;}Q=Sʻʻ\text{D}ʻQ=\text{D}ʻ(S\mid Q) \quad[*150·2.*37·27·32]$

*150·211. $\begin{align}&\vdash :\text{D}ʻQ\subset \text{ᗡ}ʻS.\supset .\text{ᗡ}ʻS^{;}Q=Sʻʻ\text{ᗡ}ʻQ=\text{D}ʻ(S\mid \breve{Q} )\\ &[*150·2.*37·271·32]\end{align}$

*150·22. $\vdash :CʻQ\subset \text{ᗡ}ʻS.\supset .CʻS^{;}Q=SʻʻCʻQ \quad[*150·21·211.*37·22]$

In practice, when $S^{;}Q$ is used, we almost always have $CʻQ\subset\text{ᗡ}ʻS$ . For the use of $S^{;}Q$ is to obtain a relation analogous to $Q$ and having a different field; now $S^{;}Q$ is analogous to $Q\unicode{x0294f}\text{ᗡ}ʻS$ , for the part of $CʻQ$ which lies outside $\text{ᗡ}ʻS$ is unaffected by $S$ . Hence if we have, to start with, a relation $Q$ whose field is not contained in $\text{ᗡ}ʻS$ , we shall usually find it profitable to limit the field to $\text{ᗡ}ʻS$ , and consider the transformed relation rather as $S^{;}(Q\unicode{x0294f}\text{ᗡ}ʻS)$ than as $S^{;}Q$ . Thus the hypothesis $CʻQ\subset \text{ᗡ}ʻS$ will be verified in almost all useful applications of the notion of $S^{;}Q$ .

*150·23. $\vdash :CʻQ=\text{ᗡ}ʻS.\supset .CʻS^{;}Q=\text{D}ʻS \quad[*150·22.*37·25]$

*150·24. $\vdash \colon\ldotp CʻQ\subset \text{ᗡ}ʻS.\supset :_{\dot{\exists} }!S^{;}Q.\equiv ._{\dot{\exists} }!Q$

Dem. $\begin{array}{l} \vdash .*37·.*150·22.\supset \vdash \colon\ldotp \text{Hp} .&\supset :_{\exists }!CʻS^{;}Q.\equiv ._{\exists }!CʻQ:\\ [*33·24] &\supset :_{\dot{\exists} }!S^{;}Q.\equiv ._{\dot{\exists} }!Q\colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*150·25 $\vdash \colon\ldotp (y).\text{E}!Sʻy.\supset :_{\dot{\exists} }!S^{;}Q.\equiv ._{\dot{\exists} }!Q \quad[*150·24.*33·431]$

*150·3. $\vdash .S^{;}(Q\unicode{x228d} R)=S^{;}Q\unicode{x228d} S^{;}R \quad[*34·25·26.*150·1]$

*150·301. $\vdash .S^{;}(Q\dot{\cap} R)\,\unicode{x2abd}\, (S^{;}Q)\dot{\cap} (S^{;}R) \quad[*34·23·24.*150·1]$

*150·31. $\vdash :P\,\unicode{x2abd}\, Q.R\,\unicode{x2abd}\, S.\supset .R^{;}P\,\unicode{x2abd}\, S^{;}Q \quad[*34·34.*150·1]$

The following propositions are frequently useful when we have to deal with correlators of the form $S\upharpoonright CʻQ$ , which often happens.

*150·32. $\vdash .(S\upharpoonright CʻQ)^{;}Q=S^{;}Q \left[*43.5\frac{S,\,\breve{S},\,CʻQ,\,CʻQ}{Q,\,R,\,\alpha,\,\beta }.*150·141\right]$

*150·33. $\vdash :CʻQ\subset \beta .\supset .(S\upharpoonright \beta )^{;}Q=S^{;}Q \left[*43·5\frac{S,\,\breve{S}}{Q,\,R}.*150·141\right]$

*150·34. $\begin{align}&\vdash :\text{D}ʻQ\subset \alpha .\text{ᗡ}ʻQ\subset \beta .\supset .S\upharpoonright \alpha \mid Q\mid \beta \upharpoonleft \breve{S} =S^{;}\alpha \upharpoonleft Q\upharpoonright \beta =S^{;}Q\\ &[*43·5.*35·354.*150·141·1]\end{align}$

*150·35. $\vdash \colon\ldotp y\in CʻQ.\supset _{y}.Rʻy=Sʻy:\supset .R^{;}Q=S^{;}Q$

Dem. $\begin{array}{l} \vdash .*35·71.\supset \vdash : \text{Hp} .&\supset .R\upharpoonright CʻQ=S\upharpoonright CʻQ.\\ [*34·27·28.*150·1] &\supset .(R\upharpoonright CʻQ)^{;}Q=(S\upharpoonright CʻQ)^{;}Q.\\ [*150·32] &\supset .R^{;}Q=S^{;}Q:\supset \vdash . \text{Prop} \end{array}$

The above proposition, which is the analogue of *37·69, is much used in relation-arithmetic.

The following proposition is much used after we reach the theory of well-ordered series, but not before (except in *150·37).

*150·36. $\vdash .(S\upharpoonright \beta )^{;}Q=S^{;}(Q\unicode{x0294f}\beta )$

Dem. $\begin{array}{l} \vdash .*150·11.*35·101.\supset \\ \vdash :x{(S\upharpoonright \beta )^{;}Q}w.&\equiv .(\exists y,z).xSy.y\in \beta .yQz.z\in \beta .wSz.\\ [*36·13] &\equiv .(\exists y,z).xSy.y(Q\unicode{x0294f}\beta )z.wSz.\\ [*150·11] &\equiv .x{S^{;}(Q\unicode{x0294f}\beta )}w:\supset \vdash .\text{Prop} \end{array}$

*150·361. $\vdash .(\alpha \upharpoonleft S)^{;}Q=(S^{;}Q)\unicode{x0294f}\alpha \quad[\text{Proof as in *150·36}]$

*150·37. $\begin{align}\vdash :S\in \text{Cls}\rightarrow 1.\supset .S^{;}(Q\unicode{x0294f}\beta )&=(S^{;}Q)\unicode{x0294f}Sʻʻ\beta \\ &=(S\upharpoonright \beta )^{;}Q={(Sʻʻ\beta )\upharpoonleft S}^{;}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*74·141.\supset \vdash :\text{Hp}.\supset .(S\upharpoonright \beta )^;Q={(Sʻʻ\beta )\upharpoonleft S}^;Q &\qquad \text{(1)}\\ \vdash .(1).*150·36·361.\supset \vdash .\text{Prop} \end{array}$

*150·38. $\vdash :S\in 1\rightarrow 1.\supset .S^{;}\breve{S} ^{;}Q=Q\unicode{x0294f}\text{D}ʻS$

Dem. $\begin{array}{l} \vdash .*150·1. \supset \vdash .S^{;}\breve{S} ^{;}Q=S\mid \breve{S} \mid Q\mid S\mid \breve{S} &\qquad \text{(1)}\\ \vdash .(1).*72·59·591.\supset \vdash :\text{Hp}.\supset .S^{;}\breve{S} ^{;}Q=(\text{D}ʻS)\upharpoonleft Q\upharpoonright \text{D}ʻS\\ [*36·11] =Q\unicode{x0294f}\text{D}ʻS:\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in dealing with the correlation of series (*208·2).

*150·4. $\begin{align}&\vdash \colon\ldotp S\in 1\rightarrow \text{Cls}.\supset :x(S^{;}Q)y.\equiv .(\exists z,w).x=Sʻz.y=Sʻw.zQw\\ &[*150·11.*71·36]\end{align}$

This proposition is fundamental in the theory of $S^{;}Q$ , because in most of the uses of this notion $S$ is one-many. The proposition states that when $S$ is one-many, $S^{;}Q$ is the relation between the $Sʻs$ of terms related by $Q$ . Thus if $S$ is the relation of wife to husband, and $Q$ is the relation of brother to brother, $S^{;}Q$ is the relation between wives of brothers. If $Q$ is a relation between relations, $C^{;}P$ will be the corresponding relation of their fields; and so on.

*150·41. $\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1.\supset :x(S^{;}Q)y.\equiv .(\breve{S} ʻx)Q(\breve{S} ʻy) \quad[*150·11.*71·331]$

*150·5. $\vdash :\alpha (\overrightarrow{R}^{;}P)\beta .\equiv .(\exists x,y).\alpha =\overrightarrow{R}ʻx.\beta =\overrightarrow{R}ʻy.xPy$

*150·51. $\vdash :\alpha (\text{D}^{;}R)\beta .\equiv .(\exists P,Q).\alpha =\text{D}ʻP.\beta =\text{D}ʻQ.PRQ$

*150·511. $\vdash :\alpha (\text{ᗡ}^{;}R)\beta .\equiv .(\exists P,Q).\alpha =\text{ᗡ}ʻP.\beta =\text{ᗡ}ʻQ.PRQ$

*150·512. $\vdash :\alpha (C^{;}R)\beta .\equiv .(\exists P,Q).\alpha =CʻR.\beta =CʻQ.PRQ$

*150·52. $\begin{align}&\vdash :x(F^{;}R)y.\equiv .(\exists P,Q).x\in CʻP.y\in CʻQ.PRQ\\ &[*150·11.*33·51]\end{align}$

*150·535. $\vdash :CʻP\subset \alpha .\supset .(I\upharpoonright \alpha )^{;}P=P \quad[*150·53·33]$

*150·54. $\vdash :\alpha (\iota ^{;}R)\beta .\equiv .(\breve{\iota} ʻ\alpha )R(\breve{\iota} ʻ\beta )$

*150·55. $\vdash :Q(\downarrow z^{;}P)R.\equiv .(\exists u,v).Q=u\downarrow z.R=v\downarrow z.uPv$

*150·56. $\begin{align}&\vdash :M(S\dagger ^{;}Q)N.\equiv .(\exists X,Y).XQY.M=S^{;}X.N=S^{;}Y\\ &[*150·4·15·1]\end{align}$

*150·6. $\vdash .P\unicode{x2640}_{.,}y=\unicode{x2640}y^{;}P \quad[(*150·03)]$

*150·601. $\vdash .P\unicode{x2640}_{.,}\in 1\rightarrow \text{Cls} \quad[*150·6.*14·21.*71·166]$

*150·61. $\begin{align}&\vdash :z(P\unicode{x2640}_{.,}y)w.\equiv .(\exists u,v).z=u\unicode{x2640}y.w=v\unicode{x2640}y.uPv\\ &[*150·11.*38·101.*150·6]\end{align}$

*150·62. $\begin{align}&\vdash :R(P\unicode{x2640}_{.,}^{;}Q)S.\equiv .(\exists z,w).R=\unicode{x2640}z^{;}P.S=\unicode{x2640}w^{;}P.zQw\\ &[*150·4·601·6]\end{align}$

Relations of the form $P\unicode{x2640}_{.,}^{;}Q$ are frequently useful in relation-arithmetic, especially in the particular case of $P\downarrow_{.,} ^{;}Q$ , which takes the place taken by $\alpha \downarrow_{,,}ʻʻ\beta$ in cardinal arithmetic. Relations of the form $P\downarrow_{.,} ^{;}Q$ will be considered in *165.

The following propositions are chiefly concerned with correlations of couples. They are of great utility in relation-arithmetic. *150·71, in particular, is fundamental.

*150·7. $\vdash .S^{;}(z\downarrow w)=\overrightarrow{S}ʻz\uparrow \overrightarrow{S}ʻw \quad [*55·6]$

*150·71. $\vdash :S\in 1\rightarrow \text{Cls}.z,w\in \text{ᗡ}ʻS.\supset .S^{;}(z\downarrow w)=(Sʻz)\downarrow (Sʻw) \quad[*55·61]$

*150·72. $\vdash :z\neq w.S=x\downarrow z\unicode{x228d} y\downarrow w.\supset .S^{;}(z\downarrow w)=x\downarrow y \quad[*55·62·61]$

*150·73. $\vdash .S^{;}(\alpha \uparrow \beta )=Sʻʻ\alpha \uparrow Sʻʻ\beta \quad\left[*37·82 \frac{S,\,\breve{S}}{R,\,S}\right]$

*150·74. $\vdash .(S\unicode{x228d} T)^{;}Q=S^{;}Q\unicode{x228d} T^{;}Q\unicode{x228d} S\mid Q\mid \breve{T} \unicode{x228d} T\mid Q\mid \breve{S} \quad[*150·1]$

*150·75. $\vdash :{\sim}(yQy).\supset .(S\unicode{x228d} x\downarrow y)^{;}Q=S^{;}Q\unicode{x228d} Sʻʻ\overrightarrow{Q}ʻy\uparrow \iota ʻx\unicode{x228d} \iota ʻx\uparrow Sʻʻ\overleftarrow{Q}ʻy$

Dem. $\begin{array}{l} \vdash .*150·1. \supset \vdash :\text{Hp}.&\supset .(x\downarrow y)^{;}Q=\dot{\Lambda} .\\ [*150·74] \supset .(S\unicode{x228d} x\downarrow y)^{;}Q&=S^{;}Q\unicode{x228d} S\mid Q\mid y\downarrow x\unicode{x228d} x\downarrow y\mid Q\mid \breve{S}\\ [*55·57·571] &=S^{;}Q\unicode{x228d} Sʻʻ\overrightarrow{Q}ʻy\uparrow \iota ʻx\unicode{x228d} \iota ʻx\uparrow Sʻʻ\overleftarrow{Q}ʻy:\supset \vdash .\text{Prop} \end{array}$

The four following propositions belong to the subject of *92, but could not be given in that number owing to the fact that they involve the notations of *150. They are required for proving that, if $S$ is a correlator of $P$ and $Q$ , it is also a correlator of $P_{\text{po}}$ and $Q_{\text{po}}$ (*151·45), and for one of the fundamental propositions in the ordinal theory of progressions (*263·17).

*150·8. $\begin{align}\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1:\text{D}ʻQ\subset &\text{ᗡ}ʻS.\lor.\text{ᗡ}ʻQ\subset \text{ᗡ}ʻS:P\in \text{Pot}ʻQ:\supset .\\ &S^{;}P\in \text{Pot}ʻ(S^{;}Q).(S^{;}P)\mid (S^{;}Q)=S^{;}(P\mid Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*91·351. &\supset \vdash .S^{;}Q\in \text{Pot}ʻ(S^{;}Q) &\qquad \text{(1)}\\ \vdash .*150·1. &\supset \vdash .(S^{;}P)\mid (S^{;}Q)=S\mid P\mid \breve{S} \mid S\mid Q\mid \breve{S} &\qquad \text{(2)}\\ \vdash .(2).*71·191. &\supset \vdash :\text{Hp}.\supset .(S^{;}P)\mid (S^{;}Q)=S\mid P\mid I\upharpoonright \text{ᗡ}ʻS\mid Q\mid \breve{S} &\qquad \text{(3)}\\ \vdash .*50·63. &\supset \vdash :\text{D}ʻQ\subset \text{ᗡ}ʻS.\supset .I\upharpoonright \text{ᗡ}ʻS\mid Q=Q &\qquad \text{(4)}\\ \vdash .*50·62.*91·271. &\supset \vdash :P\in \text{Pot}ʻQ.\text{ᗡ}ʻQ\subset \text{ᗡ}ʻS.\supset .P\mid I\upharpoonright \text{ᗡ}ʻS=P &\qquad \text{(5)}\\ \vdash .(3).(4).(5). \supset \vdash :\text{Hp}.P\in \text{Pot}ʻQ.\supset .(S^{;}P)\mid (S^{;}Q)&=S\mid P\mid Q\mid \breve{S} \\ [*150·1] &=S^{;}(P\mid Q) &\qquad \text{(6)}\\ \vdash .*91·282. &\supset \vdash :S^{;}P\in \text{Pot}ʻS^{;}Q.\supset .(S^{;}P)\mid (S^{;}Q)\in \text{Pot}ʻS^{;}Q &\qquad \text{(7)}\\ \vdash .(6).(7). \supset \vdash \colon\ldotp \text{Hp}.P\in \text{Pot}ʻQ.\supset :&S^{;}P\in \text{Pot}ʻS^{;}Q.\supset .\\ &S^{;}(P\mid Q)\in \text{Pot}ʻS^{;}Q &\qquad \text{(5)}\\ \vdash .(1).(8).*91·373 \frac{S^{;}P\in \text{Pot}ʻS^{;}Q}{\phi P} .\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :P\in \text{Pot}ʻQ.&\supset _{P}.S^{;}P\in \text{Pot}ʻ(S^{;}Q) &\qquad \text{(9)}\\ \vdash .(6).(9).\supset \vdash .\text{Prop} \end{array}$

*150·81. $\begin{align}\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1:\text{D}ʻQ\subset \text{ᗡ}ʻS.\lor.\text{ᗡ}ʻQ\subset &\text{ᗡ}ʻS:T\in \text{Pot}ʻS^{;}Q:\supset .\\ &(\exists P).P\in \text{Pot}ʻQ.T=S^{;}P\end{align}$

Dem. $\begin{array}{l} \vdash .*91·351.&\supset \vdash .(\exists P).P\in \text{Pot}ʻQ.S^{;}Q=S^{;}P &\qquad \text{(1)}\\ \vdash .*150·8. &\supset \vdash :\text{Hp}.P\in \text{Pot}ʻQ.T=S^{;}P.\supset .T\mid (S^{;}Q)=S^{;}(P\mid Q).\\ [*91·282] &\supset .(\exists R).R\in \text{Pot}ʻQ.T\mid (S^{;}Q)=S^{;}R &\qquad \text{(2)}\\ \vdash .(2).*10·23.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :(\exists P).P\in \text{Pot}ʻQ.T=S^{;}P.\supset .\\ &(\exists R).R\in \text{Pot}ʻQ.T\mid (S^{;}Q)=S^{;}R &\qquad \text{(3)}\\ \vdash .(1).(3).*91·171 \frac{S^{;}Q,T,(\exists P).P\in \text{Pot}ʻQ.T=S^{;}P}{R,\,S,\,\phi T} .\supset \\ \vdash :\text{Hp}.T\in \text{Pot}ʻS^{;}Q.\supset .(\exists P).P\in \text{Pot}ʻQ.T=S^{;}P:\supset \vdash .\text{Prop} \end{array}$

*150·82. $\vdash \colon\ldotp S \in \text{Cls} \rightarrow 1 : \text{D}ʻQ \subset \text{ᗡ}ʻS . \lor . \text{ᗡ}ʻQ \subset \text{ᗡ}ʻS : \supset . \text{Pot}ʻS^{;}Q = S\dagger ʻʻ\text{Pot}ʻQ$

Dem. $\begin{array}{l} \vdash . *150·8·81 . \supset \\ \vdash : \text{Hp} . \supset . \text{Pot}ʻS^{;}Q &= \hat{T}\{(\exists P) . P \in \text{Pot}ʻQ . T = S^{;}P\}\\ [*150·1] &= S\dagger ʻʻ\text{Pot}ʻQ : \supset \vdash . \text{Prop} \end{array}$

*150·83. $\vdash \colon\ldotp S\in \text{Cls} \rightarrow 1 : \text{D}ʻQ \subset \text{ᗡ}ʻS . \lor . \text{ᗡ}ʻQ \subset \text{ᗡ}ʻS : \supset . (S^{;}Q)_{\text{po}} = S^{;}Q_{\text{po}}$

Dem. $\begin{array}{l} \vdash . *150·82 . (*91·05) . \supset \vdash : \text{Hp} . \dot{\supset} . (S^{;}Q)_{\text{po}} &= \dot{s} ʻS\dagger ʻʻ\text{Pot}ʻQ\\ [*150·16 . (*91·05)] &= S^{;}Q_{\text{po}} : \supset \vdash . \text{Prop} \end{array}$

The following propositions, down to *150·94 inclusive, resume the subject of the relation $S\dagger$ , which has already been treated in *150·14—·171.

Dem. $\begin{array}{l} \vdash . *150·56. \supset \vdash : M (I\dagger ^{;}Q) N . &\equiv . (\exists X, Y) . XQY . M = I^{;}X . N = I^{;}Y .\\ [*150·53] &\equiv . (\exists X, Y) . XQY. M = X . N = Y .\\ [*13·22] &\equiv . MQY : \supset \vdash . \text{Prop} \end{array}$

The following propositions lead up to *150·931 ·94, which are used in the theory of double ordinal similarity (*164·3 ·21).

*150·91. $\vdash : sʻCʻʻCʻQ \subset \alpha .\supset . (I \upharpoonright \alpha )\dagger ^{;}Q = Q$

Dem. $\begin{array}{l} \vdash . *150·535 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : X \in CʻQ . \supset . (I \upharpoonright \alpha )^{;}X = X &\qquad \text{(1)}\\ \vdash . (1) . *150·56 . &\supset \vdash \colon\ldotp \text{Hp} . \supset :\\ M \{(I \upharpoonright \alpha )\dagger ^{;}Q\} N . &\equiv . (\exists X,Y) . XQY . M = X . N = Y .\\ [*13·22] &\equiv . MQN \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*150·92. $\vdash : S \in \text{Cls} \rightarrow 1 . sʻCʻʻCʻQ \subset \text{ᗡ}ʻS. \supset . \breve{S} \dagger ^{;}S\dagger ^{;}Q = Q$

Dem. $\begin{array}{l} \vdash . *150·13·14. \supset \vdash . \breve{S} \dagger ^{;}S\dagger ^{;}Q = (\breve{S} \mid S)\dagger ^{;}Q &&\qquad \text{(1)}\\ \vdash . (1) . *71·191 . \supset \vdash : \text{Hp} . \supset . \breve{S} \dagger ^{;}S\dagger ^{;}Q &= (I \upharpoonright \text{ᗡ}ʻS)\dagger ^{;}Q\\ [*150·91] &= Q : \supset \vdash . \text{Prop} \end{array}$

*150·921. $\vdash : S \in 1 \rightarrow \text{Cls} . sʻCʻʻCʻP \subset \text{D}ʻS . \supset . S\dagger ^{;} \breve{S} \dagger ^{;}P = P$

*150·93. $\begin{align}]\vdash \colon\ldotp S \in 1 \rightarrow 1 . sʻCʻʻCʻP \subset &\text{D}ʻS . sʻCʻʻCʻQ \subset \text{ᗡ}ʻS . \supset :\\ &P = S\dagger ^{;}Q . \equiv . Q = \breve{S} \dagger ^{;}P \quad[*150·92·921]\end{align}$

*150·931. $\vdash : sʻCʻʻCʻQ \subset \text{ᗡ}ʻS . \supset . CʻʻCʻS\dagger ^{;}Q = S_{\in}ʻʻCʻʻCʻQ$

Dem. $\begin{array}{l} \vdash . *150·22 . &\supset \vdash . CʻS\dagger ^{;}Q = S\dagger ʻʻCʻQ &\qquad \text{(1)}\\ \vdash . *150·22·1 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : M \in CʻQ . \supset . CʻS\dagger ʻM = SʻʻCʻM :\\ [*37·68·11] &\supset : CʻʻS\dagger ʻʻCʻQ = S_{\in}ʻʻCʻʻCʻQ &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*150·932. $\begin{align}&\vdash :sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.\supset .sʻCʻʻCʻS{\dagger}^{;}Q = SʻʻsʻCʻʻCʻQ\\ &[*150·931.*37·11.*40·38]\end{align}$

*150·933. $\vdash :sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.\supset .sʻCʻʻCʻ{\dagger}^{;}Q\subset \text{D}ʻS \quad[*150·932.*37·15]$

*150·94. $\begin{align}\vdash \colon\ldotp S\in 1\rightarrow 1.&\supset :sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.P = S{\dagger}^{;}Q. \equiv .\\ &sʻCʻʻCʻP\subset \text{D}ʻS.Q = \breve{S} \dagger ^{;}P\end{align}$

Dem. $\begin{array}{l} \vdash .*150·933. \supset \vdash :sʻCʻʻCʻQ&\subset \text{ᗡ}ʻS.P = S{\dagger}^{;}Q. \equiv .\\ &sʻCʻʻCʻP\subset \text{D}ʻS.sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.P = S{\dagger}^{;}Q &\qquad \text{(1)}\\ \vdash .*150·933 \frac{\breve{S}}{S}.\supset \vdash :sʻCʻʻCʻP&\subset \text{D}ʻS.Q = \breve{S} {\dagger}^{;}P. \equiv .\\ &sʻCʻʻCʻP\subset \text{D}ʻS.sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.Q = \breve{S} {\dagger}^{;}P &\qquad \text{(2)}\\ \vdash .*150·93.*5·32.\supset \\ \vdash \colon\ldotp S\in 1\rightarrow 1.&\supset :sʻCʻʻCʻP\subset \text{D}ʻS.sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.P = S{\dagger}^{;}Q. \equiv .\\ &sʻCʻʻCʻP\subset \text{D}ʻS.sʻCʻʻCʻQ\subset \text{ᗡ}ʻS.Q = \breve{S} {\dagger}^{;}P &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

The above proposition is the analogue of *74·61, which (with a few trivial transformations) may be written $\vdash \colon\ldotp S\in 1\rightarrow 1.\supset :sʻ\lambda \subset \text{ᗡ}ʻS.\kappa = S_{\in}ʻʻ\lambda . \equiv .sʻ\kappa \subset \text{D}ʻS.\lambda = (\breve{S} )_{\in}ʻʻ\kappa .$

In obtaining ordinal analogues of such propositions, $S_{\in }$ will be replaced by $S\dagger$ , and the two inverted commas will be replaced by the semi-colon; a class of classes $\kappa$ will be replaced, in most of its occurrences, by a relation of relations $P$ , but will sometimes be replaced by $CʻʻCʻP$ .

The above proposition (*150·94) is used in proving that the converse of a double correlator of $P$ and $Q$ is a double correlator of $Q$ and $P$ (*164·21). The corresponding cardinal proposition (*111·131) uses *74·6, which is practically the same proposition as *74·61, which is the analogue of *150·94.

*150·95. $\vdash :CʻR\subset \text{Cl}ʻ\alpha .\supset .(S\upharpoonright \alpha )_{\in }^{;}R = S^{;}R$

Dem. $\begin{array}{l} \vdash .*37·421.\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \in CʻR.\supset .(S\upharpoonright \alpha )ʻʻ\beta = Sʻʻ\beta .\\ [*37·11] \supset .(S\upharpoonright \alpha )_{\in }ʻ\beta = S_{\in }ʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*150·35.\supset \vdash .\text{Prop} \end{array}$

*150·96. $\vdash :\text{ᗡ}ʻ\dot{s} ʻ\lambda \subset \text{ᗡ}ʻS.\supset .\text{D}^{;}(T\parallel \breve{S} \upharpoonright \lambda =T_{\in }\upharpoonright \text{D}ʻʻ\lambda$

Dem. $\begin{array}{l} \vdash .*150·51.&\supset \vdash :\alpha {\text{D}^{;}(T\parallel \breve{S} )\upharpoonright \lambda }\beta .\equiv .\\ &(\exists M,N).N\in \lambda .M=T\mid N\mid \breve{S} .\alpha =\text{D}ʻM.\beta =\text{D}ʻN &\qquad \text{(1)}\\ \vdash .*41·13.\supset \vdash \colon\ldotp \text{Hp}.&\supset :N\in \lambda .\supset .\text{ᗡ}ʻN\subset \text{ᗡ}ʻS.\\ [*37·321] &\supset .\text{D}ʻ(N\mid \breve{S} )=\text{D}ʻN.\\ [*37.32] &\supset .\text{D}ʻ(T\mid N\mid \breve{S} )=Tʻʻ\text{D}ʻN &\qquad \text{(2)}\\ \vdash .(1).(2).*37·6.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset .\alpha \{\text{D}^{;}(T\parallel \breve{S} )\upharpoonright \lambda\}\beta .&\equiv .\beta \in \text{D}ʻʻ\lambda .\alpha =Tʻʻ\beta .\\ [*37·101] &\equiv .\alpha (T_{\in }\upharpoonright \text{D}ʻʻ\lambda )\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*150·961. $\vdash .\dot{s} ^{;}(U\parallel \breve{W} )_{\in }\upharpoonright \lambda =(U\parallel \breve{W} )\upharpoonright \dot{s}ʻʻ\lambda$

Dem. $\begin{array}{l} \vdash .*150·4.\supset \vdash :R{\dot{s} ^{;}(U\parallel \breve{W} _{\in }\upharpoonright \lambda }S.&\equiv .(\exists \beta ).\beta \in \lambda .S=\dot{s} ʻ\beta .R=\dot{s} ʻ(U\parallel \breve{W} ʻʻ\beta .\\ [*43·43] &\equiv .(\exists \beta ).\beta \in \lambda .S=\dot{s} ʻ\beta .R=(U\parallel \breve{W} )ʻ\dot{s} ʻ\beta .\\ [*13·193.*37·6] &=.S\in \dot{s}ʻʻ\lambda .R=(U\parallel \breve{W} )ʻS:\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in the theory of ordinal exponentiation (*176·21).

FOOTNOTES:

[11] E.g. in *116·53 and following propositions, where the notation $S\dagger$ was introduced by a temporary definition.

In this number, we give the definition of ordinal similarity, and various equivalent forms; we prove that ordinal similarity is reflexive (*151·13), symmetrical (*151·14) and transitive (*151·15), and we give some particular cases of ordinal similarity (*151·6 ff.). Propositions in this number should be compared with those in *73, to which they are analogous.

The class of ordinal correlators of $P$ and $Q$ is written $P\,\overline{\text{smor}}\,Q$ , where " $\text{smor}$ " stands for "similar ordinally." We put $P\,\overline{\text{smor}}\,Q=\hat{S}\{S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q\} \quad\text{Df}.$

(We might equally well put $P\,\overline{\text{smor}}\,Q=(1\rightarrow 1)\cap \overleftarrow{\text{ᗡ}}ʻCʻQ\cap \dagger \overleftarrow{Q}ʻP \quad\text{Df},$ which is an equivalent but more condensed form of the definition.) We then define " $P$ is ordinally similar to $Q$ " as meaning that there is at least one ordinal correlator of $P$ and $Q$ , i.e. $\text{smor}=\hat{P} \hat{Q} (\exists !P\,\overline{\text{smor}}\,Q) \quad\text{Df}.$

We shall find that if $P$ and $Q$ generate well-ordered series, they have at most one correlator (*250·6), but this does not hold in general for other series.

After giving the elementary properties of ordinal similarity, we have three important propositions on its connection with cardinal similarity, namely: (*151·18) if $P$ is similar to $Q$ , the field of $P$ is similar to the field of $Q$ (the converse does not hold in general, but holds if $P$ and $Q$ are finite serial relations); (*151·19) if $CʻP$ is similar to $CʻQ$ , there is a relation $R$ similar to $Q$ and having $CʻP$ for its field, and vice versa; (*151·191) $S$ is an ordinal correlator of $P$ and $Q$ when, and only when, it is a cardinal correlator of $CʻP$ and $CʻQ$ and $P=S^{;}Q$ .

We then have a set of propositions on correlators of the form $S\upharpoonright CʻQ$ (*151·2—·243). Most of the correlators with which we shall be concerned are of this form. The most useful proposition here is

*151·22. $\vdash :S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\equiv .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

*151·231. $\vdash \colon\ldotp (y).\text{E}!Sʻy:S\upharpoonright CʻQ\in 1\rightarrow 1.P=S^{;}Q:\supset .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

This consequence is useful because the hypothesis $(y).\text{E}!Sʻy$ is satisfied by most of the relations which occur as correlators.

We have next a number of propositions on the inferribility of $Q=\breve{S} ^{;}P$ or $Q\,\unicode{x2abd}\, \breve{S} ^{;}P$ from $P=S^{;}Q$ or $P\,\unicode{x2abd}\, S^{;}Q$ , and connected matters (*151·25—·29).

*151·25. $\vdash :S\in \text{Cls}\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\supset .Q=\breve{S} ^{;}P$

*151·26. $\begin{align}\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.\supset :&P\,\unicode{x2abd}\, S^{;}Q.\supset .\breve{S} ^{;}P\,\unicode{x2abd}\, Q:\\ &S^{;}Q\,\unicode{x2abd}\, P.\supset .Q\,\unicode{x2abd}\, \breve{S} ^{;}P\end{align}$

*151·29. $\begin{align}\vdash \colon\ldotp P\,\text{smor}\,Q.\equiv :(\exists S):&xPy.\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):\\ &zQw.\supset _{z,w}.(Sʻz)P(Sʻw)\end{align}$

*151·29 is never used, but is inserted in order to show that our definition of "ordinal similarity" agrees with what is commonly understood by that term. If $P$ and $Q$ are regarded as serial, so that " $xPy$ " means " $x$ precedes $y$ in the $P$ -series," and " $zQw$ " means " $z$ precedes $w$ in the $Q$ -series," then our proposition states that two series are ordinally similar when their terms can be so correlated that predecessors in either are correlated with predecessors in the other, and successors with successors, i.e. when the two series can be correlated without change of order.

We have next (*151·31—·52) a set of miscellaneous propositions, of which the most useful are

*151·401. $\begin{align}\vdash :T\upharpoonright CʻP\in X,\overline{\text{smor}}\,P.T\upharpoonright CʻQ\in Y\overline{\text{smor}} Q.S\in &P\,\overline{\text{smor}}\,Q.\supset .\\ &T^{;}S\in X\,\overline{\text{smor}} \,Y\end{align}$

*151·5. $\begin{align}\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .\text{D}ʻP=Sʻʻ\text{D}ʻQ.\text{ᗡ}ʻP=Sʻʻ\text{ᗡ}ʻQ.&\overrightarrow{B}ʻP=Sʻʻ\overrightarrow{B}ʻQ.\\ &\overrightarrow{B}ʻ\breve{P} =Sʻʻ\overrightarrow{B}ʻ\breve{Q}\end{align}$

*151·401 will be useful in such cases as the following: Let $P$ and $Q$ be relations between relations, then $\text{D}^{;}P$ and $\text{D}^{;}Q$ will be the corresponding relations of their domains. Suppose $\text{D}\upharpoonright CʻP$ , $\text{D}\upharpoonright CʻQ\in 1\rightarrow 1$ . Then, by *151·401, if $S$ is a correlator of $P$ and $Q$ , $\text{D}^{;}S$ is a correlator of $\text{D}^{;}P$ and $\text{D}^{;}Q$ .

*151·5 shows that if $S$ is a correlator of $P$ and $Q$ , it correlates $\text{D}ʻP$ with $\text{D}ʻQ$ , $\text{ᗡ}ʻP$ with $\text{ᗡ}ʻQ$ , $\overrightarrow{B}ʻP$ with $\overrightarrow{B}ʻQ$ , and $\overrightarrow{B}ʻ\breve{P}$ with $\overrightarrow{B}ʻ\breve{Q}$ .

Our next set of propositions (*151·53—·59) is concerned with the correlation of powers of $P$ and $Q$ and kindred matters. We show (*151·55) that a[Pg 321] correlator of $P$ and $Q$ is also a correlator of $P_{\text{po}}$ and $Q_{\text{po}}$ , and therefore if $P$ and $Q$ are similar, so are $P_{\text{po}}$ and $Q_{\text{po}}$ (*151·56); we show also (*151·59) that if $P$ and $Q$ are similar, so are $P_{\nu }$ and $Q_{\nu }$ . These propositions are used in the theory of progressions (*263·17).

The remaining propositions (*151·6 to the end) are concerned with applications to particular cases. The most useful of these are

which shows how to raise the type of a relation without changing its relation-number;

*151·64. $\vdash .x\downarrow ^{;}P\,\text{smor}\,P.(x\downarrow )\upharpoonright CʻP\in (x\downarrow ^{;}P)\,\overline{\text{smor}}\,P$

*151·65. $\vdash .\downarrow x^{;}P\,\text{smor}\,P.(\downarrow x)\upharpoonright CʻP\in (\downarrow x^{;}P)\,\overline{\text{smor}}\,P$

We prove also that all members of $2_{r}$ (i.e. all relations of the form $x\downarrow y$ , where $x\neq y$ ) are similar *151·63), and that all relations of the form $x\downarrow x$ are similar (*151·631).

*151·01. $P\,\overline{\text{smor}}\,Q=\hat{S}\{S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q\} \quad\text{Df}$

*151·02. $\text{smor}=\hat{P} \hat{Q}\{\exists !P\,\overline{\text{smor}}\,Q\} \quad\text{Df}$

*151·1. $\vdash :P\,\text{smor}\,Q.\equiv .(\exists S).S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q \quad[(*151·02)]$

*151·11. $\vdash :S\in P\,\overline{\text{smor}}\,Q.\equiv .S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q \quad[(*151·01)]$

*151·12. $\vdash :P\,\text{smor}\,Q.\equiv .\exists !P\,\overline{\text{smor}}\,Q \quad[(*151·02)]$

*151·121. $\vdash .I\upharpoonright CʻQ\in (Q\overline{\text{smor}} Q)\quad[*72·17.*50·5·52.*150·534.*151·11]$

*151·131. $\vdash :S\in P\,\overline{\text{smor}}\,Q.=.\breve{S} \in Q\,\overline{\text{smor}}\,P$

Dem. $\begin{array}{l} \vdash .*71·212.&\supset \vdash :S\in 1\rightarrow 1.\equiv .\breve{S} \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*150·13.&\supset \vdash :P=S^{;}Q.\supset .\breve{S} ^{;}P=(\breve{S} \mid S)^{;}Q:\\ [*71·192] &\supset \vdash :S\in 1\rightarrow 1.P=S^{;}Q.\supset .\breve{S} ^{;}P=(I\upharpoonright \text{ᗡ}ʻS)^{;}Q:\\ [*150·534] &\supset \vdash :S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q.\supset .\breve{S} ^{;}P=Q &\qquad \text{(2)}\\ \vdash .*150·23.&\supset \vdash :CʻQ=\text{ᗡ}ʻS.P=S^{;}Q.\supset .CʻP=\text{D}ʻS &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*33·21.\supset \\ \vdash :S\in 1\rightarrow 1.&CʻQ =\text{ᗡ}ʻS.P=S^{;}Q.\supset .\breve{S} \in 1\rightarrow 1.CʻP=\text{ᗡ}ʻ\breve{S} .Q=\breve{S} ^{;}P &\qquad \text{(4)}\\ \vdash .(4) \frac{\breve{S},\,Q,\,P}{S,\,P,\,Q}.*31·33.\supset \\ \vdash :\breve{S} \in 1\rightarrow 1.&CʻP=\text{ᗡ}ʻS.Q=\breve{S} ^{;}P.\supset .S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q &\qquad \text{(5)}\\ \vdash .(4).(5).*151·11.\supset \vdash .\text{Prop} \end{array}$

*151·14. $\vdash :P\,\text{smor}\,Q.\equiv .Q\,\text{smor}\,P \quad[*151·131·12.*31·52]$

*151·141. $\vdash :S\in P\,\overline{\text{smor}}\,Q.T\in Q\,\overline{\text{smor}}\,R.\supset .S\mid T\in P\,\overline{\text{smor}}\,R$

Dem. $\begin{array}{l} \vdash .*151·11.*71·252. \supset \vdash :\text{Hp}.&\supset .S\mid T\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*151·11.*150·23. \supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻS=CʻQ.\text{D}ʻT=CʻQ.\text{ᗡ}ʻT=CʻR.\\ [*37·323] &\supset .\text{ᗡ}ʻ(S\mid T)=\text{ᗡ}ʻT.\text{ᗡ}ʻT=CʻR.\\ [*13·17] &\supset .\text{ᗡ}ʻ(S\mid T)=CʻR &\qquad \text{(2)}\\ \vdash .*151·11. \supset \vdash :\text{Hp}.\supset .P&=S^{;}T^{;}R\\ [*150·13] &=(S\mid T)^{;}R\\ \vdash .(1).(2).(3).*151·11.\supset \vdash .\text{Prop} \end{array}$

*151·15. $\vdash :P\,\text{smor}\,Q.Q\,\text{smor}\,R.\supset .P\,\text{smor}\,R \quad[*151·141]$

*151·17. $\vdash \colon\ldotp P\,\text{smor}\,Q.\supset :R\,\text{smor}\,P.\equiv .R\,\text{smor}\,Q \quad[*151·14·15]$

Dem. $\begin{array}{l} \vdash .*151·11.*150·23.\supset \vdash :\text{Hp}.&\supset .(\exists S).S\in 1\rightarrow 1.\text{D}ʻS=CʻP.\text{ᗡ}ʻS=CʻQ.\\ [*73·1] &\supset .CʻP\text{ sm }CʻQ:\supset \vdash .\text{Prop} \end{array}$

*151·19. $\vdash :CʻP\text{ sm }CʻQ.\equiv .(\exists R).CʻR=CʻP.R\,\text{smor}\,Q$

Dem. $\begin{array}{l} \vdash .*73·1.\supset \vdash :CʻP\text{ sm }CʻQ.&\equiv .(\exists S).S\in 1\rightarrow 1.\text{D}ʻS=CʻP.\text{ᗡ}ʻS=CʻQ.\\ [*150·23] &\equiv .(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻQ.CʻS^{;}Q=CʻP.\\ [*13·195] &\equiv .(\exists R,S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻQ.R=S^{;}Q.CʻR=CʻP.\\ [*151·1] &\equiv .(\exists R).CʻR=CʻP.R\,\text{smor}\,Q:\supset \vdash .\text{Prop} \end{array}$

*151·191. $\vdash :S\in P\,\overline{\text{smor}}\,Q.\equiv .S\in (CʻP)\,\overline{\text{ sm }}\, (CʻQ).P=S^{;}Q$

Dem. $\begin{array}{l} \vdash .*151·131·11.\supset \vdash :S\in P\,\overline{\text{smor}}\,Q.&\supset .CʻP=\text{D}ʻS:\\ [*4·71.*151·11]\supset \vdash :S\in P\,\overline{\text{smor}}\,Q.&\equiv .S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.P=S^{;}Q.CʻP=\text{D}ʻS.\\ [*73·03] &\equiv .S\in (CʻP)\,\overline{\text{ sm }}\, (CʻQ).P=S^{;}Q:\supset \vdash .\text{Prop} \end{array}$

*151·2. $\vdash :S\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\supset .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

Dem. $\begin{array}{l} \vdash .*71·29. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright CʻQ\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*35·65. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻS\upharpoonright CʻQ=CʻQ &\qquad \text{(2)}\\ \vdash .*150·32.&\supset \vdash :\text{Hp}.\supset .P=S\upharpoonright CʻQ^{;}Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·11.\supset \vdash .\text{Prop} \end{array}$

*151·21. $\vdash :P\,\text{smor}\,Q.\equiv .(\exists S).S\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q \quad[*151·2]$

*151·22. $\vdash :S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\equiv .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

Dem. $\begin{array}{l} \vdash .*35·65.*150·32. &\supset \vdash :S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\supset .\\ &S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q &\qquad \text{(1)}\\ \vdash .*151·11.*150·32.&\supset \vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .S\upharpoonright CʻQ\in 1\rightarrow l.P=S^{;}Q &\qquad \text{(2)}\\ \vdash .*151·11. \supset \vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .CʻQ&=\text{ᗡ}ʻ(S\upharpoonright CʻQ)\\ [*35·64] &=CʻQ\cap \text{ᗡ}ʻS.\\ [*22·621] &\supset .CʻQ\supset \text{ᗡ}ʻS &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*151·23. $\vdash :P\,\text{smor}\,Q.\equiv .(\exists S).S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q \quad[*151·22]$

The above proposition (*151·23) is very useful. It is the analogue of *73·15. (It should be observed that, in all propositions concerning likeness, $S^{;}Q$ plays the same part as $Sʻʻ\beta$ plays in propositions concerning similarity.) By means of *151·23, we can establish likeness in all those numerous cases in which a relation which is not usually one-one becomes one-one when confined to a certain converse domain, as for example if we have to deal with $\text{D}\upharpoonright {\in}_{\Delta}ʻ\kappa$ , where $\kappa \in \text{Cls}^{2} \text{excl}$ , or with $\text{D}\upharpoonright P_{\Delta }ʻ\kappa$ , where $P\upharpoonright \kappa \in \text{Cls}\rightarrow 1$ . Thus e.g. by the above proposition, if $Q$ is any relation whose field is $P_{\Delta }ʻ\kappa$ , where $P\upharpoonright \kappa \in\text{Cls}\rightarrow 1$ , $\text{D}^{;}Q$ will be an ordinally similar relation whose field is $\text{D}ʻʻP_{\Delta }ʻ\kappa$ .

*151·231. $\begin{align}&\vdash \colon\ldotp (y).\text{E}!Sʻy:S\upharpoonright CʻQ\in 1\rightarrow 1.P=S^{;}Q:\supset .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q\\ &[*151·22.*33·431]\end{align}$

*151·232. $\begin{align}&\vdash \colon\ldotp (\exists S):(y).\text{E}!Sʻy:S\upharpoonright CʻQ\in 1\rightarrow 1.P=S^{;}Q:\supset .P\,\text{smor}\,Q\\ &[*151·231·12]\end{align}$

*151·24. $\begin{align}\vdash \colon\ldotp &(y).\text{E}!Sʻy:y,z\in CʻQ.Sʻy=Sʻz.\supset _{y,z}.y=z:P=S^{;}Q:\supset .\\ &S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.P\,\text{smor}\,Q \quad[*71·166·55.*33·431.*151·22·23]\end{align}$

*151·241. $\begin{align}\vdash \colon\ldotp S\in 1\rightarrow \text{Cls}.&CʻQ\subset \text{ᗡ}ʻS:y,z\in CʻQ.Sʻy=Sʻz.\supset _{y,z}.y=z:P=S^{;}Q:\supset .\\ &S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.P\,\text{smor}\,Q \quad[*71·55.*151·22·23]\end{align}$

*151·242. $\begin{align}&\vdash \colon\colon y,z\in CʻQ.\supset _{y,z}:Sʻy=Sʻz.\equiv .y=z\colon\ldotp P=S^{;}Q\colon\ldotp \equiv .S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q\\ &[*71·59.*151·22]\end{align}$

*151·243. $\begin{align}&\vdash \colon\colon y,z\in CʻQ.\supset _{y,z}:Sʻy=Sʻz.\equiv .y=z\colon\ldotp P=S^{;}Q\colon\ldotp \supset .P\,\text{smor}\,Q\\ &[*151·242·12]\end{align}$

*151·25. $\vdash :S\in \text{Cls}\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\supset .Q=\breve{S} ^{;}P$

Dem. $\begin{array}{l} \vdash .*150·13.\supset \vdash :\text{Hp}.\supset .\breve{S} ^{;}P&=(\breve{S} \mid S)^{;}Q\\ [*71·191] & =(I\upharpoonright \text{ᗡ}ʻS)^{;}Q\\ [*150·535] & =Q:\supset \vdash .\text{Prop} \end{array}$

*151·251. $\begin{align}&\vdash \colon\ldotp S\in 1\rightarrow 1.\supset :CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\equiv .CʻP\subset \text{D}ʻS.Q=\breve{S} ^{;}P\\ &[*151·25.*150·22.*37·15]\end{align}$

*151·252. $\vdash :S\in \text{Cls}\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.\supset .Q=\breve{S} ^{;}S^{;}Q \quad[*151·25]$

*151·253. $\vdash :S\in 1\rightarrow \text{Cls}.CʻP\subset \text{D}ʻS.\supset .P=S^{;}\breve{S} ^{;}P \quad\left[*151·252\frac{\breve{S}}{S}\right]$

*151·254. $\vdash :S\in 1\rightarrow 1.\supset .S\dagger \upharpoonright \breve{C} ʻʻ\text{Cl}ʻ\text{ᗡ}ʻS=\text{Cnv}ʻ{\breve{S} \dagger \upharpoonright \breve{C} ʻʻ\text{Cl}ʻ\text{D}ʻS}$

Dem. $\begin{array}{l} \vdash .*151·251. \supset \vdash \colon\ldotp \text{Hp}.\supset :&CʻQ\in \text{Cl}ʻ\text{ᗡ}ʻS.P(S\dagger )Q.\equiv .\\ &CʻP\in \text{Cl}ʻ\text{D}ʻS.Q(\breve{S} \dagger )P\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

This proposition is the analogue of *72·54. " $\breve{S} \dagger$ " means " $(\text{Cnv}ʻS)\dagger$ ," not " $\text{Cnv}ʻ(S\dagger)$ ."

*151·26. $\begin{align}\vdash \colon\ldotp S\in \text{Cls}\rightarrow 1.CʻQ\subset &\text{ᗡ}ʻS.\supset :\\ &P\,\unicode{x2abd}\, S^{;}Q.\supset .\breve{S} ^{;}P\,\unicode{x2abd}\, Q:S^{;}Q\,\unicode{x2abd}\, P.\supset .Q\,\unicode{x2abd}\, \breve{S} ^{;}P\end{align}$

Dem. $\begin{array}{l} \vdash .*150·31. &\supset \vdash :P\,\unicode{x2abd}\, S^{;}Q.\supset .\breve{S} ^{;}P\,\unicode{x2abd}\, \breve{S} ^{;}S^{;}Q:\\ [*151·252] &\supset \vdash \colon\ldotp \text{Hp}.\supset :P\,\unicode{x2abd}\, S^{;}Q.\supset .\breve{S} ^{;}P\,\unicode{x2abd}\, Q &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \text{Hp}.\supset :S^{;}Q\,\unicode{x2abd}\, P.\supset .Q\,\unicode{x2abd}\, \breve{S} ^{;}P &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash .\text{Prop} \end{array}$

*151·261. $\begin{align}&\vdash \colon\ldotp S\in 1\rightarrow \text{Cls}.CʻP\subset \text{D}ʻS.\supset :\\ &Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\supset .S^{;}Q\,\unicode{x2abd}\, P:\breve{S} ^{;}P\,\unicode{x2abd}\, Q.\supset .P\,\unicode{x2abd}\, S^{;}Q \quad\left[*151·26\frac{\breve{S},\,Q,\,P}{S,\,P,\,Q}\right]\end{align}$

*151·262. $\begin{align}&\vdash \colon\ldotp S\in 1\rightarrow 1.CʻP\subset \text{D}ʻS.CʻQ\subset \text{ᗡ}ʻS.\supset :\\ &P\,\unicode{x2abd}\, S^{;}Q.\equiv .\breve{S} ^{;}P\,\unicode{x2abd}\, Q:Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\equiv .S^{;}Q\,\unicode{x2abd}\, P \\ &[*151·26·261]\end{align}$

*151·263. $\begin{align}&\vdash \colon\ldotp S\in 1\rightarrow 1.CʻP\subset \text{D}ʻS.CʻQ\subset \text{ᗡ}ʻS.\supset :\\ &P\,\unicode{x2abd}\, S^{;}Q.Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\equiv .\breve{S} ^{;}P\,\unicode{x2abd}\, Q.S^{;}Q\,\unicode{x2abd}\, P.\equiv .P=S^{;}Q.\equiv .Q=\breve{S} ^{;}P\\ &[*151·262]\end{align}$

*151·264. $\vdash \colon\ldotp S\upharpoonright CʻQ\in 1\rightarrow 1.\supset :P\,\unicode{x2abd}\, S^{;}Q.Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\equiv .P=S^{;}Q$

Dem. $\begin{array}{l} \vdash *150·202.*37·401. &\supset \vdash :P\,\unicode{x2abd}\, S^{;}Q.\supset .CʻP\subset \text{D}ʻS\upharpoonright CʻQ &\qquad \text{(1)}\\ \vdash .(1).*151·262\frac{S\upharpoonright CʻQ)}{Q}.&\supset \vdash :\text{Hp}.P\,\unicode{x2abd}\, S^{;}Q.\supset :\\ &Q\,\unicode{x2abd}\, (CʻQ\upharpoonleft \breve{S} )^{;}P.\equiv .(S\upharpoonright CʻQ)^{;}Q\,\unicode{x2abd}\, P:\\ [*150·361·32] &\supset :Q\,\unicode{x2abd}\, (\breve{S} ^{;}P)\unicode{x0294f}CʻQ.\equiv .S^{;}Q\,\unicode{x2abd}\, P:\\ [*35·9.*36·29] &\supset :Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\equiv .S^{;}Q\,\unicode{x2abd}\, P &\qquad \text{(2)}\\ \vdash .(2).*5·32.&\supset \vdash .\text{Prop} \end{array}$

*151·27. $\begin{align}&\vdash :S\in 1\rightarrow 1.P\,\unicode{x2abd}\, S^{;}Q.Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\\ &\equiv .S\in 1\rightarrow 1.CʻP\subset \text{D}ʻS.CʻQ\subset \text{ᗡ}ʻS.\breve{S} ^{;}P\,\unicode{x2abd}\, Q.S^{;}Q\,\unicode{x2abd}\, P.\\ &\equiv .S\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q.\\ &\equiv .S\in 1\rightarrow 1.CʻP\subset \text{D}ʻS.Q=\breve{S} ^{;}P\\ &[*151·263.*5·32.*150·203.*4·73]\end{align}$

*151·271. $\begin{align}&\vdash :(\exists S).S\in 1\rightarrow 1.P\,\unicode{x2abd}\, S^{;}Q.Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\\ &\equiv .(\exists S).S\in 1\rightarrow 1.CʻP\subset \text{D}ʻS.CʻQ\subset \text{ᗡ}ʻS.\breve{S} ^{;}P\,\unicode{x2abd}\, Q.S^{;}Q\,\unicode{x2abd}\, P.\\ &\equiv .P\,\text{smor}\,Q \quad[*151·27·21]\end{align}$

*151·28. $\begin{align}\vdash \colon\ldotp P\,\text{smor}\,Q.\equiv :(\exists S):S\in 1\rightarrow 1:&xPy.\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):\\ &zQw.\supset _{z,w}.(Sʻz)P(Sʻw)\end{align}$

Dem. $\begin{array}{l} \vdash .*150·41. &\supset \vdash \colon\colon S\in 1\rightarrow 1.\supset \colon\ldotp (\breve{S} ʻx)Q(\breve{S} ʻy).\equiv .xS^{;}Qy:(Sʻz)P(Sʻw).\equiv .z\breve{S} ^{;}Pw\colon\ldotp \\ [*23·1] &\supset \colon\ldotp xPy.\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):\equiv .P\,\unicode{x2abd}\, S^{;}Q:\\ &zQw.\supset _{z,w}.(Sʻz)P(Sʻw):\equiv .Q\,\unicode{x2abd}\, \breve{S} ^{;}P\colon\ldotp \\ [*151·27] &\supset \colon\ldotp xPy.\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):zQw.\supset _{z,w}.(Sʻz)P(Sʻw):\equiv .\\ &CʻQ\subset \text{ᗡ}ʻS.P=S^{;}Q &\qquad \text{(1)}\\ \vdash .(1).*5·32.*151·21.&\supset \vdash .\text{Prop} \end{array}$

The above proposition shows that ordinal similarity as we have defined it has the properties which are commonly associated with the term "ordinal similarity," namely that $P$ and $Q$ are ordinally similar when their fields can be so correlated that two terms having the relation $P$ are always correlated with two terms having the relation $Q$ , and vice versa.

The hypothesis $S\in 1\rightarrow 1$ is redundant in *151·28; this is shown in the following proposition.

*151·281. $\begin{align}\vdash \colon\ldotp xPy.&\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):zQw.\supset _{z,w}.(Sʻz)P(Sʻw):\\ &\supset .CʻP\upharpoonleft S=S\upharpoonright CʻQ.S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q\end{align}$

Dem. $\begin{array}{l} \vdash .*14·21.\supset \vdash \colon\ldotp \text{Hp}.&\supset :xPy.\supset .\text{E}!\breve{S} ʻx.\text{E}!\breve{S} ʻy:\\ [*33·352] &\supset :x\in CʻP.\supset .\text{E}!\breve{S} ʻx:\\ [*71·571] &\supset :(CʻP)\upharpoonleft S\in \text{Cls}\rightarrow 1.CʻP\subset \text{D}ʻS &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .S\upharpoonright CʻQ\in 1\rightarrow \text{Cls}.CʻQ\subset \text{ᗡ}ʻS &\qquad \text{(2)}\\ \vdash .*33·17. \supset \vdash \colon\ldotp \text{Hp}.&\supset :xPy.\supset .\breve{S} ʻx,\breve{S} ʻy\in CʻQ:\\ [*33·352] &\supset :x\in CʻP.\supset .\breve{S} ʻx\in CʻQ:\\ [*14·21·26] &\supset :x\in CʻP.xSz.\supset .z\in CʻQ:\\ [*4·71] &\supset :x\in CʻP.xSz.\equiv .x\in CʻP.xSz.z\in CʻQ:\\ [*35·1·102] &\supset :(CʻP)\upharpoonleft S=(CʻP)\upharpoonleft S\upharpoonright CʻQ &\qquad \text{(3)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .S\upharpoonright CʻQ=(CʻP)\upharpoonleft S\upharpoonright CʻQ &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash :\text{Hp}.&\supset .(CʻP)\upharpoonleft S=S\upharpoonright CʻQ. &\qquad \text{(5)}\\ [(1).(2)] &\supset .S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS &\qquad \text{(6)}\\ \vdash .(6).*35·7.(1).(2).*150·4·41.&\supset \vdash :\text{Hp}.\supset .P\,\unicode{x2abd}\, S^{;}Q.Q\,\unicode{x2abd}\, \breve{S} ^{;}P.\\ [*151·264.(6)] &\supset .P=S^{;}Q &\qquad \text{(7)}\\ \vdash .(5).(6).(7).*151·22.\supset \vdash .\text{Prop} \end{array}$

*151·29. $\begin{align}&\vdash \colon\ldotp P\,\text{smor}\,Q.\equiv :(\exists S):xPy.\supset _{x,y}.(\breve{S} ʻx)Q(\breve{S} ʻy):zQw.\supset _{z,w}.(Sʻz)P(Sʻw)\\ &[*151·28·281]\end{align}$

*151·31. $\vdash :S\in \text{Cls}\rightarrow 1.S^{;}Q=S^{;}R.CʻQ\subset \text{ᗡ}ʻS.CʻR\subset \text{ᗡ}ʻS.\supset .Q=R$

Dem. $\begin{array}{l} \vdash .*151·252.\supset \vdash :\text{Hp}.\supset .Q&=\breve{S} ^{;}S^{;}Q\\ [\text{Hp}] &=\breve{S} ^{;}S^{;}R\\ [*151·252] &=R:\supset \vdash .\text{Prop} \end{array}$

*151·32. $\vdash \colon\ldotp P\,\text{smor}\,Q.\supset :\dot{\exists} !P.\equiv .\dot{\exists} !Q \quad[*151·18.*73·36.*33·24]$

*151·33. $\vdash :S\in P\,\overline{\text{smor}}\,Q.\supset .P\mid S=S\mid Q.\breve{S} \mid P=Q\mid \breve{S}$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash :\text{Hp}.&\supset .P\mid S=S\mid Q\mid \breve{S} \mid S.S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.\\ [*72·601] &\supset .P\mid S=S\mid Q &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\breve{S} \mid P=Q\mid \breve{S} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*151·4. $\vdash :T\upharpoonright CʻQ\in 1\rightarrow 1.CʻP=TʻʻCʻQ.Q=\breve{T} ^{;}P.\supset .T\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

Dem. $\begin{array}{l} \vdash .*35·52.*37·4.&\supset \vdash :\text{Hp}.\supset .(CʻQ)\upharpoonleft \breve{T} \in 1\rightarrow 1.\text{ᗡ}ʻ{(CʻQ)\upharpoonleft \breve{T} }=CʻP &\qquad \text{(1)}\\ \vdash .*36·33. \supset \vdash :\text{Hp}.\supset .Q&=(\breve{T} ^{;}P)\unicode{x0294f}CʻQ\\ [*150·361] &=\{(CʻQ)\upharpoonleft \breve{T}\}^{;}P &\qquad \text{(2)}\\ \vdash .(1).(2).*151·11.&\supset \vdash :\text{Hp}.\supset .(CʻQ)\upharpoonleft \breve{T} \in Q\,\overline{\text{smor}}\,P.\\ [*151·131] &\supset .T\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q:\supset \vdash .\text{Prop} \end{array}$

*151·401. $\begin{align}\vdash :T\upharpoonright CʻP\in X,\overline{\text{smor}}\,P.T\upharpoonright CʻQ\in Y\overline{\text{smor}} &Q.S\in P\,\overline{\text{smor}}\,Q.\supset .\\ &T^{;}S\in X\,\overline{\text{smor}} \,Y\end{align}$

Dem. $\begin{array}{l} \vdash .*151·131·141.\supset \vdash :\text{Hp}.&\supset .T\upharpoonright CʻP\mid S\mid (CʻQ)\upharpoonleft \breve{T} \in X\,\overline{\text{smor}} \,Y &\qquad \text{(1)}\\ \vdash .*151·11·131. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻS=CʻP.\text{ᗡ}ʻS=CʻQ.\\ [*150·34] &\supset .T\upharpoonright CʻP\mid S\mid (CʻQ)\upharpoonleft \breve{T} =T^{;}S &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*151·41. $\begin{align}\vdash :S\in P\,\overline{\text{smor}}\,Q.T\upharpoonright CʻP,T\upharpoonright &CʻQ\in 1\rightarrow 1.CʻP\cup CʻQ\subset \text{ᗡ}ʻT.\supset .\\ &T^{;}S\in (T^{;}P)\overline{\text{smor}} (T^{;}Q) \quad[*151·401·22]\end{align}$

The following proposition is used frequently both in relation-arithmetic and in the theory of series.

*151·5. $\begin{align}\vdash :S\upharpoonright &CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .\\ &\text{D}ʻP=Sʻʻ\text{D}ʻQ.\text{ᗡ}ʻP=Sʻʻ\text{ᗡ}ʻQ.\overrightarrow{B}ʻP=Sʻʻ\overrightarrow{B}ʻQ.\overrightarrow{B}ʻ\breve{P} =Sʻʻ\overrightarrow{B}ʻ\breve{Q}\end{align}$

Dem. $\begin{array}{l} \vdash .*151·22.*150·21·211. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP=Sʻʻ\text{D}ʻQ.\text{ᗡ}ʻP=Sʻʻ\text{ᗡ}ʻQ. &\qquad \text{(1)}\\ [*93·101]& \supset .\overrightarrow{B}ʻP=Sʻʻ\text{D}ʻQ-Sʻʻ\text{ᗡ}ʻQ.\\ [*37·421.*151·22] \supset .\overrightarrow{B}ʻP&=(S\upharpoonright CʻQ)ʻʻ\text{D}ʻQ-(S\upharpoonright CʻQ)ʻʻ\text{ᗡ}ʻQ\\ [*71·381.*151·22] &=(S\upharpoonright CʻQ)ʻʻ(\text{D}ʻQ-\text{ᗡ}ʻQ)\\ [*93·101.*37·421] &=Sʻʻ\overrightarrow{B}ʻQ &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\overrightarrow{B}ʻ\breve{P} =Sʻʻ\overrightarrow{B}ʻ\breve{Q} &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*151·51. $\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.R\,\unicode{x2abd}\, Q.\supset .S\upharpoonright CʻR\in (S^{;}R)\overline{\text{smor}} R.S^{;}R\,\unicode{x2abd}\, P$

Dem. $\begin{array}{l} \vdash .*151·22.*33·265. &\supset \vdash :\text{Hp}.\supset .CʻR\subset \text{ᗡ}ʻS &\qquad \text{(1)}\\ \vdash .*151·22.*71·222. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright CʻR\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*150·31.*151·22. &\supset \vdash :\text{Hp}.\supset .S^{;}R\,\unicode{x2abd}\, P &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·22.\supset \vdash .\text{Prop} \end{array}$

*151·52. $\vdash :P\,\text{smor}\,Q.\supset .\text{Rl}ʻQ\subset \text{smor}ʻʻ\text{Rl}ʻP \quad[*151·51·12·14]$

*151·53. $\begin{align}\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.T\in &\text{Pot}ʻQ.\supset .\\ &S\upharpoonright CʻT\in (S^{;}T)\overline{\text{smor}} T.S^{;}T\in \text{Pot}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*150·8. &\supset \vdash :\text{Hp}.\supset .S^{;}T\in \text{Pot}ʻP &\qquad \text{(1)}\\ \vdash .*91·27. &\supset \vdash :\text{Hp}.\supset .CʻT\subset \text{ᗡ}ʻS &\qquad \text{(2)}\\ \vdash .(1).(2).*151·22.\supset \vdash .\text{Prop} \end{array}$

*151·54. $\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .S\upharpoonright CʻQ\in P_{\text{po}}\overline{\text{smor}} Q_{\text{po}}$

Dem. $\begin{array}{l} \vdash .*91·504.*151·22. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright CʻQ=S\upharpoonright CʻQ_{\text{po}}.CʻQ_{\text{po}}\subset \text{ᗡ}ʻS &\qquad \text{(1)}\\ \vdash .*150·83.*151·22. &\supset \vdash :\text{Hp}.\supset .P_{\text{po}}=S^{;}Q_{\text{po}} &\qquad \text{(2)}\\ \vdash .(1).(2).*151·22. &\supset \vdash .\text{Prop} \end{array}$

*151·55. $\vdash :S\in P\,\overline{\text{smor}}\,Q.\supset .S\in P_{\text{po}}\overline{\text{smor}} Q_{\text{po}} \quad[*151·54]$

*151·56. $\vdash :P\,\text{smor}\,Q.\supset .P_{\text{po}}\text{smor}Q_{\text{po}} \quad[*151·55]$

The two following propositions are lemmas for **151·59, which is used in *263·17.

*151·57. $\vdash :S\in P\,\overline{\text{smor}}\,Q.z,w\in CʻQ.\supset .P(Sʻz\vdash\dashv Sʻw)=SʻʻQ(z\vdash\dashv w)$

Dem. $\begin{array}{l} \vdash .*151·33·55.\supset \vdash :\text{Hp}.&\supset .\overleftarrow{P}_{\text{po}}ʻSʻz=Sʻʻ\overleftarrow{Q}_{\text{po}}ʻz.\overrightarrow{P}_{\text{po}}ʻSʻw=Sʻʻ\overrightarrow{Q}_{\text{po}}ʻw.\\ [*91·54] &\supset .\overleftarrow{P}_{*}ʻSʻz=Sʻʻ\overleftarrow{Q}_{\text{po}}ʻz\cup \iota ʻSʻz.\\ &\overrightarrow{P}_{*}ʻSʻw=Sʻʻ\overrightarrow{Q}_{\text{po}}ʻw\cup \iota ʻSʻw.\\ [*53·31.*91·54] &\supset .\overleftarrow{P}_{*}ʻSʻz=Sʻʻ\overleftarrow{Q}_{*}ʻz.\overrightarrow{P}_{*}ʻSʻw=Sʻʻ\overrightarrow{Q}_{*}ʻw.\\ [(*121·103)] &\supset .P(Sʻz\vdash\dashv Sʻw)=SʻʻQ(z\vdash\dashv w):\supset \vdash .\text{Prop} \end{array}$

*151·58. $\vdash :S\in P\,\overline{\text{smor}}\,Q.\supset .S\upharpoonright CʻQ_{\nu }\in P_{\nu }\overline{\text{smor}} Q_{\nu }$

Dem. $\begin{array}{l} \vdash .*151·57.*73·22.\supset \vdash \colon\ldotp \text{Hp}.\supset :z,w\in &CʻQ.\supset .\\ &\text{Nc}ʻP(Sʻz\vdash\dashv Sʻw)=\text{Nc}ʻQ(z\vdash\dashv w) &\qquad \text{(1)}\\ \vdash .(1).*121·11. &\supset \vdash \colon\ldotp \text{Hp}.z,w\in CʻQ.\supset :zQ_{\nu }w.\equiv .(Sʻz)P_{\nu }(Sʻw) &\qquad \text{(2)}\\ \vdash .(2).*150·41. \supset \vdash :\text{Hp}.&\supset .Q_{\nu }=\breve{S} ^{;}P_{\nu }.\\ [*151·253.*121·322] &\supset .S^{;}Q_{\nu }=P_{\nu }.CʻQ_{\nu }\subset \text{ᗡ}ʻS &\qquad \text{(3)}\\ \vdash .(3).*151·22.\supset \vdash .\text{Prop} \end{array}$

*151·59. $\vdash :P\,\text{smor}\,Q.\supset .P_{\nu }\text{smor}Q_{\nu } \quad[*151·58]$

The remaining propositions of this number consist of applications to particular cases.

*151·6. $\begin{align}&\vdash .\text{Cnv}^{;}P\,\text{smor}\,P.\text{Cnv}\upharpoonright CʻP\in (\text{Cnv}^{;}P)\,\overline{\text{smor}}\,P\\ &[*151·231.*31·13.*72·11]\end{align}$

*151·61. $\vdash .\iota ^{;}P\,\text{smor}\,P \quad[*151·232.*51·12.*72·18]$

*151·62. $\vdash :CʻP\subset 1.\supset .\breve{\iota} ^{;}P\,\text{smor}\,P \quad[*52·62 . *151·243]$

*151·63. $\vdash :x\neq y.z\neq w.\supset .x\downarrow y\text{smor}z\downarrow w.x\downarrow z\unicode{x228d} y\downarrow w\in (x\downarrow y)\overline{\text{smor}} (z\downarrow w)$

Dem. $\begin{array}{l} \vdash .*150·72.&\supset \vdash :S=x\downarrow z\unicode{x228d} y\downarrow w.z\neq w.\supset .S^{;}(z\downarrow w)=x\downarrow y &\qquad \text{(1)}\\ \vdash .*72·182.*71·242.&\supset \vdash :\text{Hp}.\text{Hp}(1).\supset .S\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*55·15. &\supset \vdash :\text{Hp}(1).\supset .\text{ᗡ}ʻS=Cʻ(z\downarrow w) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·1·11.\supset \vdash .\text{Prop} \end{array}$

The above proposition shows that all ordinal couples (i.e. all members of $2_{r})$ are ordinally similar. The following proposition shows the same for couples whose referent and relatum are identical.

Dem. $\begin{array}{l} \vdash .*72·182.*55·15.&\supset \vdash .x\downarrow z\in 1\rightarrow 1.\text{ᗡ}ʻ(x\downarrow z) = Cʻ(z\downarrow z) &\qquad \text{(1)}\\ \vdash .*55·13.&\supset \vdash :u\{x\downarrow z\mid z\downarrow z\mid \text{Cnv}ʻ(x\downarrow z)\}u'. \equiv .\\ &u(x\downarrow z)z.u'(x\downarrow z)z.\\ [*55·13] &\equiv .u = x.u' = x.\\ [*55·13] &\equiv .u(x\downarrow x)u' &\qquad \text{(2)}\\ \vdash .(2).*150·1. &\supset \vdash .(x\downarrow z)^{;}(z\downarrow z) = x\downarrow x &\qquad \text{(3)}\\ \vdash .(1).(3).*151·1. &\supset \vdash .\text{Prop} \end{array}$

*151·64. $\begin{align}&\vdash .x\downarrow ^{;}P \,\text{smor} P.(x\downarrow )\upharpoonright CʻP\in (x\downarrow ^{;}P) \overline{\text{smor}} P\\ &[*72·184.*55·12.*151·231]\end{align}$

*151·65. $\begin{align}&\vdash .\downarrow x^{;}P \,\text{smor} P.(\downarrow x)\upharpoonright CʻP\in (\downarrow x^{;}P)\overline{\text{smor}} P\\ &[*72·184.*55·121.*151·231]\end{align}$

The relation-number of $P$ , which we denote by $\text{Nr}ʻP$ , is defined as the class of relations which are ordinally similar to $P$ , i.e. $\text{Nr}ʻP = \overrightarrow{\text{smor}}ʻP.$ Hence our definition is $\text{Nr} = \overrightarrow{\text{smor}} \quad\text{Df}.$ The class of relation-numbers consists of all such classes as $\text{Nr}ʻP$ , i.e. $\text{NR} = \text{D}ʻ\text{Nr} \quad\text{Df}.$ These two definitions are analogous to those of *100, merely substituting " $\text{smor}$ " for " $\text{sm}$ ." They are justified by similar considerations, and lead to similar results. With the exception of *152·7 ·71 ·72, the propositions of this number are the analogues of those of *100, and call for no remarks other than those in the introduction to *100 (mutatis mutandis).

*152·7 ·71 ·72 give relations between relation-numbers and cardinals. *152·7, which is constantly used, states that the cardinal number of $CʻQ$ consists of the fields of the relation-number of $Q$ , i.e. the classes similar to $CʻQ$ are the fields of the relations similar to $Q$ ; in symbols,

Hence it follows that the fields of a relation-number form a cardinal number, i.e.

Hence also it follows that cardinals other than $\Lambda$ consist of classes of the form $Cʻʻ\mu$ , where $\mu$ is a relation-number other than $\Lambda$ , i.e.

*152·72. $\vdash . \text{NC} - \iota ʻ\Lambda = Cʻʻʻ(\text{NR} - \iota ʻ\Lambda )$

In *154·9, we shall show how to remove the restriction to numbers other than $\Lambda$ , thus arriving at $\vdash . \text{NC} = Cʻʻʻ\text{NR}.$

*152·1. $\begin{align}&\vdash .\text{Nr}ʻP=\hat{Q} (Q\,\text{smor}\,P)=\hat{Q} (P\,\text{smor}\,Q)\\ &[*32·11.(*152·01).*151·14]\end{align}$

*152·11. $\vdash :Q\in \text{Nr}ʻP.\equiv .Q\,\text{smor}\,P.\equiv .P\,\text{smor}\,Q \quad[*152·1]$

*152·22. $\vdash .\text{Nr}\in 1\rightarrow \text{Cls} \quad[*152·2.*71·166]$

*152·32. $\vdash :P\in \text{Nr}ʻQ.Q\in \text{Nr}ʻR.\supset .P\in \text{Nr}ʻR \quad [*151·15.*152·11]$

*152·321. $\vdash :P\,\text{smor}\,Q.\supset .\text{Nr}ʻP=\text{Nr}ʻQ \quad[*151·17.*152·1]$

*152·33. $\vdash :\exists !\text{Nr}ʻP\cap \text{Nr}ʻQ.\supset .P\,\text{smor}\,Q.\text{Nr}ʻP=\text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash .*152·11.*151·14. \supset \vdash :\text{Hp}.&\supset .(\exists R).P\,\text{smor}\,R.R\,\text{smor}\,Q.\\ [*151·15] &\supset .P\,\text{smor}\,Q &\qquad \text{(1)}\\ \vdash .(1).*152·321.\supset \vdash .\text{Prop} \end{array}$

*152·35. $\begin{align}\vdash \colon\ldotp \exists !&\text{Nr}ʻP.\lor.\exists !\text{Nr}ʻQ:\supset :\\ &\text{Nr}ʻP=\text{Nr}ʻQ.\equiv .P\in \text{Nr}ʻQ.\equiv .Q\in \text{Nr}ʻP.\equiv .P\,\text{smor}\,Q\end{align}$

Dem. $\begin{array}{l} \vdash .*24·571. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{Nr}ʻP=\text{Nr}ʻQ.\supset .\exists !\text{Nr}ʻP\cap \text{Nr}ʻQ.\\ [*152·33] &\supset .P\,\text{smor}\,Q &\qquad \text{(1)}\\ \vdash .(1).*152·321. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{Nr}ʻP=\text{Nr}ʻQ.\equiv .P\,\text{smor}\,Q &\qquad \text{(2)}\\ \vdash .(2).*152·11.\supset \vdash .\text{Prop} \end{array}$

In the above proposition, the same remarks as to types are to be made as in the case of *100·35. If in a certain type $\text{Nr}ʻP$ and $\text{Nr}ʻQ$ are both null, we have in that type $\text{Nr}ʻP=\text{Nr}ʻQ$ , but we need not have $P\,\text{smor}\,Q$ . Thus for example we shall find that, in the type of $x\downarrow x$ , $\text{Nr}ʻ(t^{2}ʻx\uparrow t^{2}ʻx)=\Lambda =\text{Nr}ʻʻ(t^{3}ʻx\uparrow t^{3}ʻx).$ But we do not have $(t^{2}ʻx\uparrow t^{2}ʻx)\text{smor}(t^{3}ʻx\uparrow t^{3}ʻx).$

*152·4. $\vdash :\mu \in \text{NR}.\equiv .(\exists P).\mu =\text{Nr}ʻP \quad[*37·78·79.(*152·02·01)]$

Note that " $\text{Nr}ʻP$ ," like " $\text{Nc}ʻ\alpha$ ," is a formal number, and may be subjected to the conventions $\text{IT}$ , $\text{IIT}$ , $\text{AT}$ .

*152·42. $\vdash :\mu ,\nu \in \text{NR}.\exists !\mu \cap \nu .\supset .\mu =\nu \quad[*152·33·4]$

*152·44. $\begin{align}&\vdash \colon\ldotp \mu \in \text{NR}:\exists !\mu .\lor.\exists !\text{Nr}ʻP.\supset :P\in \mu .\equiv .\text{Nr}ʻP=\mu \\ &[*152·35·4]\end{align}$

*152·45. $\vdash :\mu \in \text{NR}.P\in \mu .\supset .\text{Nr}ʻP=\mu \quad[*152·44.*10·24]$

*152·5. $\vdash :\mu \in \text{NR}.P,Q\in \mu .\supset .P\,\text{smor}\,Q \quad[*152·31·32·4]$

*152·51. $\vdash :\mu \in \text{NR}.P\in \mu .\supset .\text{smor}ʻʻ\mu =\text{Nr}ʻP$

Dem. $\begin{array}{l} \vdash .*37·1. &\supset \vdash :R\in \text{smor}ʻʻ\mu .\equiv .(\exists Q).Q\in \mu .P\,\text{smor}\,Q &\qquad \text{(1)}\\ \vdash .*152·5.&\supset \vdash \colon\ldotp \mu \in \text{NR}.P\in \mu .\supset :Q\in \mu .P\,\text{smor}\,Q.\equiv .Q\in \mu &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in \text{smor}ʻʻ\mu .&\equiv .(\exists Q).Q\in \mu .P\,\text{smor}\,Q.R\,\text{smor}\,Q.\\ [*151·17] &\equiv .(\exists Q).Q\in \mu .P\,\text{smor}\,Q.R\,\text{smor}\,P.\\ [(2)] &\equiv .(\exists Q).Q\in \mu .R\,\text{smor}\,P.\\ [*10·35] &\equiv .\exists !\mu .R\,\text{smor}\,P &\qquad \text{(3)}\\ \vdash .*10·24. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\mu :\\ [*4·73] \supset :R\,\text{smor}\,P.&\equiv .\exists !\mu .R\,\text{smor}\,P &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in \text{smor}ʻʻ\mu .&\equiv .R\,\text{smor}\,P.\\ [*152·11] &\equiv .R\in \text{Nr}ʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*152·52. $\vdash :\mu \in \text{NR}.\exists !\mu .\supset .\text{smor}ʻʻ\mu \in \text{NR} \quad[*152·51·4]$

The restriction involved in $\exists ! \mu$ is, as we shall see later, not necessary, since $\Lambda \in \text{NR}$ in any assigned type.

*152·53. $\vdash :\exists !\text{Nr}ʻQ.\supset .\text{smor}ʻʻ\text{Nr}ʻQ=\text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash .*152·51. \supset \vdash :P\in \text{Nr}ʻQ.\supset .\text{smor}ʻʻ\text{Nr}ʻQ=\text{Nr}ʻP &\qquad \text{(1)}\\ \vdash .*152·321.\supset \vdash :P\in \text{Nr}ʻQ.\supset .\text{Nr}ʻP=\text{Nr}ʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*152·54. $\begin{align}&\vdash \colon\ldotp \exists !\mu .\exists !\nu .\supset :\mu \in \text{NR}.\nu =\text{smor}ʻʻ\mu .\equiv .\nu \in \text{NR}.\mu =\text{smor}ʻʻ\nu \\ &[\text{Proof as in *100·53}]\end{align}$

The utility of *152·6 ·62 ·63 is that they enable us to raise the type of a relation-number to any required extent. Thus $\iota ^{;}P$ gives a relation whose field is a class of the next type above that of $CʻP$ , i.e. of the type $t^{2}ʻCʻP$ ; while $x\downarrow ^{;}P$ gives a relation whose field is $x\downarrowʻʻCʻP$ , which is of the type $tʻtʻ(\iota ʻx\uparrow CʻP)$ . If $x\in CʻP$ , or, more generally, if $x\in t_{0}ʻCʻP$ , this is the type $t^{2}ʻP$ . Thus if we put $Q=x\downarrow ^{;}P$ , we have $tʻQ=tʻ(CʻQ\uparrow CʻQ)=tʻ(tʻP\uparrow tʻP)=tʻ(P\downarrow P).$ Thus $x\downarrow ^{;}P$ is a relation whose field consists of terms of the same type as $P$ .

The following propositions on the relations of cardinals and relation-numbers are very important.

Dem. $\begin{array}{l} \vdash .*151·19.*35·942. \supset \vdash :\alpha \in \text{Nc}ʻCʻQ.\supset .(\exists R).CʻR=\alpha .R\in \text{Nr}ʻQ.\\ [*37·6] \supset .\alpha \in Cʻʻ\text{Nr}ʻQ &\qquad \text{(1)}\\ \vdash .*151·18. \supset \vdash :P\in \text{Nr}ʻQ.\supset .CʻP\in \text{Nc}ʻCʻQ\\ [*37·61] \supset \vdash .Cʻʻ\text{Nr}ʻQ\subset \text{Nc}ʻCʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*152·71. $\vdash :\mu \in \text{NR}.\supset .Cʻʻ\mu \in \text{NC} \quad[*152·7]$

*152·72. $\vdash .\text{NC}-\iota ʻ\Lambda =Cʻʻʻ(\text{NR}-\iota ʻ\Lambda )$

Dem. $\begin{array}{l} \vdash .*152·71. &\supset \vdash .Cʻʻʻ\text{NR}\subset \text{NC} &\qquad \text{(1)}\\ \vdash .*152·7.*50·5·52. &\supset \vdash :\mu \in \text{NC}.\alpha \in \mu .\supset .Cʻʻ\text{Nr}ʻ(I\upharpoonright \alpha )=\text{NC}ʻ\alpha .\\ [*100·45] &\supset .Cʻʻ\text{Nr}ʻ(I\upharpoonright \alpha )=\mu .\\ [*37·103] &\supset .\mu \in Cʻʻʻ\text{NR} &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35. &\supset \vdash :\mu \in \text{NC}.\exists !\mu .\supset .\mu \in Cʻʻʻ\text{NR} &\qquad \text{(3)}\\ \vdash .*37·45. &\supset \vdash :\mu =Cʻʻ\nu .\exists !\mu .\supset .\exists !\nu :\\ [*37·103] &\supset \vdash :\mu \in Cʻʻʻ\text{NR}.\exists !\mu .\supset .\mu \in Cʻʻʻ(\text{NR}-\iota ʻ\Lambda ) &\qquad \text{(4)}\\ \vdash .(1).(3).(4).\supset \vdash .\text{Prop} \end{array}$

We shall show in *154·9 that the exclusion of $\Lambda$ in *152·72 is unnecessary.

The relation-numbers $0_{r}$ and $2_{r}$ have already been defined (in *56), though it remains for the present number to show that they are relation-numbers. They are the ordinal 0 and 2 respectively, i.e. they are the ordinal numbers of well-ordered series of no terms and series of two terms respectively. But there is no means of introducing an ordinal 1 which shall be analogous to the cardinal 1 as completely as $0_{r}$ and $2_{r}$ are analogous to 0 and 2. The only relations whose fields are unit classes are relations of the form $x\downarrow x$ . We therefore put

The above definition gives the nearest possible approach to an ordinal 1. $1_{s}$ so defined is a relation-number, and is the relation-number corresponding to 1 in the sense that it is the relation-number of all such relations as have a field consisting of one term. But $1_{s}$ is not what is called an "ordinal number," because this term is confined by usage to the relation-numbers of well-ordered series, and $x\downarrow x$ is not a serial relation. It is essential to a serial relation to be contained in diversity; and if, by definition, we include $x\downarrow x$ among series, we introduce more exceptions than we avoid. Moreover $1_{s}$ does not have the kind of properties which we wish 1 to have; e.g. $1_{s}\dot{+}1_{s}$ is not $2_{r}$ .

We do not use $1_{r}$ , because we shall at a later stage define $\nu _{r}$ as the class of those series whose fields have $\nu$ terms, so that $1_{r}=\Lambda$ , while $0_{r}$ and $2_{r}$ have the values $\iota ʻ\dot{\Lambda}$ and $\hat{R} \{(\exists x,y).x\neq y.R=x\downarrow y\}$ , as already defined. On account of this general definition of $\nu_{r}$ , we choose a different symbol for the relation-number 1, and $1_{s}$ has the merit of being as like $1_{r}$ as possible.

To illustrate, by anticipation, the way in which $1_{s}$ differs from proper ordinal numbers, we may point out that if $1_{s}$ is added to $2_{r}$ , we do not obtain $3_{r}$ . We shall define $3_{r}$ as the class of series which consist of three terms, i.e. the class of relations of the form $x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z,$ where $x\neq y.x\neq z.y\neq z$ . We shall define the sum of two ordinal numbers[Pg 335] as the ordinal number of the sum of two relations having these ordinal numbers (cf. *180), and it will appear that if $P$ and $Q$ are relations whose fields have no members in common, then $P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ$ has a relation-number which is the sum of those of $P$ and $Q$ . Suppose now $P=x\downarrow y$ and $Q=z\downarrow z$ , where $x\neq y.x\neq z.y\neq z$ . Then $P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ=x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z\unicode{x228d} z\downarrow z.$ This is not a member of $3_{r}$ , because of the additional term $z\downarrow z$ . Thus the addition of one term to a series $P$ does not give the same number as results from the addition of $1_{s}$ to $\text{Nr}ʻP$ . Hence the addition of 1 to an ordinal number has to be separately treated[12].

We prove in this number that $0_{r} = \text{Nr}ʻ\dot{\Lambda}$ (*153·11), that $2_{r}=\text{Nr}ʻ(\Lambda \downarrow \iotaʻx)$ (*153·24; observe that we have to take a couple of classes (or relations) in order to be sure of the existence of two different objects of the class in question), and that $1_{s}=\text{Nr}ʻ(y\downarrow y$ ) (*153·32). We prove $Cʻʻ0_{r} =0$ (*153·18), $Cʻʻ2_{r}=2$ (*153·212), and $Cʻʻ1_{s}=1$ (*153·36). We have also $\breve{C} ʻʻ0=0_{r}$ (not proved) and $\breve{C}ʻʻ1=1_{s}$ (*153·301). But we do not have $\breve{C} ʻʻ2=2_{r}$ ; e.g. $(x\downarrow y\unicode{x228d} y\downarrow x)\in \breve{C}ʻʻ2$ if $x\neq y$ , but $(x\downarrow y\unicode{x228d} y\downarrow x){\sim}\in 2_{r}$ . We have $\exists !0_{r}$ (*153·12) and $\exists!1_{s}$ (*153·34), but from our primitive propositions we cannot deduce $\exists !2_{r}$ unless we rise above the lowest type of relations. The case is exactly analogous to that of $\exists !2$ (cf. *101); we have

*153·26·262. $\vdash .\exists !2_{r}\cap \text{Rl}ʻ(\text{Cls}\uparrow \text{Cls}).\exists !2_{r}\cap \text{Rel}^{2}$

But if, as monists aver, there is only one individual, we shall not have $\exists !2_{r}$ in the type of relations of individuals to individuals. Our primitive propositions do not suffice to disprove this supposition.

Dem. $\begin{array}{l} \vdash .*151·32.\text{Transp}.&\supset \vdash :P\text{smor}\dot{\Lambda} .\supset .{\sim}\dot{\exists} !P &\qquad \text{(1)}\\ \vdash .*151·13. &\supset \vdash :P=\dot{\Lambda} .\supset .P\text{smor}\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*153·13. $\vdash .\exists !0_{r}\cap \text{Rl}ʻR.\Lambda \in 0_{r}\cap \text{Rl}ʻR \quad[*61·3]$

Dem. $\begin{array}{l} \vdash .*152·44.*153·111·12.\supset \vdash :\text{Nr}ʻP = 0_{r}. &\equiv .P\in 0_{r}.\\ [*152·1] &\equiv .P = \dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*152·51.*153·111·13.\supset \vdash .\text{smor}ʻʻ0_{r}. &= \text{Nr}ʻ\dot{\Lambda} \\ [*153·11] &= 0_{r}.\supset \vdash .\text{Prop} \end{array}$

*153·16. $\vdash \colon\ldotp \mu \in \text{NR}-\iota ʻ0_{r}.\supset :P\in \mu .\supset _{P}.\dot{\exists} !P$

Dem. $\begin{array}{l} \vdash .*153·13.*152·42.\supset \vdash \colon\ldotp \mu \in \text{NR}.&\supset :\dot{\Lambda} \in \mu .\supset .\mu = 0_{r}:\\ [\text{Transp}] & \supset :\mu \neq 0_{r}.\supset .\dot{\Lambda} {\sim} \in \mu &\qquad \text{(1)}\\ \vdash .(1).*25·63.\supset \vdash .\text{Prop} \end{array}$

*153·17. $\begin{align}&\vdash :\dot{\Lambda} \in \text{Nr}ʻP. \equiv .\text{Nr}ʻP = 0_r. \equiv .\text{Nr}ʻP = \text{Nr}ʻ\dot{\Lambda} . \equiv .P = \dot{\Lambda} \\ &[*152·35.*153·11·14]\end{align}$

Dem. $\begin{array}{l} \vdash .*53·31.\supset \vdash .Cʻʻ\iota ʻ\dot{\Lambda} = \iota ʻCʻ\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .(1).*33·241.(*56·03.*54.01).\supset \vdash .\text{Prop} \end{array}$

*153·2. $\vdash :P\in 2_{r}. \equiv .(\exists x,y).x \neq y.P = x\downarrow y \quad[*56·11]$

*153·202. $\vdash :P,Q\in 2_{r}.\supset .P \,\text{smor} \,Q \quad[*151·63.*153·2]$

Dem. $\begin{array}{l} \vdash .*113·123.&\supset \vdash :S\in 1\rightarrow \text{Cls}.z,w\in \text{ᗡ}ʻS.\supset .S^{;}(z\downarrow w) = (Sʻz)\downarrow (Sʻw):\\ [*55·15] & \supset \vdash :S\in 1\rightarrow \text{Cls}.Cʻ(z\downarrow w) = \text{ᗡ}ʻS.\supset .\\ &S^{;}(z\downarrow w) = (Sʻz)\downarrow (Sʻw) &\qquad \text{(1)}\\ \vdash .*71·56. \supset \vdash \colon\ldotp S\in 1\rightarrow 1.Cʻ(z\downarrow w) = \text{ᗡ}ʻS.&\supset :z = w. \equiv .Sʻz = Sʻw:\\ [\text{Transp}] &\supset :z \neq w. \equiv .Sʻz \neq Sʻw &\qquad \text{(2)}\\ \vdash .(1).(2).*153·201.\supset \\ &\vdash :S\in 1\rightarrow 1.z \neq w.Cʻ(z\downarrow w) = \text{ᗡ}ʻS.P = S^{;}(z\downarrow w).\supset .P\in 2_{r}:\\ [*151·1] &\supset \vdash :z \neq w. P \,\text{smor} (z\downarrow w).\supset .P\in 2_{r}:\\ [*153·2] &\supset \vdash :Q\in 2_{r}.P \,\text{smor} \,Q.\supset .P\in 2_{r}:\supset \vdash .\text{Prop} \end{array}$

*153·21. $\vdash :P\in 2_{r}.\supset .2_{r} = \text{Nr}ʻP \quad[*153·202·203]$

*153·211. $\vdash :x \neq y.\supset .2_{r} = \text{Nr}ʻ(x\downarrow y) \quad[*153·21·201]$

*153·22. $\vdash :\exists !2_{r}\cap t''ʻz.\equiv .\exists !2(z).\equiv .(\exists x,y).x\neq yx\in tʻz \quad[*153·211.*101·4]$

*153·23. $\vdash :P\in 2_{r}.\supset .\text{Rl}ʻP\subset 0_{r}\cup 2_{r} \quad[*56·261]$

This proposition illustrates the reasons for not putting $1_{r}=\hat{P} \{(\exists x).P=x\downarrow x\} \quad\text{Df}.$ We want the inductive ordinals, like the inductive cardinals, to form a series in order of magnitude; but, as the above proposition illustrates, the relation-number of such relations as $x\downarrow x$ is not in the same series with $0_{r}$ and $2_{r}$ . The above proposition should be contrasted with *51·411.

*153·24. $\vdash .2_{r}=\text{Nr}ʻ(\Lambda \downarrow \iota ʻx) \quad[*153·211.*51·161]$

Dem. $\begin{array}{l} \vdash .*153·212·18.*101·34·35.&\supset \vdash .Cʻʻ2_{r}\neq Cʻʻ0_{r}.Cʻʻ2_{r}\cap Cʻʻ0_{r}=\Lambda .\\ [*13·12.\text{Transp}.*37·21] &\supset \vdash .2_{r}\neq 0_{r}.Cʻʻ(2_{r}\cap 0_{r})=\Lambda .\\ [*37·45] &\supset \vdash .2_{r}\neq 0_{r}.2_{r}\cap 0_{r}=\Lambda \end{array}$

*153·26. $\vdash .\exists !2_{r}\cap \text{Rl}ʻ(\text{Cls}\uparrow \text{Cls}) \quad[*153·24.*152·3]$

*153·261. $\vdash .\dot{\Lambda} \downarrow (x\downarrow x)\in 2_{r} \quad[*55·134.*56·11]$

*153·262. $\vdash .\exists !2_{r}\cap \text{Rel}^{2} \quad[*153·261.(*61·03)]$

*153·27. $\begin{align}&\vdash .2_r=\text{smor}ʻʻ(2_r\cap \text{Rl}ʻ\text{Cls})=\text{smor}ʻʻ(2_r\cap \text{Rel}^2)\\ &[*152·53.*153·26·262·24]\end{align}$

*153·28. $\vdash :x\neq y.\supset .Bʻ(x\downarrow y)=x.Bʻ\text{Cnv}ʻ(x\downarrow y)=y$

Dem. $\begin{array}{l} \vdash .*93·101.*55·15.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ(x\downarrow y)=\iota ʻx.\overrightarrow{B}ʻ\text{Cnv}ʻ(x\downarrow y)=\iota ʻy:\supset \vdash .\text{Prop} \end{array}$

*153·281. $\vdash :P\in 2_{r}.\supset .BʻP=\breve{\iota} ʻ\text{D}ʻP.Bʻ\breve{P} =\breve{\iota} ʻ\text{ᗡ}ʻP \quad[*153·28.*55·15]$

*153·3. $\vdash .1_{s}=\dot{2} -2_{r}=\hat{R} \{(\exists x).R=x\downarrow x\} \quad[*56·13.(*153·01)]$

*153·31. $\vdash .x\downarrow y\in (x\downarrow x)\overline{\text{smor}} (y\downarrow y)$

Dem. $\begin{array}{l} \vdash .*72·182.*55·15.&\supset \vdash .x\downarrow y\in 1\rightarrow 1.\text{ᗡ}ʻ(x\downarrow y)=Cʻ(y\downarrow y) &\qquad \text{(1)}\\ \vdash .*35·89.*55·1. &\supset \vdash .x\downarrow y\mid y\downarrow y=x\downarrow y.\\ [*150·1.*55·14] \supset \vdash .(x\downarrow y)^{;}(y\downarrow y)&=x\downarrow y\mid y\downarrow x\\ [*35·89.*55·1] &=x\downarrow x &\qquad \text{(2)}\\ \vdash .(1).(2).*151·11.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*153·3.*151·1.\supset \vdash :\text{Hp}.&\supset .\\ &(\exists S,y).Q=y\downarrow y.S\in 1\rightarrow 1.\text{ᗡ}ʻS=\iota ʻy.P=S^{;}Q.\\ [*150·71] &\supset .(\exists S,y).P=(Sʻy)\downarrow (Sʻy).\\ [*153·3] &\supset .P\in 1_{s}:\supset \vdash .\text{Prop} \end{array}$

*153·34. $\vdash .\exists !1_{s}.1_{s}\neq 0_{r}.1_{s}\neq 2_{r}.1_{s}\cap 0_{r}=\Lambda .1_{s}\cap 2_{r}=\Lambda$

Dem. $\begin{array}{l} \vdash .*153·3. &\supset \vdash .x\downarrow x\in 1_{s}.\\ [*10·24] &\supset \vdash .\exists !1_{s} &\qquad \text{(1)}\\ \vdash .*56·103·104. &\supset \vdash .1_{s}\cap 0_{r}=\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash .1_{s}\neq 0_{r} &\qquad \text{(3)}\\ \vdash .*153·301.*56·113.&\supset \vdash .1_{s}\cap 2_{r}\subset \breve{C} ʻʻ1\cap \breve{C} ʻʻ2.\\ [*72·41.*101·35] &\supset \vdash .1_{s}\cap 2_{r}=\Lambda &\qquad \text{(4)}\\ [(1)] &\supset \vdash .1_{s}\neq 2_{r} &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*153·341. $\vdash :R\in 1_{s}.\equiv .\text{Nr}ʻR=1_{s} \quad[*153·33·34.*152·44]$

Dem. $\begin{array}{l} \vdash .*55·15.*153·3.\supset \vdash :\text{Hp}.\supset .\text{Nc}ʻCʻR=1 &\qquad \text{(1)}\\ \vdash .(1).*152·7.\supset \vdash .\text{Prop} \end{array}\$

Dem. $\begin{array}{l} \vdash .*153·301.\supset \vdash .Cʻʻ1_{s}&=Cʻʻ\breve{C} ʻʻ1\\ [*72·502] &=1.\supset \vdash .\text{Prop}\ \end{array}$

FOOTNOTES:

[12] Cf. *161 and *181, where this point is more fully elucidated.

This number gives propositions analogous to those of *102. In accordance with our general notations for typical definiteness, " $\text{Nr}(P)ʻQ$ " means "the class of relations like $Q$ and of the same type as $P$ ," " $\text{Nr} (P_{Q})$ " means "the relation to a relation of the type of $Q$ of the class of relations like it and of the type of $P$ ." By a special definition, " $\text{NR}^{Q}(P)$ " is to mean all typically definite relation-numbers of the form " $\text{Nr}(P_{Q})ʻR$ ," i.e. all relation-numbers generated by the relation $\text{Nr}(P_{Q})$ , i.e. the domain of $\text{Nr}(P_{Q})$ .

Existence-theorems in this subject can be proved by means of *154·14, which states that relations like $Q$ exist in the type of $P$ when, and only when, classes similar to $CʻQ$ exist in the type of $CʻP$ . In virtue of this proposition, the existence-theorems of our present topic are deducible from those for cardinals. In symbols, this proposition is

*154·14. $\vdash :\exists !\text{Nr}(P)ʻQ.\equiv .\exists !\text{Nc}(CʻP)ʻCʻQ$

The remaining propositions are chiefly analogues of those in *102. Very few of them are subsequently referred to.

*154·1. $\vdash : \exists ! \text{Rl}ʻP \cap \text{Nr}ʻQ . \supset . \exists ! \text{Cl}ʻCʻP \cap \text{Nc}ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*152·1.\supset \vdash :\text{Hp}.&\supset .(\exists R).R\,\unicode{x2abd}\, P.R\,\text{smor}\,Q.\\ [*151·18] &\supset .(\exists R).R\,\unicode{x2abd}\, P.CʻR\text{ sm }CʻQ.\\ [*33·265] &\supset .(\exists R).CʻR\subset CʻP.CʻR\text{ sm }CʻQ.\\ [*100·1] &\supset .\exists !\text{Cl}ʻCʻP\cap \text{Nc}ʻCʻQ:\supset \vdash .\text{Prop} \end{array}$

*154·11. $\vdash :\exists !\text{Cl}ʻCʻP\cap \text{Nc}ʻCʻQ.\supset .(\exists R).R\,\text{smor}\,Q.CʻR\subset CʻP$

Dem. $\begin{array}{l} \vdash .*100·1.*73·1.\supset \vdash :\text{Hp}.&\supset .(\exists S).S\in 1\rightarrow 1.\text{D}ʻS\subset CʻP.\text{ᗡ}ʻS=CʻQ.\\ [*151·1] &\supset .(\exists S).\text{D}ʻS\subset CʻP.S^{;}Q\text{smor}Q.\\ [*150·203] & \supset .(\exists S).CʻS^{;}Q\subset CʻP.S^{;}Q\text{smor}Q:\supset \vdash .\text{Prop} \end{array}$

*154·12. $\vdash :\exists !\text{Rl}ʻ(\alpha \uparrow \alpha )\cap \text{Nr}ʻQ.\equiv .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻCʻQ.\equiv .\text{Nc}ʻ\alpha \geq \text{Nc}ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*154·1.*35·9. &\supset \vdash :\exists !\text{Rl}ʻ(\alpha \uparrow \alpha )\cap \text{Nr}ʻQ.\supset .\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻCʻQ &\qquad \text{(1)}\\ \vdash .*154·11.*35·92.&\supset \vdash :\exists !\text{Cl}ʻ\alpha \cap \text{Nc}ʻCʻQ.\supset .\exists !\text{Rl}ʻ(\alpha \uparrow \alpha )\cap \text{Nr}ʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*154·121. $\vdash .\text{Rl}ʻ(t_{0}ʻCʻP\uparrow t_{0}ʻCʻP)=tʻP=t_{00}ʻCʻP$

Dem. $\begin{array}{l} \vdash .*64·5. &\supset \vdash .\text{Rl}ʻ(t_{0}ʻCʻP\uparrow t_{0}ʻCʻP)=tʻ(CʻP\uparrow CʻP) &\qquad \text{(1)}\\ \vdash .*64·201.&\supset \vdash .tʻ(CʻP\uparrow CʻP)=tʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*64·54.\supset \vdash .\text{Prop} \end{array}$

*154·13. $\vdash :\exists !tʻP\cap \text{Nr}ʻQ.\equiv .\exists !tʻCʻP\cap \text{Nc}ʻCʻQ.\equiv .\text{Nc}ʻt_{0}ʻCʻP\geq \text{Nc}ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*154·12 \frac{t_{0}ʻCʻP}{\alpha}.*154·121.\supset \\ \vdash :\exists !tʻP\cap \text{Nr}ʻQ.\equiv .\exists !\text{Cl}ʻt_{0}ʻCʻP\cap \text{Nc}ʻCʻQ &\qquad \text{(1)}\\ \vdash .(1).*63·65.*117·22\supset \vdash .\text{Prop} \end{array}$

*154·14. $\vdash :\exists !\text{Nr}(P)ʻQ.\equiv .\exists !\text{Nc}(CʻP)ʻCʻQ \quad[*154·13.(*65·04)]$

In virtue of *154·14 and the propositions of *102, *103, *104, *105, *106, we see that all homogeneous or ascending relation-numbers exist, while $\Lambda$ is a member of every descending type of relation-numbers. Remembering that the relations concerned must be homogeneous, we see that there are two kinds of steps by which their types may be raised, namely (1) from $P$ to relations of the type of $tʻCʻP\uparrow tʻCʻP$ , i.e. from $P$ to relations of the type of $CʻP\downarrow CʻP$ , or of $\iota ^{;}P$ ; (2) from $P$ to relations of the type of $tʻP\uparrow tʻP$ , i.e. from $P$ to relations of the type of $P\downarrow P$ , or of $\downarrow x^{;}P$ if $x\in t_{0}ʻCʻP$ . Thus repetitions of the two steps from $P$ to $\iota ^{;}P$ , and from $P$ to $\downarrow x^{;}P$ , where $x \in t_{0}ʻCʻP$ , will enable us, without changing the relation-number, to raise its type indefinitely. It will be observed that, in accordance with our general definitions for relative types, the type of $\iota^{;}P$ is $t^{11}ʻCʻP$ , and the type of $\downarrow x^{;}P$ (where $x\in t_{0}ʻCʻP$ ) is $t^{11}ʻP$ .

*154·2. $\vdash .\text{Nr}(X_{Y})ʻQ=\hat{P} \{P\text{smor}_{(X,Y)}Q\} \quad[*65·2.(*152·01)]$

*154·201. $\vdash .\text{Nr}(X)ʻQ=\text{Nr}ʻQ\cap tʻX \quad[\text{Proof as in *102·6}]$

*154·202. $\begin{align}&\vdash :P\in \text{Nr}(X_{Y})ʻQ.\equiv .P\in \text{Nr}(X)ʻQ.Q\in tʻY.\equiv .\\ &P\in \text{Nr}ʻQ.P\in tʻX.Q\in tʻY \quad[*152·2·201. (*65·1)]\end{align}$

*154·203. $\vdash :Q\in tʻY.\supset .\text{Nr}(X_{Y})ʻQ=\text{Nr}(X)ʻQ \quad[*154·202]$

When $Q$ belongs to any other type than $tʻY$ , $\text{Nr}(X_{Y})ʻQ$ is meaningless.

*154·21. $\vdash .\text{NR}^{Y}(X)=\hat{\lambda} \{(\exists Q).\lambda =\text{Nr}(X_{Y})ʻQ\} \quad[(*154·01)]$

*154·22. $\vdash .\text{NR}^{Y}(X)=\text{Nr}(X)ʻʻtʻY=(\cap tʻX)ʻʻ\text{Nr}ʻʻtʻY$

Dem. $\begin{array}{l} \vdash .*154·21·202.\supset \\ \vdash \colon\ldotp \lambda \in \text{NR}^{Y}(X).&\equiv :(\exists Q):P\in \lambda .\equiv _{P}.P\in \text{Nr}(X)ʻQ.Q\in tʻY:\\ [*63·108.*4·73] &\equiv :(\exists Q):Q\in tʻY:P\in \lambda .\equiv _{P}.P\in \text{Nr}(X)ʻQ:\\ [*20·43] &\equiv :(\exists Q):Q\in tʻY.\lambda =\text{Nr}(X)ʻQ:\\ [*37·6] &\equiv :\lambda \in \text{Nr}(X)ʻʻtʻY &\qquad \text{(1)}\\ \vdash .(1).*154·201.\supset \vdash .\text{Prop} \end{array}$

*154·23. $\vdash :\Lambda \in \text{NR}^{Q}(P).\equiv .\Lambda \in \text{NC}^{CʻQ}(CʻP).\equiv .\Lambda \in \text{NC}(CʻP)ʻʻtʻCʻQ$

Dem. $\begin{array}{l} \vdash .*154·22.\supset \vdash :\Lambda \in \text{NR}^{Q}(P).&\equiv .\Lambda \in \text{Nr}(P)ʻʻtʻQ.\\ [*37·6] &\equiv .(\exists R).R\in tʻQ.\Lambda =\text{Nr}(P)ʻR.\\ [*154·14.\text{Transp}] &\equiv .(\exists R).R\in tʻQ.\Lambda =\text{Nc}(CʻP)ʻCʻR.\\ [*64·24] &\equiv .(\exists R).CʻR\in tʻCʻQ.\Lambda =\text{Nc}(CʻP)ʻCʻR.\\ [*35·942] &\equiv .(\exists \alpha ).\alpha \in tʻCʻQ.\Lambda =\text{Nc}(CʻP)ʻ\alpha .\\ [*37·6] &\equiv .\Lambda \in \text{Nc}(CʻP)ʻʻtʻCʻQ. &\qquad \text{(1)}\\ [*102·62] &\equiv .\Lambda \in \text{NC}^{CʻQ}(CʻP) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*154·24. $\vdash :CʻQ=tʻCʻP.\supset .\text{Nr}(P)ʻQ=\Lambda \quad[*102·73.*154·14]$

*154·241. $\vdash .\text{Nr}(P)ʻI\upharpoonright tʻCʻP=\Lambda \quad[*154·24]$

Dem. $\begin{array}{l} \vdash .*35·91.\supset \vdash .I\upharpoonright tʻCʻP&\,\unicode{x2abd}\, tʻCʻP\uparrow tʻCʻP\\ [*63·64] &\,\unicode{x2abd}\, t_{0}ʻ\iotaʻʻCʻP\uparrow t_{0}ʻ\iotaʻʻCʻP\\ [*150·22] &\,\unicode{x2abd}\, t_{0}ʻCʻ\iota ^{;}P\uparrow t_{0}ʻCʻ\iota ^{;}P &\qquad \text{(1)}\\ \vdash .(1).*154·121.&\supset \vdash .I\upharpoonright tʻCʻP\in tʻ\iota ^{;}P &\qquad \text{(2)}\\ \vdash .(2).*154·22·241.\supset \vdash .\text{Prop} \end{array}$

*154·25. $\vdash :CʻQ=t_{00}ʻCʻP.\supset .\text{Nr}(P)ʻQ=\Lambda \quad[*106·53.*154·14]$

Dem. $\begin{array}{l} \vdash .*154·23.\supset \vdash :\Lambda \in \text{NR}^{P\downarrow P}(P).&\equiv .\Lambda \in \text{Nc}(CʻP)ʻʻtʻCʻ(P\downarrow P).\\ [*55·15] &\equiv .\Lambda \in \text{Nc}(CʻP)ʻʻtʻ\iota ʻP.\\ [*63·61] &\equiv .\Lambda \in \text{Nc}(CʻP)ʻʻtʻtʻP.\\ [*154·121] &\equiv .\Lambda \in \text{Nc}(CʻP)ʻʻtʻt_{00}ʻCʻP &\qquad \text{(1)}\\ \vdash .(1).*106·53.*104·264.\supset \vdash .\text{Prop} \end{array}$

*154·26. $\vdash :P\in tʻQ.\supset .\exists !\text{Nr}(P)ʻQ \quad[*64·231.*103·3·13.*154·14]$

*154·261. $\vdash :CʻP\in t^{2}ʻCʻQ.\supset .\exists !\text{Nr}(P)ʻQ \quad[*104·21·1.*154·14]$

*154·262. $\vdash :CʻP\in t_{00}ʻCʻQ.\supset .\exists !\text{Nr}(P)ʻQ \quad[*106·21·1.*154·14]$

The following propositions are concerned with the two particular transformations from $P$ to $\iota ^{;}P$ and from $P$ to $x\downarrow ^{;}P$ , which are useful in raising the type of a relation-number.

Dem. $\begin{array}{l} \vdash .*154·121.*150·22.\supset \vdash .tʻ\iota ^{;}P&=\text{Rl}ʻ(t_{0}ʻ\iotaʻʻCʻP\uparrow t_{0}ʻ\iotaʻʻCʻP)\\ [*63·64] &=\text{Rl}ʻ(tʻCʻP\uparrow tʻCʻP)\\ [*64·56] &=t^{11}ʻCʻP.\supset \vdash .\text{Prop} \end{array}$

*154·311. $\vdash .\exists !\text{Nr}(t^{11}ʻCʻP)ʻP \quad[*154·31.*152·6]$

*154·32. $\vdash :x\in t_{0}ʻCʻP.\supset .tʻx\downarrow ^{;}P=t^{11}ʻP.t_{0}ʻx\downarrowʻʻCʻP=tʻP$

Dem. $\begin{array}{l} \vdash .*154·121.*150·22.&\supset \vdash .tʻx\downarrow ^{;}P=\text{Rl}ʻ\{(t_{0}ʻx\downarrowʻʻCʻP)\uparrow (t_{0}ʻx\downarrowʻʻCʻP)\} &\qquad \text{(1)}\\ \vdash .*64·52. &\supset \vdash :x,y\in t_{0}ʻCʻP.\supset .x\downarrow y\in tʻ(t_{0}ʻCʻP\uparrow t_{0}ʻCʻP).\\ [*154·121] &\supset .x\downarrow y\in tʻP &\qquad \text{(2)}\\ \vdash .(2). &\supset \vdash :x\in t_{0}ʻCʻP.\supset .x\downarrowʻʻCʻP\subset tʻP.\\ [*63·21] &\supset .t_{0}ʻx\downarrowʻʻCʻP=tʻP &\qquad \text{(3)}\\ \vdash .(1).(3). \supset \vdash :\text{Hp}.\supset .tʻx\downarrow ^{;}P&=\text{Rl}ʻ(tʻP\uparrow tʻP)\\ [*64·56] &= t^{11}ʻP &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*154·321. $\vdash .\exists !\text{Nr}(t^{11}ʻP)ʻP \quad[*154·32.*152·62.*63·18]$

*154·322. $\vdash :x\in t_{0}ʻCʻP.\supset .tʻ\downarrow x^{;}P=t^{11}ʻP \quad[\text{Proof as in *154·32}]$

*154·33. $\vdash :x\in t_{0}ʻCʻP.\supset .tʻP\downarrow ^{;}x\downarrow ^{;}P=t^{11}ʻ\dot{s} ʻt^{11}ʻP$

Dem. $\begin{array}{l} \vdash .*154·32. \supset \vdash :\text{Hp}.&\supset .P\in t_{0}ʻx\downarrowʻʻCʻP.\\ [*150·22] &\supset .P\in t_{0}ʻCʻx\downarrow ^{;}P.\\ [*154·32] \supset .tʻP\downarrow ^{;}x\downarrow ^{;}P&=t^{11}ʻx\downarrow ^{;}P\\ [*64·23] & =t^{11}ʻ\dot{s} ʻtʻx\downarrow ^{;}P\\ [*154·32] & =t^{11}ʻ\dot{s} ʻt^{11}ʻP:\supset \vdash .\text{Prop} \end{array}$

*154·331. $\vdash .\exists !\text{Nr}(t^{11}ʻ\dot{s} ʻt^{11}ʻP) \quad[*154·33.*152·62.*63·18]$

*154·4. $\begin{align}\vdash .\text{Nr}(X_{Y})ʻQ=\hat{P} \{(\exists S).S\in 1\rightarrow 1.&\text{ᗡ}ʻS=CʻQ.P=S^{;}Q.\\ &\text{D}ʻS\in tʻCʻX.\text{ᗡ}ʻS\in tʻCʻY\}\end{align}$

Dem. $\begin{array}{l} \vdash .*154·202.*152·1.\supset \\ \vdash \colon\ldotp P\in \text{Nr}(X_{Y})ʻQ.&\equiv :(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻQ.P=S^{;}Q:P\in tʻX.Q\in tʻY:\\ [*64·24] & \equiv :(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻQ.P=S^{;}Q.CʻP\in tʻCʻX.\\ &CʻQ\in tʻCʻY:\\ [*13·193.*150·23] &\equiv :(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻQ.P=S^{;}Q.\\ &\text{D}ʻS\in tʻCʻX.\text{ᗡ}ʻS\in tʻCʻY\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*154·401. $\begin{align}&\vdash .\text{Nr}(X_{Y})ʻQ=\hat{P} \{\exists !(P\,\overline{\text{smor}}\,Q)\cap tʻ(CʻX\uparrow CʻY)\}\\ &[*154·4.*151·11.*64·63]\end{align}$

The remaining propositions of this number (except *154·9) are the analogues of those whose numbers have the same decimal part in *102. They are here given without proof, because the proofs are, step by step, analogous to the proofs of the corresponding propositions in *102.

*154·41. $\vdash :P\in \text{Nr}(X_{Z})ʻR.Q\in \text{Nr}(Y_{Z})ʻR.\supset .P\in \text{Nr}(X_{Y})ʻQ.Q\in \text{Nr}(Y_{X})ʻP$

*154·46. $\vdash :P\in \text{Nr}(X_{Y})ʻQ.\equiv .Q\in \text{Nr}(Y_{X})ʻP.\equiv .P\,\text{smor}\,Q.P\in tʻX.Q\in tʻY$

*154·52. $\vdash :\exists !\text{Nr}(X_{Y})ʻQ.\supset .\text{Nr}(X_{Y})ʻQ\in \text{NR}^{X}(X)$

*154·55. $\vdash :\Lambda {\sim}\in \text{NR}^{X}(Y).\supset .\text{NR}^{Y}(X)-\iota ʻ\Lambda =\text{NR}^{X}(X)$

*154·64. $\vdash :\mu \in \text{NR}.\exists !\mu .\supset .(\exists P,Q).\mu =\text{Nr}(P)ʻQ$

*154·641. $\vdash :\mu \in \text{NR}.\supset .(\exists P,Q).\mu =\text{Nr}(P)ʻQ \quad[*154·64·241]$

*154·8. $\vdash :P\in \text{Nr}(X_{Y})ʻQ.P\,\text{smor}\,R.R\in tʻS.\supset .R\in \text{Nr}(S_{Y})ʻQ.R\in \text{Nr}(S_{X})ʻP$

*154·81. $\vdash :P\in \text{Nr}(X_{Y})ʻQ.\supset .\text{smor}ʻʻ\text{Nr}(X_{Y})ʻQ\cap tʻS=\text{Nr}(S_{Y})ʻQ=\text{Nr}(S_{X})ʻP$

*154·82. $\vdash :\mu \in \text{NR}^{Y}(X).\exists !\mu .\supset .\text{smor}ʻʻ\mu \cap tʻS\in \text{NR}^{Y}(S)$

*154·83. $\begin{align}\vdash :\mu \in \text{NR}^{Y}(X).\nu =&\text{smor}ʻʻ\mu \cap tʻS.\exists !\nu .\supset .\\ &\text{smor}ʻʻ\mu \cap tʻS=\text{smor}ʻʻ\nu \cap tʻS.\mu =\text{smor}ʻʻ\nu \cap tʻX\end{align}$

*154·84. $\vdash :(\exists P).P\,\text{smor}\,X.P\in tʻX.Q\,\text{smor}\,P.\equiv .Q\,\text{smor}\,X$

*154·86. $\vdash :\mu =\text{Nr}(X)ʻQ.\exists !\mu .\supset .\text{smor}_{Y}ʻʻ\mu =\text{Nr}(Y)ʻQ$

*154·861. $\vdash .\text{smor}_{X}ʻʻ\text{smor}_{Y}ʻʻ\mu \subset \text{smor}_{X}ʻʻ\mu$

*154·87. $\vdash :\mu =\text{Nr}(Y)ʻQ.\exists !\text{Nr}(X)ʻQ.\supset .\text{smor}_{P}ʻʻ\mu =\text{smor}_{P}ʻʻ\text{smor}_{X}ʻʻ\mu$

*154·88. $\begin{align}\vdash :\mu =\text{Nr}(Y)ʻQ.\exists !&\text{smor}_{P}ʻʻ\mu .\supset .\\ &\text{smor}_{P}ʻʻ\mu =\text{Nr}(P)ʻQ.\text{smor}_{X}ʻʻ\mu =\text{Nr}(X)ʻQ.\\ &\text{smor}_{X}ʻʻ\mu =\text{smor}_{X}ʻʻ\text{smor}_{P}ʻʻ\mu =\text{smor}_{X}ʻʻ\text{Nr}(P)ʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*37·29.\supset \vdash :\mu =\Lambda .\supset .\mu =Cʻʻ\Lambda . [*154·241] \supset .\mu \in Cʻʻʻ\text{NR} &\qquad \text{(1)}\\ \vdash .*37·29.\supset \vdash :\nu =\Lambda .\supset .Cʻʻ\nu =\Lambda . [*102·73] \supset .Cʻʻ\nu \in \text{NC} &\qquad \text{(2)}\\ \vdash .(1).(2).*152·72.\supset \vdash .\text{Prop} \end{array}$

A relation-number is called homogeneous when it is generated by a homogeneous relation of likeness, i.e. when it consists of all relations which are like a given relation $P$ and of the same type as $P$ . For the homogeneous relation-number of $P$ we write " $\text{N}_{0}\text{r}ʻP$ "; thus $\text{N}_{0}\text{r}ʻP=\text{Nr}ʻP\cap tʻP$ . When $P$ is given, $\text{N}_{0}\text{r}ʻP$ is typically definite. We have always $P\in \text{N}_{0}\text{r}ʻP$ , hence $\exists !\text{N}_{0}\text{r}ʻP$ . Conversely, if a typically definite relation-number is not null, it is a homogeneous relation-number; in fact, if $P$ is a member of it, it is $\text{N}_{0}\text{r}ʻP$ . Thus the homogeneous relation-numbers are all the relation-numbers except $\Lambda$ .

Homogeneous relation-numbers play the same part in relation-arithmetic as homogeneous cardinals play in cardinal arithmetic. The propositions of this number (except *155·6 ·61) are the analogues of those with the same decimal part in *103. Their proofs are exactly analogous to the proofs of their analogues in *103, and are therefore omitted.

*155·11. $\vdash :Q\in \text{N}_{0}\text{r}ʻP.\equiv .Q\,\text{smor}\,P.Q\in tʻP.\equiv .Q\in \text{Nr}ʻP.Q\in tʻP$

*155·16. $\vdash :\text{N}_{0}\text{r}ʻP=\text{Nr}ʻQ.\equiv .\text{Nr}ʻP=\text{Nr}ʻQ$

This proposition is used in the theory of well-ordered series (*253 and *255). It requires that the equation " $\text{Nr}ʻP=\text{Nr}ʻQ$ " on the right-hand side should be subject to the convention $\text{AT}$ . Otherwise, the typical ambiguities might be so determined as to give $\text{Nr}ʻP=\text{Nr}ʻQ=\Lambda$ , which would not imply $\text{N}_{0}\text{r}ʻP=\text{Nr}ʻQ$ .

*155·2. $\vdash :\mu \in \text{N}_{0}\text{R}.\equiv .(\exists P).\mu =\text{Nr}ʻP\cap tʻP.\equiv .(\exists P).\mu =\text{N}_{0}\text{r}ʻP$

*155·26. $\vdash \colon\ldotp \mu \in \text{NR}.\supset :P\in \mu .\equiv .\text{N}_{0}\text{r}ʻP=\mu$

*155·27. $\vdash :\mu =\text{N}_{0}\text{r}ʻP.\equiv .\mu \in \text{NR}.P\in \mu$

This last proposition connects homogeneous relation-numbers with homogeneous cardinals.

*155·11. $\vdash :Q\in \text{N}_{0}\text{r}ʻP. =.Q\,\text{smor}\,P.Q\in tʻP.\equiv .Q\in \text{Nr}ʻP.Q\in tʻP$

*155·14. $\vdash :\text{N}_{0}\text{r}ʻP=\text{N}_{0}\text{r}ʻQ.\equiv .P\in \text{N}_{0}\text{r}ʻQ.\equiv .Q\in \text{N}_{0}\text{r}ʻP.\equiv .P\,\text{smor}\,Q.Q\in tʻP$

*155·15. $\vdash :\exists !\text{N}_{0}\text{r}ʻP\cap \text{N}_{0}\text{r}ʻQ.\equiv .\text{N}_{0}\text{r}ʻP=\text{N}_{0}\text{r}ʻQ$

*155·16. $\vdash :\text{N}_{0}\text{r}ʻP=\text{Nr}ʻQ.\equiv .\text{Nr}ʻP=\text{Nr}ʻQ$

*155·2. $\vdash :\mu \in \text{N}_{0}\text{R}.\equiv .(\exists P).\mu =\text{Nr}ʻP\cap tʻP.\equiv .(\exists P).\mu =\text{N}_{0}\text{r}ʻP$

*155·21. $\vdash .\text{N}_{0}\text{r}ʻP\in \text{N}_{0}\text{R}.\text{N}_{0}\text{r}ʻP\in \text{NR}$

*155·25. $\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{R}.\supset :\exists !\mu \cap \nu .\equiv .\mu =\nu$

*155*26. $\vdash \colon\ldotp \mu \in \text{NR}.\supset :P\in \mu .\equiv .\text{N}_{0}\text{r}ʻP=\mu$

*155*27. $\vdash :\mu =\text{N}_{0}\text{r}ʻP.\equiv .\mu \in \text{NR}.P\in \mu$

*155·28. $\vdash :(\exists R).R\,\text{smor}\,P.\mu =\text{N}_{0}\text{r}ʻR.\equiv .\exists !\mu .\mu = \text{Nr}ʻP$

*155·3. $\vdash :Q\in tʻP.\supset .\text{N}_{0}\text{r}ʻQ=\text{Nr}(P)ʻQ=\text{Nr}(P_{P})ʻQ=\text{Nr}ʻQ\cap tʻP$

*155·31. $\vdash :\exists !\text{Nr}(X_{Y})ʻQ.\supset .\text{Nr}(X_{Y})ʻQ\in \text{N}_{0}\text{R}(X)$

*155·32. $\vdash .\text{NR}^{Y}(X)-\iota ʻ\Lambda \subset \text{N}_{0}\text{R}(X)$

*155·33. $\vdash .\text{NR}(X)-\iota ʻ\Lambda \subset \text{N}_{0}\text{R}(X)$

*155·35. $\vdash :\Lambda {\sim}\in \text{NR}^{X}(Y).\supset .\text{NR}^{Y}(X)-\iota ʻ\Lambda =\text{N}_{0}\text{R}(X)$

*155·41. $\vdash .\text{smor}ʻʻ\text{N}_{0}\text{r}ʻP\cap tʻQ=\text{Nr}(Q)ʻP$

*155·42. $\vdash :Q\,\text{smor}\,P.\equiv .\text{Nr}(Q)ʻP=\text{N}_{0}\text{r}ʻQ$

*155·43. $\vdash :\mu \in \text{NR}.\supset .\text{smor}ʻʻ\mu \cap t_{0}ʻ\mu =\mu$

*155·44. $\vdash \colon\ldotp \mu ,\nu \in \text{N}_{0}\text{R}.\supset :\mu =\text{smor}ʻʻ\nu .\equiv .\nu =\text{smor}ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*100·11.*103·11.&\supset \vdash \colon\ldotp \alpha \in \text{N}_{0}\text{c}ʻCʻP.\equiv :\\ &\alpha \in tʻCʻP:(\exists S).S\in 1\rightarrow 1.\text{D}ʻS=\alpha .\text{ᗡ}ʻS=CʻP:\\ [*150·23] &\equiv :\alpha \in tʻCʻP:(\exists S).S\in 1\rightarrow 1.CʻS^{;}P=\alpha .\text{ᗡ}ʻS=CʻP:\\ [*151·11] &\equiv :\alpha \in tʻCʻP:(\exists Q).Q\,\text{smor}\,P.\alpha =CʻQ:\\ [*64·24] &\equiv :(\exists Q).Q\,\text{smor}\,P.Q\in tʻP.\alpha =CʻQ:\\ [*152·11.*155·11] &\equiv :\alpha \in Cʻʻ\text{N}_{0}\text{r}ʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*155·61. $\vdash .Cʻʻʻ\text{N}_{0}\text{R}=\text{N}_{0}\text{C} \quad[*155·6]$

On ascending and descending relation-numbers, propositions analogous to those of *104, *105, and *106 might be proved by proofs analogous to those given in those numbers. It is, however, scarcely necessary to add anything to the propositions already proved, namely *154·24 ·241 ·242 ·25 ·251 on descending relation-numbers, *154·26 ·261 ·262 ·31 ·311 ·32 ·321 ·322 ·33 ·331 on ascending relation-numbers, and *155·23 ·34 giving the relations of non-homogeneous to homogeneous relation-numbers. Ascending relation-numbers all exist, and those that start from the type of $P$ , wherever they end[13], are the correspondents[14] of the homogeneous relation-numbers of the type of $P$ , and are only some of the homogeneous relation-numbers of the type in which they end. Descending relation-numbers consist of $\Lambda$ together with the homogeneous relation-numbers of the type in which they end: they are the correspondents of only some of the type in which they begin, or rather, $\Lambda$ is the common correspondent of all those relation-numbers in the initial type which are not correspondents of any homogeneous relation-number in the end-type. These properties are exactly the same as in the case of cardinals, as might be foreseen by *154·14.

FOOTNOTES:

[13] We say that $\text{Nr}(P)ʻQ$ starts from the type of $Q$ and ends in the type of $P$ .

[14] We call two typically definite relation-numbers correspondents when they only differ as to the typical determination, i.e. $\text{Nr}(X)ʻP$ and $\text{Nr}(Y)ʻP$ are correspondents.

In the present section, we have to consider the kind of addition of relations which is required in ordinal arithmetic. In cardinal arithmetic, if $\kappa$ is a class of mutually exclusive classes, $sʻ\kappa$ has the properties required of their sum, and thus we do not require a new kind of logical addition before dealing with arithmetical addition. But in ordinal arithmetic this is not so. Suppose $P$ and $Q$ are the generating relations of two series, and we wish to add the $Q$ -series at the end of the $P$ -series. Then we wish every term of the $P$ -series to precede every term of the $Q$ -series; thus $P\unicode{x228d} Q$ is not the generating relation of the new series, since $P\unicode{x228d} Q$ gives no relation between the terms of the $P$ -series and the terms of the $Q$ -series. The relation we want is $P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ,$ since this makes every term of the $P$ -series precede every term of the $Q$ -series. Hence we put $P\unicode{x2909}Q = P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ \quad\text{Df}.$ It will be seen that $P\unicode{x2909}Q$ is in general different from $Q\unicode{x2909}P$ .

If $CʻP$ and $CʻQ$ have no common terms, the sum of the relation-numbers of $P$ and $Q$ is the relation-number of $P\unicode{x2909}Q$ (cf. *180).

The addition of a single term to a series requires a new definition, and cannot be dealt with as a particular case of the addition of two relations. It might be thought that, just as $\alpha \cup \iota ʻx$ gives the result of adding the one term $x$ to the class $\alpha$ , so $P\unicode{x2909}(x\downarrow x)$ would give the result of adding the one term $x$ to the series $P$ . But this is not the case, since, when we add a term to a series, we do not want this term to precede itself, whereas $P\unicode{x2909}(x\downarrow x)$ is a relation which $x$ has to itself. What we want is a relation which every member of $CʻP$ has to $x$ but which $x$ does not have to itself; thus we take $P\unicode{x228d} CʻP\uparrow \iota ʻx$ as our relation, and put $P\unicode{x21f8}x=P\unicode{x228d} CʻP\uparrow \iota ʻx \quad\text{Df}.$ [Pg 348] This definition defines the generating relation of the series obtained by adding $x$ at the end of the $P$ -series; similarly for adding $x$ at the beginning we put $x\unicode{x21f7}P=\iota ʻx\uparrow CʻP\unicode{x228d} P \quad\text{Df}.$ If $x$ is not a member of $CʻP$ , the relation-number of $P\unicode{x21f8}x$ is the sum of the relation-number of $P$ and the ordinal 1, which we represent by $\dot{1}$ . (The ordinal 1 has no meaning by itself, but only as a summand.)

The sum of a series of series is defined in the same way as the sum of two series was defined. Let $P$ be a serial relation whose field consists of serial relations. Then the sum of all the series generated by members of $CʻP$ , when these series are taken in the order generated by $P$ , must be a relation which holds between $x$ and $y$ whenever either (1) $x$ and $y$ both belong to the field of one of the series, and $x$ precedes $y$ in this series, or (2) $x$ belongs to the field of an earlier series than that to which $y$ belongs. In the first case, we have $(\exists Q) . Q\in CʻP.xQy$ , i.e. $x (\dot{s} ʻCʻP)y$ . In the second case, we have $(\exists Q,R).QPR.x\in CʻQ.y\in CʻR$ , i.e. $(\exists Q,R).QPR.xFQ.yFR$ , i.e. $x(F^{;}P)y$ . Hence the generating relation of the sum of all the series is $\dot{s} ʻCʻP\unicode{x228d} F^{;}P$ . Hence we put $\Sigma ʻP=\dot{s} ʻCʻP\unicode{x228d} F^{;}P \quad\text{Df}.$ The relation $\Sigma ʻP$ has all the properties which we should expect of the sum of a series of series.

If a series is to result from the addition of a series of series, it is necessary that no two of the series should have any common terms. For if we have $QPR.x\in CʻQ\cap CʻR,$ we shall also have $x(\Sigma ʻP)x$ .

Hence instead of a series, we shall have cycles; for it is essential to a series that no term should precede itself. (What seem to be series in which there is repetition are always the result of a one-many correlation with series in which there is no repetition, so that a term can be counted once as the correlate of one term, and again as the correlate of a later term.) For this reason, as well as for many others, it is important to consider relations between mutually exclusive relations, i.e. between relations whose fields have no common terms. We put $\text{Rel}^{2}\text{excl}=\hat{P} \{Q,R\in CʻP.Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda\} \quad\text{Df}.$ Then $\text{Rel}^{2}\text{excl}$ has much the same utility in relation-arithmetic as $\text{Cls}^{2}\text{excl}$ has in cardinal arithmetic. We have $\vdash :R\in \text{Rel}^{2}\text{excl}.\equiv .F\upharpoonright CʻP\in \text{Cls}\rightarrow 1,$ which is analogous to the proposition (*84·14) $\vdash :\kappa \in \text{Cls}^{2} \text{excl}.\equiv .\in \upharpoonright \kappa \in \text{Cls}\rightarrow 1.$ [Pg 349] It will be found that in relation-arithmetic the relation $F$ often appears where ${\in}$ appears in the analogous proposition of cardinal arithmetic.

Analogous to " $\text{sm sm}$ " is the relation of double ordinal similarity. This holds between two relations $P$ and $Q$ when they are ordinally similar relations between ordinally similar relations with known correlators, i.e. when, if $T$ is an ordinal correlator of $P$ and $Q$ , so that $P = T^{;}Q$ , then if $X$ is a member of $CʻP$ , and $Y$ is the corresponding member of $CʻQ$ , so that $XTY$ , we shall have $X\,\text{smor}\,Y$ , and shall be able to specify a member of $X\,\overline{\text{smor}}\,Y$ . But as in cardinals, so here, we have to frame our definition of double ordinal similarity in such a way as to minimize the use of the multiplicative axiom. We therefore take as our definition the following: $P$ and $Q$ are said to have double ordinal similarity when there is a one-one relation $S$ which has $Cʻ\Sigma ʻQ$ for its converse domain, and is such that $P = S\dagger ^{;}Q$ . A relation $S$ which has these properties is called a double correlator of $P$ and $Q$ , i.e. we put $P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q = (1 \rightarrow 1) \cap \overleftarrow{\text{ᗡ}}ʻCʻ\Sigma ʻQ \cap \hat{S} (P = S\dagger ^{;}Q) \quad\text{Df},$ a definition which, as will be perceived, is closely analogous to that of $\kappa \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, \Lambda$ in *111. Two relations have double similarity when they have a double correlator, i.e. $\text{smor} \text{smor} = \hat{P} \hat{Q} \{\exists ! P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q\} \quad\text{Df}.$ $S$ is a double correlator of $P$ and $Q$ when $S$ is a correlator of $\Sigma ʻP$ and $\Sigma ʻQ$ and $S\dagger \upharpoonright CʻQ$ is a correlator of $P$ and $Q$ . This might be taken as the definition of a double correlator, since it is equivalent to the above definition.

If we assume the multiplicative axiom, we can prove that double similarity holds between similar relations of mutually exclusive similar relations, i.e. between two relations of mutually exclusive relations $P$ and $Q$ which have a correlator $S$ such that, if $Y \in CʻQ$ , then $Y$ and $SʻY$ are always similar. In this case, $S \,\unicode{x2abd}\, \text{smor}$ . Thus if we assume the multiplicative axiom we have, if $P$ , $Q \in\text{Rel}^{2}\text{excl}$ , $P \,\text{smor}\,\text{smor}\,Q . \equiv . \exists ! P\,\overline{\text{smor}}\,Q \cap \text{Rl}ʻ\text{smor}.$ In the particular case in which the fields of $P$ and $Q$ consist of well-ordered relations (i.e. relations generating well-ordered series), this equivalence can be proved without the use of the multiplicative axiom, because two similar well-ordered relations have only one correlator, so that the difficulty of selecting among correlators does not arise.

Double ordinal correlators have the same importance in proving the formal laws of relation-arithmetic that double cardinal correlators have in cardinal arithmetic. The construction of double correlators in various cases constitutes a large part of relation-arithmetic.

In defining the ordinal product of two relation-numbers, and in defining exponentiation, we use a relation which has properties [Pg 350]analogous to those of $\alpha \downarrow_{,,}ʻʻ\beta$ . This relation is $P\downarrow_{.,} ^{;}Q$ , of which the structure is as follows: Let $z$ , $w$ be two terms having the relation $Q$ ; then form the two relations $\downarrow z^{;}P$ , $\downarrow w^{;}P$ . The relation $\downarrow z^{;}P$ holds between two couples $x\downarrow z$ and $y\downarrow z$ whenever $xPy$ ; thus it arranges couples whose referents are members of $CʻP$ , and whose relata are $z$ , in an order similar to $P$ . The relations $\downarrow z^{;}P$ and $\downarrow w^{;}P$ are (by *150·03) the same as $P\downarrow_{.,}z$ and $P\downarrow_{.,} w$ . Thus $P\downarrow_{.,} ^{;}Q$ arranges such relations as $\downarrow z^{;}P$ in an order similar to $Q$ . Thus $P\downarrow_{.,} ^{;}Q$ is similar to $Q$ , and every member of its field is similar to $P$ . Thus the relation-number of $P\downarrow_{.,} ^{;}Q$ is $\text{Nr}ʻQ$ , and every member of its field has the relation-number $\text{Nr}ʻP$ . Moreover $P\downarrow_{.,} ^{;}Q$ , as it is easy to see, is a relation of mutually exclusive relations. Hence it is suitable for defining the product of $Q$ and $P$ , and we put $Q\times P = \Sigma ʻP\downarrow_{.,} ^{;}Q \quad\text{Df}.$ In the next section, after we have defined the product of a relation of relations, we shall use the same relation $P\downarrow_{.,} ^{;}Q$ for the definition of exponentiation, putting $P \,\,\text{exp}\,\, Q = \text{Prod}ʻP\downarrow_{.,} ^{;}Q \quad\text{Df}.$ These two definitions should be compared with those in *113 and *116.

In virtue of the definition of $\Sigma$ , the relation $\SigmaʻP\downarrow_{.,} ^{;}Q$ holds between terms which either have one of the relations of the form $P\downarrow_{.,} z$ , or belong respectively to the fields of two relations $P\downarrow_{.,}z$ , $P\downarrow_{.,} w$ , where $zQw$ . Thus the relation $\SigmaʻP\downarrow_{.,} ^{;}Q$ holds between $x\downarrow z$ and $y\downarrow z$ whenever $xPy$ and $z\in CʻQ$ , and also between $x\downarrow z$ and $y\downarrow w$ whenever $x,y\in CʻP.zQw$ . Thus if, for the sake of illustration, $P$ and $Q$ generate finite series, so that their fields are $\begin{aligned} 1_{P}, 2_{P} ..., \mu _{P},\\ 1_{Q}, 2_{Q} ..., \nu _{Q}, \end{aligned}$ then the field of $\Sigma ʻP\downarrow_{.,} ^{;}Q$ will consist of the couples $\begin{aligned} 1_{P}\downarrow 1_{Q}, 2_{P}\downarrow 1_{Q}, ..., \mu _{P}\downarrow 1_{Q};\\ 1_{P}\downarrow 2_{Q}, 2_{P}\downarrow 2_{Q}, ..., \mu _{P}\downarrow 2_{Q};\\ \ldots\ldots\ldots\ldots\ldots\ldots\ldots\ldots\ldots\ldots\\ 1_{P}\downarrow \nu _{Q}, 2_{P}\downarrow \nu _{Q}, ..., \mu _{P}\downarrow \nu _{Q}; \end{aligned}$ and their order as arranged by $\Sigma ʻP\downarrow_{.,} ^{;}Q$ is that in which they are written above. Thus the above couples in the above order constitute the series $Q\times P$ , and it is evident that this series has $\nu \times \mu$ terms.

When the factors of a product are not enumerated, but are given as the field of a relation, a new definition of multiplication is required. This definition, which has the advantage of being applicable to infinite products, will be dealt with in the following section.

In this number, we introduce the definition $P\unicode{x2909}Q=P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ \quad\text{Df},$ which was explained in the introduction to this section. Although the propositions of this and other numbers in this Part do not require that $P$ and $Q$ should be such as to generate series, yet the reader will find it convenient to imagine them to be such, since the important applications of the ideas of this Part are to series. Thus we may regard the sum of $P$ and $Q$ as a relation which holds between $x$ and $y$ when either $x$ precedes $y$ in the $P$ -series, or $x$ precedes $y$ in the $Q$ -series, or $x$ belongs to the $P$ -series and $y$ belongs to the $Q$ -series.

*160·31. $\vdash .(P\unicode{x2909}Q)\unicode{x2909}R=P\unicode{x2909}(Q\unicode{x2909}R)$

*160·4. $\vdash .(P\unicode{x228d} Q)\unicode{x2909}R=(P\unicode{x2909}R)\unicode{x228d} (Q\unicode{x2909}R)$

*160·44. $\vdash :CʻP\subset \text{ᗡ}ʻS.CʻQ\subset \text{ᗡ}ʻS.\supset .S^{;}(P\unicode{x2909}Q)=S^{;}P\unicode{x2909}S^{;}Q$

*160·47. $\begin{align}\vdash :CʻP\cap CʻQ=\Lambda .CʻP'\cap CʻQ'=\Lambda .&S\in P\,\overline{\text{smor}}\,P'.T\in Q\overline{\text{smor}} Q'.\supset .\\ &S\unicode{x228d} T\in (P\unicode{x2909}Q)\overline{\text{smor}} (P'\unicode{x2909}Q')\end{align}$

*160·48. $\begin{align}\vdash :CʻP\cap CʻQ=\Lambda .CʻP'\cap CʻQ'=\Lambda .P\,\text{smor}\,P'.&Q\,\text{smor}\,Q'.\supset .\\ &P\unicode{x2909}Q\,\text{smor}\,P'\unicode{x2909}Q'\end{align}$

whence it follows that if $P$ and $Q$ are mutually exclusive, the relation-number of their sum depends only upon the relation-numbers of $P$ and $Q$ ;

*160·5. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)\unicode{x0294f}CʻP=P.(P\unicode{x2909}Q)\unicode{x0294f}CʻQ=Q$

*160·52. $\vdash :CʻP\cap CʻQ=\Lambda .CʻP\cap CʻR=\Lambda .P\unicode{x2909}Q=P\unicode{x2909}R.\supset .Q=R$

*160·01. $P\unicode{x2909}Q=P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ \quad\text{Df}$

*160·1. $\vdash .P\unicode{x2909}Q=P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ \quad[(*160·01)]$

*160·11. $\vdash \colon\ldotp x(P\unicode{x2909}Q)y.\equiv :xPy.\lor.xQy.\lor.x\in CʻP.y\in CʻQ \quad[*160·1]$

*160·111. $\vdash \colon\ldotp x(P\unicode{x2909}Q)y.\equiv :xPy.\lor.xQy.\lor.xFP.yFQ \quad[*160·11.*33·51]$

*160·12. $\vdash :\dot{\exists} !Q.\supset .\text{D}ʻ(P\unicode{x2909}Q)=CʻP\cup \text{D}ʻQ \quad[*33·26.*35·85.*160·1]$

*160·13. $\vdash :\dot{\exists} !P.\supset .\text{ᗡ}ʻ(P\unicode{x2909}Q)=\text{ᗡ}ʻP\cup CʻQ$

Dem. $\begin{array}{l} \vdash .*33·262.*160·1.&\supset \vdash .Cʻ(P\unicode{x2909}Q)=CʻP\cup CʻQ\cup Cʻ(CʻP\uparrow CʻQ) &\qquad \text{(1)}\\ \vdash .*35·85·86·88. &\supset \vdash .Cʻ(CʻP\uparrow CʻQ)\subset CʻP\cup CʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The above proposition is constantly used. The following propositions (*160·15—·161) are not used, but are inserted to show that $P\unicode{x2909}Q$ has the kind of structure that we should expect of a sum.

*160·15. $\vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻ(P\unicode{x2909}Q)=\overrightarrow{B}ʻP-CʻQ$

Dem. $\begin{array}{l} \vdash .*160·12·13.\supset \vdash :\dot{\exists} !P.\dot{\exists} !Q.\supset .\overrightarrow{B}ʻ(P\unicode{x2909}Q)&=(CʻP\cup \text{D}ʻQ)-(\text{ᗡ}ʻP\cup CʻQ)\\ [*93·101.*33·161] &=\overrightarrow{B}ʻP-CʻQ &\qquad \text{(1)}\\ \vdash .*160·1.\supset \vdash :Q=\dot{\Lambda} .&\supset .P\unicode{x2909}Q=P.\\ [*30·37] \supset .\overrightarrow{B}ʻ(P\unicode{x2909}Q)&=\overrightarrow{B}ʻP\\ [*33·241] &=\overrightarrow{B}ʻP-CʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*160·151. $\vdash :\dot{\exists} !Q.\supset .\overrightarrow{B}ʻ\text{Cnv}ʻ(P\unicode{x2909}Q)=\overrightarrow{B}ʻ\breve{Q} -CʻP$

*160·16. $\vdash :\dot{\exists} !P.\overrightarrow{B}ʻP\cap CʻQ=\Lambda .\supset .\overrightarrow{B}ʻ(P\unicode{x2909}Q)=\overrightarrow{B}ʻP \quad[*160·15]$

*160·161. $\vdash :\dot{\exists} !Q.\overrightarrow{B}ʻ\breve{Q} \cap CʻP=\Lambda .\supset .\overrightarrow{B}ʻ\text{Cnv}ʻ(P\unicode{x2909}Q)=\overrightarrow{B}ʻ\breve{Q}$

*160·2. $\vdash .\text{Cnv}ʻ(P\unicode{x2909}Q)=\breve{Q} \unicode{x2909}\breve{P} \quad[*31·15.*35·84]$

*160·3. $\vdash .(P\unicode{x2909}Q)\unicode{x2909}R=P\unicode{x228d} Q\unicode{x228d} R\unicode{x228d} CʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow CʻR\unicode{x228d} CʻQ\uparrow CʻR$

Dem. $\begin{array}{l} \vdash .*160·14·1.\supset \\ \vdash.(P\unicode{x2909}Q)\unicode{x2909}R&=(P\unicode{x2909}Q)\unicode{x228d} R\unicode{x228d} (CʻP\cup CʻQ)\uparrow CʻR\\ [*160·1.*35·41·82]&=P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ\unicode{x228d} R\unicode{x228d} CʻP\uparrow CʻR\unicode{x228d} CʻQ\uparrow CʻR.\supset \vdash .\text{Prop} \end{array}$

*160·31. $\vdash .(P\unicode{x2909}Q)\unicode{x2909}R=P\unicode{x2909}(Q\unicode{x2909}R)$

Dem. $\begin{array}{l} \vdash .*160·14·1.\supset \\ \vdash .P\unicode{x2909}(Q\unicode{x2909}R)=P\unicode{x228d} Q\unicode{x228d} R\unicode{x228d} CʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow CʻR\unicode{x228d} CʻQ\uparrow CʻR &\qquad \text{(1)}\\ \vdash .(1).*160·3.\supset \vdash .\text{Prop} \end{array}$

*160·32. $P\unicode{x2909}Q\unicode{x2909}R=(P\unicode{x2909}Q)\unicode{x2909}R \quad\text{Df}$

*160·33. $\vdash :P\,\unicode{x2abd}\, Q.\supset .P\unicode{x2909}R\,\unicode{x2abd}\, Q\unicode{x2909}R \quad[*33·265.*160·1]$

*160*34. $\vdash :R\,\unicode{x2abd}\, S.\supset .Q\unicode{x2909}R\,\unicode{x2abd}\, Q\unicode{x2909}S \quad [*33·265.*160·1]$

*160·35. $\vdash :P\,\unicode{x2abd}\, Q.R\,\unicode{x2abd}\, S.\supset .P\unicode{x2909}Q\,\unicode{x2abd}\, R\unicode{x2909}S \quad[*160*33*34]$

*160·4. $\vdash .(P\unicode{x228d} Q)\unicode{x2909}R=(P\unicode{x2909}R)\unicode{x228d} (Q\unicode{x2909}R)$

Dem. $\begin{array}{l} \vdash .*160·1. \supset \vdash .(P\unicode{x228d} Q)\unicode{x2909}R&=P\unicode{x228d} Q\unicode{x228d} R\unicode{x228d} Cʻ(P\unicode{x228d} Q)\uparrow CʻR\\ [*33·262.*23·56] & = P\unicode{x228d} R\unicode{x228d} Q\unicode{x228d} R\unicode{x228d} (CʻP\cup CʻQ)\uparrow CʻR\\ [*35·41·82] & =P\unicode{x228d} R\unicode{x228d} Q\unicode{x228d} R\unicode{x228d} CʻP\uparrow CʻR\unicode{x228d} CʻQ\uparrow CʻR\\ [*160·1] &=(P\unicode{x2909}R)\unicode{x228d} (Q\unicode{x2909}R).\supset \vdash .\text{Prop} \end{array}$

*160·401. $\vdash .P\unicode{x2909}(Q\unicode{x228d} R)=(P\unicode{x2909}Q)\unicode{x228d} (P\unicode{x2909}R)$

The above two propositions state the distributive law for logical and arithmetical addition. The three following propositions give the generalized form of this law, when $\dot{s} ʻ\lambda$ replaces $P\unicode{x228d} Q$ ; these propositions are not subsequently used but are inserted for the sake of their intrinsic interest.

*160·41. $\vdash :\exists !\lambda .\supset .\dot{s} ʻ\lambda \unicode{x2909}R=\dot{s} ʻ\unicode{x2909}Rʻʻ\lambda =\dot{s} ʻ(\lambda \unicode{x2909}R)$

Dem. $\begin{array}{l} \vdash .*41·11.\supset \vdash \colon\ldotp &x(\dot{s} ʻ\unicode{x2909}Rʻʻ\lambda )y.\equiv :(\exists P).P\in \lambda .x(P\unicode{x2909}R)y:\\ [*160·11] &\equiv :(\exists P):P\in \lambda :xPy.\lor.xRy.\lor.x\in CʻP.y\in CʻR: \\ [*10·42] &\equiv :(\exists P).P\in \lambda .xPy.\lor.(\exists P).P\in \lambda .xRy.\lor.\\ &(\exists P).P\in \lambda .x\in CʻP.y\in CʻR:\\ [*41·11.*10·35.*41·45] &\equiv :x(\dot{s} ʻ\lambda )y.\lor.\exists !\lambda .xRy.\lor.x\in Cʻ\dot{s} ʻ\lambda .y\in CʻR &\qquad \text{(1)}\\ \vdash .(1)\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp x(\dot{s}ʻ\unicode{x2909}Rʻʻ\lambda ).&\equiv :x(\dot{s} ʻ\lambda )y.\lor.xRy.\lor.x\in Cʻ\dot{s} ʻ\lambda .y\in CʻR:\\ [*160·11] & \equiv :x(\dot{s} ʻ\lambda \unicode{x2909}R)y\colon\colon \supset \vdash .\text{Prop} \end{array}$

*160·411. $\vdash :\exists !\lambda .\supset .P\unicode{x2909}\dot{s} ʻ\lambda =\dot{s} ʻP\unicode{x2909}ʻʻ\lambda \quad[\text{Proof as in *160*41}]$

*160·412. $\vdash :\exists !\lambda .\exists !\mu .\supset .\dot{s} ʻ\lambda \unicode{x2909}\dot{s} ʻ\mu = \dot{s} ʻsʻ\lambda \unicode{x2909}_{,,}ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*160·411. &\supset \vdash :\exists !\mu .\supset .\dot{s} ʻ\lambda \unicode{x2909}\dot{s} ʻ\mu =\dot{s} ʻ(\dot{s} ʻ\lambda )\unicode{x2909}ʻʻ\mu &\qquad \text{(1)}\\ \vdash .*160·41. &\supset \vdash :\exists !\lambda .\supset .(\dot{s} ʻ\lambda )\unicode{x2909}ʻʻ\mu =\dot{s}ʻʻ\lambda \unicode{x2909}_{,,}ʻʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\exists !\lambda .\exists !\mu .\supset .\dot{s} ʻ\lambda \unicode{x2909}\dot{s} ʻ\mu &=\dot{s} ʻ\dot{s}ʻʻ\unicode{x2909}_{,,}ʻʻ\mu \\ [*42·12] & =\dot{s} ʻsʻ\lambda \unicode{x2909}_{,,}ʻʻ\mu :\supset \vdash .\text{Prop} \end{array}$

*160·42. $\vdash .(P\unicode{x2909}Q)\mid S=P\mid S\unicode{x228d} Q\mid S\unicode{x228d} CʻP\uparrow \breve{S} ʻʻCʻQ$

Dem. $\begin{array}{l} \vdash .*160·1. \supset \vdash .(P\unicode{x2909}Q)\mid S&=P\mid S\unicode{x228d} Q\mid S\unicode{x228d} (CʻP\uparrow CʻQ)\mid S\\ [*37·8] &=P\mid S\unicode{x228d} Q\mid S\unicode{x228d} CʻP\uparrow \breve{S} ʻʻCʻQ.\supset \vdash .\text{Prop} \end{array}$

*160·421. $\vdash .S\mid (P\unicode{x2909}Q)=S\mid P\unicode{x228d} S\mid Q\unicode{x228d} SʻʻCʻP\uparrow CʻQ$

*160·43. $\vdash .S^{;}(P\unicode{x2909}Q)=S^{;}P\unicode{x228d} S^{;}Q\unicode{x228d} SʻʻCʻP\uparrow SʻʻCʻQ$

Dem. $\begin{array}{l} \vdash .*150·1.*160·421.\supset \\ \vdash .S^{;}(P\unicode{x2909}Q)&=(S\mid P\unicode{x228d} S\mid Q\unicode{x228d} SʻʻCʻP\uparrow CʻQ)\mid \breve{S} \\ [*150·1.*37·8]&=S^{;}P\unicode{x228d} S^{;}Q\unicode{x228d} SʻʻCʻP\uparrow SʻʻCʻQ.\supset \vdash .\text{Prop} \end{array}$

*160·44. $\vdash :CʻP\subset \text{ᗡ}ʻS.CʻQ\subset \text{ᗡ}ʻS.\supset .S^{;}(P\unicode{x2909}Q)=S^{;}P\unicode{x2909}S^{;}Q$

Dem. $\begin{array}{l} \vdash .*160·43.*150·22.\supset \\ \vdash :\text{Hp}.\supset .S^{;}(P\unicode{x2909}Q)&=S^{;}P\unicode{x228d} S^{;}Q\unicode{x228d} (CʻS^{;}P)\uparrow (CʻS^{;}Q)\\ [*160·1] &=S^{;}P\unicode{x2909}S^{;}Q:\supset \vdash .\text{Prop} \end{array}$

*160·45. $\begin{align}\vdash :S\upharpoonright (CʻP'\cup CʻQ')\in 1\rightarrow 1.&S\upharpoonright CʻP'\in P\,\overline{\text{smor}}\,P'.S\upharpoonright CʻQ'\in Q\overline{\text{smor}} Q'.\supset .\\ &S\upharpoonright Cʻ(P'\unicode{x2909}Q')\in (P\unicode{x2909}Q)\overline{\text{smor}} (P'\unicode{x2909}Q')\end{align}$

Dem. $\begin{array}{l} \vdash .*151·22.\supset \vdash :\text{Hp}.&\supset .CʻP'\subset \text{ᗡ}ʻS.CʻQ'\subset \text{ᗡ}ʻS.P=S^{;}P'.Q=S^{;}Q'. &\qquad \text{(1)}\\ [*160·44] &\supset .P\unicode{x2909}Q=S^{;}(P'\unicode{x2909}Q') &\qquad \text{(2)}\\ \vdash .(1).*160·14.&\supset \vdash :\text{Hp}.\supset .Cʻ(P'\unicode{x2909}Q')\subset \text{ᗡ}ʻS &\qquad \text{(3)}\\ \vdash .*160·14. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright Cʻ(P'\unicode{x2909}Q')\in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .(2).(3).(4).*151·22.\supset \vdash .\text{Prop} \end{array}$

*160·451. $\begin{align}\vdash :S\upharpoonright CʻP'\in P\overline{\text{smor}} &P'.S\upharpoonright CʻQ'\in Q\overline{\text{smor}} Q'.Sʻʻ(CʻP'-CʻQ')\cap CʻQ=\Lambda .\\ &\supset .S\upharpoonright Cʻ(P'\unicode{x2909}Q')\in (P\unicode{x2909}Q)\overline{\text{smor}} (P'\unicode{x2909}Q')\end{align}$

Dem. $\begin{array}{l} \vdash .*151·22.*150·22.\supset \vdash :\text{Hp}.&\supset .CʻQ=SʻʻCʻQ'.\\ [*71·381.*37·421] &\supset .Sʻʻ(CʻP'-CʻQ')\cap SʻʻCʻQ'=\Lambda .\\ [*74·823] &\supset .S\upharpoonright (CʻP'\cup CʻQ')\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*160·45.\supset \vdash .\text{Prop} \end{array}$

*160·452. $\begin{align}\vdash :S\upharpoonright CʻP'\in P\,\overline{\text{smor}}\,P'.&S\upharpoonright CʻQ'\in Q\overline{\text{smor}} Q'.CʻP\cap CʻQ=\Lambda .\supset .\\ &S\upharpoonright Cʻ(P'\unicode{x2909}Q')\in (P\unicode{x2909}Q)\overline{\text{smor}} (P'\unicode{x2909}Q')\end{align}$

Dem. $\begin{array}{l} \vdash .*151·22.*150·22.\supset \vdash :\text{Hp}.&\supset .CʻP-SʻʻCʻP'.CʻQ=SʻʻCʻQ'.\\ [\text{Hp}] &\supset .SʻʻCʻP'\cap SʻʻCʻQ'=\Lambda .\\ [*74·833] &\supset .S\upharpoonright Cʻ(P'\unicode{x2909}Q')\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*160·45.\supset \vdash .\text{Prop} \end{array}$

*160·46. $\begin{align}\vdash :CʻP=\text{ᗡ}ʻS.CʻQ=\text{ᗡ}ʻT.CʻP\cap Cʻ&Q=\Lambda .\supset .\\ &(S\unicode{x228d} T)^{;}(P\unicode{x2909}Q)=S^{;}P\unicode{x2909}T^{;}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*160·44.\supset \vdash :\text{Hp}.\supset .&(S\unicode{x228d} T)^{;}(P\unicode{x2909}Q)=(S\unicode{x228d} T)^{;}P\unicode{x2909}(S\unicode{x228d}T)^{;}Q\\ [*150·32] &=\{(S\unicode{x228d} T)\upharpoonright{CʻP}\}^{;}P\unicode{x2909}\{(S\unicode{x228d} T)\upharpoonright CʻQ\}^{;}Q\\ [*35·644.\text{Hp}] &=(S\upharpoonright CʻP)^{;}P\unicode{x2909}(T\upharpoonright CʻQ)^{;}Q\\ [*150·32] &=S^{;}P\unicode{x2909}T^{;}Q:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*151·11·131.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻS=CʻP.\text{D}ʻT=CʻQ.\text{ᗡ}ʻS=CʻP'.\\ &\text{ᗡ}ʻT=CʻQ'. &\qquad \text{(1)}\\ [\text{Hp}] &\supset .\text{D}ʻS\cap \text{D}ʻT=\Lambda .\text{ᗡ}ʻS\cap \text{ᗡ}ʻT=\Lambda .\\ [*151·11.*71·242] &\supset .S\unicode{x228d} T\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).*160·14.\supset \vdash :\text{Hp}.\supset .Cʻ(P'\unicode{x2909}Q')&=\text{ᗡ}ʻS\cup \text{ᗡ}ʻT\\ [*33·261] &=\text{ᗡ}ʻ(S\unicode{x228d} T) &\qquad \text{(3)}\\ \vdash .*160·46.*151·11.\supset \vdash :\text{Hp}.\supset .P\unicode{x2909}Q&=(S\unicode{x228d} T)^{;}(P'\unicode{x2909}Q') &\qquad \text{(4)}\\ \vdash .(2).(3).(4).*151·11.\supset \vdash .\text{Prop} \end{array}$

*160·48. $\begin{align}\vdash :CʻP\cap CʻQ=\Lambda .CʻP'\cap &CʻQ'=\Lambda .P\,\text{smor}\,P'.Q\text{smor}Q'.\supset .\\ &P\unicode{x2909}Q\,\text{smor}\,P'\unicode{x2909}Q' \quad[*160·47.*151·12]\end{align}$

*160·5. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)\unicode{x0294f}CʻP=P.(P\unicode{x2909}Q)\unicode{x0294f}CʻQ=Q$

Dem. $\begin{array}{l} \vdash .*160·1.*36·23.\supset \\ \vdash.(P\unicode{x2909}Q)\unicode{x0294f}CʻP&=P\unicode{x0294f}CʻP\unicode{x228d} (CʻP\uparrow CʻQ)\unicode{x0294f}CʻP\unicode{x228d} Q\unicode{x0294f}CʻP\\ [*36·29·33] &=P\unicode{x228d} \{(CʻP\uparrow CʻQ)\dot{\cap} (CʻP\uparrow CʻP)\}\unicode{x228d} Q\unicode{x0294f}CʻP &\qquad \text{(1)}\\ \vdash .*36·31. &\supset \vdash :\text{Hp}.\supset .Q\unicode{x0294f}CʻP=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .*35·834·88.&\supset \vdash :\text{Hp}.\supset .\{(CʻP\uparrow CʻQ)\dot{\cap} (CʻP\uparrow CʻP)\}=\dot{\Lambda} &\qquad \text{(3)}\\ \vdash .(1).(2).(3).&\supset \vdash :\text{Hp}.\supset .(P\unicode{x2909}Q)\unicode{x0294f}CʻP=P &\qquad \text{(4)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .(P\unicode{x2909}Q)\unicode{x0294f}CʻQ=Q &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*160·51. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)^{2}=P^{2}\unicode{x228d} Q^{2}\unicode{x228d} \text{D}ʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow \text{ᗡ}ʻQ$

Dem. $\begin{array}{l} \vdash .*34·73. &\supset \vdash :\text{Hp}.\supset .(P\unicode{x228d} Q)^{2}=P^{2}\unicode{x228d} Q^{2} &\qquad \text{(1)}\\ \vdash .*35·895.&\supset \vdash :\text{Hp}.\supset .(CʻP\uparrow CʻQ)^{2}=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .*34·62. &\supset \vdash .(P\unicode{x2909}Q)^{2}=(P\unicode{x228d} Q)^{2}\unicode{x228d} (CʻP\uparrow CʻQ)^{2}\\ &\unicode{x228d} (P\unicode{x228d} Q)\mid (CʻP\uparrow CʻQ)\unicode{x228d} (CʻP\uparrow CʻQ)\mid (P\unicode{x228d} Q)\\ [(1).(2)] &=P^{2}\unicode{x228d} Q^{2}\unicode{x228d} (P\unicode{x228d} Q)\mid (CʻP\uparrow CʻQ)\unicode{x228d} (CʻP\uparrow CʻQ)\mid (P\unicode{x228d} Q) &\qquad \text{(3)}\\ \vdash .*37·81. &\supset \vdash :\text{Hp}.\supset .(P\unicode{x228d} Q)\mid (CʻP\uparrow CʻQ)=\text{D}ʻP\uparrow CʻQ &\qquad \text{(4)}\\ \vdash .*37·8. &\supset \vdash :\text{Hp}.\supset .(CʻP\uparrow CʻQ)\mid (P\unicode{x228d} Q)=CʻP\uparrow \text{ᗡ}ʻQ &\qquad \text{(5)}\\ \vdash .(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

The above proposition is useful in proving that, if $CʻP\cap CʻQ=\Lambda$ , $P\unicode{x2909}Q$ is transitive when $P$ and $Q$ are transitive (cf. *201·4).

*160·52. $\vdash :CʻP\cap CʻQ=\Lambda .CʻP\cap CʻR=\Lambda .P\unicode{x2909}Q=P\unicode{x2909}R.\supset .Q=R$

Dem. $\begin{array}{l} \vdash .*160·14.\supset \vdash :\text{Hp}.&\supset .(P\unicode{x2909}Q)\unicode{x0294f}(-CʻP)=(P\unicode{x2909}Q)\unicode{x0294f}CʻQ.\\ &(P\unicode{x2909}Q)\unicode{x0294f}(-CʻP)=(P\unicode{x2909}R)\unicode{x0294f}CʻR.\\ [*160·5] &\supset .(P\unicode{x2909}Q)\unicode{x0294f}(-CʻP)=Q.(P\unicode{x2909}R)\unicode{x0294f}(-CʻP)=R.\\ [\text{Hp}] &\supset .Q=R:\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in dealing with the series of segments of a series (*213·561).

The addition of a term has two forms, according as it occurs at the beginning or end of the field of the relation in question. If we add first $x$ and then $y$ at the end, the result is the same as if we added $x\downarrow y$ (*161·22); if at the beginning, it is the same as if we added $y\downarrow x$ (*161·221). The propositions of the present number are all obvious, and offer no difficulties of any kind. As explained in the introduction to this section, we put $\begin{aligned} P\unicode{x21f8} x &= P\unicode{x228d} CʻP\uparrow {℩}ʻx \quad\text{Df},\\ x\unicode{x21f7}P &= {℩}ʻx\uparrow CʻP\unicode{x228d} P \quad\text{Df}. \end{aligned}$ Most of the propositions of this number require the hypothesis $\dot{\exists} !P$ , because if $P = \dot{\Lambda}$ , $P\unicode{x21f8} x = x\unicode{x21f7}P = \dot{\Lambda}$ (*161·2 ·201). This is connected with the fact that there is no ordinal number 1. Apart from propositions already mentioned, the chief propositions of this number are the following (we omit propositions about $x\unicode{x21f7}P$ when they are merely analogues of propositions about $P\unicode{x21f8} x$ ):

*161·12. $\vdash .x\unicode{x21f7}P = \text{Cnv}ʻ(\breve{P} \unicode{x21f8} x)$

*161·14. $\vdash :\dot{\exists} !P.\supset .Cʻ(P\unicode{x21f8} x) = CʻP\cup {℩}ʻx = Cʻ(x\unicode{x21f7}P)$

*161·15. $\begin{align}\vdash :\dot{\exists} !P.x &{\sim} \in CʻP.\supset .\\ &\overrightarrow{B}ʻ(P\unicode{x21f8} x) = \overrightarrow{B}ʻP.\overrightarrow{B}ʻ\text{Cnv}ʻ(P\unicode{x21f8} x) = {℩}ʻx.Bʻ(x\unicode{x21f7}\breve{P} ) = x\end{align}$

*161·211. $\vdash .x\unicode{x21f7}(y\downarrow z) = x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z = (x\downarrow y)\unicode{x21f8} z$

*161·31. $\begin{align}\vdash :P \,\text{smor} \,Q.x &{\sim} \in CʻP.y {\sim} \in CʻQ.\supset .\\ &P\unicode{x21f8} x \,\text{smor}\, Q\unicode{x21f8} y.x\unicode{x21f7}P \,\text{smor}\, y\unicode{x21f7}Q\end{align}$

*161·4. $\vdash :CʻQ\subset \text{ᗡ}ʻS.x\in \text{ᗡ}ʻS.S\in 1\rightarrow \text{Cls}.\supset S^{;}(Q\unicode{x21f8} x) = S^{;}Q\unicode{x21f8} Sʻx$

*161·01. $P\unicode{x21f8} x = P\unicode{x228d} CʻP\uparrow {℩}ʻx \quad\text{Df}$

*161·02. $x\unicode{x21f7}P = {℩}ʻx\uparrow CʻP\unicode{x228d} P \quad\text{Df}$

*161·1. $\vdash .P\unicode{x21f8} x = P\unicode{x228d} CʻP\uparrow {℩}ʻx \quad[(*161·01)]$

*161·101. $\vdash .x\unicode{x21f7}P = {℩}ʻx\uparrow CʻP\unicode{x228d} P \quad[(*161·02)]$

*161·11. $\vdash \colon\ldotp y(P\unicode{x21f8} x)z.\equiv :yPz.\lor.y\in CʻP.z = x \quad[*161·1]$

*161·111. $\vdash \colon\ldotp y(x\unicode{x21f7}P)z.\equiv :y=x.z\in CʻP.\lor.yPz \quad[*161·101]$

*161·12. $\vdash .x\unicode{x21f7}P=\text{Cnv}ʻ(\breve{P} \unicode{x21f8} x) \quad[*161·1·101.*35·84.*33·22]$

*161·13. $\vdash .\text{D}ʻ(P\unicode{x21f8} x)=CʻP.\text{ᗡ}ʻ(x\unicode{x21f7}P)=CʻP$

Dem. $\begin{array}{l} \vdash .*161·1.\supset \vdash .\text{D}ʻ(P\unicode{x21f8} x)&=\text{D}ʻP\cup \text{D}ʻ(CʻP\uparrow \iota ʻx)\\ [*35·85] &=\text{D}ʻP\cup CʻP\\ [*33·161] &=CʻP &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash .\text{ᗡ}ʻ(x\unicode{x21f7}P)&=CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash . \text{Prop} \end{array}$

*161·131. $\begin{align}&\vdash :\dot{\exists} !P.\supset .\text{ᗡ}ʻ(P\unicode{x21f8} x)=\text{ᗡ}ʻP\cup \iota ʻx.\text{D}ʻ(x\unicode{x21f7}P)=\text{D}ʻP\cup \iota ʻx\\ &[*35·86.*161·1]\end{align}$

*161·14. $\vdash :\dot{\exists} !P.\supset .Cʻ(P\unicode{x21f8} x)=CʻP\cup \iota ʻx=Cʻ(x\unicode{x21f7}P) \quad[*161·13·131]$

The hypothesis $\dot{\exists} !P$ is necessary in this proposition, since without it we have $P\unicode{x21f8} x=\Lambda$ .

*161·141. $\begin{align}&\vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻ(P\unicode{x21f8} x)=\overrightarrow{B}ʻP-\iota ʻx.\overrightarrow{B}ʻ\text{Cnv}ʻ(P\unicode{x21f8} x)=\iota ʻx-CʻP\\ &[*161·13·131.*93·101]\end{align}$

*161·15. $\begin{align}&\vdash :\dot{\exists} !P.x{\sim}\in CʻP.\supset .\\ &\overrightarrow{B}ʻ(P\unicode{x21f8} x)=\overrightarrow{B}ʻP.\overrightarrow{B}ʻ\text{Cnv}ʻ(P\unicode{x21f8} x)=\iota ʻx.Bʻ(x\unicode{x21f7}\breve{P} )=x \quad[*161·141]\end{align}$

*161·16. $\vdash :x{\sim}\in CʻP.\supset .(P\unicode{x21f8} x)\unicode{x0294f}CʻP=(P\unicode{x21f8} x)\unicode{x0294f}(-\iota ʻx)=P \quad[*161·1]$

*161·161. $\vdash :x{\sim}\in CʻP.\supset .(x\unicode{x21f7}P)\unicode{x0294f}CʻP=(x\unicode{x21f7}P)\unicode{x0294f}(-\iota ʻx)=P$

*161·2. $\vdash .\dot{\Lambda} \unicode{x21f8} x=\dot{\Lambda} \quad[*35·75·82.*161·1]$

*161·21. $\vdash .(x\downarrow y)\unicode{x21f8} z=x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z$

Dem. $\begin{array}{l} \vdash .*161·1.*55·15.\supset \vdash .(x\downarrow y)\unicode{x21f8} z&=x\downarrow y\unicode{x228d} (\iota ʻx\cup \iota ʻy)\uparrow \iota ʻz\\ [*35·82·41.*55·1] &=x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z.\supset \vdash . \text{Prop} \end{array}$

Note that $x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d}y\downarrow z$ is the relation which orders $x$ and $y$ and $z$ in the order $x$ , $y$ , $z$ .

*161·211. $\begin{align}&\vdash .x\unicode{x21f7}(y\downarrow z)=x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z=(x\downarrow y)\unicode{x21f8} z\\ &[\text{Proof as in *161·21}]\end{align}$

*161·212. $P\unicode{x21f8} x\unicode{x21f8} y=(P\unicode{x21f8} x)\unicode{x21f8} y \quad\text{Df}$

*161·213. $x\unicode{x21f7}y\unicode{x21f7}P=x\unicode{x21f7}(y\unicode{x21f7}P) \quad\text{Df}$

*161·22. $\vdash :\dot{\exists} !P.\supset .(P\unicode{x21f8} x)\unicode{x21f8} y=P\unicode{x2909}(x\downarrow y)$

Dem. $\begin{array}{l} \vdash .*161·14·1.\supset \vdash :\text{Hp}.\supset .(P\unicode{x21f8} x)\unicode{x21f8} y&=P\unicode{x228d} CʻP\uparrow {℩}ʻx\unicode{x228d} (CʻP\cup {℩}ʻx)\uparrow {℩}ʻy\\ [*35·82·41] &=P\unicode{x228d} CʻP\uparrow {℩}ʻx\unicode{x228d} CʻP\uparrow {℩}ʻy\unicode{x228d} {℩}ʻx\uparrow {℩}ʻy\\ [*35·82·412] &=P\unicode{x228d} CʻP\uparrow ({℩}ʻx\cup {℩}ʻy)\unicode{x228d} {℩}ʻx\uparrow {℩}ʻy\\ [*55·1·15] &=P\unicode{x228d} CʻP\uparrow Cʻ(x\downarrow y)\unicode{x228d} x\downarrow y\\ [*160·1] &=P\unicode{x2909}(x\downarrow y):\supset \vdash .\text{Prop} \end{array}$

*161·221. $\vdash :\dot{\exists} !P.\supset .x\unicode{x21f7}(y\unicode{x21f7}P)=(x\downarrow y)\unicode{x2909}P$

*161·23. $\vdash :\dot{\exists} !Q.\supset .(P\unicode{x2909}Q)\unicode{x21f8} y=P\unicode{x2909}(Q\unicode{x21f8} y)$

Dem. $\begin{array}{l} \vdash .*161·14·1.*160·1.&\supset \vdash :\text{Hp}.\supset .\\ &P\unicode{x2909}(Q\unicode{x21f8} y)=P\unicode{x228d} Q\unicode{x228d} CʻQ\uparrow {℩}ʻy\unicode{x228d} CʻP\uparrow (CʻQ\cup {℩}ʻy)\\ [*35·82·412] &=P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow {℩}ʻy\unicode{x228d} CʻQ\uparrow {℩}ʻy\\ [*160·1] &=P\unicode{x2909}Q\unicode{x228d} CʻP\uparrow {℩}ʻy\unicode{x228d} CʻQ\uparrow {℩}ʻy\\ [*35·82·41.*160·14] &=P\unicode{x2909}Q\unicode{x228d} Cʻ(P\unicode{x2909}Q)\uparrow {℩}ʻy\\ [*161·1] &=(P\unicode{x2909}Q)\unicode{x21f8} y:\supset \vdash :\text{Prop} \end{array}$

*161·231. $\vdash :\dot{\exists} !P.\supset .x\unicode{x21f7}(P\unicode{x2909}Q)=(x\unicode{x21f7}P)\unicode{x2909}Q$

*161·232. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.\supset .P\unicode{x2909}(x\unicode{x21f7}Q)=(P\unicode{x21f8} x)\unicode{x2909}Q$

Dem. $\begin{array}{l} \vdash .*161·14·101.*160·1.\supset \vdash :\text{Hp}.\supset .\\ P \unicode{x2909}(x\unicode{x21f7}Q)&=P\unicode{x228d} {℩}ʻx\uparrow CʻQ\unicode{x228d} Q\unicode{x228d} CʻP\uparrow ({℩}ʻx\cup CʻQ)\\ [*35·82·412] &=P\unicode{x228d} CʻP\uparrow {℩}ʻx\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ\unicode{x228d} {℩}ʻx\uparrow CʻQ\\ [*161·1·14.*35·82·41] &=(P\unicode{x21f8} x)\unicode{x228d} Q\unicode{x228d} Cʻ(P\unicode{x21f8} x)\uparrow CʻQ\\ [*160·1] &=(P\unicode{x21f8} x)\unicode{x2909}Q:\supset \vdash .\text{Prop} \end{array}$

*161·24. $\vdash .x\unicode{x21f7}(P\unicode{x21f8} y)=(x\unicode{x21f7}P)\unicode{x21f8} y$

Dem. $\begin{array}{l} \vdash .*161·101·14.\supset \vdash :\dot{\exists} !P.\supset .\\ x\unicode{x21f7}(P\unicode{x21f8} y)&={℩}ʻx\uparrow (CʻP\cup {℩}ʻy)\unicode{x228d} P\unicode{x228d} CʻP\uparrow {℩}ʻy\\ [*35·82·412] &={℩}ʻx\uparrow CʻP\unicode{x228d} P\unicode{x228d} {℩}ʻx\uparrow {℩}ʻy\unicode{x228d} CʻP\uparrow {℩}ʻy\\ [*35·82·41.*161·101·14] &=(x\unicode{x21f7}P)\unicode{x228d} Cʻ(x\unicode{x21f7}P)\uparrow {℩}ʻy\\ [*161·1] &=(x\unicode{x21f7}P)\unicode{x21f8} y &\qquad \text{(1)}\\ \vdash .*161·2·201.\supset \vdash :P &=\dot{\Lambda} .\supset .x\unicode{x21f7}(P\unicode{x21f8} y)=\dot{\Lambda} .(x\unicode{x21f7}P )\unicode{x21f8} y=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*161·25. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.\supset .(P \unicode{x21f8} x) \unicode{x2909} (y \unicode{x21f7} Q) = P \unicode{x2909} (x\downarrow y) \unicode{x2909} Q$

Dem. $\begin{array}{l} \vdash .*161·14.*160·1.\supset \\ \vdash :\text{Hp}. \supset .(P \unicode{x21f8} x) \unicode{x2909} (y \unicode{x21f7} Q) &= (P \unicode{x21f8} x) \unicode{x228d} (y \unicode{x21f7} Q) \unicode{x228d} (CʻP \cup \iota ʻx)\uparrow (CʻQ \cup \iota ʻy)\\ [*161·1·101] &= P \unicode{x228d} CʻP\uparrow \iota ʻx \unicode{x228d} \iota ʻy\uparrow CʻQ \unicode{x228d} Q\\ &\unicode{x228d} (CʻP \cup \iota ʻx)\uparrow (CʻQ \cup \iota ʻy)\\ [*35·82·41·412] & = P \unicode{x228d} CʻP\uparrow (\iota ʻx \cup \iota ʻy)\unicode{x228d} \iota ʻx\uparrow \iota ʻy \unicode{x228d} Q\\ &\unicode{x228d} (CʻP \cup \iota ʻx \cup \iota ʻy)\uparrow CʻQ\\ [*55·15·1.*160·14·1] & = {P \unicode{x2909} (x\downarrow y)} \unicode{x228d} Q \unicode{x228d} Cʻ{P \unicode{x2909} (x\downarrow y)}\uparrow CʻQ\\ [*160·1.(*160·32)] &= P \unicode{x2909} (x\downarrow y) \unicode{x2909} Q : \supset \vdash . \text{Prop} \end{array}$

*161·26. $\begin{align}\vdash . x \unicode{x21f7} \{y \unicode{x21f7} (z\downarrow w)\} &= (x\downarrow y) \unicode{x2909} (z\downarrow w) = \{(x\downarrow y) \unicode{x21f8} z\} \unicode{x21f8} w\\ &= \{x \unicode{x21f7} (y\downarrow z)\} \unicode{x21f8} w\end{align}$

Dem. $\begin{array}{l} \vdash .*161·221.*55·134. \supset \vdash . x \unicode{x21f7} \{y \unicode{x21f7} (z\downarrow w)\} &= (x\downarrow y) \unicode{x2909} (z\downarrow w)\\ [*161·22.*55·134] &= \{(x\downarrow y) \unicode{x21f8} z\} \unicode{x21f8} w\\ [*161·211] &= \{x \unicode{x21f7} (y\downarrow z)\} \unicode{x21f8} w. \supset \vdash . \text{Prop} \end{array}$

*161·3. $\begin{align}\vdash : \dot{\exists} !Q . S\in P \overline{\text{smor}} Q . x{\sim}\in CʻP . &y{\sim}\in CʻQ. \supset .\\ &S \unicode{x228d} x\downarrow y\in (P \unicode{x21f8} x) \overline{\text{smor}} (Q \unicode{x21f8} y)\end{align}$

Dem. $\begin{array}{l} \vdash .*151·11·131. &\supset \vdash : \text{Hp}. \supset . S\in 1\rightarrow 1. CʻQ = \text{ᗡ}ʻS. P = S^{;}Q. CʻP = \text{D}ʻS &\qquad \text{(1)}\\ \vdash .(1).*55·15. \supset \vdash : \text{Hp}. &\supset . \text{D}ʻS \cap \text{D}ʻ(x\downarrow y) = \Lambda . \text{ᗡ}ʻS \cup \text{ᗡ}ʻ(x\downarrow y) = \Lambda . &\qquad \text{(2)}\\ [*72·182.*71·242] &\supset . S \unicode{x228d} x\downarrow y\in 1\rightarrow 1 &\qquad \text{(3)}\\ \vdash .*55·15.*151·11. \supset \vdash : \text{Hp}. \supset . \text{ᗡ}ʻ(S \unicode{x228d} x\downarrow y) &= CʻQ \cup \iota ʻy\\ [*161·14] & = Cʻ(Q \unicode{x21f8} y) &\qquad \text{(4)}\\ \vdash .(1).(2).*34·301. \supset \vdash : \text{Hp}. \supset . &(x\downarrow y)\mid Q = \dot{\Lambda} . Q\mid (y\downarrow x) = \dot{\Lambda} .\\ &(x\downarrow y)\mid (CʻQ\uparrow \iota ʻy) = \dot{\Lambda} . (CʻQ\uparrow \iota ʻy)\mid \breve{S} = \dot{\Lambda} .\\ [*34·25·26] &\supset . (S \unicode{x228d} x\downarrow y)\mid (Q \unicode{x228d} CʻQ\uparrow \iota ʻy) = S\mid (Q \unicode{x228d} CʻQ\uparrow \iota ʻy).\\ &(Q \unicode{x228d} CʻQ\uparrow \iota ʻy)\mid (y\downarrow x \unicode{x228d} \breve{S} ) = Q\mid \breve{S} \unicode{x228d} (CʻQ\uparrow \iota ʻy)\mid (y\downarrow x)\\ [*35·89.*55·1] & = Q\mid \breve{S} \unicode{x228d} CʻQ\uparrow \iota ʻx &\qquad \text{(5)}\\ \vdash .(5).*150·1. \supset \vdash : \text{Hp}. \supset . (S \unicode{x228d} x\downarrow y)^{;}(Q \unicode{x228d} CʻQ\uparrow \iota ʻy) &= S\mid \{Q\mid \breve{S} \unicode{x228d} CʻQ\uparrow \iota ʻx\}\\ [*150·1] &=S^{;}Q \unicode{x228d} S\mid CʻQ\uparrow \iota ʻx\\ [*37·81.(1).*150·23] & =P \unicode{x228d} CʻP\uparrow \iota ʻx &\qquad \text{(6)}\\ \vdash .(6).*161·1. &\supset \vdash : \text{Hp}. \supset . (S \unicode{x228d} x\downarrow y)^{;}(Q \unicode{x21f8} y) = P \unicode{x21f8} x &\qquad \text{(7)}\\ \vdash .(3).(4).(7).*151·11. \supset \vdash . \text{Prop} \end{array}$

*161·301. $\begin{align}\vdash : \dot{\exists} !Q. S\in P \overline{\text{smor}} Q. x{\sim}\in CʻP. &y{\sim}\in CʻQ. \supset .\\ &x\downarrow y \unicode{x228d} S\in (x \unicode{x21f7} P) \overline{\text{smor}} (y \unicode{x21f7} Q)\end{align}$

*161·31. $\begin{align}\vdash : P \,\text{smor} \,Q. x{\sim}\in CʻP. &y{\sim}\in CʻQ. \supset .\\ &P \unicode{x21f8} x \,\text{smor}\, Q \unicode{x21f8} y. x \unicode{x21f7} P \,\text{smor}\, y \unicode{x21f7} Q\end{align}$

Dem. $\begin{array}{l} \vdash .*161·3·301.*151·12. \supset \\ \vdash :\text{Hp}. \dot{\exists} !Q. &\supset . P \unicode{x21f8} x \,\text{smor}\, Q \unicode{x21f8} y. x \unicode{x21f7} P \,\text{smor}\, y \unicode{x21f7} Q &\qquad \text{(1)}\\ \vdash .*151·32.*161·2·201. \supset \\ \vdash : \text{Hp}. Q = \dot{\Lambda} . &\supset . P \unicode{x21f8} x = \dot{\Lambda} . Q \unicode{x21f8} y = \dot{\Lambda} . x \unicode{x21f7} P = \dot{\Lambda} . y \unicode{x21f7} Q = \dot{\Lambda} .\\ [*153·101] & \supset . P \unicode{x21f8} x\, \text{smor}\, Q \unicode{x21f8} y. x \unicode{x21f7} P \,\text{smor}\, y \unicode{x21f7} Q &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash . \text{Prop} \end{array}$

*161·32. $\begin{align}\vdash : \dot{\exists} !Q. x{\sim}\in CʻP. y{\sim}\in CʻQ. &S\in (P \unicode{x21f8} x) \overline{\text{smor}} (Q \unicode{x21f8} y). \supset .\\ &S\upharpoonright (-\iota ʻy)\in P \overline{\text{smor}} Q. xSy\end{align}$

Dem. $\begin{array}{l} \vdash .*151·5.*161.15. &\supset \vdash : \text{Hp}. \supset . xSy &\qquad \text{(1)}\\ \vdash .(1).*150·1. \supset \colon\ldotp \text{Hp}. &\supset : u{S\upharpoonright (-\iota ʻy)^{;}Q}v.\\ &\equiv . (\exists z,w). z(Q \unicode{x21f8} y)w. u\neq x. v\neq x. uSz. vSw.\\ [*151·11] & \equiv . u\neq x. v\neq x. u(P \unicode{x21f8} x)v.\\ [*161·11] & \equiv . uPv &\qquad \text{(2)}\\ \vdash .*35·64. \supset \vdash : \text{Hp}. \supset . \text{ᗡ}ʻS\upharpoonright (-\iota ʻy) &= Cʻ(Q \unicode{x21f8} y) - \iota ʻy\\ [*161·14·2] & = CʻQ &\qquad \text{(3)}\\ \vdash .(1).(2).(3). \supset \vdash . \text{Prop} \end{array}$

*161·321. $\begin{align}\vdash : \dot{\exists} !Q. x{\sim}\in CʻP. y{\sim}\in CʻQ. &S\in (x \unicode{x21f7} P) \overline{\text{smor}} (y \unicode{x21f7} Q). \supset .\\ &S\upharpoonright (-\iota ʻy)\in P \overline{\text{smor}} Q. xSy\end{align}$

*161·33. $\begin{align}\vdash \colon\ldotp x&{\sim}\in CʻP. y{\sim}\in CʻQ. \supset :\\ &P \,\text{smor} \,Q. \equiv . (P \unicode{x21f8} x) \text{smor} (Q \unicode{x21f8} y). \equiv . (x \unicode{x21f7} P) \text{smor} (y \unicode{x21f7} Q)\\ &[*161·31·32·321·2·201. *153·101]\end{align}$

The above proposition justifies addition of 1 or subtraction of 1 in ordinal arithmetic.

*161·4. $\vdash : CʻQ \subset \text{ᗡ}ʻS. x\in \text{ᗡ}ʻS. S\in 1\rightarrow \text{Cls}. \supset . S^{;}(Q \unicode{x21f8} x) = S^{;}Q \unicode{x21f8} Sʻx$

Dem. $\begin{array}{l} \vdash . *161·1.*150·3. \supset \vdash . S^{;}(Q \unicode{x21f8} x) &= S^{;}Q \unicode{x228d} S^{;}(CʻQ\uparrow \iota ʻx)\\ [*150·73] & = S^{;}Q \unicode{x228d} (SʻʻCʻQ)\uparrow (Sʻʻ\iota ʻx) &\qquad \text{(1)}\\ \vdash .(1).*150·22.*53·31. \supset \vdash : \text{Hp}. \supset . S^{;}(Q \unicode{x21f8} x) &= S^{;}Q \unicode{x228d} (CʻS^{;}Q)\uparrow (\iota ʻSʻx)\\ [*161·1] & = S^{;}Q \unicode{x21f8} Sʻx: \supset \vdash . \text{Prop} \end{array}$

*161·41. $\vdash : CʻQ \subset \text{ᗡ}ʻS. x\in \text{ᗡ}ʻS. S\in 1\rightarrow \text{Cls}. \supset . S^{;}(x \unicode{x21f7} Q) = Sʻx \unicode{x21f7} S^{;}Q$

*161·42. $\vdash . \downarrow y^{;}(Q \unicode{x21f8} x) = \downarrow y^{;}Q \unicode{x21f8} (x\downarrow y) \quad[*161·4.*55·21.*72·184]$

*161·43. $\vdash . \downarrow y^{;}(x \unicode{x21f7} Q) = (x\downarrow y) \unicode{x21f7} y^{;}Q$

The form of summation defined in *160 cannot be extended beyond a finite number of summands, since it involves explicit mention of all the summands. In the present number, we shall be concerned with a form of summation which is not subject to this restriction. It will be observed that, since relational summation is not permutative, we cannot define the sum of a class of relations, for this would not determine the order in which the summation is to be effected. Our relations must be given as the field of some relation which orders them; thus the sum appears not as the sum of a class, but as the sum of a relation, namely of a relation whose field is the relations to be summed. In the case of two relations $Q$ and $R$ , the sum of $Q\downarrow R$ , as defined in the present number, will be equal to $Q\unicode{x2909}R$ ; similarly for three, the sum of $Q\downarrow R\unicode{x228d} Q\downarrow S\unicode{x228d} R\downarrow S$ will be equal to $Q\unicode{x2909}R\unicode{x2909}S$ , and so on for any finite number of summands.

As explained in the introduction to this Section, if P is a relation between relations, we put

$\Sigma ʻP=\dot{s} ʻCʻP\unicode{x228d} F^{;}P \quad\text{Df}.$ It is convenient to suppose that $P$ is serial, and that every member of $CʻP$ is also serial. Then $\Sigma ʻP$ holds between $x$ and $y$ if either (1) there is a series, in the field of $P$ , in which $x$ precedes $y$ , or (2) $x$ belongs to a series which is earlier, in the $P$ -series, than the series to which y belongs. The following are the chief propositions of this number:

*162·22·23. $\vdash .Cʻ\Sigma ʻP=sʻCʻʻCʻP=Cʻ\dot{s} ʻCʻP=FʻʻCʻP=\overrightarrow{F}^{2}ʻP$

*162·26. $\vdash .\Sigma ʻ(P\unicode{x228d} Q)=\Sigma ʻP\unicode{x228d} \Sigma ʻQ$

*162·31. $\vdash .\Sigma ʻQ\unicode{x2909}\Sigma ʻR=\Sigma ʻ(Q\unicode{x2909}R)$

*162·34. $\vdash .\Sigma ʻ\Sigma ^{;}P=\Sigma ʻ\Sigma ʻP \quad[\text{Associative Law. Cf.*42·1}]$

*162·35. $\vdash :Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻR.\supset .\Sigma ʻR\dagger ^{;}Q=R^{;}\Sigma ʻQ$

*162·42. $\vdash :\dot{\exists} !\Sigma ʻP.\equiv .\dot{\exists} !\dot{s} ʻCʻP.\equiv .\exists !CʻP-{℩}ʻ\dot{\Lambda}$

*162·43. $\vdash :\dot{\exists} !P.\supset .\Sigma ʻ(P\unicode{x21f8} R)=\Sigma ʻP\unicode{x2909}R$

It should be observed that the ordinal analogues of propositions about classes of classes often involve the substitution of $\Sigma$ (not $\dot{s}$ ) for $s$ . Examples are afforded by *162·34 ·35, quoted above.

*162·1. $\vdash .\Sigma ʻP=\dot{s} ʻCʻP\unicode{x228d} F^{;}P \quad[(*162·01)]$

*162·11. $\vdash \colon\ldotp x(\Sigma ʻP)y.\equiv :x(\dot{s} ʻCʻP)y.\lor.x(F^{;}P)y \quad[*162·1]$

*162·12. $\begin{align}&\vdash \colon\ldotp x(\Sigma ʻP)y.\equiv :(\exists Q).Q\,\unicode{x2abd}\, CʻP.xQy.\lor.(\exists Q,R).xFQ.yFR.QPR\\ &[*162·1.*41·11.*150·11]\end{align}$

*162·13. $\begin{align}\vdash \colon\ldotp x(\Sigma ʻP)&y.\equiv :(\exists Q).Q\in CʻP.xQy.\\ &\lor.(\exists Q,R).x\in CʻQ.y\in CʻR.QPR \quad[*161·12.*33·51]\end{align}$

*162·14. $\begin{align}&\vdash \colon\ldotp x(\Sigma ʻP)y.=:(\exists Q).QFP.xQy.\lor.(\exists Q,R).xFQ.yFR.QPR\\ &[*161·12.*33·51]\end{align}$

Dem. $\begin{array}{l} \vdash .*162·13.\supset \vdash \colon\ldotp x(\Sigma ʻ\text{Cnv}^{;}\breve{P} )y.&\equiv :(\exists Q).Q\in Cʻ\text{Cnv}^{;}\breve{P} .xQy .\\ &\lor.(\exists Q,R).Q(\text{Cnv}^{;}\breve{P} )R.x\in CʻQ.y\in CʻR:\\ [*150·22·41] &\equiv :(\exists Q).Q\in \text{Cnv}ʻʻCʻP.xQy.\\ &\lor.(\exists Q,R).\breve{Q} \breve{P} \breve{R} .x\in CʻQ.y\in CʻR:\\ [*37·64.*33·22] &\equiv :(\exists Q).Q\in CʻP.yQx.\lor.(\exists Q,R).RPQ.x\in CʻQ.y\in CʻR:\\ [*162·13] &\equiv :y(\Sigma ʻP)x\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*162·21. $\vdash .\text{D}ʻ\Sigma ʻP=sʻ\text{D}ʻʻCʻP\cup sʻCʻʻ\text{D}ʻ(P\upharpoonright -{℩}ʻ\dot{\Lambda} )$

Dem. $\begin{array}{l} \vdash .*162·13.\supset \vdash \colon\ldotp x\in \text{D}ʻ\Sigma ʻP.&\equiv :(\exists Q,y).Q\in CʻP.xQy.\\ &\lor.(\exists Q,R,y).QPR.x\in CʻQ.y\in CʻR:\\ [*33·13·24] &\equiv :(\exists Q).Q\in CʻP.x\in \text{D}ʻQ.\lor.(\exists Q,R).QPR.x\in CʻQ.\dot{\exists} !R:\\ [*40·4.*35·101] &\equiv :x\in sʻ\text{D}ʻʻCʻP.\lor.x\in sʻCʻʻ\text{D}ʻ(P\upharpoonright -{℩}ʻ\dot{\Lambda} )\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*162·211. $\vdash .\text{ᗡ}ʻ\Sigma ʻP=sʻ\text{ᗡ}ʻʻCʻP\cup sʻCʻʻ\text{ᗡ}ʻ(-{℩}ʻ\dot{\Lambda} )\upharpoonleft P$

*162·212. $\vdash :\dot{\Lambda} {\sim}\in \text{ᗡ}ʻP.\supset .\text{D}ʻ\Sigma ʻP=sʻCʻʻ\text{D}ʻP\cup sʻ\text{D}ʻʻ\overrightarrow{B}ʻ\breve{P}$

Dem. $\begin{array}{l} \vdash .*162·21.\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\Sigma ʻP&=sʻ\text{D}ʻʻCʻP\cup sʻCʻʻ\text{D}ʻP\\ [*40·31.*93·12] &=sʻ\text{D}ʻʻ\text{D}ʻP\cup sʻ\text{D}ʻʻ\overrightarrow{B}ʻ\breve{P} \cup sʻCʻʻ\text{D}ʻP\\ [*40·57] &=sʻ\text{D}ʻʻ\overrightarrow{B}ʻ\breve{P} \cup sʻCʻʻ\text{D}ʻP:\supset \vdash .\text{Prop}\ \end{array}$

*162·213. $\vdash :\dot{\Lambda} {\sim} \in \text{D}ʻP.\supset .\text{ᗡ}ʻ\Sigma ʻP = sʻCʻʻ\text{ᗡ}ʻP\cup sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*162·21·211.*40·57.\supset \\ \vdash .Cʻ\Sigma ʻP &= sʻCʻʻCʻP\cup sʻCʻʻ\text{D}ʻ(P\upharpoonright -\iota ʻ\dot{\Lambda} )\cup sʻCʻʻ\text{ᗡ}ʻ(-\iota ʻ\dot{\Lambda} )\upharpoonleft P\\ [*40·161] &= sʻCʻʻCʻP.\supset \vdash .\text{Prop} \end{array}$

*162·23. $\vdash .Cʻ\Sigma ʻP = Cʻ\dot{s} ʻCʻP = FʻʻCʻP = \overrightarrow{F}^{2}ʻP \quad[*162·22.*42·2]$

*162·26. $\vdash .\Sigma ʻ(P\unicode{x228d} Q) = \Sigma ʻP\unicode{x228d} \Sigma ʻQ$

Dem. $\begin{array}{l} \vdash .*162·1.\supset \vdash .\Sigma ʻ(P\unicode{x228d} Q) &= \dot{s} ʻCʻ(P\unicode{x228d} Q)\unicode{x228d} F^{;}(P\unicode{x228d} Q)\\ [*33·262.*41·171.*150·3] &= \dot{s} ʻCʻP\unicode{x228d} \dot{s} ʻCʻQ\unicode{x228d} F^{;}P\unicode{x228d} F^{;}Q\\ [*162·1] & = \Sigma ʻP\unicode{x228d} \Sigma ʻQ.\supset \vdash .\text{Prop} \end{array}$

*162·27. $\vdash .\Sigma ʻS^{;}(P\unicode{x228d} Q) = \Sigma ʻS^{;}P\unicode{x228d} \Sigma ʻS^{;}Q \quad[*162·26.*150·3]$

Dem. $\begin{array}{l} \vdash .*160·1.\supset \vdash .\Sigma ʻ(Q\downarrow R) &= \dot{s} ʻCʻ(Q\downarrow R)\unicode{x228d} F^{;}(Q\downarrow R)\\ [*55·15.*150·7] & = \dot{s} ʻ(\iota ʻQ\cup \iota ʻR)\unicode{x228d} \overrightarrow{F}ʻQ\uparrow \overrightarrow{F}ʻR\\ [*53·13.*33·5] & = Q\unicode{x228d} R\unicode{x228d} CʻQ\uparrow CʻR\\ [*160·1] &= Q\unicode{x2909}R.\supset \vdash .\text{Prop} \end{array}$

This proposition establishes the connection between the two kinds of arithmetical addition of relations.

*162·31. $\vdash .\Sigma ʻQ\unicode{x2909}\Sigma ʻR = \Sigma ʻ(Q\unicode{x2909}R)$

Dem. $\begin{array}{l} \vdash .*160.1.\supset \vdash .\Sigma ʻQ\unicode{x2909}\Sigma ʻR &= \Sigma ʻQ\unicode{x228d} \Sigma ʻR\unicode{x228d} Cʻ\Sigma ʻQ\uparrow Cʻ\Sigma ʻR\\ [*162·123] & = \dot{s} ʻCʻQ\unicode{x228d} F^{;}Q\unicode{x228d} \dot{s} ʻCʻR\unicode{x228d} F^{;}R\unicode{x228d} (FʻʻCʻQ)\uparrow (FʻʻCʻR)\\ [*150·73] &= \dot{s} ʻCʻQ\unicode{x228d} \dot{s} ʻCʻR\unicode{x228d} F^{;}Q\unicode{x228d} F^{;}R\unicode{x228d} F^{;}(CʻQ\uparrow CʻR)\\ [*41.171.*160·14.*150·3.*160·1] &= \dot{s} ʻCʻ(Q\unicode{x2909}R)\unicode{x228d} F^{;}(Q\unicode{x2909}R)\\ [*162·1] & = \Sigma ʻ(Q\unicode{x2909}R)\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*41·6.*162·1.*150·1.\supset \vdash .\dot{s} ʻ\Sigma ʻʻ\kappa & = \dot{s} ʻ\dot{s} ʻʻCʻʻ\kappa \unicode{x228d} \dot{s} ʻF\daggerʻʻ\kappa \\ [*42·12.*150·16] & = \dot{s} ʻsʻCʻʻ\kappa \unicode{x228d} F^{;}\dot{s} ʻ\kappa \\ [*41·45]& = \dot{s} ʻCʻ\dot{s} ʻ\kappa \unicode{x228d} F^{;}\dot{s} ʻ\kappa \\ [*162·1] &= \Sigma ʻ\dot{s} ʻ\kappa .\supset \vdash .\text{Prop} \end{array}$

*162·33. $\vdash .\Sigma ʻ\Sigma ʻP = \dot{s} ʻCʻ\dot{s} ʻCʻP\unicode{x228d} F^{;}\dot{s} ʻCʻP\unicode{x228d} F^{2;}P$

Dem. $\begin{array}{l} \vdash .*162·1.\supset \vdash .\Sigma ʻ\Sigma ʻP&=\dot{s} ʻCʻ\Sigma ʻP\unicode{x228d} F^{;}\Sigma ʻP\\ [*162·23] &= \dot{s} ʻCʻ\dot{s} ʻCʻP\unicode{x228d} F^{;}(\dot{s} ʻCʻP\unicode{x228d} F^{;}P)\\ [*150·3·13] &= \dot{s} ʻCʻ\dot{s} ʻCʻP\unicode{x228d} F^{;}\dot{s} ʻCʻP\unicode{x228d} F^{2;}P.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*71·7.\supset \vdash :x(F\mid \Sigma )P.&\equiv .xF(\Sigma ʻP).\\ [*33.51] &\equiv .x\in Cʻ\Sigma ʻP.\\ [*162·23] &\equiv .xF^{2}P &\qquad \text{(1)}\\ \vdash .*71·7.\supset \vdash :x(F\mid \dot{s} \mid C)P.&\equiv .xF(\dot{s} ʻCʻP).\\ [*33·51] &\equiv .x\in Cʻ\dot{s} ʻCʻP.\\ [*42·2] &\equiv .xF^{2}P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*162·332. $\vdash .\Sigma ʻ\Sigma ^{;}P= \dot{s} ʻCʻ\dot{s} ʻP\unicode{x228d} F^{;}\dot{s} ʻCʻP\unicode{x228d} F^{2;}P$

Dem. $\begin{array}{l} \vdash .*162·1.\supset \vdash .\Sigma ʻ\Sigma ^{;}P&=\dot{s} ʻCʻ\Sigma ^{;}P\unicode{x228d} F^{;}\Sigma ^{;}P\\ [*150·22·13] &= \dot{s} ʻ\Sigma ʻʻCʻP\unicode{x228d} (F\mid \Sigma )^{;}P\\ [*162·32·331] &= \Sigma ʻ\dot{s} ʻCʻP\unicode{x228d} F^{2;}P\\ [*162·1] &= \dot{s} ʻCʻ\dot{s} ʻCʻP\unicode{x228d} F^{;}\dot{s} ʻCʻP\unicode{x228d} F^{2;}P.\supset \vdash . \text{Prop} \end{array}$

*162·34. $\vdash .\Sigma ʻ\Sigma ^{;}=\Sigma ʻ\Sigma ʻP \quad[*162·33·332]$

*162·341. $\vdash \colon\ldotp CʻQ\subset \text{ᗡ}ʻR.\supset :x(F\mid R\dagger )Q.\equiv .x(R\mid F)Q$

Dem. $\begin{array}{l} \vdash . *71·7.*150·1.\supset \vdash :x(F\mid R\dagger )Q.&\equiv .xF(R^{;}Q).\\ [*33·51] &\equiv .x\in CʻR^{;}Q &\qquad \text{(1)}\\ \vdash .(1).*150·22. \supset \vdash \colon\ldotp \text{Hp}.\supset :x(F\mid R\dagger )Q.&\equiv .x\in RʻʻCʻQ.\\ [*33·5] &\equiv .x\in Rʻʻ\overrightarrow{F}ʻQ.\\ [*37·3.*32·18] &\equiv .x(R\mid F)Q\colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*162·342. $\vdash :Cʻ\dot{s} ʻ\lambda \subset \text{ᗡ}ʻR.\supset .(F\mid R\dagger )\upharpoonright \lambda =(R\mid F)\upharpoonright \lambda$

Dem. $\begin{array}{l} \vdash .*41·13.\supset \vdash \colon\ldotp \text{Hp}.&\supset :Q\in \lambda .\supset CʻQ\subset \text{ᗡ}ʻR:\\ [*162·341] &\supset :Q\in \lambda .x(F\mid R\dagger )Q.\equiv .Q\in \lambda .x(R\mid F)Q\colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*162·343. $\vdash : Cʻ\Sigma ʻP\subset \text{ᗡ}ʻR.\supset .F^{;}R\dagger ^{;}P=R^{;}F^{;}P$

Dem. $\begin{array}{l} \vdash .*162·23.\supset \vdash :\text{Hp}.&\supset .Cʻ\dot{s} ʻCP\subset \text{ᗡ}ʻR.\\ [*162·342]&\supset .(F\mid R\dagger )\upharpoonright (CʻP)^{;}P=(R\mid F)\upharpoonright (CʻP)^{;}P.\\ [*150·32] &\supset .(F\mid R\dagger )^{;}P=(R\mid F)^{;}P.\\ [*150·13]&\supset .F^{;}R\dagger ^{;}P=R^{;}F^{;}P:\supset \vdash . \text{Prop} \end{array}$

*162·35. $\vdash :Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻR.\supset .\Sigma ʻR\dagger ^{;}Q=R^{;}\Sigma ʻQ$

Dem. $\begin{array}{l} \vdash .*162·1.*150·22. \supset \vdash .\Sigma ʻR\dagger ^{;}Q&=\dot{s} ʻR\dagger ʻʻCʻQ\unicode{x228d} F^{;}R\dagger ^{;}Q\\ [*150·16] &=R^{;}\dot{s} ʻCʻQ\unicode{x228d} F^{;}R\dagger ^{;}Q &\qquad \text{(1)}\\ \vdash .(1).*162·343. \supset \vdash :\text{Hp}.\supset .\Sigma ʻR\dagger ^{;}Q&=R^{;}\dot{s} ʻCʻQ\unicode{x228d} R^{;}F^{;}Q\\ [*150·3.*162·1] & =R^{;}\Sigma ʻQ:\supset \vdash .\text{Prop} \end{array}$

This proposition is important, since it enables us to infer (with a suitable hypothesis) that if $R^{;}M$ is always like $M$ when $M\in CʻQ$ , then the arithmetical sum of all such relations as $R^{;}M$ is like $\Sigma ʻQ$ , being in fact $R^{;}\Sigma ʻQ$ . In other words, if, whenever $M\in CʻQ$ , $R\upharpoonright CʻM$ is a correlator of $R^{;}M$ and $M$ , then $R\upharpoonright \Sigma ʻQ$ is a correlator if $\Sigma ʻR\dagger ^{;}Q$ and $\Sigma ʻQ$ . This proposition is analogous in its uses to the proposition $sʻR_{\in}ʻʻ\kappa =Rʻʻsʻ\kappa ,$ which is *40·38. In general, in obtaining relational analogues of cardinal propositions, $Rʻʻ\kappa$ is to be replaced by $R^{;}Q$ , $R_{\in }$ by $R\dagger$ , and $s$ by $\Sigma$ . When these substitutions are made in $sʻR_{\in}ʻʻ\kappa =Rʻʻsʻ\kappa$ , *162·35 results, except for its hypothesis.

If we regard $R^{;}Q$ as a kind of product of $R$ and $Q$ , *162·35 becomes a distributive law. For it asserts that if we multiply each member of $CʻQ$ by $R$ , and then sum the resulting products, we get the same relation as if we first sum $CʻQ$ , and then multiply by $R$ . The following application of *162·35 to the sum of two relations makes its distributive character more evident.

*162·36. $\vdash :CʻP\cup CʻQ\subset \text{ᗡ}ʻR.\supset .R^{;}P\unicode{x2909}R^{;}Q=R^{;}(P\unicode{x2909}Q)$

Dem. $\begin{array}{l} \vdash .*162·3. \supset \vdash .R^{;}P\unicode{x2909}R^{;}Q&=\Sigma ʻ\{(R^{;}P)\downarrow (R^{;}Q)\}\\ [*150·1·71] &=\Sigma ʻR\dagger ^{;}(P\downarrow Q) &\qquad \text{(1)}\\ \vdash .(1).*162·35. \supset \vdash :\text{Hp}.\supset .R^{;}P\unicode{x2909}R^{;}Q&=R^{;}\Sigma ʻ(P\downarrow Q)\\ [*162·3] &=R^{;}(P\unicode{x2909}Q):\supset \vdash .\text{Prop} \end{array}$

*162·37. $\vdash :\exists !\lambda .\exists !\mu .\supset .\Sigma ʻ(\lambda \uparrow \mu )=\dot{s} ʻ\lambda \unicode{x2909}\dot{s} ʻ\mu$

Dem. $\begin{array}{l} \vdash .*35·85·86. \supset \vdash :\text{Hp}.\supset .Cʻ(\lambda \uparrow \mu )&=\lambda \cup \mu .\\ [*162·1] \supset .\Sigma ʻ(\lambda \uparrow \mu )&=\dot{s} ʻ(\lambda \cup \mu )\unicode{x228d} F^{;}(\lambda \uparrow \mu )\\ [*41·171.*150·73] &=\dot{s} ʻ\lambda \unicode{x228d} \dot{s} ʻ\mu \unicode{x228d} (Fʻʻ\lambda )\uparrow (Fʻʻ\mu )\\ [*41·45.*40·56] &=\dot{s} ʻ\lambda \unicode{x228d} \dot{s} ʻ\mu \unicode{x228d} (Cʻ\dot{s} ʻ\lambda )\uparrow (Cʻ\dot{s} ʻ\mu )\\ [*160·1] &=\dot{s} ʻ\lambda \unicode{x2909}\dot{s} ʻ\mu :\supset \vdash .\text{Prop} \end{array}$

*162·371. $\vdash :\exists !\alpha .\supset .\Sigma ʻ(\alpha \uparrow \iota ʻQ)=\dot{s} ʻ\alpha \unicode{x2909}Q \quad[*162·37.*53·04]$

*162·372. $\vdash :\exists !\beta .\supset .\Sigma ʻ(\iota ʻP)\uparrow \beta =P\unicode{x2909}\dot{s} ʻ\beta$

Dem. $\begin{array}{l} \vdash . *33·241.*41·21 .&\supset \vdash . \dot{s} ʻCʻ\dot{\Lambda} = \dot{\Lambda} &\qquad \text{(1)}\\ \vdash . *150·42 . &\supset \vdash . F^{;}\dot{\Lambda} = \dot{\Lambda} &\qquad \text{(2)}\\ \vdash . (1).(2).*162·1 .\supset \vdash . \text{Prop} \end{array}$

*162·41. $\vdash . \Sigma ʻ(\dot{\Lambda} \downarrow \dot{\Lambda} ) = \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash . *162·3 .\supset \vdash . \Sigma ʻ(\dot{\Lambda} \downarrow \dot{\Lambda} ) &= \dot{\Lambda} \unicode{x2909}\dot{\Lambda} \\ [*160·21] &=\dot{\Lambda} .\supset \vdash . \text{Prop} \end{array}$

*162·42. $\vdash : \dot{\exists} !\Sigma ʻP .\equiv . \dot{\exists} !\dot{s} ʻCʻP .\equiv . .\exists !CʻP-\iota ʻ\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash . *162·23.*33·24 .\supset \vdash : \dot{\exists} !\Sigma ʻP .&\equiv . \dot{\exists} !\dot{s} ʻCʻP.\\ [*41·26] &\equiv . \exists !CʻP-\iota ʻ\dot{\Lambda} \end{array}$

*162·43. $\vdash : \dot{\exists} !P .\supset . \Sigma ʻ(P\unicode{x21f8} R) = \Sigma ʻP\unicode{x2909}R$

Dem. $\begin{array}{l} \vdash . *162·26.*161·1 .&\supset \vdash . \Sigma ʻ(P\unicode{x21f8} R) = \Sigma ʻP\unicode{x228d} \Sigma ʻ(CʻP\uparrow \iota ʻR) &\qquad \text{(1)}\\ \vdash . *162·371.*33·24 .&\supset \vdash : \dot{\exists} !P .\supset . \Sigma ʻ(CʻP\uparrow \iota ʻR) = \dot{s} ʻCʻP\unicode{x2909}R &\qquad \text{(2)}\\ \vdash . (1).(2).*160·1 .\supset \\ \vdash : \text{Hp} .\supset . \Sigma ʻ(P\unicode{x21f8}R) &= \Sigma ʻP\unicode{x228d} \dot{s} ʻCʻP\unicode{x228d} R\unicode{x228d} (Cʻ\dot{s} ʻCʻP)\uparrow CʻR\\ [*162·1·23] & = \Sigma ʻP\unicode{x228d} R\unicode{x228d} (Cʻ\Sigma ʻP)\uparrow CʻR\\ [*160·1] & = \Sigma ʻP\unicode{x2909}R :\supset \vdash . \text{Prop} \end{array}$

*162·431. $\vdash : \dot{\exists} !P .\supset . \Sigma ʻ(R\unicode{x21f7}P) = R\unicode{x2909}\Sigma ʻP \quad[\text{Proof as in *162·43}]$

Observe that in *162·43 ·431, $P$ and $R$ must be of different types, in fact $R$ must be of the type to which members of $CʻP$ belong. *162·43·431 are often useful.

*162.44. $\vdash . \Sigma ʻ(P\unicode{x21f8} \dot{\Lambda} ) = \Sigma ʻ(\dot{\Lambda} \unicode{x21f7}P) = \Sigma ʻP$

Dem. $\begin{array}{l} \vdash . *162·43 . \supset \vdash : \dot{\exists} !P .\supset . \Sigma ʻ(P\unicode{x21f8} \dot{\Lambda} ) &= \Sigma ʻP\unicode{x2909}\dot{\Lambda} [*160·21] = \Sigma ʻP &\qquad \text{(1)}\\ \vdash . *33·241.*35·88 .\supset \vdash : P = \dot{\Lambda} .&\supset . CʻP\uparrow \iota ʻ\dot{\Lambda} = \dot{\Lambda} .\\ [*162·4] &\supset . \Sigma ʻ(CʻP\uparrow \iota ʻ\Lambda ) = \dot{\Lambda}\\ . [*25·24] \supset . \Sigma ʻP &= \Sigma ʻP\unicode{x228d} \Sigma ʻ(CʻP\uparrow \iota ʻ\dot{\Lambda} )\\ [*162·26] &= \Sigma ʻ(P\unicode{x228d} CʻP\uparrow \iota ʻ\dot{\Lambda} )\\ [*161·1] & = \Sigma ʻ(P\unicode{x21f8} \dot{\Lambda} ) &\qquad \text{(2)}\\ \vdash . (1).(2). .&\supset \vdash . \Sigma ʻ(P\unicode{x21f8} \dot{\Lambda} ) = \Sigma ʻP &\qquad \text{(3)}\\ \text{Similarly}\quad &\vdash . \Sigma ʻ(\dot{\Lambda} \unicode{x21f7}P)=\Sigma ʻP &\qquad \text{(4)}\\ \vdash . (3).(4) .\supset \vdash . \text{Prop} \end{array}$

*162·45. $\vdash :\dot{\exists} !P.\Sigma ʻP=\dot{\Lambda} .\equiv .P=\dot{\Lambda} \downarrow \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*162·42.\supset \vdash :\Sigma ʻP=\dot{\Lambda} .&\equiv .CʻP\subset {℩}ʻ\dot{\Lambda} .\\ [*33·16] &\equiv .\text{D}ʻP\subset {℩}ʻ\dot{\Lambda} .\text{ᗡ}ʻP\subset {℩}ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*33·24. \supset \vdash :\dot{\exists} !P.&\equiv .\exists !\text{D}ʻP.\exists !\text{ᗡ}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*51·4.\supset \\ \vdash :\dot{\exists} !P.\Sigma ʻP=\dot{\Lambda} .&\equiv .\text{D}ʻP={℩}ʻ\dot{\Lambda} .\text{ᗡ}ʻP={℩}ʻ\dot{\Lambda} .\\ [*55·16] &\equiv .P=\dot{\Lambda} \downarrow \dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

In the present number we have to define mutually exclusive relations, and to give a few of their properties. Mutually exclusive relations play much the same part in relation-arithmetic as mutually exclusive classes play in cardinal arithmetic. Prima facie, there are various ways in which we might define them. We might define $P$ as a relation of mutually exclusive relations when $\begin{aligned} QPR . Q &\neq R . \supset _{Q,R} . Q \dot{\cap} R = \dot{\Lambda} ,\\ \text{or when}\quad Q,R \in CʻP . Q &\neq R . \supset _{Q,R} . Q \dot{\cap} R = \dot{\Lambda} , \end{aligned}$ or when $Q,R \in CʻP . Q \neq R . \supset _{Q,R} . \text{D}ʻQ \cap \text{D}ʻR = \Lambda . \text{ᗡ}ʻQ \cap \text{ᗡ}ʻR = \Lambda ,$ or in several other ways. But in fact the most useful property to choose is the property that any two members of the field have mutually exclusive fields, i.e. $Q,R \in CʻP . Q \neq R . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda .$

The principal applications of the subjects studied in this Part are to series, and in series it is always the fields of the relations that are important. We want, for instance, to define relations of mutually exclusive relations in such a way that, if $P$ is a serial relation, and every member of $CʻP$ is a serial relation, then $\Sigma ʻP$ is a serial relation. For this purpose it is necessary that $\Sigma ʻP$ should be contained in diversity, which requires that $F^{;}P$ should be contained in diversity, i.e. that $QPR . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda .$ If $P$ is a serial relation, as we are supposing, this is equivalent to $Q,R \in CʻP . Q \neq P . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda .$

Again we want to define relations of mutually exclusive relations in such a way that, if $P$ and $Q$ are two such relations, and $P$ and $Q$ have double likeness (cf. *164), then $\Sigma ʻP$ is like $\Sigma ʻQ$ ; i.e. if we are given a correlator $S$ of $P$ and $Q$ , and for every $M$ and $N$ which $S$ correlates, we are again given a correlator, then $\Sigma ʻP$ is to be like $\SigmaʻQ$ . That is, if $\lambda$ is the class of relations which correlate pairs of relations $M$ and $N$ , where $N\in CʻQ.MSN$ , we want[Pg 370] $\dot{s} ʻ\lambda$ to be a correlator of $P$ and $Q$ . Now this requires that $\dot{s} ʻ\lambda$ should be a one-one relation, which requires $M,M' \in CʻP . M \neq M' . \supset _{M,M'} . \text{D}ʻM \cap \text{D}ʻM' = \Lambda . \text{ᗡ}ʻM \cap \text{ᗡ}ʻM' = \Lambda .$ This is secured by $M,M' \in CʻP . M \neq M' . \supset _{M,M'} . CʻM \cap CʻM' = \Lambda ,$ but except for special classes of relations it is not secured by $MPM' . \supset _{M,M'} . CʻM \cap CʻM' = \Lambda ,$ since there may be two relations $M$ and $M'$ which both belong to the field of $P$ , but of which neither has the relation $P$ to the other. Again, the analogy with cardinal arithmetic fails at many points unless, when $P$ is a relation of mutually exclusive relations, $CʻʻCʻP$ is a class of mutually exclusive classes. But this is not secured by any of the other possible definitions we have been considering. There are further reasons, connected with the arithmetical product of a relation of relations, for choosing as the definition $Q,R \in CʻP . Q \neq R . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda .$

From a technical point of view, the properties of a $\text{Cls}^{2} \text{excl}$ depend mainly upon the fact that when $\kappa$ is such a class, $\in \upharpoonright \kappa \in \text{Cls}\rightarrow 1$ (*84·14); in like manner the properties of a $\text{Rel}^{2}\text{excl}$ depend upon $F\upharpoonright CʻP \in \text{Cls} \rightarrow 1 ,$ which requires our definition, and is equivalent to it (*163·12). We thus become able to use the propositions of *81 on selections from many-one relations, which would not otherwise be the case.

It should be observed that $Q,R \in CʻP . Q \neq R . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda$ is not equivalent to $CʻʻCʻP \in \text{Cls}^{2} \text{excl} ,$ though it implies this. The converse implication will fail if $CʻP$ contains two different relations with the same field. E.g. take a relation $P$ whose field consists of the four relations $S$ , $\breve{S}$ , $T$ , $\breve{T}$ , and suppose $CʻS\cap CʻT=\Lambda$ . Then $CʻʻCʻP=\iota ʻCʻS\cup \iota ʻCʻT$ , and $CʻʻCʻP\in \text{Cls}^{2} \text{excl}$ . But unless $S = \breve{S}$ and $T=\breve{T}$ we shall not have $Q,R \in CʻP . Q \neq R . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda .$

The property by which we define relations of mutually exclusive relations is a property which only depends on the field, so that we might equally well put $(\text{Cl}ʻ\text{Rel})\text{excl} = \hat{\lambda} \{Q,R \in \lambda . Q \neq R . \supset _{Q,R} . CʻQ \cap CʻR = \Lambda \} \quad\text{Df}.$ [Pg 371]But for our purposes this would be less convenient than the definition of $\text{Rel}^{2}\text{excl}$ .

*163·01. $\text{Rel}^{2}\text{excl}=\hat{P} \{Q,R\in CʻP.Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda\} \quad\text{Df}$

*163·11. $\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\equiv :Q,R\in CʻP.\exists !CʻQ\cap CʻR.\supset _{Q,R}.Q=R$

*163·12. $\vdash :P\in \text{Rel}^{2}\text{excl}.\equiv .F\upharpoonright CʻP\in \text{Cls}\rightarrow 1$

*163·17. $\vdash :P\in \text{Rel}^{2}\text{excl}.\equiv .C\upharpoonright CʻP\in 1\rightarrow 1.CʻʻCʻP\in \text{Cls}^{2} \text{excl}$

Any of the above might have been used to define $\text{Rel}^{2}\text{excl}$ . The following propositions are important.

*163·3. $\vdash :Q\in \text{Rel}^{2}\text{excl}.S\in \text{Cls}\rightarrow 1.\supset .S\dagger ^{;}Q\in \text{Rel}^{2}\text{excl}$

*163·4·41. $\vdash .\dot{\Lambda} ,P\downarrow P\in \text{Rel}^{2}\text{excl}$

*163·441. $\vdash :P,Q\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap Cʻ\Sigma ʻQ=\Lambda .\supset .P\unicode{x2909}Q\in \text{Rel}^{2}\text{excl}$

*163·451. $\vdash :P\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap CʻR=\Lambda .\supset .P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}$

*163·01. $\text{Rel}^{2}\text{excl}=\hat{P} \{Q,R\in CʻP.Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda\} \quad\text{Df}$

*163·1. $\begin{align}&\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\equiv :Q,R\in CʻP.Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda \\ &[(*163·01)]\end{align}$

*163·11. $\begin{align}&\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\equiv :Q,R\in CʻP.\exists !CʻQ\cap CʻR.\supset _{Q,R}.Q=R\\ &[*163·1.\text{Transp}]\end{align}$

*163·12. $\vdash :P\in \text{Rel}^{2}\text{excl}.\equiv .F\upharpoonright CʻP\in \text{Cls}\rightarrow 1 \quad[*163·1.*74·632]$

For many purposes, this proposition gives the most useful equivalent of $P\in \text{Rel}^{2}\text{excl}$ .

Instead of the above proof, we may use *74·62, which gives us the result in virtue of *33·5.

*163·13. $\begin{align}\vdash \colon\ldotp P&\in \text{Rel}^{2}\text{excl}.\supset :\\ &Q,R\in CʻP.Q\neq R.\supset _{Q,R}.\text{D}ʻQ\cap \text{D}ʻR=\Lambda .\text{ᗡ}ʻQ\cap \text{ᗡ}ʻR=\Lambda \\ &[*24·402 .*163·1]\end{align}$

*163·14. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .C\upharpoonright CʻP\in 1\rightarrow 1 \quad[*163·12.*74·32.*33·5]$

*163·15. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{D}\upharpoonright CʻP,\text{ᗡ}\upharpoonright CʻP\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*74·63.*163·13.\supset \vdash :\text{Hp}.&\supset .(\in \mid \text{D})\upharpoonright CʻP\in \text{Cls}\rightarrow 1.\\ [*74·32] &\supset .\overrightarrow{\in \mid \text{D}} \upharpoonright CʻP\in 1\rightarrow 1.\\ [*72·27] &\supset .\text{D}\upharpoonright CʻP\in 1\rightarrow 1 &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\text{ᗡ}\upharpoonright CʻP\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*163·16. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .CʻʻCʻP\in \text{Cls}^{2} \text{excl} \quad[*84·51.*33·5.*163·12]$

*163·17. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.\equiv .C\upharpoonright CʻP\in 1\rightarrow 1.CʻʻCʻP\in \text{Cls}^{2} \text{excl}\\ &[*163·12.*84·522.*33·5]\end{align}$

*163·2. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{D}\upharpoonright F_{\Delta }ʻCʻP\in 1\rightarrow 1.F_{\Delta }ʻCʻP\subset 1\rightarrow 1\\ &[*81·21·1.*163·12]\end{align}$

*163·21. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{D}ʻʻF_{\Delta }ʻCʻP=\text{Prod}ʻCʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*85·1.\frac{F,\,CʻP}{Q,\,\lambda}.*163·12.\supset \vdash :\text{Hp}.\supset .\text{D}ʻʻF_{\Delta }ʻCʻP&=\text{D}ʻʻ{\in}_{\Delta}ʻ\overrightarrow{F}ʻʻCʻP\\ [*115·1.*33·5] & =\text{Prod}ʻCʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

This proposition is important in connection with the multiplication of relations, for we shall define as the product of a relation $P$ (whose field consists of relations) a relation whose field is $\text{D}ʻʻF_{\Delta }ʻCʻP$ . Thus by the above proposition, whenever $P$ is a $\text{Rel}^{2}\text{excl}$ , the field of its product is the product (in the cardinal sense) of the fields of its field, just as the field of its sum is (by *162·22) the sum of the fields of its field.

*163·22. $\begin{align}\vdash :P\in \text{Rel}^{2}\text{excl}.\dot{\Lambda} &{\sim}\in CʻP.\supset .\\ &\overrightarrow{B}ʻ\Sigma ʻP=Bʻʻ\overrightarrow{B}ʻP.\overrightarrow{B}ʻ\text{Cnv}ʻ\Sigma ʻP=Bʻʻ\text{Cnv}ʻʻ\overrightarrow{B}ʻ\breve{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*162·23·213.*93·103.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\Sigma ʻP&=FʻʻCʻP-sʻCʻʻ\text{ᗡ}ʻP-sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP\\ [*40·56] &=FʻʻCʻP-Fʻʻ\text{ᗡ}ʻP-sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP\\ [*71·381.*37·421.*163·12]&=Fʻʻ(CʻP-\text{ᗡ}ʻP)-sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP\\ [*40·56.*93·103] &=sʻCʻʻ\overrightarrow{B}ʻP-sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP &\qquad \text{(1)}\\ \vdash .*163·11.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp Q\in \overrightarrow{B}ʻP.x\in CʻQ.&\supset :R\in \overrightarrow{B}ʻP.x\in \text{ᗡ}ʻR.\supset .R=Q.\\ [*13·12] &\supset .x\in \text{ᗡ}ʻQ:\\ [*40·4] &\supset :x\in sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP.\supset .x\in \text{ᗡ}ʻQ:\\ [*40·13] &\supset :x\in sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP.\equiv .x\in \text{ᗡ}ʻQ &\qquad \text{(2)}\\ \vdash .(2).*5·32.\supset \vdash \colon\ldotp \text{Hp}.\supset :Q\in \overrightarrow{B}ʻP.x&\in CʻQ.x{\sim}\in sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP.\equiv .\\ &Q\in \overrightarrow{B}ʻP.x\in CʻQ.x{\sim}\in \text{ᗡ}ʻQ:\\ [*10·281.*40·4.*93·103] \supset :x\in sʻCʻʻ\overrightarrow{B}ʻP-sʻ\text{ᗡ}ʻʻ\overrightarrow{B}ʻP.&\equiv .(\exists Q).Q\in \overrightarrow{B}ʻP.xBQ.\\ [*37·1] &\equiv .x\in Bʻʻ\overrightarrow{B}ʻP &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\Sigma ʻP=Bʻʻ\overrightarrow{B}ʻP &\qquad \text{(4)}\\ \vdash .(4).*162·2.*33·22.*163·1.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\text{Cnv}\\ʻ\Sigma ʻP&=Bʻʻ\overrightarrow{B}ʻ\text{Cnv}^{;}\breve{P} \\ [*151·6·5] & =Bʻʻ\text{Cnv}ʻʻ\overrightarrow{B}ʻ\breve{P} &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*163·3. $\vdash :Q\in \text{Rel}^{2}\text{excl}.S\in \text{Cls}\rightarrow 1.\supset .S\dagger ^{;}Q\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*72·421.&\supset \vdash \colon\ldotp \text{Hp}.\supset :M,N\in CʻQ.\exists !SʻʻCʻM\cap SʻʻCʻN.\supset .\exists !CʻM\cap CʻN.\\ [*163·11] &\supset .M=N.\\ [*30·37] &\supset .S\dagger M=S\dagger N &\qquad \text{(1)}\\ \vdash .(1).*150·202.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &M,N\in CʻQ.\exists !Cʻ(S\dagger M)\cap Cʻ(S\dagger N).\supset .S\dagger M=S\dagger N &\qquad \text{(2)}\\ \vdash .(2).*163·11.\supset \vdash .\text{Prop} \end{array}$

*163·31. $\vdash \colon\ldotp CʻP=CʻQ.\supset :P\in \text{Rel}^{2}\text{excl}.\equiv .Q\in \text{Rel}^{2}\text{excl} \quad[*163·1.*13·12]$

*163·311. $\vdash \colon\ldotp CʻQ=\text{Cnv}ʻʻCʻP.\supset :P\in \text{Rel}^{2}\text{excl}.\equiv .Q\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*72·513.\supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp M,N\in CʻP.\equiv .\breve{M} ,\breve{N} \in CʻQ\colon\ldotp \\ [*31·32] &\supset \colon\ldotp M,N\in CʻP.M\neq N.\equiv .\breve{M} ,\breve{N} \in CʻQ.\breve{M} \neq \breve{N} \colon\ldotp \\ [*33·22] &\supset \colon\ldotp M,N\in CʻP.M\neq N.\supset .CʻM\cap CʻN=\Lambda :\equiv :\\ &\breve{M} ,\breve{N} \in CʻQ.\breve{M} \neq \breve{N} .\supset .Cʻ\breve{M} \cap Cʻ\breve{N} =\Lambda \colon\ldotp \\ [*11·33.*163·1]&\supset \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\equiv :\\ &\breve{M} ,\breve{N} \in CʻQ.\breve{M} \neq \breve{N} .\supset _{M,N}.Cʻ\breve{M} \cap Cʻ\breve{N} =\Lambda :\\ [*31·51] &\equiv :M,N\in CʻQ.M\neq N.\supset _{M,N}.CʻM\cap CʻN=\Lambda :\\ [*163·1] &\equiv :Q\in \text{Rel}^{2}\text{excl}\colon\colon \supset \vdash .\text{Prop} \end{array}$

*163·32. $\begin{align}\vdash :P\in \text{Rel}^{2}\text{excl}.&\equiv .\breve{P} \in \text{Rel}^{2}\text{excl}.\equiv .\text{Cnv}^{;}P\in \text{Rel}^{2}\text{excl}.\equiv .\\ &\text{Cnv}^{;}\breve{P} \in \text{Rel}^{2}\text{excl}\quad[*163·31·311.*33·22.*150·22·12]\end{align}$

*163·33. $\vdash :P\unicode{x2909}Q\in \text{Rel}^{2}\text{excl}.\equiv .Q\unicode{x2909}P\in \text{Rel}^{2}\text{excl} \quad[*163·31.*160·14]$

*163·331. $\begin{align}&\vdash :P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}.\equiv .R\unicode{x21f7}P\in \text{Rel}^{2}\text{excl}\\ &[*163·31.*161·14·2·201]\end{align}$

Dem. $\begin{array}{l} \vdash .*33·241.*24·105.&\supset \vdash .(Q).Q{\sim}\in Cʻ\dot{\Lambda} .\\ [*11·57] &\supset \vdash .(Q,R).Q,R{\sim}\in Cʻ\dot{\Lambda} .\\ [*11·63] &\supset \vdash :Q,R\in Cʻ\dot{\Lambda} .Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*163·1.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*54·25.*55·15.&\supset \vdash .Cʻ(P\downarrow P)\in 1.\\ [*52·41.\text{Transp}] &\supset \vdash .{\sim}(\exists Q,R).Q,R\in Cʻ(P\downarrow P).Q\neq R.\\ [*11·63] &\supset \vdash :Q,R\in Cʻ(P\downarrow P).Q\neq R.\supset _{Q,R}.CʻQ\cap CʻR=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*163·1.\supset \vdash .\text{Prop} \end{array}$

*163·42. $\vdash \colon\ldotp P\downarrow Q\in \text{Rel}^{2}\text{excl}.\equiv :P=Q.\lor.CʻP\cap CʻQ=\Lambda$

Dem. $\begin{array}{l} \vdash .*163·1.*55·15.\supset \\ \vdash \colon\ldotp P\downarrow Q\in \text{Rel}^{2}\text{excl}.&\equiv :M,N\in \iota ʻP\cup \iota ʻQ.M\neq N.\supset _{M,N}.CʻM\cap CʻN=\Lambda :\\ [*54·441] & \equiv :P=Q.\lor.CʻP\cap CʻQ=\Lambda .CʻQ\cap CʻP=\Lambda :\\ [*22·51] &\equiv :P=Q.\lor.CʻP\cap CʻQ=\Lambda \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*163·43. $\vdash :P\in \text{Rel}^{2}\text{excl}.Q\,\unicode{x2abd}\, P.\supset .Q\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*33·265. \supset \vdash \colon\ldotp \text{Hp}.&\supset :M,N\in CʻQ.\supset .M,N\in CʻP:\\ [\text{Fact}] &\supset :M,N\in CʻQ.M\neq N.\supset .M,N\in CʻP.M\neq N:\\ [*163·1.\text{Hp}] &\supset .CʻM\cap CʻN=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*163·1.\supset \vdash .\text{Prop} \end{array}$

*163·431. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{Rl}ʻP\subset \text{Rel}^{2}\text{excl} \quad[*163·43]$

*163·44. $\begin{align}\vdash :P\unicode{x2909}Q\in \text{Rel}^{2}&\text{excl}.\equiv .\\ &P,Q\in \text{Rel}^{2}\text{excl}.sʻCʻʻCʻP\cap sʻCʻʻ(CʻQ-CʻP)=\Lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*163·12.*160·14.&\supset \vdash :P\unicode{x2909}Q\in \text{Rel}^{2}\text{excl}.\equiv .F\upharpoonright (CʻP\cup CʻQ)\in \text{Cls}\rightarrow 1.\\ [*74·821] &\equiv .F\upharpoonright CʻP,F\upharpoonright CʻQ\in \text{Cls}\rightarrow 1.FʻʻCʻP\cap Fʻʻ(CʻQ-CʻP)=\Lambda .\\ [*163·12.*40·56] &\equiv .P,Q\in \text{Rel}^{2}\text{excl}.sʻCʻʻCʻP\cap sʻCʻʻ(CʻQ-CʻP)=\Lambda :\supset \vdash .\text{Prop} \end{array}$

*163·441. $\begin{align}&\vdash :P,Q\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap Cʻ\Sigma ʻQ=\Lambda .\supset .P\unicode{x2909}Q\in \text{Rel}^{2}\text{excl}\\ &[*163·44.*162·22]\end{align}$

*163·442. $\begin{align}\vdash \colon\ldotp CʻP&\cap CʻQ=\Lambda .\supset :\\ &P\unicode{x2909}Q\in \text{Rel}^{2}\text{excl}.\equiv .P,Q\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap Cʻ\Sigma ʻQ=\Lambda \end{align}$

Dem. $\begin{array}{l} \vdash .*24·313. \supset \vdash :\text{Hp}.\supset .CʻQ-CʻP=CʻQ &\qquad \text{(1)}\\ \vdash .(1).*163·44.*162·22.\supset \vdash .\text{Prop} \end{array}$

*163·45. $\vdash :P\unicode{x2909}R\in \text{Rel}^{2}\text{excl}.\equiv .P\in \text{Rel}^{2}\text{excl}.sʻCʻʻ(CʻP-\iota ʻR)\cap CʻR=\Lambda$

Dem. $\begin{array}{l} \vdash .*161·14.*163·12.\supset \\ \vdash \colon\ldotp \dot{\exists} !P.\supset :P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}.&\equiv .F\upharpoonright (CʻP\cup \iota ʻR)\in \text{Cls}\rightarrow 1.\\ [*74·821.*53·301.*33·5] &\equiv .F\upharpoonright CʻP,F\upharpoonright \iota ʻR\in \text{Cls}\rightarrow 1.Fʻʻ(CʻP-\iota ʻR)\cap CʻR=\Lambda .\\ [*35·101.*71·171] &\equiv .F\upharpoonright CʻP\in \text{Cls}\rightarrow 1.Fʻʻ(CʻP-\iota ʻR)\cap CʻR=\Lambda .\\ [*163·12.*40·56] &\equiv :P\in \text{Rel}^{2}\text{excl}.sʻCʻʻ(CʻP-\iota ʻR)\cap CʻR=\Lambda &\qquad \text{(1)}\\ \vdash .*161·2.*163·4.&\supset \vdash :P=\dot{\Lambda} .\supset .P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}.P\in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .*33·241.*37·29.*40·21.&\supset \vdash :P=\dot{\Lambda} .\supset .sʻCʻʻ(CʻP-{℩}ʻR)\cap CʻR=\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\text{Comp}.*5·1.&\supset \vdash \colon\ldotp P=\dot{\Lambda} .\supset :\\ &P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}.\equiv .P\in \text{Rel}^{2}\text{excl}.sʻCʻʻ(CʻP-{℩}ʻR)\cap CʻR=\Lambda &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*163·451. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap CʻR=\Lambda .\supset .P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}\\ &[*163·45.*162·22]\end{align}$

*163·452. $\begin{align}&\vdash \colon\ldotp R{\sim}\in CʻP.\supset :P\unicode{x21f8} R\in \text{Rel}^{2}\text{excl}.\equiv .P\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap CʻR=\Lambda \\ &[*51·222.*163·45.*162·22]\end{align}$

*163·46. $\begin{align}&\vdash :R\unicode{x21f7}P\in \text{Rel}^{2}\text{excl}.\equiv .P\in \text{Rel}^{2}\text{excl}.sʻCʻʻ(CʻP-{℩}ʻR)\cap CʻR=\Lambda \\ &[*163·45·331]\end{align}$

*163·461. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap CʻR=\Lambda .\supset .R\unicode{x21f7}P\in \text{Rel}^{2}\text{excl}\\ &[*163·451·331]\end{align}$

*163·462. $\begin{align}&\vdash \colon\ldotp R{\sim}\in CʻP.\supset :R\unicode{x21f7}P\in \text{Rel}^{2}\text{excl}.\equiv .P\in \text{Rel}^{2}\text{excl}.Cʻ\Sigma ʻP\cap CʻR=\Lambda \\ &[*163·452·331]\end{align}$

The subject of this number is of great importance throughout relation-arithmetic and its applications. Double likeness, or double ordinal similarity, is a relation which is to hold between $P$ and $Q$ when (1) $P$ and $Q$ are like, (2) correlated members of the fields of $P$ and $Q$ are like, with a specific given correlator in each case. (It is necessary, in general, to have a given correlator in each case, to avoid the necessity of the multiplicative axiom for selecting among correlators.) This definition can be somewhat simplified by starting from a relation correlating $\Sigma ʻP$ and $\Sigma ʻQ$ . If $S$ is such a correlator, so that $S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.\Sigma ʻP=S^{;}\Sigma ʻQ,$ we want $S$ to be such that it not only correlates the whole of $\Sigma ʻP$ with the whole of $\Sigma ʻQ$ , but also correlates each member of $CʻP$ with the corresponding member of $CʻQ$ , i.e. such that, if $N$ is any member of $CʻQ$ , $S^{;}N$ is the corresponding member of $CʻP$ . This requires $NQN'.\equiv .(S^{;}N)P(S^{;}N'),$ i.e. writing $S\dagger ʻN$ , $S\dagger ʻN'$ in place of $S^{;}N, S^{;}N'$ , it requires $P=S\dagger ^{;}Q.$ When $P=S\dagger ^{;}Q$ and $\text{ᗡ}ʻS=Cʻ\Sigma ʻQ$ , we have $\Sigma ʻP=S^{;}\Sigma ʻQ$ by *162·35. Hence double likeness will subsist if there is a relation $S$ such that $S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=S\dagger ^{;}Q.$

A relation $S$ fulfilling this condition will be called a double correlator of $P$ and $Q$ . Thus two relations $P$ and $Q$ have double likeness when there exists a double correlator of $P$ and $Q$ , i.e. when $(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=S\dagger ^{;}Q.$ A double correlator of $P$ and $Q$ is a relation $S$ which is a correlator of $\Sigma ʻP$ and $\Sigma ʻQ$ and is such that $S\dagger \upharpoonright CʻQ$ is a correlator of $P$ and $Q$ .

It will be seen that this definition has the usual analogy to the corresponding definition in cardinals (*111·01). The two inverted commas of the cardinal definition are replaced by the semi-colon, and $S_{\in }$ is replaced by $S\dagger$ , and $sʻ\lambda$ is replaced by $\Sigma ʻQ$ or $Cʻ\Sigma ʻQ$ . The propositions of the present number consist largely of analogues of the propositions of *111, in accordance with the above substitutions.

If it were not for the difficulty of choice among correlators, we could define two relations as having double likeness when they are like relations of like relations, i.e. when, if $P$ and $Q$ are the two relations, they have a correlator $S$ such that, if $MSN$ , then $M \text{smor} N$ . In this case, $S\in P\overline{\text{smor}}Q\cap \text{Rl}ʻ\text{smor}$ . Thus we have to consider the relations of the class $P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}$ to the class of double correlators, and we have to consider the relation of the relation " $\exists !P\,\overline{\text{smor}}\,Q\cap\text{Rl}ʻ\text{smor}$ " to the relation of double likeness. The propositions to be proved on this subject in the present number are analogous to the propositions of *111. But at a later stage (*251·61) we shall show that if the field of $P$ consists entirely of relations which generate well-ordered series, then the use of the multiplicative axiom ceases to be necessary in identifying double likeness with the relation $\exists!P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}$ , the reason being that two well-ordered series can never be correlated in more than one way.

*164·01. $P\,\overline{\text{smor}}\,\overline{\text{smor}}\,Q=(1\rightarrow 1)\cap \overleftarrow{\text{ᗡ}}ʻCʻ\Sigma ʻQ\cap \hat{S} (P=S\dagger ^{;}Q) \quad\text{Df}$

*164·02. $\text{smor} \text{smor}=\hat{P} \hat{Q} (\exists !P\,\overline{\text{smor}}\,\overline{\text{smor}}\,Q) \quad\text{Df}$

*164·15. $\vdash :S\in P\,\overline{\text{smor}}\,\overline{\text{smor}}\,Q.\equiv .S\in \Sigma ʻP\,\overline{\text{smor}}\,\Sigma ʻQ.(S\dagger )\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

*164*151. $\vdash :P \,\text{smor}\,\text{smor}\,Q.\supset .\Sigma ʻP\,\text{smor}\,\Sigma ʻQ.P\,\text{smor}\,Q$

*164*18. $\begin{align}\vdash :S\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\text{smor}}\,&\overline{\text{smor}}\,Q.\equiv .\\ &S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1.Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻS.P=S\dagger ^{;}Q\end{align}$

This is usually the most convenient proposition when a double correlation has to be proved.

*164·31. $\vdash :S\in P\,\overline{\text{smor}}\,\overline{\text{smor}}\,Q.\equiv .S\in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ).P=S\dagger ^{;}Q$

We then have a set of propositions (*164·4 to the end) on the identification of $\exists !P\,\overline{\text{smor}}\,Q\cap\text{Rl}ʻ\text{smor}$ with double likeness by means of the multiplicative axiom. We have

*164·43. $\begin{align}\vdash \colon\ldotp P,Q&\in \text{Rel}^{2}\text{excl}.S\in P\,\overline{\text{smor}}\,Q.\\ &\mu =\hat{\lambda}\{(\exists N).N\in CʻQ.\lambda =(SʻN)\,\overline{\text{smor}}\,N\}.\supset :\\ &R\in {\in}_{\Delta}ʻ\mu .\supset .\dot{s} ʻ\text{D}ʻR\in P\,\overline{\text{smor}}\,\overline{\text{smor}}\,Q.S=(\dot{s} ʻ\text{D}ʻR)\dagger \upharpoonright CʻQ\end{align}$

That is to say, given that $P$ and $Q$ are like relations of like mutually exclusive relations, if we can pick out one correlator for each pair of correlated members of $CʻP$ and $CʻQ$ , then the sum $(\dot{s})$ of such selected correlators is a double correlator of $P$ and $Q$ . Hence, observing that if $S$ is a double correlator of $P$ and $Q$ , $(S\dagger)\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}$ (*164·15 ·16), we arrive at

*164·45. $\begin{align}\vdash \colon\colon &\text{Mult ax}.\supset \colon\ldotp \\ &P,Q\in \text{Rel}^{2}\text{excl}.\supset :\exists !P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\equiv .P \,\text{smor}\,\text{smor}\,Q\end{align}$

*164·46. $\begin{align}\vdash \colon\ldotp &\text{Mult ax}.\supset :\\ &P,Q\in \text{Rel}^{2}\text{excl}.\exists !P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\supset .\Sigma ʻP \,\text{smor}\,\Sigma ʻQ\end{align}$

*164·48. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :R,S\in \text{Rel}^{2}\text{excl}\cap &\text{Nr}ʻQ.CʻR,CʻS\in \text{Cl}ʻ\text{Nr}ʻP.\supset .\\ &R\,\text{smor}\,\text{smor}\,S.\Sigma ʻR\,\text{smor}\,\Sigma ʻS\end{align}$

I.e. in effect, assuming the multiplicative axiom, if two series $(\Sigma ʻR$ and $\Sigma ʻS$ ) can each be divided into $\beta$ sets of $\alpha$ terms ( $\alpha$ , $\beta$ being relation-numbers), then the two series are ordinally similar, and the $\beta$ sets in the one case have double similarity with the $\beta$ sets in the other. (Here we have written $\alpha$ , $\beta$ in place of the $\text{Nr}ʻP$ and $\text{Nr}ʻQ$ of the enunciation.)

It is by means of the above propositions that ordinal addition and multiplication are connected, as will appear in *166.

*164·01. $P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q=(1\rightarrow 1)\cap \overleftarrow{\text{ᗡ}}ʻCʻ\Sigma ʻQ\cap \hat{S} (P=S\dagger ^{;}Q) \quad\text{Df}$

*164·02. $\text{smor} \text{smor} =\hat{P} \hat{Q} (\exists !P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q) \quad\text{Df}$

*164·1. $\begin{align}&\vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\equiv .S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=S\dagger ^{;}Q\\ &[(*164·01)]\end{align}$

*164·11. $\vdash :P \,\text{smor} \text{smor} Q.\equiv .\exists !P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q \quad[(*164·02)]$

*164·12. $\begin{align}&\vdash :P \,\text{smor} \text{smor} Q.\equiv .(\exists S).S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=S\dagger ^{;}Q\\ &[*164·1·11]\end{align}$

*164·13. $\begin{align}&\vdash :S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1.Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻS.\supset .(S\dagger )\upharpoonright CʻQ\in 1\rightarrow 1\\ &[*150·152.*162·22]\end{align}$

*164·131. $\vdash :\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=S\dagger ^{;}Q.\supset .\text{D}ʻS=Cʻ\Sigma ʻP.\Sigma ʻP=S^{;}\Sigma ʻQ$

Dem. $\begin{array}{l} \vdash .*162·35.\supset \vdash :\text{Hp}.&\supset .\Sigma ʻP=S^{;}\Sigma ʻQ &\qquad \text{(1)}\\ [*150·23.\text{Hp}] &\supset .Cʻ\Sigma ʻP=\text{D}ʻS &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*164·14. $\vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .S\in \Sigma ʻP\overline{\text{smor}} \Sigma ʻQ \quad[*164·1·131.*151·11]$

*164·141. $\vdash :Cʻ\Sigma ʻQ\subset \alpha .\supset .(T\upharpoonright \alpha )\dagger ^{;}Q=T\dagger ^{;}Q \quad[*150·171.*162·22]$

*164·142. $\vdash .(T\upharpoonright Cʻ\Sigma ʻQ)\dagger ^{;}Q=T\dagger ^{;}Q=\{(T\dagger )\upharpoonright CʻQ\}^{;}Q \quad[*164·141.*150·32]$

*164·143. $\vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .(S\dagger )\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

Dem. $\begin{array}{l} \vdash .*164·1·13. &\supset \vdash :\text{Hp}.\supset .(S\dagger )\upharpoonright CʻQ\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*35·65. &\supset \vdash .\text{ᗡ}ʻ(S\dagger )\upharpoonright CʻQ=CʻQ &\qquad \text{(2)}\\ \vdash .*164·1.*150·32. &\supset \vdash :\text{Hp}.\supset .P={(S\dagger )\upharpoonright CʻQ}^{;}Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·11.\supset \vdash .\text{Prop} \end{array}$

*164·15. $\vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\equiv .S\in \Sigma ʻP\overline{\text{smor}} \Sigma ʻQ.(S\dagger )\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q$

Dem. $\begin{array}{l} \vdash .*164·14·143.\supset \\ \vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .S\in \Sigma ʻP\overline{\text{smor}} \Sigma ʻQ.(S\dagger )\upharpoonright &CʻQ\in P\,\overline{\text{smor}}\,Q &\qquad \text{(1)}\\ \vdash .*151·11.\supset \\ \vdash :S\in \Sigma ʻP\overline{\text{smor}} \Sigma ʻQ.(S\dagger )\upharpoonright &CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .\\ &S\in 1\rightarrow 1.\text{ᗡ}ʻS=Cʻ\Sigma ʻQ.P=\{(S\dagger )\upharpoonright CʻQ\}^{;}Q &\qquad \text{(2)}\\ \vdash .(2).*150·32.*164·1.\supset \\ \vdash :S\in \Sigma ʻP\overline{\text{smor}} \Sigma ʻQ.(S\dagger )\upharpoonright &CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*164·151. $\vdash :P\,\text{smor}\,\text{smor}\,Q.\supset .\Sigma ʻP\,\text{smor}\,\Sigma ʻQ.P\,\text{smor}\,Q \quad[*164·15·11]$

*164·16. $\vdash :S\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .(S\dagger )\upharpoonright CʻQ\,\unicode{x2abd}\, \text{smor}$

Dem. $\begin{array}{l} \vdash .*35·101.*150·1.&\supset \vdash :M{(S\dagger )\upharpoonright CʻQ}N.\equiv .N\in CʻQ.M=S^{;}N &\qquad \text{(1)}\\ \vdash .*164·1.*162·22.\supset \vdash \colon\ldotp \text{Hp}.&\supset :S\in 1\rightarrow 1:N\in CʻQ.\supset _{N}.CʻN\subset \text{ᗡ}ʻS:\\ [*151·23] &\supset :N\in CʻQ.M=S^{;}N.\supset _{M,N}.M\,\text{smor}\,N\\ [(1)] &\supset :M{(S\dagger )\upharpoonright CʻQ}N.\supset _{M,N}.M\,\text{smor}\,N\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*164·17. $\vdash :P\,\text{smor}\,\text{smor}\,Q.\supset .\exists !P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor} \quad[*164·143·16]$

This proposition states that when $P$ and $Q$ have double likeness, there is a correlator of $P$ and $Q$ which couples like with like relations; i.e. if $S$ is the correlator, then, if $MSN$ , $M$ and $N$ are ordinally similar. The converse of this proposition, namely, that if $P$ and $Q$ have a correlator which couples ordinally similar relations, then $P$ and $Q$ have double likeness, can be proved if the multiplicative axiom is assumed, but not otherwise, except in special cases, such as that of well-ordered series.

The following proposition is used frequently, owing to the fact that, in the cases we are concerned with, double correlators generally have the form $S\upharpoonright Cʻ\Sigma ʻQ$ , where $S$ is some relation for which we have $(y).\text{E}!Sʻy$ .

*164·18. $\begin{align}\vdash :S\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\text{smor}}\,&\overline{\text{smor}}\,Q.\equiv .\\ &S\upharpoonright Cʻ\SigmaʻQ \in 1\rightarrow 1.Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻS.P=S\dagger ^{;}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*35·64.*22·621.&\supset \vdash :\text{ᗡ}ʻ(S\upharpoonright Cʻ\Sigma ʻQ)=Cʻ\Sigma ʻQ.\equiv .Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻS &\qquad \text{(1)}\\ \vdash .*164·142. &\supset \vdash :P=(S\upharpoonright Cʻ\Sigma ʻQ)\dagger Q.\equiv .P=S\dagger ^{;}Q &\qquad \text{(2)}\\ \vdash .*164·1. &\supset \vdash :S\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\equiv .\\ &S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1.\text{ᗡ}ʻ(S\upharpoonright Cʻ\Sigma ʻQ)=Cʻ\Sigma ʻQ.P=(S\upharpoonright Cʻ\Sigma ʻQ)\dagger ^{;}Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*164·181. $\vdash : P \,\text{smor} \text{smor} Q. \equiv . (\exists S). S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1. Cʻ\Sigma ʻQ \subset \text{ᗡ}ʻS. P = S\dagger ^{;} Q$

Dem. $\begin{array}{l} \vdash . *35·66. *164·1. \supset \\ \vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \supset . S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1. Cʻ\Sigma ʻQ \subset \text{ᗡ}ʻS .P = S\dagger ^{;} Q &\qquad \text{(1)}\\ \vdash . (1). *164·11. \supset \\ \vdash : P \,\text{smor}\,\text{smor}\,Q. \supset . (\exists S). S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1. Cʻ\Sigma ʻQ \subset \text{ᗡ}ʻS. P = S\dagger ^{;} Q &\qquad \text{(2)}\\ \vdash . *164·18·11. \supset \\ \vdash : (\exists S). S\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1. Cʻ\Sigma ʻQ \subset \text{ᗡ}ʻS. P = S\dagger ^{;} Q. \supset . P \,\text{smor} \text{smor} Q &\qquad \text{(3)}\\ \vdash . (2). (3). \supset \vdash . \text{Prop} \end{array}$

The following propositions are concerned in proving that double likeness is reflexive, symmetrical, and transitive.

*164·2. $\vdash . I\upharpoonright Cʻ\Sigma ʻP\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, P$

Dem. $\begin{array}{l} \vdash . *151·121. &\supset \vdash . I\upharpoonright Cʻ\Sigma ʻP\in \Sigma ʻP\,\overline{\text{smor}}\,\Sigma ʻP. I\upharpoonright CʻP\in P\,\overline{\text{smor}}\,P &\qquad \text{(1)}\\ \vdash . *35·101. *150·1.\supset \\ \vdash : M{(I\upharpoonright Cʻ\Sigma ʻP)\dagger \upharpoonright CʻP}N. &\equiv . N\in CʻP. M = (I\upharpoonright Cʻ\Sigma ʻP)^{;} N.\\ [*150·33. *162·22] & \equiv .N\in CʻP. M = I^{;} N.\\ [*150·53] &\equiv . M(I\upharpoonright CʻP)N &\qquad \text{(2)}\\ \vdash . (1). (2). &\supset \vdash . I\upharpoonright Cʻ\Sigma ʻP\in \Sigma ʻP\,\overline{\text{smor}}\,\Sigma ʻP. (I\upharpoonright Cʻ\Sigma ʻP)\dagger \upharpoonright CʻP\in P \overline{\text{smor}} P.\\ [*164·15] &\supset \vdash . \text{Prop} \end{array}$

*164·21. $\vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \equiv . \breve{S} \in Q \,\overline{\text{smor}}\,\overline{\text{smor}}\, P$

Dem. $\begin{array}{l} \vdash . *164·1. *71·212. &\supset \vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \supset . \breve{S} \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash . *164·131·1 . &\supset \vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \supset . \text{ᗡ}ʻ\breve{S} = Cʻ\Sigma ʻP &\qquad \text{(2)}\\ \vdash . *150·94. *164·1. *162·22. &\supset \vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \supset . Q = \breve{S} \dagger ^{;} P &\qquad \text{(3)}\\ \vdash . (1). (2). (3). *164·1. &\supset \vdash : S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \supset . \breve{S} \in Q \,\overline{\text{smor}}\,\overline{\text{smor}}\, P &\qquad \text{(4)}\\ \vdash . (4) \frac{\breve{S},\,Q,\,P}{S,\,P,\,Q}. &\supset \vdash : \breve{S} \in Q \,\overline{\text{smor}}\,\overline{\text{smor}}\, P. \supset . S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q &\qquad \text{(5)}\\ \vdash . (4). (5). \supset \vdash . \text{Prop} \end{array}$

*164·211. $\vdash : P \,\text{smor}\,\text{smor}\,Q. \equiv . Q\,\text{smor}\,\text{smor}\,P \quad[*164·21·11]$

*164·22. $\vdash :S\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. T\in Q \,\overline{\text{smor}}\,\overline{\text{smor}}\, R. \supset . S\mid T\in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, R$

Dem. $\begin{array}{l} \vdash . *164·1. \supset \vdash : \text{Hp}. &\supset . S,T\in 1\rightarrow 1.\\ [*71·252] &\supset . S\mid T\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash . *164·1·131. \supset \vdash : \text{Hp}. &\supset . \text{ᗡ}ʻS = Cʻ\Sigma ʻQ. \text{D}ʻT = Cʻ\Sigma ʻQ.\\ [*37·323] & \supset . \text{ᗡ}ʻ(S\mid T) = \text{ᗡ}ʻT.\\ [*164·1] &\supset . \text{ᗡ}ʻ(S\mid T) = Cʻ\Sigma ʻR &\qquad \text{(2)}\\ \vdash .*150·13·14.&\supset \vdash .(S\mid T)\dagger ^{;}R = S\dagger ^{;}T\dagger ^{;}R &\qquad \text{(3)}\\ \vdash .*164·1.&\supset \vdash :\text{Hp}.\supset .T\dagger ^{;}R = Q.S\dagger ^{;}Q = P &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash :\text{Hp}.\supset .(S\mid T)\dagger ^{;}R = P &\qquad \text{(5)}\\ \vdash .(1).(2).(5).*164·1.\supset \vdash .\text{Prop} \end{array}$

*164·221. $\vdash :P \,\text{smor}\,\text{smor}\,Q.Q\,\text{smor}\,\text{smor}\,R.\supset .P \,\text{smor} \text{smor} R \quad[*164·22·11]$

*164·23. $\vdash \colon\ldotp P \,\text{smor}\,\text{smor}\,Q.\supset :P \in \text{Rel}^{2}\text{excl}.\equiv .Q \in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*164·12. \supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists T).T \in 1\rightarrow 1.\text{ᗡ}ʻT=Cʻ\Sigma ʻQ.P = T\dagger ^{;}Q:\\ [*163·3] &\supset :Q \in \text{Rel}^{2}\text{excl}.\supset .P \in \text{Rel}^{2}\text{excl} &\qquad \text{(1)}\\ \vdash .(1).*164·211.\supset \vdash \colon\ldotp \text{Hp}.&\supset :P \in \text{Rel}^{2}\text{excl}. \supset .Q \in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*164·3. $\vdash :S \in P \,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .S \in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ)$

Dem. $\begin{array}{l} \vdash .*164·1.*162·22.\supset \vdash : \text{Hp}.&\supset .S \in 1 \rightarrow 1.\text{ᗡ}ʻS = sʻCʻʻCʻQ.P = S\dagger ^{;}Q. &\qquad \text{(1)}\\ [*150·931] &\supset .CʻʻCʻP = S_{\in}ʻʻCʻʻCʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).*111·1.\supset \vdash .\text{Prop} \end{array}$

*164·301. $\vdash :P \,\text{smor}\,\text{smor}\,Q.\supset .CʻʻCʻP \text{sm sm} CʻʻCʻQ \quad[*164·3·11.*111·4]$

*164·31. $\vdash :S \in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q. \equiv .S \in (CʻʻCʻP) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ).P=S\dagger ^{;}Q$

Dem. $\begin{array}{l} \vdash .*164·3·1.\supset \\ \vdash :S \in P \,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.\supset .S \in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ).P = S\dagger ^{;}Q &\qquad \text{(1)}\\ \vdash .*111·1.*162·22.\supset \\ \vdash :S \in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ).\supset .S \in 1 \rightarrow 1.\text{ᗡ}ʻS = Cʻ\Sigma ʻQ &\qquad \text{(2)}\\ \vdash .(2).\text{Fact}.*164·1.\supset \\ \vdash :S \in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ).P = S\dagger ^{;}Q.\supset .S \in P \,\overline{\text{smor}} \,\overline{\text{smor}}\, Q &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

This proposition has the merit of reducing the ordinal element in double likeness to a minimum. The proof of $S \in (CʻʻCʻP)\,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻQ)$ is a cardinal problem, and what has to be added for ordinal purposes is merely $P = S\dagger ^{;}Q$ .

*164·32. $\vdash .\dot{\Lambda} \in (\dot{\Lambda} \,\overline{\text{smor}} \,\overline{\text{smor}}\, \dot{\Lambda} ).\dot{\Lambda} \text{smor} \text{smor} \dot{\Lambda}$

In this proposition, the various $\dot{\Lambda}$ 's need not be of the same type. Hence " $\dot{\Lambda}\,\text{smor}\,\text{smor}\,\dot{\Lambda}$ " is not an immediate consequence of *164·201.

Dem. $\begin{array}{l} \vdash .*72·1.*162·4. &\supset \vdash .\dot{\Lambda} \in 1\rightarrow 1.\text{ᗡ}ʻ\dot{\Lambda} =Cʻ\Sigma ʻ\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*150·42. &\supset \vdash .\dot{\Lambda} = \dot{\Lambda} ^{;}\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).*164·1.&\supset \vdash .\dot{\Lambda} \in (\dot{\Lambda} \,\overline{\text{smor}} \,\overline{\text{smor}}\, \dot{\Lambda} ). &\qquad \text{(3)}\\ [*164·11] &\supset .\dot{\Lambda}\,\text{smor smor}\,\dot{\Lambda} &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*164·33. $\begin{align}\vdash :M \in P\,\overline{\text{smor}}\,R.N \in Q \,\overline{\text{smor}}\,S.Cʻ&P \cap CʻQ = \Lambda .CʻR \cap CʻS = \Lambda .\supset .\\ &M \unicode{x228d} N \in (P \downarrow Q)\,\overline{\text{smor}} \,\overline{\text{smor}}\, (R \downarrow S)\end{align}$

Dem. $\begin{array}{l} \vdash .*160·47. \supset \vdash :\text{Hp}.&\supset .M \unicode{x228d} N \in (P\unicode{x2909}Q)\,\overline{\text{smor}}\,(R\unicode{x2909}S).\\ [*162·3.*151·11] &\supset .M \unicode{x228d} N \in 1 \rightarrow 1.\text{ᗡ}ʻ(M \unicode{x228d} N) = Cʻ\Sigma ʻ(R \downarrow S) &\qquad \text{(1)}\\ \vdash .*150·32. \supset \vdash : \text{Hp}.\supset .(M \unicode{x228d} N)^{;}R &= \{(M \unicode{x228d} N)\upharpoonright CʻR\}^{;}R\\ [*35·644.*150·32] & = M^{;}R\\ [*151·11] & = P &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .(M \unicode{x228d} N)^{;}S = Q &\qquad \text{(3)}\\ \vdash .*150·71·1.\supset \vdash :\text{Hp} .\supset .(M \unicode{x228d} N)\dagger ^{;}(R \downarrow S) &= \{(M \unicode{x228d} N)^{;}R\}\downarrow {(M \unicode{x228d} N)^{;}S}\\ [(2).(3)] &= P \downarrow Q &\qquad \text{(4)}\\ \vdash .(1).(4).*164·1.\supset \vdash .\text{Prop} \end{array}$

*164·34. $\begin{align}\vdash :P \,\text{smor} R.Q\,\text{smor}\,S.CʻP \cap CʻQ = \Lambda .&CʻR \cap CʻS =\Lambda .\supset .\\ &P \downarrow Q\,\text{smor smor}\,R \downarrow S\\ [*164·33·11.*151·12]\end{align}$

The following propositions are concerned in showing that, if $P$ and $Q$ are like relations, and the correlator of $P$ and $Q$ is contained in likeness (i.e. correlates relations which have the relation of likeness), a correlator being given for each pair of relations coupled by the correlator of $P$ and $Q$ , then the logical sum of such correlators is a double correlator of $P$ and $Q$ , provided $P$ and $Q$ are relations of mutually exclusive relations. That is, assuming $S$ to be the correlator of $P$ and $Q$ , and assuming that $SʻN \,\text{smor}\, N$ whenever $N \in CʻQ$ , let it be possible to choose one correlator out of the class of correlators $(SʻN)\,\overline{\text{smor}}\,N$ , for every $N$ which belongs to $CʻQ$ . That is, assume that it is possible to make a selection from the class of classes of correlators. If $\mu$ is such a selection, then $\dot{s} ʻ\mu$ will be a double correlator of $P$ and $Q$ , if $P$ , $Q \in \text{Rel}^{2}\text{excl}$ .

*164·4. $\vdash \colon\ldotp N \in CʻQ.\supset _{N}.RʻN \in (SʻN)\,\overline{\text{smor}}\,N:\supset .\text{ᗡ}ʻ\dot{s} ʻRʻʻCʻQ = Cʻ\Sigma ʻQ$

Dem. $\begin{array}{l} \vdash .*41·44. &\supset \vdash .\text{ᗡ}ʻ\dot{s} ʻRʻʻCʻQ = sʻ\text{ᗡ}ʻʻRʻʻCʻQ &\qquad \text{(1)}\\ \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :N \in CʻQ.\supset .\text{ᗡ}ʻRʻN = CʻN:\\ [*37·68] &\supset :\text{ᗡ}ʻʻRʻʻCʻQ = CʻʻCʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp\text{Hp}.\supset :\text{ᗡ}ʻ\dot{s} ʻRʻʻCʻQ &= sʻCʻʻCʻQ\\ [*162·22] &= Cʻ\Sigma ʻQ:\supset \vdash .\text{Prop} \end{array}$

*164·41. $\begin{align}\vdash \colon\ldotp Q \in \text{Rel}^{2}\text{excl}: N \in CʻQ.\supset _{N}.RʻN \in (SʻN)\,&\overline{\text{smor}}\,N:\supset .\\ &\dot{s} ʻRʻʻCʻQ \in 1 \rightarrow \text{Cls}\end{align}$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :M,N \in CʻQ.&\exists !\text{D}ʻRʻM \cap \text{ᗡ}ʻRʻN.\supset .\\ &\exists !CʻM \cap CʻN.\\ [*163·11] &\supset .M = N.\\ [*30·37] &\supset .RʻM = RʻN &\qquad \text{(1)}\\ \vdash .*151·11.&\supset \vdash \colon\ldotp \text{Hp}.\supset :M \in CʻQ.\supset .RʻM \in 1 \rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).*72·32.\supset \vdash .\text{Prop} \end{array}$

*164·411. $\vdash :S^{;}Q \in \text{Rel}^{2}\text{excl}.S\upharpoonright CʻQ \in 1 \rightarrow 1.\text{Hp}*164·4.\supset .\dot{s} ʻRʻʻCʻQ \in \text{Cls} \rightarrow 1$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :M,N \in CʻQ.&\exists !\text{D}ʻRʻM \cap \text{D}ʻRʻN.\supset .\\ &\exists !CʻSʻM \cap CʻSʻN.\\ [*163·11.*150·22] &\supset .SʻM = SʻN.\\ [*71·532] & \supset .M = N.\\ [*30·37] &\supset .RʻM = RʻN &\qquad \text{(1)}\\ \vdash .*151·11.&\supset \vdash \colon\ldotp \text{Hp}.\supset :M \in CʻQ.\supset .RʻM \in 1 \rightarrow 1 &\qquad \text{(2)}\\ \vdash . (1). (2). *72·321 .\supset \vdash . \text{Prop} \end{array}$

*164·412. $\begin{align}\vdash \colon\ldotp S^{;}Q,&Q \in \text{Rel}^{2}\text{excl}.S\upharpoonright CʻQ \in 1 \rightarrow 1:\\ &N \in CʻQ.\supset _N.RʻN \in (SʻN)\,\overline{\text{smor}}\, N:\supset .\dot{s} ʻRʻʻCʻQ \in 1 \rightarrow 1\\ &[*164·41·411]\end{align}$

*164·413. $\begin{align}\vdash \colon\ldotp \text{Hp}&*164·41.\supset :\\ &N \in CʻQ.\supset .RʻN = (\dot{s} ʻRʻʻCʻQ)\upharpoonright CʻN.SʻN = (\dot{s} ʻRʻʻCʻQ)^{;}N\end{align}$

Dem. $\begin{array}{l} \vdash .*41·13. \supset \vdash :\text{Hp}.N \in CʻQ.&\supset .RʻN \,\unicode{x2abd}\, \dot{s} ʻRʻʻCʻQ.\\ [*72·92.*164·41] \supset .RʻN &= (\dot{s} ʻRʻʻCʻQ) \upharpoonright \text{ᗡ}ʻRʻN\\ [*151·11.\text{Hp}] &= (\dot{s} ʻRʻʻCʻQ) \upharpoonright CʻN &\qquad \text{(1)}\\ \vdash .*151·11.\supset \vdash :\text{Hp}.N \in CʻQ.\supset .SʻN &= (RʻN)^{;}N\\ [(1).*150·32] &= (\dot{s} ʻRʻʻCʻQ)^{;}N &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*164·414. $\vdash :\text{Hp}*164·41.\supset .S^{;}Q = (\dot{s} ʻRʻʻCʻQ)\dagger ^{;}Q \quad[*164·413.*150·1·35]$

*164·42. $\begin{align}\vdash \colon\ldotp Q,S^{;}Q \in &\text{Rel}^{2}\text{excl}.S \upharpoonright CʻQ \in 1 \rightarrow 1:\\ &N \in CʻQ.\supset _N.RʻN \in (SʻN)\,\overline{\text{smor}}\,N:\supset .\\ &\dot{s} ʻRʻʻCʻQ \in (S^{;}Q) \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q \quad[*164·4·412·414·1]\end{align}$

*164·421. $\begin{align}\vdash \colon\ldotp P,Q \in &\text{Rel}^{2}\text{excl}.S \upharpoonright CʻQ \in P\,\overline{\text{smor}}\,Q:\\ &N \in CʻQ.\supset _N.RʻN \in (SʻN)\,\overline{\text{smor}}\,N:\supset .\\ &\dot{s} ʻRʻʻCʻQ \in P \,\overline{\text{smor}}\,\overline{\text{smor}}\, Q \quad[*164·42]\end{align}$

The following proposition, besides being used in proving all subsequent propositions of this number (except *164·432 ·433, which are mere lemmas for *164·44), is used in *251·6, in the theory of ordinal numbers.

*164·43. $\begin{align}\vdash \colon\ldotp P,Q\in &\text{Rel}^{2}\text{excl}.S\in P\,\overline{\text{smor}}\,Q.\\ &\mu =\hat{\lambda}\{(\exists N).N\in CʻQ.\lambda =(SʻN)\,\overline{\text{smor}}\,N\}.\supset :\\ &R\in {\in}_{\Delta}ʻ\mu .\supset .\dot{s} ʻ\text{D}ʻR\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q.S=(\dot{s} ʻ\text{D}ʻR)]\dagger \upharpoonright CʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*83·2·22.&\supset \vdash \colon\ldotp \text{Hp}.R\in {\in}_{\Delta}ʻ\mu .\supset :\\ &N\in CʻQ.\supset .Rʻ{(SʻN)\overline{\text{smor}} N}\in (SʻN)\overline{\text{smor}} N:\dot{s} ʻ\text{D}ʻR=Rʻʻ\mu &\qquad \text{(1)}\\ \vdash .(1).&\supset \vdash \colon\ldotp \text{Hp}(1).T=\hat{\lambda} \hat{N} \{N\in CʻQ.\lambda =(SʻN)\overline{\text{smor}} N\}.\supset :\\ &N\in CʻQ.\supset .RʻTʻN\in (SʻN)\overline{\text{smor}} N:\dot{s} ʻ\text{D}ʻR= RʻʻTʻʻCʻQ: &\qquad \text{(2)}\\ \left[*164·42 \frac{R\mid T}{R}\right]&\supset :\dot{s} ʻ\text{D}ʻR\in P\,\overline{\text{smor}} \,\overline{\text{smor}}\, Q &\qquad \text{(3)}\\ \vdash .(2).*164·413 \frac{R\mid T}{R}.*151·11.*35·71.&\supset \vdash :\text{Hp}(2).\supset .S=(\dot{s} ʻ\text{D}ʻR)\dagger \upharpoonright CʻQ &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*164·431. $\begin{align}\vdash \colon\ldotp &P,Q\in \text{Rel}^{2}\text{excl}:(\exists S).S\in P\,\overline{\text{smor}}\,Q.\\ &\exists !{\in}_{\Delta}ʻ\hat{\lambda}\{(\exists N).N\in CʻQ.\lambda =(SʻN)\,\overline{\text{smor}}\,N\}:\supset .P \,\text{smor} \text{smor} Q\\ &[*163·43·11]\end{align}$

*164·432. $\begin{align}\vdash :S\in P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ&\text{smor}.\supset .\\ &\Lambda {\sim}\in \hat{\lambda} \{(\exists N).N\in CʻQ.\lambda =(SʻN)\overline{\text{smor}} N\}\end{align}$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :N\in CʻQ.\supset .N\in \text{ᗡ}ʻS.\\ [*71·31] &\supset .(SʻN)SN.\\ [\text{Hp}] &\supset .(SʻN)\text{smor}N.\\ [*151·12] &\supset .\exists !(SʻN)\overline{\text{smor}} N\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*164·433. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :S\in &P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\supset .\\ &\exists !{\in}_{\Delta}ʻ\hat{\lambda} \{(\exists N).N\in CʻQ.\lambda =(SʻN)\overline{\text{smor}} N\}\\ &[*164·432.*88·37]\end{align}$

*164·44. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in \text{Rel}^{2}\text{excl}.\exists !&P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\supset .\\ &P \,\text{smor smor}\,Q \quad[*164·433·431]\end{align}$

*164·45. $\begin{align}\vdash \colon\colon &\text{Mult ax}.\supset \colon\ldotp P,Q\in \text{Rel}^{2}\text{excl}.\supset :\\ &\exists !P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\equiv .P \,\text{smor smor}\,Q \quad[*164·44·17]\end{align}$

*164·46. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in \text{Rel}^{2}\text{excl}.\exists !&P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ\text{smor}.\supset .\\ &\Sigma ʻP\text{smor}\Sigma ʻQ \quad[*164·44·151]\end{align}$

*164·47. $\vdash : R, S \in \text{Nr}ʻQ . CʻR, CʻS \in \text{Cl}ʻ\text{Nr}ʻP . \supset . \exists ! R \overline{\text{smor}} S \cap \text{Rl}ʻ\text{smor}$

Dem. $\begin{array}{l} \vdash . *152·5·4 . \supset \vdash : \text{Hp} . &\supset . R \text{smor} S .\\ [*151·12] &\supset . \exists ! R \,\overline{\text{smor}}\, S &\qquad \text{(1)}\\ \vdash . *60·2 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : M \in CʻR . N \in CʻS . \supset . M, N \in \text{Nr}ʻP .\\ [*152·5·4] &\supset . M \,\text{smor}\, N &\qquad \text{(2)}\\ \vdash . *151·1·131 . &\supset \vdash \colon\ldotp T \in R \,\overline{\text{smor}}\,S . \supset : MTN . \supset . M \in CʻR . N \in CʻS &\qquad \text{(3)}\\ \vdash . (2) . (3) . &\supset \vdash \colon\ldotp \text{Hp} . \supset : T \in R \, \overline{\text{smor}}\,S . \supset . T \,\unicode{x2abd}\, \text{smor} &\qquad \text{(4)}\\ \vdash . (1) . (4) . \supset \vdash . \text{Prop} \end{array}$

*164·48. $\begin{align}\vdash \colon\ldotp \text{Mult ax} . \supset : R, S &\in \text{Rel}^{2}\text{excl} \cap \text{Nr}ʻQ . CʻR, CʻS \in \text{Cl}ʻ\text{Nr}ʻP . \supset .\\ &R\, \text{smor smor}\, S . \Sigma ʻR \,\text{smor}\, \Sigma ʻS \quad[*164·47·44·46]\end{align}$

In the present number, we shall give various propositions concerning the relation $P\downarrow_{.,} ^{;}Q$ , which has the same uses in relation-arithmetic $\alpha \downarrow_{,,}ʻʻ\beta$ has in cardinal arithmetic. The propositions of this number will be used in the next number to establish the properties of the arithmetical product of two relations $Q$ and $P$ , which is defined as $\SigmaʻP\downarrow_{.,} ^{;}Q$ . Again in connection with exponentiation the propositions of the present number will be useful, since, after the product of a relation of relations has been defined (*172), we shall define exponentiation by means of the definition $P \,\,\text{exp}\,\, Q = \text{Prod}ʻP\downarrow_{.,} ^{;}Q \text{Df}. \quad(Cf. *176.)$ There will also be occasional uses of the propositions of this number throughout the theory of series. The relation $P\downarrow_{.,} ^{;}Q$ is important because its structure is thoroughly known. It is a $\text{Rel}^{2}\text{excl}$ which consists of $\text{Nr}ʻQ$ relations, each like $P$ (*165·27); and if $P\,\text{smor}\,P'.Q\,\text{smor}\,Q'$ , we can construct a double correlator of $P\downarrow_{.,} ^{;}Q$ and $Pʻ\downarrow_{.,} ^{;}Q'$ without invoking the multiplicative axiom. In fact we have

*165·362. $\begin{align}\vdash :R\upharpoonright CʻP'\in &P\,\overline{\text{smor}}\,Pʻ.S\upharpoonright CʻQ'\in Q\,\overline{\text{smor}}\,Q'.\supset .\\ &(R\parallel \breve{S} )\upharpoonright Cʻ\Sigma ʻP'\downarrow_{.,} ^{;}Q'\in (P\downarrow_{.,} ^{;}Q)\,\overline{\text{smor}} \,\overline{\text{smor}}\,(Pʻ\downarrow_{.,} ^{;}Q')\end{align}$

This proposition should be compared with *113·127. In virtue of *164·31, together with various propositions of *165 and *166, it will appear that *165·362 includes *113·127 as part of what it asserts.

*165·13. $\vdash .CʻP\downarrow_{.,} z=\downarrow zʻʻCʻP=(CʻP)\downarrow_{,,} z$

*165·14. $\vdash .CʻʻCʻP\downarrow_{.,} ^{;}Q=(CʻP)\downarrow_{,,}ʻʻCʻQ$

which connects the theory of $P\downarrow_{.,} ^{;}Q$ with that of $\alpha \downarrow_{,,}ʻʻ\beta$ (*113 and *116). Hence

In *166, we shall define $Q\times P$ as $\Sigma ʻP\downarrow_{.,}^{;}Q$ ; thus the above will become $\vdash .Cʻ(Q\times P)=CʻQ\times CʻP.$

We next have a set of propositions concerned with $P\downarrow_{.,}$ as a relation, and with the circumstances under which we can infer $x=y$ or $P=Q$ from data as to $P\downarrow_{.,} x$ and $Q\downarrow_{.,} y$ . We have

*165·211. $\vdash :\exists !CʻP\downarrow_{.,} x\cap CʻP\downarrow_{.,} y.\supset .x=y$

*165·22. $\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} \in 1\rightarrow 1$

We then have various propositions concerning $\dot{\Lambda}$ , of which the chief are

*165·241. $\vdash :Q=\dot{\Lambda} .\supset .P\downarrow_{.,} ^{;}Q=\dot{\Lambda}$

*165·242. $\vdash :P=\dot{\Lambda} .\dot{\exists} !Q.\supset .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} \downarrow \dot{\Lambda}$

We have next four propositions which are constantly used, proving that $P\downarrow_{.,} ^{;}Q$ consists of $\text{Nr}ʻQ$ relations each like $P$ . These propositions are

*165·25. $\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} ^{;}Q\text{smor}Q.(P\downarrow_{.,} )\upharpoonright CʻQ\in (P\downarrow_{.,} ^{;}Q)\overline{\text{smor}} Q$

*165·251. $\vdash .P\downarrow_{.,} x\,\text{smor}\,P.(\downarrow x)\upharpoonright CʻP\in (P\downarrow_{.,} x)\,\overline{\text{smor}}\,P$

*165·27. $\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} ^{;}Q\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.CʻP\downarrow_{.,} ^{;}Q\in \text{Cl}ʻ\text{Nr}ʻP$

From *165·3 to *165·372, we are concerned with constructing a double correlator of $P\downarrow_{.,} ^{;}Q$ and $Pʻ\downarrow_{.,} ^{;}Q'$ when we are given simple correlators of $P$ with $P'$ and of $Q$ with $Q'$ . The result (*165·362) has already been given. Hence we have

*165·37. $\vdash : P \,\text{smor}\,P'.Q \text{smor} Q'.\supset .P\downarrow_{.,} ^{;}Q\,\text{smor smor}\,P'\downarrow_{.,} ^{;}Q'$

*165·38. $\begin{align}\vdash \colon\ldotp &\text{Mult ax}.\supset :\\ &R\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.CʻR\subset \text{Nr}ʻP.\supset .R\, \text{smor smor}\, P\downarrow_{.,} ^{;}Q\end{align}$

Hence propositions concerning a series of $\beta$ series, each containing $\alpha$ terms (where $\alpha$ and $\beta$ are relation-numbers), which in general require the multiplicative axiom, can be deduced, assuming that axiom, from propositions[Pg 388] (not requiring the axiom) concerning $P\downarrow_{.,} ^{;}Q$ , where $\text{Nr}ʻP=\alpha$ and $\text{Nr}ʻQ=\beta$ . Thus the use of $P\downarrow_{.,} ^{;}Q$ enables us to minimize the use of the multiplicative axiom.

*165·1. $\vdash :R(P\downarrow_{.,} ^{;}Q)S.\equiv .(\exists z,w).zQw.R=\downarrow z^{;}P.S=\downarrow w^{;}P \quad[*150·62]$

*165·11. $\vdash :X(\downarrow z^{;}P)Y.\equiv .(\exists x,y).xPy.X=x\downarrow z.Y=y\downarrow z \quad [*150·55]$

*165·12. $\vdash .CʻP\downarrow_{.,} ^{;}Q=P\downarrow_{.,} ʻʻCʻQ \quad[*150·22]$

*165·13. $\vdash .CʻP\downarrow_{.,} z=\downarrow zʻʻCʻP=(CʻP)\downarrow_{,,} z \quad[*165·01.*150·22.*38·2]$

*165·131. $\vdash .CʻʻP\downarrow_{.,} ʻʻ\beta =(CʻP)\downarrow_{,,}ʻʻ\beta \quad[*165·13.*38·11.*37·68]$

*165·14. $\vdash .CʻʻCʻP\downarrow_{.,} ^{;}Q=(CʻP)\downarrow_{,,}ʻʻCʻQ \quad[*165·12·131]$

*165·15. $\vdash .sʻCʻʻCʻP\downarrow_{.,} ^{;}Q=CʻQ\times CʻP \quad[*165·14.*113·1]$

*165·16. $\vdash .Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q=CʻQ\times CʻP \quad[*165·15.*162·22]$

*165·161. $\begin{align}\vdash :M(F^{;}P\downarrow_{.,} ^{;}Q)&N.\equiv .\\ &(\exists x,y,z,w).x,y\in CʻP.zQw.M=x\downarrow z.N=y\downarrow w\end{align}$

Dem. $\begin{array}{l} \vdash .*150·52.\supset \\ \vdash \colon\ldotp M(F^{;}P\downarrow_{.,} ^{;}Q)N.&\equiv :(\exists R,S).R(P\downarrow_{.,} ^{;}Q)S.M\in CʻR.N\in CʻS.\\ [*165·1] &\equiv :(\exists R,S,z,w).zQw.R=\downarrow z^{;}P.S=\downarrow w^{;}P.M\in CʻR.N\in CʻS.\\ [*165·01·13] &\equiv :(\exists R,S,z,w).zQw.R=\downarrow z^{;}P.S=\downarrow w^{;}P.\\ &M\in \downarrow zʻʻCʻP.N\in \downarrow wʻʻCʻP.\\ [*21·151] &\equiv :(\exists z,w).zQw.M\in \downarrow zʻʻCʻP.N\in \downarrow wʻʻCʻP.\\ [*38·131] &\equiv :(\exists x,y,z,w).zQw.x,y\in CʻP.M=x\downarrow z.N=y\downarrow w\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*165·162. $\vdash :M(\dot{s} ʻCʻP\downarrow_{.,} ^{;}Q)N.\equiv .(\exists x,y,z).xPy.z\in CʻQ.M=x\downarrow z.N=y\downarrow z$

Dem. $\begin{array}{l} \vdash .*165·12.*41·11.\supset \\ \vdash :M(\dot{s} ʻCʻP\downarrow_{.,} ^{;}Q)N.&\equiv .(\exists R).R\in P\downarrow_{.,} ʻʻCʻQ.MRN.\\ [*38·13] &\equiv .(\exists z).z\in CʻQ.M(P\downarrow_{.,} z)N.\\ [*165·01·11] & \equiv .(\exists x,y,z).xPy.z\in CʻQ.M=x\downarrow z.N=y\downarrow z:\supset \vdash .\text{Prop} \end{array}$

*165·17. $\begin{align}\vdash \colon\ldotp &M(\Sigma ʻP\downarrow_{.,} ^{;}Q)N.\equiv :(\exists x,y,z,w):\\ &x,y\in CʻP.z,w\in CʻQ:zQw.\lor.z=w.xPy:M=x\downarrow z.N=y\downarrow w\end{align}$

Dem. $\begin{array}{l} \vdash .*165·161·162.*162·11.\supset \\ \vdash \colon\ldotp M(\Sigma ʻP\downarrow_{.,} ^{;}Q)N.&\equiv :(\exists x,y,z,w).x,y\in CʻP.zQw.M=x\downarrow z.N=y\downarrow w.\lor.\\ &(\exists x,y,z).xPy.z\in CʻQ.M=x\downarrow z.N=y\downarrow w:\\ [*13·195] &\equiv :(\exists x,y,z,w).x,y\in CʻP.zQw.M=x\downarrow z.N=y\downarrow w.\lor.\\ &(\exists x,y,z,w).xPy.z,w\in CʻQ.z=w.M=x\downarrow z.N=y\downarrow w:\\ [*33·17.*4·71] &\equiv:(\exists x,y,z,w).x,y\in CʻP.z,w\in CʻQ.zQw.M=x\downarrow z.N=y\downarrow w.\lor.\\ &(\exists x,y,z,w).x,y\in CʻP.z,w\in CʻQ.xPy.z=w.M=x\downarrow z.N=y\downarrow w:\\ [*11·41.*4·4] &\equiv :(\exists x,y,z,w):x,y\in CʻP.z,w\in CʻQ:zQw.\lor.z=w.xPy:\\ &M=x\downarrow z.N=y\downarrow w\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*165·18. $\vdash .\text{Cnv}ʻP\downarrow_{.,} ^{;}Q=P\downarrow_{.,} ^{;}\breve{Q} \quad[*150·12]$

*165·181. $\vdash .\text{Cnv}ʻP\downarrow_{.,} z=\breve{P} \downarrow_{.,} z \quad[*165·01.*150·12]$

*165·182. $\vdash .\text{Cnv}^{;}P\downarrow_{.,} ^{;}Q=\breve{P} \downarrow_{.,} ^{;}Q \quad[*165·181.*150·35]$

*165·19. $\vdash .\text{Cnv}ʻ\text{Cnv}^{;}P\downarrow_{.,} ^{;}Q=\breve{P} \downarrow_{.,} ^{;}\breve{Q} =\text{Cnv}^{;}\text{Cnv}ʻP\downarrow_{.,} ^{;}Q \quad[*165·18·182]$

*165·201. $\vdash .Cʻ(P\downarrow_{.,} z)=(CʻP\uparrow \iota ʻz)_{\Delta }ʻ\iota ʻz$

Dem. $\begin{array}{l} \vdash .*35·103.&\supset \vdash :y(CʻP\uparrow \iota ʻz)z.\equiv .y\in CʻP:\\ [*85·51] \supset \vdash .(CʻP\uparrow \iota ʻz)_{\Delta }ʻ\iota ʻz&=\downarrow zʻʻCʻP\\ [*165·13] &=Cʻ(P\downarrow_{.,} z).\supset \vdash .\text{Prop} \end{array}$

*165·202. $\vdash .CʻʻCʻP\downarrow_{.,} ^{;}Q=(CʻP\uparrow CʻQ)_{\Delta }ʻʻ\iotaʻʻCʻQ \quad[*165·14.*113·103]$

*165·203. $\vdash .CʻʻCʻP\downarrow_{.,} ^{;}Q\in \text{Cls}^{2} \text{excl} \quad[*84·55.*165·202]$

*165·204. $\vdash :CʻP\downarrow_{.,} x=CʻP\downarrow_{.,} y.\equiv .P\downarrow_{.,} x=P\downarrow_{.,} y$

Dem. $\begin{array}{l} \vdash .*165·13.*55·232.\supset \\ \vdash :CʻP\downarrow_{.,} x=CʻP\downarrow_{.,} y.\exists !CʻP\downarrow_{.,} x.&\supset .x=y.\\ [*30·37] &\supset .P\downarrow_{.,} x=P\downarrow_{.,} y &\qquad \text{(1)}\\ \vdash .*33·241.&\supset \vdash :CʻP\downarrow_{.,} x=CʻP\downarrow_{.,} y.CʻP\downarrow_{.,} x=\Lambda .\supset .P\downarrow_{.,} x=\dot{\Lambda} .P \downarrow_{.,} y=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :CʻP\downarrow_{.,} x=CʻP\downarrow_{.,} y.\supset .P\downarrow_{.,} x=P\downarrow_{.,} y &\qquad \text{(3)}\\ \vdash .(3).*30·37.\supset \vdash .\text{Prop} \end{array}$

*165·205. $\vdash .C\upharpoonright \text{D}ʻP\downarrow_{.,} \in 1\rightarrow 1 \quad[*165·204.*71·58]$

*165·206. $\vdash :(x).\text{E}!P\downarrow_{.,} ʻx:(\alpha ).\alpha \subset \text{ᗡ}ʻP\downarrow_{.,} \quad[*38·12.*33·431]$

Dem. $\begin{array}{l} \vdash .*165·205.*150·203.\supset \vdash .C\upharpoonright CʻP\downarrow_{.,} ^{;}Q\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*165·203.*163·17.\supset \vdash .\text{Prop} \end{array}$

*165·211. $\vdash :\exists !CʻP\downarrow_{.,} x\cap CʻP\downarrow_{.,} y.\supset .x=y \quad[*165·13.*55·232]$

Dem. $\begin{array}{l} \vdash . *165·11·01.\supset \vdash \dot{\exists} !P\downarrow_{.,} x.&\equiv .(\exists X,Y,x,y).xPy.X=x\downarrow z.Y=y\downarrow z.\\ [*13·19] &\equiv .(\exists x,y).xPy:\supset \vdash .\text{Prop} \end{array}$

*165·22. $\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} \in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*165·212.\supset \vdash \colon\ldotp \text{Hp}.\supset :\dot{\exists} !P\downarrow_{.,} x:\\ [*30·37.*24·571.*33·24]&\supset :P\downarrow_{.,} x=P\downarrow_{.,} y.\supset .\exists !CʻP\downarrow_{.,} x\cap CʻP\downarrow_{.,} y.\\ [*165·211] &\supset .x=y &\qquad \text{(1)}\\ \vdash .(1).*71·54.*165·2.\supset \vdash .\text{Prop} \end{array}$

*165·221. $\vdash \colon\ldotp \dot{\exists} !P.\supset :\dot{\exists} !P\downarrow_{.,} x\dot{\cap} P\downarrow_{.,} y.\equiv .P\downarrow_{.,} x=P\downarrow_{.,} y.\equiv .x=y$

Dem. $\begin{array}{l} \vdash .*33·252.\supset \vdash :\dot{\exists} !P\downarrow_{.,} x\dot{\cap} P\downarrow_{.,} y.&\supset .\exists !CʻP\downarrow_{.,} x\cap CʻP\downarrow_{.,} y.\\ [*165·211] &\supset .x=y &\qquad \text{(1)}\\ \vdash .*165·212.*25·571.\supset \vdash \colon\ldotp \dot{\exists} !P.&\supset :x=y.\supset .\dot{\exists} !P\downarrow_{.,} x\dot{\cap} P\downarrow_{.,} y &\qquad \text{(2)}\\ \vdash .(1).(2).*165·212.*30·37.\supset \vdash .\text{Prop} \end{array}$

*165·222. $\begin{align}&\vdash \colon\ldotp \dot{\exists} !P.\supset :\exists !CʻP\downarrow_{.,} x\cap CʻP\downarrow_{.,} y.\equiv .CʻP \downarrow_{.,} x=CʻP\downarrow_{.,} y.\equiv .x=y\\ &[\text{Proof as in *165·221}]\end{align}$

*165·223. $\vdash \colon\ldotp \dot{\exists} !P.\supset :P\downarrow_{.,} ^{;}Q=P\downarrow_{.,} ^{;}R.\equiv .Q=R$

Dem. $\begin{array}{l} \vdash .*151·31.*165·22.&\supset \vdash \colon\ldotp \text{Hp}.\supset :P\downarrow_{.,} ^{;}Q=P\downarrow_{.,} ^{;}R.\supset .Q=R &\qquad \text{(1)}\\ \vdash .*34·29.*150·1. &\supset \vdash :Q=R.\supset .P\downarrow_{.,} ^{;}Q=P\downarrow_{.,} ^{;}R &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*72·184.*150·153.\supset \vdash :\downarrow x^{;}P=\downarrow x^{;}Q.\supset .P=Q &\qquad \text{(1)}\\ \vdash .(1).*165·01.\supset \vdash .\text{Prop} \end{array}$

*165·231. $\vdash :P\downarrow_{.,} x=Q\downarrow_{.,} x.\equiv .P=Q \quad[*165·23.*30·37]$

*165·232. $\vdash \colon\ldotp \dot{\exists} !P.\lor.\dot{\exists} !Q:\supset :P\downarrow_{.,} x=Q\downarrow_{.,} y.\equiv .P=Q.x=y$

Dem. $\begin{array}{l} \vdash .*165·23.\supset \vdash \colon\ldotp P\downarrow_{.,} x=Q\downarrow_{.,} y.&\supset :P=Q: &\qquad \text{(1)}\\ [*13·12.\text{Hp}(1)] &\supset :P\downarrow_{.,} x=P\downarrow_{.,} y.Q\downarrow_{.,} x=Q\downarrow_{.,} y:\\ [*165·221] &\supset :\dot{\exists} !P.\supset .x=y:\dot{\exists} !Q.\supset .x=y &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp \dot{\exists} !P.\lor.\dot{\exists} !Q:\supset :P\downarrow_{.,} x=Q\downarrow_{.,} y.\supset .P=Q.x=y &\qquad \text{(3)}\\ \vdash .(3).*13·12·15.\supset \vdash .\text{Prop} \end{array}$

*165·233. $\begin{align}&\vdash :\exists !CʻP\downarrow_{.,} x\cap CʻQ\downarrow_{.,} y.\equiv .x=y.\exists !CʻP\cap CʻQ\\ &[*55·232.*165·13]\end{align}$

*165·24. $\vdash :P=\dot{\Lambda} .\supset .P\downarrow_{.,} x=\dot{\Lambda} .P\downarrow_{.,} =\iota ʻ\dot{\Lambda} \uparrow \text{V}$

Dem. $\begin{array}{l} \vdash .*165·212.\text{Transp}.\supset \vdash :P=\dot{\Lambda} .\supset .P\downarrow_{.,} x=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .(1).*38·1. \supset \vdash \colon\ldotp P=\dot{\Lambda} .\supset :R(P\downarrow_{.,} )x.\equiv .R=\dot{\Lambda} .\\ [*51·15.*24·104] \equiv .R\in \iota ʻ\dot{\Lambda} .x\in \text{V}.\\ [*35·103] \equiv .R(\iota ʻ\dot{\Lambda} \uparrow \text{V})x &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*165·241. $\vdash :Q=\dot{\Lambda} .\supset .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} \quad[*150·42]$

*165·242. $\vdash :P=\dot{\Lambda} .\dot{\exists} !Q.\supset .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} \downarrow \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*165·1·24.\supset \vdash \colon\ldotp P=\dot{\Lambda} .\supset :R(P\downarrow_{.,} ^{;}Q)S.&\equiv .(\exists z,w).zQw.R=\dot{\Lambda} .S=\dot{\Lambda} .\\ [*10·35] &\equiv .\dot{\exists} !Q.R=\dot{\Lambda} .S=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .(1).*55·13.\supset \vdash .\text{Prop} \end{array}$

*165·243. $\vdash :\dot{\exists} !Q.\equiv .\dot{\exists} !P\downarrow_{.,} ^{;}Q$

Dem. $\begin{array}{l} \vdash .*165·1.\supset \vdash :\dot{\exists} !P\downarrow_{.,} ^{;}Q.\equiv .(\exists x,y,R,S).xQy.R=P\downarrow_{.,} x.S=P\downarrow_{.,} y.\\ [*13·19] \equiv .(\exists x,y).xQy:\supset \vdash .\text{Prop} \end{array}$

*165·244. $\vdash :\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q.\equiv .P=\dot{\Lambda} .\dot{\exists} !Q.\equiv .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} \downarrow \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*165·212·12. &\supset \vdash :\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q.\supset .P=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*10·24.*33·24.&\supset \vdash :\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q.\supset .\dot{\exists} !P\downarrow_{.,} ^{;}Q.\\ [*165·243] &\supset .\dot{\exists} !Q &\qquad \text{(2)}\\ \vdash .*165·242.*55·15. &\supset \vdash :P = \dot{\Lambda} .\dot{\exists} !Q.\supset .\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash :\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q. \equiv .P = \dot{\Lambda} .\dot{\exists} !Q &\qquad \text{(4)}\\ \vdash .*55·15. &\supset \vdash :P\downarrow_{.,} ^{;}Q. = \dot{\Lambda} \downarrow \dot{\Lambda} .\supset .\dot{\Lambda} \in CʻP\downarrow_{.,} ^{;}Q.\\ [(4)] &\supset .P = \dot{\Lambda} .\dot{\exists} !Q &\qquad \text{(5)}\\ \vdash .(5).*165·242. & \supset \vdash :P = \dot{\Lambda} .\dot{\exists} !Q. \equiv .P\downarrow_{.,} ^{;}Q = \dot{\Lambda} \downarrow \dot{\Lambda} &\qquad \text{(6)}\\ \vdash .(4).(6).\supset \vdash .\text{Prop} \end{array}$

*165·245. $\begin{align}&\vdash \colon\ldotp \dot{\exists} !P.\lor.Q = \dot{\Lambda} : \equiv .\dot{\Lambda} {\sim} \in CʻP\downarrow_{.,} ^{;}Q. \equiv .\dot{\Lambda} {\sim} \in (CʻP)\downarrow_{,,}ʻʻCʻQ\\ &[*165·244.\text{Transp}.*33·241.*165·14]\end{align}$

*165·25. $\begin{align}&\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} ^{;}Q\,\text{smor}\,Q.(P\downarrow_{.,} )\upharpoonright CʻQ\in (P\downarrow_{.,} ^{;}Q)\,\overline{\text{smor}}\,Q\\ &[*165·22·206.*151·231]\end{align}$

*165·251. $\begin{align}&\vdash .P\downarrow_{.,} x\,\text{smor}\,P.(\downarrow x)\upharpoonright CʻP\in (P\downarrow_{.,} x)\overline{\text{smor}} P\\ &[*72·184.*55·21.*151·22]\end{align}$

*165·26. $\vdash .CʻP\downarrow_{.,} ^{;}Q\subset \text{Nr}ʻP \quad[*165·251·12.*152·11]$

*165·27. $\begin{align}&\vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} ^{;}Q\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.CʻP\downarrow_{.,} ^{;}Q\in \text{Cl}ʻ\text{Nr}ʻP\\ &[*165·21·25.*152·11.*165·26]\end{align}$

The following propositions are concerned in proving that, if $R$ is a correlator of $P$ and $P'$ and $S$ is a correlator of $Q$ and $Q'$ then $R\parallel \breve{S}$ (with its converse domain limited) is a double correlator of $P\downarrow_{.,} ^{;}Q$ and $P'\downarrow_{.,} ^{;}Q'$ .

*165·3. $\vdash :\text{E}!Rʻy.\supset .\downarrow zʻRʻy = R\mid ʻ\downarrow zʻy$

Dem. $\begin{array}{l} \vdash .*34·1.*38·11.\supset \vdash :u\{R\mid ʻ\downarrow zʻy\}w. &\equiv .(\exists v).uRv.v(y\downarrow z)w.\\ [*55·13] &\equiv .uRy.w = z &\qquad \text{(1)}\\ \vdash .(1).*30·4. \supset \vdash \colon\ldotp \text{Hp}.\supset :u{R\mid ʻ\downarrow zʻy}w. &\equiv .u = Rʻy.w = z.\\ [*55·13.*38·11] &\equiv .u(\downarrow zʻRʻy)w\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*165·301. $\vdash :R\in 1\rightarrow \text{Cls}.\supset .\downarrow z\mid R = (R\mid )\mid (\downarrow z)\upharpoonright \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*165·3. &\supset \vdash \colon\ldotp \text{E}!Rʻy.\supset :M\{(\downarrow z)\mid R\}y. \equiv .M\{(R\mid )\mid \downarrow z\}y\colon\ldotp \\ [*71·16.*34·36]&\supset \vdash \colon\ldotp \text{Hp}.\supset :M\{(\downarrow z)\mid R\}y. \equiv .\\ &M\{(R\mid )\mid \downarrow z\}y.y\in \text{ᗡ}ʻR\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*165·302. $\vdash :\text{E}!!RʻʻCʻP.\supset .\downarrow z^{;}R^{;}P = R\mid ^{;}\downarrow z^{;}P$

Dem. $\begin{array}{l} \vdash .*165·3.\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in CʻP.\supset .\downarrow zʻRʻy = R\mid ʻ\downarrow zʻy &\qquad \text{(1)}\\ \vdash .(1).*150·35·13.\supset \vdash .\text{Prop} \end{array}$

*165·31. $\vdash :\text{E}!!RʻʻCʻP.\supset .(R^{;}P)\downarrow_{.,} z=R\mid ^{;}P\downarrow_{.,} z.(R^{;}P)\downarrow_{.,} ^{;}Q=(R\mid )\dagger ^{;}P\downarrow_{.,} ^{;}Q$

Dem. $\begin{array}{l} \vdash .*165·302·01.\supset \vdash :\text{Hp}.\supset .(R^{;}P)\downarrow_{.,} z&=R\mid ^{;}P\downarrow_{.,} z &\qquad \text{(1)}\\ [*150·1] &=(R\mid )\dagger ʻP\downarrow_{.,} z &\qquad \text{(2)}\\ \vdash .(1).(2).*150·35.\supset \vdash .\text{Prop} \end{array}$

*165·311. $\begin{align}\vdash :R\upharpoonright CʻP\in 1\rightarrow \text{Cls}.&CʻP\subset \text{ᗡ}ʻR.\supset .\\ &(R^{;}P)\downarrow_{.,} z=R\mid ^{;}P\downarrow_{.,} z.(R^{;}P)\downarrow_{.,} ^{;}Q=(R\mid )\dagger ^{;}P\downarrow_{.,} ^{;}Q\\ [*165·31.*71·571]\end{align}$

*165·32. $\vdash :\text{E}!Sʻz.\supset .\downarrow (Sʻz)=(\mid \breve{S} )\mid \downarrow z.\downarrow (Sʻz)^{;}P=\mid \breve{S} ^{;}\downarrow z^{;}P$

Dem. $\begin{array}{l} \vdash .*34·1.*43·101.*38·101.\supset \\ \vdash :M\{(\mid \breve{S} )\mid \downarrow z\}x.\equiv .(\exists N).M=N\mid \breve{S} .N=x\downarrow z.\\ [*13·195] \equiv .M=(x\downarrow z)\mid \breve{S} &\qquad \text{(1)}\\ \vdash .(1).*55·581.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :M\{(\mid \breve{S} )\mid \downarrow z\}x.\equiv .M=x\downarrow (Sʻz).\\ [*38·101] \equiv .M\{\downarrow (Sʻz)\}x &\qquad \text{(2)}\\ \vdash .(2).*21·43.\supset \vdash :\text{Hp}.\supset .\downarrow (Sʻz)=(\mid \breve{S} )\mid \downarrow z.\\ [*150·13] \supset .\downarrow (Sʻz)^{;}P=\mid \breve{S} ^{;}\downarrow z^{;}P:\supset \vdash .\text{Prop} \end{array}$

*165·321. $\vdash :\text{E}!Sʻz.\supset .P\downarrow_{.,} (Sʻz)=\mid \breve{S} ^{;}P\downarrow_{.,} z \quad[*165·32·01]$

*165·33. $\vdash :\text{E}!!SʻʻCʻQ.\supset .P\downarrow_{.,} ^{;}S^{;}Q=(\mid \breve{S} )\dagger ^{;}P\downarrow_{.,} ^{;}Q$

Dem. $\begin{array}{l} \vdash .*165·321.*38·11.*150·1.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :z\in CʻQ.\supset .P\downarrow_{.,} ʻSʻz=(\mid \breve{S} )\dagger ʻP\downarrow_{.,} ʻz &\qquad \text{(1)}\\ \vdash .(1).*150·35.\supset \vdash .\text{Prop} \end{array}$

*165·331. $\begin{align}&\vdash :S\upharpoonright CʻQ\in 1\rightarrow \text{Cls}.CʻQ\subset \text{ᗡ}ʻS.\supset .P\downarrow_{.,} ^{;}S^{;}Q=(\mid \breve{S} )\dagger ^{;}P\downarrow_{.,} ^{;}Q\\ &[*165·33.*71·571]\end{align}$

*165·34. $\vdash :\text{E}!!RʻʻCʻP.\text{E}!!SʻʻCʻQ.\supset .(R^{;}P)\downarrow_{.,} ^{;}(S^{;}Q)=(R\parallel \breve{S} )\dagger ^{;}(P\downarrow_{.,} ^{;}Q)$

Dem. $\begin{array}{l} \vdash .*165·31.\supset \vdash :\text{Hp}.\supset .(R^{;}P)\downarrow_{.,} ^{;}(S^{;}Q)&=(R\mid )\dagger ^{;}P\downarrow_{.,} ^{;}(S^{;}Q)\\ [*165·33] &=(R\mid )\dagger ^{;}(\mid \breve{S} )\dagger ^{;}P\downarrow_{.,} ^{;}Q\\ [*150·13·14.(*43·01)] &=(R\parallel \breve{S} )\dagger ^{;}(P\downarrow_{.,} ^{;}Q):\supset \vdash .\text{Prop} \end{array}$

*165·341. $\begin{align}\vdash :R \upharpoonright CʻP,S &\upharpoonright CʻQ \in 1 \rightarrow \text{Cls}.CʻP \subset \text{ᗡ}ʻR.CʻQ \subset \text{ᗡ}ʻS.\supset .\\ &(R^{;}P) \downarrow_{.,} ^{;}(S^{;}Q) = (R \parallel \breve{S} )\dagger ^{;}P\downarrow_{.,} ^{;}Q \quad[*165·34.*71·571]\end{align}$

*165·35. $\vdash :R \upharpoonright CʻP \in \text{Cls} \rightarrow 1.CʻP \subset \text{ᗡ}ʻR.\supset .(R\mid )\upharpoonright Cʻ\Sigma ʻP \downarrow_{.,} ^{;}Q \in 1 \rightarrow 1$

Dem. $\begin{array}{l} \vdash .*113·118.*165·16.\supset \vdash .sʻ\text{D}ʻʻCʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \subset CʻP &\qquad \text{(1)}\\ \vdash .(1).*74·751 \frac{Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q,\,CʻP}{\lambda,\,\alpha}.\supset \vdash .\text{Prop} \end{array}$

*165·351. $\vdash :S \upharpoonright CʻQ \in \text{Cls} \rightarrow 1.CʻQ \subset \text{ᗡ}ʻS.\supset .(\mid \breve{S} ) \upharpoonright Cʻ\Sigma ʻP \downarrow_{.,} ^{;}Q \in 1 \rightarrow 1$

Dem. $\begin{array}{l} \vdash .*113·118.*165·16.&\supset \vdash .sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻP \downarrow_{.,} ^{;}Q \subset CʻQ.\\ \left[*74·75 \frac{\breve{S}}{Q}\right] &\supset \vdash :\text{Hp}.\supset .(\mid \breve{S} ) \upharpoonright Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \in 1 \rightarrow 1:\supset \vdash .\text{Prop} \end{array}$

*165·352. $\begin{align}\vdash :R \upharpoonright CʻP,S \upharpoonright CʻQ \in \text{Cls} \rightarrow 1.CʻP \subset \text{ᗡ}ʻR.&CʻQ \subset \text{ᗡ}ʻS.\supset .\\ &(R\parallel \breve{S} ) \upharpoonright Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \in 1 \rightarrow 1\end{align}$

Dem. $\begin{array}{l} \vdash .*113·118.*165·16.\supset \\ \vdash :\text{Hp}.\supset .sʻ\text{D}ʻʻCʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \subset CʻP.sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \subset CʻQ.\\ [*74·773] \supset .(R \parallel \breve{S} ) \upharpoonright Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q \in 1 \rightarrow 1:\supset \vdash .\text{Prop} \end{array}$

*165·36. $\begin{align}\vdash :R \upharpoonright CʻP' \in \,P\overline{\text{smor}}\, &P'.\supset .\\ &(R\mid ) \upharpoonright Cʻ\Sigma ʻP'\downarrow_{.,} ^{;}Q \in (P\downarrow_{.,} ^{;}Q)\,\overline{\text{smor}} \,\overline{\text{smor}}\, (P'\downarrow_{.,} ^{;}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*151·22.*165·35. &\supset \vdash :\text{Hp}.\supset .(R\mid ) \upharpoonright Cʻ\Sigma ʻPʻ\downarrow_{.,} ^{;}Q \in 1 \rightarrow 1 &\qquad \text{(1)}\\ \vdash .*43·3. &\supset \vdash .Cʻ\Sigma ʻPʻ\downarrow_{.,} ^{;}Q \subset \text{ᗡ}ʻR\mid &\qquad \text{(2)}\\ \vdash .*151·22.*165·311.&\supset \vdash :\text{Hp}.\supset .P\downarrow_{.,} ^{;}Q = (\mid R)\dagger ^{;}Pʻ\downarrow_{.,} ^{;}Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*164·18.\supset \vdash .\text{Prop} \end{array}$

*165·361. $\begin{align}\vdash :S\upharpoonright CʻQ' \in Q&\overline{\text{smor}} Q'.\supset .\\ &(\mid \breve{S} )\upharpoonright Cʻ\Sigma ʻP\downarrow_{.,} ^{;}Q' \in (P\downarrow_{.,} ^{;}Q)\,\overline{\text{smor}} \,\overline{\text{smor}}\, (P\downarrow_{.,} ^{;}Q')\\ [*165·351·331]\end{align}$

*165·362. $\begin{align}\vdash :R \upharpoonright CʻP' \in P\,&\overline{\text{smor}}\,P'.S \upharpoonright CʻQ' \in Q\,\overline{\text{smor}}\,Q'.\supset .\\ &(R \parallel \breve{S} ) \upharpoonright Cʻ\Sigma ʻP'\downarrow_{.,} ^{;}Q' \in (P\downarrow_{.,} ^{;}Q) \,\overline{\text{smor}} \,\overline{\text{smor}}\, (P'\downarrow_{.,} ^{;}Q')\\ [*165·352·341]\end{align}$

*165·37. $\begin{align}&\vdash :P\,\text{smor}\,P'.Q\text{smor}Q'.\supset .P\downarrow_{.,} ^{;}Q\,\text{smor smor}\,P'\downarrow_{.,} ^{;}Q'\\ &[*165·362.*164·11.*151·12]\end{align}$

*165·38. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :R\in \text{Rel}^{2}\text{excl}\cap &\text{Nr}ʻQ.CʻR\subset \text{Nr}ʻP.\supset .\\ &R\,\text{smor smor}\,P\downarrow_{.,} ^{;}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*164·48.*165·27.&\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .R\,\text{smor smor}\,P\downarrow_{.,} ^{;}Q &\qquad \text{(1)}\\ \vdash .*153·17.*165·241.&\supset \\ \vdash :Q=\dot{\Lambda} .R\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.&\supset .R=\dot{\Lambda} .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} .\\ [*164·32] &\supset .R\,\text{smor smor}\,P\downarrow_{.,} ^{;}Q &\qquad \text{(2)}\\ \vdash .*165*242&.\supset \vdash :P=\dot{\Lambda} .\dot{\exists} !Q.\supset .P\downarrow_{.,} ^{;}Q=\dot{\Lambda} \downarrow \dot{\Lambda} &\qquad \text{(3)}\\ \vdash .*153·17.*51·4.*151·32.\supset \\ \vdash :R\in \text{Nr}ʻQ.CʻR\subset \text{Nr}ʻP.P=\dot{\Lambda} .\dot{\exists} !Q.&\supset .CʻR={℩}ʻ\dot{\Lambda} .\\ [*56·381] &\supset .R=\dot{\Lambda} \downarrow \dot{\Lambda} &\qquad \text{(4)}\\ \vdash .(3).(4).*153·101.*164·34.\supset \\ \vdash :R\in \text{Nr}ʻQ.CʻR\subset \text{Nr}ʻP.P=\dot{\Lambda} .\dot{\exists} !Q.&\supset .R\,\text{smor smor}\,P\downarrow_{.,} ^{;}Q &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

The product $Q \times P$ is defined as $\Sigma ʻP\downarrow_{.,}^{;}Q$ . This is a relation which has for its field all the couples that can be formed by choosing the referent in $CʻP$ and the relatum in $CʻQ$ . These couples are arranged by $Q \times P$ on the following principle: If the relatum of the one couple has the relation $Q$ to the relatum of the other, we put the one before the other, and if the relata of the two couples are equal while the referent of the one has the relation $P$ to the referent of the other, we put the one before the other. Thus in advancing from any term $x\downarrow y$ in the field of $Q \times P$ , we first keep $y$ fixed and alter $x$ into later terms as long as possible; then we alter $y$ into a later term, move $x$ back to the beginning, and so on. Thus with a given $y$ , we get a series which is like $P$ , and this series is wholly followed or wholly preceded by the series with the referent $y'$ , where $y'$ follows or precedes $y$ .

The propositions of this number are for the most part immediate consequences of those of *165. The most important of them are:

*166·13. $\vdash \colon\ldotp P\times Q=\dot{\Lambda} .\equiv :P=\dot{\Lambda} .\lor.Q=\dot{\Lambda}$

Hence it follows that an ordinal product of a finite number of factors vanishes when, and only when, one of its factors vanishes.

*166·16. $\vdash .\overrightarrow{B}ʻ(P\times Q)=\overrightarrow{B}ʻP\times \overrightarrow{B}ʻQ.\overrightarrow{B}ʻ\text{Cnv}ʻ(P\times Q)=\overrightarrow{B}ʻ\breve{P} \times \overrightarrow{B}ʻ\breve{Q}$

*166·23. $\vdash :P\,\text{smor}\,P'.Q\text{smor}Q'.\supset .Q\times P\,\text{smor}\,Q'\times P'$

This proposition shows that the relation-number of a product $Q \times P$ depends only upon the relation-numbers of its factors.

*166·24. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :R\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.CʻR\subset \text{Nr}ʻ&P.\supset .\\ &\Sigma ʻR\,\text{smor}\,Q\times P\end{align}$

This proposition connects addition and multiplication (cf. note to *166·24, below).

*166·45. $\vdash .(Q\unicode{x2909}R)\times P=(Q\times P)\unicode{x2909}(R\times P)$

We do not have in general (cf. note before *166·44, below) $P\times (Q\unicode{x2909}R)=(P\times Q)\unicode{x2909}(P\times R).$

*166·53. $\vdash :\dot{\exists} !Q.\supset .(Q\unicode{x21f8} y)\times P=(Q\times P)\unicode{x2909}(P\downarrow_{.,} y)$

*166·531. $\vdash :\dot{\exists} !Q.\supset .(y\unicode{x21f7}Q)\times P=(P\downarrow_{.,} y)\unicode{x2909}(Q\times P)$

Here again the law does not hold in general for $P\times(Q\unicode{x21f8} y)$ or $P\times (y\unicode{x21f7}Q)$ .

*166·11. $\begin{align}\vdash \colon\ldotp M(Q\times P)&N.\equiv :(\exists x,y,z,w):x,y\in CʻP.z,w\in CʻQ:zQw.\lor.\\ &z=w.xPy:M=x\downarrow z.N=y\downarrow w \quad[*165·17.*166·1]\end{align}$

*166·111. $\begin{align}\vdash \colon\ldotp M(P\times Q)&N.\equiv :(\exists x,y,z,w):x,y\in CʻP.z,w\in CʻQ:xPy.\lor.\\ &x=y.zQw:M=z\downarrow x.N=w\downarrow y \quad[*165·17.*166·1]\end{align}$

*166·112. $\begin{align}\vdash \colon\ldotp (x\downarrow z)(Q\times P)(y\downarrow w).&\equiv :x,y\in CʻP.z,w\in CʻQ:zQw.\lor.\\ &z=w.xPy \quad[*166·11.*55·202.*13·22]\end{align}$

*166·113. $\begin{align}\vdash \colon\colon x,y\in &CʻP.z,w\in CʻQ.\supset \colon\ldotp \\ &(x\downarrow z)(Q\times P)(y\downarrow w).\equiv :zQw.\lor.z=w.xPy \quad[*166·112]\end{align}$

*166·13. $\vdash \colon\ldotp P\times Q=\dot{\Lambda} .=:P=\dot{\Lambda} .\lor.Q=\dot{\Lambda} \quad[*166·12.*113·114.*33·241]$

*166·14. $\vdash :\dot{\exists} !P\times Q.\equiv .\dot{\exists} !P.\dot{\exists} !Q \quad[*166·13]$

*166·15. $\vdash .\text{Cnv}ʻ(P\times Q)=\breve{P} \times \breve{Q} \quad[*165·19 . *162·2]$

Dem. $\begin{array}{l} \vdash .*166·111.*93·103.\supset \\ \vdash \colon\ldotp M\in \overrightarrow{B}ʻ(P\times Q).&\equiv :(\exists x,z):x\in CʻP.z\in CʻQ.M=z\downarrow x:\\ &{\sim}(\exists y).yPx:{\sim}(\exists w).wQz:\\ [*93·103] &\equiv :(\exists x,z).x\in \overrightarrow{B}ʻP.y\in \overrightarrow{B}ʻQ.M=z\downarrow x:\\ [*113·101] &\equiv :M\in \overrightarrow{B}ʻP\times \overrightarrow{B}ʻQ &\qquad \text{(1)}\\ \vdash .(1).*166·15.&\supset \vdash .\overrightarrow{B}ʻ\text{Cnv}ʻ(P\times Q)=\overrightarrow{B}ʻ\breve{P} \times \overrightarrow{B}ʻ\breve{Q} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in the ordinal theory of progressions (*263·62·65).

*166·2. $\begin{align}&\vdash :R\upharpoonright CʻPʻ\in P\,\overline{\text{smor}}\,Pʻ.\supset .(R\mid )\upharpoonright Cʻ(Q\times Pʻ)\in (Q\times P)\overline{\text{smor}} (Q\times Pʻ)\\ &[*165·36.*166·1.*164·14]\end{align}$

*166·21. $\begin{align}&\vdash :S\upharpoonright CʻQʻ\in Q\,\overline{\text{smor}}\,Qʻ.\supset .(\mid \breve{S} )\upharpoonright Cʻ(Qʻ\times P)\in (Q\times P)\overline{\text{smor}} (Qʻ\times P)\\ &[*165·361.*166·1.*164·14]\end{align}$

*166·22. $\begin{align}\vdash :R\upharpoonright CʻP'\in P\,\overline{\text{smor}}\,P'.&S\upharpoonright CʻQ'\in Q\overline{\text{smor}} Q'.\supset .\\ &(R\parallel \breve{S} )\upharpoonright Cʻ(Q'\times P')\in (Q\times P)\,\overline{\text{smor}}\,(Q'\times P')\\ [*165·362.*166·1.*164·14]\end{align}$

This proposition gives the correlator for the product when correlators are given for the factors.

*166·23. $\begin{align}&\vdash :P \,\text{smor} P'.Q \text{smor} Q'.\supset .Q\times P \,\text{smor} \,Q'\times P'\\ &[*166·22.*151·12]\end{align}$

This proposition enables us to use $Q\times P$ to define the product of the relation-numbers of $Q$ and $P$ , for it shows that the relation-number of $Q\times P$ is determinate when the relation-numbers of $Q$ and $P$ are given. We shall therefore (in Section D of this part) define the product of two relation-numbers $\nu$ and $\mu$ as the relation-number of $Q\times P$ when $\text{N}_{0}\text{r}ʻQ=\nu$ and $\text{N}_{0}\text{r}ʻP=\mu$ .

*166·24. $\begin{align}&\vdash \colon\ldotp \text{Mult ax}.\supset :R\in \text{Rel}^{2}\text{excl}\cap \text{Nr}ʻQ.CʻR\subset \text{Nr}ʻP.\supset .\\ &\Sigma ʻR\,\text{smor}\,Q\times P \quad[*165·38.*164·151.*166·1]\end{align}$

This proposition exhibits the connection of addition and multiplication. If we put $\text{Nr}ʻP=\mu$ and $\text{Nr}ʻQ=\nu$ , then $\Sigma ʻR$ in the above proposition is the sum of $\nu$ relations of which each is a $\mu$ . In virtue of the above proposition, it follows that (if the multiplicative axiom is assumed) $\text{Nr}ʻ\Sigma ʻR=\nu \times \mu$ . In other words, assuming the multiplicative axiom, the sum of $\nu$ series (or other relations), each of which has $\mu$ terms, has $\nu \times \mu$ terms.

*166·3. $\begin{align}&\vdash :\exists !Cʻ(P\times Q)\cap Cʻ(Pʻ\times Qʻ).\equiv .\exists !CʻP\cap CʻPʻ.\exists !CʻQ\cap CʻQʻ\\ &[*166·12.*113·19]\end{align}$

The analogous proposition $\begin{aligned} \dot{\exists} !(P\times Q)\dot{\cap} (Pʻ\times Qʻ).&\equiv :\\ \dot{\exists} !(P\dot{\cap} Pʻ).&\exists !CʻQ\cap CʻQʻ.\lor.\dot{\exists} !(Q\dot{\cap} Qʻ).\exists !CʻP\cap CʻPʻ \end{aligned}$ is only true in general if $P\,\unicode{x2abd}\, J.Pʻ\,\unicode{x2abd}\, J$

*166·31. $\vdash .\dot{s} ʻCʻ(Q\times P)=CʻP\uparrow CʻQ \quad[*113·115.*166·12]$

*166·311. $\begin{align}&\vdash :\dot{\exists} !Q.\supset .sʻ\text{D}ʻʻCʻ(Q\times P)=CʻP:\dot{\exists} !P.\supset .sʻ\text{ᗡ}ʻʻCʻ(Q\times P)=CʻQ\\ &[*113·116.*166·12.*33·24]\end{align}$

*166·312. $\begin{align}&\vdash .sʻ\text{D}ʻʻCʻ(Q\times P)\subset CʻP.sʻ\text{ᗡ}ʻʻCʻ(Q\times P)\subset CʻQ\\ &[*113·118.*166·12]\end{align}$

*166·4. $\begin{align}\vdash \colon\ldotp M \{(P \times Q) \times R\} &M'. \equiv : (\exists x, y, z, x', y', z') :\\ &x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR :\\ &xPx' . \lor . x = x' . yQy'. \lor . x = x' . y = yʻ . zRz' :\\ &M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y' \downarrow x')\end{align}$

Dem. $\begin{array}{l} \vdash . *116·111 . &\supset \vdash \colon\ldotp M \{(P \times Q) \times R\} M' . \equiv : (\exists N, N', z, z') :\\ &N, N' \in Cʻ(P \times Q) . z, z' \in CʻR : N (P \times Q) N' . \lor . N = N' . zRz' :\\ &M = z \downarrow N . M' = z' \downarrow N' :\\ [*116·12 . *113·101] &\equiv : (\exists N, N', x, x', y, y', z, z') :\\ &x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR . N = y \downarrow x . N' = y' \downarrow x' :\\ &N (P \times Q) N' . \lor . N = N' . zRz' : M = z \downarrow N . M' = z' \downarrow N' :\\ [*13·22 . *116·113] &\equiv : (\exists x, x', y, y', z, z') : x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR :\\ &xPx' . \lor . x = x' . yQy' . \lor . y \downarrow x = y' \downarrow x' . zRz' :\\ &M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y' \downarrow x') :\\ [*55·202] &\equiv : (\exists x, x', y, y', z, z') : x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR :\\ &xPx' . \lor . x = x' . yQy' . \lor . x = x' . y = y' . zRz' :\\ &M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y' \downarrow x') \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*166·401. $\begin{align}\vdash \colon\ldotp N \{P \times (Q \times R)\} &N'. \equiv : (\exists x, x', y, y', z, z') :\\ &x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR :\\ &xPx' . \lor . x = x' . yQy' . \lor . x = x' . y = y' . zRz' :\\ &N = (z \downarrow y) \downarrow x . N' = (z' \downarrow y') \downarrow xʻ \quad[\text{Proof as in *166·4}]\end{align}$

*166·41. $\begin{align}\vdash : T = \hat{M} \hat{N} &\{(\exists x, y, z) . x \in CʻP . y \in CʻQ . z \in CʻR . M = z \downarrow (y \downarrow x)\}.\\ &N = \{(z \downarrow y) \downarrow x\} . \supset . T \in \{(P \times Q) \times R\} \overline{\text{smor}} \{P \times (Q \times R)\}\end{align}$

Dem. $\begin{array}{l} \vdash . *21·33 . \supset \vdash \colon\colon \text{Hp} . &\supset \colon\ldotp MTN . M'TN . \supset :\\ &(\exists x, x', y, y', z, z') : x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR :\\ &M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y'\downarrow x') :\\ &N = (z \downarrow y) \downarrow x . N = (z' \downarrow y') \downarrow xʻ :\\ [*55·202] &\supset : (\exists x, x', y, y', z, z') . M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y' \downarrow x') .\\ &x = x' . y = y' . z = z' :\\ [*13·22] &\supset : M = M' &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp} . &\supset : MTN . MTNʻ . \supset . N = N' &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash : \text{Hp} . \supset . T \in 1 \rightarrow 1 &\qquad \text{(3)}\\ \vdash . *21·33 . *13·19 . &\supset \vdash : \text{Hp} . \supset .\\ \text{ᗡ}ʻT &= \hat{N} \{(\exists x, y, z) . x \in CʻP . y \in CʻQ . z \in CʻR . N = (z \downarrow y) \downarrow x\}\\ [*113·101] &= CʻP \times (CʻQ \times CʻR)\\ [*166·12] &= Cʻ\{P \times (Q \times R)\} &\qquad \text{(4)}\\ \vdash . *166·401 . &\supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp M \{T^{;}(P \times (Q \times R))\} M' . \equiv : (\exists x, x', y, y', z, z', N, N') :\\ &x, x' \in CʻP . y, y' \in CʻQ . z, z' \in CʻR . N = (z \downarrow y) \downarrow x . N' = (z' \downarrow y') \downarrow x' .\\ &M = z \downarrow (y \downarrow x) . M' = z' \downarrow (y' \downarrow x') :\\ &xPx'. \lor . x = x' . yQy' . \lor . x = x' . y = y' . zRz' :\\ [*13·19 . *166·4] &\equiv : M \{(P \times Q) \times R\} M' &\qquad \text{(5)}\\ \vdash . (3) . (4) . (5) . *151·11 . \supset \vdash . \text{Prop} \end{array}$

*166·42. $\vdash . (P \times Q) \times R \text{smor} P \times (Q \times R) \quad[*166·41]$

This is the associative law for the kind of multiplication concerned in this number.

The two following propositions give the distributive law. In relation-arithmetic, this is in general only true in one of its two forms, i.e. we have $\begin{aligned} (Q \unicode{x2909} R) \times P &= (Q \times P) \unicode{x2909} (R \times P),\\ \text{but not}\quad P \times (Q \unicode{x2909} R) &= (P \times Q) \unicode{x2909} (P \times R). \end{aligned}$ The latter is true for finite series, but not for infinite series or (except in exceptional cases) for relations which are not serial.

Dem. $\begin{array}{l} \vdash . *166·1 . *38·11 . *150·1 . \supset \vdash . \Sigma ʻ \times P^{;}Q &= \Sigma ʻ\Sigma ^{;}(P \downarrow_{.,} ) \dagger ^{;}Q\\ [*162·34·35] &= \Sigma ʻP \downarrow_{.,} ^{;}\Sigma ʻQ\\ [*166·1] &= (\Sigma ʻQ) \times P . \supset \vdash . \text{Prop} \end{array}$

*166·45. $\vdash . (Q \unicode{x2909} R) \times P = (Q \times P) \unicode{x2909} (R \times P)$

Dem. $\begin{array}{l} \vdash . *166·1 . \supset \vdash . (Q \times P) \unicode{x2909} (R \times P) &= \Sigma ʻP \downarrow_{.,} ^{;}Q \unicode{x2909} \Sigma ʻP \downarrow_{.,} ^{;}R\\ [*162·31] &= \Sigma ʻ(P \downarrow_{.,} ^{;}Q \unicode{x2909} P \downarrow_{.,} ^{;}R)\\ [*162·36] &= \Sigma ʻP \downarrow_{.,} ^{;}(Q \unicode{x2909} R)\\ [*166·1] &= (Q \unicode{x2909} R) \times P . \supset \vdash . \text{Prop} \end{array}$

The following propositions (*166·46—·472) exhibit the failure of the distributive law in the form $P \times (Q \unicode{x2909} R) = (P\times Q)\unicode{x2909}(P \times R)$ , and give certain results for special cases. They are not referred to except in this number.

*166·46. $\vdash . (P \unicode{x228d} Q) \downarrow_{.,} z = P \downarrow_{.,} z \unicode{x228d} Q \downarrow_{.,} z \quad[*165·01 . *150·3]$

*166·461. $\begin{align}&\vdash . \dot{s} ʻCʻ(P \unicode{x228d} Q) \downarrow_{.,} ^{;}R = \dot{s} ʻCʻP \downarrow_{.,} ^{;}R \unicode{x228d} \dot{s} ʻCʻQ \downarrow_{.,} ^{;}R\\ &[*41·6 . *165·12 . *166·46]\end{align}$

*166·462. $\begin{align}&\vdash .F^{;}(P\unicode{x228d} Q)\downarrow_{.,} ^{;}R=F^{;}P\downarrow_{.,} ^{;}R\unicode{x228d} F^{;}Q\downarrow_{.,} ^{;}R\unicode{x228d} \hat{M} \hat{N} \{(\exists x,y,z,w):\\ &zRw:x\in CʻP.y\in CʻQ.\lor.x\in CʻQ.y\in CʻP:M=x\downarrow z.N=y\downarrow w\}\end{align}$

Dem. $\begin{array}{l} \vdash .*165·161.&\supset \vdash .F^{;}(P\unicode{x228d} Q)\downarrow_{.,} ^{;}R\\ &=\hat{M} \hat{N} \{(\exists x,y,z,w).x,y\in CʻP\cup CʻQ.zRw.M=x\downarrow z.N=y\downarrow w\}\\ [*22·34] &=\hat{M} \hat{N} \{(\exists x,y,z,w):x,y\in CʻP.\lor.x,y\in CʻQ.\lor.\\ &x\in CʻP.y\in CʻQ.\lor.x\in CʻQ.y\in CʻP:zRw.M=x\downarrow z.N=y\downarrow w\}\\ [*11·41.*165·161]&=F^{;}P\downarrow_{.,} ^{;}R\unicode{x228d} F^{;}Q\downarrow_{.,} ^{;}R\unicode{x228d} \hat{M} \hat{N} \{(\exists x,y,w):\\ &x\in CʻP.y\in CʻQ.\lor.x\in CʻQ.y\in CʻP:\\ &zRw.M=x\downarrow z.N=y\downarrow w\}.\supset \vdash .\text{Prop} \end{array}$

*166·463. $\vdash :CʻP\subset CʻQ.\supset .F^{;}P\downarrow_{.,} ^{;}R\,\unicode{x2abd}\, F^{;}Q\downarrow_{.,} ^{;}R \quad[*165·161]$

*166·464. $\vdash :CʻP\subset CʻQ.\supset .F^{;}(P\unicode{x228d} Q)\downarrow_{.,} ^{;}R=F^{;}Q\downarrow_{.,} ^{;}R=F^{;}P\downarrow_{.,} ^{;}R\unicode{x228d} F^{;}Q\downarrow_{.,} ^{;}R$

Dem. $\begin{array}{l} \vdash .*166·463. \supset \vdash :\text{Hp}.&\supset .F^{;}P\downarrow_{.,} ^{;}R\,\unicode{x2abd}\, F^{;}Q\downarrow_{.,} ^{;}R &\qquad \text{(1)}\\ \vdash .*33·262. &\supset \vdash :\text{Hp}.\supset .Cʻ(P\unicode{x228d} Q)=CʻQ.\\ [*166·463] &\supset .F^{;}(P\unicode{x228d} Q)\downarrow_{.,} ^{;}R=F^{;}Q\downarrow_{.,} ^{;}R &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*166·47. $\begin{align}&\vdash .R\times (P\unicode{x228d} Q)=(R\times P)\unicode{x228d} (R\times Q)\unicode{x228d} \hat{M} \hat{N} \{(\exists x,y,z,w):\\ &x\in CʻP.y\in CʻQ.\lor.x\in CʻQ.y\in CʻP:zRw.M=x\downarrow z.N=y\downarrow w\}\\ &[*166·461·462·1.*162·1]\end{align}$

*166·471. $\begin{align}&\vdash :CʻP\subset CʻQ.\supset .R\times (P\unicode{x228d} Q)=(R\times P)\unicode{x228d} (R\times Q)\\ &[*166·461·464]\end{align}$

*166·472. $\vdash .R\times (P\unicode{x2909}Q)=(R\times P)\unicode{x228d} (R\times Q)\unicode{x228d} R\times (CʻP\downarrow CʻQ)$

Dem. $\begin{array}{l} \vdash .*166·471.*35·85.\supset \\ \vdash \colon\ldotp \dot{\exists} !Q.&\supset :R\times (P\unicode{x2909}Q)=(R\times P)\unicode{x228d} R\times \{Q\unicode{x228d} (CʻP\uparrow CʻQ)\}:\\ [*166·471.*35·86] &\supset :\dot{\exists} !P.\supset .R\times (P\unicode{x2909}Q)=(R\times P)\unicode{x228d} (R\times Q)\unicode{x228d} R\times (CʻP\uparrow CʻQ) &\qquad \text{(1)}\\ \vdash .*160·21.*166·13.\supset \\ \vdash :Q=\dot{\Lambda} .&\supset .P\unicode{x2909}Q=P.R\times Q=\dot{\Lambda} .R\times (CʻP\uparrow CʻQ)=\dot{\Lambda} .\\ [*25·24] &\supset .R\times (P\unicode{x2909}Q)=(R\times P)\unicode{x228d} (R\times Q)\unicode{x228d} R\times (CʻP\downarrow CʻQ) &\qquad \text{(2)}\\ \text{Similarly}\\ \vdash :P=\dot{\Lambda} .&\supset .R\times (P\unicode{x2909}Q)=(R\times P)\unicode{x228d} (R\times Q)\unicode{x228d} R\times (CʻP\uparrow CʻQ) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the distributive law for the addition of a single term to a relation. This law, in the form in which it holds, is given in *166·53 ·531 (remembering $\text{Nr}ʻP\downarrow_{.,} y=\text{Nr}ʻP$ ). *166·54 ·541 exhibit the failure of the other form.

*166·5. $\vdash .(Q\unicode{x228d} R)\times P=(Q\times P)\unicode{x228d} (R\times P)$

Dem. $\begin{array}{l} \vdash .*166·1.\supset \vdash .(Q\unicode{x228d} R)\times P&=\Sigma ʻP\downarrow_{.,} ^{;}(Q\unicode{x228d} R)\\ [*162·27] &=\Sigma ʻP\downarrow_{.,} ^{;}Q\unicode{x228d} \Sigma ʻP\downarrow_{.,} ^{;}R\\ [*166·1] & =(Q\times P)\unicode{x228d} (R\times P).\supset \vdash .\text{Prop} \end{array}$

*166·51. $\vdash .(Q\unicode{x21f8} y)\times P=(Q\times P)\unicode{x228d} (CʻQ\uparrow {℩}ʻy)\times P \quad[*166·5.*161·1]$

*166·511. $\vdash .(y\unicode{x21f7}Q)\times P=({℩}ʻy\uparrow CʻP)\times P\unicode{x228d} (Q\times P)$

*166·52. $\vdash .P\downarrow_{.,} ^{;}(Q\unicode{x21f8} y)=P\downarrow_{.,} ^{;}Q\unicode{x21f8} P\downarrow_{.,} y \quad[*161·4.*165·2]$

*166·521. $\vdash .P\downarrow_{.,} ^{;}(y\unicode{x21f7}Q)=P\downarrow_{.,} y\unicode{x21f7}P\downarrow_{.,} ^{;}Q$

*166·53. $\vdash :\dot{\exists} !Q.\supset .(Q\unicode{x21f8} y)\times P=(Q\times P)\unicode{x2909}(P\downarrow_{.,} y)$

Dem. $\begin{array}{l} \vdash .*162·43.*165·243.\supset \vdash :\text{Hp}.&\supset .\Sigma ʻ(P\downarrow_{.,} ^{;}Q\unicode{x21f8} P\downarrow_{.,} y)=\Sigma ʻP\downarrow_{.,} ^{;}Q\unicode{x2909}P\downarrow_{.,} y.\\ [*166·52] &\supset .\Sigma ʻ(P\downarrow_{.,} ^{;}(Q\unicode{x21f8} y)=\Sigma ʻP\downarrow_{.,} ^{;}Q\unicode{x2909}P\downarrow_{.,} y &\qquad \text{(1)}\\ \vdash .(1).*166·1.\supset \vdash .\text{Prop} \end{array}$

*166·531. $\vdash :\dot{\exists} !Q.\supset .(y\unicode{x21f7}Q)\times P=(P\downarrow_{.,} y)\unicode{x2909}(Q\times P)$

*166·54. $\vdash .Q\times (P\unicode{x21f8} x)=(Q\times P)\unicode{x228d} Q\times (CʻP\uparrow {℩}ʻx)$

Dem. $\begin{array}{l} \vdash .*161·1.\supset \vdash .Q\times (P\unicode{x21f8} x)&=Q\times \{P\unicode{x228d} (CʻP\uparrow {℩}ʻx)\}\\ [*35·85.*166·471] &=(Q\times P)\unicode{x228d} Q\times (CʻP\uparrow {℩}ʻx).\supset \vdash .\text{Prop} \end{array}$

*166·541. $\vdash .Q\times (x\unicode{x21f7}P)=Q\times ({℩}ʻx\uparrow CʻP)\unicode{x228d} (Q\times P)$

In the present section, we have to consider various forms of a principle which is of the utmost utility in relation-arithmetic. This principle may be called "the principle of first differences." It has been explained and used by Hausdorff in brilliant articles[15]. The results there obtained by its use give some measure of its importance in relation-arithmetic. It has, however, other uses besides those that are concerned with the multiplication and exponentiation of relation-numbers, as, for example, in the ordering of segments and stretches in a series, or of any other set of classes which are contained in the field of a given relation. In the present section, after the first two numbers, we shall be concerned with its arithmetical uses, but other uses will occur later.

The principle of first differences has various forms which, though analogous, cannot, in the general case, be reduced to one common genus. The simplest of these is the relation $P_{\text{cl}}$ , by which the sub-classes of $CʻP$ are ordered. This is defined as follows. If $\alpha$ and $\beta$ are both contained in $CʻP$ , we say that $\alpha P_{\text{cl}}\beta$ if there are terms belonging to $\alpha$ but not to $\beta$ such that no terms belonging to $\beta$ and not to $\alpha$ precede them; i.e. if, after taking away the terms (if any) which are common to $\alpha$ and $\beta$ , there are terms left in $\alpha$ which do not come after any of the terms left in $\beta$ , i.e. if $\exists !\alpha-\beta -\breve{P} ʻʻ(\beta -\alpha )$ . Thus the definition is $P_{\text{cl}}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha )\} \quad\text{Df}.$ It will be seen that this relation holds if $\beta \subset \alpha.\beta \neq \alpha$ . Thus it holds between any existent member of $\text{Cl}ʻCʻP$ and $\Lambda$ , and between $CʻP$ and any member of $\text{Cl}ʻCʻP$ other than $CʻP$ itself. When $P$ is a serial relation (which is the important case for all the relations in this section), $P_{\text{cl}}$ is transitive $(P^{2}_{\text{cl}}\,\unicode{x2abd}\, P_{\text{cl}})$ and asymmetrical $(P_{\text{cl}}\dot{\cap} \breve{P} _{\text{cl}}=\dot{\Lambda})$ , but not necessarily connected, i.e. there may[Pg 404] be two members of its field of which neither has the relation $P_{\text{cl}}$ to the other. This happens whenever $P$ is not well-ordered; but when $P$ is well-ordered, $P_{\text{cl}}$ is connected, and therefore generates a series.

To illustrate the order generated by $P_{\text{cl}}$ in a simple case, consider a series of three terms, $x$ , $y$ , $z$ . Let us for the moment write $(x\downarrow y\downarrow z)$ for the relation $x\downarrow y\unicode{x228d} x\downarrow z\unicode{x228d} y\downarrow z,\,\, \textit{i.e.}\,\, (x\downarrow y)\unicode{x21f8} z,$ and similarly we will write $(x\downarrow y\downarrow z\downarrow w)$ for $x\downarrow y\downarrow z\unicode{x21f8} w$ , and so on. Then assuming $x\neq y.x\neq z.y\neq z$ , $\begin{aligned} (x\downarrow y\downarrow z)_{\text{cl}}=(\iota ʻx\cup \iota ʻy\cup \iota ʻz)&\downarrow (\iota ʻx\cup \iota ʻy)\\ &\downarrow (\iota ʻx\cup \iota ʻz)\downarrow \iota ʻx\downarrow (\iota ʻy\cup \iota ʻz)\downarrow \iota ʻy\downarrow \iota ʻz\downarrow \Lambda . \end{aligned}$ In this series, a class containing $x$ is always earlier than one not containing $x$ ; and of two classes of which both or neither contain $x$ , one containing $y$ is earlier than one not containing $y$ ; and of two classes of which both or neither contain $x$ , and both or neither contain $y$ , one containing $z$ is earlier than one not containing $z$ . Thus our relation may be generated as follows: Begin with $(\iota ʻz)\downarrow \Lambda$ , which is $(z\downarrow z)_{\text{cl}}$ . Add before these terms what results from adding $\iota ʻy$ to each; then we have $(y\downarrow z)_{\text{cl}}$ , which is $(\iota ʻy\cup \iota ʻz)\downarrow \iota ʻy\downarrow \iota ʻz\downarrow \Lambda .$ Now add at the beginning what results from adding $\iota ʻx$ to each of the above four classes, and we have $(x\downarrow y\downarrow z)_{\text{cl}}$ . Thus generally, if $x{\sim}\in CʻP$ , $(x\unicode{x21f7}P)_{\text{cl}}=(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}}.$ Thus by adding one term to $P$ , we double the number of terms in $P_{\text{cl}}$ .

Again, if $P$ and $Q$ are two relations which have no common terms in their fields, we shall have $\begin{aligned} \alpha P_{\text{cl}}&\beta .\gamma ,\delta \in \text{Cl}ʻCʻQ.\supset .(\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\beta \cup \delta )\\ &\text{and}\quad \alpha \in \text{Cl}ʻCʻP.\gamma Q_{\text{cl}}\delta .\supset .(\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\alpha \cup \delta ), \end{aligned}$ while conversely $\begin{aligned} \alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.(\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}&(\beta \cup \delta ).\supset :\\ &\alpha P_{\text{cl}}\beta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta . \end{aligned}$ Hence $\begin{aligned} (\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\beta \cup \delta ).&\equiv .(\gamma \downarrow \alpha )(P_{\text{cl}}\times Q_{\text{cl}})(\delta \downarrow \beta )\\ &\equiv .(\alpha \cup \gamma ){s^{;}C^{;}(P_{\text{cl}}\times Q_{\text{cl}})}(\beta \cup \delta ), \end{aligned}$ so that $\text{Nr}ʻ(P\unicode{x2909}Q)_{\text{cl}}=\text{Nr}ʻP_{\text{cl}}\times \text{Nr}ʻQ_{\text{cl}}$ .

These propositions illustrate the connection of $P_\text{cl}$ with multiplication.

Besides $P_{\text{cl}}$ , we often require (though not in this Part) the relation which is the converse of $(\breve{P})_{\text{cl}}$ . This relation we call $P_{\text{lc}}$ , so that $P_{\text{lc}}=\text{Cnv}ʻ(\breve{P} )_{\text{cl}} \quad\text{Df}.$ This begins with $\Lambda$ , and ends with $CʻP$ .

Thus we shall have, for example, $\begin{aligned} (x\downarrow y\downarrow z)_{\text{lc}} = \Lambda \downarrow \iota ʻx\downarrow \iota ʻy&\downarrow (\iota ʻx\cup \iota ʻy)\\ &\downarrow \iota ʻz\downarrow (\iota ʻx\cup \iota ʻz)\downarrow (\iota ʻy\cup \iota ʻz)\downarrow (\iota ʻx\cup \iota ʻy\cup \iota ʻz). \end{aligned}$ Here, if we start from $\Lambda \downarrow \iota ʻx$ , which is $(x\downarrow x)_{\text{lc}}$ , the series grows by adding terms at the end: we add $\iota ʻy$ to each member of $\Lambda \downarrow\iota ʻx$ and put the resulting terms $\iota ʻy, \iota ʻx\cup \iotaʻy$ after $\Lambda$ and $\iota ʻx$ ; we then add $\iota ʻz$ to each of the four terms we already have, and add the resulting terms at the end; and so we can proceed indefinitely.

The relation $P_{\text{lc}}$ with its field limited arranges the segments of P in ascending order of magnitude; if the class of segments is $\sigma$ , $P_{\text{lc}}\unicode{x0294f}\sigma$ generates what may be called the natural order among the segments (cf. *212).

A variant of $P_{\text{cl}}$ is afforded by the relation $P_{\text{df}}$ (*171), which is to hold between two members $\alpha$ , $\beta$ of $\text{Cl}ʻCʻP$ when the first term of either which does not belong to both belongs to $\alpha$ , i.e. the "first difference" belongs to $\alpha$ . This relation implies $P_{\text{cl}}$ , and coincides with it if $P$ is well-ordered; but when $P$ is not well-ordered, $P_{\text{cl}}$ may hold between two classes which have no first point of difference, e.g. (if $P$ is "less than" among rationals) if $\alpha$ consists of rationals between 0 and 1 (both excluded) and $\beta$ of rationals between 1 and 2 (both excluded). The definition of $P_{\text{df}}$ is $P_{\text{df}} = \hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz = \overrightarrow{P}ʻz\cap \beta\} \quad\text{Df}.$

The relation $P_{\text{df}}$ has the interesting property that its relation-number is found by raising $2_{r}$ to the power $\text{Nr}ʻP$ (cf. *177). As the field of $P_{\text{df}}$ is $\text{Cl}ʻCʻP$ , this theorem is the ordinal analogue of $\text{Nc}ʻ\text{Cl}ʻ\alpha = 2^{\text{Nc}ʻ\alpha}$ (*116·72).

A somewhat more complicated form of the relation of first differences arises when we have a series of series. Let us suppose, to begin with, that $P$ is a serial relation whose field consists of mutually exclusive serial relations.

Thus in the accompanying figure, each row represents a series, the generating relations of these series being $Q$ , ... $R$ ,... But the series themselves form a series, which may be regarded as generated by a relation $P$ whose field consists of the relations $Q$ , ... $R$ ,... (It might be thought more natural to take $CʻQ$ , $CʻR$ , ... as the field of $P$ ; but this would lead to confusion in the case when two or more of the series have the same field.) Suppose we now wish to find a relation which will order the multiplicative class of the fields of $Q$ , $R$ , ..., i.e. the class $\text{Prod}ʻCʻʻCʻP$ . In the case illustrated in the figure, in which $P$ generates a well-ordered series, and all the members of $CʻP$ are serial, and $P\in \text{Rel}^{2}\text{excl}$ , we might use $(\Sigma ʻP)_{\text{cl}}$ ; this relation, with its field limited to $\text{Prod}ʻCʻCʻʻP$ , will then give us what we want. This relation will, in the case supposed, put[Pg 406] a selected class $\mu$ before another selected class $\nu$ if, where they first differ, $\mu$ chooses an earlier term than $\nu$ . But if the series $P$ is not well-ordered—if it is (say) of the type $\text{Cnv}ʻʻ\omega$ (cf. *263)—there may be no first member of the field of $P$ where $\mu$ and $\nu$ differ. This will happen, for example, if $\mu$ consists of all the first terms, and $\nu$ of all the second terms. Our ordering relation can be so defined as to put $\mu$ before $\nu$ in this case also, but if it is so defined, the associative law of multiplication only holds if $P$ is well-ordered. For this reason, we define our ordering relation so that, in such a case, $\mu$ comes neither before nor after $\nu$ . Again, if $P$ is not a $\text{Rel}^{2}\text{excl}$ , a member of a selected class may occur twice, once as the representative of $CʻQ$ , and once as that of $CʻR$ , if $CʻQ$ and $CʻR$ have terms in common. We wish to distinguish these two occurrences. Hence we proceed as follows: If $\mu$ and $\nu$ are two selected classes of $CʻʻCʻP$ , let there be one or more members of $CʻP$ in which the $\mu$ -representative precedes the $\nu$ -representative, and which are such that, among all earlier[16] members of $CʻP$ , the $\mu$ -representative is identical with the $\nu$ -representative.

But a further modification is desirable in order to meet the case in which two or more of the members of $CʻP$ have the same field. Suppose, for example, we had to deal with a series consisting of all the series that can be formed out of a given set of terms: in this case, we should have to distinguish occurrences of any given term not by the field, but by the generating relation. This requires that we should make an $F$ -selection from $CʻP$ , not an ${\in}$ -selection from $CʻʻCʻP$ . Hence we take two members of $F_{\Delta }ʻCʻP$ , say $M$ and $N$ , and we arrange them or their domains on the following principle: We put $M$ before $N$ (or $\text{D}ʻM$ before $\text{D}ʻN$ ) if there is a relation $Q$ in the field of $P$ such that the $M$ -representative of $Q$ , i.e. $MʻQ$ , has the relation $Q$ to the $N$ -representative of $Q$ , and such that, if $R$ is any earlier member of $CʻP$ , then $MʻR$ is identical with $NʻR$ . That is, $M$ precedes $N$ if $(\exists Q):(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR = NʻR.$

The relation between $M$ and $N$ so defined has the properties required of an arithmetical product; hence we put $\begin{aligned} \Pi ʻP=\hat{M} \hat{N} &\{M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR=NʻR\} \quad\text{Df}.\\ \end{aligned}$

This relation is the ordinal analogue of ${\in}_{\Delta}ʻ\kappa$ . The ordinal analogue of $\text{Prod}ʻ\kappa$ is the corresponding relation of the domains of $M$ and $N$ , i.e. $\text{D}^{;}\PiʻP$ ; hence we put $\text{Prod}ʻP= \text{D}^{;}\Pi ʻP \quad\text{Df}.$

In case $P$ is a $\text{Rel}^{2}\text{excl}$ , we have $\text{Nr}ʻ\text{Prod}ʻP=\text{Nr}ʻ\Pi ʻP$ . But when $P$ is not a $\text{Rel}^{2}\text{excl}$ , $\text{Prod}ʻP$ and $\Pi ʻP$ are in general not ordinally similar. We can, however, always make a $\text{Rel}^{2}\text{excl}$ by replacing the members $x$ , $y$ , etc. of[Pg 407] $CʻQ$ (where $Q\in CʻP$ ) by $x\downarrow Q,y\downarrow Q$ , etc. In this way, if $x$ occurs twice in $Cʻ\Sigma ʻP$ , once as a member of $CʻQ$ , and once as a member of $CʻR$ , the two occurrences are made to correspond to $x\downarrow Q$ and $x\downarrow R$ respectively, and thus we get a new relation which is a $\text{Rel}^{2}\text{excl}$ .

If every member of $CʻP$ has a first term, $B\upharpoonright CʻP$ will be the first term of $\Pi ʻP$ , and $BʻʻCʻP$ will be the first term of $\text{Prod}ʻP$ . If further there is a last member of $CʻP$ , i.e. if $\text{E}!Bʻ\breve{P}$ , and if this last member has a second term, the second member of $\Pi ʻP$ is obtained by taking this second term as the representative of $Bʻ\breve{P}$ , and leaving all the other representatives unchanged. In any case, if $Bʻ\breve{P}$ exists, the earliest successors of any member of $\Pi ʻP$ are those obtained by only varying the representative in $Bʻ\breve{P}$ . Thus, if $Bʻ\breve{P}$ exists, those members of $\Pi ʻP$ which have a given set of representatives in all members of $\text{D}ʻP$ form a consecutive stretch of the series, and this stretch is like $Bʻ\breve{P}$ . If $Bʻ\breve{P}$ has an immediate predecessor, the stretches obtained by varying only the representative in this predecessor are again consecutive, and form a series like the said predecessor; and so on. This makes it plain why $\Pi ʻP$ has the properties of a product.

As in the case of cardinals, the definition of exponentiation is derived from that of multiplication. We put $\begin{aligned} P\,\,\text{exp}\,\,Q&=\text{Prod}ʻP\downarrow_{.,} ^{;}Q &\quad\text{Df}.\\ \text{We put also}\quad P^{Q}&=\dot{s} ^{;}(P\,\,\text{exp}\,\,Q) &\quad\text{Df}. \end{aligned}$ This is an important relation, which deserves consideration apart from the fact that it is useful in connection with exponentiation. It will be found that $\begin{aligned} P^{Q}=\hat{M} \hat{N} &\{M,N\in (CʻP\uparrow CʻQ)_{\Delta }ʻCʻQ\colon\ldotp \\ &(\exists y):y\in CʻQ.(Mʻy)P(Nʻy):xQy.x\neq y.\supset _{x}.Mʻx=Nʻx\}. \end{aligned}$

This is a form of the principle of first differences which is appropriate when two relations are concerned, instead of only one as in $P_{\text{cl}}$ . The principle, in this case, is as follows: Let $M$ , $N$ be any two one-many relations which relate part (or the whole) of $CʻP$ to the whole of $CʻQ$ . That is, each of the two relations assigns a representative in $CʻP$ to every term of $CʻQ$ , but different terms of $CʻQ$ may have the same representative. Then in travelling along the series $Q$ , there is to be, sooner or later, a term $y$ whose $M$ -representative is earlier than its $N$ -representative, and terms which come earlier than $y$ in $Q$ are all to have their $M$ -representatives identical with their $N$ -representatives.

The relation $P^{Q}$ may be subjected to various restrictions which give important results. This subject has been treated by Hausdorff. For[Pg 408] example, if $P=x\downarrow y$ (where $x\neq y$ ), and $Q$ is of the ordinal type which Cantor calls $\omega$ , i.e. the type of progressions (generated by transitive relations), then if $z$ is any member of $CʻQ$ , $Mʻz$ is always either $x$ or $y$ . If we impose the condition that $Mʻz$ is to be $x$ except for a finite number of values of $z$ , the resulting series is of the type of the rationals in order of magnitude, i.e. the type called $\eta$ . If we impose the condition that there are to be an infinite number of values of $z$ for which $Mʻz=y$ , the resulting series is a continuum, i.e. it is of the ordinal type called $\theta$ ; in this case, the contained "rational" series consists of those $M$ 's for which there are only a finite number of $z$ 's having $Mʻz=x$ . If we impose no limitation, $P^{Q}$ is of the type presented by the real numbers when decimals ending in 9 recurring are counted separately from the terminating decimals having the same value.

We may generalize $P^{Q}$ , instead of restricting it. To begin with, we may allow our $M$ and $N$ to have only part of $CʻQ$ for their converse domain, and remove the assumption that there is a first member of $CʻQ$ for which $Mʻy$ and $Nʻy$ differ; this leads to the relation $\begin{aligned} \hat{M} \hat{N} &\{M,N\in (1\rightarrow \text{Cls})\cap \text{Rl}ʻ(CʻP\uparrow CʻQ)\colon\ldotp\\ &(\exists y):(Mʻy)P(Nʻy):xQy.x\in \text{ᗡ}ʻN.\supset _{x}.(Mʻx)(P\unicode{x228d} I)(Nʻx)\}. \end{aligned}$ Further, we may drop the restriction to one-many relations. It will be observed that if $(Mʻy)P(Nʻy)$ , we have $y (\breve{M} \mid P\mid N)y$ . Thus we may consider the relation $\begin{aligned} MN[\hat{M} ,\hat{N} \in \text{Rl}ʻ&(CʻP\uparrow CʻQ)\colon\ldotp \\ &(\exists y):y(\breve{M} \mid P\mid N)y:xQy.\supset _{x}.x\{\breve{M} \mid (P\unicode{x228d} I)\mid N\}x]. \end{aligned}$ This relation has for its field all relations contained in $CʻP\uparrow CʻQ$ . We may, if we like, drop even this restriction, and consider $\hat{M} \hat{N} [(\exists y):y\in CʻQ.y(\breve{M} \mid P\mid N)y:xQy.\supset _{x}.x\{\breve{M} \mid (P\unicode{x228d} I\upharpoonright CʻP)\mid N\}x].$ This represents the most general form of the principle of first differences as applied to a couple of relations $P$ and $Q$ . In ordinal arithmetic, however, $P^{Q}$ is sufficiently general for the uses we wish to make of it.

The formal laws, as far as they are true, can be proved without excessive difficulty. We have $\vdash :P\neq Q.\supset .\text{Nr}ʻ\Pi ʻ(P\downarrow Q)=\text{Nr}ʻ(P\times Q),$ which connects the two kinds of multiplication; $\begin{aligned} &\vdash :P \,\text{smor smor}\, Q.\supset .\text{Nr}ʻ\Pi ʻP=\text{Nr}ʻ\Pi ʻQ,\\ &\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\text{Nr}ʻ\Pi ʻ\Pi ^{;}P=\text{Nr}ʻ\Pi ʻ\Sigma ʻP, \end{aligned}$ which is one form of the associative law, of which another form is $\vdash :P\neq Q.\supset .\text{Nr}ʻ(\Pi ʻP\times \Pi ʻQ)=\text{Nr}ʻ\Pi ʻ(P\unicode{x2909}Q).$ [Pg 409] Also $\vdash :P,\Sigma ʻP\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\text{Nr}ʻ\text{Prod}ʻ\text{Prod}^{;}P=\text{Nr}ʻ\text{Prod}ʻ\Sigma ʻP=\text{Nr}ʻ\Pi ʻ\Sigma ʻP,$ which is the associative law for " $\text{Prod}$ ." We have $\begin{aligned} &\vdash :CʻQ\cap CʻR=\Lambda .\supset .\text{Nr}ʻ(P^{Q}\times P^{R})=\text{Nr}ʻP^{Q\unicode{x2909}R},\\ &\vdash .\text{Nr}ʻ(P^{Q})^{R}=\text{Nr}ʻ(P^{R\times Q}). \end{aligned}$ But we do not have in general $\text{Nr}ʻ(P^{R}\times Q^{R})=\text{Nr}ʻ(P\times Q)^{R},$ which obviously would require the commutative law for multiplication, and therefore does not hold in general in spite of the fact that its cardinal analogue does always hold.

As regards the connection with cardinals, we have $\begin{aligned} &\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .Cʻ\text{Prod}ʻP=\text{Prod}ʻCʻʻCʻP,\\ &\vdash :\dot{\exists} !Q.\supset .Cʻ(P\,\,\text{exp}\,\,Q)=(CʻP)\,\,\text{exp}\,\,(CʻQ), \end{aligned}$ and we have already had $\vdash .Cʻ(P\times Q)=CʻP\times CʻQ.$ Moreover the correlators by which similarity is established in cardinals generally suffice to establish likeness in the analogous cases in relation-arithmetic. Thus we have $\begin{aligned} \vdash :S\in P\,\overline{\text{smor}}\,Q.\supset .S_{\in }\upharpoonright \text{Cl}ʻCʻQ\in P_{\text{cl}}\,\overline{\text{smor}}\,Q_{\text{cl}},\\ \vdash :P,Q\in \text{Rel}^{2}\text{excl}.S\upharpoonright Cʻ\Sigma ʻQ\in P\overline{\text{smor}} &\overline{\text{smor}}\,Q.\supset .\\ &S_{\in }\upharpoonright Cʻ\text{Prod}ʻQ\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻQ),\\ \vdash :S\upharpoonright CʻP'\in P\,\overline{\text{smor}}\,P'.&T\upharpoonright CʻQʻ\in Q\,\overline{\text{smor}}\,Q'.\supset .\\ &(S\parallel \breve{T} )\upharpoonright Cʻ(P'\,\,\text{exp}\,\,Q')\in (P\,\,\text{exp}\,\,Q)\,\overline{\text{smor}}\,(P'\,\,\text{exp}\,\,Q'), \end{aligned}$ which are all closely analogous to propositions which were proved in cardinals.

The applications of the propositions of this section are almost wholly to series, and it is convenient to imagine our relations to be serial. But the hypothesis that they are serial is not necessary to the truth of any of the propositions of the present section, and it is a remarkable fact that so many of the formal laws of ordinal arithmetic hold for relations in general.

It should be observed that $\Pi ʻP$ is not always a series when $P$ is a series and all the relations in the field of $P$ are series. A series (cf. *204) is a relation $P$ which is (1) contained in diversity, (2) transitive, (3) connected, i.e. such that every term of the field of P has the relation P or the relation $\breve{P}$ to every other term of the field. It is the third condition which may fail for $\Pi ʻP$ , and which in fact does fail whenever $P$ is not well-ordered. Thus suppose, for the sake of simplicity, that $P$ is of the type $\text{Cnv}ʻʻ\omega$ , which we will call a regression, i.e. the converse of a progression (cf. *263); and suppose that the field of $P$ consists entirely of couples. Take a selection $M$ which chooses the first term of every odd couple, and the second term of every even couple ; and take another selection $N$ which chooses the second term of every odd couple, and the first term of every even couple. Neither of these two selections has the relation $\Pi ʻP$ to the other, for whatever term $Q$ of $CʻP$ we choose, if $M$ is the selection which chooses the first term of $Q$ , there is an earlier term of $CʻP$ (namely the immediate predecessor of $Q$ ) in which $N$ chooses the first term while $M$ chooses the second. Hence there is no such $Q$ as is required for $M(\Pi ʻP)N$ ; and a similar argument holds against $N(\Pi ʻP)M$ . In such a case, $\Pi ʻP$ generates a number of different series, and by suitable restrictions of the field, one of these series can be extracted. Exactly similar remarks apply to $P^{Q}$ .

FOOTNOTES:

[15] "Untersuchungen über Ordnungstypen," Berichte der mathematisch-physischen Klasse der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, Feb. 1906 and Feb. 1907. Cf. also his "Grundzüge einer Theorie der geordneten Mengen," Math. Annalen, 65 (1908).

[16] Here $Q$ is said to be earlier than $R$ if $Q$ has the relation $P$ to $R$ and is not identical with $R$ .

The definition to be given in this number of the relation of first differences among the sub-classes of a given class is by no means the only one possible, in fact a different definition will be considered in *171. In the present number, the definition we choose is this: $\alpha$ is said to precede $\beta$ according to this definition when $\alpha$ has at least one member which neither belongs to $\beta$ nor follows any term belonging to $\beta$ and not to $\alpha$ ( $\alpha$ and $\beta$ being both sub-classes of $CʻP$ ). In other words, if we consider the two classes $\alpha-\beta$ and $\beta -\alpha$ , there are members of $\alpha -\beta$ which are not preceded by any members of $\beta -\alpha$ . Pictorially, we may conceive the relation as follows ( $P$ being supposed serial): $\alpha$ and $\beta$ each pick out terms from $CʻP$ , and these terms have an order conferred by $P$ ; we suppose that the earlier terms selected by $\alpha$ and $\beta$ are perhaps the same, but sooner or later, if $\alpha \neq \beta$ , we must come to terms which belong to one but not to the other. We assume that the earliest terms of this sort belong to $\alpha$ , not to $\beta$ ; in this case, $\alpha$ has to $\beta$ the relation $P_{\text{cl}}$ . That is, where $\alpha$ and $\beta$ begin to differ, it is terms of $\alpha$ that we come to, not terms of $\beta$ . We do not assume that there is a first term which belongs to $\alpha$ and not to $\beta$ , since this would introduce undesirable restrictions in case $P$ is not well-ordered.

A few of the propositions of the present number will be used in the next number, which deals with a slightly different form of the relation of first differences, but with this exception the propositions of this number will not be referred to again until we come to series. Their chief use occurs in the section on compact series, rational series, and continuous series (Part V, Section F), especially in *274 and *276, which respectively establish the existence of rational series (assuming the axiom of infinity) and the fact that the cardinal number of terms in a continuous series is the same as the number of classes contained in the field of a progression, i.e. $2^{\aleph _{0}}$ . The definitions and a few of the simpler propositions are also used in connection with the series of segments of a series, since, as explained above, the segments of a series $P$ are arranged in the series [Pg 412]generated by $P_{\text{lc}}$ .

The propositions of this number which will be used in dealing with series are the following:

*170·1. $\vdash :\alpha P_{\text{cl}}\beta .\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha )$

*170·102. $\vdash :\alpha P_{\text{lc}}\beta .\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\beta -\alpha -Pʻʻ(\alpha -\beta )$

*170·11. $\vdash \colon\ldotp \alpha P_{\text{cl}}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists y).y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha$

*170·16. $\vdash :\alpha \subset CʻP.\beta \subset \alpha .\beta \neq \alpha .\supset .\alpha P_{\text{cl}}\beta$

I.e. every sub-class of $CʻP$ has the relation $P_{\text{cl}}$ to every proper part of itself.

*170·17. $\vdash .P_{\text{cl}}\,\unicode{x2abd}\, J.P_{\text{lc}}\,\unicode{x2abd}\, J$

*170·2. $\vdash \colon\ldotp \alpha ,\beta \in \text{Cl}ʻCʻP:(\exists y).ye\alpha -\beta .\overrightarrow{P}ʻy\cap \alpha =\overrightarrow{P}ʻy\cap \beta :\supset .\alpha P_{\text{cl}}\beta$

This proposition deals with the case where there is a definite first term y which belongs to $\alpha$ and not to $\beta$ , and whose predecessors all belong to both or neither.

*170·23. $\begin{align}\vdash \colon\ldotp \alpha \subset CʻP.y \in\alpha -\beta -\breve{P} ʻʻ&(\beta -\alpha).\supset :\\ &y \text{min}_{P}(\alpha -\beta ).\equiv .\overrightarrow{P}ʻy\cap \alpha =\overrightarrow{P}ʻy\cap \beta\end{align}$

This proposition is useful in case $P$ is well-ordered, since then $\alpha -\beta$ must have a minimum if it exists ( $\alpha$ and $\beta$ being supposed sub-classes of $CʻP$ ).

*170·31. $\vdash :\beta \subset CʻP.\beta \neq CʻP.\equiv .(CʻP)P_{\text{cl}}\beta$

*170·32. $\vdash :\alpha \subset CʻP.\exists !\alpha .\equiv .\alpha P_{\text{cl}}\Lambda$

*170·38. $\vdash :\dot{\exists} !P.\supset .BʻP_{\text{cl}}=CʻP.Bʻ\text{Cnv}ʻP_{\text{cl}}=\Lambda$

*170·6. $\vdash :\Lambda P_{\text{lc}}\beta .\equiv .\beta \subset CʻP.\exists !\beta$

*170·36. $\vdash .\text{D}ʻP_{\text{cl}}=\text{Cl ex}ʻCʻP.\text{ᗡ}ʻP_{\text{cl}}=\text{Cl}ʻCʻP-\iota ʻCʻP$

*170.44. $\vdash :P\,\text{smor}\,Q.\supset .\text{D}.P_{\text{cl}}\text{smor}Q_{\text{cl}}$

*170·64. $\vdash :x{\sim}\in CʻP.\supset .(x\unicode{x21f7}P)_{\text{cl}}=(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}}$

This proposition shows that every term added to $P$ doubles the number of terms in $P_{\text{cl}}$ ; hence it is not surprising that $P_{\text{cl}}$ (when $P$ is well-ordered) has a power of $2_{r}$ for its relation-number (cf. *177).

*170.67. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}=s^{;}C^{;}(P_{\text{cl}}\times Q_{\text{cl}})$

*170·69. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}\text{smor}(P_{\text{cl}}xQ_{\text{cl}})$

*170·01. $P_{\text{cl}}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha )\} \quad\text{Df}$

*170·1. $\vdash :\alpha P_{\text{cl}}\beta .\equiv .a,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha ) \quad[(*170·01)]$

*170·101. $\vdash .P_{\text{lc}}=\text{Cnv}ʻ(\breve{P} )_{\text{cl}} \quad[(*170·02)]$

*170·102. $\vdash :\alpha P_{\text{lc}}\beta .\equiv .a,\beta \in \text{Cl}ʻCʻP.\exists !\beta -\alpha -Pʻʻ(\alpha -\beta ) \quad[*170·1·101]$

Thus $\alpha P_{\text{lc}}\beta$ means, roughly speaking, that $\beta -\alpha$ goes on longer than $\alpha -\beta$ , just as $\alpha P_{\text{cl}}\beta$ means that $\alpha -\beta$ begins sooner. Thus if $P$ is the relation of earlier and later in time, and $\alpha$ and $\beta$ are the times when $A$ and $B$ respectively are out of bed, " $\alpha P_{\text{cl}}\beta$ " will mean that $A$ gets up earlier than $B$ , and " $\alpha P_{\text{lc}}\beta$ " will mean that $B$ goes to bed later than $A$ .

*170·103. $\vdash :y{\sim}\in \breve{P} ʻʻ(\beta-\alpha ).\equiv .\overrightarrow{P}ʻy\cap \beta \subset \alpha$

Dem. $\begin{array}{l} \vdash .*37·105.\supset \vdash \colon\ldotp y{\sim}\in \breve{P} ʻʻ(\beta -\alpha ).&\equiv :{\sim}(\exists x).x\in \beta -\alpha .xPy:\\ [*10·51] &\equiv:x\in \beta .xPy.\supset _{x}.x\in \alpha :\\ [*32·18] &\equiv:\overrightarrow{P}ʻy\cap \beta \subset \alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*170·11. $\begin{align}&\vdash \colon\ldotp \alpha P_{\text{cl}}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists y).y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha \\ &[*170·1·103]\end{align}$

*170·12. $\begin{align}&\vdash :\alpha P_{\text{cl}}\beta .\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -(\alpha \cap \beta )-\breve{P} ʻʻ\{\beta -(\alpha \cap \beta )\}\\ &[*170·1.*22·93]\end{align}$

*170*121. $\begin{align}&\vdash \colon\ldotp \alpha P_{\text{cl}}\beta .\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !(\alpha \cup \beta )-\beta -\breve{P} ʻʻ\{(\alpha \cup \beta )-\alpha\}\\ &[*170·1.*22·9]\end{align}$

*170*13. $\begin{align}&\vdash \colon\ldotp \alpha P_{\text{cl}}\beta .\equiv :(\exists \rho ,\sigma ,\gamma ).\rho ,\sigma ,\gamma \in \text{Cl}ʻCʻP.\\ &\rho \cap \gamma =\Lambda .\sigma \cap \gamma =\Lambda .\rho \cap \sigma =\Lambda .\alpha =\gamma \cup \rho .\beta =\gamma \cup \sigma .\exists !\rho -\breve{P} ʻʻ\sigma\end{align}$

Dem. $\begin{array}{l} \vdash .*24·24.*22·69 &\supset \vdash :\rho \cap \sigma =\Lambda .\alpha =\gamma \cup \rho .\beta =\gamma \cup \sigma .\supset .\alpha \cap \beta =\gamma &\qquad \text{(1)}\\ \vdash .*24·4. &\supset \vdash \colon\ldotp \alpha =\gamma \cup \rho .\supset :\rho \cap \gamma =\Lambda .\equiv .\alpha -\gamma =\rho &\qquad \text{(2)}\\ \vdash .*24·4. &\supset \vdash \colon\ldotp \beta =\gamma \cup \sigma .\supset :\sigma \cap \gamma =\Lambda .\equiv .\beta -\gamma =\sigma &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash \colon\ldotp \rho \cap \sigma =\Lambda .\alpha =\gamma \cup \rho .\beta =\gamma \cup \sigma .\supset :\\ \rho \cap \gamma =\Lambda .\sigma \cap \gamma =\Lambda .&\equiv .\alpha -(\alpha \cap \beta )=\rho .\beta -(\alpha \cap \beta )=\sigma .\\ [*22·93] &\equiv .\alpha -\beta =\rho .\beta -\alpha =\sigma &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash :&(\exists \rho ,\sigma ,\gamma ).\rho ,\sigma ,\gamma \in \text{Cl}ʻCʻP.\rho \cap \gamma =\Lambda .\sigma \cap \gamma =\Lambda .\rho \cap \sigma =\Lambda .\\ &\alpha =\gamma \cup \rho .\beta =\gamma \cup \sigma .\exists !\rho -\breve{P} ʻʻ\sigma .\equiv .\\ &(\exists \rho ,\sigma ,\gamma ).\rho ,\sigma ,\gamma \in \text{Cl}ʻCʻP.\rho \cap \sigma =\Lambda .\alpha =\gamma \cup \rho .\beta =\gamma \cup \sigma .\\ &\alpha \cap \beta =\gamma .\alpha -\beta =\rho .\beta -\alpha =\sigma .\exists !\rho -\breve{P} ʻʻ\sigma .\\ [*13·22] &\equiv .\alpha -\beta ,\beta -\alpha ,\alpha \cap \beta \,\unicode{x2abd}\, \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha ).\\ [*60·43.*24·41] &\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha ).\\ [*170·1] &\equiv .\alpha P_{\text{cl}}\beta :\supset \vdash .\text{Prop} \end{array}$

*170·14. $\begin{align}&\vdash \colon\ldotp \alpha ,\beta \in \text{Cl}ʻCʻP.\supset :\alpha \dot{-} P_{\text{cl}}\beta .\equiv .\alpha -\beta \subset \breve{P} ʻʻ(\beta -\alpha )\\ &[*170·1.*24·55]\end{align}$

*170·141. $\begin{align}&\vdash \colon\ldotp \alpha ,\beta \in \text{Cl}ʻCʻP.\supset :\alpha \dot{-} P_{\text{lc}}\beta .\equiv .\beta -\alpha \subset Pʻʻ(\alpha - \beta )\\ &[*170·14·101]\end{align}$

*170·15. $\vdash :\alpha P_{\text{cl}}\beta .\supset .\beta \cap pʻ\overrightarrow{P}ʻʻ(\alpha -\beta )\subset \alpha$

Dem. $\begin{array}{l} \vdash .*40·12.&\supset \vdash :y\in \alpha -\beta .\supset .pʻ\overrightarrow{P}ʻʻ(\alpha -\beta )\subset \overrightarrow{P}ʻy.\\ [*22·48] &\supset .\beta \cap pʻ\overrightarrow{P}ʻʻ(\alpha -\beta )\subset \beta \cap \overrightarrow{P}ʻy:\\ [*22·44] &\supset \vdash :y\in \alpha -\beta .\beta \cap \overrightarrow{P}ʻy\subset \alpha .\supset .\beta \cap pʻ\overrightarrow{P}ʻʻ(\alpha -\beta )\subset \alpha :\\ [*10·11·23] &\supset \vdash :(\exists y).y\in \alpha -\beta .\beta \cap \overrightarrow{P}ʻy\subset \alpha .\supset .\beta \cap pʻ\overrightarrow{P}ʻʻ(\alpha -\beta )\subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*170·11.\supset \vdash .\text{Prop} \end{array}$

*170·16. $\vdash :\alpha \subset CʻP.\beta \subset \alpha .\beta \neq \alpha .\supset .\alpha P_{\text{cl}}\beta$

Dem. $\begin{array}{l} \vdash .*24·6.\supset \vdash :\text{Hp}.&\supset .\exists !\alpha -\beta &\qquad \text{(1)}\\ \vdash .*24·3.&\supset \vdash :\text{Hp}.\supset .\beta -\alpha =\Lambda .\\ [*37·29] &\supset .\breve{P} ʻʻ(\beta -\alpha )=\Lambda .\\ [*24·101·26] &\supset .\alpha -\beta -\breve{P} ʻʻ(\beta -\alpha )=\alpha -\beta &\qquad \text{(2)}\\ \vdash .(1).(2).*170·1.\supset \vdash .\text{Prop} \end{array}$

*170·161. $\vdash :\alpha \subset CʻP.\beta \subset \alpha .\beta \neq \alpha .\supset .\beta P_{\text{lc}}\alpha$

Dem. $\begin{array}{l} \vdash .*170·16.\supset \vdash :\text{Hp}.&\supset .\alpha (\breve{P} )_{\text{cl}}\beta .\\ [*170·101] &\supset .\beta P_{\text{lc}}\alpha :\supset \vdash .\text{Prop} \end{array}$

*170·17. $\vdash .P_{\text{cl}}\,\unicode{x2abd}\, J.P_{\text{lc}}\,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*170·1.\supset \vdash :\alpha P_{\text{cl}}\beta .&\supset .\exists !\alpha -\beta .\\ [*24·55.*22·42] &\supset .\alpha \neq \beta .\\ [*50·11] &\supset .\alpha J\beta :\supset \vdash .\text{Prop} \end{array}$

In order that $P_{\text{cl}}$ should be serial, we need further that it should be transitive and connected. $P_{\text{cl}}$ is transitive if $P$ is transitive and connected. But $P_{\text{cl}}$ may still not be connected: there may be many distinct families in its field, though all of them must begin with $CʻP$ and end with $\Lambda$ . For example, if $P$ is a regression, the class which takes every odd member does not have either of the relations $P_{\text{cl}}$ , $\breve{P} _{\text{cl}}$ to the class which takes every even member. In order that $P_{\text{cl}}$ should be serial, we require that $P$ should be not only serial, but well-ordered, i.e. that every existent sub-class of $CʻP$ should have a first term. When $P$ is serial but not well-ordered, $P_{\text{cl}}$ will, however, generate various series contained in it by imposing suitable limitations on the field.

*170·2. $\begin{align}&\vdash \colon\ldotp \alpha ,\beta \in \text{Cl}ʻCʻP:(\exists y). y\in \alpha -\beta . \overrightarrow{P}ʻy\cap \alpha = \overrightarrow{P}ʻy\cap \beta :\supset .\alpha P_{\text{cl}}\beta \\ &[*170·11 .*22·43]\end{align}$

*170·21. $\vdash \colon\ldotp \alpha \subset CʻP.\supset : y \,\text{min}_{P}(\alpha -\beta ).\equiv . y\in \alpha -\beta . \overrightarrow{P}ʻy\cap \alpha \subset \beta$

Dem. $\begin{array}{l} \vdash . *93·11. \supset \vdash \colon\ldotp \text{Hp}.\supset : y \,\text{min}_{P}(\alpha -\beta ).&\equiv . y\in \alpha -\beta -\breve{P} ʻʻ(\alpha -\beta ).\\ [*170·103] &\equiv .y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \alpha \subset \beta \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*170·22. $\vdash \colon\ldotp \alpha \subset CʻP. y \text{min}_{P} (\alpha -\beta ).\supset : \overrightarrow{P}ʻy\cap \beta \subset \alpha .\equiv . \overrightarrow{P}ʻy\cap \alpha = \overrightarrow{P}ʻy\cap \beta$

Dem. $\begin{array}{l} \vdash . *170·21. *4·73.\supset \vdash \colon\ldotp \text{Hp}.\supset : \overrightarrow{P}ʻy\cap \beta \subset \alpha .&\equiv . \overrightarrow{P}ʻy\cap \alpha \subset \beta . \overrightarrow{P}ʻy\cap \beta \subset \alpha .\\ [*22·74] &\equiv . \overrightarrow{P}ʻy\cap \alpha = \overrightarrow{P}ʻy\cap \beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*170·23. $\begin{align}\vdash \colon\ldotp \alpha \subset CʻP. y\in \alpha -\beta -\breve{P} ʻʻ&(\beta -\alpha ).\supset :\\ y \,\text{min}_{P} (\alpha-\beta ) .\equiv . \overrightarrow{P}ʻy\cap \alpha =\overrightarrow{P}ʻy\cap \beta \end{align}$

Dem. $\begin{array}{l} \vdash .*170·103·21. \supset \vdash \colon\ldotp \text{Hp}\supset :\\ y\,\text{min}_{P} (\alpha -\beta ) .&\equiv . y\in \alpha - \beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha .\overrightarrow{P}ʻy\cap \alpha \subset \beta .\\ [*22·74.*4·73] &\equiv . y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha .\overrightarrow{P}ʻy\cap \alpha =\overrightarrow{P}ʻy\cap \beta .\\ [*170·103] &\equiv . y\in \alpha -\beta -\breve{P} ʻʻ(\beta -\alpha ).\overrightarrow{P}ʻy\cap \alpha = \overrightarrow{P}ʻy\cap \beta &\qquad \text{(1)}\\ \vdash .(1).*5·32.\supset \vdash .\text{Prop} \end{array}$

*170·3. $\vdash :\alpha \in \text{Cl}ʻCʻP.\beta \subset \alpha .\exists !\alpha -\beta .\supset .\alpha P_{\text{cl}}\beta \quad[*170·16]$

*170·31. $\vdash :\beta \subset CʻP.\beta \neq CʻP .\equiv . (CʻP) P_{\text{cl}}\beta \quad[*170·16]$

*170·32. $\vdash :\alpha \subset CʻP.\exists ! \alpha .\equiv . \alpha P_{\text{cl}}\Lambda \quad[*170·3]$

Dem. $\begin{array}{l} \vdash .*33·24. *170·32. &\supset \vdash : \dot{\exists} !P.\supset .(CʻP)P_{\text{cl}}\Lambda &\qquad \text{(1)}\\ \vdash .*170·1. &\supset \vdash : (CʻP)P_{\text{cl}}\Lambda .\supset .\exists !(CʻP)-\Lambda .\\ [*33·24] &\supset .\dot{\exists} !P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*170·33 .\supset \vdash :\dot{\exists} !P.&\supset .\dot{\exists} !P_{\text{cl}} &\qquad \text{(1)}\\ \vdash .*170·1. \supset \vdash :\dot{\exists} !P_{\text{cl}}.&\supset .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta .\\ [*24·561] &\supset .(\exists \alpha ).\alpha \in \text{Cl}ʻCʻP.\exists !\alpha .\\ [*60·361] &\supset .\exists !CʻP.\\ [*33·24] &\supset .\dot{\exists} !P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*170·35. $\vdash .\dot{\Lambda} _{\text{cl}}=\dot{\Lambda} \quad[*170·34. \text{Transp}]$

*170·36. $\vdash .\text{D}ʻP_{\text{cl}}=\text{Cl ex}ʻCʻP.\text{ᗡ}ʻP_{\text{cl}}=\text{Cl}ʻCʻP-\iota ʻCʻP$

Dem. $\begin{array}{l} \vdash .*170·32. &\supset \vdash .\text{Cl ex}ʻCʻP\subset \text{D}ʻP_{\text{cl}} &\qquad \text{(1)}\\ \vdash .*170·31. &\supset \vdash .\text{Cl}ʻCʻP-\iota ʻCʻP\subset \text{ᗡ}ʻP_{\text{cl}} &\qquad \text{(2)}\\ \vdash .*170·1. \supset \vdash :\alpha \in \text{D}ʻP_{\text{cl}}.&\supset .(\exists \beta ).\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\alpha -\beta .\\ [*24·561] &\supset . \alpha \in \text{Cl}ʻCʻP.\exists !\alpha &\qquad \text{(3)}\\ \vdash .*170·1. \supset \vdash :\alpha \in \text{ᗡ}ʻP_{\text{cl}}.&\supset .(\exists \beta ).\alpha ,\beta \in \text{Cl}ʻCʻP.\exists !\beta -\alpha .\\ [*60·2] &\supset .\alpha \in \text{Cl}ʻCʻP.\exists !CʻP-\alpha .\\ [*24·6] &\supset .\alpha \in \text{Cl}ʻCʻP-\iota ʻCʻP &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*170·37. $\vdash :\dot{\exists} !P.\supset .CʻP_{\text{cl}}=\text{Cl}ʻCʻP \quad[*170·36]$

*170·371. $\vdash .CʻP_{\text{cl}}\subset \text{Cl}ʻCʻP \quad[*170·37·35.*33·241]$

*170·38. $\vdash :\dot{\exists} !P.\supset .BʻP_{\text{cl}}=CʻP.Bʻ\text{Cnv}ʻP_{\text{cl}}=\Lambda \quad[*170·36]$

*170·4. $\vdash :S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.\supset .(S^{;}Q)_{\text{cl}}=S_{\in }^{;}Q_{\text{cl}}$

Dem. $\begin{array}{l} \vdash .*170·1.*150·4.*37·11. &\supset \vdash :\alpha (S_{\in }^{;}Q_{\text{cl}})\beta .\equiv .\\ &(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻCʻQ.\alpha =Sʻʻ\gamma .\beta =Sʻʻ\delta .\exists !\gamma -\delta -\breve{Q} ʻʻ(\delta -\gamma ) &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &\alpha (S_{\in }^{;}Q_{\text{cl}})\beta .\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻ\text{ᗡ}ʻS.\alpha =Sʻʻy.\beta =Sʻʻ\delta .\\ &\exists !\gamma -\delta -\breve{Q} ʻʻ(\delta -\gamma ).\\ [*37·43] &\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻ\text{ᗡ}ʻS.\alpha =Sʻʻ\gamma .\beta =Sʻʻ\delta .\\ &\exists !Sʻʻ\{\gamma -\delta -\breve{Q} ʻʻ(\delta -\gamma )\}.\\ [*71·381] &\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻ\text{ᗡ}ʻS.\alpha =Sʻʻ\gamma .\beta =Sʻʻ\delta .\\ &\exists !Sʻʻ\gamma -Sʻʻ\delta -Sʻʻ\breve{Q} ʻʻ(\delta -\gamma ).\\ [*72·511.*71·38] &\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻ\text{ᗡ}ʻS.\alpha =Sʻʻ\gamma .\beta =Sʻʻ\delta .\\ &\exists !Sʻʻ\gamma -Sʻʻ\delta -Sʻʻ\breve{Q} ʻʻ\breve{S} ʻʻ(\beta -\alpha ).\\ [*13·193.*37·33] &\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{Cl}ʻ\text{ᗡ}ʻS.\alpha =Sʻʻ\gamma .\beta =Sʻʻ\delta .\\ &\exists !\alpha -\beta -(S^{;}\breve{Q} )ʻʻ(\beta -\alpha ).\\ [*71·48.*37·23] &\equiv .\alpha ,\beta \in \text{Cl}ʻ\text{D}ʻS.\exists !\alpha -\beta -(S^{;}\breve{Q} )ʻʻ(\beta -\alpha ).\\ [*150·23] &\equiv .\alpha ,\beta \in \text{Cl}ʻCʻ(S^{;}Q).\exists !\alpha -\beta -(S^{;}\breve{Q} )ʻʻ(\beta -\alpha ).\\ [*150·12.*17·01] &\equiv .\alpha (S^{;}Q)_{\text{cl}}\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*170·41. $\vdash .(S\upharpoonright CʻQ)_{\in }^{;}Q_{\text{cl}}=S_{\in }^{;}Q_{\text{cl}} \quad[*150·95.*170·371]$

*170·42. $\vdash :S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.\supset .(S^{;}Q)_{\text{cl}}=S_{\in }^{;}Q_{\text{cl}}$

Dem. $\begin{array}{l} \vdash .*150·32. &\supset \vdash .(S^{;}Q)_{\text{cl}}= {(S\upharpoonright CʻQ)^{;}Q}_{\text{cl}} &\qquad \text{(1)}\\ \vdash .(1).*170·4. \supset \vdash :\text{Hp} .\supset .(S^{;}Q)_{\text{cl}}&=(S\upharpoonright CʻQ)_{\in }^{;}Q_{\text{cl}}\\ [*170·41] &=S_{\in }^{;}Q_{\text{cl}}:\supset \vdash .\text{Prop} \end{array}$

*170·43. $\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .S_{\in }\upharpoonright CʻQ_{\text{cl}}\in P_{\text{cl}}\,\overline{\text{smor}}\, Q_{\text{cl}}$

Dem. $\begin{array}{l} \vdash .*151·22.*170·42. &\supset \vdash :\text{Hp}.\supset .P_{\text{cl}}=S_{\in }^{;}Q_{\text{cl}} &\qquad \text{(1)}\\ \vdash .*74·131.*170·371. &\supset \vdash :\text{Hp}.\supset .S_{\in }\upharpoonright CʻQ_{\text{cl}}\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*37·231. &\supset \vdash .CʻQ_{\text{cl}}\subset \text{ᗡ}ʻS_{\in } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·22.\supset \vdash .\text{Prop} \end{array}$

*170·44. $\vdash : P\,\text{smor}\,Q.\supset .P_{\text{cl}}\,\text{smor}\,Q_{\text{cl}} \quad[*170·43.*151·23·12]$

Dem. $\begin{array}{l} \vdash .*170·36.*55·15.\supset \vdash .\text{D}ʻ(x\downarrow x)_{\text{cl}}&=\text{Cl ex}ʻ\iota ʻx\\ [*60·37] &=\iota ʻ\iota ʻx &\qquad \text{(1)}\\ \vdash .*170·36.*55·15. \supset \vdash .\text{ᗡ}ʻ(x\downarrow x)_{\text{cl}}&=\text{Cl}ʻ\iota ʻx-\iota ʻ\iota ʻx\\ [*60·362] &=\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*55·16.\supset \vdash . \text{Prop} \end{array}$

*170·51. $\begin{align}\vdash :x\neq y.\supset .(x\downarrow y)_{\text{cl}}=(\iota ʻx\cup \iota ʻy)&\downarrow \iota ʻx\unicode{x228d} (\iota ʻx\cup \iota ʻy)\downarrow \iota ʻy\unicode{x228d} (\iota ʻx\cup \iota ʻy)\downarrow \Lambda \\ &\unicode{x228d} \iota ʻx\downarrow \iota ʻy\unicode{x228d} \iota ʻx\downarrow \Lambda \unicode{x228d} \iota ʻy\downarrow \Lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*55·13. \supset \vdash :\text{Hp}.&\supset .\overrightarrow{x\downarrow y}ʻx=\Lambda .\overrightarrow{x\downarrow y}ʻy=\iota ʻx &\qquad \text{(1)}\\ \vdash .*170·11.*55·15. &\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha (x\downarrow y)_{\text{cl}}\beta .\equiv :\\ &\alpha ,\beta \in \text{Cl}ʻ(\iota ʻx\cup \iota ʻy):(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \beta \subset \alpha \\ [*60·39] &\equiv :\alpha =\iota ʻx\cup \iota ʻy.\lor.\alpha =\iota ʻx.\lor.\alpha =\iota ʻy:\beta \subset \iota ʻx\cup \iota ʻy :\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \beta \subset \alpha &\qquad \text{(2)}\\ \vdash .*51·235. &\supset \vdash \colon\colon \alpha =\iota ʻx\cup \iota ʻy.\supset \colon\ldotp (\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \beta \subset \alpha .\equiv :\\ &x\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻx\cap \beta \subset \alpha .\lor.y\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻy\cap \beta \subset \alpha :\\ [(1)] &\equiv :x\in \alpha -\beta .\lor.y\in \alpha -\beta .\iota ʻx\cap \beta \subset \alpha :\\ [\text{Hp}.*22·43·58] &\equiv :x\in \alpha -\beta .\lor.y\in \alpha -\beta :\\ [*51·232.*4·73] &\equiv :x{\sim}\in \beta .\lor.y{\sim}\in \beta &\qquad \text{(3)}\\ \vdash .*54·4.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \beta \subset \iota ʻx\cup \iota ʻy.x{\sim}\in \beta .\equiv :\beta =\iota ʻy.\lor.\beta =\Lambda &\qquad \text{(4)}\\ \vdash .*54·4.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \beta \subset \iota ʻx\cup \iota ʻy.y{\sim}\in \beta .\equiv :\beta =\iota ʻx.\lor.\beta =\Lambda &\qquad \text{(5)}\\ \vdash .(2).(3).(4).(5).\supset \\ \vdash \colon\colon \alpha =\iota ʻx\cup \iota ʻy.&\supset \colon\ldotp \alpha (x\downarrow y)_{\text{cl}}\beta .\equiv :\beta =\iota ʻx.\lor.\beta =\iota ʻy.\lor.\beta =\Lambda &\qquad \text{(6)}\\ \vdash .(1).(2).&\supset \vdash \colon\colon .\text{Hp}.\supset \colon\colon \alpha =\iota ʻx.\supset \colon\ldotp \alpha (x\downarrow y)_{\text{cl}}\beta .\equiv :\beta \subset \iota ʻx\cup \iota ʻy.x{\sim}e\beta .\\ [(4)] &\equiv :\beta =\iota ʻy.\lor.\beta =\Lambda &\qquad \text{(7)}\\ \vdash .(1).(2).&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha =\iota ʻy.\supset :\alpha (x\downarrow y)_{\text{cl}}\beta .\equiv .\\ &\beta \subset \iota ʻx\cup \iota ʻy.y{\sim}\in \beta .\iota ʻx\cap \beta \subset \alpha .\\ [*51·211] &\equiv .\beta \subset \iota ʻx\cup \iota ʻy.y{\sim}\in \beta .x{\sim}\in \beta .\\ [*54·4] &\equiv .\beta =\Lambda &\qquad \text{(8)}\\ \vdash .(2).(6).(7).(8).\supset \vdash .\text{Prop} \end{array}$

*170·52. $\vdash :x\neq y.\supset .(x\downarrow y)_{\text{cl}}=(\iota ʻx\cup \iota ʻy)\downarrow \iota ʻx\unicode{x2909}\iota ʻy\downarrow \Lambda$

Dem. $\begin{array}{l} \vdash .*55·15.\supset \vdash .&Cʻ{(\iota ʻx\cup \iota ʻy)\downarrow \iota ʻx}\uparrow Cʻ\{\iota ʻy\downarrow \Lambda \}=\\ &\{\iota ʻ(\iota ʻx\cup \iota ʻy)\cup \iota ʻ\iota ʻx\}\uparrow \{\iota ʻ\iota ʻy\cup \iota ʻ\Lambda\}\\ [*55·52] &=(\iota ʻx\cup \iota ʻy)\downarrow \iota ʻy\unicode{x228d} (\iota ʻx\cup \iota ʻy)\downarrow \iota ʻ\Lambda \unicode{x228d} \iota ʻx\downarrow \iota ʻy\unicode{x228d} \iota ʻx\downarrow \Lambda &\qquad \text{(1)}\\ \vdash .(1).*170·51.*160·1.\supset \vdash .\text{Prop} \end{array}$

*170·6. $\vdash :\Lambda P_{\text{lc}}\beta .\equiv .\beta \subset CʻP.\exists !\beta \quad[*170·32·101]$

*170·601. $\vdash :\alpha P_{\text{lc}}(CʻP).\equiv .\alpha \subset CʻP.\alpha \neq CʻP \quad[*170·31·101]$

*170·61. $\begin{align}\vdash \colon\ldotp x{\sim}&\in CʻP.\dot{\exists} !P.x\in \alpha \cap \beta .\supset :\\ &\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv .\alpha \{(\iota ʻx\cup )^{;}P_{\text{cl}}\}\beta .\equiv .(\alpha -\iota ʻx)P_{\text{cl}}(\beta -\iota ʻx)\end{align}$

This and the following propositions are lemmas for $x{\sim}\in CʻP.\supset .(x\unicode{x21f7}P)_{\text{cl}}=(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}} \quad(*170·64).$

Dem. $\begin{array}{l} \vdash .*161·111.\supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp y\in \beta .y(x\unicode{x21f7}P)z.\supset _{y}.y\in \alpha :\equiv :\\ &y\in \beta .yPz.\supset _{y}.y\in \alpha :y\in \beta .y=x.z\in CʻP.\supset _{y}.y\in \alpha :\\ [*13·191 . *33·17]&\equiv :y\in \beta -\iota ʻx.yPz.\supset _{y}.y\in \alpha -\iota ʻx:x\in \beta .z\in CʻP.\supset .x\in \alpha :\\ [\text{Hp}] &\equiv :y\in \beta -\iota ʻx.yPz.\supset _{y}.y\in \alpha -\iota ʻx &\qquad \text{(1)}\\ \vdash .*51·34.\supset \vdash :\text{Hp}.&\supset .-\beta =-\iota ʻx\cap -\beta .\\ [*22·481] \supset .\alpha -\beta &=\alpha -\iota ʻx-\beta \\ [*24·21] &=\alpha -\iota ʻx\cap (\iota ʻx \cup -\beta )\\ [*22·86] &=\alpha -\iota ʻx-(\beta -\iota ʻx) &\qquad \text{(2)}\\ \vdash .*170·11.*161·101·14.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv :\\ &\alpha ,\beta \in \text{Cl}ʻ(CʻP\cup \iota ʻx):(\exists z):z\in \alpha -\beta :y\in \beta .y(x\unicode{x21f7}P)z.\supset _{z}.y\in \alpha :\\ [(1).(2)] &\equiv :\alpha ,\beta \in \text{Cl}ʻ(CʻP\cup \iota ʻx):(\exists z):z\in \alpha -\iota ʻx-(\beta -\iota ʻx):y\in \beta -\iota ʻx.yPz.\supset _{y}.\\ &y\in \alpha -\iota ʻx:\\ [*24·43] &\equiv :\alpha -\iota ʻx,\beta -\iota ʻx\in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\iota ʻx-(\beta -\iota ʻx).\\ &\overrightarrow{P}ʻz\cap (\beta -\iota ʻx)\subset \alpha -\iota ʻx:\\ [*170·11] &\equiv :(\alpha -\iota ʻx)P_{\text{cl}}(\beta -\iota ʻx):\\ [*51·221] &\equiv :\alpha {(\iota ʻx\cup )^{;}P_{\text{cl}}}\beta \colon\colon \supset \vdash .\text{Prop} \end{array}$

*170·62. $\begin{align}\vdash \colon\ldotp x{\sim}\in CʻP.\dot{\exists} !P.x\in &\alpha -\beta .\supset :\\ &\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv .\alpha \subset \iota ʻx\cup CʻP.\beta \subset CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*161·13. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x{\sim}\in \text{ᗡ}ʻ(x\unicode{x21f7}P):\\ [*10·53] &\supset :y\in \beta .y(x\unicode{x21f7}P)x.\supset _{y}.y\in \alpha :\\ [\text{Hp}] &\supset :x\in \alpha -\beta :y\in \beta .y(x\unicode{x21f7}P)x.\supset _y.y\in \alpha :\\ [*170·11] &\supset :\alpha ,\beta \in \text{Cl}ʻCʻ(x\unicode{x21f7}P).\supset .\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta :\\ [*161·14.\text{Hp}.*24·49] &\supset :\alpha \subset \iota ʻx\cup CʻP.\beta \subset CʻP.\supset .\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta &\qquad \text{(1)}\\ \vdash .*170·11.*161·14.\supset\\ \vdash \colon\ldotp \text{Hp}. \supset :\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .&\supset .\alpha ,\beta \in \text{Cl}ʻ(\iota ʻx\cup CʻP).\\ [*24·49.\text{Hp}] &\supset .\alpha \subset \iota ʻx\cup CʻP.\beta \subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*170·63. $\vdash \colon\ldotp x{\sim}\in (\alpha \cup \beta ).\supset :\alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv .\alpha P_{\text{cl}}\beta$

Dem. $\begin{array}{l} \vdash .*24·49.*161·14. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha ,\beta \in \text{Cl}ʻCʻ(x\unicode{x21f7}P).\equiv .\alpha ,\beta \in \text{Cl}ʻCʻP &\qquad \text{(1)}\\ \vdash .*13·14. &\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp y\in \beta .\supset :y\neq x:\\ [*161·111] &\supset :y(x\unicode{x21f7}P)z .\equiv .yPz &\qquad \text{(2)}\\ \vdash .*170·11. &\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv :\\ &\alpha ,\beta \in \text{Cl}ʻ(x\unicode{x21f7}P):(\exists z):z\in \alpha -\beta :y\in \beta .y(x\unicode{x21f7}P)z.\supset _{y}.y\in \alpha :\\ [(1).(2)] &\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z):z\in \alpha -\beta :y\in \beta .yPz.\supset _{y}.y\in \alpha :\\ [*170·11] &\equiv :\alpha P_{\text{cl}}\beta \colon\colon \supset \vdash .\text{Prop} \end{array}$

*170·64. $\vdash :x{\sim}\in CʻP.\supset .(x\unicode{x21f7}P)_{\text{cl}}=(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}}$

Dem. $\begin{array}{l} \vdash .*170·61·62·63·37.\supset \\ \vdash \colon\colon \text{Hp}.&\dot{\exists} !P.\supset \colon\ldotp \alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .\equiv :\\ &x\in \alpha \cap \beta .\alpha {(\iota ʻx\cup )^{;}P_{\text{cl}}}\beta .\lor.x\in \alpha -\beta .\alpha \in Cʻ(\iota ʻx\cup )^{;}P_{\text{cl}}.\beta \in CʻP_{\text{cl}}.\lor.\\ &x{\sim}\in (\alpha \cup \beta ).\alpha P_{\text{cl}}\beta &\qquad \text{(1)}\\ \vdash .*150·4. &\supset \vdash :\alpha {(\iota ʻx\cup )^{;}P}\beta .\supset .x\in \alpha \cap \beta &\qquad \text{(2)}\\ \vdash .*150·22.*170·37. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in Cʻ(\iota ʻx\cup )^{;}P_{\text{cl}}.\beta \in CʻP_{\text{cl}}.\supset .x\in \alpha -\beta &\qquad \text{(3)}\\ \vdash .*170·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha P_{\text{cl}}\beta .\supset .x{\sim}\in (\alpha \cap \beta ) &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4). &\supset \vdash \colon\colon \text{Hp}.\dot{\exists} !P.\supset \colon\ldotp\\ \alpha (x\unicode{x21f7}P)_{\text{cl}}\beta .&\equiv :\alpha {(\iota ʻx\cup )^{;}P_{\text{cl}}}\beta .\lor.\alpha \in Cʻ(\iota ʻx\cup )^{;}P_{\text{cl}}.\beta \in CʻP_{\text{cl}}.\lor.\alpha P_{\text{cl}}\beta :\\ [*160·11] &\equiv :\alpha {(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}}}\beta &\qquad \text{(5)}\\ \vdash .*161·201.&\supset \vdash :P=\dot{\Lambda} .\supset .x\unicode{x21f7}P=\dot{\Lambda} .\\ [*170·35] &\supset .(x\unicode{x21f7}P)_{\text{cl}}=\dot{\Lambda} &\qquad \text{(6)}\\ \vdash .*150·42.*160·22.*170·35. &\supset \vdash :P=\dot{\Lambda} .\supset .(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}}=\dot{\Lambda} &\qquad \text{(7)}\\ \vdash .(6).(7). &\supset \vdash :P=\dot{\Lambda} .\supset .(x\unicode{x21f7}P)_{\text{cl}}=(\iota ʻx\cup )^{;}P_{\text{cl}}\unicode{x2909}P_{\text{cl}} &\qquad \text{(8)}\\ \vdash .(5).(8).&\supset \vdash .\text{Prop} \end{array}$

The following propositions are lemmas for *170·67, i.e. $\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}=s^{;}C^{;}(P_{\text{cl}}\times Q_{\text{cl}}),$ which itself leads to *170·69, i.e. $\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}\text{smor}(P_{\text{cl}} \times Q_{\text{cl}}).$

*170·65. $\begin{align}&\vdash \colon\ldotp \rho (P\unicode{x2909}Q)_{\text{cl}}\sigma .\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ):\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\\ &\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta :(\exists y).y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma \end{align}$

Dem. $\begin{array}{l} \vdash .*13·193.&\supset \vdash \colon\ldotp (\exists \alpha ,\beta ,\gamma ,\delta ):\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta :\\ &(\exists y).y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma :\\ &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ):\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta :\\ &(\exists y).y\in \rho -\sigma .\overrightarrow{P\unicode{x2909}Q} ʻy\cap \sigma \subset \rho :\\ [*60·45] &\equiv :\rho ,\sigma \in \text{Cl}ʻ(CʻP\cup CʻQ):(\exists y).y\in \rho -\sigma .\overrightarrow{P\unicode{x2909}Q} ʻy\cap \sigma \subset \rho :\\ [*160·14] &\equiv :\rho ,\sigma \in \text{Cl}ʻCʻ(P\unicode{x2909}Q):(\exists y).y\in \rho -\sigma .\overrightarrow{P\unicode{x2909}Q} ʻy\cap \sigma \subset \rho :\\ [*170·11] &\equiv :\rho (P\unicode{x2909}Q)_{\text{cl}}\sigma \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*170·651. $\begin{align}&\vdash \colon\ldotp CʻP\cap CʻQ=\Lambda .\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.y\in \alpha .\supset :\\ &y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma .\equiv .y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*24·402·313.&\supset \vdash :\text{Hp}.\supset .(\alpha \cup \gamma )-(\beta \cup \delta )=(\alpha -\beta )\cup (\gamma -\delta ) &\qquad \text{(1)}\\ \vdash .*160·11. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P\unicode{x2909}Q} ʻy=\overrightarrow{P}ʻy &\qquad \text{(2)}\\ \vdash .*24·402. &\supset \vdash \colon\ldotp \text{Hp}.\supset :y{\sim}\in \gamma :\\ [(1)] &\supset :y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\equiv .y\in \alpha -\beta &\qquad \text{(3)}\\ \vdash .*33·15·161. &\supset \vdash .\overrightarrow{P}ʻy\subset CʻP.\\ [*24·402] &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻy\cap \delta =\Lambda .\\ [(2)] &\supset .\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )=\overrightarrow{P}ʻy\cap \beta . &\qquad \text{(4)}\\ [*24·402] &\supset .\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\cap \gamma =\Lambda &\qquad \text{(5)}\\ \vdash .(4).(5).*24·49.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma .\equiv .\\ &\overrightarrow{P}ʻy\cap \beta \subset \alpha &\qquad \text{(6)}\\ \vdash .(3).(6).\supset \vdash .\text{Prop} \end{array}$

*170·652. $\begin{align}\vdash \colon\ldotp CʻP\cap &CʻQ=\Lambda .\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.y\in \gamma .\supset :\\ &y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma .\equiv .\\ &\beta \subset \alpha .y\in \gamma -\delta .\overrightarrow{Q}ʻy\cap \delta \subset \gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*24·402·313.&\supset \vdash :\text{Hp}.\supset .(\alpha \cup \gamma )-(\beta \cup \delta )=(\alpha -\beta )\cup (\gamma -\delta ) &\qquad \text{(1)}\\ \vdash .*24·402. &\supset \vdash :\text{Hp}.\supset .y{\sim}\in \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in (\alpha \cup y)-(\beta \cup \delta ).\equiv .y\in \gamma -\delta &\qquad \text{(3)}\\ \vdash .*160·11.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P\unicode{x2909}Q} ʻy=CʻP\cup \overrightarrow{Q}ʻy.\\ [*22·621.*24·402] &\supset .\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )=\beta \cup (\overrightarrow{Q}ʻy\cap \delta ) &\qquad \text{(4)}\\ \vdash .*24·49. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta \subset \alpha \cup \gamma .\equiv .\beta \subset \alpha :\\ &\overrightarrow{Q}ʻy\cap \delta \subset \alpha \cup \gamma .\equiv .\overrightarrow{Q}ʻy\cap \delta \subset \gamma &\qquad \text{(5)}\\ \vdash .(4).(5).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma .\equiv .\beta \subset \alpha .\overrightarrow{Q}ʻy\cap \delta \subset \gamma &\qquad \text{(6)}\\ \vdash .(3).(6).&\supset \vdash .\text{Prop} \end{array}$

*170·653. $\begin{align}\vdash \colon\colon CʻP\cap CʻQ&=\Lambda .\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\supset \colon\ldotp \\ &(\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\beta \cup \delta ).\equiv :\alpha P_{\text{cl}}\beta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta\end{align}$

Dem. $\begin{array}{l} \vdash .*170·11. \supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp (\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\beta \cup \delta ).\equiv :\\ &(\exists y).y\in (\alpha \cup \gamma )-(\beta \cup \delta ).\overrightarrow{P\unicode{x2909}Q} ʻy\cap (\beta \cup \delta )\subset \alpha \cup \gamma :\\ [*170·651·652]&\equiv :(\exists y).y\in \alpha -\beta .\overrightarrow{P}ʻy\cap \beta \subset \alpha :\lor:\\ &\beta \subset \alpha :(\exists y).y\in \gamma -\delta .\overrightarrow{Q}ʻy\cap \delta \subset \beta :\\ [*170·11] &\equiv :\alpha P_{\text{cl}}\beta .\lor.\beta \subset \alpha .\gamma Q_{\text{cl}}\delta :\\ [*170·16] &\equiv :\alpha P_{\text{cl}}\beta .\lor.\alpha P_{\text{cl}}\beta .\gamma Q_{\text{cl}}\delta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta :\\ [*4·44] & \equiv :\alpha P_{\text{cl}}\beta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta \colon\colon \supset \vdash .\text{Prop} \end{array}$

*170·66. $\begin{align}&\vdash \colon\ldotp \dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset :\\ &\rho (P\unicode{x2909}Q)\sigma .\equiv .(\exists \alpha ,\beta ,\gamma ,\delta ).(\gamma \downarrow \alpha )(P_{\text{cl}}\times Q_{\text{cl}})(\delta \downarrow \beta ).\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta\end{align}$

Dem. $\begin{array}{l} \vdash .*170·65·11.\supset \\ \vdash :\rho (P\unicode{x2909}Q)_{\text{cl}}\sigma .&\equiv .(\exists \alpha ,\beta ,\gamma ,\delta ).\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\\ &\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta .(\alpha \cup \gamma )(P\unicode{x2909}Q)_{\text{cl}}(\beta \cup \delta ) &\qquad \text{(1)}\\ \vdash .(1).*170·653.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \\ \rho (P\unicode{x2909}Q)_{\text{cl}}\sigma .&\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ):\alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta :\\ &\alpha P_{\text{cl}}\beta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta :\\ [*170·37] &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ):\alpha ,\beta \in CʻP_{\text{cl}}.\gamma ,\delta \in CʻQ_{\text{cl}}.\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta :\\ &\alpha P_{\text{cl}}\beta .\lor.\alpha =\beta .\gamma Q_{\text{cl}}\delta :\\ [*166·112] &\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ).(\gamma \downarrow \alpha )(P_{\text{cl}}\times Q_{\text{cl}})(\delta \downarrow \beta ).\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta \colon\colon\\ &\supset \vdash .\text{Prop} \end{array}$

*170·67. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}=s^{;}C^{;}(P_{\text{cl}}\times Q_{\text{cl}})$

Dem. $\begin{array}{l} \vdash .*170·66.*13·22.&\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \rho (P\unicode{x2909}Q)\sigma .\equiv :\\ &(\exists \alpha ,\beta ,\gamma ,\delta ,R,S).R=\gamma \downarrow \alpha .S=\delta \downarrow \beta .\rho =\alpha \cup \gamma .\sigma =\beta \cup \delta .\\ &R(P_{\text{cl}}\times Q_{\text{cl}})S:\\ [*55·15.*53·11]&\equiv :(\exists \alpha ,\beta ,\gamma ,\delta ,R,S).R=\gamma \downarrow \alpha .S=\delta \downarrow \beta .\\ &\rho =sʻCʻR.\sigma =sʻCʻS.R(P_{\text{cl}}\times Q_{\text{cl}})S:\\ [*166·111] &\equiv :(\exists R,S).\rho =sʻCʻR.\sigma =sʻCʻS.R(P_{\text{cl}}\times Q_{\text{cl}})S:\\ [*150·4] &\equiv :\rho {s^{;}C^{;}(P_{\text{cl}}\times Q_{\text{cl}})}\sigma \colon\colon \supset \vdash .\text{Prop} \end{array}$

*170·68. $\begin{align}\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP&\cap CʻQ=\Lambda .\supset .\\ &(s\mid C)\upharpoonright Cʻ(P_{\text{cl}}\times Q_{\text{cl}})\in (P\unicode{x2909}Q)_{\text{cl}}\,\overline{\text{smor}}\,(P_{\text{cl}}\times Q_{\text{cl}})\end{align}$

Dem. $\begin{array}{l} \vdash .*55·15.*53·11.\supset \\ &\vdash \colon\ldotp R=\gamma \downarrow \alpha .S=\delta \downarrow \beta .sʻCʻR=sʻCʻS.\supset .\alpha \cup \gamma =\beta \cup \delta &\qquad \text{(1)}\\ \vdash .(1).*24·48.\supset \\ \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp \alpha ,\beta \in \text{Cl}ʻCʻP.\gamma ,\delta \in \text{Cl}ʻCʻQ.R=\gamma \downarrow \alpha .S=\delta \downarrow \beta .sʻCʻR=sʻCʻS.\supset .\\ &\alpha =\beta .\gamma =\delta .\\ [*55·202] &\supset .R=S &\qquad \text{(2)}\\ &\vdash .(2).*166·12.*170·37.\supset \\ &\vdash \colon\ldotp \text{Hp}.\supset :R,S\in Cʻ(P_{\text{cl}}\times Q_{\text{cl}}).sʻCʻR=sʻCʻS.\supset .R=S &\qquad \text{(3)}\\ \vdash .(3).*151·24.*170·67.\supset \vdash .\text{Prop} \end{array}$

*170·69. $\begin{align}&\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{cl}}\,\text{smor}\,(P_{\text{cl}}\times Q_{\text{cl}})\\ &[*170·68]\end{align}$

In this number, we shall consider a more restricted form of the principle of first differences, which is applicable when there is a definite first member of one class not belonging to the other class. In this case, if $z$ is the first differing member, the part of $\alpha$ which precedes $z$ is to be the same as the part of $\beta$ which precedes $z$ . If $z$ belongs to $\alpha$ and not to $\beta$ , we put $\alpha$ before $\beta$ ; in the converse case, we put $\beta$ before $\alpha$ . In case $zPz$ , $z$ itself is not to be counted among its own predecessors; thus the predecessors of $z$ are to be $\overrightarrow{P}ʻz-\iota ʻz$ . Hence the relation in question will hold between two sub-classes ( $\alpha$ and $\beta$ ) of $CʻP$ when there is a $z$ such that $z\in \alpha -\beta .\overrightarrow{P}ʻz-\iota ʻz\cap \alpha =\overrightarrow{P}ʻz-\iota ʻz\cap \beta ,$ or, what comes to the same thing (owing to $z{\sim}\in \beta$ ), $z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \beta .$ This relation between $\alpha$ and $\beta$ we denote by " $P_{\text{df}}$ ," where " $\text{df}$ " stands for "difference."

Thus our definition is $P_{\text{df}}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \beta\} \quad\text{Df}.$

On the analogy of $P_{\text{lc}}$ , we put also $P_\text{fd}=\text{Cnv}ʻ(\breve{P} )_{\text{df}}.$

When $P$ is well-ordered, $P_{\text{df}}$ and $P_\text{fd}$ coincide respectively with $P_{\text{cl}}$ and $P_{\text{lc}}$ . Their properties are closely analogous to those of $P_{\text{cl}}$ and $P_{\text{lc}}$ . Thus e.g. the following propositions remain true when $P_{\text{df}}$ is substituted for $P_{\text{cl}}$ :

*171·2. $\begin{align}\vdash :P\,\unicode{x2abd}\, &J.\supset .\\ &P_{\text{df}}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha =\overrightarrow{P}ʻz\cap \beta\}\end{align}$

and the following formulae suggesting an inductive identification of $P_{\text{cl}}$ and $P_{\text{df}}$ in cases to which such induction is applicable:

*171·7. $\vdash :P_{\text{df}}=P_{\text{cl}}.x{\sim}\in CʻP.\supset .(x\unicode{x21f7}P)_{\text{df}}=(x\unicode{x21f7}P)_{\text{cl}}$

*171·71. $\vdash :CʻP\cap CʻQ=\Lambda .P_{\text{df}}=P_{\text{cl}}.Q_{\text{df}}=Q_{\text{cl}}.\supset .(P\unicode{x2909}Q)_{\text{df}}=(P\unicode{x2909}Q)_{\text{cl}}$

These propositions are however superseded (at a later stage) by the proof that $P_{\text{cl}}$ and $P_{\text{df}}$ coincide if $P$ is well-ordered (*251·37).

The chief property of $P_{\text{df}}$ is that its relation-number is $2_{r}$ to the power $\text{Nr}ʻP$ . This will be proved in *177 and *186·4

*171·01. $P_{\text{df}}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \beta\} \quad\text{Df}$

*171·1. $\begin{align}&\vdash \colon\ldotp \alpha P_{\text{df}}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \beta \\ &[(*171·01)]\end{align}$

*171·101. $\vdash .P_\text{fd}=\text{Cnv}ʻ(\breve{P} )_{\text{df}} \quad[(*171·02)]$

*171·102. $\begin{align}&\vdash \colon\ldotp \alpha P_\text{fd}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \beta -\alpha .\overleftarrow{P}ʻz\cap \beta -\iota ʻz=\overleftarrow{P}ʻz\cap \alpha\\ &[*171·1·101]\end{align}$

*171*11. $\begin{align}\vdash \colon\colon\ldotp \alpha P_{\text{df}}&\beta .\equiv \colon\colon \alpha ,\beta \in \text{Cl}ʻCʻP\colon\colon \\ &(\exists z)\colon\ldotp z\in \alpha -\beta \colon\ldotp yPz.y\neq z.\supset _{y}:y\in \alpha .\equiv .y\in \beta \quad [*171·1]\end{align}$

*171·12. $\begin{align}&\vdash \colon\ldotp \alpha P_{\text{df}}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻCʻP:\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \beta -\iota ʻz \quad[*171·1.*51·222]\end{align}$

*171·14. $\vdash :\alpha \subset CʻP.z\in \alpha .\supset .\alpha P_{\text{df}}(\alpha -\iota ʻz)$

Dem. $\begin{array}{l} \vdash .*51·21. \supset \vdash :\text{Hp}.&\supset .z\in \alpha -(\alpha -\iota ʻz).\\ [*13·15] &\supset .z\in \alpha -(\alpha -\iota ʻz).\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap (\alpha -\iota ʻz).\\ [*171·12] &\supset .\alpha P_{\text{df}}(\alpha -\iota ʻz):\supset \vdash .\text{Prop} \end{array}$

*171·15. $\vdash :\beta \subset CʻP.z\in CʻP-\beta .(\beta \cup \iota ʻz)P_{\text{df}}\beta$

Dem. $\begin{array}{l} \vdash .*51·16. &\supset \vdash :\text{Hp}.\supset .z\in (\beta \cup \iota ʻz)-\beta &\qquad \text{(1)}\\ \vdash .*51·211·22. \supset \vdash :\text{Hp}.&\supset .(\beta \cup \iota ʻz)-\iota ʻz=\beta .\\ [*22·481] &\supset .\overrightarrow{P}ʻz\cap (\beta \cup \iota ʻz)-\iota ʻz=\overrightarrow{P}ʻz\cap \beta &\qquad \text{(2)}\\ \vdash .(1).(2).*171·1.\supset \vdash .\text{Prop} \end{array}$

*171·16. $\vdash .\text{D}ʻP_{\text{df}}=\text{Cl ex}ʻCʻP.\text{ᗡ}ʻP_{\text{df}}=\text{Cl}ʻCʻP-\iota ʻCʻP$

Dem. $\begin{array}{l} \vdash .*171·14. &\supset \vdash :\alpha \in \text{Cl ex}ʻCʻP.\supset .\alpha \in \text{D}ʻP_{\text{df}} &\qquad \text{(1)}\\ \vdash .*171·1. &\supset \vdash :\alpha \in \text{D}ʻP_{\text{df}}.\supset .\alpha \in \text{Cl ex}ʻCʻP &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash .\text{D}ʻP_{\text{df}}=\text{Cl ex}ʻCʻP &\qquad \text{(3)}\\ \vdash .*171·15. &\supset \vdash :\beta \in \text{Cl}ʻCʻP.\exists !CʻP-\beta .\supset .\beta \in \text{ᗡ}ʻP_{\text{df}}:\\ [*24·6] &\supset \vdash :\beta \in \text{Cl}ʻCʻP-\iota ʻCʻP.\supset .\beta \in \text{ᗡ}ʻP_{\text{df}} &\qquad \text{(4)}\\ \vdash .*171·1. \supset \vdash :\beta \in \text{ᗡ}ʻP_{\text{df}}.&\supset .\beta \in \text{Cl}ʻCʻP.\exists !CʻP-\beta .\\ [*24·6] &\supset .\beta \in \text{Cl}ʻCʻP-\iota ʻCʻP &\qquad \text{(5)}\\ \vdash .(4).(5).&\supset \vdash .\text{ᗡ}ʻP_{\text{df}}=\text{Cl}ʻCʻP-\iota ʻCʻP &\qquad \text{(6)}\\ \vdash .(3).(6).&\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*171·16. &\supset \vdash :\alpha \in \text{Cl}ʻCʻP.\alpha \neq \Lambda .\supset .\alpha \in \text{D}ʻP_{\text{df}} &\qquad \text{(1)}\\ \vdash .*171·16. &\supset \vdash :\alpha \in \text{Cl}ʻCʻP.\alpha \neq CʻP.\supset .\alpha \in \text{ᗡ}ʻP_{\text{df}} &\qquad \text{(1)}\\ \vdash .(1).(2). &\supset \vdash :\alpha \in \text{Cl}ʻCʻP.{\sim}(\alpha =\Lambda .\alpha =CʻP).\supset .\alpha \in CʻP_{\text{df}}:\\ [*13·171] &\supset \vdash :\alpha \in \text{Cl}ʻCʻP.CʻP\neq \Lambda .\supset .\alpha \in CʻP_{\text{df}} &\qquad \text{(3)}\\ \vdash .(3).*33·24.\supset \vdash .\text{Prop} \end{array}$

*171·18. $\vdash :\dot{\exists} !P.\supset .BʻP_{\text{df}}=CʻP.Bʻ\text{Cnv}ʻP_{\text{df}}=\Lambda$

Dem. $\begin{array}{l} \vdash .*171·16. \supset \vdash .\overrightarrow{B}ʻP_{\text{df}}&=\text{Cl ex}ʻCʻP-(\text{Cl}ʻCʻP-\iota ʻCʻP)\\ [*24·3] &=\text{Cl ex}ʻCʻP\cap \iota ʻCʻP &\qquad \text{(1)}\\ \vdash .(1).*60·35. &\supset \vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻP_{\text{df}}=\iota ʻCʻP &\qquad \text{(2)}\\ \vdash .*171·16. \supset \vdash .\overrightarrow{B}ʻ\text{Cnv}ʻP_{\text{df}}&=\text{Cl}ʻCʻP-\iota ʻCʻP-\text{Cl ex}ʻCʻP\\ [*60·24] &=\iota ʻ\Lambda -\iota ʻCʻP &\qquad \text{(3)}\\ \vdash .(3).*33·24.&\supset \vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻ\text{Cnv}ʻP_{\text{df}}=\iota ʻ\Lambda &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*60·33.*171·16. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP_{\text{df}}=\Lambda .\\ [*33·241] &\supset .P_{\text{df}}=\dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

*171·2. $\vdash :P\,\unicode{x2abd}\, J.\supset .P_{\text{df}} =\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \alpha =\overrightarrow{P}ʻz\cap \beta\}$

Dem. $\begin{array}{l} \vdash .*50·11.*32·19. \supset \vdash :\text{Hp}.&\supset .\overrightarrow{P}ʻz\subset -\iota ʻz.\\ [*22·621] &\supset .\overrightarrow{P}ʻz\cap \alpha -\iota ʻz=\overrightarrow{P}ʻz\cap \alpha &\qquad \text{(1)}\\ \vdash .(1).*171·1.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*171·1.*22·43.\supset \\ \vdash \colon\ldotp \alpha P_{\text{df}}\beta .&\supset :\alpha ,\beta \in \text{Cl}ʻCʻP:(\exists z).z\in \alpha -\beta .\overrightarrow{P}ʻz\cap \beta \subset \alpha :\\ [*170·11] &\supset :\alpha P_{\text{cl}}\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*171·4. $\vdash :S\in 1\rightarrow 1.CʻQ=\text{ᗡ}ʻS.\supset .(S^{;}Q)_{\text{df}}=S_{\in }^{;}Q_{\text{df}} \quad[\text{Proof as in *170·4}]$

*171·41. $\vdash :(S\upharpoonright CʻQ)_{\in }^{;}Q_{\text{df}}=S_{\in }^{;}Q_{\text{df}} \quad[\text{Proof as in *170·41}]$

*171·42. $\vdash :S\upharpoonright CʻQ\in 1\rightarrow 1.CʻQ\subset \text{ᗡ}ʻS.\supset .(S^{;}Q)_{\text{df}}=S_{\in }^{;}Q_{\text{df}} \quad[*171·4·41]$

*171·43. $\begin{align}&\vdash :S\upharpoonright CʻQ\in P\,\overline{\text{smor}}\,Q.\supset .S_{\in }\upharpoonright CʻQ_{\text{df}}\in P_{\text{df}}\,\overline{\text{smor}}\, Q_{\text{df}}\\ &[\text{Proof as in *170·43}]\end{align}$

*171·44. $\vdash :P\,\text{smor}\,Q.\supset .P_{\text{df}}\text{smor}Q_{\text{df}} \quad[*171·43]$

*171·5. $\vdash .(x\downarrow x)_{\text{df}}=(\iota ʻx)\downarrow \Lambda =(x\downarrow x)_{\text{cl}}$

Dem. $\begin{array}{l} \vdash .*171·1.*55·15.\supset \\ \vdash \colon\ldotp \alpha (x\downarrow x)_{\text{df}}\beta .&\equiv :\alpha ,\beta \in \text{Cl}ʻ\iota ʻx:(\exists z).z\in \alpha -\beta.\overrightarrow{x\downarrow x} ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow x} ʻz\cap \beta :\\ [*171·16] &\equiv :\alpha \in \text{Cl ex}ʻ\iota ʻx.\beta \in \text{Cl}ʻ\iota ʻx-\iota ʻ\iota ʻx:\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow x} ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow x} ʻz\cap \beta :\\ [*60·362·37] &\equiv :\alpha =\iota ʻx.\beta =\Lambda :(\exists z).z\in \iota ʻx.\overrightarrow{x\downarrow x} ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow x} ʻz\cap \beta :\\ [*13·195] &\equiv :\alpha =\iota ʻx.\beta =\Lambda .\iota ʻx\cap \alpha -\iota ʻx=\iota ʻx\cap \beta :\\ [*24·21·23] &\equiv :\alpha =\iota ʻx.\beta =\Lambda .\Lambda =\Lambda :\\ [*13·15.*55·13] &\equiv :\alpha \{(\iota ʻx)\downarrow \Lambda\}\beta &\qquad \text{(1)}\\ \vdash .(1).*170·5.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*171·1.&\supset \vdash \colon\ldotp \alpha (x\downarrow y)_{\text{df}}\beta .\equiv :\alpha ,\beta \in \text{Cl}ʻ(\iota ʻx\cup \iota ʻy):\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow y}ʻz\cap \beta :\\ [*171·16] &\equiv :\alpha \in \text{Cl ex}ʻ(\iota ʻx\cup \iota ʻy).\beta \in \text{Cl}ʻ(\iota ʻx\cup \iota ʻy)-\iota ʻ(\iota ʻx\cup \iota ʻy):\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow y}ʻz\cap \beta :\\ [*60·39] &\equiv :\alpha =\iota ʻx\cup \iota ʻy.\lor.\alpha =\iota ʻx.\lor.\alpha =\iota ʻy:\beta =\iota ʻx.\lor.\beta =\iota ʻy.\lor.\beta =\Lambda :\\ &(\exists z).z\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻz\cap \alpha -\iota ʻz=\overrightarrow{x\downarrow y}ʻz\cap \beta : &\qquad \text{(1)}\\ \vdash .*55·13.&\supset \vdash \colon\ldotp x\neq y.\supset :\overrightarrow{x\downarrow y}ʻy=\iota ʻx.\overrightarrow{x\downarrow y}ʻx=\Lambda : &\qquad \text{(2)}\\ [*51·222] &\supset :\alpha =\iota ʻx\cup \iota ʻy.\beta =\iota ʻx.\supset .\\ &y \in \alpha -\beta .\overrightarrow{x\downarrow y}ʻy\cap \alpha -\iota ʻy=\iota ʻx=\overrightarrow{x\downarrow y}ʻy\cap \beta .\\ [(1)] &\supset .\alpha P_{\text{df}}\beta &\qquad \text{(3)}\\ \vdash .(2).&\supset \vdash :x\neq y.\alpha =\iota ʻx\cup \iota ʻy.\beta =\iota ʻy.\supset .\\ &x\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻx\cap \alpha -\iota ʻx=\Lambda =\overrightarrow{x\downarrow y}ʻx\cap \beta \\ [(1)] &\supset .\alpha P_{\text{df}}\beta &\qquad \text{(4)}\\ \vdash .(2).&\supset \vdash :x\neq y.\alpha =\iota ʻx\cup \iota ʻy.\beta =\Lambda .\supset .\\ &x\in \alpha -\beta .\overrightarrow{x\downarrow y}ʻx\cap \alpha -\iota ʻx=\Lambda =\overrightarrow{x\downarrow y}ʻx\cap \beta .\\ [(1)] &\supset .\alpha P_{\text{df}}\beta &\qquad \text{(5)}\\ \vdash .(2).&\supset \vdash \colon\ldotp x\neq y.\alpha =\iota 'x:\beta =\Lambda .\lor.\beta =\iota 'y:\supset .\\ &x\in \alpha -\beta .\overrightarrow{x\downarrow y}'x\cap \alpha -\iota 'x=\Lambda =\overrightarrow{x\downarrow y}'x\cap \beta .\\ &\supset . \alpha P_{\text{df}}\beta &\qquad \text{(6)}\\ \vdash .(2).*24·23.&\supset \vdash :x\neq y.\alpha =\iota 'y.\beta =\Lambda .\supset .\\ &y\in \alpha -\beta .\overrightarrow{x\downarrow y}'x\cap \alpha -\iota 'y=\Lambda =\overrightarrow{x\downarrow y}'y\cap \beta &\qquad \text{(7)}\\ \vdash .(3).(4).(5).(6).(7).*170·51.&\supset \vdash :x\neq y.\supset .(x\downarrow y)_{\text{cl}}\,\unicode{x2abd}\, (x\downarrow y)_{\text{df}}.\\ [*171·21] &\supset .(x\downarrow y)_{\text{df}}=(x\downarrow y)_{\text{cl}} &\qquad \text{(8)}\\ \vdash .(8).*171·5.\supset \vdash .\text{Prop} \end{array}$

*171·52. $\begin{align}&\vdash :x\neq y.\supset .(x\downarrow y)_{\text{df}}=(\iota 'x\cup \iota 'y)\downarrow (\iota 'x)\unicode{x2909}(\iota 'y)\downarrow \Lambda \\ &[*171·51.*170·52]\end{align}$

*171·64. $\vdash :x{\sim}\in C'P.\supset .(x\unicode{x21f7}P)_{\text{df}}=(\iota 'x\cup )^{;}P_{\text{df}}\unicode{x2909}P_{\text{df}}$

*171·67. $\begin{align}&\vdash :\dot{\exists} !P.\dot{\exists} !Q.C'P\cap C'Q=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{df}}=s^{;}C^{;}(P_{\text{df}}\times Q_{\text{df}})\\ &[\text{Proof as in *170·67}]\end{align}$

*171·68. $\begin{align}\vdash : \dot{\exists} ! P . \dot{\exists} ! Q . C'P &\cap C'Q = \Lambda . \supset .\\ &s\mid C\upharpoonright (P_{\text{df}}\times Q_{\text{df}})\in (P\unicode{x2909}Q)_{\text{df}}\,\overline{\text{smor}}\,(P_{\text{df}}\times Q_{\text{df}})\\ [\text{Proof as in *170·68}]\end{align}$

*171·69. $\begin{align}&\vdash :\dot{\exists} !P.\dot{\exists} !Q.C'P\cap C'Q=\Lambda .\supset .(P\unicode{x2909}Q)_{\text{df}}\text{smor}(P_{\text{df}}\times Q_{\text{df}})\\ &[*171·68]\end{align}$

*171·7. $\begin{align}&\vdash :P_{\text{df}}=P_{\text{cl}}.x{\sim}\in C'P.\supset .(x\unicode{x21f7}P)_{\text{df}}=(x\unicode{x21f7}P)_{\text{cl}}\\ &[*171·64.*170·64]\end{align}$

*171·71. $\begin{align}&\vdash :C'P\cap C'Q=\Lambda .P_{\text{df}}=P_{\text{cl}}.Q_{\text{df}}=Q_{\text{cl}}.\supset .(P\unicode{x2909}Q)_{\text{df}}=(P\unicode{x2909}Q)_{\text{cl}}\\ &[*170·67.*171·67.*160·21·22]\end{align}$

In this number we have to consider the form of product which is applicable to any relation of relations, whether mutually exclusive or not. If our relation were a $\text{Rel}^{2}\text{excl}$ , we could take $CʻʻCʻP$ , and order selected classes from $CʻʻCʻP$ by first differences. This would give us a relation whose field would be $\text{Prod}ʻCʻʻCʻP$ . But if any two fields overlap, this method fails. We might substitute ${\in}_{\Delta}ʻCʻʻCʻP$ for $\text{Prod}ʻCʻʻCʻP$ , and order the members of ${\in}_{\Delta}ʻCʻʻCʻP$ by first differences; but this method will not give what we want if two or more members of $CʻP$ have the same field. In order to avoid any confusion due to repetition, we must, if $Q\in CʻP$ and $x\in CʻQ$ , consider $x$ in connection with $Q$ , not merely with $CʻQ$ . That is, the relations in the field of the product of $P$ must be such as concern themselves with the ordered couple $x\downarrow Q$ , not merely with $x$ . The simplest way of effecting this is to consider $F_{\Delta }ʻCʻP$ . A member of $F_{\Delta }ʻCʻP$ , say $M$ , is a relation which picks out a representative of $Q$ from the field of every $Q$ which is a member of $CʻP$ ; that is, whenever $Q\in CʻP$ , $MʻQ\in CʻQ$ . Since we have $MʻQ$ , not $MʻCʻQ$ , two relations may have the same field and yet we can distinguish the occurrence of a given term as the representative of the one from its occurrence as the representative of the other. Thus no degree of overlapping will cause confusion.

The relations which compose $F_{\Delta }ʻCʻP$ are to be ordered by first differences, but in order to distinguish different occurrences of a given term, we must give a slightly different form to the principle of first differences from that employed in *170 or *171. The new form of the principle is as follows: Consider two relations $M$ and $N$ which are members of $F_{\Delta }ʻCʻP$ . Let $Q$ be a member of $CʻP$ in which $M$ chooses a representative which precedes that of $N$ , i.e. in which $(MʻQ)Q(NʻQ)$ ; and let all earlier relations than $Q$ , i.e. all relations $R$ such that $RPQ$ and $R\neq Q$ , have $MʻR=NʻR$ . Then we say that $M$ precedes $N$ . This principle may also be stated as follows: We may divide the members of $CʻP$ into four classes, not in general mutually exclusive, namely:

(1) those in which $(MʻQ)Q(NʻQ)$ , i.e. in which the $M$ -representative precedes the $N$ -representative;

(4) those in which no one of the above three relations of $MʻQ$ and $NʻQ$ occurs.

Then we shall say that $M$ precedes $N$ if there is a member of class (1) whose predecessors all belong to class (3).

In case all the members of $CʻP$ are serial, the fourth of the above classes is null, and the other three are mutually exclusive. If, further, $P$ is well-ordered, any two different members of $F_{\Delta}ʻCʻP$ must be such that one precedes the other in the above-defined order. Thus in this case the product of a series of series is a series (cf. *251).

The definition of the product $\Pi ʻP$ is $\begin{aligned} \Pi ʻP=\hat{M} \hat{N} &\{M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR=NʻR\} \quad\text{Df}. \end{aligned}$ Owing to the complication of this definition, the proofs of propositions of the present number are apt to be long.

Various other definitions might be adopted for $\Pi ʻP$ , but we have found the above definition on the whole the best.

We might, for example, drop the condition $R\neq Q$ in the definition; we could then write our definition in the simpler form: $\Pi ʻP=\hat{M} \hat{N} \{M,N\in F_{\Delta }ʻCʻP:(\exists Q).(MʻQ)Q(NʻQ).M\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ\},$ which, with our definition, is only available when $P\,\unicode{x2abd}\, J$ . But if we adopt this simplification, we no longer have $\Pi ʻ(P\downarrow P)=P\downarrow_{.,} P \quad(*172·2),$ which is a very useful proposition, required in the proofs of *183·13, *185·21 and other important propositions.

On the other hand, we might frame our definition on the analogy of $P_{\text{cl}}$ rather than, as above, on the analogy of $P_{\text{df}}$ . The definition would then be: $\begin{aligned} \Pi ʻP=\hat{M} \hat{N} &\{M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):(MʻQ)Q(NʻQ):RPQ.\supset _{R}.(MʻR)(R\unicode{x228d} I)(NʻR)\}. \end{aligned}$

This definition does not assume that there is a first relation $Q$ for which the $M$ -representative precedes the $N$ -representative. Thus it might be thought that it would give better results in cases where $P$ is not well-ordered. But in fact this is not the case. If $P$ is not well-ordered, it may happen that every $Q$ for which $(MʻQ)Q(NʻQ)$ is preceded by one for which $(NʻQ)Q(MʻQ)$ , and vice versa; in this case, we shall have neither $M(\Pi ʻP)N$ nor $N(\Pi ʻP)M$ .[Pg 430] Thus our suggested new definition does not secure that $\Pi ʻP$ shall be a series whenever $P$ and all the members of $CʻP$ are series, and therefore has no substantial advantage over the simpler definition which we have adopted, and has the disadvantage of greater complication.

In the present number, we first prove that $\Pi ʻ\dot{\Lambda}=\dot{\Lambda}$ (*172·13) and that $\dot{\Lambda} \in CʻP.\supset.\Pi ʻP=\dot{\Lambda}$ (*172·14), so that a product is null if any one of its factors is null. We then proceed to propositions about $Cʻ\Pi ʻP$ , $\overrightarrow{B}ʻ\Pi ʻP$ , etc. We have

*172·162. $\vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻ\Pi ʻP=B_{\Delta }ʻCʻP.\overrightarrow{B}ʻ\text{Cnv}ʻ\Pi ʻP=B_{\Delta }ʻ\text{Cnv}ʻʻCʻP$

*172·181. $\vdash \colon\ldotp \text{Mult ax}.\supset :\Lambda {\sim}\in CʻP.\dot{\exists} !P.\equiv .\dot{\exists} !\Pi ʻP$

Thus assuming the multiplicative axiom, a product which has factors none of which are null is not null.

We then consider $\Pi ʻ(P\downarrow P)$ , and $\Pi ʻ(P\downarrow Q)$ where $P\neq Q$ . We have

which connects the two definitions of multiplication, showing that they lead to equivalent results for any finite number of factors, i.e. whenever the definition of *166 is applicable.

We next consider $\Pi ʻ(P\unicode{x21f8} Z)$ and $\Piʻ(P\unicode{x2909}Q)$ , proving

*172·32. $\vdash :Z{\sim}\in CʻP.\supset .\Pi ʻ(P\unicode{x21f8} Z)\text{smor}\Pi ʻP\times Z$

*172·35. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .\Pi ʻ(P\unicode{x2909}Q)\text{smor}\Pi ʻP\times \Pi ʻQ$

which is a form of the associative law using both kinds of multiplication. The kind which uses only $\Pi$ will be proved in *174.

We have next the proof (with its immediate consequences) that if $P$ and $Q$ have double likeness, $\Pi ʻP\text{smor}\Pi ʻQ$ . We prove

*172·43. $\begin{align}\vdash :T\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\text{smor}}\, &\overline{\text{smor}}\,Q.\supset .\\ &(T\mid \text{Cnv}ʻT\dagger )\upharpoonright Cʻ\Pi ʻQ\in (\Pi ʻP)\,\overline{\text{smor}}\,(\Pi ʻQ)\end{align}$

This proposition should be compared with *114·51, which is its cardinal analogue. It will be seen that the correlator only differs by the substitution of $T\dagger$ for $T_{\in }$ . From *172·43 we obtain

*172·44. $\vdash :P\,\text{smor smor}\,Q.\supset .\Pi ʻP\,\text{smor}\,\Pi ʻQ$

*172·45. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in \text{Rel}^{2}\text{excl}.\exists !P\,\overline{\text{smor}}\,Q\cap \text{Rl}ʻ&\text{smor}.\supset .\\ &\Pi ʻP\,\text{smor}\,\Pi ʻQ\end{align}$

*172·01. $\begin{align}\Pi ʻP=\hat{M} \hat{N} &\{M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR=NʻR\} \quad\text{Df}\end{align}$

*172·1. $\begin{align}\vdash \colon\colon M&(\Pi ʻP)N.\equiv \colon\ldotp M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR=NʻR\\ [(*172·01)]\end{align}$

*172·11. $\begin{align}\vdash \colon\colon &M(\Pi ʻP)N.\equiv \colon\ldotp M,N\in F_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists Q):Q\in CʻP.(MʻQ)Q(NʻQ):RPQ.R\neq Q.\supset _{R}.MʻR=NʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*14·21. &\supset \vdash :(MʻQ)Q(NʻQ).\supset .\text{E}!MʻQ.\\ [*33·43] &\supset .Q\in \text{ᗡ}ʻM &\qquad \text{(1)}\\ \vdash .(1).*80·14.&\supset \vdash \colon\ldotp M\in F_{\Delta }ʻCʻP.\supset :(MʻQ)Q(NʻQ).\supset .Q\in CʻP:\\ [*4·73] &\supset :(MʻQ)Q(NʻQ).\equiv .Q\in CʻP.(MʻQ)Q(NʻQ) &\qquad \text{(2)}\\ \vdash .(2).*172·1.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*172·1.\supset \vdash :M(\Pi ʻP)N.\supset .M,N\in F_{\Delta }ʻCʻP &\qquad \text{(1)}\\ \vdash .(1).*33·352.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*172·11. &\supset \vdash :M(\Pi ʻP)N.\supset .\exists !CʻP.\\ [*33·24] &\supset .\dot{\exists} !P &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash :P=\dot{\Lambda} .\supset .(M,N).{\sim}{M(\Pi ʻP)N}:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*33·24·5.&\supset \vdash .\overrightarrow{F}ʻ\dot{\Lambda} =\Lambda .\\ [*33·41] &\supset \vdash .\dot{\Lambda} {\sim}\in \text{ᗡ}ʻF.\\ [*80·21] \supset \vdash :\dot{\Lambda} \in CʻP.&\supset .F_{\Delta }ʻCʻP=\Lambda .\\ [*172·12.*33·24] &\supset .\Pi ʻP=\dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

*172·141. $\vdash \colon\ldotp \dot{\exists} !\Pi ʻP.\supset :Q\in CʻP.\supset _{Q}.\dot{\exists} !Q \quad[*172·14.\text{Transp}]$

The following propositions are concerned with $Cʻ\Pi ʻP$ , $\overrightarrow{B}ʻ\Pi ʻP$ , etc. *172·15 ·151 ·16 ·161 are lemmas for *172·162 ·17.

*172·15. $\vdash :M\in F_{\Delta }ʻCʻP.Q\in CʻP.(MʻQ)Qy.\supset .M(\Pi ʻP)\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}$

Dem. $\begin{array}{l} \vdash .*80·41.&\supset \vdash :\text{Hp}.\supset .M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\in F_{\Delta }ʻCʻP &\qquad \text{(1)}\\ \vdash .*35·101.*55·13.\supset \\ &\vdash \colon\ldotp z\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}R.\equiv :R\neq Q.zMR.\lor.R=Q.z=y &\qquad \text{(2)}\\ \vdash .(2).*80·3.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :R=Q.\supset .\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}ʻR=y:\\ &R\in CʻP.R\neq Q.\supset .\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}ʻR=MʻR:\\ [\text{Hp}] &\supset :(MʻQ)Q\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}ʻQ:\\ &R\in CʻP.R\neq Q.\supset .\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}ʻR=MʻR:\\ [*33·17]&\supset :(MʻQ)Q{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q}ʻQ:\\ &RPQ.R\neq Q.\supset _{R}.MʻR=\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}ʻR:\\ [*172·1.(1)]&\supset :M(\Pi ʻP)\{M\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*172·151. $\begin{align}\vdash :N\in F_{\Delta }ʻCʻP.&Q\in CʻP.yQ(NʻQ).\supset .\\ &\{N\upharpoonright -\iota ʻQ\unicode{x228d} y\downarrow Q\}(\Pi ʻP)N \quad[\text{Proof as in *172·15}]\end{align}$

*172·16. $\vdash :M\in F_{\Delta }ʻCʻP.\dot{\exists} !M\dot{-} B.\supset .M\in \text{ᗡ}ʻ\Pi ʻP$

Dem. $\begin{array}{l} \vdash .*72·93.*80·14.\supset \vdash \colon\colon \text{Hp}.&\supset \colon\ldotp M\,\unicode{x2abd}\, B.\equiv :Q\in CʻP.\supset _{Q}.(MʻQ)BQ\colon\ldotp \\ [\text{Transp}] \supset \colon\ldotp \dot{\exists} !M\dot{-} B.&\equiv :(\exists Q).Q\in CʻP.{\sim}{(MʻQ)BQ}:\\ [*93·1.*80·3] &\supset :(\exists Q).Q\in CʻP.MʻQ\in \text{ᗡ}ʻQ:\\ [*33·131] &\supset :(\exists Q,y).Q\in CʻP.yQ(MʻQ):\\ [*172·151] &\supset :M\in \text{ᗡ}ʻ\Pi ʻP\colon\colon \supset \vdash .\text{Prop} \end{array}$

*172·161. $\vdash :M\in F_{\Delta }ʻCʻP.\dot{\exists} !M\dot{-} B\mid \text{Cnv}.\supset .M\in \text{D}ʻ\Pi ʻP$

Dem. $\begin{array}{l} \vdash .*72·93.*80·14.\supset \vdash \colon\colon &\text{Hp}.\supset \colon\ldotp \\ M\,\unicode{x2abd}\, B\mid \text{Cnv}.&\equiv :Q\in CʻP.\supset _{Q}.(MʻQ)(B\mid \text{Cnv})Q:\\ [*71·7] &\equiv :Q\in CʻP.\supset _{Q}.(MʻQ)B\breve{Q} \colon\ldotp \\ [\text{Transp}] \supset \colon\ldotp \dot{\exists} !M\dot{-} B\mid \text{Cnv}.&\equiv :(\exists Q).Q\in CʻP.{\sim}\{(MʻQ)B\breve{Q}\}:\\ [*93·1.*80·3] &\supset :(\exists Q).Q\in CʻP.MʻQ\in \text{D}ʻQ:\\ [*33·13] &\supset :(\exists Q,y).Q\in CʻP.(MʻQ)Qy:\\ [*172·15] &\supset :M\in \text{D}ʻ\Pi ʻP\colon\colon \supset \vdash .\text{Prop} \end{array}$

The following proposition is important. It shows that, if $CʻP$ consists of series, if any member of $CʻP$ has no first term, $\PiʻP$ has no first term, but if every member of $CʻP$ has a first term, the selection of all these first terms is the first term of $\PiʻP$ .

*172·162. $\vdash :\dot{\exists} !P.\supset .\overrightarrow{B}ʻ\Pi ʻP=B_{\Delta }ʻCʻP.\overrightarrow{B}ʻ\text{Cnv}ʻ\Pi ʻP=B_{\Delta }ʻ\text{Cnv}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*93·103.*172·12·16.\text{Transp}.&\supset \vdash .\overrightarrow{B}ʻ\Pi ʻP\subset F_{\Delta }ʻCʻP\cap \text{Rl}ʻB &\qquad \text{(1)}\\ \vdash .*72·93.\supset \\ \vdash \colon\ldotp M\in F_{\Delta }ʻCʻP.M\,\unicode{x2abd}\, B.Q\in CʻP.&\supset :(MʻQ)BQ:\\ [*93·1] &\supset :(MʻQ)\in \text{D}ʻQ:\\ [*33·13] &\supset :(\exists y).(MʻQ)Qy:\\ [*172·15] &\supset :M\in \text{D}ʻ\Pi ʻP &\qquad \text{(2)}\\ \vdash .(2).*10·11·23·35.&\supset \vdash \colon\ldotp \dot{\exists} !P.\supset :M\in F_{\Delta }ʻCʻP\cap \text{Rl}ʻB.\supset .M\in \text{D}ʻ\Pi ʻP &\qquad \text{(3)}\\ \vdash .*172·11. &\supset \vdash :N\in \text{ᗡ}ʻ\Pi ʻP.\supset .(\exists Q,M).Q\in CʻP.(MʻQ)Q(NʻQ).\\ [*93·1] &\supset .(\exists Q).Q\in CʻP.{\sim}\{(NʻQ)BQ\}.\\ [*72·93] &\supset .{\sim}(N\,\unicode{x2abd}\, B):\\ [\text{Transp}. \frac{M}{N}] &\supset \vdash :M\,\unicode{x2abd}\, B.\supset .M{\sim}\in \text{ᗡ}ʻ\Pi ʻP &\qquad \text{(4)}\\ \vdash .(1).(3).(4). \supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\Pi ʻP&=F_{\Delta }ʻCʻP\cap \text{Rl}ʻB\\ [*80·17] &=B_{\Delta }ʻCʻP &\qquad \text{(5)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\text{Cnv}ʻ\Pi ʻP=B_{\Delta }ʻ\text{Cnv}ʻʻCʻP &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*172·16·162.\supset \\ \vdash \colon\ldotp \text{Hp}.M\in F_{\Delta }ʻCʻP.&\supset :\dot{\exists} !M\dot{-} B.\supset .M\in \text{ᗡ}ʻ\Pi ʻP:M\,\unicode{x2abd}\, B.\supset .M\in \overrightarrow{B}ʻ\Pi ʻP:\\ [*93·11.*25·55] &\supset :M\in Cʻ\Pi ʻP &\qquad \text{(1)}\\ \vdash .(1).*172·12.\supset \vdash .\text{Prop} \end{array}$

*172·171. $\begin{align}\vdash :\dot{\exists} !P.\supset .&\text{D}ʻ\Pi ʻP=F_{\Delta }ʻCʻP-B_{\Delta }ʻ\text{Cnv}ʻʻCʻP.\\ &\text{ᗡ}ʻ\Pi ʻP=F_{\Delta }ʻCʻP-B_{\Delta }ʻCʻP \quad[*172·162·17]\end{align}$

*172·18. $\vdash \colon\ldotp \dot{\exists} !P.\supset :\dot{\exists} !\Pi ʻP.\equiv .\exists !F_{\Delta }ʻCʻP \quad[*172·17]$

*172·181. $\vdash \colon\ldotp \text{Mult ax}.\supset :\dot{\Lambda} {\sim}\in CʻP.\dot{\exists} !P.\equiv .\dot{\exists} !\Pi ʻP$

Dem. $\begin{array}{l} \vdash .*88·361.*172·18.\supset \vdash \colon\colon \text{Hp}.\supset \colon\ldotp \dot{\exists} !P.\supset :\dot{\exists} !\Pi ʻP.&\equiv .CʻP\subset \text{ᗡ}ʻF.\\ [*33·41·5] &\equiv .CʻP\subset \hat{Q} (\exists !CʻQ).\\ [*33·241] &\equiv .\dot{\Lambda} {\sim}\in CʻP &\qquad \text{(1)}\\ \vdash .*172·13. &\supset \vdash :\dot{\exists} !\Pi ʻP.\supset .\dot{\exists} !P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*172·182. $\begin{align}&\vdash \colon\colon \text{Mult ax}.\supset \colon\ldotp \dot{\Lambda} \in CʻP.\lor.P=\dot{\Lambda} :\equiv .\Pi ʻP=\dot{\Lambda}\\ &[*172·181.\text{Transp}]\end{align}$

*172·19. $\vdash :\dot{\exists} !\Pi ʻP.\supset .\dot{s} ʻCʻ\Pi ʻP=F\upharpoonright CʻP \quad[*172·17.*80·42]$

Note that we cannot proceed to $\Sigma ʻ\Pi ʻP$ , because $F^{;}\PiʻP$ is meaningless, owing to the fact that the field of $\Pi ʻP$ consists of non-homogeneous relations.

*172·191. $\vdash .\dot{s} ʻCʻ\Pi ʻP\,\unicode{x2abd}\, F\upharpoonright CʻP$

Dem. $\begin{array}{l} \vdash .*172·19.*23·42.&\supset \vdash :\dot{\exists} !\Pi ʻP.\supset .\dot{s} ʻCʻ\Pi ʻP\,\unicode{x2abd}\, F\upharpoonright CʻP &\qquad \text{(1)}\\ \vdash .*41·21. \supset \vdash :\Pi ʻP=\dot{\Lambda} .&\supset .\dot{s} ʻCʻ\Pi ʻP=\dot{\Lambda} .\\ [*25·12] &\supset .\dot{s} ʻCʻ\Pi ʻP\,\unicode{x2abd}\, F\upharpoonright CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*172·192. $\vdash .\text{ᗡ}ʻ(F\upharpoonright \beta )=\beta -\iota ʻ\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*35·101.\supset \vdash :Q\in \text{ᗡ}ʻ(F\upharpoonright \beta ).&\equiv .(\exists x).xFQ.Q\in \beta .\\ [*33·5] &\equiv .\exists !CʻQ.Q\in \beta .\\ [*33·24] &\equiv .\dot{\exists} !Q.Q\in \beta :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*172·11.*55·15.\supset \\ \vdash \colon\colon M\{\Pi ʻ(P\downarrow P)\}N.&\equiv \colon\ldotp M,N\in F_{\Delta }ʻ\iota ʻP\colon\ldotp \\ (\exists Q):Q\in \iota ʻP.(MʻQ)Q(NʻQ):R&=P.R\neq Q.\supset _{R}.MʻR=NʻR\colon\ldotp \\ [*13·195·191] &\equiv \colon\ldotp M,N\in F_{\Delta }ʻ\iota ʻP\colon\ldotp (MʻP)P(NʻP)\colon\ldotp \\ [*85·51.*33·5]&\equiv \colon\ldotp M,N\in \downarrow PʻʻCʻP.(MʻP)P(NʻP)\colon\ldotp \\ [*38·131] &\equiv \colon\ldotp (\exists x, y).x,y\in CʻP.M=x\downarrow P.N=y\downarrow P.(MʻP)P(NʻP)\colon\ldotp \\ [*55·13] &\equiv \colon\ldotp (\exists x,y).x,y\in CʻP.M=x\downarrow P.N=y\downarrow P.xPy\colon\ldotp \\ [*150·11] &\equiv \colon\ldotp M(\downarrow P^{;}P)N\colon\ldotp \\ [*150·6] &\equiv \colon\ldotp M(P\downarrow_{.,} P)N\colon\colon \supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the nature of the connection between $\Pi ʻ(P\downarrow Q)$ and $P\times Q$ . The connection is such as might be desired, except when $P=Q$ , in which case, as shown above, $\Pi ʻ(P\downarrow P)$ is like $P$ , and is therefore not like $P\times P$ .

*172·21. $\vdash :P\neq Q.\supset .P\times Q=\dagger (Q\downarrow P)^{;}\Pi ʻ(P\downarrow Q)$

Dem. $\begin{array}{l} \vdash .*172·11.*55·15.\supset \\ \vdash \colon\colon .M{\Pi ʻ(P\downarrow Q)}N.&\equiv \colon\colon M,N\in F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ)\colon\ldotp \\ &(\exists R):R\in \iota ʻP\cup \iota ʻQ.(MʻR)R(NʻR):S(P\downarrow Q)R.S\neq R.\supset _{S}.MʻS=NʻS\colon\colon\\ [*51·235]&\equiv \colon\colon M,N\in F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ)\colon\colon\\ &(MʻP)P(NʻP):S(P\downarrow Q)P.S\neq P.\supset _{S}.MʻS=NʻS\colon\ldotp v\colon\ldotp \\ &(MʻQ)Q(NʻQ):S(P\downarrow Q)Q.S\neq Q.\supset _{S}.MʻS=NʻS &\qquad \text{(1)}\\ \vdash .(1).*55·13.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \\ M{\Pi ʻ(P\downarrow Q)}N.&\equiv :M,N\in F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ): (MʻP)P(NʻP).\lor.(MʻQ)Q(NʻQ).MʻP=NʻP:\\ [*80·9·91]&\equiv :(\exists x,x',y,y'):x,x'\in CʻP.y,y'\in CʻQ.\\ &M=x\downarrow P\unicode{x228d} y\downarrow Q.N=x'\downarrow P\unicode{x228d} y'\downarrow Q:\\ &xPx'.\lor.x=x'.yQy' &\qquad \text{(2)}\\ \vdash .*150·72.&\supset \vdash :M=x\downarrow P\unicode{x228d} y\downarrow Q.\supset .M^{;}(Q\downarrow P)=y\downarrow x.\\ [*150·1] &\supset .\dagger (Q\downarrow P)ʻM=y\downarrow x &\qquad \text{(3)}\\ \vdash .*150·4. &\supset \vdash :R{\dagger (Q\downarrow P)^{;}\Pi ʻ(P\downarrow Q)}S.\equiv .\\ &(\exists M,N).M{\Pi ʻ(P\downarrow Q)}N.R=\dagger (Q\downarrow P)ʻM.S=\dagger (Q\downarrow P)ʻN &\qquad \text{(4)}\\ \vdash .(2).(3).(4).&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \\ &R\{\dagger (Q\downarrow P)^{;}\Pi ʻ(P\downarrow Q)\}S.\equiv :(\exists M,N,x,x',y,y'):\\ &x,x'\in CʻP.y,y'\in CʻQ.M=x\downarrow P\unicode{x228d} y\downarrow Q.N=x'\downarrow P\unicode{x228d} y'\downarrow Q:\\ &R=y\downarrow x.S=y'\downarrow x':xPx'.\lor.x=x'.yQy':\\ [*13·19] &\equiv :(\exists x,x',y,y'):x,x'\in CʻP.y,y'\in CʻQ.R=y\downarrow x.S=y'\downarrow x':\\ &xPx'.\lor.x=x'.yQy':\\ [*166·111] &\equiv :R(P\times Q)S\colon\colon\supset \vdash .\text{Prop} \end{array}$

*172·22. $\vdash :P\neq Q.\supset .\{\dagger (Q\downarrow P)\}\upharpoonright F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ)\in (P\times Q)\,\overline{\text{smor}}\,\Pi ʻ(P\downarrow Q)$

Dem. $\begin{array}{l} \vdash .*80·9.*150·71.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &M\in F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ).\supset .M^{;}(Q\downarrow P)=(MʻQ)\downarrow (MʻP) &\qquad \text{(1)}\\ \vdash .(1).*150·1.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &M,N\in F_{\Delta }ʻ(\iota ʻP\cup \iota ʻQ).\dagger (Q\downarrow P)ʻM=\dagger (Q\downarrow P)ʻN.\supset .\\ &(MʻQ)\downarrow (MʻP)=(NʻQ)\downarrow (NʻP).\\ [*55·202] &\supset .MʻP=NʻP.MʻQ=NʻQ.\\ [*80·91] &\supset .M=N &\qquad \text{(2)}\\ \vdash .(2).*151·241.*172·21·17.\supset \vdash .\text{Prop} \end{array}$

*172·23. $\vdash :P\neq Q.\supset .\Pi ʻ(P\downarrow Q)\,\text{smor}\,P\times Q \quad[*172·22]$

*172·3. $\begin{align}&\vdash \colon\ldotp \dot{\exists} !P.Z{\sim}\in CʻP.\supset :M{\Pi ʻ(P\unicode{x21f8} Z)}N.\equiv .\\ &(\exists S,T,u,v).(u\downarrow S)(\Pi ʻP\times Z)(v\downarrow T).M=S\unicode{x228d} u\downarrow Z.N=T\unicode{x228d} v\downarrow Z\end{align}$

Dem. $\begin{array}{l} \vdash .*80·66·44.*161·14. &\supset \vdash \colon\ldotp \text{Hp}.\supset :M\in F_{\Delta }ʻCʻ(P\unicode{x21f8} Z).\equiv .\\ &(\exists S,u).S\in F_{\Delta }ʻCʻP.u\in CʻZ.M=S\unicode{x228d} u\downarrow Z &\qquad \text{(1)}\\ \vdash .*55·13.*33·14.*4·73. &\supset \vdash \colon\colon M=S\unicode{x228d} u\downarrow Z.\supset \colon\ldotp \\ &xMQ.\equiv :xSQ.Q\in \text{ᗡ}ʻS.\lor.x=u.Q=Z &\qquad \text{(2)}\\ \vdash .(2).*80·14. &\supset \vdash \colon\colon\text{Hp}.\text{Hp}(2).S\in F_{\Delta }ʻCʻP.u\in CʻZ.\supset \colon\ldotp \\ &xMQ.\equiv :xSQ.Q\in CʻP.\lor.x=u.Q=Z\colon\ldotp \\ [*24·37] &\supset \colon\ldotp Q\in CʻP.\supset :xMQ.\equiv .xSQ\colon\ldotp Q=Z.\supset :xMQ.\equiv .x=u\colon\ldotp \\ [*30·341.*80·3.*30·3] &\supset \colon\ldotp Q\in CʻP.\supset .MʻQ=SʻQ:Q=Z.\supset .MʻQ=u &\qquad \text{(3)}\\ \vdash .(1).*172·11.*161·14.*172·17.\supset \\ \vdash \colon\colon\ldotp \text{Hp}.&\supset \colon\colon M{\Pi ʻ(P\unicode{x21f8} Z)}N.\equiv \colon\ldotp \\ &(\exists S,T,u,v)\colon\ldotp S,T\in F_{\Delta }ʻCʻP.u,v\in CʻZ.M=S\unicode{x228d} u\downarrow Z.N=T\unicode{x228d} v\downarrow Z\colon\ldotp \\ &(\exists Q):Q\in CʻP\cup \iota ʻZ.(MʻQ)Q(NʻQ):R(P\unicode{x21f8} Z)Q.R\neq Q.\supset _{R}.MʻR=NʻP\colon\ldotp \\ [*51·239.(3).*161·11] &\equiv \colon\ldotp (\exists S,T,u,v)\colon\ldotp S,T\in F_{\Delta }ʻCʻP.u,v\in CʻZ.M=S\unicode{x228d} u\downarrow Z.N=T\unicode{x228d} v\downarrow Z\colon\ldotp \\ &(\exists Q):Q\in CʻP.(SʻQ)Q(TʻQ):RPQ.R\neq Q.\supset _{R}.SʻR=TʻR:\lor: uZv:R\in CʻP.\supset _{R}.SʻR=TʻR\colon\ldotp \\ [*172·11·17.*71·35.*80·14] &\equiv \colon\ldotp (\exists S,T,u,v)\colon\ldotp S,T\in Cʻ\Pi ʻP.u,v\in CʻZ.M=S\unicode{x228d} u\downarrow Z.N=T\unicode{x228d} v\downarrow Z:\\ &S(\Pi ʻP)T.\lor.S=T.uZv\colon\ldotp \\ [*166·112] &\equiv \colon\ldotp (\exists S,T,u,v):(u\downarrow S)(\Pi ʻP\times Z)(v\downarrow T).\\ &M=S\unicode{x228d} u\downarrow Z.N=T\unicode{x228d} v\downarrow Z\colon\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*172·31. $\begin{align}&\vdash :\dot{\exists} !P.Z{\sim}\in CʻP.\\ &W=\hat{M} \hat{R} \{(\dot{\exists} S,u).S\in F_{\Delta }ʻCʻP.u\in CʻZ.R=u\downarrow S.M=S\unicode{x228d} u\downarrow Z\}.\supset .\\ &W\in \Pi ʻ(P\unicode{x21f8} Z)\,\overline{\text{smor}}\,(\Pi ʻP x Z)\end{align}$

Dem. $\begin{array}{l} \vdash .*172·3. &\supset \vdash :\text{Hp}.\supset .\Pi ʻ(P\unicode{x21f8} Z)=W^{;}(\Pi ʻP\times Z) &\qquad \text{(1)}\\ \vdash .*21·33. &\supset \vdash \colon\ldotp \text{Hp}.\supset :MWR.MʻWR.\equiv .\\ &(\exists S,S',u,u').S,S'\in F_{\Delta }ʻCʻP.u,u'\in CʻZ.R=u\downarrow S=u'\downarrow S'.\\ &M=S\unicode{x228d} u\downarrow Z.Mʻ=S'\unicode{x228d} u'\downarrow Z.\\ [*55·202]& \supset .(\exists S,Sʻ,u,u').S,S'\in F_{\Delta }ʻCʻP.u,u'\in CʻZ.S=S'.u =u'.\\ &M=S\unicode{x228d} u\downarrow Z.Mʻ=S'\unicode{x228d} u'\downarrow Z.\\ [*13·22·172] &\supset .M=M' &\qquad \text{(2)}\\ \vdash .*21·33. &\supset \vdash \colon\ldotp \text{Hp}.\supset :MWR.MWRʻ.\equiv .\\ &(\exists S,S',u,u').S,S'\in F_{\Delta }ʻCʻP.u,u'\in CʻZ.R=u\downarrow S.Rʻ=u'\downarrow Sʻ.\\ &M=S\unicode{x228d} u\downarrow Z.M=Sʻ\unicode{x228d} u'\downarrow Z.\\ [*80·45·661] &\supset .(\exists S,Sʻ,u,u').R=u\downarrow S.Rʻ=u'\downarrow Sʻ.\\ &S=M\upharpoonright CʻP.u\downarrow Z=M\upharpoonright \iota ʻZ.Sʻ=M\upharpoonright CʻP.u'\downarrow Z=M\upharpoonright CʻP .\\ [*13·172] &\supset .(\exists S,S',u,u').R=u\downarrow S.Rʻ=u'\downarrow S'.S=S'.u\downarrow Z=u'\downarrow Z.\\ [*55·202] &\supset .R=Rʻ &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\supset .W\in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .*166·12.*113·101.*172·17. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻW=Cʻ(\Pi ʻP\times Z) &\qquad \text{(5)}\\ \vdash .(1).(4).(5).*151·11.\supset \vdash .\text{Prop} \end{array}$

*172·32. $\vdash :Z{\sim}\in CʻP.\supset .\Pi ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\Pi ʻP\times Z$

Dem. $\begin{array}{l} \vdash .*172·31. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\Pi ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\Pi ʻP\times Z &\qquad \text{(1)}\\ \vdash .*172·13.*161·2. &\supset \vdash :{\sim}\dot{\exists} !P.\supset .\Pi ʻ(P\unicode{x21f8} Z)=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .*172·13.*166·13. &\supset \vdash :{\sim}\dot{\exists} !P.\supset .\Pi ʻP\times Z=\dot{\Lambda} &\qquad \text{(3)}\\ \vdash .(2).(3).*153·101. &\supset \vdash :{\sim}\dot{\exists} !P.\supset .\Pi ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\Pi ʻP\times Z &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*172·321. $\begin{align}&\vdash :Z{\sim}\in CʻP.\supset .\Pi ʻ(Z\unicode{x21f7}CʻP)\,\text{smor}\,Z\times \Pi ʻP\\ &[\text{Proof by similar stages to those in proof of *172·32}]\end{align}$

The following proposition is a lemma for *172·34, which is required in proving *172·35 (as well as *176·4).

*172·33. $\begin{align}&\vdash \colon\colon\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset \colon\ldotp \\ M\{\Pi ʻ(P\unicode{x2909}Q)\}N.&\equiv :(\exists S,T,S',T'):S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ:\\ &S(\Pi ʻP)S'.\lor.S=S'.T(\Pi ʻQ)Tʻ:M=S\unicode{x228d} T.M'=S'\unicode{x228d} T'\end{align}$

Dem. $\begin{array}{l} \vdash .*80·66. &\supset \vdash \colon\ldotp \text{Hp}.\supset :M\in F_{\Delta }ʻ(CʻP\cup CʻQ).\equiv .\\ &(\exists S,T).S\in F_{\Delta }ʻCʻP.T\in F_{\Delta }ʻCʻQ.M=S\unicode{x228d} T &\qquad \text{(1)}\\ \vdash .*80·661.*35·7. &\supset \vdash \colon\ldotp \text{Hp}.S\in F_{\Delta }ʻCʻP.T\in F_{\Delta }ʻCʻQ.M=S\unicode{x228d} T.\supset :\\ &R\in CʻP.\supset .MʻR=SʻR:R\in CʻQ.\supset .MʻR=TʻR &\qquad \text{(2)}\\ \vdash .(1).*172·11·17.*160·14. &\supset \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon M\{\Pi ʻ(P\unicode{x2909}Q)\}N.\equiv \colon\ldotp\\ &(\exists S,T,S',T')\colon\ldotp S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ.M=S\unicode{x228d} T.N=S'\unicode{x228d} T'\colon\ldotp \\ &(\exists R):R\in CʻP\cup CʻQ.(MʻR)R(NʻR):Rʻ(P\unicode{x2909}Q)R.R\neq Rʻ.\supset _{Rʻ}.MʻRʻ=NʻRʻ\colon\ldotp \\ [(2).*160·11] &\equiv \colon\ldotp (\exists S,T,S',T')\colon\ldotp S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ.\\ &M=S\unicode{x228d} T.N=S'\unicode{x228d} T'\colon\ldotp \\ &(\exists R):R\in CʻP.(SʻR)R(S'ʻR):R'PR.R'\neq R.\supset _{Rʻ}.SʻR'=S'ʻR':\lor:\\ &(\exists R):R\in CʻQ.(TʻR)R(TʻʻR):R'QR.R'\neq R.\supset _{Rʻ}.TʻR'=TʻʻR': R'\in CʻP.\supset _{R'}.SʻR'=S'ʻR'\colon\ldotp \\ [*10·35] &\equiv \colon\ldotp (\exists S,T,S',T')\colon\ldotp S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ.M=S\unicode{x228d} T.N=S'\unicode{x228d} T'\colon\ldotp \\ &(\exists R):R\in CʻP.(SʻR)R(SʻʻR):R'PR.R'\neq R.\supset _{R'}.SʻR'=SʻʻR':\lor:\\ &R'\in CʻP.\supset _{R'}.SʻR'=S'ʻR':\\ &(\exists R):R\in CʻQ.(TʻR)R(TʻʻR):RʻQR.R'\neq R.\supset _{R'}.TʻR'=T'ʻR'\colon\ldotp \\ [*172·11.*71·35.*80·14] &\equiv \colon\ldotp (\exists S,T,S',T')\colon\ldotp S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ.M=S\unicode{x228d} T,Mʻ=S'\unicode{x228d} T'\colon\ldotp \\ &S(\Pi ʻP)S'.\lor.S=S'.T(\Pi ʻQ)T'\colon\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*172·34. $\begin{align}\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ&=\Lambda .\supset .\\ &(\dot{s} \mid C)\in \{\Pi ʻ(P\unicode{x2909}Q)\}\,\overline{\text{smor}}\, \{\Pi ʻP\times \Pi ʻQ\}\end{align}$

Dem. $\begin{array}{l} \vdash .*172·33.*55·15.*53·13.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp M{\Pi ʻ(P\unicode{x2909}Q)}N.&\equiv :(\exists S,T,S',T',R,R'):\\ &S,S'\in F_{\Delta }ʻCʻP.T,T'\in F_{\Delta }ʻCʻQ.R=T\downarrow S.R'=Tʻ\downarrow Sʻ.M=\dot{s} ʻCʻR.N=\dot{s} ʻCʻR':\\ &S(\Pi ʻP)S'.\lor.S=S'.T(\Pi ʻQ)Tʻ:\\ [*166·11.*172·17]&\equiv :(\exists R,R').R\{\Pi ʻP\times \Pi ʻQ\} Rʻ.M=\dot{s} ʻCʻR.N=\dot{s} ʻCʻR':\\ [*150·4] &\equiv :M\{\dot{s} ^{;}C^{;}(\Pi ʻP\times \Pi ʻQ)\}N &\qquad \text{(1)}\\ \vdash .*113·153.*172·19.*166·12.&\supset \vdash :\text{Hp}.\supset .(\dot{s} \mid C)\upharpoonright Cʻ(\Pi ʻP\times \Pi ʻQ)\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).*151·231.\supset \vdash .\text{Prop} \end{array}$

*172·35. $\begin{align}&\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .\Pi ʻ(P\unicode{x2909}Q)\,\text{smor}\,\Pi ʻP\times \Pi ʻQ\\ &[*172·34]\end{align}$

The following propositions are extensions of *172·23. It is obvious that they may be extended to any finite number of factors.

*172·36. $\vdash :X\neq Y.X\neq Z.Y\neq Z.\supset .\Pi ʻ{(X\downarrow Y)\unicode{x21f8} Z}\text{smor}X\times Y\times Z$

Dem. $\begin{array}{l} \vdash .*172·32.\supset \vdash :\text{Hp}.\supset .\Pi ʻ{(X\downarrow Y)\unicode{x21f8} Z}\,\text{smor}\,\Pi ʻ(X\downarrow Y)\times Z &\qquad \text{(1)}\\ \vdash .*172·23.*166·23.\supset \vdash :\text{Hp}.\supset .\Pi ʻ(X\downarrow Y)\times Z\,\text{smor}\,X\times Y\times Z &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*172·361. $\begin{align}&\vdash :X\neq Y.X\neq Z.Y\neq Z.\supset .\Pi ʻ{X\unicode{x21f7}(Y\downarrow Z)}\,\text{smor}\,X\times Y\times Z\\ &[\text{Proof as in *172·36}]\end{align}$

*172·37. $\begin{align}\vdash :X\neq Y.X\neq Z.&X\neq W.Y\neq Z.Y\neq W.Z\neq W.\supset .\\ &\Pi ʻ\{(X\downarrow Y)\unicode{x2909}(Z\downarrow W)\}\,\text{smor}\,X\times Y\times Z\times W\end{align}$

Dem. $\begin{array}{l} \vdash .*172·35.\supset \\ \vdash :\text{Hp}.\supset .\Pi ʻ{(X\downarrow Y)\unicode{x2909}(Z\downarrow W)}\text{smor}\Pi ʻ(X\downarrow Y)\times \Pi ʻ(Z\downarrow W) &\qquad \text{(1)}\\ \vdash .*172·23.*166·23.\supset \\ \vdash :\text{Hp}.\supset .\Pi ʻ(X\downarrow Y)\times \Pi ʻ(Z\downarrow W)\text{smor}(X\times Y)\times (Z\times W) &\qquad \text{(2)}\\ \vdash .(1).(2).*166·42.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the construction of a correlator of $\Pi ʻP$ with $\Pi ʻQ$ when we are given a double correlator of $P$ with $Q$ . If the double correlator is $T$ or $T\upharpoonright Cʻ\Sigma ʻQ$ , the correlator of $\Pi ʻP$ with $\Pi ʻQ$ is $\{T\parallel \text{Cnv}ʻT\dagger\}\upharpoonright Cʻ\Pi ʻQ.$

*172·4. $\vdash :T\in P\,\overline{\text{smor smor}}\, Q.\supset .\{T\parallel \text{Cnv}ʻT\dagger \}\upharpoonright Cʻ\Pi ʻQ\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*164·15.\supset \\ \vdash :\text{Hp}.&\supset .T\upharpoonright Cʻ\Sigma ʻQ,T\dagger \upharpoonright CʻQ\in 1\rightarrow 1.Cʻ\Sigma ʻQ=\text{ᗡ}ʻT.CʻQ\subset \text{ᗡ}ʻT\dagger &\qquad \text{(1)}\\ \vdash .*41·43. &\supset \vdash .sʻ\text{D}ʻʻCʻ\Pi ʻQ=\text{D}ʻ\dot{s} ʻCʻ\Pi ʻQ.\\ [*172·191] \supset \vdash .sʻ\text{D}ʻʻCʻ\Pi ʻQ&\subset \text{D}ʻ(F\upharpoonright CʻQ)\\ [*37·401.*162·23] &\subset Cʻ\Sigma ʻQ &\qquad \text{(2)}\\ \vdash .*41·44. &\supset \vdash .sʻ\text{ᗡ}ʻʻCʻ\Pi ʻQ=\text{ᗡ}ʻ\dot{s} ʻCʻ\Pi ʻQ.\\ [*172·191] &\supset \vdash .sʻ\text{ᗡ}ʻʻCʻ\Pi ʻQ\subset \text{ᗡ}ʻ(F\upharpoonright CʻQ)\\ [*35·64] &\subset CʻQ &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*74·773 \frac{T,T\dagger ,Cʻ\Sigma ʻQ,CʻQ,Cʻ\Pi ʻQ}{Q,\,R,\,\alpha,\,\beta,\,\lambda}.\supset \vdash .\text{Prop} \end{array}$

*172·401. $\begin{align}\vdash :T\in P\,\overline{\text{smor smor}}\, Q.N\in F_{\Delta }ʻCʻQ.&S\in CʻQ.\supset .\\ &\{(T\parallel \text{Cnv}ʻT\dagger )ʻN\}ʻT^{;}S=TʻNʻS\end{align}$

Dem. $\begin{array}{l} \vdash .*43·112.*150·1. \supset \vdash .\{(T\parallel \text{Cnv}ʻT\dagger )ʻN\}ʻT^{;}S&=(T\mid N\mid \text{Cnv}ʻT\dagger )ʻT\dagger ʻS &\qquad \text{(1)}\\ \vdash .(1).*35·7·48.*80·14.\supset \\ \vdash :\text{Hp}.\supset .\{(T\parallel \text{Cnv}ʻT\dagger )ʻN\}ʻT^{;}S&=\{T\mid N\mid \text{Cnv}ʻ(T\dagger \upharpoonright CʻQ)\}ʻ(T\dagger \upharpoonright CʻQ)ʻS\\ [*34·41.*72·601.*164·13] &=(T\mid N)ʻS\\ [*34·41] & =TʻNʻS:\supset \vdash .\text{Prop} \end{array}$

*172·402. $\begin{align}\vdash :T\in P\,\overline{\text{smor smor}}\, Q.&N,N'\in F_{\Delta }ʻCʻQ.S\in CʻQ.M=(T\parallel \text{Cnv}ʻT\dagger )ʻN.\\ &Mʻ=(T\parallel \text{Cnv}ʻT\dagger )ʻN'.R=T^{;}S.\supset :\\ &NʻS=N'ʻS.\equiv .MʻR=M'ʻR:(NʻS)S(N'ʻS).\equiv .(MʻR)R(M'ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*172·401. &\supset \vdash :\text{Hp}.\supset .MʻR=TʻNʻS.MʻʻR=TʻNʻʻS &\qquad \text{(1)}\\ \vdash .*162·22.*40·13. \supset \vdash :\text{Hp}.&\supset .CʻS\subset Cʻ\Sigma ʻQ.\\ [*164·1] &\supset .CʻS\subset \text{ᗡ}ʻT &\qquad \text{(2)}\\ \vdash .*80·31.*33·5. &\supset \vdash \colon\ldotp \text{Hp}.\supset :NʻS,NʻʻS\in CʻS:\\ [(2)] &\supset :NʻS,NʻʻS\in \text{ᗡ}ʻT:\\ [*71·56] \supset :NʻS=NʻʻS.&\equiv .TʻNʻS=TʻNʻʻS.\\ [(1)] &\equiv .MʻR=MʻʻR &\qquad \text{(3)}\\ \vdash .(1). \supset \vdash \colon\ldotp \text{Hp}.\supset :(MʻR)R(MʻʻR).&\equiv .(TʻNʻS)(T^{;}S)(TʻNʻʻS).\\ [*150·41] &\equiv .(NʻS)(\breve{T} ^{;}T^{;}S)(NʻʻS).\\ [*151·252.(2)] &\equiv .(NʻS)S(NʻʻS) &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*172·403. $\vdash :T\in P\,\overline{\text{smor smor}}\, Q.\supset .(T\parallel \text{Cnv}ʻT\dagger )ʻʻF_{\Delta }ʻCʻQ\subset F_{\Delta }ʻCʻP$

Dem. $\begin{array}{l} \vdash .*80·14.*35·48.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :N\in F_{\Delta }ʻCʻQ.\supset .T\mid N\mid \text{Cnv}ʻT\dagger =T\mid N\mid \text{Cnv}ʻ(T\dagger \upharpoonright CʻQ).\\ [*80·14.*164·13] &\supset .(T\mid N\mid \text{Cnv}ʻT\dagger )\in 1\rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash .*37·32.\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.\supset .\text{ᗡ}ʻ(T\mid N\mid \text{Cnv}ʻT\dagger )&=T\dagger ʻʻ\breve{N} ʻʻ\text{ᗡ}ʻT\\ [*37·271.*164·1.*80·33.*162·23] &=T\dagger ʻʻ\text{ᗡ}ʻN\\ [*80·14] &=T\dagger ʻʻCʻQ\\ [*164·1.*150·22] &=CʻP &\qquad \text{(2)}\\ \vdash .*80·14.\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.&x(T\mid N\mid \text{Cnv}ʻT\dagger )R.\supset .\\ &(\exists y,S).xTy.yFS.R=T^{;}S.S\in CʻQ.\\ [*33·51 . *37·1] &\supset . (\exists S) . x \in TʻʻCʻS . R = T^{;}S . S \in CʻQ .\\ [*150·22.*164·1] &\supset .x\in CʻR:\\ [*33·51] &\supset :N\in F_{\Delta }ʻCʻQ.\supset .T\mid N\mid \text{Cnv}ʻT\dagger \,\unicode{x2abd}\, F &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*80·14.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :N\in F_{\Delta }ʻCʻQ.\supset .(T\mid N\mid \text{Cnv}ʻT\dagger )\in F_{\Delta }ʻCʻP &\qquad \text{(4)}\\ \vdash .(4).*43·112.\supset \vdash .\text{Prop} \end{array}$

*172·404. $\begin{align}\vdash \colon\ldotp T\in P\,\overline{\text{smor smor}}\, Q.\supset :&N\in F_{\Delta }ʻCʻQ.M=T\mid N\mid \text{Cnv}ʻT\dagger .\equiv .\\ &M\in F_{\Delta }ʻCʻP.N=\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger\end{align}$

Dem. $\begin{array}{l} \vdash .*164·1.*162·23.*80·33.\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.\supset .\text{D}ʻN\subset \text{ᗡ}ʻT.\\ [*71·191.*50·63] \supset .\breve{T} \mid T\mid N=N:\\ [*34·28]\supset :N\in F_{\Delta }ʻCʻQ.M=T\mid N\mid \text{Cnv}ʻT\dagger .\supset .\breve{T} \mid M=N\mid \text{Cnv}ʻT\dagger .\\ [*34·27] \supset .\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger =N\mid \text{Cnv}ʻT\dagger \mid \text{Cnv}ʻ\breve{T} \dagger &\qquad \text{(1)}\\ \vdash .*80·14. \supset \vdash :N\in F_{\Delta }ʻCʻQ.S\in \text{ᗡ}ʻN.\supset .S\in CʻQ.\\ [*40·13] \supset .CʻS\subset sʻCʻʻCʻQ &\qquad \text{(2)}\\ \vdash .(2).*164·1.\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.S\in \text{ᗡ}ʻN.\supset .CʻS\subset \text{ᗡ}ʻT &\qquad \text{(3)}\\ \vdash .(1).*150·1.\supset \vdash \colon\ldotp \text{Hp}.N\in F_{\Delta }ʻCʻQ.M=T\mid N\mid \text{Cnv}ʻT\dagger .\supset :\\ y(\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger )Y.\equiv .(\exists S,R).yNS.R=T^{;}S.Y=\breve{T} ^{;}R.\\ [(3).*151·25]\equiv .(\exists S,R).yNS.R=T^{;}S.Y=S.\\ [*13·19·195] \equiv .yNS &\qquad \text{(4)}\\ \vdash .(4).*172·403.\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.M=T\mid N\mid \text{Cnv}ʻT\dagger .\supset .\\ M\in F_{\Delta }ʻCʻP.N=\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger &\qquad \text{(5)}\\ \vdash .(5) \frac{\breve{T},\,Q,\,P}{T,\,P,\,Q}.*164·21.\supset \vdash \colon\ldotp \text{Hp}.\supset :M\in F_{\Delta }ʻCʻP.N=\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger .\supset .\\ N\in F_{\Delta }ʻCʻQ.M=T\mid N\mid \text{Cnv}ʻT\dagger &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*172·41. $\vdash :T\in P\,\overline{\text{smor smor}}\, Q.\supset .F_{\Delta }ʻCʻP=(T\parallel \text{Cnv}ʻT\dagger )ʻʻF_{\Delta }ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*172·404.*43·112. &\supset \vdash \colon\ldotp \text{Hp}.\supset :M\in F_{\Delta }ʻCʻP.\supset .\\ &\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger \in F_{\Delta }ʻCʻQ.M=(T\parallel \text{Cnv}ʻT\dagger )ʻ(\breve{T} \mid M\mid \text{Cnv}ʻ\breve{T} \dagger ).\\ [*37·6] &\supset .M\in (T\parallel \text{Cnv}ʻT\dagger )ʻʻF_{\Delta }ʻCʻQ &\qquad \text{(1)}\\ \vdash .(1).*172·403.\supset \vdash .\text{Prop} \end{array}$

The following proposition is important, since it gives the required correlator of $\Pi ʻP$ with $\Pi ʻQ$ .

*172·42. $\vdash :T\in P\,\overline{\text{smor smor}}\, Q.\supset .(T\mid \text{Cnv}ʻT\dagger )\upharpoonright Cʻ\Pi ʻQ\in (\Pi ʻP)\,\overline{\text{smor}}\,(\Pi ʻQ)$

Dem. $\begin{array}{l} \vdash .*164·1.*150·22.\supset \vdash \colon\ldotp \text{Hp}.&\supset :CʻP=T\dagger ʻʻCʻQ:\\ [*37·6.*150·1] &\supset :R\in CʻP.\equiv .(\exists S).S\in CʻQ.R=T^{;}S &\qquad \text{(1)}\\ \vdash .*164·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :RʻPR.\equiv .(\exists Sʻ,Y).Rʻ=T^{;}Sʻ.R=T^{;}Y.SʻQY &\qquad \text{(2)}\\ \vdash .*151·31.*164·1.&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp S,Y\in CʻQ.R=T^{;}S.R=T^{;}Y.\supset .S=Y\colon\ldotp &\qquad \text{(3)}\\ [*13·13] &\supset \colon\ldotp S\in CʻQ.R=T^{;}S.\supset :Y\in CʻQ.R=T^{;}Y.\equiv .S=Y &\qquad \text{(4)}\\ \vdash .(2).(4).*33·17.\supset \\ \vdash \colon\ldotp \text{Hp}.S\in CʻQ.R=T^{;}S.\supset :RʻPR.&\equiv .(\exists Sʻ,Y).Rʻ=T^{;}Sʻ.S=Y.SʻQY.\\ [*13·195] &\equiv .(\exists Sʻ).Rʻ=T^{;}Sʻ.SʻQS &\qquad \text{(5)}\\ \vdash .*150·4.*172·11.&\supset \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon M\{(T\parallel \text{Cnv}ʻT\dagger )^{;}\Pi ʻQ\}Mʻ.\equiv \colon\ldotp \\ &(\exists N,Nʻ)\colon\ldotp M=(T\parallel \text{Cnv}ʻT\dagger )ʻN.Mʻ=(T\parallel \text{Cnv}ʻT\dagger )ʻNʻ.N,Nʻ\in F_{\Delta }ʻCʻQ\colon\ldotp \\ &(\exists S):S\in CʻQ.(NʻS)S(NʻʻS):SʻQS.Sʻ\neq S.\supset _{Sʻ}.NʻSʻ=NʻʻSʻ\colon\ldotp \\ [*172·41·402] &\equiv \colon\ldotp M,Mʻ\in F_{\Delta }ʻCʻP\colon\ldotp (\exists S,R):S\in CʻQ.R=T^{;}S.(MʻR)R(MʻʻR):\\ &SʻQS.Rʻ=T^{;}S.Sʻ\neq S.\supset _{Sʻ,Rʻ}.MʻRʻ= MʻʻRʻ\colon\ldotp \\ [*10·23.(3).(5)] &\equiv \colon\ldotp M,Mʻ\in F_{\Delta }ʻCʻP\colon\ldotp (\exists S,R):S\in CʻQ.R=T^{;}S.(MʻR)R(MʻʻR):\\ &Rʻ\neq R.RʻPR.\supset _{Rʻ}.MʻRʻ=MʻʻRʻ\colon\ldotp \\ [(1).*172·11] &\equiv \colon\ldotp M(\Pi ʻP)Mʻ &\qquad \text{(6)}\\ \vdash .(6).*43·302.*172·4.*151·22.\supset \vdash .\text{Prop} \end{array}$

*172·421. $\begin{align}\vdash :S=T\upharpoonright Cʻ\Sigma ʻQ.S&\in P\,\overline{\text{smor smor}}\, Q.\supset .\\ &(S\parallel \text{Cnv}ʻS\dagger )\upharpoonright F_{\Delta }ʻCʻQ=(T\parallel \text{Cnv}ʻT\dagger )\upharpoonright F_{\Delta }ʻCʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*80·33.*164·18.*162·23.&\supset \vdash \colon\ldotp \text{Hp}.N\in F_{\Delta }ʻCʻQ.\supset .\text{D}ʻN\subset Cʻ\Sigma ʻQ.\\ [*35·481] & \supset .T\mid N=S\mid N &\qquad \text{(1)}\\ \vdash .*80·14.&\supset \vdash \colon\ldotp \text{Hp}.N\in F_{\Delta }ʻCʻQ.Y\in \text{ᗡ}ʻN.\supset :Y\in CʻQ:\\ [*150·33.*162·22] &\supset :X=T^{;}Y.\equiv .X=S^{;}Y.\\ [*150·1] &\supset :Y(\text{Cnv}ʻT\dagger )X.\equiv .Y(\text{Cnv}ʻS\dagger )X &\qquad \text{(2)}\\ \vdash .(2).*33·14. &\supset \vdash \colon\ldotp \text{Hp}.N\in F_{\Delta }ʻCʻQ.\supset :\\ &(\exists Y).yNY.Y(\text{Cnv}ʻT\dagger )X.\equiv .(\exists Y).yNY.Y(\text{Cnv}ʻS\dagger )X:\\ [*34·1] &\supset :N\mid \text{Cnv}ʻT\dagger =N\mid \text{Cnv}ʻS\dagger &\qquad \text{(3)}\\ \vdash .(1).(3). &\supset \vdash \colon\ldotp \text{Hp}.\supset :N\in F_{\Delta }ʻCʻQ.\supset .T\mid N\mid \text{Cnv}ʻT\dagger =S\mid N\mid \text{Cnv}ʻS\dagger :\\ [*43·112.*35·71] &\supset :(T\parallel \text{Cnv}ʻT\dagger )\upharpoonright F_{\Delta }ʻCʻQ=(S\parallel \text{Cnv}ʻS\dagger )\upharpoonright F_{\Delta }ʻCʻQ\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*172·43. $\begin{align}\vdash :T\upharpoonright Cʻ\Sigma ʻQ\in &P\,\overline{\text{smor smor}}\,Q.\supset .\\ &(T\parallel \text{Cnv}ʻT\dagger )\upharpoonright Cʻ\Pi ʻQ\in (\Pi ʻP)\overline{\text{smor}} (\Pi ʻQ)\\ [*172·42·421]\end{align}$

*172·44. $\vdash :P\text{ sm }\text{smor}Q.\supset .\Pi ʻP\,\text{smor}\,\Pi ʻQ \quad[*172·42]$

*172·45. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in \text{Rel}^{2}\text{excl}.\exists !P\,\overline{\text{smor}}\,Q\cap &\text{Rl}ʻ\text{smor}.\supset .\\ &\Pi ʻP\text{smor}\Pi ʻQ\\ [*164·44 . *172·44]\end{align}$

The following proposition shows that if two relations have the same field, and if the parts of them that are contained in diversity are the same, they have the same product. Thus e.g. $\PiʻP_{\text{po}}=\Pi ʻP_{*}$ , in virtue of *91·541.

*172·5. $\vdash :CʻP=CʻQ.P\dot{\cap} J=Q\dot{\cap} J.\supset .\Pi ʻP=\Pi ʻQ$

Dem. $\begin{array}{l} \vdash .*50·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :RPS.R\neq S.\equiv .RQS.R\neq S &\qquad \text{(1)}\\ \vdash .(1).*172·11.\supset \vdash .\text{Prop} \end{array}$

*172·51. $\vdash .\Pi ʻP=\Pi ʻ(P\unicode{x228d} I\upharpoonright CʻP) \quad[*172·5]$

*172·52. $\vdash \colon\ldotp Q\in \text{ᗡ}ʻP.\supset _{Q}.(\exists R).RPQ.R\neq Q:\supset .\Pi ʻP=\Pi ʻ(P\dot{\cap} J)$

Dem. $\begin{array}{l} \vdash .*50·11. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻP\subset \text{ᗡ}ʻP\subset \text{ᗡ}ʻ(P\dot{\cap} J) &\qquad \text{(1)}\\ \vdash .*33·14.*93·101.\text{Transp}.&\supset \vdash :QPQ.\supset .Q{\sim}\in \overrightarrow{B}ʻP:\\ [\text{Transp}.*33·13] &\supset \vdash :Q\in \overrightarrow{B}ʻP.\supset .(\exists R).QPR.R\neq Q.\\ [*50·11] &\supset .Q\in Cʻ(P\dot{\cap} J) &\qquad \text{(2)}\\ \vdash .(1).(2).*93·103. &\supset \vdash :\text{Hp}.\supset .CʻP\subset Cʻ(P\dot{\cap} J).\\ [*33·265] &\supset .CʻP=Cʻ(P\dot{\cap} J) &\qquad \text{(3)}\\ \vdash .(3).*172·5.\supset \vdash .\text{Prop} \end{array}$

Thus we shall always have $\Pi ʻP=\Pi ʻ(P\dot{\cap} J)$ unless there are members of $\text{ᗡ}ʻP$ which have no referent except themselves.

In this number, we shall consider the relation between the domains of relations related by $\Pi ʻP$ , i.e. we shall consider $\text{D}^{;}\Pi ʻP$ . This relation bears to $\Pi ʻP$ a relation analogous to that which $\text{Prod}ʻ\kappa$ bears to ${\in}_{\Delta}ʻ\kappa$ . We shall denote it by " $\text{Prod}ʻP$ ." When $P\in \text{Rel}^{2}\text{excl}$ , $\text{Prod}ʻP$ is like $\Pi ʻP$ , and is often more convenient than $\Pi ʻP$ . When $P\in \text{Rel}^{2}\text{excl}$ , $\text{Prod}ʻP$ arranges the multiplicative class of $CʻʻCʻP$ by first differences, taking first differences to mean that the earliest member $Q$ of $CʻP$ for which $\mu \cap CʻQ\neq \nu \cap CʻQ$ has the $\mu$ -member earlier than the $\nu$ -member in the $Q$ -series.

The properties of $\text{Prod}ʻP$ all result immediately from those of $\Pi ʻP$ , and offer no difficulty of any kind. The most important of them are:

*173·14. $\vdash :\dot{\exists} !P.C\upharpoonright CʻP\in 1\rightarrow 1.\supset .Cʻ\text{Prod}ʻP=\text{Prod}ʻCʻʻCʻP$

I.e. if $P$ is not null, and no two members of $CʻP$ have the same field, then the field of $\text{Prod}ʻP$ is the product of the fields of $CʻP$ . Observe that $C\upharpoonright CʻP\in 1\rightarrow 1$ if $P\in \text{Rel}^{2}\text{excl}$ .

*173·16. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}.\supset .\\ &\text{Prod}ʻP\text{smor}\Pi ʻP.\text{D}\upharpoonright Cʻ\Pi ʻP\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\Pi ʻP)\end{align}$

*173·23. $\vdash :P\neq Q.\supset .\text{Prod}ʻ(P\downarrow Q)=C^{;}(P\times Q)$

*173·3. $\begin{align}\vdash :T\upharpoonright Cʻ\Sigma ʻQ\in &P\,\overline{\text{smor smor}}\,Q.\supset .\\ &T_{\in }\upharpoonright Cʻ\text{Prod}ʻQ\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻQ)\end{align}$

*173·31. $\vdash :P\,\text{smor smor}\,Q.\supset .\text{Prod}ʻP\,\text{smor}\,\text{Prod}ʻQ$

*173·11. $\begin{align}&\vdash :\mu (\text{Prod}ʻP)\nu .\equiv .(\exists M,N).M(\Pi ʻP)N.\mu =\text{D}ʻM.\nu =\text{D}ʻN\\ &[*173·1.*150·51]\end{align}$

*173·12. $\vdash .Cʻ\text{Prod}ʻP\subset \text{D}ʻʻF_{\Delta }ʻCʻP \quad[*172·12.*150·202]$

*173·121. $\vdash .Cʻ\text{Prod}ʻP=\text{D}ʻʻCʻ\Pi ʻP \quad[*173·1.*150·22]$

*173·13. $\vdash :\dot{\exists} !P.\supset .Cʻ\text{Prod}ʻP=\text{D}ʻʻF_{\Delta }ʻCʻP \quad[*172·17.*173·121]$

*173·14. $\vdash :\dot{\exists} !P.C\upharpoonright CʻP\in 1\rightarrow 1.\supset .Cʻ\text{Prod}ʻP=\text{Prod}ʻCʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*85·12.*33·5.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻʻF_{\Delta }ʻCʻP =\text{D}ʻʻ{\in}_{\Delta}ʻCʻʻCʻP.\\ [*173·13.*115·1] &\supset .Cʻ\text{Prod}ʻP=\text{Prod}ʻCʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

*173·15. $\begin{align}&\vdash :\text{D}\upharpoonright F_{\Delta }ʻCʻP\in 1\rightarrow 1.\supset .\text{D}\upharpoonright Cʻ\Pi ʻP\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\Pi ʻP)\\ &[*173·1.*172·12.*151·231]\end{align}$

*173·151. $\vdash :\text{D}\upharpoonright F_{\Delta }ʻCʻP\in 1\rightarrow 1.\supset .\text{Prod}ʻP\,\text{smor}\,\Pi ʻP \quad [*173·15]$

*173·16. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}.\supset .\\ &\text{Prod}ʻP\,\text{smor}\,\Pi ʻP.\text{D}\upharpoonright Cʻ\Pi ʻP\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\Pi ʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*163·12.\supset \vdash :\text{Hp}.&\supset .F\upharpoonright CʻP\in \text{Cls}\rightarrow 1.\\ [*81·21] &\supset .\text{D}\upharpoonright F_{\Delta }ʻCʻP\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .(1).*173·151·15.\supset \vdash .\text{Prop} \end{array}$

*173·161. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.\dot{\exists} !P.\supset .Cʻ\text{Prod}ʻP=\text{Prod}ʻCʻʻCʻP\\ &[*173·14.*163·14]\end{align}$

*173·17. $\vdash :\dot{\exists} !\text{Prod}ʻP.\supset .sʻCʻ\text{Prod}ʻP=Cʻ\Sigma ʻP$

Dem. $\begin{array}{l} \vdash .*173·13. \supset \vdash :\text{Hp}.\supset .sʻCʻ\text{Prod}ʻP&=sʻ\text{D}ʻʻF_{\Delta }ʻCʻP\\ [*41·43.*80·42] &=\text{D}ʻF\upharpoonright CʻP\\ [*37·401.*162·23] &=Cʻ\Sigma ʻP:\supset \vdash .\text{Prop} \end{array}$

*173·2. $\vdash .\text{Prod}ʻ\dot{\Lambda} =\dot{\Lambda} \quad[*172·13.*150·42]$

*173·21. $\vdash :\dot{\exists} !\text{Prod}ʻP.\equiv .\dot{\exists} !\Pi ʻP \quad[*173·1.*150·24.*33·12]$

Dem. $\begin{array}{l} \vdash .*172·2. \supset \vdash .\text{Prod}ʻ(P\downarrow P)&=\text{D}^{;}\downarrow P^{;}P\\ [*150·4] &=\hat{\mu} \hat{\nu} \{(\exists x,y).xPy.\mu =\text{D}ʻ(x\downarrow P).\nu =\text{D}ʻ(y\downarrow P)\}\\ [*55·16] &=\hat{\mu} \hat{\nu} \{(\exists x,y).xPy.\mu =\iota ʻx.\nu =\iota ʻy\}\\ [*150·4] &=\iota ^{;}P.\supset \vdash .\text{Prop} \end{array}$

*173·23. $\vdash :P\neq Q.\supset .\text{Prod}ʻ(P\downarrow Q)=C^{;}(P\times Q)$

Dem. $\begin{array}{l} \vdash .*172·21. &\supset \vdash :\text{Hp}.\supset .C^{;}(P\times Q)=C^{;}\dagger (Q\downarrow P)^{;}\Pi ʻ(P\downarrow Q) &\qquad \text{(1)}\\ \vdash .*80·14.*150·23. &\supset \vdash :M\in F_{\Delta }ʻCʻ(Q\downarrow P).\supset .CʻM^{;}(Q\downarrow P)=\text{D}ʻM:\\ [*55·15.*150·1] &\supset \vdash :M\in F_{\Delta }ʻCʻ(P\downarrow Q).\supset .Cʻ\dagger (Q\downarrow P)ʻM=\text{D}ʻM:\\ [*172·12] & \supset \vdash :M\in Cʻ\Pi ʻ(P\downarrow Q).\supset .Cʻ\dagger (Q\downarrow P)ʻM=\text{D}ʻM:\\ [*150·35] &\supset \vdash .C^{;}\dagger (Q\downarrow P)^{;}\Pi ʻ(P\downarrow Q)=\text{D}^{;}\Pi ʻ(P\downarrow Q) &\qquad \text{(2)}\\ \vdash .(1).(2).*173·1.\supset \vdash .\text{Prop} \end{array}$

*173·24. $\begin{align}\vdash :CʻP\cap CʻQ=\Lambda.\supset .C\upharpoonright Cʻ(P\times Q)\in &\{\text{Prod}ʻ(P\downarrow Q)\}\,\overline{\text{smor}}\,(P\times Q).\\ &\text{Prod}ʻ(P\downarrow Q)\,\text{smor}\,P\times Q\end{align}$

Dem. $\begin{array}{l} \vdash .*166·12. &\supset \vdash .C\upharpoonright Cʻ(P\times Q)=C\upharpoonright (CʻP\times CʻQ) &\qquad \text{(1)}\\ \vdash .(1).*113·148.&\supset \vdash :\text{Hp}.\supset .C\upharpoonright Cʻ(P\times Q)\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(2).*173·23.\supset \vdash .\text{Prop} \end{array}$

*173·25. $\begin{align}&\vdash :P\in \text{Rel}^{2}\text{excl}.Z{\sim}\in CʻP.CʻZ\cap Cʻ\Sigma ʻP=\Lambda.\supset .\\ &\text{Prod}ʻ(P\unicode{x21f8} Z)\,\text{smor}\,(\text{Prod}ʻP\times Z).\text{Prod}ʻ(Z\unicode{x21f7}P)\,\text{smor}\,(Z\times \text{Prod}ʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*163·451.\supset \vdash :\text{Hp}.&\supset .P\unicode{x21f8} Z\in \text{Rel}^{2}\text{excl}.\\ [*173·16] &\supset .\text{Prod}ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\Pi ʻ(P\unicode{x21f8} Z).\\ [*172·32] &\supset .\text{Prod}ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\Pi ʻPxZ.\\ [*173·16.*166·23] &\supset .\text{Prod}ʻ(P\unicode{x21f8} Z)\,\text{smor}\,\text{Prod}ʻP\times Z &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\text{Prod}ʻ(Z\unicode{x21f7}P)\,\text{smor}\,Z\times \text{Prod}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*173·26. $\begin{align}\vdash :P,Q\in \text{Rel}^{2}\text{excl}.\dot{\exists} !P.\dot{\exists} !Q.&CʻP\cap CʻQ=\Lambda.Cʻ\Sigma ʻP\cap Cʻ\Sigma ʻQ=\Lambda.\supset .\\ &\text{Prod}ʻ(P\unicode{x2909}Q)\text{smor}\text{Prod}ʻP\times \text{Prod}ʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*163·441.*173·16.\supset \vdash :\text{Hp}.&\supset .\text{Prod}ʻ(P\unicode{x2909}Q)\text{smor}\Pi ʻ(P\unicode{x2909}Q).\\ [*172·35] &\supset .\text{Prod}ʻ(P\unicode{x2909}Q)\text{smor}\Pi ʻP\times \Pi ʻQ.\\ [*173·16.*166·23]&\supset .\text{Prod}ʻ(P\unicode{x2909}Q)\text{smor}\text{Prod}ʻP\times \text{Prod}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*173·27. $\begin{align}\vdash :CʻP\cap &CʻQ=\Lambda.CʻP\cap CʻR=\Lambda.CʻQ\cap CʻR=\Lambda.\supset .\\ &\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}\,\text{smor}\,P\times Q\times R\end{align}$

Dem. $\begin{array}{l} \vdash .*173·25.\supset \vdash :\text{Hp}.R\neq P.R\neq Q.\supset .\\ &\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}\,\text{smor}\,{\text{Prod}ʻ(P\downarrow Q)}\times R.\\ [*173·24] &\supset .\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}\,\text{smor}\,P\times Q\times R &\qquad \text{(1)}\\ \vdash .*33·241.\supset \vdash :\text{Hp}.R=P.&\supset .R=\dot{\Lambda} .P=\dot{\Lambda} .\\ [*172·14.*166·13] &\supset .\Pi ʻ\{(P\downarrow Q)\unicode{x21f8} R\}=\dot{\Lambda} .P\times Q\times R=\dot{\Lambda} .\\ [*173·1.*150·42] &\supset .\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}=\dot{\Lambda} .P\times Q\times R=\dot{\Lambda} .\\ [*153·101] &\supset .\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}\text{smor}(P\times Q\times R) &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash :\text{Hp}.R=Q.&\supset .\text{Prod}ʻ\{(P\downarrow Q)\unicode{x21f8} R\}\text{smor}(P\times Q\times R) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following proposition gives a correlator of $\text{Prod}ʻP$ and $\text{Prod}ʻQ$ when we are given a double correlator of $P$ and $Q$ .

*173·3. $\begin{align}\vdash :T\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\text{smor smor}}\, &Q.\supset .\\ &T\in \upharpoonright Cʻ\text{Prod}ʻQ\in (\text{Prod}ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻQ)\end{align}$

Dem. $\begin{array}{l} \vdash .*173·11.*172·43.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\mu (\text{Prod}ʻP)\mu'.\equiv .(\in N,N').N(\Pi ʻQ)N'.\mu &=\text{D}ʻ(T\mid N\mid \text{Cnv}ʻT\dagger ).\\ \mu'&=\text{D}ʻ(T\mid N'\mid \text{Cnv}ʻT\dagger) .\\ [*37·32·321]&\equiv .(\exists N,N').N(\Pi ʻQ)N'.\mu =Tʻʻ\text{D}ʻN.\mu '=Tʻʻ\text{D}ʻN'.\\ [*173·11] &\equiv .(\exists \nu ,\nu').\nu (\text{Prod}ʻQ)\nu'.\mu =Tʻʻ\nu .\mu'=Tʻʻ\nu'.\\ [*37·101] &\equiv .\mu (T_{\in }^{;}\text{Prod}ʻQ)\mu' &\qquad \text{(1)}\\ \vdash .*173·17.&\supset \vdash .sʻCʻ\text{Prod}ʻQ\subset Cʻ\Sigma ʻQ &\qquad \text{(2)}\\ [*111·12] &\supset \vdash .(T\upharpoonright Cʻ\Sigma ʻQ)_\in \upharpoonright Cʻ\text{Prod}ʻQ=T_{\in }\upharpoonright Cʻ\text{Prod}ʻQ &\qquad \text{(3)}\\ \vdash .(2).(3).*72·451.&\supset \vdash :\text{Hp}.\supset .T_{\in }\upharpoonright Cʻ\text{Prod}ʻQ\in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .(1).(4).*151·231.\supset \vdash .\text{Prop} \end{array}$

*173·31. $\vdash :P\,\text{smor smor}\,Q.\supset .\text{Prod}ʻP\,\text{smor}\,\text{Prod}ʻQ \quad[*173·3]$

*173·32. $\vdash :R\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1.Cʻ\Sigma ʻQ\subset \text{ᗡ}ʻR.\supset .\text{Prod}ʻR\dagger ^{;}Q=R_\in ^{;}\text{Prod}ʻQ$

Dem. $\begin{array}{l} \vdash .*164·18.\supset \vdash :\text{Hp}.&\supset .R\upharpoonright Cʻ\Sigma ʻQ\in (R\dagger ^{;}Q)\,\overline{\text{smor smor}}\, Q.\\ [*173·3] &\supset .R_{\in }\upharpoonright Cʻ\text{Prod}ʻQ\in (\text{Prod}ʻR\dagger ^{;}Q)\,\overline{\text{smor}}\,(\text{Prod}ʻQ).\\ [*151·22] &\supset .\text{Prod}ʻR\dagger ^{;}Q=R_{\in }^{;}\text{Prod}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*173·33. $\vdash :\text{D}\upharpoonright Cʻ\Sigma ʻQ\in 1\rightarrow 1.\supset .\text{Prod}ʻ\text{D}\dagger ^{;}Q=\text{D}_{\in }^{;}\text{Prod}ʻQ \quad\left[*173·32 \frac{\text{D}}{R}\right].$

The above proposition is used in proving the associative law for " $\text{Prod}$ " (*174·401).

In the present number, we have to prove the associative law for $\Pi$ and for $\text{Prod}$ , i.e. we have to prove (with a suitable hypothesis) $\Pi ʻ\Pi ^{;}P\text{smor}\Pi ʻ\Sigma ʻP$ and $\text{Prod}ʻ\text{Prod}^{;}P\text{smor}\text{Prod}ʻ\Sigma ʻP$ .

The first of these requires $P\in \text{Rel}^{2}\text{excl}$ and either $P\,\unicode{x2abd}\, J$ or $QPQ.\supset _{Q}.CʻQ\in 0\cup 1;$ the second requires not only this, but also $\Sigma ʻP\in\text{Rel}^{2}\text{excl}$ . When both $P$ and $\SigmaʻP$ are relations of mutually exclusive relations, we call $P$ an arithmetical relation, which we denote by " $\text{Rel}^{3}\text{arithm}$ ." Arithmetical relations serve exactly analogous purposes to those served by arithmetical classes in cardinal arithmetic.

The proof of the associative law for $\Pi$ consists in showing that, under a suitable hypothesis, $\dot{s} \mid \text{D}$ (with its converse domain limited) is a correlator of $\Pi ʻ\Sigma ʻP$ and $\Pi ʻ\Pi ^{;}P$ (*174·221 ·23). To prove this, we first prove

*174·17. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=Cʻ\Pi ʻ\Sigma ʻP$

*174·19. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1$

This gives what we may call the cardinal part of the proof, i.e. it shows that $(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P$ is a cardinal correlator of the fields of $\Pi ʻ\Sigma ʻP$ and $\Piʻ\Pi ^{;}P$ . We then prove that if $M$ and $N$ belong to the field of $\Pi ʻ\Pi ^{;}P$ , they have the relation $\Pi ʻ\Pi ^{;}P$ when the relational sums of their domains have the relation $\Pi ʻ\Sigma ʻP$ . Here, in addition to the hypothesis $P\in \text{Rel}^{2}\text{excl}$ , we require that if any relation $Q$ has the relation $P$ to itself, then $CʻQ$ is not to have more than one term. Thus we have

*174·215. $\begin{align}&\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset :\\ &M(\Pi ʻ\Pi ^{;}P)N.\equiv .M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP.(\dot{s} ʻ\text{D}ʻM)(\Pi ʻ\Sigma ʻP)(\dot{s} ʻ\text{D}ʻN)\end{align}$

The hypothesis $QPQ.\supset _{Q}.CʻQ\in 0\cup 1$ is verified if $P\,\unicode{x2abd}\, J$ (*174·216); thus for most purposes it is more convenient to substitute the simpler hypothesis $P\,\unicode{x2abd}\, J$ for $QPQ.\supset _{Q}.CʻQ\in 0\cup 1$ . We shall, however, have occasion to use the hypothesis $QPQ.\supset _{Q}.CʻQ\in 0\cup 1$ in *182·42 ·43 ·431, where our $P$ is a relation whose field consists entirely of relations of the form $Q\downarrow Q$ , whose[Pg 448] fields are always unit classes, so that our $P$ satisfies the above hypothesis even if $P$ is not contained in $J$ .

*174·2. $\vdash :P\in \text{Rel}^{2}\text{excl}.Q\in CʻP.M\in Cʻ\Pi ʻ\Pi ^{;}P.\supset .Mʻ\Pi ʻQ=(\dot{s} ʻ\text{D}ʻM)\upharpoonright CʻQ$

*174·221. $\begin{align}&\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset .\\ &\Pi ʻ\Sigma ʻP=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P.(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in (\Pi ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\Pi ʻ\Pi ^{;}P)\end{align}$

*174·23. $\begin{align}\vdash :&P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\\ &\Pi ʻ\Sigma ʻP=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P.(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in (\Pi ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\Pi ʻ\Pi ^{;}P)\end{align}$

To prove the associative law for $\text{Prod}$ , i.e. $P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\Sigma ʻP \,\text{smor} \text{Prod}ʻ\text{Prod}^{;}P,$ we observe that, since $\Pi ʻ\Sigma ʻP=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi^{;}P$ (*174·23) $=\dot{s} ^{;}\text{Prod}ʻ\Pi ^{;}P,\, \text{by the definition of Prod},$ we have (*174·41) $\text{Prod}ʻ\Sigma ʻP=\text{D}^{;}\dot{s}^{;}\text{Prod}ʻ\Pi ^{;}P$ $\begin{aligned} &=s^{;}\text{D}_{\in }^{;}\text{Prod}ʻ\Pi ^{;}P, &&\quad\text{by *41·33},\\ &=s^{;}\text{Prod}ʻ\text{D}\dagger ^{;}\Pi ^{;}P, &&\quad\text{by *173·33},\\ &=s^{;}\text{Prod}ʻ\text{Prod}^{;}P, &&\quad\text{by the definition of Prod}. \end{aligned}$ Also $s\upharpoonright Cʻ\text{Prod}ʻ\text{Prod}^{;}P\in 1\rightarrow 1$ , by *115·46. Hence the associative law follows (*174·43). It will be observed that in this case the correlator is simply s with its converse domain limited (*174·42).

As in the case of $\Pi$ , " $P\,\unicode{x2abd}\, J$ " is a stronger hypothesis than we really need: what we need is $QPQ.\supset_{Q}.CʻQ\in 0\cup 1$ .

*174·01. $\text{Rel}^{3}\text{arithm}=\hat{P} (P,\Sigma ʻP\in \text{Rel}^{2}\text{excl}) \quad\text{Df}$

*174·12. $\vdash :C\upharpoonright CʻP\in 1\rightarrow 1.\supset .\Pi ^{;}P\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*150·202.\supset \\ \vdash :M,N\in Cʻ\Pi ^{;}P.\exists !CʻM\cap CʻN.&\supset .M,N\in \Pi ʻʻCʻP.\exists !CʻM\cap CʻN.\\ [*37·6] &\supset .(\exists Q,R).Q,R\in CʻP.M=\Pi ʻQ.N=\Pi ʻR.\exists !CʻM\cap CʻN.\\ [*172·12] &\supset .(\exists Q,R).Q,R\in CʻP.M=\Pi ʻQ.N=\Pi ʻR.\exists !F_{\Delta }ʻCʻQ\cap F_{\Delta }ʻCʻR.\\ [*80·82.\text{Transp}] &\supset .(\exists Q,R).Q,R\in CʻP.M=\Pi ʻQ.N=\Pi ʻR.CʻQ=CʻR &\qquad \text{(1)}\\ \vdash .(1).*71·59.\supset \vdash \colon\ldotp \text{Hp}.&\supset : M,N\in Cʻ\Pi ^{;}P.\exists !CʻM\cap CʻN.\supset .(\exists Q,R).Q=R.M=\Pi ʻQ.N=\Pi ʻR.\\ [*13·195·172] &\supset .M=N &\qquad \text{(2)}\\ \vdash .(2).*163·11.\supset \vdash .\text{Prop} \end{array}$

*174·13. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\Pi ^{;}P\in \text{Rel}^{2}\text{excl} \quad[*174·12.*163·14]$

*174·16. $\vdash :\dot{\exists} !P.\supset .Cʻ\Pi ʻ\Pi ^{;}P=F_{\Delta }ʻ\Pi ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*150·25.\supset \vdash :\text{Hp}.&\supset .\dot{\exists} !\Pi ^{;}P.\\ [*172·17] \supset .Cʻ\Pi ʻ\Pi ^{;}P&=F_{\Delta }ʻCʻ\Pi ^{;}P\\ [*150·22] &=F_{\Delta }ʻ\Pi ʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

*174·161. $\begin{align}\vdash :\dot{\exists} !P.P\in &\text{Rel}^{2}\text{excl}.\supset .\\ &Cʻ\text{Prod}ʻ\Pi ^{;}P= \text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=\text{Prod}ʻF_{\Delta }ʻʻCʻʻCʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*173·121. &\supset \vdash .Cʻ\text{Prod}ʻ\Pi ^{;}P=\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P &\qquad \text{(1)}\\ \vdash .*173·161. \supset \vdash :\text{Hp}.\supset .Cʻ\text{Prod}ʻ\Pi ^{;}P&=\text{Prod}ʻCʻʻCʻ\Pi ^{;}P\\ [*150·22] &=\text{Prod}ʻCʻʻ\Pi ʻʻCʻP &\qquad \text{(2)}\\ \vdash .*172·17. &\supset \vdash :\dot{\Lambda} {\sim}\in CʻP.\supset .Cʻʻ\Pi ʻʻCʻP=F_{\Delta }ʻʻCʻʻCʻP &\qquad \text{(3)}\\ \vdash .*172·14.*173·21. &\supset \vdash :\dot{\Lambda} \in CʻP.\supset .Cʻ\text{Prod}ʻ\Pi ^{;}P=\Lambda &\qquad \text{(4)}\\ \vdash .*80·26.*83·11. &\supset \vdash :\dot{\Lambda} \in CʻP.\supset .\text{Prod}ʻF_{\Delta }ʻʻCʻʻCʻP=\Lambda &\qquad \text{(5)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\dot{\Lambda} {\sim}\in CʻP.\supset .Cʻ\text{Prod}ʻ\Pi ^{;}P=\text{Prod}ʻF_{\Delta }ʻʻCʻʻCʻP &\qquad \text{(6)}\\ \vdash .(4).(5). &\supset \vdash :\text{Hp}.\dot{\Lambda} \in CʻP.\supset .Cʻ\text{Prod}ʻ\Pi ^{;}P=\text{Prod}ʻF_{\Delta }ʻʻCʻʻCʻP &\qquad \text{(7)}\\ \vdash .(1).(6).(7).\supset \vdash .\text{Prop} \end{array}$

*174·162. $\vdash :\dot{\exists} !P.P\in \text{Rel}^{2}\text{excl}.\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=Cʻ\Pi ʻ\Sigma ʻP=F_{\Delta }ʻCʻ\Sigma ʻP$

Dem. $\begin{array}{l} \vdash .*174·161.*115·1. \supset \vdash :\text{Hp}.\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P&=\dot{s}ʻʻ\text{D}ʻʻ{\in}_{\Delta}ʻF_{\Delta }ʻʻCʻʻCʻP\\ [*85·27.*163·16] &=F_{\Delta }ʻsʻCʻʻCʻP\\ [*162·22] & =F_{\Delta }ʻCʻ\Sigma ʻP &\qquad \text{(1)}\\ \vdash .(1).*172·17. &\supset \vdash :\text{Hp}.\dot{\exists} !\Sigma ʻP.\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=Cʻ\Pi ʻ\Sigma ʻP &\qquad \text{(2)}\\ \vdash .*162·45. \supset \vdash :\text{Hp}.\Sigma ʻP=\dot{\Lambda} .&\supset .P=\dot{\Lambda} \downarrow \dot{\Lambda} .\\ [*172·13.*150·71] &\supset .\Pi ^{;}P=\dot{\Lambda} \downarrow \Lambda.\\ [*172·14] &\supset .\Pi ʻ\Pi ^{;}P=\dot{\Lambda} .\\ [*33·241] &\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=\Lambda &\qquad \text{(3)}\\ \vdash .*172·13.*33·241.\supset \vdash :\Sigma ʻP=\dot{\Lambda} .&\supset .Cʻ\Pi ʻ\Sigma ʻP=\Lambda &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\text{Hp}.\Sigma ʻP=\dot{\Lambda} .\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=Cʻ\Pi ʻ\Sigma ʻP &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

*174·17. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=Cʻ\Pi ʻ\Sigma ʻP$

Dem. $\begin{array}{l} \vdash .*150·42.*172·13. &\supset \vdash :P=\dot{\Lambda} .\supset .\dot{s}ʻʻ\text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P=\Lambda &\qquad \text{(1)}\\ \vdash .*162·4.*172·13. &\supset \vdash :P=\dot{\Lambda} .\supset .Cʻ\Pi ʻ\Sigma ʻP=\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*174·162.\supset \vdash .\text{Prop} \end{array}$

*174·18. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{D}\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*174·12.*163·14·12.\supset \vdash :\text{Hp}.&\supset .F\upharpoonright Cʻ\Pi ^{;}P\in \text{Cls}\rightarrow 1.\\ [*81·21] &\supset .\text{D}\upharpoonright F_{\Delta }ʻCʻ\Pi ^{;}P\in 1\rightarrow 1.\\ [*172·12] &\supset .\text{D}\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1:\supset \vdash .\text{Prop} \end{array}$

*174·19. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*163·1.*35·14.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ Q,R\in CʻP.Q\neq R.&\supset _{Q,R}.F\upharpoonright CʻQ\dot{\cap} F\upharpoonright CʻR=\dot{\Lambda} .\\ [*172·191] &\supset _{Q,R}.\dot{s} ʻCʻ\Pi ʻQ\dot{\cap} \dot{s} ʻCʻ\Pi ʻR=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .(1).*33·5.*85·31 \frac{F,\PiʻʻCʻP}{P,\,\alpha}.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP.\dot{s} ʻ\text{D}ʻM=\dot{s} ʻ\text{D}ʻN.\supset .M=N:\\ [*172·12.*150·22]&\supset :M,N\in Cʻ\Pi ʻ\Pi ^{;}P.\dot{s} ʻ\text{D}ʻM=\dot{s} ʻ\text{D}ʻN.\supset .M=N\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*174·191. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\dot{s} \upharpoonright Cʻ\text{Prod}ʻ\Pi ^{;}P\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*174·19. \supset \vdash \colon\ldotp \text{Hp}.&\supset :M,N\in Cʻ\Pi ʻ\Pi ^{;}P.\dot{s} ʻ\text{D}ʻM=\dot{s} ʻ\text{D}ʻN.\supset .M=N.\\ [*30·37] &\supset .\text{D}ʻM=\text{D}ʻN:\\ [*37·63] &\supset :\mu ,\nu \in \text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P.\dot{s} ʻ\mu =\dot{s} ʻ\nu .\supset .\mu =\nu :\\ [*173·121] &\supset :\mu ,\nu \in Cʻ\text{Prod}ʻ\Pi ^{;}P.\dot{s} ʻ\mu =\dot{s} ʻ\nu .\supset .\mu =\nu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*174·2. $\vdash :P\in \text{Rel}^{2}\text{excl}.Q\in CʻP.M\in Cʻ\Pi ʻ\Pi ^{;}P.\supset .Mʻ\Pi ʻQ=(\dot{s} ʻ\text{D}ʻM)\upharpoonright CʻQ$

Dem. $\begin{array}{l} \vdash .*172·12.*150·22.\supset \vdash :\text{Hp}.&\supset .M\in F_{\Delta }ʻ\Pi ʻʻCʻP. &\qquad \text{(1)}\\ [*80·31.*33·5] &\supset .Mʻ\Pi ʻQ\in Cʻʻ\Pi ʻQ.\\ [*172·12] &\supset .Mʻ\Pi ʻQ\in F_{\Delta }ʻCʻQ.\\ [*80·14] &\supset .\text{ᗡ}ʻMʻ\Pi ʻQ=CʻQ &\qquad \text{(2)}\\ \vdash .(1).*80·3.*41·13.\supset \vdash :\text{Hp}.&\supset .Mʻ\Pi ʻQ\,\unicode{x2abd}\, \dot{s} ʻ\text{D}ʻM &\qquad \text{(3)}\\ \vdash .*174·17. \supset \vdash :\text{Hp}.&\supset .\dot{s} ʻ\text{D}ʻM\in Cʻ\Pi ʻ\Sigma ʻP.\\ [*172·12.*80·14] &\supset .\dot{s} ʻ\text{D}ʻM\in 1\rightarrow \text{Cls} &\qquad \text{(4)}\\ \vdash .(3).(4).*72·92. \supset \vdash :\text{Hp}.\supset .Mʻ\Pi ʻQ&=(\dot{s} ʻ\text{D}ʻM)\upharpoonright \text{ᗡ}ʻMʻ\Pi ʻQ\\ [(2)] &=(\dot{s} ʻ\text{D}ʻM)\upharpoonright CʻQ:\supset \vdash .\text{Prop} \end{array}$

*174·21. $\begin{align}\vdash \colon\colon P\in \text{Rel}^{2}\text{excl}.Q\in CʻP.&M,N\in Cʻ\Pi ʻ\Pi ^{;}P.\supset \colon\ldotp \\ &Mʻ\Pi ʻQ=Nʻ\Pi ʻQ.\equiv :R\in CʻQ.\supset _{R}.(\dot{s} ʻ\text{D}ʻM)ʻR=(\dot{s} ʻ\text{D}ʻN)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*71·35.*80·14.*172·12.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \\ Mʻ\Pi ʻQ=Nʻ\Pi ʻQ.&\equiv :R\in CʻQ.\supset _{R}.(Mʻ\Pi ʻQ)ʻR=(Nʻ\Pi ʻQ)ʻR:\\ [*174·2] &\equiv :R\in CʻQ.\supset _{R}.{(\dot{s} ʻ\text{D}ʻM)\upharpoonright CʻQ}ʻR={(\dot{s} ʻ\text{D}ʻN)\upharpoonright CʻQ}ʻR:\\ [*35·7] &\equiv :R\in CʻQ.\supset _{R}.(\dot{s} ʻ\text{D}ʻM)ʻR=(\dot{s} ʻ\text{D}ʻN)ʻR\colon\colon\supset \vdash .\text{Prop} \end{array}$

*174·211. $\begin{align}&\vdash \colon\colon\ldotp P\in \text{Rel}^{2}\text{excl}.\supset \colon\colon M(\Pi ʻ\Pi ^{;}P)N.\equiv \colon\ldotp \\ &M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP\colon\ldotp (\exists Q,S):Q\in CʻP.S\in CʻQ.{(Mʻ\Pi ʻQ)ʻS}S{(Nʻ\Pi ʻQ)ʻS}:\\ &TQS.T\neq S.\supset _{T}.(Mʻ\Pi ʻQ)ʻT=(Nʻ\Pi ʻQ)ʻT:\\ &RPQ.R\neq Q.T\in CʻR.\supset _{R,T}.(Mʻ\Pi ʻR)ʻT=(Nʻ\Pi ʻR)ʻT\end{align}$

Dem. $\begin{array}{l} \vdash .*172·11.*150·22.&\supset \vdash \colon\colon M(\Pi ʻ\Pi ^{;}P)N.\equiv \colon\ldotp \\ M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP\colon\ldotp (\exists Q):Q&\in CʻP.(Mʻ\Pi ʻQ)(\Pi ʻQ)(Nʻ\Pi ʻQ):\\ &RPQ.\Pi ʻR\neq \Pi ʻQ.\supset _{R}.Mʻ\Pi ʻR=Nʻ\Pi ʻR &\qquad \text{(1)}\\ \vdash .*80·31.\supset \vdash \colon\ldotp M\in F_{\Delta }ʻ\Pi ʻʻCʻP.\supset :Q\in CʻP.&\supset _{Q}.Mʻ\Pi ʻQ\in Cʻ\Pi ʻQ. &\qquad \text{(2)}\\ [*33·24] &\supset _{Q}.\dot{\exists} !\Pi ʻQ. &\qquad \text{(3)}\\ [*172·19] &\supset _{Q}.\dot{s} ʻCʻ\Pi ʻQ=F\upharpoonright CʻQ &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash :M\in F_{\Delta }ʻ\Pi ʻʻCʻP.Q,R\in &CʻP.\Pi ʻQ=\Pi ʻR.\supset .\\ &F\upharpoonright CʻQ=F\upharpoonright CʻR.\dot{\exists} !\Pi ʻQ.\dot{\exists} !\Pi ʻR.\\ [*172·141·192] &\supset .CʻQ=CʻR &\qquad \text{(5)}\\ \vdash .(5).*163·14.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp M\in F_{\Delta }ʻ&\Pi ʻʻCʻP.Q,R\in CʻP.\supset :\\ &\Pi ʻQ=\Pi ʻR.\supset .Q=R:\\ [*30·37.\text{Transp}] &\supset :\Pi ʻQ\neq \Pi ʻR.\equiv .Q\neq R &\qquad \text{(6)}\\ \vdash .*71·35.(2).*172·12.*80·14.\supset \\ \vdash \colon\colon M,N\in &F_{\Delta }ʻ\Pi ʻʻCʻP.R\in CʻP.\supset \colon\ldotp \\ &Mʻ\Pi ʻR=Nʻ\Pi ʻR.\equiv :T\in CʻR.\supset _{T}.(Mʻ\Pi ʻR)ʻT=(Nʻ\Pi ʻR)ʻT &\qquad \text{(7)}\\ \vdash .*172·11.&\supset \vdash \colon\colon(Mʻ\Pi ʻQ)(\Pi ʻQ)(Nʻ\Pi ʻQ).\equiv \colon\ldotp Mʻ\Pi ʻQ,Nʻ\Pi ʻQ\in F_{\Delta }ʻCʻQ\colon\ldotp \\ &(\exists S):S\in CʻQ.{(Mʻ\Pi ʻQ)ʻS}S{(Nʻ\Pi ʻQ)ʻS}:\\ &TQS.T\neq S.\supset _{T}.(Mʻ\Pi ʻQ)ʻT=(Nʻ\Pi ʻQ)ʻT &\qquad \text{(8)}\\ \vdash .(1).(2).(6).(7).(8).\supset \vdash .\text{Prop} \end{array}$

*174·212. $\begin{align}&\vdash \colon\colon\ldotp P\in \text{Rel}^{2}\text{excl}.\supset \colon\colon M(\Pi ʻ\Pi ^{;}P)N.\equiv \colon\ldotp \\ &M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP\colon\ldotp (\exists Q, S):Q\in CʻP.S\in CʻQ.{(\dot{s} ʻ\text{D}ʻM)ʻS}S\{(\dot{s} ʻ\text{D}ʻN)ʻS\}:\\ &TQS.T\neq S.\supset _{T}.(\dot{s} ʻ\text{D}ʻM)ʻT=(\dot{s} ʻ\text{D}ʻN)ʻT:\\ &RPQ.R\neq Q.T\in CʻR.\supset _{R,T}.(\dot{s} ʻ\text{D}ʻM)ʻT=(\dot{s} ʻ\text{D}ʻN)ʻT\\ &[*174·2·211.*35·7]\end{align}$

*174·213. $\begin{align}\vdash \colon\ldotp &RPQ.S\in CʻQ.T\in CʻR.S\neq T.\supset _{Q,R,S,T}.R\neq Q:P\in \text{Rel}^{2}\text{excl}:\supset :\\ &RPQ.S\in CʻQ.T\in CʻR.R\neq Q.\equiv .RPQ.S\in CʻQ.T\in CʻR.S\neq T\end{align}$

Dem. $\begin{array}{l} \vdash .*163·1.&\supset \vdash \colon\ldotp \text{Hp}.\supset :RPQ.R\neq Q.S\in CʻQ.T\in CʻR.\supset .S\neq T &\qquad \text{(1)}\\ \vdash .*11·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :RPQ.S\in CʻQ.T\in CʻR.S\neq T.\supset .R\neq Q &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*174·214. $\begin{align}&\vdash \colon\colon P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset \colon\ldotp \\ &(\exists Q):Q\in CʻP:TQS.T\neq S.\lor.(\exists R).RPQ.R\neq Q.S\in CʻQ.T\in CʻR:\equiv .\\ &T(\Sigma ʻP)S.T\neq S\end{align}$

Dem. $\begin{array}{l} \vdash .*52·41.\supset \vdash \colon\ldotp \text{Hp}.&\supset :S,T\in CʻQ.S\neq T.\supset .{\sim}(QPQ):\\ [*13·12.\text{Transp}] &\supset :RPQ.S\in CʻQ.T\in CʻR.S\neq T.\supset .Q\neq R &\qquad \text{(1)}\\ \vdash .(1).*174·213.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp RPQ.S\in CʻQ.T\in CʻR.R\neq Q.\equiv .RPQ.S\in CʻQ.T\in CʻR.S\neq T\colon\ldotp \\ [*4·37.*11·341]\supset \colon\ldotp \\ &(\exists Q).Q\in CʻP.TQS.T\neq S.\lor.(\exists Q,R).RPQ.S\in CʻQ.T\in CʻR.R\neq Q:\equiv :\\ &(\exists Q).Q\in CʻP.TQS.T\neq S.\lor.(\exists Q,R).RPQ.S\in CʻQ.T\in CʻR.T\neq S:\\ [*162·13] &\equiv :T(\Sigma ʻP)S.T\neq S &\qquad \text{(2)}\\ \vdash .(2).*33·17.\supset \vdash .\text{Prop} \end{array}$

*174·215. $\begin{align}\vdash \colon\ldotp &P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset :\\ &M(\Pi ʻ\Pi ^{;}P)N.\equiv .\mu ,N\in F_{\Delta }ʻ\Pi ʻʻCʻP.(\dot{s} ʻ\text{D}ʻM )(\Pi ʻ\Sigma ʻP )(\dot{s} ʻ\text{D}ʻN)\end{align}$

Dem. $\begin{array}{l} \vdash .*174·212·214.&\supset \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon M(\Pi ʻ\Pi ^{;}P)N.\equiv \colon\ldotp \\ &M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP\colon\ldotp (\exists Q,S):Q\in CʻP.S\in CʻQ.\{(\dot{s} ʻ\text{D}ʻM)ʻS\}S\{(\dot{s} ʻ\text{D}ʻN)ʻS\}:\\ &T(\Sigma ʻP)S.T\neq S.\supset _{T}.(\dot{s} ʻ\text{D}ʻM)ʻT=(\dot{s} ʻ\text{D}ʻN)ʻT &\qquad \text{(1)}\\ \vdash .*172·13.*152·42.&\supset \vdash :M(\Pi ʻ\Pi ^{;}P)N.\supset .\dot{\exists} !P.\\ [*172·162] &\supset .\dot{s} ʻ\text{D}ʻM,\dot{s} ʻ\text{D}ʻN\in F_{\Delta }ʻCʻ\Sigma ʻP &\qquad \text{(2)}\\ \vdash .*162·22.&\supset \vdash :(\exists Q).Q\in CʻP.S\in CʻQ.\equiv .S\in Cʻ\Sigma ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*172·11.\supset \vdash .\text{Prop} \end{array}$

*174·216. $\vdash \colon\ldotp P\,\unicode{x2abd}\, J.\supset :QPQ.\supset _{Q}.CʻQ\in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*50·24.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(Q).{\sim}(QPQ):\\ [*10·53] &\supset :QPQ.\supset _{Q}.CʻQ\in 0\cup 1\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*174·22. $\begin{align}\vdash \colon\ldotp &P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset :\\ &M(\Pi ʻ\Pi ^{;}P)N.\equiv .M,N\in F_{\Delta }ʻ\Pi ʻʻCʻP.(\dot{s} ʻ\text{D}ʻM)(\Pi ʻ\Sigma ʻP)(\dot{s} ʻ\text{D}ʻN)\\ &[*174·215·216]\end{align}$

*174·221. $\begin{align}\vdash \colon\ldotp &P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset .\\ &\Pi ʻ\Sigma ʻP=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P .(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P \in (\Pi ʻ\Sigma ʻP )\,\overline{\text{smor}}\,(\Pi ʻ\Pi ^{;}P )\end{align}$

Dem. $\begin{array}{l} \vdash .*174·215.*150·41.\supset \\ \vdash :\text{Hp} .T&=(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P.\supset .\Pi ʻ\Pi ^{;}P =\breve{T} ^{;}\Pi ʻ\Sigma ʻP &\qquad \text{(1)}\\ \vdash .*174·19. &\supset \vdash :\text{Hp}(1).\supset .T\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*174·17. &\supset \vdash :\text{Hp}(1).\supset .\text{D}ʻT=Cʻ\Pi ʻ\Sigma ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*151·11.\supset \vdash :\text{Hp}(1).&\supset .\breve{T} \in (\Pi ʻ\Pi ^{;}P)\overline{\text{smor}} (\Pi ʻ\Sigma ʻP).\\ [*151·131] &\supset .T\in (\Pi ʻ\Sigma ʻP)\overline{\text{smor}} (\Pi ʻ\Pi ^{;}P ) &\qquad \text{(4)}\\ \vdash .(4).*151.22.\supset \vdash .\text{Prop} \end{array}$

*174·23. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\Pi ʻSʻP=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P.\\ &(\dot{s} \mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in (\Pi ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\Pi ʻ\Pi ^{;}P) \quad[*174·221·216]\end{align}$

*174·231. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset .\\ &\dot{s} \upharpoonright Cʻ\text{Prod}ʻ\Pi ^{;}P\in (\Pi ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻ\Pi ^{;}P)\end{align}$

Dem. $\begin{array}{l} \vdash .*174·221.*173·1.\supset \vdash :\text{Hp}.\supset .\Pi ʻ\Sigma ʻP=\dot{s} ^{;}\text{Prod}ʻ\Pi ^{;}P &\qquad \text{(1)}\\ \vdash .(1).*174·191.*151·231.\supset \vdash .\text{Prop} \end{array}$

*174·24. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\\ &\dot{s} \upharpoonright Cʻ\text{Prod}ʻ\Pi ^{;}P\in (\Pi ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻ\Pi ^{;}P) \quad[*174·231·216]\end{align}$

*174·241. $\begin{align}\vdash \colon\ldotp P\in &\text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset .\\ &\Pi ʻ\Sigma ʻP \,\text{smor}\,\Pi ʻ\Pi ^{;}P.\Pi ʻ\Sigma ʻP \,\text{smor}\,\text{Prod}ʻ\Pi ^{;}P \quad[*174·221·231]\end{align}$

*174·25. $\begin{align}\vdash :P\in &\text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\\ &\Pi ʻ\Sigma ʻP \,\text{smor}\,\Pi ʻ\Pi ^{;}P.\Pi ʻ\Sigma ʻP \,\text{smor}\,\text{Prod}ʻ\Pi ^{;}P \quad[*174·23·24]\end{align}$

This proposition gives the associative law for $\Pi$ . It remains to prove the associative law for $\text{Prod}$ .

The following propositions are concerned with various properties of "arithmetical" relations, down to *174·4, where the proof of the associative law for $\text{Prod}$ begins.

*174·3. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\equiv .P,\Sigma ʻP\in \text{Rel}^{2}\text{excl} \quad[(*174·01)]$

*174·31. $\begin{align}\vdash \colon\ldotp P\in &\text{Rel}^{3}\text{arithm}.\equiv :Q,Q'\in CʻP.Q\neq Qʻ.\supset _{Q,Q'}.CʻQ\cap CʻQ'=\Lambda:\\ &R,R'\in Cʻ\Sigma ʻP.R\neq R'.\supset _{R,R'}.CʻR\cap CʻR'=\Lambda \quad[*174·3.*163·1]\end{align}$

*174·311. $\begin{align}\vdash \colon\ldotp P\in &\text{Rel}^{3}\text{arithm}.\equiv :Q,Q'\in CʻP.\exists !CʻQ\cap CʻQ'.\supset _{Q,Q'}.Q=Q':\\ &R,R'\in Cʻ\Sigma ʻP.\exists !CʻR\cap CʻRʻ.\supset _{R,Rʻ}.R=R' \quad[*174·3.*163·11]\end{align}$

*174·32. $\begin{align}\vdash :P\in \text{Rel}^{3}\text{arithm}.\equiv .F\upharpoonright CʻP,F\upharpoonright Cʻ\Sigma ʻP\in \text{Cls}&\rightarrow 1\\ &[*174·3.*163·12]\end{align}$

*174·321. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .C\upharpoonright CʻP,C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1 \quad[*174·3.*163·14]$

*174·322. $\vdash :P\in \text{Rel}^{3}\text{arithm}.Q,Q'\in CʻP.\exists !CʻʻCʻQ\cap CʻʻCʻQ'.\supset .Q=Q'$

Dem. $\begin{array}{l} \vdash .*37·6.\supset \vdash :\text{Hp}.&\supset .(\exists R,Rʻ).R\in CʻQ.Rʻ\in CʻQ'.CʻR=CʻR'.\\ [*174·321] &\supset .(\exists R,R').R\in CʻQ.R'\in CʻQ'.R=R'.\\ [*13·195] &\supset .\exists !CʻQ\cap CʻQ'.\\ [*174·311] &\supset .Q=Q':\supset \vdash .\text{Prop} \end{array}$

*174·33. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}$

Dem. $\begin{array}{l} \vdash .*174·322.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q,Qʻ\in CʻP.\exists !CʻʻCʻQ\cap CʻʻCʻQʻ.\supset _{Q,Qʻ}.CʻʻCʻQ=CʻʻCʻQʻ:\\ [*37·63] &\supset :\gamma ,\delta \in CʻʻʻCʻʻCʻP.\exists !\gamma \cap \delta .\supset _{\gamma ,\delta }.\gamma =\delta :\\ [*84·11] &\supset :CʻʻʻCʻʻCʻP\in \text{Cls}^{2} \text{excl} &\qquad \text{(1)}\\ \vdash .*174·3.*163·16.*162·22.\supset \vdash :\text{Hp}.&\supset .CʻʻsʻCʻʻCʻP\in \text{Cls}^{2} \text{excl}.\\ [*40·38] &\supset .sʻCʻʻʻCʻʻCʻP\in \text{Cls}^{2} \text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).*115·2.\supset \vdash .\text{Prop} \end{array}$

*174·34. $\begin{align}\vdash :P\in &\text{Rel}^{3}\text{arithm}.\equiv .\\ &CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright CʻP,C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1\end{align}$

Dem. $\begin{array}{l} \vdash .*174·321·33.\supset \\ \vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .CʻʻʻCʻʻCʻP \in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright CʻP,C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*115·2.\supset \vdash :CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.\supset .\\ sʻCʻʻʻCʻʻCʻP\in \text{Cls}^{2} \text{excl}.C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.\\ [*40·38.*162·22] \supset .CʻʻCʻ\Sigma ʻP\in \text{Cls}^{2} \text{excl}.C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.\\ [*163·17] \supset .\Sigma ʻP\in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .*37·62.\supset \vdash :Q,Qʻ\in CʻP.R\in CʻQ\cap CʻQʻ.\supset .CʻR\in CʻʻCʻQ\cap CʻʻCʻQʻ &\qquad \text{(3)}\\ \vdash .(3).*115·2.*84·11.\supset \\ \vdash :CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.Q,Qʻ\in CʻP.\exists !CʻQ\cap CʻQʻ.\supset .\\ CʻʻCʻQ=CʻʻCʻQʻ &\qquad \text{(4)}\\ \vdash .(4).*72·481.*37·421.\supset \\ \vdash :CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.\\ Q,Qʻ\in CʻP.\exists !CʻQ\cap CʻQʻ.\supset .CʻQ=CʻQʻ &\qquad \text{(5)}\\ \vdash .(5).*71·59.\supset \\ \vdash \colon\ldotp CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright Cʻ\Sigma ʻP \in 1\rightarrow 1.C\upharpoonright CʻP\in 1\rightarrow 1.\supset :\\ Q,Qʻ\in CʻP.\exists !CʻQ\cap CʻQʻ.\supset _{Q,Qʻ}.Q=Qʻ:\\ [*163·11] \supset :P\in \text{Rel}^{2}\text{excl} &\qquad \text{(6)}\\ \vdash .(2).(6).*174·3.\supset \\ \vdash :CʻʻʻCʻʻCʻP\in \text{Cls}^{3}\,\text{arithm}.C\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.C\upharpoonright CʻP\in 1\rightarrow 1.\supset \\. P\in \text{Rel}^{3}\text{arithm} &\qquad \text{(7)}\\ \vdash .(1).(7).\supset \vdash .\text{Prop} \end{array}$

*174·35. $\vdash :P\in \text{Rel}^{3}\text{arithm}.Q,Qʻ\in CʻP.Q\neq Qʻ.\supset .Cʻ\Sigma ʻQ\cap Cʻ\Sigma ʻQʻ=\Lambda$

Dem. $\begin{array}{l} \vdash .*174·3.*163·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in CʻQ.Rʻ\in CʻQʻ.\supset _{R,Rʻ}.R \neq Rʻ &\qquad \text{(1)}\\ \vdash .*162·22. &\supset \vdash \colon\ldotp \text{Hp}.\supset :R\in CʻQ.Rʻ\in CʻQʻ . \supset _{R,Rʻ}.R,Rʻ\in Cʻ\Sigma ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*174·31.\supset \vdash \colon\ldotp \text{Hp}.&\supset :R\in CʻQ.Rʻ\in CʻQʻ.\supset _{R,Rʻ}.CʻR\cap CʻRʻ=\Lambda:\\ [*40·27] &\supset :sʻCʻʻCʻQ\cap sʻCʻʻCʻQʻ=\Lambda:\\ [*162·22] &\supset :Cʻ\Sigma ʻQ\cap Cʻ\Sigma ʻQʻ=\Lambda\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*174·36. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\Sigma ^{;}P\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*174·35.*37·63.*150·22.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :R,Rʻ\in Cʻ\Sigma ^{;}P.R\neq Rʻ.\supset .CʻR\cap CʻRʻ=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*163·1.\supset \vdash .\text{Prop} \end{array}$

*174·361. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .CʻP\subset \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*162·1.&\supset \vdash :Q\in CʻP.\supset .Q\,\unicode{x2abd}\, \Sigma ʻP &\qquad \text{(1)}\\ \vdash .*174·3.&\supset \vdash :\text{Hp}.\supset .\Sigma ʻP\in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).*163·43.\supset \vdash .\text{Prop} \end{array}$

*174·362. $\vdash :P\in \text{Rel}^{3}\text{arithm} .Q,Qʻ\in CʻP.CʻʻCʻQ=CʻʻCʻQʻ.\supset .Q=Qʻ$

Dem. $\begin{array}{l} \vdash .*174·322. &\supset \vdash :\text{Hp}.\exists !CʻʻCʻQ.\supset .Q=Q' &\qquad \text{(1)}\\ \vdash .*37·45. \supset \vdash :CʻʻCʻQ=\Lambda.&\supset .CʻQ=\Lambda.\\ [*33·241] &\supset .Q=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(2).*13·172. &\supset \vdash :\text{Hp}.CʻʻCʻQ=\Lambda.\supset .Q=Q' &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*174·363. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\text{Prod}^{;}P\in \text{Rel}^{2}\text{excl}$

Dem. $\begin{array}{l} \vdash .*173·161.*174·361.*173·2.\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q,Q'\in CʻP.\exists !Cʻ\text{Prod}ʻQ\cap Cʻ\text{Prod}ʻQ'.\supset .\\ &\exists !\text{Prod}ʻCʻʻCʻQ\cap \text{Prod}ʻCʻʻCʻQ'.\\ [*115·23.*174·33] &\supset .CʻʻCʻQ=CʻʻCʻQ'.\\ [*174·362] &\supset .Q=Q'.\\ [*30·37] &\supset .\text{Prod}ʻQ=\text{Prod}ʻQ' &\qquad \text{(1)}\\ \vdash .(1).*163·11.*150·22.\supset \vdash .\text{Prop} \end{array}$

*174·4. $\begin{align}\vdash :P\in \text{Rel}^{2}\text{excl}.&P\,\unicode{x2abd}\, J.\supset .\\ &\text{Prod}ʻ\Sigma ʻP=\text{D}^{;}\dot{s} ^{;}\text{Prod}ʻ\Pi ^{;}P=s^{;}\text{D}_{\in }^{;}\text{Prod}ʻ\Pi ^{;}P\end{align}$

Dem. $\begin{array}{l} \vdash .*173·1. &\supset \vdash .\text{Prod}ʻ\Sigma ʻP=\text{D}^{;}\Pi ʻ\Sigma ʻP &\qquad \text{(1)}\\ \vdash .(1).*174·24.&\supset \vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\Sigma ʻP=\text{D}^{;}\dot{s} ^{;}\text{Prod}ʻ\Pi ^{;}P\\ [*41·43] &=s^{;}\text{D}_{\in }^{;}\text{Prod}ʻ\Pi ^{;}P:\supset \vdash .\text{Prop} \end{array}$

*174·401. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}^{;}P=\text{D}_{\in }^{;}\text{Prod}ʻ\Pi ^{;}P$

Dem. $\begin{array}{l} \vdash .*80·33.*162·23.&\supset \vdash :R\in F_{\Delta }ʻCʻQ.\supset .\text{D}ʻR\subset Cʻ\Sigma ʻQ &\qquad \text{(1)}\\ \vdash .(1).&\supset \vdash :R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQʻ.\exists !\text{D}ʻR\cap \text{D}ʻR'.\supset .\\ &\exists !Cʻ\Sigma ʻQ \cap Cʻ\Sigma ʻQ' &\qquad \text{(2)}\\ \vdash .(2).*174·35.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &Q,Q'\in CʻP.R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQʻ.\text{D}ʻR=\text{D}ʻR'.\exists !\text{D}ʻR.\supset .\\ &Q=Qʻ.\\ [*81·21.*174·361.*163·12] &\supset .R=R' &\qquad \text{(3)}\\ \vdash .(3).*33·241.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q,Q'\in CʻP.R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQ'.\text{D}ʻR=\text{D}ʻR'.\supset .R=R':\\ [*172·12.*150·22] &\supset :\text{D}\upharpoonright sʻCʻʻ\Pi ʻʻCʻP\in 1\rightarrow 1:\\ [*162·22] &\supset :\text{D}\upharpoonright Cʻ\Sigma ʻ\Pi ^{;}P\in 1\rightarrow 1:\\ [*173·33] \supset :\text{D}_{\in }^{;}\text{Prod}ʻ\Pi ^{;}P&=\text{Prod}ʻ\text{D}\dagger ^{;}\Pi ^{;}P\\ [*173·1] &=\text{Prod}ʻ\text{Prod}^{;}P\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*174·41. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\Sigma ʻP=s^{;}\text{Prod}ʻ\text{Prod}^{;}P\\ &[*174·4·401]\end{align}$

*174·42. $\begin{align}\vdash :P\in &\text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\\ &s\upharpoonright (Cʻ\text{Prod}ʻ\text{Prod}^{;}P)\in (\text{Prod}ʻ\Sigma ʻP)\,\overline{\text{smor}}\,(\text{Prod}ʻ\text{Prod}^{;}P)\end{align}$

Dem. $\begin{array}{l} \vdash .*173·161·2.*174·363.\supset \\ \vdash :\text{Hp}.\supset .Cʻ\text{Prod}ʻ\text{Prod}^{;}P&\subset \text{Prod}ʻCʻʻCʻ\text{Prod}^{;}P\\ [*150·22] &\subset \text{Prod}ʻCʻʻ\text{Prod}ʻʻCʻP\\ [*173·161.*174·361] &\subset \text{Prod}ʻ\text{Prod}ʻʻCʻʻʻCʻʻCʻP &\qquad \text{(1)}\\ \vdash .(1).*174·33.*115·46.&\supset \vdash :\text{Hp}.\supset .s\upharpoonright Cʻ\text{Prod}ʻ\text{Prod}^{;}P\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(2).*174·41.*151·231.\supset \vdash .\text{Prop} \end{array}$

*174·43. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\Sigma ʻP\,\text{smor}\,\text{Prod}ʻ\text{Prod}^{;}P\\ &[*174·42]\end{align}$

*174·44. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}^{;}P=\text{D}_{\in }^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P\\ &[*174·401.*173·1]\end{align}$

*174·45. $\begin{align}\vdash :P\in &\text{Rel}^{3}\text{arithm}.\supset .\\ &(\text{D}_{\in }\mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in (\text{Prod}ʻ\text{Prod}^{;}P)\,\overline{\text{smor}}\,(\Pi ʻ\Pi ^{;}P)\end{align}$

Dem. $\begin{array}{l} \vdash .*174·18.\supset \vdash :\text{Hp}.&\supset .\text{D}\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*80·33.*162·23.\supset \\ &\vdash :R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQʻ.\exists !\text{D}ʻR\cap \text{D}ʻR'.\supset .\exists !Cʻ\Sigma ʻQ\cap Cʻ\Sigma ʻQʻ &\qquad \text{(2)}\\ \vdash .(2).*174·35.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q,Q'\in CʻP.R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQʻ.\exists \\!\text{D}ʻR.\text{D}ʻR=\text{D}ʻR'.\supset . Q=Q'.\\ [*81·21.*174·361.*163·12] &\supset .R=R' &\qquad \text{(3)}\\ \vdash .(3).*33·241.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q,Q'\in CʻP.R\in F_{\Delta }ʻCʻQ.R'\in F_{\Delta }ʻCʻQʻ.\text{D}ʻR=\text{D}ʻR'.\supset .R=R':\\ [*172·12]&\supset :Q,Q'\in CʻP.R\in Cʻ\Pi ʻQ.R'\in Cʻ\Pi ʻQʻ.\text{D}ʻR=\text{D}ʻR'.\supset .R=R' &\qquad \text{(4)}\\ \vdash .*173·161.*37·6.*173·2.\text{Transp}.\supset \\ &\vdash \colon\colon\text{Hp}.\mu ,\nu \in Cʻ\text{Prod}ʻ\Pi ^{;}P.\text{D}ʻʻ\mu =\text{D}ʻʻ\nu .\supset \colon\ldotp \\ &R\in \mu .\supset :(\exists Q):Q\in CʻP.R\in Cʻ\Pi ʻQ:\\ &(\exists Qʻ,R').Qʻ\in CʻP.R'\in Cʻ\Pi ʻQʻ.R'\in \nu .\text{D}ʻR=\text{D}ʻR':\\ [(4)] &\supset :(\exists R').R'\in \nu .R=R':\\ [*13·195] &\supset : R\in \nu &\qquad \text{(5)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp}(5).&\supset :R\in \nu .\supset .R\in \mu &\qquad \text{(6)}\\ \vdash .(5).(6).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\mu ,\nu \in Cʻ\text{Prod}ʻ\Pi ^{;}P.\text{D}ʻʻ\mu =\text{D}ʻʻ\nu .\supset .\mu =\nu :\\ [*71·55] &\supset :\text{D}_{\in }\upharpoonright Cʻ\text{Prod}ʻ\Pi ^{;}P\in 1\rightarrow 1:\\ [*150·22.*173·1] &\supset :\text{D}_{\in }\upharpoonright \text{D}ʻʻCʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1 &\qquad \text{(7)}\\ \vdash .(1).(7).*35·481.&\supset \vdash :\text{Hp}.\supset .(\text{D}_{\in }\mid \text{D})\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P\in 1\rightarrow 1 &\qquad \text{(8)}\\ \vdash .(8).*174·44.\supset \vdash .\text{Prop} \end{array}$

*174·46. $\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\text{Prod}ʻ\text{Prod}^{;}P\,\text{smor}\,\Pi ʻ\Pi ^{;}P \quad[*174·45]$

*174·461. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\text{Prod}^{;}P\text{smor}\Pi ʻ\Sigma ʻP\\ &[*174·46·25]\end{align}$

*174·462. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.\supset .\Pi ʻ\text{Prod}^{;}P\,\text{smor}\,\text{Prod}ʻ\text{Prod}^{;}P\\ &[*174·363 . *173·16]\end{align}$

*174·47. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\\ &\text{Prod}ʻ\Sigma ʻP=s^{;}\text{Prod}ʻ\text{Prod}^{;}P=s^{;}\text{D}_{\in }^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}P=\text{D}^{;}\dot{s} ^{;}\text{Prod}ʻ\Pi ^{;}P.\\ &s\upharpoonright Cʻ\text{Prod}ʻ\text{Prod}^{;}P,s\mid \text{D}_{\in }\mid \text{D}\upharpoonright Cʻ\Pi ʻ\Pi ^{;}P,\text{D}\mid \dot{s} \upharpoonright Cʻ\text{Prod}ʻ\Pi ^{;}P\in 1\rightarrow 1\\ &[*174·42·45·24.*41·43]\end{align}$

*174·48. $\begin{align}&\vdash :P\in \text{Rel}^{3}\text{arithm}.P\,\unicode{x2abd}\, J.\supset .\\ \text{Nr}ʻ\text{Prod}ʻ\text{Prod}^{;}P&=\text{Nr}ʻ\text{Prod}ʻ\Sigma ʻP=\text{Nr}ʻ\Pi ʻ\Sigma ʻP=\text{Nr}ʻ\Pi ʻ\Pi ^{;}P\\ &=\text{Nr}ʻ\text{Prod}ʻ\Pi ^{;}P=\text{Nr}ʻ\Pi ʻ\text{Prod}^{;}P\\ &[*174·43·46·25·462.*152·321]\end{align}$

The definition of exponentiation is framed on the analogy of the definition in cardinals, i.e. we put $P\,\,\text{exp}\,\,Q=\text{Prod}ʻP\downarrow_{,.}^{;}Q \quad\text{Df}.$ We put also, what is often a more convenient form, $P^{Q}=\dot{s} ^{;}(P\,\,\text{exp}\,\,Q) \quad\text{Df}.$

The relation $P^{Q}$ has for its field (unless $Q=\dot{\Lambda}$ ) the class of Cantor's "Belegungen," i.e. the class $(CʻP\uparrow CʻQ)_{\Delta }ʻCʻQ$ . It arranges these by a form of the principle of first differences, namely as follows : Suppose $M$ and $N$ are two members of $(CʻP\uparrow CʻQ)_{\Delta }ʻCʻQ$ , and suppose there is in $CʻQ$ a term $y$ for which the $M$ -representative $(Mʻy)$ precedes the $N$ -representative $(Nʻy)$ , i.e. for which $(Mʻy)P(Nʻy)$ , and suppose further that all terms in $CʻQ$ which are earlier than $y$ , i.e. for which $zQy.z\neq y$ , have their $M$ -representative and their $N$ -representative identical; in this case we say that $M$ has to $N$ the relation $P^{Q}$ . This may be stated as follows, provided we assume that $P$ and $Q$ are series: Let $M$ and $N$ be two one-valued functions whose possible arguments are all the members of $CʻQ$ , while their values are some or all of the members of $CʻP$ . Then we say that $M$ has to $N$ the relation $P^{Q}$ if the first argument for which the two functions do not have the same value gives an earlier value to $M$ than to $N$ .

Thus for example let $P$ be the series $a_{1}$ , $a_{2}$ , $a_{3}$ , $a_{4}$ , $a_{5}$ , and let $Q$ be the series $b_{1}$ , $b_{2}$ , $b_{3}$ , $b_{4}$ . Then $M$ and $N$ are to be such that $Mʻb$ or $Nʻb$ is defined when, and only when, $b$ is $b_{1}$ or $b_{2}$ or $b_{3}$ or $b_{4}$ , and the value of $Mʻb$ or $Nʻb$ is $a_{1}$ or $a_{2}$ or $a_{3}$ or $a_{4}$ or $a_{5}$ . Then if $Mʻb_{1} = a_{1}$ and $Nʻb_{1} \neq a_{1}$ , $M$ precedes $N$ ; if $Mʻb_{1} = Nʻb_{1} = a_{1}$ , and $Mʻb_{2} = a_{1} . Nʻb_{2} \neq a_{1}$ , $M$ precedes $N$ ; and so on. Thus in this case the first term of the series generated by $P^{Q}$ is the one for which $Mʻb = a_{1}$ when $b$ has any of the values $b_{1}$ , $b_{2}$ , $b_{3}$ , $b_{4}$ . Thus the first term of the series is $\iota ʻa_{1}\uparrow CʻQ$ , i.e. $\iota ʻBʻP\uparrow CʻQ$ . The next term will be $\begin{aligned} \iota ʻa_{1}\uparrow &(\iota ʻb_{1}\cup \iota ʻb_{2}\cup \iota ʻb_{3})\unicode{x228d} \iota ʻa_{2}\uparrow \iota ʻb_{4},\\ \textit{i.e.}\quad &\iota ʻBʻP\uparrow \text{D}ʻQ\unicode{x228d} 2_{P}\downarrow BʻQ. \end{aligned}$ [Pg 459] The next is $\iota ʻBʻP\uparrow \text{D}ʻQ\unicode{x228d}3_{P}\downarrow Bʻ\breve{Q}$ , and so on. This makes it evident that our series has the structure required of a series which is to represent the $Q$ th power of $P$ .

The two relations $P\,\,\text{exp}\,\,Q$ and $P^{Q}$ are ordinally similar, since $\dot{s}$ is one-one when its field is limited to $Cʻ(P\,\,\text{exp}\,\,Q)$ . This follows from *116·131, together with $\dot{\exists} !Q.\supset .Cʻ(P\,\,\text{exp}\,\,Q)=(CʻP)\,\,\text{exp}\,\,(CʻQ).$

If $S$ is a correlator of $P$ and $P'$ , and $T$ is a correlator of $Q$ and $Q'$ , then $(S \parallel \breve{T} )_{\in }$ and $(S\parallel \breve{T})$ , with their converse domains limited, are respectively correlators of $(P\,\,\text{exp}\,\,Q)$ with $(Pʻ\,\,\text{exp}\,\,Qʻ)$ and of $P^{Q}$ with $Pʻ^{Qʻ}$ . This shows that the relation-number of $(P\,\,\text{exp}\,\,Q)$ depends only upon those of $P$ and $Q$ , which is of course essential if $(P\,\,\text{exp}\,\,Q)$ is to afford a definition of exponentiation.

If the multiplicative axiom is assumed, then if $R$ is a relation which is like $Q$ , and whose field consists of relations which are like $P$ , and $R\in \text{Rel}^{2}\text{excl}$ , the product of $R$ is like $(P\,\text{exp}\,\,Q)$ . That is, if we put $\mu =\text{Nr}ʻP.\nu =\text{Nr}ʻQ$ , so that $R$ consists of $\nu$ terms each of which has $\mu$ terms, the product of $R$ has $\mu ^\nu$ terms. This gives the connection of multiplication with exponentiation.

There are two formal laws of exponentiation which hold for relation-numbers, namely $\begin{aligned} P^{Q}&\times P^{R}\text{smor}P^{Q\unicode{x2909}R}\\ \text{and}\quad &(P^{Q})^{R}\text{smor}P^{R\times Q}. \end{aligned}$ They both need a hypothesis: the first needs $\dot{\exists} !Q.\dot{\exists} !R.CʻQ\cap CʻR=\Lambda,$ while the second needs $R\,\unicode{x2abd}\, J$ because it is proved by means of the associative law (*174·43).

The first of the above formal laws can be generalized, by putting $\Sigma ʻS$ in place of $Q\unicode{x2909}R$ , and taking the product of the various powers $P\,\text{exp}\,\,Q,\quad P\,\text{exp}\,\,Q', ...,$ where $Q$ , $Q'$ , ... $\in CʻS$ , and the products are taken in the order determined by $S$ . The resulting generalization is $S\in \text{Rel}^{2}\text{excl}.S\,\unicode{x2abd}\, J.\supset .\{\text{Prod}ʻ(P \,\text{exp}\,\,)^{;}S\}\text{smor}\{P\,\text{exp}\,\,(\Sigma ʻS)\}.$

The proof of the second of the formal laws is more difficult. We observe, to begin with, that $P\,\text{exp}\,\,(R\times Q)=\text{Prod}ʻP\downarrow_{.,} ^{;}\Sigma ʻQ\downarrow_{.,} ^{;}R.$

Assuming suitable hypotheses, this, by *162·35, $=\text{Prod}ʻ\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R,$ which is like $\text{Prod}ʻ\text{Prod}^{;}(P\downarrow_{.,})\dagger ^{;}Q\downarrow_{.,} ^{;}R$ , by *174·43. But $(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R=\text{Prod}ʻ{\text{Prod}ʻP\downarrow_{.,}^{;}Q}\downarrow_{.,} ^{;}R$ . Thus our result will follow if we can prove $\{\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\}\,\text{smor smor}\,\{(\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\downarrow_{.,} ^{;}R\}.$ Now one member of the field of $\text{Prod}^{;}(P\downarrow_{.,})\dagger ^{;}Q\downarrow_{.,} ^{;}R$ will be $\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z,\, \text{where}\, z\in CʻR.$

This is like $\text{Prod}ʻP\downarrow_{.,} ^{;}Q$ , because $Q\downarrow_{.,} z\,\text{smor}\,Q$ . Hence $\text{Prod}^{;}(P\downarrow_{.,})\dagger ^{;}Q\downarrow_{.,}^{;}R$ is a series of terms each of which is like $\text{Prod}ʻP\downarrow_{.,} ^{;}Q$ , and the whole series of such terms is like $R$ . If we assumed the multiplicative axiom, this would suffice to prove the result. But it is possible to obtain our result without assuming the multiplicative axiom.

For this purpose, we proceed as follows. The correlator of $\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z\, \text{and}\, \text{Prod}ʻP\downarrow_{.,} ^{;}Q$ is $\{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in }$ , by *165·361 and *172·3. Call this $Mʻz$ . Then $\begin{aligned} M\in 1\rightarrow 1:&z\in CʻR.\supset _{z}.(Mʻz)\in (\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z)\,\overline{\text{smor}}\,(\text{Prod}ʻP\downarrow_{.,} ^{;}Q):\\ &z,w\in CʻR.\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻw.\supset _{z,w}.z=w. \end{aligned}$ This, by the help of two or three lemmas, suffices to prove that $\{\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\}\,\text{smor smor}\,\{(\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\downarrow_{.,} ^{;}R\},$ whence the result follows.

*176·1. $\vdash .P\,\text{exp}\,\,Q=\text{Prod}ʻP\downarrow_{.,} ^{;}Q=\text{D}^{;}\Pi ʻP\downarrow_{.,} ^{;}Q$

*176·11. $\vdash .P^{Q}=\dot{s} ^{;}(P\,\text{exp}\,\,Q)=\dot{s} ^{;}\text{Prod}ʻP\downarrow_{.,} ^{;}Q=\dot{s} ^{;}\text{D}^{;}\Pi ʻP\downarrow_{.,} ^{;}Q$

*176·14. $\vdash :\dot{\exists} !Q.\supset .Cʻ(P\,\text{exp}\,\,Q)=(CʻP)\,\text{exp}\,\,(CʻQ).CʻP^{Q}=(CʻP\uparrow CʻQ)_{\Delta }ʻCʻQ$

*176·151. $\vdash \colon\ldotp P=\dot{\Lambda} .\lor.Q=\dot{\Lambda} :\equiv .P\,\text{exp}\,\,Q=\dot{\Lambda} .\equiv .P^{Q}=\dot{\Lambda}$

It will be observed that in relation-arithmetic, $\mu ^{0} = 0$ , whereas in cardinal arithmetic $\mu ^{0} = 1$ . The difference is due to the fact that there is no ordinal number 1 (cf. *153).

*176·182. $\vdash . (P \,\text{exp}\,\, Q)\,\text{smor}\,(\Pi ʻP \downarrow_{.,} ^{;}Q)$

*176·19. $\begin{align}\vdash \colon\colon S (P^{Q}) &T . \equiv \colon\ldotp S, T \in (CʻP \uparrow CʻQ)_\Delta ʻCʻQ\colon\ldotp \\ &(\exists y) : y \in CʻQ . (Sʻy) P (Tʻy) : yʻQy . yʻ \neq y . \supset _y . Sʻyʻ = Tʻyʻ\end{align}$

*176·2. $\begin{align}\vdash : U \upharpoonright CʻR \in P\, &\overline{\text{smor}}\, R . W \upharpoonright CʻS \in Q \overline{\text{smor}} S . \supset .\\ &(U \parallel \breve{W} )_\in \upharpoonright Cʻ(R \,\text{exp}\,\, S) \in (P \,\text{exp}\,\, Q) \,\overline{\text{smor}}\,(R \,\text{exp}\,\, S)\end{align}$

*176·21. With the same hypothesis, $(U \parallel \breve{W} ) \upharpoonright Cʻ(R^{S})$ correlates $P^{Q}$ and $R^{S}$ .

*176·22. $\vdash : P \,\text{smor}\,R . Q\,\text{smor}\,S . \supset . (P \,\text{exp}\,\, Q)\,\text{smor}\,(R \,\text{exp}\,\, S) . P^{Q} \text{smor} R^{S}$

*176·24. $\vdash \colon\ldotp \text{Mult ax} . \supset : R \in \text{Rel}^{2}\text{excl} \cap \text{Nr}ʻQ . CʻR \subset \text{Nr}ʻP . \supset . \Pi ʻR\,\text{smor}\,(P \,\text{exp}\,\, Q)$

*176·31. $\vdash : \dot{\exists} ! Q . \supset . \overrightarrow{B}ʻ(P \,\text{exp}\,\, Q) = (\overrightarrow{B}ʻP) \,\text{exp}\,\, (CʻQ)$

*176·311·32·321. Similar propositions for $\overrightarrow{B}ʻ\text{Cnv}ʻ(P \,\text{exp}\,\, Q)$ , $\overrightarrow{B}ʻ(P^{Q}), \overrightarrow{B}ʻ(\text{Cnv}ʻP^{Q})$

*176·34. $\begin{align}\vdash : \dot{\exists} ! Q . \text{E}! &BʻP . \supset .\\ &Bʻ(P \,\text{exp}\,\, Q) = (BʻP) \downarrow ʻʻCʻQ . Bʻ(P^{Q}) = ({℩}ʻBʻP) \uparrow CʻQ\end{align}$

*176·42. $\begin{align}\vdash : \dot{\exists} ! Q . \dot{\exists} ! R . CʻQ \cap &CʻR = \Lambda . \supset . P^{Q} \times P^{R}\,\text{smor}\,P^{Q \unicode{x2909} R} .\\ &(P \,\text{exp}\,\, Q) \times (P \,\text{exp}\,\, R)\,\text{smor}\,P \,\text{exp}\,\, (Q \unicode{x2909} R)\end{align}$

*176·44. $\vdash : S \in \text{Rel}^{2}\text{excl} . S \,\unicode{x2abd}\, J . \supset . \{\text{Prod}ʻ(P \,\text{exp}\,\,)^{;}S\} \, \text{smor}\, \{P \,\text{exp}\, (\Sigma ʻS)\}$

*176·57. $\begin{align}\vdash : R \,\unicode{x2abd}\, J . \supset . \{(P \,\text{exp}\, Q) \,\text{exp}\, R\}\,\text{smor}\,&\{P \,\text{exp}\,\, (R \times Q)\} .\\ &(P^{Q})^{R}\,\text{smor}\,P^{R \times Q}\end{align}$

*176·01. $P \,\text{exp}\,\, Q = \text{Prod}ʻP\downarrow_{.,} ^{;}Q \quad\text{Df}$

*176·1. $\vdash . P \,\text{exp}\,\, Q = \text{Prod}ʻP\downarrow_{.,} ^{;}Q = \text{D}^{;}\Pi ʻP\downarrow_{.,} ^{;}Q \quad[(*176·01)]$

*176·11. $\vdash . P^{Q} = \dot{s} ^{;}(P \,\text{exp}\,\, Q) = \dot{s} ^{;}\text{Prod}ʻP\downarrow_{.,} ^{;}Q = \dot{s} ^{;}\text{D}^{;}\Pi ʻP\downarrow_{.,} ^{;}Q \quad[(*176·02)]$

*176·12. $\begin{align}&\vdash \colon\colon \mu (P \,\text{exp}\,\, Q) \nu . \equiv \colon\ldotp \mu , \nu \in (CʻP) \,\text{exp}\,\, (CʻQ) \colon\ldotp \\ &(\exists y, x, x') : x \downarrow y \in \mu . x' \downarrow y \in \nu . xPx' : zQy . z \neq y . w \downarrow z \in \mu . \supset _{w, z} . w \downarrow z \in \nu \end{align}$

Dem. $\begin{array}{l} \vdash . *165·21·12 . *163·12 . &\supset \vdash . F \upharpoonright P \downarrow_{.,} ʻʻCʻQ \in \text{Cls} \rightarrow 1 . &\qquad \text{(1)}\\ [*85·1 . *115·1 . *33·5] \supset \vdash . \text{D}ʻʻF_\Delta ʻP \downarrow_{.,} ʻʻCʻQ &= \text{Prod}ʻCʻʻP \downarrow_{.,} ʻʻCʻQ\\ [*165·12·14 . (*116·01)] &= (CʻP) \,\text{exp}\,\, (CʻQ) &\qquad \text{(2)}\\ \vdash . *176·1 . *173·11 . *172·11 . *165·12 . \supset \\ \vdash \colon\colon\ldotp \mu (P \,\text{exp}\,\, Q) \nu . &\equiv \colon\colon (\exists M, N, y) \colon\ldotp M, N \in F_\Delta ʻP \downarrow_{.,} ʻʻCʻQ :\\ &y \in CʻQ . (MʻP \downarrow_{.,} y) (P \downarrow_{.,} y) (NʻP \downarrow_{.,} y) :\\ &zQy . z \neq y . \supset _z . MʻP \downarrow_{.,} z = NʻP \downarrow_{.,} z : \mu = \text{D}ʻM . \nu = \text{D}ʻN \colon\colon\\ [*81·5 . (1) . *150·6] &\equiv \colon\colon (\exists M, N, y) \colon\ldotp M, N \in F_{\Delta }ʻP\downarrow_{.,} ʻʻCʻQ . \mu = \text{D}ʻM . \nu = \text{D}ʻN :\\ &y \in CʻQ . \breve{{℩}} ʻ(\mu \cap \downarrow yʻʻCʻP)(\downarrow y^{;}P)\breve{{℩}} ʻ(\nu \cap \downarrow yʻʻCʻP) :\\ &zQy . z \neq y . \supset _{z} . \breve{{℩}} ʻ(\mu \cap \downarrow yʻʻCʻP) = \breve{{℩}} ʻ(\nu \cap \downarrow yʻʻCʻP) \colon\colon\\ [(2) . *150·55] &\equiv \colon\colon (\exists y) \colon\colon \mu , \nu \in (CʻP)\,\text{exp}\,\,(CʻQ) . y \in CʻQ \colon\ldotp (\exists x, xʻ) \colon\ldotp \\ &x \downarrow y = \breve{{℩}} ʻ(\mu \cap \downarrow yʻʻCʻP) . xʻ \downarrow y = \breve{{℩}} ʻ(\nu \cap \downarrow yʻʻCʻP) . xPxʻ :\\ &zQy . z \neq y . w \downarrow z = \breve{{℩}} ʻ(\mu \cap \downarrow zʻʻCʻP) .\\ &wʻ \downarrow z = \breve{{℩}} ʻ(\nu \cap \downarrow zʻʻCʻP) . \supset _{z, w, wʻ} . w = wʻ \colon\colon\\ [*116·11] &\equiv \colon\colon (\exists y) \colon\colon \mu , \nu \in (CʻP)\,\text{exp}\,\,(CʻQ) \colon\ldotp \\ &(\exists x, xʻ) : x \downarrow y \in \mu . xʻ \downarrow y \in \nu . xPxʻ :\\ &zQy . z \neq y . w \downarrow z \in \mu . \supset _{w, z} . w \downarrow z \in \nu \colon\colon\ldotp \supset \vdash . \text{Prop} \end{array}$

The above proposition is used in *176·19. It has the merit of giving a direct formula for $P \,\text{exp}\,\, Q$ , instead of one which proceeds by way of $\Pi ʻP\downarrow_{.,} ^{;}Q$ .

*176·13. $\vdash : \dot{\exists} ! (P \,\text{exp}\,\, Q) . \equiv . \dot{\exists} ! P^{Q} . \equiv . \dot{\exists} ! \Pi ʻP\downarrow_{.,} ^{;}Q \quad[*150·25 . *176·1·11]$

*176·131. $\vdash : Q = \dot{\Lambda} . \supset . P \,\text{exp}\,\, Q = \dot{\Lambda} . P^{Q} = \dot{\Lambda} \quad[*165·241 . *173·2 . *150·42]$

Owing to this proposition, propositions stating analogies between ordinal and cardinal powers mostly require the hypothesis $\dot{\exists} ! Q$ or its equivalent, because an ordinal power whose index is zero is itself zero, whereas a cardinal power whose index is zero is 1.

*176·132. $\begin{align}&\vdash : P = \dot{\Lambda} . \dot{\exists} ! Q . \supset . P \,\text{exp}\,\, Q = \dot{\Lambda} . P^{Q} = \dot{\Lambda} \\ &[*165·244 . *172·14 . *176·13 . *150·42]\end{align}$

*176·133. $\vdash . CʻP^{Q} = \dot{s} ʻʻCʻ(P \,\text{exp}\,\, Q) \quad[*176·11 . *150·22]$

*176·14. $\vdash : \dot{\exists} ! Q . \supset . Cʻ(P \,\text{exp}\,\, Q) = (CʻP) \,\text{exp}\,\, (CʻQ) . CʻP^{Q} = (CʻP \uparrow CʻQ)_{\Delta }ʻCʻQ$

Dem. $\begin{array}{l} \vdash . *165·243 . \supset \vdash : \text{Hp} . &\supset . \dot{\exists} ! P \downarrow_{.,} ^{;}Q .\\ [*173·161 . *165·21] &\supset . Cʻ\text{Prod}ʻP \downarrow_{.,} ^{;}Q = \text{Prod}ʻCʻʻCʻP \downarrow_{.,} ^{;}Q .\\ [*176·1 . *165·14] \supset . Cʻ(P \,\text{exp}\,\, Q) &= \text{Prod}ʻ(CʻP) \downarrow_{,,} ʻʻ(CʻQ)\\ [(*116·01)]& = (CʻP) \,\text{exp}\,\, (CʻQ) &\qquad \text{(1)}\\ \vdash . (1) . *176·133 . \supset \vdash : \text{Hp} . \supset . CʻP^{Q} &= \dot{s} ʻʻ\{(CʻP) \,\text{exp}\,\, (CʻQ)\}\\ [*116·13] &= (CʻP \uparrow CʻQ)_{\Delta }ʻCʻQ &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*176·15. $\vdash : \dot{\exists} ! P . \dot{\exists} ! Q . \equiv . \dot{\exists} ! (P \,\text{exp}\,\, Q) . \equiv . \dot{\exists} ! P^{Q}$

Dem. $\begin{array}{l} \vdash . *176·131·132 . &\supset \vdash : \dot{\exists} ! (P \,\text{exp}\,\, Q) . \supset . \dot{\exists} ! P . \dot{\exists} ! Q &\qquad \text{(1)}\\ \vdash . *116·18 . *176·14 . \supset \vdash : \dot{\exists} ! P . \dot{\exists} ! Q . &\supset . \dot{\exists} ! Cʻ(P \,\text{exp}\,\, Q) .\\ [*33·24] &\supset . \dot{\exists} ! (P \,\text{exp}\,\, Q) (2) \vdash . (1) . (2) . *176·13 . \supset \vdash . \text{Prop}\ \end{array}$

*176·151. $\vdash \colon\ldotp P = \dot{\Lambda} .\lor.Q = \dot{\Lambda} :\equiv .P \,\text{exp}\, Q = \dot{\Lambda} . \equiv . P^{Q} = \dot{\Lambda} \quad[*176·15]$

*176·16. $\begin{align}&\vdash . Cʻ(P \,\text{exp}\,\, Q) \subset (CʻP) \,\text{exp}\,\, (CʻQ) . CʻP^{Q} \subset (CʻP \uparrow CʻQ)_{\Delta }ʻCʻQ\\ &[*176·14·151]\end{align}$

*176·18. $\vdash . \dot{s} \upharpoonright Cʻ(P \,\text{exp}\,Q) \in (P^{Q})\,\overline{\text{smor}}\,(P \,\text{exp}\,\, Q)$

Dem. $\begin{array}{l} \vdash . *116·131 . *176·14 . \supset \\ \vdash : \dot{\exists} ! Q . \supset . \dot{s} \upharpoonright Cʻ(P \,\text{exp}\,\, Q) \in (CʻP^{Q}) \,\overline{\text{sm}}\, Cʻ(P \,\text{exp}\,\, Q) &\qquad \text{(1)}\\ \vdash . (1) . *176·11 . *151·191 . \supset \\ \vdash : \dot{\exists} ! Q . \supset . \dot{s} \upharpoonright Cʻ(P \,\text{exp}\,\, Q) \in (P^{Q})\,\overline{\text{smor}}\,(P \,\text{exp}\,\, Q) &\qquad \text{(2)}\\ \vdash . *176·151 . *150·42 . *72·1 . \supset \\ \vdash : Q = \Lambda . \supset . \dot{s} \upharpoonright Cʻ(P \,\text{exp}\,\, Q) \in (P^{Q})\,\overline{\text{smor}}\,(P \,\text{exp}\,\, Q) &\qquad \text{(3)}\\ \vdash . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

*176·181. $\vdash . P^{Q}\,\text{smor}\,(P \,\text{exp}\,\, Q) \quad[*176·18]$

*176·182. $\vdash . (P \,\text{exp}\,\, Q)\,\text{smor}\,(\Pi ʻP \downarrow_{.,} ^{;}Q) \quad[*176·1 . *173·16 . *165·21]$

*176·19. $\begin{align}\vdash \colon\colon S(P^{Q})&T . \equiv \colon\ldotp S, T \in (CʻP \uparrow CʻQ)_{\Delta }ʻCʻQ \colon\ldotp \\ &(\exists y) : y \in CʻQ . (Sʻy) P (Tʻy) : y'Qy . y' \neq y . \supset _{yʻ} . Sʻy' = Tʻy'\end{align}$

Dem. $\begin{array}{l} \vdash . *176·11·12 . \supset \\ \vdash \colon\colon S(P^{Q})T . &\equiv \colon\ldotp (\exists \mu , \nu ) \colon\ldotp \mu , \nu \in (CʻP) \,\text{exp}\,\, (CʻQ) . S = \dot{s} ʻ\mu . T = \dot{s} ʻ\nu \colon\ldotp \\ &(\exists y, x, x') : y \in CʻQ . x \downarrow y \in \mu . x' \downarrow y \in \nu . xPx' :\\ &y'Qy . y' \neq y . w \downarrow y' . w \downarrow y' \in \mu . \supset _{y', w} . w \downarrow y' \in \nu \colon\ldotp \\ [*56·4] &\equiv \colon\ldotp (\exists \mu , \nu ) \colon\ldotp \mu , \nu \in (CʻP) \,\text{exp}\,\, (CʻQ) . S = \dot{s} ʻ\mu . T = \dot{s} ʻ\nu \colon\ldotp \\ &(\exists y, x, x') : y \in CʻQ . xSy . x'Ty . xPx' : y'Qy . y' \neq y . wSy' . \supset _{y', w} . wTy' \colon\ldotp \\ [*116·13 . *80·3] &\equiv \colon\ldotp S, T \in (CʻP \uparrow CʻQ_{\Delta }ʻCʻQ \colon\ldotp (\exists y) : y \in CʻQ . (Sʻy) P (Tʻy) :\\ &y'Qy . y' \neq y . \supset _{y'} Sʻy' = Tʻy'\colon\colon \supset \vdash . \text{Prop} \end{array}$

The above proposition is often useful, since it gives a direct formula for $P^{Q}$ , not one which passes by way of $P \,\text{exp}\,\, Q$ or $\Pi ʻP \downarrow_{.,} ^{;}Q$ .

*176·2. $\begin{align}\vdash : U \upharpoonright CʻR \in P\,\overline{\text{smor}}\,&R . W \upharpoonright CʻS \in Q \,\overline{\text{smor}}\,S . \supset .\\ &(U \parallel \breve{W} )_{\in } \upharpoonright Cʻ(R \,\text{exp}\,\, S) \in (P \,\text{exp}\,\, Q)\,\overline{\text{smor}}\,(R \,\text{exp}\,\, S)\end{align}$

Dem. $\begin{array}{l} \vdash . *165·362 . \supset \vdash : \text{Hp} . \supset . (U \parallel \breve{W} ) \upharpoonright Cʻ\Sigma ʻR \downarrow_{.,} ^{;}S \in (P \downarrow_{.,} ^{;}Q) \,\overline{\text{smor smor}}\, (R \downarrow_{.,} ^{;}S) .\\ [*173·3] \supset . (U \parallel \breve{W} )_\in \upharpoonright Cʻ\text{Prod}ʻR \downarrow_{.,} ^{;}S \in (\text{Prod}ʻP \downarrow_{.,} ^{;}Q) \,\overline{\text{smor}}\, (\text{Prod}ʻR \downarrow_{.,} ^{;}S) &\qquad \text{(1)}\\ \vdash . (1) . *176·1 . \supset \vdash . \text{Prop} \end{array}$

*176·21. $\begin{align}\vdash : U \upharpoonright CʻR \in P\,\overline{\text{smor}}\, R . W \upharpoonright CʻS \in &Q\,\overline{\text{smor}}\,S . \supset .\\ &(U \parallel \breve{W} ) \upharpoonright Cʻ(R^{S}) \in (P^{Q})\,\overline{\text{smor}}\,(R^{S})\end{align}$

Dem. $\begin{array}{l} \vdash . *176·2·18 . *151·401 . &\supset \vdash : \text{Hp} . \supset . \dot{s} ^{;}(U \parallel \breve{W} )_{\in } \upharpoonright Cʻ(R \,\text{exp}\,\, S) \in (P^{Q}) \overline{\text{smor}} (R^{S})\\ [*150·961] &\supset . (U \parallel \breve{W} ) \upharpoonright \dot{s} ʻʻCʻ(R \,\text{exp}\,\, S) \in (P^{Q}) \overline{\text{smor}} (R^{S}) &\qquad \text{(1)}\\ \vdash . (1) . *176·11 . *150·22 . \supset \vdash . \text{Prop} \end{array}$

*176·22. $\begin{align}&\vdash : P \,\text{smor} R . Q\;\text{smor}\,S . \supset . (P \,\text{exp}\,\, Q)\,\text{smor}\,(P \,\text{exp}\,\, S) . P^{Q}\,\text{smor}\,R^{S}\\ &[*176·2·21]\end{align}$

*176·23. $\vdash : R \,\text{smor smor}\, P \downarrow_{.,} ^{;}Q . \supset . \Pi ʻR\,\text{smor}\,(P \,\text{exp}\,\, Q)$

Dem. $\begin{array}{l} \vdash . *172·44 . \supset \vdash : \text{Hp} . \supset . \Pi ʻR \,\text{smor}\,\Pi ʻP \downarrow_{.,} ^{;}Q &\qquad \text{(1)}\\ \vdash . (1) . *176·182 . \supset \vdash . \text{Prop} \end{array}$

*176·24. $\begin{align}\vdash \colon\ldotp &\text{Mult ax} . \supset :\\ &R \in \text{Rel}^{2}\text{excl} \cap \text{Nr}ʻQ . CʻR \subset \text{Nr}ʻP . \supset . \Pi ʻP \,\text{smor}\,(P \,\text{exp}\,\, Q)\\ &[*165·38 . *176·23]\end{align}$

Dem. $\begin{array}{l} \vdash . *176·19 . \supset \\ \vdash \colon\colon T(\breve{P} )^{Q}S . &\equiv \colon\ldotp S, T \in (CʻP \uparrow CʻQ)_{\Delta }ʻCʻQ \colon\ldotp \\ &(\exists y) : y \in CʻQ . (Tʻy) \breve{P} (Sʻy) : yʻQy . yʻ \neq y . \supset _{yʻ} . Sʻyʻ = Tʻyʻ \colon\ldotp \\ [*176·19] &\equiv \colon\ldotp S(P^{Q})T \colon\colon \supset \vdash . \text{Prop} \end{array}$

*176·31. $\vdash : \dot{\exists} ! Q . \supset . \overrightarrow{B}ʻ(P \,\text{exp}\,\, Q) = (\overrightarrow{B}ʻP) \,\text{exp}\,\, (CʻQ)$

Dem. $\begin{array}{l} \vdash . *165·21 . *163·12 . *71·221 . *93·1 . &\supset \vdash . B \upharpoonright CʻP \downarrow_{.,} ^{;}Q \in \text{Cls} \rightarrow 1 &\qquad \text{(1)}\\ \vdash . *165·12·01 . *37·67 . \supset \vdash . \overrightarrow{B}ʻʻCʻP \downarrow_{.,} ^{;}Q &= \hat{\alpha} \{(\exists z) . z \in CʻQ . \alpha = \overrightarrow{B}ʻ \downarrow z^{;}P\}\\ [*165·251 . *151·5 . *38·3] &= (\overrightarrow{B}ʻP) \downarrow_{,,} ʻʻCʻQ &\qquad \text{(2)}\\ \vdash . *172·162 . *165·243 . &\supset \vdash : \dot{\exists} ! Q . \supset . \overrightarrow{B}ʻ\Pi ʻP \downarrow_{.,} ^{;}Q = B_{\Delta }ʻCʻP \downarrow_{.,} ^{;}Q .\\ [*173·16 . *165·21 . *151·5] \supset . \overrightarrow{B}ʻ(P \,\text{exp}\,\, Q) &= \text{D}ʻʻB_{\Delta }ʻCʻP \downarrow_{.,} ^{;}Q\\ [*85·1 . (1) . *115·1] &= \text{Prod}ʻ\overrightarrow{B}ʻʻCʻP \downarrow_{.,} ^{;}Q\\ [(2)] &= \text{Prod}ʻ(\overrightarrow{B}ʻP) \downarrow_{,,} ʻʻCʻQ\\ [(*116·01)] &= (\overrightarrow{B}ʻP) \,\text{exp}\,\, (CʻQ) : \supset \vdash . \text{Prop} \end{array}$

*176·311. $\begin{align}&\vdash : \dot{\exists} ! Q . \supset . \overrightarrow{B}ʻ\text{Cnv}ʻ(P \,\text{exp}\,\, Q) = (\overrightarrow{B}ʻP) \,\text{exp}\,\, (CʻQ)\\ &[\text{Proof as in *176·31}]\end{align}$

*176·32. $\vdash :\dot{\exists} !Q.\supset .\overrightarrow{B}ʻ(P^{Q})=(\overrightarrow{B}ʻP\uparrow CʻQ)_{\Delta }ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*176·31·18.*151·5.\supset \\ \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ(P^{Q})&=\dot{s}ʻʻ(\overrightarrow{B}ʻP)\,\text{exp}\,\,(CʻQ)\\ [*116·13] &=(\overrightarrow{B}ʻP\uparrow CʻQ)_{\Delta }ʻCʻQ:\supset \vdash .\text{Prop} \end{array}$

*176·321. $\vdash :\dot{\exists} !Q.\supset .\overrightarrow{B}ʻ\text{Cnv}ʻ(P^{Q})=(\overrightarrow{B}ʻ\breve{P} \uparrow CʻQ)_{\Delta }ʻCʻQ \quad[*176·32·3]$

*176·33. $\begin{align}\vdash \colon\ldotp \dot{\exists} !Q.\supset :&\exists !\overrightarrow{B}ʻ(P\,\text{exp}\,\,Q).\equiv .\exists !\overrightarrow{B}ʻ(P^{Q}).\equiv .\exists !\overrightarrow{B}ʻP:\\ &\exists !\overrightarrow{B}ʻ\text{Cnv}ʻ(P\,\text{exp}\,\,Q).\equiv .\exists !\overrightarrow{B}ʻ\text{Cnv}ʻ(P^{Q}).\equiv .\exists !\overrightarrow{B}ʻ\breve{P}\\ &[*176·31·311·32·321.*116·18·15]\end{align}$

*176·34. $\begin{align}\vdash :\dot{\exists} !Q.\text{E}!&BʻP.\supset .\\ &Bʻ(P\,\text{exp}\,\,Q)=(BʻP)\downarrowʻʻCʻQ.Bʻ(P^{Q})=(\iota ʻBʻP)\uparrow CʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*176·31.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ(P\,\text{exp}\,\,Q)&=(\iota ʻBʻP)\,\text{exp}\,\,(CʻQ)\\ [(*116·01)] &=\text{Prod}ʻ(\iota ʻBʻP)\downarrow_{,,}ʻʻCʻQ\\ [*38·3.*53·31] &=\text{Prod}ʻ\iotaʻʻ(BʻP)\downarrowʻʻCʻQ\\ [*115·143] &=\iota ʻ{(BʻP)\downarrowʻʻCʻQ} &\qquad \text{(1)}\\ \vdash .*176·32.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ(P^{Q})&=(\iota ʻBʻP\uparrow CʻQ)_{\Delta }ʻCʻQ\\ [*116·12.*51·4] &=\iota ʻ{(\iota ʻBʻP)\uparrow CʻQ} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*176·341. $\begin{align}\vdash :\dot{\exists} !Q.\text{E}!&Bʻ\breve{P} .\supset .\\ &Bʻ\text{Cnv}ʻ(P\,\text{exp}\,\,Q)=(Bʻ\breve{P} )\downarrowʻʻCʻQ.Bʻ\text{Cnv}ʻ(P^{Q})=(\iota ʻBʻ\breve{P} )\uparrow CʻQ\\ &[\text{Proof as in *176·34}]\end{align}$

*176·35. $\vdash :P\,\unicode{x2abd}\, Q.\supset .P^{R}\,\unicode{x2abd}\, Q^{R}$

Dem. $\begin{array}{l} \vdash .*116·12.\supset \vdash :\text{Hp}.\supset .(CʻP\uparrow CʻR)_{\Delta }ʻCʻR\subset (CʻQ\uparrow CʻR)_{\Delta }ʻCʻR &\qquad \text{(1)}\\ \vdash .(1).*176·19.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned in proving (with a suitable hypothesis) $P^{Q}\times P^{R}\,\text{smor}\,P^{Q\unicode{x2909}R}$ and its extension $\{\text{Prod}ʻ(P \,\text{exp}\,\,)^{;}S\}\,\text{smor}\,\{P\,\text{exp}\,\,(\Sigma ʻS)\}.$

*176·4. $\begin{align}&\vdash :\dot{\exists} !Q.\dot{\exists} !R.PʻʻCʻQ\cap PʻʻCʻR=\Lambda.CʻQ\cup CʻR\subset \text{ᗡ}ʻP.\supset .\\ &\dot{s} \mid C\upharpoonright Cʻ\{(\Pi ʻP^{;}Q)\times (\Pi ʻP^{;}R)\}\in \{\Pi ʻP^{;}(Q\unicode{x2909}R)\}\,\overline{\text{smor}}\,\{(\Pi ʻP^{;}Q)\times (\Pi ʻP^{;}R)\}\end{align}$

Dem. $\begin{array}{l} \vdash .*172·34.*150·22·24. &\supset \vdash :\text{Hp}.\supset .\\ &\dot{s} \mid C\upharpoonright Cʻ{(\Pi ʻP^{;}Q)\times (\Pi ʻP^{;}R)}\in {\Pi ʻ(P^{;}Q\unicode{x2909}P^{;}R)}\,\overline{\text{smor}}\,\{(\Pi ʻP^{;}Q)\times (\Pi ʻP^{;}R)\} &\qquad \text{(1)}\\ \vdash .*162·36. &\supset \vdash :\text{Hp}.\supset .P^{;}Q\unicode{x2909}P^{;}R=P^{;}(Q\unicode{x2909}R) &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*176·41. $\begin{align}\vdash :\dot{\exists} !Q.\dot{\exists} !R.&PʻʻCʻQ\cap PʻʻCʻR=\Lambda.CʻQ\cup CʻR\subset \text{ᗡ}ʻP.\supset .\\ &\Pi ʻP^{;}(Q\unicode{x2909}R)\,\text{smor}\,(\Pi ʻP^{;}Q)\times (\Pi ʻP^{;}R) \quad[*176·4]\end{align}$

*176·42. $\begin{align}\vdash :\dot{\exists} !Q.\dot{\exists} !R.CʻQ\cap &CʻR=\Lambda.\supset .P^{Q}\times P^{R} \text{smor} P^{Q\unicode{x2909}R}.\\ &(P \,\text{exp}\,\, Q)\times (P \,\text{exp}\,\, R)\,\text{smor}\,P \,\text{exp}\,\, (Q\unicode{x2909}R)\end{align}$

Dem. $\begin{array}{l} \vdash .*72·411.*165·22.\supset \\ \vdash :\dot{\exists} !P.CʻQ\cap CʻR=\Lambda.&\supset .P\downarrow_{.,} ʻʻCʻQ\cap P\downarrow_{.,} ʻʻCʻR=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*176·41 \frac{P\downarrow_{.,}}{P}.*38·12.*33·431.\supset \\ \vdash :\text{Hp}.\dot{\exists} !P.&\supset .\Pi ʻP\downarrow_{.,} ^{;}(Q\unicode{x2909}R)\,\text{smor}\,(\Pi ʻP\downarrow_{.,} ^{;}Q)\times (\Pi ʻP\downarrow_{.,} ^{;}R).\\ [*176·182.*166·23]&\supset .P \,\text{exp}\,\, (Q\unicode{x2909}R)\,\text{smor}\,(P \,\text{exp}\,\, Q)\times (P \,\text{exp}\,\, R). &\qquad \text{(2)}\\ [*176·181.*166·23]&\supset .P^{Q\unicode{x2909}R}\text{smor}P^{Q}\times P^{R} &\qquad \text{(3)}\\ \vdash .*176·151.*166·13.*153·101.\supset \\ \vdash :P=\dot{\Lambda} .&\supset .P \,\text{exp}\,\, (Q\unicode{x2909}R)\,\text{smor}\,(P \,\text{exp}\,\, Q)\times (P \,\text{exp}\,\, R).\\ &P^{Q\unicode{x2909}R}\,\text{smor}\,P^{Q}\times P^{R} &\qquad \text{(4)}\\ \vdash .(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*176·43. $\begin{align}\vdash :S\in &\text{Rel}^{2}\text{excl}.S\,\unicode{x2abd}\, J.\supset .\\ &s\upharpoonright Cʻ\text{Prod}ʻ(P \,\text{exp}\,\,)^{;}S\in {P \,\text{exp}\,\,(\Sigma ʻS)}\,\overline{\text{smor}}\,\text{Prod}ʻ(P \,\text{exp}\,\,)^{;}S\end{align}$

Dem. $\begin{array}{l} \vdash .*165·22.*163·3. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .(P\downarrow_{.,} )\dagger ^{;}S\in \text{Rel}^{2}\text{excl} &\qquad \text{(1)}\\ \vdash .*162·35.*38·12.*33·431. &\supset \vdash .\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}S=P\downarrow_{.,} ^{;}\Sigma ʻS &\qquad \text{(2)}\\ \vdash .*165·21.(2). &\supset \vdash .\Sigma ʻ(P \downarrow_{.,} )\dagger ^{;}S\in \text{Rel}^{2}\text{excl} &\qquad \text{(3)}\\ \vdash .(1).(3).*174·3. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .(P\downarrow_{.,} )\dagger ^{;}S\in \text{Rel}^{3}\text{arithm} &\qquad \text{(4)}\\ \vdash .*165·223.\text{Transp}. \supset \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.&\supset :Q\neq R.\supset .P\downarrow_{.,} ^{;}Q\neq P\downarrow_{.,} ^{;}R:\\ [*150·4.*72·14] &\supset :(P\downarrow_{.,} )\dagger ^{;}S\,\unicode{x2abd}\, J &\qquad \text{(5)}\\ \vdash .*176·1. &\supset \vdash .\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S=\text{Prod}ʻ\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}S &\qquad \text{(6)}\\ \vdash .(4).(5).(6).*174·42.\supset\\ \vdash :\text{Hp}.\dot{\exists} !P.\supset .\\ &s\upharpoonright Cʻ\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\in \{\text{Prod}ʻ\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}S\}\overline{\text{smor}} \{\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\}.\\ [(2)] &\supset .s\upharpoonright Cʻ\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\in \{\text{Prod}ʻP\downarrow_{.,} ^{;}\Sigma ʻS\}\overline{\text{smor}} \{\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\}.\\ [*176·1]&\supset .s\upharpoonright Cʻ(P\,\text{exp}\,\,)^{;}S\in \{P\,\text{exp}\,\,(\Sigma ʻS)\}\overline{\text{smor}} \{\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\} &\qquad \text{(7)}\\ \vdash .*176·151.*173·21.*172·13·14.\supset \\ \vdash :P=\dot{\Lambda} .&\supset .\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S=\dot{\Lambda} .P\,\text{exp}\,\,(\Sigma ʻS)=\dot{\Lambda} &\qquad \text{(8)}\\ \vdash .(7).(8).*173·2.*164·32.\supset \vdash .\text{Prop} \end{array}$

*176·44. $\begin{align}&\vdash :S\in \text{Rel}^{2}\text{excl}.S\,\unicode{x2abd}\, J.\supset .\{\text{Prod}ʻ(P\,\text{exp}\,\,)^{;}S\}\,\text{smor}\,\{P\,\text{exp}\,\,(\Sigma ʻS)\} &[*176·43]\end{align}$

The following propositions are lemmas for $R\,\unicode{x2abd}\, J.\supset .(P^{Q})^{R}\,\text{smor}\,P^{R\times Q}.$

*176·5. $\begin{align}\vdash \colon\ldotp &M\upharpoonright CʻR\in 1\rightarrow 1.CʻR\subset \text{ᗡ}ʻM.CʻQ\subset pʻ\text{ᗡ}ʻʻʻMʻʻCʻR.\\ &MʻʻCʻR\subset 1\rightarrow 1:z,z'\in CʻR.\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻz'.\supset _{z,z'}.z=z':\\ &T=\hat{x} \hat{X} \{(\exists u,z).u\in CʻQ.z\in CʻR.x=(Mʻz)ʻu.X=u\downarrow (Mʻz)\}:\\ &\supset .T\in 1\rightarrow 1\end{align}$

Dem. $\begin{array}{l} \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xTX.x'TX.\supset .\\ &(\exists u,u',z,z').u,u'\in CʻQ.z,z'\in CʻR.x=(Mʻz)ʻu.x'=(Mʻz')ʻu'.\\ &X=u\downarrow (Mʻz).X=u'\downarrow (Mʻz').\\ [*55·202] &\supset .(\exists u,u',z,z').x=(Mʻz)ʻu.x'=(Mʻz')ʻu'.u=u'.Mʻz=Mʻz'.\\ [*13·22] &\supset .x=x' &\qquad \text{(1)}\\ \vdash .*21·33.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xTX.xTX'.\supset .\\ &(\exists u,u',z,z').u,u'\in CʻQ.z,z'\in CʻR.x=(Mʻz)ʻu.x=(Mʻz')ʻu'.\\ &X=u\downarrow (Mʻz).X'=u'\downarrow (Mʻz').\\ [*33·43.\text{Hp}] &\supset .(\exists u,u',z,z').u,u'\in CʻQ.z\in CʻR.z=z'.x=(Mʻz)ʻu=(Mʻz')ʻu'.\\ &X=u\downarrow (Mʻz).X'=u'\downarrow (Mʻz').\\ [*13·195] &\supset .(\exists u,u',z).u,u'\in CʻQ.z\in CʻR.x=(Mʻz)ʻu=(Mʻz')ʻu'.\\ &X=u\downarrow (Mʻz).X'=u'\downarrow (Mʻz).\\ [*71·59.\text{Hp}] &\supset .(\exists u,u',z).u=u'.X=u\downarrow (Mʻz).X'=u'\downarrow (Mʻz).\\ [*13·195] &\supset .X=X' &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*176·501. $\vdash :\text{Hp}*176·5.\supset .\text{ᗡ}ʻT=Cʻ\Sigma ʻQ\downarrow_{.,} ^{;}M^{;}R$

Dem. $\begin{array}{l} \vdash .*71·16.\supset \vdash \colon\ldotp \text{Hp}.&\supset :z\in CʻR.u\in CʻQ.\supset .\text{E}!(Mʻz)ʻu.\\ [*21·33] &\supset .u\downarrow (Mʻz)\in \text{ᗡ}ʻT &\qquad \text{(1)}\\ \vdash .*21·33.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :X\in \text{ᗡ}ʻT.\supset .(\exists z,u).z\in CʻR.u\in CʻQ.X=u\downarrow (Mʻz) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp \text{Hp}.\supset :X\in \text{ᗡ}ʻT.&\equiv .(\exists z,u).z\in CʻR.u\in CʻQ.X=u\downarrow (Mʻz).\\ [*71·4] &\equiv .(\exists Z,u).Z\in MʻʻCʻR.u\in CʻQ.X=u\downarrow Z.\\ [*150·22] &\equiv .(\exists Z,u).Z\in CʻM^{;}R.u\in CʻQ.X=u\downarrow Z.\\ [*165·16.*113·101] &\equiv .X\in Cʻ\Sigma ʻQ\downarrow_{.,} ^{;}M^{;}R\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*176·502. $\vdash :\text{Hp}*176·5.z\in CʻR.\supset .T^{;}Q\downarrow_{.,} ʻMʻz=\dagger QʻMʻz$

Dem. $\begin{array}{l} \vdash .*150·4.*165·01.*176·5.\supset \\ \vdash :\text{Hp}.\supset .T^{;}Q\downarrow_{.,} ʻMʻz=\hat{x} \hat{y} &\{(\exists u,v).uQv.x=Tʻ\downarrow (Mʻz)ʻu.y=Tʻ\downarrow (Mʻz)ʻv\}\\ [\text{Hp}.*176·5·501] &=\hat{x} \hat{y} \{(\exists u,v).uQv.x=(Mʻz)ʻu.y=(Mʻz)ʻv\}\\ [*150·4] &=(Mʻz)^{;}Q\\ [*150·1] &=\dagger QʻMʻz:\supset \vdash .\text{Prop} \end{array}$

*176·503. $\vdash :\text{Hp}*176·5.\supset .T\in (\dagger Q^{;}M^{;}R)\,\overline{\text{smor smor}}\, (Q\downarrow_{.,} ^{;}M^{;}R)$

Dem. $\begin{array}{l} \vdash .*176·502.*150·1·35.\supset \vdash :\text{Hp}.\supset .T\dagger ^{;}Q\downarrow_{.,} ^{;}M^{;}R=\dagger Q^{;}M^{;}R &\qquad \text{(1)}\\ \vdash .(1).*176·5·501.*164·1.\supset \vdash .\text{Prop} \end{array}$

*176·51. $\begin{align}\vdash \colon\ldotp M\upharpoonright &CʻR\in 1\rightarrow 1.MʻʻCʻR\subset 1\rightarrow 1.\\ &CʻR\subset \text{ᗡ}ʻM.CʻQ\subset pʻ\text{ᗡ}ʻʻMʻʻCʻR:\\ &z,z'\in CʻR.\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻz'.\supset _{z,z'}.z=z':\supset .\dagger Q^{;}M^{;}R\,\text{smor}\,\text{smor}Q\downarrow_{.,} ^{;}R\end{align}$

Dem. $\begin{array}{l} \vdash .*165·361.\supset \vdash :\text{Hp}.\supset .Q\downarrow_{.,} ^{;}M^{;}R\,\text{smor smor}\,Q\downarrow_{.,} ^{;}R &\qquad \text{(1)}\\ \vdash .(1).*176·503.*164·221.\supset \vdash .\text{Prop} \end{array}$

*176·52. $\vdash \colon\ldotp z\in CʻR.\supset _{z}.Mʻz\in (Pʻz)\,\overline{\text{smor}}\,Q:\supset .P^{;}R=\dagger Q^{;}M^{;}R$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in CʻR.\supset _{z}.Pʻz&=(Mʻz)^{;}Q\\ [*150·1] &=\dagger QʻMʻz &\qquad \text{(1)}\\ \vdash .(1).*150·35.\supset \vdash .\text{Prop} \end{array}$

*176·53. $\begin{align}&\vdash \colon\ldotp M\upharpoonright CʻR\in 1\rightarrow 1:z\in CʻR.\supset _{z}.Mʻz\in (Pʻz)\,\overline{\text{smor}}\,Q:\\ &z,z'\in CʻR.\exists !CʻPʻz\cap CʻPʻz'.\supset _{z,z'}.z=z':\supset .P^{;}R\,\text{smor smor}\,Q\downarrow_{.,} ^{;}R\end{align}$

Dem. $\begin{array}{l} \vdash .*14·21. \supset \vdash \colon\ldotp \text{Hp}.&\supset :z\in CʻR.\supset _{z}.\text{E}!Mʻz: &\qquad \text{(1)}\\ [*33·43] &\supset :CʻR\subset \text{ᗡ}ʻM &\qquad \text{(2)}\\ \vdash .*151·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :z\in CʻR.\supset _{z}.Mʻz\in 1\rightarrow 1:\\ [*37·61.(1)] &\supset :MʻʻCʻR\subset 1\rightarrow 1 &\qquad \text{(3)}\\ \vdash .*151·11·131. \supset \vdash \colon\ldotp \text{Hp}.&\supset :z,\in CʻR.\supset _{z}.\text{D}ʻMʻz=CʻPʻz:\\ [\text{Hp}] &\supset :z,z'\in CʻR.\exists !\text{D}ʻMʻz\cap \text{D}ʻMʻz'.\supset _{z,z'}.z=z' &\qquad \text{(4)}\\ \vdash .*151·11. &\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in CʻR.\supset .\text{ᗡ}ʻMʻz=CʻQ:\\ [*37·63] &\supset :Z\in MʻʻCʻR.\supset .\text{ᗡ}ʻZ=CʻQ:\\ [*40·15] &\supset :CʻQ\subset pʻ\text{ᗡ}ʻʻMʻʻCʻR &\qquad \text{(5)}\\ \vdash .(2).(3).(4).(5).*176·51.&\supset \vdash :\text{Hp}.\supset .\dagger Q^{;}M^{;}R \text{smor} \text{smor} Q\downarrow_{.,} ^{;}R &\qquad \text{(6)}\\ \vdash .(6).*176·52.\supset \vdash .\text{Prop} \end{array}$

*176·54. $\begin{align}&\vdash \colon\ldotp \dot{\exists} !P.\dot{\exists} !Q.M=\hat{Z} \hat{z} [z\in CʻR.Z=\{\mid (\text{Cnv}ʻ\downarrow z)\}_{\in }\upharpoonright Cʻ(P \,\text{exp}\,\, Q)].\supset :\\ &M\in 1\rightarrow 1:z\in CʻR.\supset _{z}.Mʻz\in (\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z)\,\overline{\text{smor}}\,(\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*116·606.*176·14.&\supset \vdash :\text{Hp}.\supset .M\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*21·33.*30·3.&\supset \vdash :\text{Hp}.z\in CʻR.\supset .Mʻz={\mid (\text{Cnv}ʻ\downarrow z)}_{\in }\upharpoonright Cʻ(P\,\text{exp}\,\,Q) &\qquad \text{(2)}\\ \vdash .*151·65.*165·361.*166·1.*165·01.\supset \\ &\vdash .\{\mid (\text{Cnv}ʻ\downarrow z)\}\upharpoonright Cʻ(Q\times P)\in (P\downarrow_{.,} ^{;}Q\downarrow_{.,} z)\,\overline{\text{smor smor}}\, (P\downarrow_{.,} ^{;}Q).\\ [(2).*173·3] &\supset \vdash :\text{Hp}.z\in CʻR.\supset .\\ &Mʻz\in (\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z)\,\overline{\text{smor}}\,(\text{Prod}ʻP\downarrow_{.,} ^{;}Q) &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*176·541. $\vdash .(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\in \text{Rel}^{3}\text{arithm}.\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R=P\downarrow_{.,} ^{;}\Sigma ʻQ\downarrow_{.,} ^{;}R$

Dem. $\begin{array}{l} \vdash .*163·3.*165·21·22.&\supset \vdash :\dot{\exists} !P.\supset .(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\in \text{Rel}^{2}\text{excl} &\qquad \text{(1)}\\ \vdash .*165·242.&\supset \vdash :P=\dot{\Lambda} .\dot{\exists} !S.\dot{\exists} !S'.\supset .P\downarrow_{.,} ^{;}S=\dot{\Lambda} \downarrow \dot{\Lambda} .P\downarrow_{.,} ^{;}S'=\dot{\Lambda} \downarrow \dot{\Lambda} :\\ [\text{Transp}] &\supset \vdash \colon\ldotp P=\dot{\Lambda} .P\downarrow_{.,} ^{;}S\neq P\downarrow_{.,} ^{;}S'.\supset :S=\Lambda.\lor.S'=\Lambda:\\ [*165·241] &\supset :P\downarrow_{.,} ^{;}S=\dot{\Lambda} .\lor.P\downarrow_{.,} ^{;}S'=\dot{\Lambda} :\\ [*33·241] &\supset :CʻP\downarrow_{.,} ^{;}S\cap CʻP\downarrow_{.,} ^{;}S'=\Lambda &\qquad \text{(2)}\\ \vdash .*150·22·1. &\supset \vdash \colon\ldotp P=\dot{\Lambda} .\supset : T,T'\in Cʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R.T\neq T'.\supset .\\ &(\exists z,z').z\neq z'.z,z'\in CʻR.T=(P\downarrow_{.,} )^{;}Q\downarrow_{.,} z.T'=(P\downarrow_{.,} )^{;}Q\downarrow_{.,} z'.\\ [(2)] &\supset .CʻT\cap CʻT'=\Lambda &\qquad \text{(3)}\\ \vdash .(1).(3).*163·1. &\supset \vdash .(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\in \text{Rel}^{2}\text{excl} &\qquad \text{(4)}\\ \vdash .*162·35. &\supset \vdash .\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R=P\downarrow_{.,} ^{;}\Sigma ʻQ\downarrow_{.,} ^{;}R. &\qquad \text{(5)}\\ [*165·21] &\supset \vdash .\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\in \text{Rel}^{2}\text{excl} &\qquad \text{(6)}\\ \vdash .(4).(5).(6).*174·3.\supset \vdash .\text{Prop} \end{array}$

*176·55. $\vdash :\dot{\exists} !P.\dot{\exists} !Q.\supset .\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\,\text{smor smor}\, (\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\downarrow_{.,} ^{;}R$

Dem. $\begin{array}{l} \vdash .*176·133·15.*37·44·21.\supset \\ &\vdash :\exists !Cʻ\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z\cap Cʻ\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} w.\supset .\\ &\exists !CʻP^{Q\downarrow_{.,} z}\cap CʻP^{Q\downarrow_{.,} w}.\dot{\exists} !Q\downarrow_{.,} z.\\ [*176·16.*80·14.*165·212]&\supset .(\exists R).\text{ᗡ}ʻR=CʻQ\downarrow_{.,} z.\text{ᗡ}ʻR=CʻQ\downarrow_{.,} w.\dot{\exists} !Q.\\ [*13·171.*150·22] &\supset .\downarrow zʻʻCʻQ=\downarrow wʻʻCʻQ.\dot{\exists} !Q.\\ [*55·232] &\supset .z=w &\qquad \text{(1)}\\ \vdash .(1).*176·54.*176·53 \frac{\text{Prod}ʻP\downarrow_{.,} ^{;}Q\downarrow_{.,} z,\, \text{Prod}ʻP\downarrow_{.,} ^{;}Q}{Pʻz,\, Q}.\supset \vdash .\text{Prop} \end{array}$

*176·56. $\begin{align}\vdash :\dot{\exists} !P.\dot{\exists} !&Q.R\,\unicode{x2abd}\, J.\supset .\\ &\text{Prod}ʻ\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\,\text{smor}\,\text{Prod}ʻ(\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\downarrow_{.,} ^{;}R\end{align}$

Dem. $\begin{array}{l} \vdash . *165·223.&\supset \vdash \colon\ldotp \dot{\exists} !P.P\downarrow_{.,} ^{;}Q\downarrow_{.,} z=P\downarrow_{.,} ^{;}Q\downarrow_{.,} z'.\supset :Q\downarrow_{.,} z=Q\downarrow_{.,} z':\\ [*165·22] &\supset :\dot{\exists} !Q.\supset .z=z' &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash \colon\ldotp \text{Hp}.zRz'.\supset .P\downarrow_{.,} ^{;}Q\downarrow_{.,} z\neq P\downarrow_{.,} ^{;}Q\downarrow_{.,} z' &\qquad \text{(2)}\\ \vdash .(2).*150·4. &\supset \vdash :\text{Hp}.\supset .(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\,\unicode{x2abd}\, J &\qquad \text{(3)}\\ \vdash .(3).*176·541.*174·43.\supset \\ \vdash :\text{Hp}.&\supset .\text{Prod}ʻ\Sigma ʻ(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\,\text{smor}\,\text{Prod}ʻ\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R &\qquad \text{(4)}\\ \vdash .*176·55.*173·31.\supset \\ \vdash :\text{Hp}.&\supset .\text{Prod}ʻ\text{Prod}^{;}(P\downarrow_{.,} )\dagger ^{;}Q\downarrow_{.,} ^{;}R\,\text{smor}\,\text{Prod}ʻ(\text{Prod}ʻP\downarrow_{.,} ^{;}Q)\downarrow_{.,} ^{;}R &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*176·57. $\vdash :R\,\unicode{x2abd}\, J.\supset .\{(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R\}\,\text{smor}\,\{P\,\text{exp}\,\,(R\times Q)\}.(P^{Q})^{R}\,\text{smor}\,P^{R\times Q}$

Dem. $\begin{array}{l} \vdash .*176·151. &\supset \vdash \colon\ldotp P=\dot{\Lambda} .\lor.Q=\dot{\Lambda} :\supset .(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*176·151.*166·13. &\supset \vdash \colon\ldotp P=\dot{\Lambda} .\lor.Q=\dot{\Lambda} :\supset .P\,\text{exp}\,\,(P\times Q)=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).*153·101. &\supset \vdash \colon\ldotp P=\dot{\Lambda} .\lor.Q=\dot{\Lambda} :\supset .\\ &\{(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R\}\,\text{smor}\,\{P\,\text{exp}\,\,(R\times Q)\} &\qquad \text{(3)}\\ \vdash .*176·56·541·1.*166·1.&\supset \vdash :\dot{\exists} !P.\dot{\exists} !Q.R\,\unicode{x2abd}\, J.\supset .\\ &\{(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R\}\,\text{smor}\,\{P\,\text{exp}\,\,(R\times Q)\} &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash :\text{Hp}.&\supset .\{(P\,\text{exp}\,\,Q)\,\text{exp}\,\,R\}\,\text{smor}\,\{P\,\text{exp}\,\,(R\times Q)\} &\qquad \text{(5)}\\ [*176·181·22] &\supset .(P^{Q})^{R}\,\text{smor}\,P^{R\times Q} &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*177*13. $\vdash :x\neq y.\supset .P_{\text{df}}\,\text{smor}\,\{(x\downarrow y)^{P}\}$

which is the analogue of *116·72, or rather leads to the analogue of *116·72 as soon as powers of relation-numbers have been defined; for then it becomes $P_{\text{df}}\in 2_{r}^{\text{Nr}ʻP}.$ Another proposition is an extension of *171·69, namely

*177·22. $\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\text{df}^{;}P \,\text{smor}\,(\Sigma ʻP)_{\text{df}}$

*177·13 shows, for example, that all classes of finite integers can be arranged in a series of which the relation-number is $2_{r}^\omega$ , where $\omega$ is the relation-number of the series of finite integers. $2_{r}^\omega$ is not the relation-number of the continuum, but is closely allied to it.

*177·1. $\begin{align}\vdash :x\neq y.T=\hat{\mu} \hat{R} &[R\in \{(\iota ʻx\cup \iota ʻy)\uparrow \alpha\}_{\Delta }ʻ\alpha .\mu =\overleftarrow{R}ʻx].\supset .\\ &T\in (\text{Cl}ʻ\alpha )\,\overline{\text{ sm }}\, \{(\iota ʻx\cup \iota ʻy)\uparrow \alpha\}_{\Delta }ʻ\alpha \quad[*116·712·713·715]\end{align}$

In the propositions of *116 referred to, $\Lambda$ and $\text{V}$ appear in place of $x$ and $y$ , but no property of $\Lambda$ and $\text{V}$ is used in the proof except $\Lambda\neq \text{V}$ .

*177·11. $\vdash :\text{Hp}*177·1.\alpha =CʻP.\supset .T^;(x\downarrow y)^P=P_{\text{df}}$

Dem. $\begin{array}{l} \vdash .*176·19.\supset \\ \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon\mu \{T^{;}(x\downarrow y)^{P}\}\nu .&\equiv \colon\ldotp (\exists R,S):R,S\in \{(\iota ʻx\cup \iota ʻy)\uparrow CʻP\}_{\Delta }ʻCʻP:\\ &(\exists z):z\in CʻP.Rʻz(x\downarrow y)Sʻz:\\ &wPz.w\neq z.\supset _{w}.Rʻw=Sʻw:\mu =\overleftarrow{R}ʻx.\nu =\overleftarrow{S}ʻx\colon\ldotp \\ [*55·13] &\equiv \colon\ldotp (\exists R,S):R,S\in {(\iota ʻx\cup \iota ʻy)\uparrow CʻP}_{\Delta }ʻCʻP\colon\ldotp \\ &(\exists z)\colon\ldotp z\in CʻP.Rʻz=x.Sʻz=y\colon\ldotp \mu =\overleftarrow{R}ʻx.\nu =\overleftarrow{S}ʻx\colon\ldotp \\ &wPz.w\neq z.\supset _{w}:xRw.\equiv .xSw:yRw.\equiv .ySw\colon\ldotp \\ [*71·36] &\equiv \colon\ldotp (\exists R,S):R,S\in {(\iota ʻx\cup \iota ʻy)\uparrow CʻP}_{\Delta }CʻP\colon\ldotp \\ &(\exists z)\colon\ldotp z\in CʻP.z\in \mu -\nu .\mu =\overleftarrow{R}ʻx.\nu =\overleftarrow{S}ʻx\colon\ldotp \\ &wPz.w\neq z.\supset _{w}:w\in \mu .\equiv .w\in \nu \colon\ldotp \\ [*177·1] &\equiv \colon\ldotp \mu ,\nu \in \text{Cl}ʻCʻP\colon\ldotp (\exists z)\colon\ldotp z\in CʻP.z\in \mu -\nu \colon\ldotp \\ &wPz.w\neq z.\supset _{w}:w\in \mu .\equiv .w\in \nu \colon\ldotp \\ [*171·11] &\equiv \colon\ldotp \mu (P_{\text{df}})\nu \colon\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*177·12. $\vdash :\text{Hp}*177·11.\supset .T\in P_{\text{df}}\,\overline{\text{smor}}\,\{(x\downarrow y)^{P}\} \quad[*177·1·11.*151·191]$

*177·13. $\vdash :x\neq y.\supset .P_{\text{df}}\,\overline{\text{smor}}\,\{(x\downarrow y)^{P}\} \quad[*177·12]$

*177·21. $\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .s\upharpoonright Cʻ\text{Prod}ʻ\text{df}^{;}P\in (\Sigma ʻP)_{\text{df}}\,\overline{\text{smor}}\, (\text{Prod}ʻ\text{df}^{;}P)$

The proof proceeds as the proof of *174·24 proceeds. If $Q\in CʻP$ , we shall have, if $M\in F_{\Delta }ʻ\text{df}ʻʻCʻP$ , $MʻQ_{\text{df}}=(sʻ\text{D}ʻM)\cap CʻQ.$

Hence we easily obtain $M(\Pi ʻ\text{df}^{;}P)N.\equiv .M,N\in F_{\Delta }ʻdfʻʻCʻP.(sʻ\text{D}ʻM)(\Sigma ʻP)_{\text{df}}(sʻ\text{D}ʻN),$ whence $\mu (\text{Prod}ʻ\text{df}^{;}P)\nu .\equiv .\mu ,\nu \in \text{Prod}ʻ\text{Cl}ʻʻCʻʻCʻP.(sʻ\mu )(\Sigma ʻP)_{\text{df}}(sʻ\nu ),$ whence the result follows easily.

*177·22. $\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\text{Prod}ʻ\text{df}^{;}P \,\text{smor}(\Sigma ʻP)_{\text{df}} \quad[*177·21]$

In the present section, we shall be concerned with the arithmetical operations on relation-numbers. Their purely logical properties have been dealt with in Section A; in the present section, it is their arithmetical properties that are to be established. These properties result immediately from the arithmetical properties of relations which have been established in Sections B and C. The subjects treated of in the present section are analogous to those treated of in Section B of Part III. with the exception of such as have already had their analogues discussed in Sections B and C of Part IV. The analogy is sufficiently close to render it often unnecessary to give proofs, since these are often step by step analogous to the proofs of corresponding propositions in Part III, Section B.

The two chief requisites in defining the arithmetical operations with relation-numbers are (1) to take due account of types, (2) to construct what may be called separated relations, i.e. relations of mutually exclusive relations derived from and ordinally similar to given relations. Each of these points calls for some preliminary explanations.

The sum of two relation-numbers $\mu$ , $\nu$ will be denoted by " $\mu \dot{+} \nu$ ," in order to distinguish this kind of addition from $\mu + \nu$ (the arithmetical addition of classes) and $\mu +_{c}\nu$ (the addition of cardinals). In defining $\mu \dot{+}\nu$ , we have to take account of the following considerations.

Suppose $P$ and $Q$ are two relations which are of the same type, and have mutually exclusive fields. Then obviously we shall want to frame our definition of the sum of two relation-numbers in such a way that the sum of $\text{Nr}ʻP$ and $\text{Nr}ʻQ$ shall be $\text{Nr}ʻ(P\unicode{x2909}Q)$ . But if $P$ and $Q$ are not of the same type, $P\unicode{x2909}Q$ is meaningless; and if $CʻP$ and $CʻQ$ overlap, $P\unicode{x2909}Q$ may be too small to have as its relation-number the sum of the relation-numbers of $P$ and $Q$ . Both these difficulties can be met by observing that, if $\text{Nr}ʻP=\text{Nr}ʻR$ and $\text{Nr}ʻQ\text{Nr}ʻS$ , we must make such definitions as to have $\text{Nr}ʻP\dot{+} \text{Nr}ʻQ=\text{Nr}ʻR\dot{+} \text{Nr}ʻS.$ [Pg 474] Hence, in defining the sum of the relation-numbers of $P$ and $Q$ , we may replace $P$ and $Q$ by any two relations $R$ and $S$ which are respectively like $P$ and $Q$ . Therefore what we require for our definition is to find two relations $R$ and $S$ which (1) are respectively like $P$ and $Q$ , (2) are of the same type, (3) have mutually exclusive fields. All these three requisites are satisfied if we put $R=\downarrow (\Lambda\cap CʻQ)^{;}\iota ^{;}P.S=(\Lambda\cap CʻP)\downarrow ^{;}\iota ^{;}Q.$ We then define $P+Q$ as meaning $R\unicode{x2909}S$ , and we define the sum of the relation-numbers of $P$ and $Q$ as the relation-number of $P+Q$ . This procedure is exactly analogous to that of *110; in fact, we have $Cʻ(P+Q)=CʻP+CʻQ.$

In defining the sum of the relation-numbers of a field, we do not have to consider types, because the members of a field are necessarily all of the same type. But we do have to consider the question of overlapping. If a term $x$ occurs both in $CʻQ$ and in $CʻR$ where $Q,R\in CʻP$ , we want a method of counting x twice over in forming the arithmetical sum. Thus $\text{Nr}ʻ\Sigma ʻP$ cannot be taken as the sum of the relation-numbers of members of $CʻP$ , unless $P \in \text{Rel}^{2}\text{excl}$ . Suppose, for instance, we have three series $(a, b, c),\quad ( b, c, a),\quad (c, a, b).$ These each have three terms; and we want the sum of their relation-numbers to be the relation-number of a series of nine terms. But if we put $\begin{aligned} Q &= a\downarrow b\downarrow c \qquad(\text{where}\, a\downarrow b\downarrow c\, \text{is written for}\, a\downarrow b\unicode{x228d} a\downarrow c\unicode{x228d} b\downarrow c),\\ R &= b\downarrow c\downarrow a,\\ S &= c\downarrow a\downarrow b,\\ \end{aligned}$ and if we further put $P = Q\downarrow R\downarrow S,$ so that $P$ places the above three series in the above order, we have $\Sigma ʻP=(\iota ʻa\cup \iota ʻb\cup \iota ʻc)\uparrow (\iota ʻa\cup \iota ʻb\cup \iota ʻc),$ which is not a series, and does not have the relation-number which we require as the sum of the relation-numbers of $Q$ , $R$ , $S$ .

What is wanted is a method of distinguishing the various occurrences of $a$ and $b$ and $c$ . For this reason, when $a$ occurs as a member of the field of $Q$ , we replace it by $a\downarrow Q$ ; when as a member of the field of $R$ , by $a\downarrow R$ ; and when as a member of the field of $S$ , by $a\downarrow S$ . Thus the series $(a, b, c)$ is replaced by $(a\downarrow Q, b\downarrow Q, c\downarrow Q)$ ; $(b, c, a)$ is replaced by $(b\downarrow R, c\downarrow R, a\downarrow R)$ ; and $(c, a, b)$ is replaced by $(c\downarrow S, a\downarrow S, b\downarrow S)$ . The sum of these three series then has the relation-number which is required as the sum of the relation-numbers of $Q$ , $R$ , $S$ .

The above process is symbolized as follows. The generating relation of the series $(a\downarrow Q, b\downarrow Q, c\downarrow Q)$ is $\downarrow Q^{;}Q$ ; thus the three relations whose sum is to be taken are $\downarrow Q^{;}Q$ , $\downarrow R^{;}R$ , $\downarrow S^{;}S$ , i.e. using the notation of *182, according to which we put $\unicode{x2640}ʻx=x\unicode{x2640}x$ , our three relations are $\breve{\downarrow}_{.,}ʻQ$ , $\breve{\downarrow}_{.,}ʻR$ , $\breve{\downarrow}_{.,}ʻS$ . But the generating relation of the series $(\breve{\downarrow}_{.,}ʻQ,\, \breve{\downarrow}_{.,}ʻR,\,\breve{\downarrow}_{.,}ʻS)$ is $\breve{\downarrow}_{.,}^{;}P$ , since $P=(Q\downarrow R\downarrow S)$ . Thus $\breve{\downarrow}_{.,}^{;}P$ is the relation required for defining the sum of the relation-numbers of members of the field of $P$ ; i.e. we put $\Sigma \text{Nr}ʻP=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \quad\text{Df}.$ We will call $\breve{\downarrow}_{.,}^{;}P$ the separated relation corresponding to $P$ . $\breve{\downarrow}_{.,}^{;}P$ is constructed, as above, by replacing every member $x$ of $CʻQ$ , where $Q\in CʻR$ , by $x\downarrow Q$ ; so that if $x$ belongs both to $CʻQ$ and to $CʻR$ , it is duplicated by being transformed once into $x\downarrow Q$ , and once again into $x\downarrow R$ .

For the treatment of products, we do not require $\breve{\downarrow}_{.,}^{;}P$ , because $\Pi ʻP$ has been so defined as to effect the requisite separation. We might, however, by the use of $\breve{\downarrow}_{.,}^{;}P$ , have dispensed with $\Pi ʻP$ as a fundamental notion, and contented ourselves with $\text{Prod}ʻP$ ; for we have $\Pi ʻP = \dot{s} ^{;}\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P.$ Thus we might have taken $\text{Prod}$ as the fundamental notion, and defined $\Pi$ by means of it.

The addition of unity to a relation-number has to be treated separately from the addition of two relation-numbers, for the same reasons which necessitate the treatment of $P\unicode{x21f8} x$ and $x\unicode{x21f7}P$ separately from $P\unicode{x2909}Q$ . There is no ordinal number 1, but we can define the addition of one to a relation-number. If $\text{Nr}ʻP=\mu$ and $x{\sim}\in CʻP$ , we must have $\text{Nr}ʻ(P\unicode{x21f8} x)=\mu \dot{+} \dot{1} ,$ where we write " $\dot{1}$ " for unity as an addendum. We do not write " $1_r$ ," because we shall, at a later stage, give a general definition of $\mu _r$ , in virtue of which, if $\mu$ is an inductive cardinal, $\mu _r$ will be the corresponding ordinal. This definition entails $1_r=\Lambda$ , and therefore we use a different symbol " $\dot{1}$ " for 1 as addendum. The symbol $\dot{1}$ is only defined in its uses, and has no significance except in a use which has been specially defined.

We define the product $\mu \dot{\times} \nu$ as the relation-number of $P\times Q$ , when $\mu =\text{N}_0\text{r}ʻP$ and $\nu=\text{N}_0\text{r}ʻQ$ . The product so defined obeys the associative law, and obeys the distributive law in the form $(\nu \dot{+} \varpi )\dot{\times} \mu =(\nu \dot{\times} \mu )\dot{+} (\varpi \dot{\times} \mu )$ but not, in general, in the form $\mu \dot{\times} (\nu \dot{+} \varpi )=(\mu \dot{\times} \nu )\dot{+} (\mu \dot{\times} \varpi ).$ [Pg 476] The latter form holds when $\mu$ , $\nu$ , $\varpi$ are finite ordinals, as we shall prove at a later stage (*262). The commutative law also does not hold in general for ordinal addition and multiplication, but holds where finite ordinals are concerned.

The product of the numbers of the members of $CʻP$ , in the order generated by $P$ , is defined as being $\text{Nr}ʻ\Pi ʻP$ , and is denoted by $\Pi \text{Nr}ʻP$ . It will be seen that $\Pi\text{Nr}ʻP$ is not a function of $CʻP$ , since the value of a product depends upon the order of the factors; it is also not a function of $\text{Nr}^{;}P$ , unless no two members of $CʻP$ have the same relation-number. The properties of $\Pi \text{Nr}ʻP$ result from *172 and *174.

" $\mu$ to the $\nu$ th power" is denoted by " $\mu \,\text{exp}\,\,_r\nu$ " and is defined as the relation-number of $P \,\text{exp}\,\, Q$ , where $\mu =\text{N}_0\text{r}ʻP$ and $\nu = \text{N}_0\text{r}ʻQ$ . Its properties result from the propositions of *176 and *177.

In order to define the sum of two relation-numbers, we proceed (as in *110) to construct a relation whose relation-number shall be the required sum. For this purpose, we put $P+Q=\{\downarrow (\Lambda\cap CʻQ)^{;}\iota ^{;}P\}\unicode{x2909}\{(\Lambda\cap CʻP)\downarrow ^{;}\iota ^{;}Q\} \quad\text{Df}.$ This definition has the following merits: (1) whatever may be the types of $P$ and $Q$ , $\downarrow (\Lambda \cap CʻQ)^{;}\iota ^{;}P$ is of the same type as $(\Lambda \cap CʻP)\downarrow ^{;}\iota ^{;}Q$ ; (2) however the fields of $P$ and $Q$ may overlap, and even if $P=Q$ , the fields of $\downarrow (\Lambda \cap CʻQ)^{;}\iota ^{;}P$ and $(\Lambda \cap CʻP)\downarrow ^{;}\iota ^{;}Q$ are mutually exclusive; (3) these two relations are respectively similar to $P$ and $Q$ . Hence it is evident that, without placing any restriction upon $P$ and $Q$ , we may take the relation-number of $P+Q$ as defining the sum of the relation-numbers of $P$ and $Q$ . Hence we put $\mu \dot{+} \nu =\hat{R} \{(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P+Q)\} \quad\text{Df}.$ From this definition it follows that $\mu \dot{+} \nu$ is null unless $\mu$ and $\nu$ are homogeneous relation-numbers, but that if they are the homogeneous relation-numbers of $P$ and $Q$ , then $\mu \dot{+} \nu$ is the relation-number of $P+Q$ .

In order to be able to deal with typically ambiguous relation-numbers, we put, as in *110, $\begin{aligned} \text{Nr}ʻP\dot{+} \nu &=\text{N}_{0}\text{r}ʻP\dot{+} \nu \quad\text{Df},\\ \mu \dot{+} \text{Nr}ʻQ&=\mu \dot{+} \text{N}_{0}\text{r}ʻQ \quad\text{Df}. \end{aligned}$

*180·3. $\begin{align}\vdash .\text{Nr}ʻP\dot{+} \text{Nr}ʻQ&=\text{N}_{0}\text{r}ʻP\dot{+} \text{Nr}ʻQ=\text{Nr}ʻP\dot{+} \text{N}_{0}\text{r}ʻQ\\ &=\text{N}_{0}\text{r}ʻP\dot{+} \text{N}_{0}\text{r}ʻQ=\text{Nr}ʻ(P+Q)\end{align}$

*180·31. $\vdash :P\,\text{smor}\,R.Q\text{smor}S.\supset .\text{Nr}ʻP\dot{+} \text{Nr}ʻQ=\text{Nr}ʻR\dot{+} \text{Nr}ʻS$

This proposition is essential, since otherwise $\text{Nr}ʻP\dot{+}\text{Nr}ʻQ$ would not be a function of $\text{Nr}ʻP$ and $\text{Nr}ʻQ$ , but would depend upon the particular $P$ and $Q$ .

*180·32. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .\text{Nr}ʻP\dot{+} \text{Nr}ʻQ=\text{Nr}ʻ(P\unicode{x2909}Q)$

*180·4. $\vdash :\exists !\mu \dot{+} \nu .\supset .\mu ,\nu \in \text{NR}-\iota ʻ\Lambda .\mu ,\nu \in \text{N}_{0}\text{R}$

*180·56. $\vdash . (\mu \dot{+} \nu ) \dot{+} \varpi = \mu \dot{+} (\nu \dot{+} \varpi )$

*180·61. $\vdash . \text{Nr}ʻP \dot{+} 0_r = \text{Nr}ʻP = 0_r \dot{+} \text{Nr}ʻP$

*180·71. $\vdash : \mu , \nu \in \text{NR} . \supset . Cʻʻ(\mu \dot{+} \nu ) = Cʻʻ\mu +_c Cʻʻ\nu$

This proposition gives the connection of ordinal and cardinal addition. It should be observed that, in virtue of *154·9, $Cʻʻ\mu$ and $Cʻʻ\nu$ are cardinals when $\mu$ and $\nu$ are relation-numbers.

*180·01. $P + Q = {\downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P} \unicode{x2909} \{(\Lambda \cap CʻP) \downarrow ^{;}\iota ^{;}Q\} \quad\text{Df}$

*180·02. $\mu \dot{+} \nu = \hat{R} \{(\exists P,Q) . \mu = \text{N}_0\text{r}ʻP . \nu = \text{N}_0\text{r}ʻQ . R\,\text{smor}\,(P + Q)\} \quad\text{Df}$

*180·03. $\text{Nr}ʻP \dot{+} \nu = \text{N}_0\text{r}ʻP \dot{+} \nu \quad\text{Df}$

*180·031. $\mu \dot{+} \text{Nr}ʻQ = \mu \dot{+} \text{N}_0\text{r}ʻQ \quad\text{Df}$

On the purpose of the definitions *180·03 ·031, see the remarks on the corresponding definitions in *110 and $\text{IIT}$ of the Prefatory Statement.

*180·1. $\vdash . P + Q = {\downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P} \unicode{x2909} \{(\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q\} \quad[(*180·01)]$

*180·101. $\begin{align}\vdash . Cʻ \downarrow &(\Lambda \cap CʻQ)^{;}{℩}^{;}P = \downarrow (\Lambda \cap CʻQ)ʻʻ{℩}ʻʻCʻP.\\ &Cʻ(\Lambda \cap CʻP) \downarrow ^{;}\iota {℩}^{;}Q = (\Lambda \cap CʻP) \downarrow ʻʻ{℩}ʻʻCʻQ \quad[*150·22]\end{align}$

*180·11. $\vdash . Cʻ \downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P \cap Cʻ(\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q = \Lambda \quad[*180·101 . *110·11]$

Dem. $\begin{array}{l} \vdash . *180·101 . *160·14 . \supset \vdash . Cʻ(P + Q) &= \downarrow (\Lambda \cap CʻQ)ʻʻ{℩}ʻʻCʻP \cup (\Lambda \cap CʻP) \downarrow ʻʻ{℩}ʻʻCʻQ\\ [(*110·01)] &= CʻP + CʻQ . \supset \vdash . \text{Prop} \end{array}$

*180·12. $\vdash . \downarrow (\Lambda \cap CʻP)^{;}{℩}^{;}P \,\text{smor} P . (\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q \,\text{smor}\, Q \quad[*151·61·64·65]$

*180·13. $\vdash : R \,\text{smor}\, P . S \,\text{smor}\, Q . CʻR \cap CʻS = \Lambda . \supset . R \unicode{x2909} S \,\text{smor}\, P + Q$

Dem. $\begin{array}{l} \vdash . *180·12 . \supset \vdash : \text{Hp} . &\supset . R \,\text{smor}\, \downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P . S \,\text{smor}\, (\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q &\qquad \text{(1)}\\ \vdash . (1) . *180·11 . *160·48 . \supset \\ \vdash : \text{Hp} . &\supset . R \unicode{x2909} S \,\text{smor}\, \{\downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P \unicode{x2909} (\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q\} .\\ [(*180·01)] &\supset . R \unicode{x2909} S \,\text{smor}\, (P + Q) : \supset \vdash . \text{Prop} \end{array}$

*180·14. $\vdash : CʻP \cap CʻQ = \Lambda . \supset . P \unicode{x2909} Q \,\text{smor}\, P + Q \quad[*180·13 . *151·13]$

*180·15. $\vdash : R \,\text{smor}\, P . S \,\text{smor}\, Q . \supset . R + S \,\text{smor}\, P + Q$

Dem. $\begin{array}{l} \vdash . *180·12 . \supset \vdash : \text{Hp} . &\supset . \downarrow (\Lambda \cap CʻS)^{;}{℩}^{;}R \,\text{smor}\, P . (\Lambda \cap CʻR) \downarrow ^{;}{℩}^{;}S \,\text{smor}\, Q.\\ [*180·13] &\supset . \{\downarrow (\Lambda \cap CʻS)^{;}{℩}^{;}R \unicode{x2909} (\Lambda \cap CʻR) \downarrow ^{;}{℩}^{;}S\} \,\text{smor}\, P + Q.\\ [(*180·01)] &\supset . R + S \,\text{smor}\, P + Q : \supset \vdash . \text{Prop} \end{array}$

*180·151. $\begin{align}\vdash \colon\ldotp &CʻP\cap C\supset Q=\Lambda .\supset :Z\,\text{smor}\,(P\unicode{x2909}Q).\equiv .\\ &(\exists R,S).R\,\,\text{smor}\,\,P.S\,\text{smor}\,Q.CʻR\cap CʻS=\Lambda .Z=R\unicode{x2909}S\end{align}$

Dem. $\begin{array}{l} \vdash .*160·48.&\supset \vdash \colon\ldotp \text{Hp}.\supset :(\exists R,S).R\,\,\text{smor}\,\,P.S\,\text{smor}\,Q.CʻR\cap CʻS=\Lambda .\\ &Z=R\unicode{x2909}S.\supset .Z\,\text{smor}\,(P\unicode{x2909}Q) &\qquad \text{(1)}\\ \vdash .*160·44. &\supset \vdash :T\in Z\overline{\,\text{smor}\,} (P\unicode{x2909}Q).\supset .Z=T^{;}P\unicode{x2909}T^{;}Q &\qquad \text{(2)}\\ \vdash .*160·14.*151·11.&\supset \vdash :T\in Z\overline{\,\text{smor}\,} (P\unicode{x2909}Q).\supset .CʻP\subset \text{ᗡ}ʻT.CʻQ\subset \text{ᗡ}ʻT &\qquad \text{(3)}\\ \vdash .(3).*151·21.&\supset \vdash :T\in Z\overline{\,\text{smor}\,} (P\unicode{x2909}Q).\supset .T^{;}P\,\,\text{smor}\,\,P.T^{;}Q\,\text{smor}\,Q &\qquad \text{(4)}\\ \vdash .*72·411.*150·22.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &T\in Z\,\text{smor}\,(P\unicode{x2909}Q).\supset .CʻT^{;}P\cap CʻT^{;}Q=\Lambda &\qquad \text{(5)}\\ \vdash .(2).(4).(5). &\supset \vdash \colon\ldotp \text{Hp}.\supset :T\in Z\overline{\,\text{smor}\,} (P\unicode{x2909}Q).\supset .\\ &T^{;}P\,\,\text{smor}\,\,P.T^{;}Q\,\text{smor}\,Q.CʻT^{;}P\cap CʻT^{;}Q=\Lambda .Z=T^{;}P\unicode{x2909}T^{;}Q:\\ [*151·12] &\supset :Z\,\text{smor}\,(P\unicode{x2909}Q).\supset .\\ &(\exists R,S).R\,\,\text{smor}\,\,P.S\,\text{smor}\,Q.CʻR\cap CʻS=\Lambda .Z=R\unicode{x2909}S &\qquad \text{(6)}\\ \vdash .(1).(6).\supset \vdash .\text{Prop} \end{array}$

*180·152. $\begin{align}\vdash :Z\,\text{smor}\,&(P+Q).\equiv .\\ &(\exists R,S).R\,\,\text{smor}\,\,P.S\,\text{smor}\,Q.CʻR\cap CʻS=\Lambda .Z=R\unicode{x2909}S\\ &[*180·151·11·12]\end{align}$

*180·16. $\begin{align}\vdash .\text{Nr}ʻ&(P+Q)=\\ &\hat{Z} \{(\exists R,S).R\in \text{Nr}ʻP.S\in \text{Nr}ʻQ.CʻR\cap CʻS=\Lambda .Z=R\unicode{x2909}S\}\\ &[*180·152.*152·11]\end{align}$

*180·2. $\begin{align}&\vdash :Z\in \mu \dot{+} \nu .\equiv .(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.Z\,\text{smor}\,(P+Q)\\ &[(*180·02)]\end{align}$

*180·201. $\begin{align}&\vdash \colon\ldotp Z\in \mu \dot{+} \nu .\equiv :\mu ,\nu \in \text{N}_{0}\text{R}:(\exists P,Q).P\in \mu .Q\in \nu .Z\,\text{smor}\,(P+Q)\\ &[*155·27.*180·2]\end{align}$

*180·202. $\begin{align}\vdash \colon\ldotp Z\in &\mu \dot{+} \nu .\equiv :\\ &\exists !\mu .\exists !\nu :(\exists P,Q).\mu =\text{Nr}ʻP.\nu =\text{Nr}ʻQ.Z\,\text{smor}\,(P+Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*155·34·22.*180·201.\supset \\ \vdash \colon\ldotp Z\in \mu \dot{+} \nu .&\equiv :\exists !\mu .\exists !\nu .\mu ,\nu \in \text{NR}:(\exists P,Q).P\in \mu .Q\in \nu .Z\,\text{smor}\,(P+Q):\\ [*152·44]&\equiv :\exists !\mu .\exists !\nu .\mu ,\nu \in \text{NR}:(\exists P,Q).\mu =\text{Nr}ʻP.\nu =\text{Nr}ʻQ.Z\,\text{smor}\,(P+Q):\\ [*152·41]&\equiv :\exists !\mu .\exists !\nu :(\exists P,Q).\mu =\text{Nr}ʻP.\nu =\text{Nr}ʻQ.Z\,\text{smor}\,(P+Q)\colon\ldotp \\ \supset \vdash .\text{Prop} \end{array}$

In the following propositions proofs are omitted, since they are exactly analogous to proofs of propositions in *110 whose numbers have the same decimal part.

*180·21. $\vdash \colon\ldotp \mu ,\nu \in \text{NR}.\supset :Z\in \mu \dot{+} \nu .\equiv .(\exists P,Q).P\in \mu .Q\in \nu .Z\,\text{smor}\,(P\dot{+}Q)$

*180·211. $\begin{align}\vdash \colon\ldotp &\mu , \nu \in \text{NR} . \supset : Z \in \mu \dot{+} \nu . \equiv .\\ &(\exists R, S) . R \in \,\text{smor}\,ʻʻ\mu . S \in \,\text{smor}\,ʻʻ\nu . CʻR \cap CʻS = \Lambda . Z = R \unicode{x2909} S\end{align}$

*180·212. $\begin{align}\vdash \colon\ldotp &\mu , \nu \in \text{NR} . \supset : Z \in \mu \dot{+} \nu . \equiv .\\ &(\exists R) . R \in \,\text{smor}\,ʻʻ\mu . R \,\unicode{x2abd}\, Z . Z \unicode{x0294f} (- CʻR) \in \,\text{smor}\,ʻʻ\nu\end{align}$

*180·22. $\vdash . \text{N}_{0}\text{r}ʻP \dot{+} \text{N}_{0}\text{r}ʻQ = \text{Nr}ʻ(P \dot{+} Q)$

*180·24. $\begin{align}&\vdash : R \,\text{smor}\, P . S \,\text{smor}\, Q . \supset . \text{N}_{0}\text{r}ʻR \dot{+} \text{N}_{0}\text{r}ʻS = \text{N}_{0}\text{r}ʻP \dot{+} \text{N}_{0}\text{r}ʻQ\\ &[*180·15·22]\end{align}$

*180·3. $\begin{align}\vdash . \text{Nr}ʻP \dot{+} &\text{Nr}ʻQ = \text{N}_{0}\text{r}ʻP \dot{+} \text{Nr}ʻQ = \text{Nr}ʻP \dot{+} \text{N}_{0}\text{r}ʻQ\\ &= \text{N}_{0}\text{r}ʻP \dot{+} \text{N}_{0}\text{r}ʻQ = \text{Nr}ʻ(P \dot{+} Q) \quad[*180·22 . (*180·03·031)]\end{align}$

*180·31. $\vdash : P \,\,\text{smor}\, R . Q \,\text{smor}\, S . \supset . \text{Nr}ʻP \dot{+} \text{Nr}ʻQ = \text{Nr}ʻR \dot{+} \text{Nr}ʻS$

*180·32. $\vdash : CʻP \cap CʻQ = \Lambda . \supset . \text{Nr}ʻP \dot{+} \text{Nr}ʻQ = \text{Nr}ʻ(P \unicode{x2909} Q) \quad[*180·14·3]$

*180·4. $\vdash : \exists ! \mu \dot{+} \nu . \supset . \mu , \nu \in \text{NR} - {℩}ʻ\Lambda . \mu , \nu \in \text{N}_{0}\text{R}$

*180·43. $\vdash : \mu \dot{+} \nu = \text{N}_{0}\text{r}ʻZ . \equiv . Z \in \mu \dot{+} \nu$

Dem. $\begin{array}{l} \vdash . *160·44 . (*180·01) . \supset \\ &\vdash : Pʻ = \downarrow (\Lambda \cap CʻR)^{;}{℩}^{;} \downarrow (\Lambda \cap CʻQ)^{;}{℩}^{;}P . Qʻ = \downarrow (\Lambda \cap CʻR)^{;} \iota ^{;}(\Lambda \cap CʻP) \downarrow ^{;}{℩}^{;}Q .\\ R' = \{\Lambda \cap Cʻ(P + Q)\} \downarrow ^{;}{℩}^{;}R . &\supset . P' \unicode{x2909} Q' = \downarrow (\Lambda \cap CʻR)^{;}{℩}^{;}(P + Q) . &\qquad \text{(1)}\\ [(*180·01)] &\supset . (P' \unicode{x2909} Q') \unicode{x2909} R' = (P + Q) + R .\\ [*160·31] &\supset . P' \unicode{x2909} (Q' \unicode{x2909} R') = (P + Q) + R &\qquad \text{(2)}\\ \vdash . (1). *180·11 \frac{P + Q,\, R}{P,\,Q}. *160·14 . \supset \vdash : \text{Hp} (1) . \supset .\\ &CʻPʻ \cap CʻRʻ = \Lambda . CʻQʻ \cap CʻR' = \Lambda &\qquad \text{(3)}\\ \vdash . *180·11 . *72·411 . *150·22 .& \supset \vdash : \text{Hp} (1) . \supset . CʻP' \cap CʻQ' = \Lambda &\qquad \text{(4)}\\ \vdash . (3) . (4) . *160·14 . &\supset \vdash : \text{Hp} (1) . \supset . CʻP' \cap Cʻ(Q' \unicode{x2909} R') = \Lambda &\qquad \text{(5)}\\ \vdash . *180·12 . &\supset \vdash : \text{Hp} (1) . \supset . P' \,\text{smor}\, P . Q' \,\text{smor}\, Q . R' \,\text{smor}\, R &\qquad \text{(6)}\\ \vdash . (3) . (6) . *180·13 . \supset \vdash : \text{Hp} (1) . &\supset . Q' \unicode{x2909} R' \,\text{smor}\, Q + R .\\ [(5) . (6) . *180·13] &\supset . P' \unicode{x2909} (Q' \unicode{x2909} R') \,\text{smor}\, P + (Q + R) .\\ [(2)] &\supset . (P + Q) + R \,\text{smor}\, P + (Q + R) &\qquad \text{(7)}\\ \vdash . (7) . *13·19 . \supset \vdash . \text{Prop} \end{array}$

*180·54. $\vdash . (\text{Nr}ʻP \dot{+} \text{Nr}ʻQ) \dot{+} \text{Nr}ʻR = \text{Nr}ʻ(P + Q + R)$

*180·541. $\vdash . \text{Nr}ʻP \dot{+} (\text{Nr}ʻQ \dot{+} \text{Nr}ʻR) = \text{Nr}ʻ(P + Q + R)$

*180·55. $\vdash . (\text{Nr}ʻP \dot{+} \text{Nr}ʻQ) \dot{+} \text{Nr}ʻR = \text{Nr}ʻP \dot{+} (\text{Nr}ʻQ \dot{+} \text{Nr}ʻR)$

*180·551. $\vdash .(\text{N}_{0}\text{r}ʻP\dot{+} \text{N}_{0}\text{r}ʻQ)\dot{+} \text{N}_{0}\text{r}ʻR = \text{N}_{0}\text{r}ʻP\dot{+} (\text{N}_{0}\text{r}ʻQ\dot{+} \text{N}_{0}\text{r}ʻR)$

*180·56. $\vdash .(\mu \dot{+} \nu )\dot{+} \omega = \mu \dot{+} (\nu \dot{+} \omega )$

*180·561. $\mu \dot{+} \nu \dot{+} \omega = (\mu \dot{+} \nu ])\dot{+} \omega \quad\text{Df}$

*180*57. $\vdash .(\mu \dot{+} \nu )\dot{+} (\omega \dot{+} \rho ) = \mu \dot{+} \nu \dot{+} \omega \dot{+} \rho$

*180·6. $\vdash :\mu \in \text{NR}.\supset .\mu \dot{+} 0_{r} = \,\text{smor}\,ʻʻ\mu = 0_{r}\dot{+} \mu$

Observe that $\mu \dot{+} 0_{r} = 0_{r}\dot{+} \mu$ is an equation depending upon the peculiar properties of $0_{r}$ . We do not in general have $\mu \dot{+} \nu = \nu \dot{+} \mu$ unless $\mu$ and $\nu$ are finite ordinals.

*180·61. $\vdash .\text{Nr}ʻP\dot{+} 0_{r} = \text{Nr}ʻP = 0_{r}\dot{+} \text{Nr}ʻP$

Note that $\dot{1} \dot{+} 0_{r}$ , which will be defined in *181, is $0_{r}$ , not $\dot{1}$ .

The following propositions, being concerned with the relations of relation-numbers and cardinal numbers, have no analogues in *110.

*180·7. $\vdash .CʻʻN_{r}ʻ(P+Q) = CʻʻN_{r}ʻP+_{c}Cʻʻ\text{Nr}ʻQ = \text{Nc}ʻCʻP+_{c}\text{Nc}ʻCʻQ$

Dem. $\begin{array}{l} \vdash .*152·7.\supset \vdash .Cʻʻ\text{Nr}ʻ(P+Q) &= \text{Nc}ʻCʻ(P+Q)\\ [*180·111] & = \text{Nc}ʻ(CʻP+CʻQ)\\ [*110·3] & = \text{Nc}ʻCʻP+_{c}\text{Nc}ʻCʻQ &\qquad \text{(1)}\\ [*152·7] & = Cʻʻ\text{Nr}ʻP+_{c}Cʻʻ\text{Nr}ʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*180·71. $\vdash :\mu ,\nu \in \text{NR}.\supset .Cʻʻ(\mu \dot{+} \nu ) = Cʻʻ\mu +_{c}Cʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*152·4.\supset \vdash :\text{Hp}.&\supset .(\exists P,Q).\mu = \text{Nr}ʻP.\nu = \text{Nr}ʻQ.\\ [*180·3]&\supset .(\exists P,Q).\mu = \text{Nr}ʻP.\nu = \text{Nr}ʻQ.\mu \dot{+} \nu = \text{Nr}ʻ(P+Q).\\ [*180·7] \supset .(\exists P,Q).\mu &= \text{Nr}ʻP.\nu = \text{Nr}ʻQ.\\ &Cʻʻ(\mu \dot{+} \nu = Cʻʻ\text{Nr}ʻP+_{c}Cʻʻ\text{Nr}ʻQ.\\ [*13·193] &\supset .Cʻʻ(\mu \dot{+} \nu ) = Cʻʻ\mu +_{c}Cʻʻ\nu :\supset \vdash .\text{Prop} \end{array}$

The relation-number $\dot{1}$ has, according to our definitions, no meaning in isolation, because our definitions are framed with a view to series, and a series cannot consist of one term. But we can add one term to a series; hence $\dot{1}$ is required as an addendum. In order to get our definitions in the most manageable form, we first construct a relation, which we call $P\dot{\unicode{x21f8}}x$ , which is such that, whenever $P$ exists, $P\dot{\unicode{x21f8}}x$ has one more term in its field than $P$ ; the relation-number of this relation is then defined as $\text{Nr}ʻP\dot{+} \dot{1}$ . We add also a definition $\dot{1} \dot{+} \dot{1} =2_r \quad\text{Df}$ which is purely formal, and serves to minimize exceptions to the associative law of addition.

The definitions are closely analogous to those of *180. We put $P\dot{\unicode{x21f8}} x = \downarrow \Lambda _{x}^{;}{℩}^{;}P\unicode{x21f8} (\Lambda \cap CʻP)\downarrow {℩}ʻx \quad\text{Df}$ with a similar definition for $x\dot{\unicode{x21f7}} P$ . $x$ and $P$ may be of any relative types, and we have always $\downarrow \Lambda _{x}^{;}{℩}^{;}P \,\,\text{smor}\, P.(\Lambda \cap CʻP)\downarrow {℩}ʻx{\sim}\in Cʻ\downarrow \Lambda _{x}^{;}{℩}^{;}P \quad(*181·11·12).$ We put $\mu \dot{+} \dot{1} = \hat{R} \{(\exists P,x).\text{N}_{0}\text{r}ʻP = \mu .R \,\text{smor}\, (P\dot{\unicode{x21f8}} x)\} \quad\text{Df}$ with a similar definition for $\dot{1} \dot{+} \mu$ . We also introduce definitions analogous to *180·03 ·031.

*181·3. $\vdash .\text{Nr}ʻP\dot{+} \dot{1} = \text{N}_{0}\text{r}ʻP\dot{+} \dot{1} = \text{Nr}ʻ(P\dot{\unicode{x21f8}} x)$

*181·31. $\vdash :P \,\,\text{smor}\, \,Q.\supset .\text{Nr}ʻP\dot{+} \dot{1} = \text{Nr}ʻQ\dot{+} \dot{1}$

*181·32. $\vdash :x{\sim}\in CʻP.\supset .\text{Nr}ʻP\dot{+} \dot{1} = \text{Nr}ʻ(P\unicode{x21f8} x)$

*181·33. $\vdash \colon\ldotp \mu ,\nu \in \text{NR}.\exists !\mu \dot{+} \dot{1} .\supset :\mu = \nu .\equiv .\mu \dot{+} \dot{1} = \nu \dot{+} \dot{1} .\equiv .\dot{1} \dot{+} \mu = \dot{1} \dot{+} \nu$

*181·4. $\vdash :\exists !\mu \dot{+} \dot{1} .\supset .\mu \in \text{NR}-{℩}ʻ\Lambda .\mu \in \text{N}_{0}\text{R}$

The following propositions are formally forms of the associative law, but they need separate proof on account of the peculiarity of $\dot{1}$ .

*181·54. $\vdash : \nu \neq 0_{r} . \supset . (\mu \dot{+} \nu) \dot{+} \dot{1} = \mu \dot{+} (\nu \dot{+} \dot{1} )$

*181·56. $\vdash : \mu \neq 0_{r} . \supset . (\mu \dot{+} \dot{1} ) \dot{+} \dot{1} = \mu \dot{+} (\dot{1} \dot{+} \dot{1} ) = \mu \dot{+} 2_{r}$

*181·58. $\vdash : \mu \neq 0_{r} . \nu \neq 0_{r} . \supset . (\mu \dot{+} \dot{1} ) \dot{+} \nu = \mu \dot{+} (\dot{1} \dot{+} \nu)$

*181·59. $\vdash : \mu \neq 0_{r} . \nu \neq 0_{r} . \supset . (\mu \dot{+} \dot{1} ) \dot{+} (\dot{1} \dot{+} \nu) = \mu \dot{+} 2_{r} \dot{+} \nu$

*181·6. $\vdash : \dot{\exists} ! P . \supset . Cʻʻ\text{Nr}ʻ(P \dot{\unicode{x21f8}} x) = \text{Nc}ʻCʻP +_{c} 1$

*181·62. $\vdash : \mu \in \text{NR} - {℩}ʻ0_{r} . \supset . Cʻʻ(\mu \dot{+} \dot{1} ) = Cʻʻ(\dot{1} \dot{+} \mu ) = Cʻʻ\mu +_{c} 1$

*181·01. $P \dot{\unicode{x21f8}} x = \downarrow \Lambda _{x}^{;}{℩}^{;}P \unicode{x21f8} (\Lambda \cap CʻP) \downarrow {℩}ʻx \quad\text{Df}$

*181·011. $x \dot{\unicode{x21f7}} P = ({℩}ʻx) \downarrow (\Lambda \cap CʻP) \unicode{x21f7} \Lambda _{x} \downarrow ^{;}{℩}^{;}P \quad\text{Df}$

*181·02. $\mu \dot{+} \dot{1} = \hat{R} \{(\exists P, x) . \text{N}_{0}\text{r}ʻP = \mu . R \,\text{smor}\, (P \dot{\unicode{x21f8}} x)\} \quad\text{Df}$

*181·021. $\dot{1} \dot{+} \mu = \hat{R} \{(\exists P, x) . \text{N}_{0}\text{r}ʻP = \mu . R \,\text{smor}\, (x \dot{\unicode{x21f7}} P)\} \quad\text{Df}$

*181·03. $\text{Nr}ʻP \dot{+} \dot{1} = \text{N}_{0}\text{r}ʻP \dot{+} \dot{1} \quad\text{Df}$

*181·031. $\dot{1} \dot{+} \text{Nr}ʻP = \dot{1} \dot{+} \text{N}_{0}\text{r}ʻP \quad\text{Df}$

Propositions concerning $x \dot{\unicode{x21f7}} P$ are omitted in what follows, since they are proved exactly as the analogous propositions concerning $P \dot{\unicode{x21f8}} x$ are proved.

*181·1. $\begin{align}\vdash \colon\ldotp &R(P \dot{\unicode{x21f8}} x)S . \equiv : (\exists y, z) . yPz . R = ({℩}ʻy) \downarrow \Lambda _{x} . S = ({℩}ʻz) \downarrow \Lambda _{x} . \lor .\\ &(\exists y) . y \in CʻP . R = ({℩}ʻy) \downarrow \Lambda _{x} . S = (\Lambda \cap CʻP) \downarrow {℩}ʻx \quad[(*181·01)]\end{align}$

*181·11. $\vdash . (\Lambda \cap CʻP) \downarrow {℩}ʻx {\sim} \in Cʻ \downarrow \Lambda _{x}^{;}{℩}^{;}P$

Dem. $\begin{array}{l} \vdash .*150·22. &\supset \vdash . Cʻ \downarrow \Lambda _{x}^{;}{℩}^{;}P = \downarrow \Lambda _{x}ʻʻ{℩}ʻʻCʻP .\\ [*55·15] &\supset \vdash : Q \in Cʻ \downarrow \Lambda _{x}^{;}{℩}^{;}P . \supset _{Q} . \text{ᗡ}ʻQ = {℩}ʻ\Lambda _{x} &\qquad \text{(1)}\\ \vdash .*55·15. &\supset \vdash . \text{ᗡ}ʻ(\Lambda \cap CʻP) \downarrow {℩}ʻx = {℩}ʻ{℩}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).*51·161. \supset \vdash : Q \in Cʻ \downarrow \Lambda _{x}^{;}{℩}^{;}P . &\supset _{Q} . \text{ᗡ}ʻQ \neq \text{ᗡ}ʻ(\Lambda \cap CʻP) \downarrow {℩}ʻx .\\ [*30·37 . \text{Transp}] &\supset _{Q} . Q \neq (\Lambda \cap CʻP) \downarrow {℩}ʻx :\\ [*13·196] &\supset \vdash . (\Lambda \cap CʻP) \downarrow {℩}ʻx {\sim} \in Cʻ \downarrow \Lambda _{x}^{;}{℩}^{;}P . \supset \vdash . \text{Prop} \end{array}$

*181·12. $\vdash . \downarrow \Lambda _{x}^{;}{℩}^{;}P \,\,\text{smor}\, P \quad[*151·61·65]$

*181·13. $\vdash : Q \,\text{smor}\, P . y {\sim} \in CʻQ . \supset . Q \unicode{x21f8} y \,\text{smor}\, P \dot{\unicode{x21f8}} x$

Dem. $\begin{array}{l} \vdash .*181·12. \supset \vdash : \text{Hp} . \supset . Q \,\text{smor}\, \downarrow \Lambda _{x}^{;}{℩}^{;}P &\qquad \text{(1)}\\ \vdash .(1).*161·31.*181·11. \supset \vdash . \text{Prop} \end{array}$

*181·2. $\vdash :Z\in \mu \dot{+} \dot{1} .\equiv .(\exists P,x).\mu =\text{N}_{0}\text{r}ʻP.Z\,\text{smor}\,(P\dot{\unicode{x21f8}} x) \quad[(*181·02)]$

*181·21. $\begin{align}&\vdash \colon\ldotp \mu \in \text{NR}.\supset :Z\in \mu \dot{+} \dot{1} .\equiv .(\exists P,x).P\in \mu .Z\,\text{smor}\,(P\dot{\unicode{x21f8}} x)\\ &[*181·2 .*155·26]\end{align}$

*181*22. $\vdash .\text{N}_{0}\text{r}ʻP\dot{+} \dot{1} =\text{Nr}ʻ(P\dot{\unicode{x21f8}} x)$

Dem. $\begin{array}{l} \vdash . *181·21.\supset \vdash :Z\in \text{N}_{0}\text{r}ʻP\dot{+} \dot{1} .\equiv .(\exists Q,y).Q\in \text{N}_{0}\text{r}ʻP.Z\,\text{smor}\,(Q\dot{\unicode{x21f8}} y) &\qquad \text{(1)}\\ \vdash .(1).*155·12.*152·11.\supset \vdash .\text{Nr}ʻ(P\dot{\unicode{x21f8}} x)\subset \text{N}_{0}\text{r}ʻP\dot{+} \dot{1} &\qquad \text{(2)}\\ \vdash . *181·12·11.*161·31.\supset \vdash :Q\in \text{N}_{0}\text{r}ʻP.Z\,\text{smor}\,(Q\dot{\unicode{x21f8}} y).\supset .Z\,\text{smor}\,(P\dot{\unicode{x21f8}} x) &\qquad \text{(3)}\\ \vdash .(1).(3).*152·11. \supset \vdash :Z\in \text{N}_{0}\text{r}ʻP\dot{+} \dot{1} .\supset .Z\in \text{Nr}ʻ(P\dot{\unicode{x21f8}} x) &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash .\text{Prop} \end{array}$

*181·24. $\vdash :P\,\,\text{smor}\,\,Q.\supset .\text{N}_{0}\text{r}ʻP\dot{+} \dot{1} =\text{N}_{0}\text{r}ʻQ\dot{+} 1 \quad[*181·22·12·11.*161·31]$

*181·3. $\vdash .\text{Nr}ʻP\dot{+} \dot{1} =\text{N}_{0}\text{r}ʻP\dot{+} \dot{1} =\text{Nr}ʻ(P\dot{\unicode{x21f8}} x) \quad[*181·22.(*181·03)]$

*181·31. $\vdash :P\,\,\text{smor}\,\,Q.\supset .\text{Nr}ʻP\dot{+} \dot{1} =\text{Nr}ʻQ\dot{+} \dot{1} \quad[*181·3·24]$

*181·32. $\vdash :x{\sim}\in CʻP.\supset .\text{Nr}ʻP\dot{+} \dot{1} =\text{Nr}ʻ(P\unicode{x21f8} x) \quad[*181·3·13]$

*181·33. $\begin{align}&\vdash \colon\ldotp \mu ,\nu \in \text{NR}.\exists !\mu \dot{+} \dot{1} .\supset :\mu =\nu .\equiv .\mu \dot{+} \dot{1} =\nu \dot{+} \dot{1} .\equiv .\dot{1} \dot{+} \mu =\dot{1} \dot{+} \nu \\ &[*161·33.*181·3·11·12]\end{align}$

*181·4. $\vdash :\exists !\mu \dot{+} \dot{1} .\supset .\mu \in \text{NR}-\iota ʻ\Lambda .\mu \in \text{N}_{0}\text{R} \quad[*181·2.*155·22]$

Dem. $\begin{array}{l} \vdash .*181·3.\supset \vdash :\mu \in \text{N}_{0}\text{R}.&\supset .(\exists P,x).\mu \dot{+} \dot{1} =\text{Nr}ʻ(P\dot{\unicode{x21f8}} x).\\ [*152·4] &\supset .\mu \dot{+} 1\in \text{NR} &\qquad \text{(1)}\\ \vdash .*181·4.\supset \vdash :\mu {\sim}\in \text{N}_{0}\text{R}.&\supset .\mu \dot{+} 1=\Lambda .\\ [*154·242] &\supset .\mu \dot{+} 1\in \text{NR} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*181·43. $\vdash :\mu \dot{+} 1=\text{N}_{0}\text{r}ʻZ.\equiv .Z\in \mu \dot{+} 1 \quad[*155·26.*181·42]$

The following propositions are concerned with the associative law when $\dot{1}$ is one of the addenda.

*181·53. $\vdash :\dot{\exists} !P.x\neq y.\supset .(P\dot{\unicode{x21f8}} x)\dot{\unicode{x21f8}} y\,\text{smor}\,P+(x\downarrow y)$

Dem. $\begin{array}{l} \vdash .*13·15.(*181·01).\supset \\ \vdash .(P\dot{\unicode{x21f8}} x)\dot{\unicode{x21f8}} y=\downarrow \Lambda _{y}^{;}\iota ^{;}\{\downarrow \Lambda _{x}^{;}\iota ^{;}P\unicode{x21f8} (\Lambda \cap CʻP)\downarrow \iota ʻx\}\unicode{x21f8} \{\Lambda \cap Cʻ(P\dot{\unicode{x21f8}} x)\}\downarrow \iota ʻy\\ [*161·4]=\downarrow \Lambda _{y}^{;}\iota ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}P\unicode{x21f8} \downarrow \Lambda _{y}ʻ\iota ʻ(\Lambda \cap CʻP)\downarrow \iota ʻx\unicode{x21f8} \{\Lambda \cap Cʻ(P\dot{\unicode{x21f8}} x)\}\downarrow \iota ʻy &\qquad \text{(1)}\\ \vdash .(1).*161·22.\supset \vdash :\text{Hp}.\supset .(P\dot{\unicode{x21f8}} x)\dot{\unicode{x21f8}} y\\ =\downarrow \Lambda _{y}^{;}\iota ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}P\unicode{x2909}\{\downarrow \Lambda _{y}ʻ\iota ʻ(\Lambda \cap CʻP)\downarrow \iota ʻx\}\downarrow [\{\Lambda \cap Cʻ(P\dot{\unicode{x21f8}} x)\}\downarrow \iota ʻy] &\qquad \text{(2)}\\ \vdash .*180·13.*181·11.\supset \\ \vdash :\text{Hp}.\supset .\downarrow \Lambda _{y}^{;}\iota ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}P\unicode{x2909}\{\downarrow \Lambda _{y}ʻ\iota ʻ(\Lambda \cap CʻP)\downarrow \iota ʻx\}\downarrow [\{\Lambda \cap Cʻ(P\dot{\unicode{x21f8}} x)\}\downarrow \iota ʻy] \,\text{smor}\,P+(x\downarrow y) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*181·54. $\vdash :\nu \neq 0_{r}.\supset .(\mu \dot{+} \nu )\dot{+} \dot{1} =\mu \dot{+} (\nu \dot{+} \dot{1} )$

Dem. $\begin{array}{l} \vdash .*181·2.*180·2.&\supset \vdash :Y\in (\mu \dot{+} \nu )\dot{\unicode{x21f8}} \dot{1} .\equiv .\\ &(\exists P,Q,R,x).\text{N}_{0}\text{r}ʻP=\mu .\text{N}_{0}\text{r}ʻQ=\nu .R\,\,\text{smor}\,\,P+Q.Y\,\text{smor}\,R\dot{\unicode{x21f8}} x.\\ [*181·22·31]&\equiv .(\exists P,Q,x).\text{N}_{0}\text{r}ʻP=\mu .\text{N}_{0}\text{r}ʻQ=\nu .Y\,\text{smor}\,(P+Q)\dot{\unicode{x21f8}} x &\qquad \text{(1)}\\ \vdash .*153·14.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{N}_{0}\text{r}ʻQ=\nu .\supset .\dot{\exists} !Q &\qquad \text{(2)}\\ \vdash .*160·44.(*180·01.*181·01).\supset \\ &\vdash :P'=\downarrow \Lambda _{x}^{;}\iota ^{;}\downarrow \Lambda _{CʻQ}^{;}\iota ^{;}P.Q'=\downarrow \Lambda _{x}^{;}\iota ^{;}\Lambda _{CʻP}\downarrow ^{;}\iota ^{;}Q.X=\{\Lambda \cap Cʻ(P+Q)\}\downarrow \iota ʻx.\\ &\supset .P'\unicode{x2909}Q'=\downarrow \Lambda _{x}^{;}\iota ^{;}(P+Q).(P'\unicode{x2909}Q')\unicode{x21f8} X=(P+Q)\dot{\unicode{x21f8}} x &\qquad \text{(3)}\\ \vdash .*180·12.*181·12.&\supset \vdash :\text{Hp}(3).\supset .P'\,\text{smor}\,P.Q'\,\text{smor}\,Q &\qquad \text{(4)}\\ \vdash .*180·11.*72·411.*181·11.(3).\supset \\ \vdash :\text{Hp}(3).&\supset .CʻP'\cap CʻQ'=\Lambda .X{\sim}\in CʻP'.X{\sim}\in CʻQ' &\qquad \text{(5)}\\ \vdash .*161·23.(4).&\supset \vdash :\text{Hp}(3).\dot{\exists} !Q.\supset .(Pʻ\unicode{x2909}Qʻ)\unicode{x21f8} X=P'\unicode{x2909}(Qʻ\unicode{x21f8} X) &\qquad \text{(6)}\\ \vdash .*181·13.(4).(5).&\supset \vdash :\text{Hp}(3).\supset .Q'\unicode{x21f8} X\,\text{smor}\,(Q\dot{\unicode{x21f8}} x).\\ [*180·13.(4).(5)] &\supset .P'\unicode{x2909}(Q'\unicode{x21f8} X)\,\text{smor}\,P+(Q\dot{\unicode{x21f8}} x) &\qquad \text{(7)}\\ \vdash .(1).(2).(6).(7).&\supset \vdash \colon\ldotp \text{Hp}.\text{Hp}(3).\supset :Y\in (\mu \dot{+} \nu )\dot{+} \dot{1} .\equiv .\\ &(\exists P,Q,x).\text{N}_{0}\text{r}ʻP=\mu .\text{N}_{0}\text{r}ʻQ=\nu .Y\,\text{smor}\,P+(Q\dot{\unicode{x21f8}} x).\\ [*180·3.*181·3]&\equiv .(\exists P,Q,x).\text{N}_{0}\text{r}ʻP=\mu .\text{N}_{0}\text{r}ʻQ=\nu .Y\in \text{N}_{0}\text{r}ʻP\dot{+} (\text{N}_{0}\text{r}ʻQ\dot{+} \dot{1} ).\\ [*13·193.*155·2]&\equiv .\mu ,\nu \in \text{N}_{0}\text{R}.Y\in \mu \dot{+} (\nu \dot{+} \dot{1} ).\\ [*181·4.*180·4] &\equiv .Y\in \mu \dot{+} (\nu \dot{+} \dot{1} ) &\qquad \text{(8)}\\ \vdash .(8).*13·19.\supset \vdash .\text{Prop} \end{array}$

*181·55. $\vdash :\mu \neq 0_{r}.\supset .\dot{1} \dot{+} (\mu \dot{+} \nu )=(\dot{1} \dot{+} \mu )\dot{+} \nu \quad[\text{Proof as in *181·54}]$

*181·56. $\vdash :\mu \neq 0_{r}.\supset .(\mu \dot{+} \dot{1} )\dot{+} \dot{1} =\mu \dot{+} (\dot{1} \dot{+} \dot{1} )=\mu \dot{+} 2_{r}$

Dem. $\begin{array}{l} \vdash .*153·2.*180·2.\supset \\ \vdash :Z\in \mu \dot{+} 2_{r}.&\equiv .(\exists P,x,y).\mu =\text{N}_{0}\text{r}ʻP.x\neq y.Z\,\text{smor}\,P+(x\downarrow y) &\qquad \text{(1)}\\ \vdash .(1).*181·53.\supset \vdash \colon\ldotp \text{Hp}.\supset : &Z\in \mu \dot{+} 2_{r}.\equiv .(\exists P,x,y).\mu =\text{N}_{0}\text{r}ʻP.x\neq y.Z\,\text{smor}\,(P\dot{\unicode{x21f8}} x)\dot{\unicode{x21f8}} y.\\ [*181·22] &\equiv .(\exists P,x,y).\mu =\text{N}_{0}\text{r}ʻP.x\neq y.Z\in (\text{N}_{0}\text{r}ʻP\dot{+} \dot{1} )\dot{+} \dot{1} .\\ [*181·4] &\equiv .(\exists x, y).x\neq y.Z\in (\mu \dot{+} \dot{1} )\dot{+} \dot{1} .\\ [*24·1] &\equiv .Z\in (\mu \dot{+} \dot{1} )\dot{+} \dot{1} &\qquad \text{(2)}\\ \vdash .(2).(*181·04).\supset \vdash .\text{Prop} \end{array}$

The last line in the above proof, in which *24·1 is used, is legitimate because $x$ and $y$ may be of any type whatever, and therefore the fact that $\Lambda \neq \text{V}$ is sufficient to establish $(\exists x,y).x\neq y$ in the sense wanted.

*181·561. $\mu \dot{+} \dot{1} \dot{+} \dot{1} =\mu \dot{+} (\dot{1} \dot{+} \dot{1} ) \quad\text{Df}$

This definition adopts the opposite convention to that usually adopted. But it is convenient to have $0_{r}\dot{+} \dot{1} \dot{+} \dot{1}=2_{r}$ , and also to have as much similarity as possible between the results of adding $\dot{1}$ at the beginning and end of a relation. Both reasons lead to the adoption of the above convention. (Cf. *181·57·571, below.)

*181·57. $\begin{align}&\vdash :\mu \neq 0_{r}.\supset .\dot{1} \dot{+} (\dot{1} \dot{+} \mu )=(\dot{1} \dot{+} \dot{1} )\dot{+} \mu =2_{r}\dot{+} \mu \\ &[\text{Proof as in *181·56}]\end{align}$

*181·571. $\dot{1} \dot{+} \dot{1} \dot{+} \mu =(\dot{1} \dot{+} \dot{1} )\dot{+} \mu \quad\text{Df}$

*181·58. $\vdash :\mu \neq 0_{r}.\nu \neq 0_{r}.\supset .(\mu \dot{+} \dot{1} )\dot{+} \nu =\mu \dot{+} (\dot{1} \dot{+} \nu ) \quad[*161·232]$

*181·59. $\vdash :\mu \neq 0_{r}.\nu \neq 0_{r}.\supset .(\mu \dot{+} \dot{1} )\dot{+} (\dot{1} \dot{+} \nu )=\mu \dot{+} 2_{r}\dot{+} \nu \quad[*161·25]$

The above propositions show that, except when one of the summands is zero, the associative law holds for $\dot{1}$ just as if it were a relation-number.

*181·6. $\vdash :\dot{\exists} !P.\supset .Cʻʻ\text{Nr}ʻ(P\dot{\unicode{x21f8}} x)= \text{Nc}ʻCʻP+_{c}1$

Dem. $\begin{array}{l} \vdash .*152·7. &\supset \vdash .Cʻʻ\text{Nr}ʻ(P\dot{\unicode{x21f8}} x)=\text{Nc}ʻCʻ(P\dot{\unicode{x21f8}} x).\\ \vdash .(1).*161·14.\supset \vdash :\text{Hp}.&\supset .Cʻʻ\text{Nr}ʻ(P\dot{\unicode{x21f8}} x)\\ &=\text{Nc}ʻ[\downarrow \Lambda _{x}ʻʻ\iotaʻʻCʻP\cup \iota ʻ\{(\Lambda \cap CʻP)\downarrow \iota ʻx\}]\\ [*110·13·3.*181·11.*110·12]&=\text{Nc}ʻCʻP+_{c}1:\supset \vdash .\text{Prop} \end{array}$

*181·61. $\begin{align}&\vdash :\dot{\exists} !P.\supset .Cʻʻ\text{Nr}ʻ(x\dot{\unicode{x21f7}} P)=1+_{c}\text{Nc}ʻCʻP= \text{Nc}ʻCʻP+_{c}1\\ &[\text{Proof as in *181·6}]\end{align}$

*181·62. $\vdash :\mu \in \text{NR}-\iota ʻ0_{r}.\supset .Cʻʻ(\mu \dot{+} \dot{1} )=Cʻʻ(\dot{1} \dot{+} \mu )=Cʻ\mu +_{c}1$

Dem. $\begin{array}{l} \vdash .*153·16.*152·4. \supset \vdash :\text{Hp}.&\supset .(\exists P).\mu =\text{Nr}ʻP.\dot{\exists} !P.\\ [*181·3·6] \supset .(\exists P).\mu &=\text{Nr}ʻP.Cʻʻ(\text{Nr}ʻP\dot{+} \dot{1} )= \text{Nc}ʻCʻP+_{c}1\\ [*152·7] &=Cʻʻ\text{Nr}ʻP+_{c}1.\\ [*13·193] &\supset .Cʻʻ(\mu \dot{+} \dot{1} )=Cʻʻ\mu +_{c}1 &\qquad \text{(1)}\\ Similarly \vdash :\text{Hp}.&\supset .Cʻʻ(1\dot{+} \mu )=1+_{c}Cʻʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2).*110·51.\supset \vdash .\text{Prop} \end{array}$

In this number, we have to consider, as a preliminary to the addition of the relation-numbers of a field, the properties of the relation $\breve{\downarrow}_{.,}^{;}P$ , which is defined as follows. If $x\unicode{x2640}y$ is any function of two arguments in the sense of *38, we put $\breve{\unicode{x2640}}ʻx= x\unicode{x2640}x\, \text{Df}$ . Thus $\breve{\downarrow}_{.,}ʻQ= Q\downarrow_{.,} Q$ , i.e. $\breve{\downarrow}_{.,}ʻQ= \downarrow Q^{;}Q$ . Hence $\breve{\downarrow}_{.,}^{;}P$ is the relation of $\downarrow Q^{;}Q$ to $\downarrow R^{;}R$ when $QPR$ . Thus the symbol $\breve{\downarrow}_{.,}^{;}P$ is only significant when $P$ is a relation of relations; when this is the case, $\breve{\downarrow}_{.,}^{;}P$ is the relation which results when, for every $Q$ which is a member of $CʻP$ , every member $x$ of $CʻQ$ is replaced by $x\downarrow Q$ . The result is a $\text{Rel}^{2}\text{excl}$ , whose arithmetical properties serve to define the arithmetical properties of the sum of the relation-numbers of members of $CʻP$ the next number, we shall put $\Sigma \text{Nr}ʻP = \text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \quad\text{Df}.$ We shall put later $\Pi \text{Nr}ʻP = \text{Nr}ʻ\Pi ʻP$ and we shall find $\Pi ʻP = \dot{s} ^{;}\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P.\text{Nr}ʻ\Pi ʻP = \text{Nr}ʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P.$ Thus we might have dispensed with $\Pi ʻP$ as a fundamental notion, using $\text{Prod}$ instead, and putting $\Pi ʻP = \dot{s} ^{;}\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P \quad\text{Df}.$ But this course is on the whole less convenient than that adopted in *172 and *173.

The notation $\breve{\unicode{x2640}}$ is thus required in connection with ordinal addition, where it is almost indispensable. It has besides certain minor uses. The object of the notation is to enable us to exhibit as a function of $x$ an expression of the form $x\unicode{x2640}x$ , where $\unicode{x2640}$ is any descriptive double function which exists for all possible pairs of arguments. Thus for example $x\downarrow x$ is a function of $x$ , but the notations hitherto introduced do not enable us to exhibit it in the form $Rʻx$ . Hence if we wish (say) to deal with the class $\hat{P} \{(\exists x).x\in \alpha .P = x\downarrow x\}$ [Pg 488] we cannot write it in the form $Rʻʻ\alpha$ unless we introduce a new notation. We put $\breve{{\downarrow}}ʻx=x\downarrow x$ whence $\hat{P} \{(\exists x).x\in \alpha .P=x\downarrow x\}=\breve{{\downarrow}}ʻʻ\alpha$ . We introduce the notation generally for all descriptive double functions which exist for all possible pairs of arguments. Thus " $\unicode{x2640}$ " in this number corresponds to " $\unicode{x2640}$ " in *38.

In the present number, we shall begin by a few propositions illustrating possible uses of the notation $\breve{\unicode{x2640}}$ . Thus for example if $\lambda$ is a class of relations, we have hitherto had no simple notation for expressing the class of their squares. But since $R^{2}=\breve{\mid}ʻR$ , the class of the squares of $\lambda$ 's is $\breve{\mid}ʻʻ\lambda$ . The notation is, however, introduced chiefly in order to be applied to $\downarrow$ and $\downarrow_{.,}$ . We therefore proceed almost at once to propositions on $\breve{\downarrow}_{.,}$ , and especially on $\breve{\downarrow}_{.,}^{;}P$ . We have

*182·16·162. $\vdash .\breve{\downarrow}_{.,}^{;}P\in \text{Rel}^{2}\text{excl}.\breve{\downarrow}_{.,}\in 1\rightarrow 1.\breve{\downarrow}_{.,}^{;}P\,\,\text{smor}\,\,P$

*182·2. $\vdash .\breve{\downarrow}_{.,}ʻQ=\Pi ʻ(Q\downarrow Q)=\Pi ʻ\breve{{\downarrow}}ʻQ$

*182·21. $\vdash .\breve{\downarrow}_{.,}^{;}P=\Pi ^{;}\breve{{\downarrow}}^{;}P$

We next prove (*182·27) that if $P\in \text{Rel}^{2}\text{excl}$ , then $P$ has double likeness to $\breve{\downarrow}_{.,}^{;}P$ , the double correlator being $\breve{\iota} \mid \text{D}$ with its converse domain limited to $Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P$ (*182·26). We then prove (*182·33) that if $T\upharpoonright Cʻ\Sigma ʻP$ is a double correlator of $P$ with $Q$ , then $T\parallel \text{Cnv}ʻT\dagger$ (with its converse domain limited) is a double correlator of $\breve{\downarrow}_{.,}^{;}P$ and $\breve{\downarrow}_{.,}^{;}Q$ , whence we deduce

*182·34. $\vdash :P\,\text{smor}\, \,\text{smor}\,Q.\supset .\breve{\downarrow}_{.,}^{;}P\,\text{smor}\, \,\text{smor}\,\breve{\downarrow}_{.,}^{;}Q$

*182·42. $\vdash .\Pi ʻP=\dot{s} ^{;}\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\breve{\downarrow}_{.,}^{;}P=\Pi ʻ\Sigma ʻ\breve{{\downarrow}}^{;}P$

The proof of this is as follows: In virtue of *182·21 and the associative law for $\Pi$ , we have $\dot{s}^{;}\text{D}^{;}\Pi ʻ\breve{\downarrow}_{.,}^{;}P=\Pi ʻ\Sigma ʻ\breve{{\downarrow}}^{;}P.$ [Pg 489] Now $\Sigma ʻ\breve{{\downarrow}}^{;}P=P\unicode{x228d} I\upharpoonright CʻP$ (*182·413), and $\Pi ʻ(P\unicode{x228d} I\upharpoonright CʻP)=\Pi ʻP$ (*172·51).

*182·44. $\vdash .\text{Nr}ʻ\Pi ʻP=\text{Nr}ʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P=\text{Nr}ʻ\Pi ʻ\breve{\downarrow}_{.,}^{;}P$

Finally we have some propositions showing how the notation $\breve{\unicode{x2640}}$ can be applied in cardinals. It is then applied to $\downarrow_{,,}$ , instead of, as above, to $\downarrow_{.,}$ . We have (*182·5 ·51 ·52) ${\in}\unicode{x21A7}\alpha =\breve{\downarrow_{,,}}ʻ\alpha .\in\unicode{x21A7}ʻʻ\kappa =\breve{\downarrow_{,,}}ʻʻ\kappa .\Sigmaʻ\kappa =sʻ\breve{\downarrow_{,,}}ʻʻ\kappa$ . Thus the notation of the present number might have been employed in dealing with cardinal addition (*112) instead of the notation ${\in}\unicode{x21A7}\alpha$ . The general notation $P\unicode{x21A7}x$ was, however, required for other purposes (cf. *85) and could not have been dispensed with.

In *183 we shall put $\Sigma \text{Nr}ʻP=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P,$ and by *182·52 we have $\Sigma \text{Nc}ʻ\kappa =\text{Nc}ʻsʻ\breve{\downarrow_{,,}}ʻʻ\kappa .$ It will be seen that these formulae have the usual kind of analogy.

*182·01. $\breve{\unicode{x2640}}=\hat{y} \hat{x} (y=x\unicode{x2640}x) \quad\text{Df}$

*182·02. $\vdash :y\breve{\unicode{x2640}}x.\equiv .y=x\unicode{x2640}x \quad[(*182·01)]$

*182·021. $\vdash .\breve{\unicode{x2640}}ʻx=x\unicode{x2640}x \quad[*182·02.*30·3]$

*182·022. $\vdash .\text{E}!\breve{\unicode{x2640}}ʻx \quad[*182·021.*14·21]$

*182·023. $\vdash :\breve{\unicode{x2640}}\in 1\rightarrow \text{Cls}:(\alpha ).\alpha \subset \text{ᗡ}ʻ\breve{\unicode{x2640}} \quad[*182·022.*71·166.*33·431]$

Thus if $\lambda$ is a class of relations, the class of their squares is $\breve{\mid}ʻʻ\lambda$ .

*182·031. $\vdash .\breve{\uparrow}ʻ\alpha =\alpha \uparrow \alpha \quad[*182·021]$

*182·033. $\vdash .\dot{2} -2_{r}=\text{D}ʻ\breve{{\downarrow}}=1_{s} \quad[*56·13.*182·032.*153·3]$

*182·04. $\vdash .\breve{\downarrow_{,,}}ʻ\alpha =\downarrow \alpha ʻʻ\alpha \quad[*182·021.*38·2]$

Observe that in $\breve{\downarrow_{,,}}$ , we first take $\downarrow_{,,}$ , and then put a circumflex over it. If we first took $\breve{{\downarrow}}$ , we could not then place two commas under it, because $\breve{{\downarrow}}$ is a relation, not a double descriptive function, and two commas can only significantly be placed under a double descriptive function.

*182·05. $\vdash .\breve{\downarrow}_{.,}ʻQ=\downarrow Q^{;}Q=Q\downarrow_{.,} Q \quad[*182·021.*150·6]$

The relation for the sake of which the above notation is chiefly introduced is $\breve{\downarrow}_{.,}^{;}P$ , where $P$ is a relation of relations. If $P$ relates $Q$ and $R$ , then $\breve{\downarrow}_{.,}^{;}P$ relates $\downarrow Q^{;}Q$ and $\downarrow R^{;}R$ . This is stated in the following proposition:

*182·1. $\begin{align}&\vdash .\breve{\downarrow}_{.,}^{;}P=\hat{X} \hat{Y} \{(\exists Q,R).QPR.X=Q\downarrow_{.,} Q.Y=R\downarrow_{.,} R\}\\ &[*182·023·05.*150·4]\end{align}$

*182·11. $\vdash .Cʻ\breve{\downarrow}_{.,}^{;}P=\breve{\downarrow}_{.,}ʻʻCʻP \quad[*150·22]$

*182·12. $\vdash .Cʻ\breve{\downarrow}_{.,}ʻQ=\downarrow QʻʻCʻQ=F\unicode{x21A7}Q \quad[*182·05.*150·22.*33·5.(*85·5)]$

*182·13. $\vdash .CʻʻCʻ\breve{\downarrow}_{.,}^{;}P=F\unicode{x21A7}ʻʻCʻP \quad[*182·11·12]$

Dem. $\begin{array}{l} \vdash .*182·12. &\supset \vdash :F\unicode{x21A7}Q=F\unicode{x21A7}R.\supset .\downarrow QʻʻCʻQ=\downarrow RʻʻCʻR &\qquad \text{(1)}\\ \vdash .(1).*55·232.*37·45.&\supset \vdash :F\unicode{x21A7}Q=F\unicode{x21A7}R.\dot{\exists} !Q.\supset .Q=R &\qquad \text{(2)}\\ \vdash .*37·45. &\supset \vdash :\downarrow QʻʻCʻQ=\downarrow RʻʻCʻR.Q=\dot{\Lambda} .\supset .\downarrow RʻʻCʻR=\dot{\Lambda} .\\ [*37·45.*33·241] &\supset .R=\dot{\Lambda} &\qquad \text{(3)}\\ \vdash .(1).(2).(3). &\supset \vdash :F\unicode{x21A7}Q=F\unicode{x21A7}R.\supset .Q=R:\supset \vdash .\text{Prop} \end{array}$

*182·15. $\vdash :\exists !F\unicode{x21A7}Q\cap F\unicode{x21A7}R.\supset .Q=R$

Dem. $\begin{array}{l} \vdash .*182·12. \supset \vdash :\text{Hp}.&\supset .\exists !\downarrow QʻʻCʻQ\cap \downarrow RʻʻCʻR.\\ [*55·232] &\supset .Q=R:\supset \vdash .\text{Prop} \end{array}$

*182·16. $\vdash .\breve{\downarrow}_{.,}^{;}P\in \text{Rel}^{2}\text{excl} \quad[*182·12·15]$

*182·161. $\vdash :\breve{\downarrow}_{.,}ʻQ=\breve{\downarrow}_{.,}ʻR.\equiv .Q=R$

Dem. $\begin{array}{l} \vdash .*182·05.\supset \vdash :\breve{\downarrow}_{.,}ʻQ=\breve{\downarrow}_{.,}ʻR.&\equiv .Q\downarrow_{.,} Q=R\downarrow_{.,} R.\\ [*165·23] &\supset .Q=R &\qquad \text{(1)}\\ \vdash .(1).*30·37.\supset \vdash .\text{Prop} \end{array}$

*182·162. $\vdash .\breve{\downarrow}_{.,}\in 1\rightarrow 1.\breve{\downarrow}_{.,}^{;}P\,\,\text{smor}\,\,P \quad[*182·161.*71·57.*151·243]$

*182·17. $\vdash .Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P=\hat{S} \{(\exists Q,x).Q\in CʻP.x\in CʻQ.S=x\downarrow Q\}$

Dem. $\begin{array}{l} \vdash .*182·12.*162·22.*40·4.\supset \\ \vdash .Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P&=\hat{S} \{(\exists Q).Q\in CʻP.S\in \downarrow QʻʻCʻQ\}\\ [*55·231] &=\hat{S} \{(\exists Q,x).Q\in CʻP.x\in CʻQ.S=x\downarrow Q\}.\supset \vdash .\text{Prop} \end{array}$

*182·18. $\vdash .\dot{s} ʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P = F\upharpoonright CʻP$

Dem. $\begin{array}{l} \vdash . *182·17. \supset \\ \vdash . sʻCʻ\Sigma ʻ \breve{\downarrow}_{.,} ^{;}P &= \hat{y} \hat{R} \{(\exists Q, x).Q\in CʻP .x\in CʻQ.y (x\downarrow Q)R\}\\ [*55·13] &= \hat{y} \hat{R} \{(\exists Q, x). Q\in CʻP. x\in CʻQ. y = x. R = Q\}\\ [*13·22] &= \hat{y} \hat{R} \{R\in CʻP. y \in CʻR\}\\ [*33·51] &= \hat{y} \hat{R} \{R\in CʻP. yFR\}\\ [*35·101] &= F\upharpoonright CʻP. \supset \vdash . \text{Prop} \end{array}$

*182·19. $\vdash . sʻ\text{D}ʻʻCʻ\Sigma ʻ \breve{\downarrow}_{.,}^{;}P = Cʻ\Sigma ʻP . sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P = CʻP - {℩}ʻ\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash . *41·43 . *182·18 .\supset \vdash . sʻ\text{D}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P &= \text{D}ʻ(F\upharpoonright CʻP)\\ [*162·23] &= Cʻ\Sigma ʻP &\qquad \text{(1)}\\ \vdash . *41·44 . *182·18 .\supset \vdash . sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P &= \text{ᗡ}ʻ(F\upharpoonright CʻP)\\ [*172·192] &= CʻP - {℩}ʻ\dot{\Lambda} &\qquad \text{(2)}\\ \vdash . (1). (2) .\supset \vdash . \text{Prop} \end{array}$

*182·2. $\vdash .\breve{\downarrow}_{.,}ʻQ=\Pi ʻ(Q\downarrow Q)=\Pi ʻ\breve{{\downarrow}}ʻQ \quad[*182·05·032 . *172·2]$

*182·21. $\vdash .\breve{\downarrow}_{.,}^{;}P=\Pi ^{;}\breve{{\downarrow}}^{;}P \quad[*182·2]$

*182·22. $\vdash .\text{D}^{;}\breve{\downarrow}_{.,}ʻQ=\text{Prod}ʻ\breve{{\downarrow}}ʻQ={℩}^{;}Q \quad[*182·2 *173·1·22]$

*182·23. $\vdash .\breve{{℩}} ^{;}\text{D}^{;}\breve{\downarrow}_{.,}ʻQ=Q \quad[*182·22. *151·252]$

*182·24. $\vdash .\breve{{℩}} \dagger ^{;}\text{D}\dagger ^{;}\breve{\downarrow}_{.,}^{;}P=P \quad[*182·23]$

*182·25. $\vdash .\breve{{℩}} ^{;}\text{D}^{;}\Sigma ʻ\breve{\downarrow}_{.,}^{;}P=\Sigma ʻP.Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\subset \text{ᗡ}ʻ(\breve{{℩}} \mid \text{D})$

Dem. $\begin{array}{l} \vdash .*55·15.&\supset \vdash .\breve{{℩}} ʻ\text{D}ʻ\downarrow Qʻy=y.\\ [*33·43] &\supset \vdash .\downarrow Qʻy\in \text{ᗡ}ʻ(\breve{{℩}} \mid \text{D}).\\ [*182·12] &\supset \vdash .Cʻ\breve{\downarrow}_{.,}ʻQ\subset \text{ᗡ}ʻ(\breve{{℩}} \mid \text{D}).\\ [*162·22] &\supset \vdash .Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\subset \text{ᗡ}ʻ(\breve{{℩}} \mid \text{D}).\\ [*162·35] \supset \vdash .\breve{{℩}} ^{;}\text{D}^{;}\Sigma ʻ\breve{\downarrow}_{.,}^{;}P&=\Sigma ʻ\breve{{℩}} \dagger ^{;}\text{D}\dagger ^{;}\breve{\downarrow}_{.,}^{;}P\\ [*182·24] &= \Sigma ʻP.\supset \vdash . \text{Prop} \end{array}$

*182·26. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\breve{\iota} \mid \text{D}\upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\in P\,\overline{\,\text{smor}\,} \,\overline{\,\text{smor}\,}\, \breve{\downarrow}_{.,}^{;}P$

Dem. $\begin{array}{l} \vdash .*182·24·25. &\supset \vdash .P=(\breve{\iota} \mid \text{D})\dagger ^{;}\breve{\downarrow}_{.,}^{;}P.Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\subset \text{ᗡ}ʻ(\breve{\iota} \mid \text{D}) &\qquad \text{(1)}\\ \vdash .*182·17.*55·15.\supset \\ &\vdash :S,T\in Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P.\breve{\iota} ʻ\text{D}ʻS=\breve{\iota} ʻ\text{D}ʻT.\supset .\\ &(\exists Q,R,x,y).Q,R\in CʻP.x\in CʻQ.y\in CʻR.x=y.S=x\downarrow Q.T=y\downarrow R.\\ [*13·195]&\supset .(\exists Q,R,x).Q,R\in CʻP.x\in CʻQ\cap CʻR.S=x\downarrow Q.T=x\downarrow R &\qquad \text{(2)}\\ \vdash .(2).*163·11.\supset \\ \vdash :\text{Hp}.&S,T\in Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P.\breve{\iota} ʻ\text{D}ʻS=\breve{\iota} ʻ\text{D}ʻT.\supset .\\ &(\exists Q,R,x).Q=R.S=x\downarrow Q.T=x\downarrow R. [*13·195·172] \supset .S=T &\qquad \text{(3)}\\ \vdash .(3).*71·55. &\supset \vdash :\text{Hp}.\supset .\breve{\iota} \mid \text{D}\upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\in 1\rightarrow 1 &\qquad \text{(4)}\\ \vdash .(1).(4).*164·18.\supset \vdash .\text{Prop} \end{array}$

*182·27. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .P \,\,\text{smor}\, \,\text{smor}\, \breve{\downarrow}_{.,}^{;}P \quad[*182·26]$

*182·3. $\vdash :T\upharpoonright Cʻ\Sigma ʻQ\in P\,\overline{\,\text{smor}\,} \,\overline{\,\text{smor}\,}\, Q.\supset .(T\parallel \text{Cnv}ʻT\dagger )\upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*74·775 \frac{T,\,T\dagger,\,Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q}{Q,\,R,\,\lambda}.\supset \\ &\vdash :T\upharpoonright sʻ\text{D}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q,T\dagger \upharpoonright sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in \text{Cls}\rightarrow 1.\\ &sʻ\text{D}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\subset \text{ᗡ}ʻT.sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\subset \text{ᗡ}ʻT\dagger .\supset .\\ &(T\parallel \text{Cnv}ʻ\breve{T} )\upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*182·19.*164·18.&\supset \vdash :\text{Hp}.\supset .T\upharpoonright sʻ\text{D}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .*164·18·13. \supset \vdash :\text{Hp}.&\supset .T\dagger \upharpoonright CʻQ\in 1\rightarrow 1.\\ [*182·19] &\supset .T\dagger \upharpoonright sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in 1\rightarrow 1 &\qquad \text{(3)}\\ \vdash .*164·18.*182·19.&\supset \vdash :\text{Hp}.\supset .sʻ\text{D}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\subset \text{ᗡ}ʻT &\qquad \text{(4)}\\ \vdash .*150·1.*33·431. &\supset \vdash .sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\subset \text{ᗡ}ʻT\dagger &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*182·31. $\vdash :\text{E}!!TʻʻCʻS.\supset .\breve{\downarrow}_{.,}ʻT^{;}S=(T\parallel \text{Cnv}ʻT\dagger )^{;}\breve{\downarrow}_{.,}ʻS$

Dem. $\begin{array}{l} \vdash .*182·05.\supset \vdash .\breve{\downarrow}_{.,}ʻT^{;}S&=(T^{;}S)\downarrow_{.,} (T^{;}S) &\qquad \text{(1)}\\ \vdash .(1).*165·31.\supset \\ \vdash :\text{Hp}.\supset .\breve{\downarrow}_{.,}ʻT^{;}S&=T\mid ^{;}S\downarrow_{.,} (T^{;}S)\\ [*150·1.*165·321] &=T\mid ^{;}(\mid \text{Cnv}ʻT\dagger )^{;}S\downarrow_{.,} S\\ [*150·13.*182·05] &=(T\parallel \text{Cnv}ʻT\dagger )^{;}\breve{\downarrow}_{.,}ʻS:\supset \vdash .\text{Prop} \end{array}$

*182·32. $\vdash :\text{E}!!TʻʻCʻ\Sigma ʻQ.\supset .\breve{\downarrow}_{.,}^{;}T\dagger ^{;}Q=(T\parallel \text{Cnv}ʻT\dagger )\dagger ^{;}\breve{\downarrow}_{.,}^{;}Q$

Dem. $\begin{array}{l} \vdash .*162·22.\supset \vdash \colon\ldotp \text{Hp}.\supset :S\in CʻQ.&\supset _{S}.\text{E}!!TʻʻCʻS.\\ [*182·31] &\supset _{S}.\breve{\downarrow}_{.,}ʻT^{;}S=(T\parallel \text{Cnv}ʻT\dagger )^{;}\breve{\downarrow}_{.,}ʻS:\\ [*150·35·1] &\supset :\breve{\downarrow}_{.,}^{;}T\dagger ^{;}S=(T\parallel \text{Cnv}ʻT\dagger )\dagger ^{;}\breve{\downarrow}_{.,}^{;}Q\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*182·33. $\begin{align}\vdash :T\upharpoonright Cʻ\Sigma ʻP\in P&\,\overline{\,\text{smor}\,} \,\overline{\,\text{smor}\,}\, Q.\supset .\\ &(T\parallel \text{Cnv}ʻT\dagger )\upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\in (\breve{\downarrow}_{.,}^{;}P)\overline{\,\text{smor}\,} \overline{\,\text{smor}\,} (\breve{\downarrow}_{.,}^{;}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*164·18.\supset \vdash .\text{Hp}.&\supset .\text{ᗡ}ʻT\subset Cʻ\Sigma ʻQ.T\upharpoonright Cʻ\Sigma ʻP\in 1\rightarrow 1.P=T\dagger ^{;}Q.\\ [*74·11] &\supset .\text{E}!!TʻʻCʻ\Sigma ʻQ.P=T\dagger ^{;}Q.\\ [*182·32] &\supset .\breve{\downarrow}_{.,}^{;}P=(T\parallel \text{Cnv}ʻT\dagger )\dagger ^{;}\breve{\downarrow}_{.,}^{;}Q &\qquad \text{(1)}\\ \vdash .(1).*182·3.*164·18.\supset \vdash .\text{Prop} \end{array}$

*182·34. $\vdash :P\,\text{smor}\,\text{smor}Q.\supset .\breve{\downarrow}_{.,}^{;}P\,\text{smor}\,\text{smor}\breve{\downarrow}_{.,}^{;}Q \quad[*182·33]$

The converse of the above proposition is false. For example, if $Q=\breve{\downarrow}_{.,}^{;}P$ , we shall have $\breve{\downarrow}_{.,}^{;}P\,\text{smor}\,\text{smor}\breve{\downarrow}_{.,}^{;}Q$ , by *182·16 ·27, but we shall not have $P\,\text{smor}\,\text{smor}Q$ unless $P \in \text{Rel}^{2}\text{excl}$ , as appears from *182·16 and *164·23.

*182·411. $\vdash .\dot{s} ʻCʻ\breve{{\downarrow}}^{;}P=I\upharpoonright CʻP$

Dem. $\begin{array}{l} \vdash .*150·22.\supset \vdash .\dot{s} ʻCʻ\breve{{\downarrow}}^{;}P&=\dot{s} ʻ\breve{{\downarrow}}ʻʻCʻP\\ [*182·032] &=\dot{s} ʻ\hat{R} \{(\exists y).y\in CʻP.R=y\downarrow y\}\\ [*41·11] &=\hat{x} \hat{z} \{(\exists y).y\in CʻP.x(y\downarrow y)z\}\\ [*55·13.*13·195] &=\hat{x} \hat{z} \{z\in CʻP.x=z\}\\ [*50·1.*35·101] &=I\upharpoonright CʻP.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*150·11.*182·032. \supset \vdash .F^{;}\breve{{\downarrow}}^{;}P&=\hat{x} \hat{y} \{(\exists z,w).zPw.xF(z\downarrow z).yF(w\downarrow w)\}\\ [*33·51.*55·15] &=\hat{x} \hat{y} \{(\exists z,w).zPw.x=z.y=w\}\\ [*13·22] &=P.\supset \vdash .\text{Prop} \end{array}$

*182·413. $\vdash .\Sigma ʻ\breve{{\downarrow}}^{;}P=P\unicode{x228d} I\upharpoonright CʻP \quad[*182·411·412.*162·1]$

Dem. $\begin{array}{l} \vdash .*150·22.\supset \vdash .Cʻ\breve{{\downarrow}}^{;}P&=\breve{{\downarrow}}ʻʻCʻP\\ [*182·032] & =\hat{Q} \{(\exists x).x\in CʻP.Q=x\downarrow x\} &\qquad \text{(1)}\\ \vdash .(1).*55·15. &\supset \vdash :Q,R\in Cʻ\breve{{\downarrow}}^{;}P.\exists !CʻQ\cap CʻR.\supset .\\ &(\exists x,y).x,y\in CʻP.Q=x\downarrow x.R=y\downarrow y.\exists !\iota ʻx\cap \iota ʻy.\\ [*51·231.\text{Transp}] &\supset .(\exists x,y).Q=x\downarrow x.R=y\downarrow y.x=y.\\ [*13·195·172] &\supset .Q=R:\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*150·22.\supset \vdash :\text{Hp}.&\supset .(\exists x).x\in CʻP.Q=x\downarrow x.\\ [*55·15] &\supset .(\exists x).x\in CʻP.CʻQ=\iota ʻx.\\ [*52·1] &\supset .CʻQ\in 1:\supset \vdash .\text{Prop} \end{array}$

The purpose of the above proposition is to enable us to apply *174·221 ·231 to $\Pi ʻ\Pi ^{;}\breve{{\downarrow}}^{;}P$ , as is done in *182·42 ·43 ·431 below.

*182·42. $\vdash .\Pi ʻP=\dot{s} ^{;}\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\breve{\downarrow}_{.,}^{;}P=\Pi ʻ\Sigma ʻ\breve{{\downarrow}}^{;}P$

Dem. $\begin{array}{l} \vdash .*182·21.\supset \vdash .\dot{s} ^{;}\text{D}^{;}\Pi ʻ\breve{\downarrow}_{.,}^{;}P&=\dot{s} ^{;}\text{D}^{;}\Pi ʻ\Pi ^{;}\breve{{\downarrow}}^{;}P\\ [*174·221.*182·414·415] & =\Pi ʻ\Sigma ʻ\breve{{\downarrow}}^{;}P &\qquad \text{(1)}\\ [*182·413] &=\Pi ʻ(P\unicode{x228d} I\upharpoonright CʻP)\\ [*172·51] & =\Pi ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*173·1.\supset \vdash .\text{Prop} \end{array}$

*182·43. $\vdash .\dot{s} \upharpoonright (Cʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P)\in (\Pi ʻP)\overline{\,\text{smor}\,} (\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P)$

Dem. $\begin{array}{l} \vdash .*174·231.*182·414·415.\supset \\ \vdash .\dot{s} \upharpoonright (Cʻ\text{Prod}ʻ\Pi ^{;}\breve{{\downarrow}}^{;}P)\in (\Pi ʻ\Sigma ʻ\breve{{\downarrow}}^{;}P)\overline{\,\text{smor}\,} (\text{Prod}ʻ\Pi ^{;}\breve{{\downarrow}}^{;}P) &\qquad \text{(1)}\\ \vdash .(1).*182·21·42.\supset \vdash .\text{Prop} \end{array}$

*182·431. $\begin{align}&\vdash .\dot{s} \mid \text{D} \upharpoonright (Cʻ\Pi ʻ\breve{\downarrow}_{.,}^{;}P) \in (\Pi ʻP) \overline{\,\text{smor}\,} (\Pi ʻ\breve{\downarrow}_{.,}^{;}P)\\ &[*174·221. *182·414·415·21·42]\end{align}$

*182·44. $\vdash . \text{Nr}ʻ\Pi ʻP = \text{Nr}ʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P = \text{Nr}ʻ\Pi ʻ\breve{\downarrow}_{.,}^{;}P \quad[*182·43·431 . *152·321]$

*182·45. $\vdash : P \in \text{Rel}^{2}\text{excl} . \supset . \text{Nr}ʻ\text{Prod}ʻP = \text{Nr}ʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P \quad[*182·44 . *173·16]$

The following propositions are concerned with cardinals. They show how to express the propositions and definitions of *112 in the notation of this number, and they thereby illustrate the analogy of cardinal and ordinal addition.

*182·5. $\vdash . \in \unicode{x21A7} \alpha = \breve{\downarrow_{,,}} ʻ\alpha \quad[*182·04 . *85·601]$

*182·51. $\vdash . \in \unicode{x21A7}ʻʻ\kappa = \breve{\downarrow_{,,}} ʻʻ\kappa \quad[*182·5]$

*182·52. $\vdash . \Sigma ʻ\kappa = sʻ\breve{\downarrow_{,,}}ʻʻ\kappa . \Sigma \text{Nc}ʻ\kappa = \text{Nc}ʻsʻ\breve{\downarrow_{,,}}ʻʻ\kappa \quad[*182·51 . *112·1·101]$

*182·53. $\begin{align}\vdash : C \upharpoonright CʻP \in 1 &\rightarrow 1 . \supset .\\ &(\mid \breve{C} ) \upharpoonright (Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P) \in (\breve{\downarrow_{,,}}ʻʻCʻʻCʻP) \,\overline{\text{ sm }}\, \,\overline{\text{ sm }}\, (CʻʻCʻ\breve{\downarrow}_{.,}^{;}P)\end{align}$

Dem. $\begin{array}{l} \vdash . *182·18 . *41·44 . &\supset \vdash . sʻ\text{ᗡ}ʻʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P = \text{ᗡ}ʻ(F \upharpoonright CʻP)\\ [*35·64] &\subset CʻP &\qquad \text{(1)}\\ \vdash . (1) . *74·75 . &\supset \vdash : \text{Hp} . \supset . (\mid \breve{C} ) \upharpoonright Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \in 1 \rightarrow 1 &\qquad \text{(2)}\\ \vdash . *55·581 \frac{\breve{C}}{S}. &\supset \vdash . (x \downarrow Q) \mid \breve{C} = x \downarrow CʻQ .\\ [*38·11] &\supset \vdash . \mid \breve{C} ʻ \downarrow Qʻx = \downarrow (CʻQ)ʻx .\\ [*182·12·04] &\supset \vdash . \mid \breve{C} ʻʻCʻ\breve{\downarrow}_{.,}ʻQ = \breve{\downarrow_{,,}}ʻCʻQ .\\ [*150·22] &\supset \vdash . \mid \breve{C} ʻʻʻCʻʻCʻ\breve{\downarrow}_{.,}^{;}P = \breve{\downarrow_{,,}}ʻʻCʻʻCʻP &\qquad \text{(3)}\\ \vdash . (2) . (3) . *111·14 . *162·22 . \supset \vdash . \text{Prop} \end{array}$

*182·54. $\begin{align}&\vdash : C \upharpoonright CʻP \in 1 \rightarrow 1 . \supset . \text{Nc}ʻCʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P = \Sigma \text{Nc}ʻCʻʻCʻP\\ &[*182·52·53 . *111·44]\end{align}$

In this number we have to define and consider the sum of the relation-numbers of the members of $CʻP$ , where $P$ is a relation of relations. Since relational sums are not commutative, we cannot define the sum of the relation-numbers of members of a class of relations $\lambda$ : it is necessary that $\lambda$ should be given as the field of a relation $P$ , where $P$ determines the order in which the summation is to be effected.

In order to avoid repetition, we replace $P$ by $\breve{\downarrow}_{.,}^{;}P$ , so that if $Q$ is a member of $CʻP$ , $Q$ is replaced by $\breve{\downarrow}_{.,}ʻQ$ , i.e. by $\downarrow Q^{;}Q$ . This relation is like $Q$ , and its field has no members in common with the field of $\downarrow R^{;}R$ , unless $Q=R$ . Hence we are led to the following definition:

*183·01. $\Sigma \text{Nr}ʻP=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \quad\text{Df}$

This definition is analogous to *112·01, as appears from *182·52, and the propositions of the present number are analogous to some of the propositions of *112.

*183·11. $\vdash :P \,\,\text{smor}\, \,\text{smor}\, Q.\supset .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻQ$

*183·15. $\vdash :\breve{\downarrow}_{.,}^{;}P \,\,\text{smor}\, \,\text{smor}\, \breve{\downarrow}_{.,}^{;}Q.\supset .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻQ$

which is a proposition with a weaker hypothesis than that of *183·11 (cf. note to *182·34).

*183·13. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset . \text{Nr}ʻ\Sigma ʻP=\Sigma \text{Nr}ʻP$

I.e. a sum is only zero when there is no summand except (at most) zero. (Cf. *162·4 ·45.)

*183·25. $\vdash .\Sigma \text{Nr}ʻP\downarrow_{.,} ^{;}Q=\text{Nr}ʻ(Q\times P)$

*183-26. $\vdash \colon\ldotp \text{Mult ax}.\supset :P\in \text{Nr}ʻR.CʻP\subset \text{Nr}ʻS.\supset .\Sigma \text{Nr}ʻP= \text{Nr}ʻ(R\times S)$

*183·31. $\vdash :P\neq Q.\supset .\Sigma \text{Nr}ʻ(P\downarrow Q)=\text{Nr}ʻP\dot{+} \text{Nr}ʻQ$

*183·33. $\vdash :\dot{\exists} !P.Z{\sim}\in CʻP.\supset .\Sigma \text{Nr}ʻ(P\unicode{x21f8} Z)=\Sigma \text{Nr}ʻP\dot{+} \text{Nr}ʻZ$

*183·43. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\Sigma \text{Nr}ʻ\Sigma ^{;}\breve{\downarrow}_{.,}\dagger ^{;}P=\Sigma \text{Nr}ʻ\Sigma ʻP$

*183·5. $\vdash :C\upharpoonright CʻP\in 1\rightarrow 1.\supset .Cʻʻ\Sigma \text{Nr}ʻP=\Sigma \text{Nc}ʻCʻʻCʻP$

*183·01. $\Sigma \text{Nr}ʻP=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \quad\text{Df}$

*183·1. $\vdash .\Sigma \text{Nr}ʻP=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P \quad[(*183·01)]$

*183·11. $\vdash :P \,\,\text{smor}\, \,\text{smor}\, Q.\supset .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash .*182·34.\supset \vdash :\text{Hp}.&\supset .(\breve{\downarrow}_{.,}^{;}P)\,\text{smor}\, \,\text{smor}\,(\breve{\downarrow}_{.,}^{;}Q).\\ [*164·151] &\supset .(\Sigma ʻ\breve{\downarrow}_{.,}^{;}P)\,\text{smor}\,(\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q).\\ [*183·1.*152·321] &\supset .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*183·12. $\vdash :P \,\,\text{smor}\, \,\text{smor}\,\breve{\downarrow}_{.,}^{;}Q.\supset .\text{Nr}ʻ\Sigma ʻP=\Sigma \text{Nr}ʻQ \quad[*164·151.*183·1]$

*183·13. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\text{Nr}ʻ\Sigma ʻP=\Sigma \text{Nr}ʻP \quad[*182·27.*183·12]$

*183·14. $\vdash .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻ\breve{\downarrow}_{.,}^{;}P$

Dem. $\begin{array}{l} \vdash .*182·16.*183·13.\supset \vdash .\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P=\Sigma \text{Nr}ʻ\breve{\downarrow}_{.,}^{;}P &\qquad \text{(1)}\\ \vdash .(1).*183·1.\supset \vdash .\text{Prop} \end{array}$

*183·15. $\vdash :\breve{\downarrow}_{.,}^{;}P\,\text{smor}\, \,\text{smor}\,\breve{\downarrow}_{.,}^{;}Q.\supset .\Sigma \text{Nr}ʻP=\Sigma \text{Nr}ʻQ \quad[*183·11·14]$

Dem. $\begin{array}{l} \vdash .*183·1.*153·17.\supset\\ \vdash \colon\ldotp \Sigma \text{Nr}ʻP=0_{r}.&\equiv :\Sigma ʻ\breve{\downarrow}_{.,}^{;}P=\dot{\Lambda} :\\ [*162·42] & \equiv :Cʻ\breve{\downarrow}_{.,}^{;}P\subset \iota ʻ\dot{\Lambda} :\\ [*182·05] &\equiv :Q\in CʻP.\supset _{Q}.\downarrow Q^{;}Q=\dot{\Lambda} :\\ [*151·65.*153·101]&\equiv :Q\in CʻP.\supset _{Q}.Q=\dot{\Lambda} :\\ [*162·42] &\equiv :\Sigma ʻP=\dot{\Lambda} \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*183·22. $\vdash \colon\ldotp \text{Mult ax} . \supset : \exists ! (\breve{\downarrow}_{.,}^{;}P) \overline{\,\text{smor}\,} (\breve{\downarrow}_{.,}^{;}Q) \cap \text{Rl}ʻ\,\text{smor}\, . \supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash . *164·46 . *182·16 . \supset \\ \vdash \colon\ldotp \text{Mult ax} . &\supset : \exists ! (\breve{\downarrow}_{.,}^{;}P) \overline{\,\text{smor}\,} (\breve{\downarrow}_{.,}^{;}Q) \cap \text{Rl}ʻ\,\text{smor}\, . \supset . \Sigma ʻ\breve{\downarrow}_{.,}^{;}P \,\,\text{smor}\, \Sigma ʻ\breve{\downarrow}_{.,}^{;}Q .\\ [*183·1 . *152·321] &\supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻQ : \supset \vdash . \text{Prop} \end{array}$

*183·23. $\vdash \colon\ldotp \text{Mult ax} . \supset : P, Q \in \text{Rel}^{2}\text{excl} . \exists ! P \overline{\,\text{smor}\,} Q \cap \text{Rl}ʻ\,\text{smor}\, . \supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻQ \quad[*164·46 . *183·13]$

*183·231. $\vdash : P \in \text{Nr}ʻR . CʻP \subset \text{Nr}ʻS . \equiv . \breve{\downarrow}_{.,}^{;}P \in \text{Nr}ʻR . Cʻ\breve{\downarrow}_{.,}^{;}P \subset \text{Nr}ʻS$

Dem. $\begin{array}{l} \vdash . *182·162 . *152·31·321 . \supset \vdash : P \in \text{Nr}ʻR . &\equiv . \breve{\downarrow}_{.,}^{;}P \in \text{Nr}ʻR &\qquad \text{(1)}\\ \vdash . *182·05·11 . \supset \vdash : Cʻ\breve{\downarrow}_{.,}^{;}P \subset \text{Nr}ʻS . &\equiv : Q \in CʻP . \supset _{Q} . \downarrow Q^{;}Q \in \text{Nr}ʻS :\\ [*151·65] &\equiv : Q \in CʻP . \supset _{Q} . Q \in \text{Nr}ʻS :\\ [*22·1] &\equiv : CʻP \subset \text{Nr}ʻS &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*183·24. $\vdash \colon\ldotp \text{Mult ax} . \supset : P, Q \in \text{Nr}ʻR . CʻP, CʻQ \in \text{Cl}ʻ\text{Nr}ʻS . \supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash . *183·231 . &\supset \vdash \colon\ldotp P, Q \in \text{Nr}ʻR . CʻP, CʻQ \in \text{Cl}ʻ\text{Nr}ʻS . \supset :\\ &\breve{\downarrow}_{.,}^{;}P, \breve{\downarrow}_{.,}^{;}Q \in \text{Nr}ʻR . Cʻ\breve{\downarrow}_{.,}^{;}P, Cʻ\breve{\downarrow}_{.,}^{;}Q \in \text{Cl}ʻ\text{Nr}ʻS :\\ [*164·48 . *182·16] &\supset : \text{Mult ax} . \supset . \breve{\downarrow}_{.,}^{;}P \,\,\text{smor}\, \,\text{smor}\, \breve{\downarrow}_{.,}^{;}Q .\\ [*183·15] &\supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻQ &\qquad \text{(1)}\\ \vdash . (1) . \text{Comm} . \supset \vdash . \text{Prop} \end{array}$

*183·25. $\vdash . \Sigma \text{Nr}ʻP \downarrow_{.,} ^{;}Q = \text{Nr}ʻ(Q \times P)$

Dem. $\begin{array}{l} \vdash . *165·21 . *183·13 . \supset \vdash . \Sigma \text{Nr}ʻP \downarrow_{.,} ^{;} Q &= \text{Nr}ʻ\Sigma ʻP \downarrow_{.,} ^{;}Q\\ [*166·1] &= \text{Nr}ʻ(Q \times P) . \supset \vdash . \text{Prop} \end{array}$

*183·26. $\vdash \colon\ldotp \text{Mult ax} . \supset : P \in \text{Nr}ʻR . CʻP \subset \text{Nr}ʻS . \supset . \Sigma \text{Nr}ʻP = \text{Nr}ʻ(R \times S)$

Dem. $\begin{array}{l} \vdash . *165·27 . *183·24 . \supset \\ \vdash \colon\ldotp \text{Mult ax} . &\supset : \dot{\exists} ! S . P \in \text{Nr}ʻR . CʻP \subset \text{Nr}ʻS . \supset . \Sigma \text{Nr}ʻP = \Sigma \text{Nr}ʻS \downarrow_{.,} ^{;}R\\ [*183·13 . *166·1] &= \text{Nr}ʻ(R \times S) &\qquad \text{(1)}\\ \vdash . *153·11·101 . \supset \\ \vdash : S = \dot{\Lambda} . P \in \text{Nr}ʻR . CʻP \subset \text{Nr}ʻS . &\supset . CʻP \subset {℩}ʻ\dot{\Lambda} .\\ [*162·42] &\supset . \Sigma ʻP = \dot{\Lambda} .\\ [*183·2] &\supset . \Sigma \text{Nr}ʻP = 0_{r} &\qquad \text{(2)}\\ \vdash . *166·13 . &\supset \vdash : S = \dot{\Lambda} . \supset . R \times S = \dot{\Lambda} &\qquad \text{(3)}\\ \vdash . (2) . (3) . *153·17 . \supset \\ \vdash : S = \dot{\Lambda} . P \in \text{Nr}ʻR . CʻP \subset \text{Nr}ʻS . &\supset . \Sigma \text{Nr}ʻP = \text{Nr}ʻ(R \times S) &\qquad \text{(4)}\\ \vdash . (1) . (4) . \supset \vdash . \text{Prop} \end{array}$

*183·3. $\vdash .\Sigma \text{Nr}ʻ\dot{\Lambda} =0_{r} \quad[*183·2.*162·4]$

*183·301. $\vdash .\Sigma \text{Nr}ʻ(\dot{\Lambda} \downarrow \dot{\Lambda} )=0_{r} \quad[*183·2.*162·41]$

*183·302. $\vdash .\Sigma \text{Nr}ʻ(P\downarrow P)=\text{Nr}ʻ(CʻP\uparrow CʻP)$

Dem. $\begin{array}{l} \vdash .*183·13.*163·41.\supset \vdash .\Sigma \text{Nr}ʻ(P\downarrow P)&=\text{Nr}ʻ\Sigma ʻ(P\downarrow P)\\ [*162·3.*160·1] &=\text{Nr}ʻ(CʻP\uparrow CʻP).\supset \vdash .\text{Prop} \end{array}$

*183·31. $\vdash :P\neq Q.\supset .\Sigma \text{Nr}ʻ(P\downarrow Q)=\text{Nr}ʻP\dot{+} \text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash .*183·1.\supset \vdash .\Sigma \text{Nr}ʻ(P\downarrow Q)&=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}(P\downarrow Q)\\ [*150·71] & =\text{Nr}ʻ\Sigma ʻ\{(\breve{\downarrow}_{.,}ʻP)\downarrow (\breve{\downarrow}_{.,}ʻQ)\}\\ [*162·3] & =\text{Nr}ʻ(\breve{\downarrow}_{.,}ʻP\unicode{x2909}\breve{\downarrow}_{.,}ʻQ) &\qquad \text{(1)}\\ \vdash .(1).*180·32.*182·12·15.\supset \vdash :\text{Hp}.\supset .\\ \Sigma \text{Nr}ʻ(P\downarrow Q)&=\text{Nr}ʻ\breve{\downarrow}_{.,}ʻP\dot{+} \text{Nr}ʻ\breve{\downarrow}_{.,}ʻQ\\ [*182·05.*151·65.*180·31] & =\text{Nr}ʻP\dot{+} \text{Nr}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*183·32. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .\Sigma \text{Nr}ʻ(P\unicode{x2909}Q)=\Sigma \text{Nr}ʻP\dot{+} \Sigma \text{Nr}ʻQ$

Dem. $\begin{array}{l} \vdash .*183·1.\supset \vdash .\Sigma \text{Nr}ʻ(P\unicode{x2909}Q)&=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}(P\unicode{x2909}Q)\\ [*162·31.*160·44] &=\text{Nr}ʻ(\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\unicode{x2909}\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q) &\qquad \text{(1)}\\ \vdash .*182·17.*55·202.\supset \\ \vdash :\exists !Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\cap Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q.&\equiv .(\exists S,R,x).R\in CʻP\cap CʻQ.x\in CʻR.S=x\downarrow R.\\ [*10·5] &\supset .\exists !CʻP\cap CʻQ &\qquad \text{(2)}\\ \vdash .(2).\text{Transp}.&\supset \vdash :\text{Hp}.\supset .Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\cap Cʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q=\Lambda .\\ [*180·32] &\supset .\text{Nr}ʻ(\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\unicode{x2909}\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q)=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\dot{+} \text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}Q\\ [*183·1] & =\Sigma \text{Nr}ʻP\dot{+} \Sigma \text{Nr}ʻQ &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*183·33. $\vdash :\dot{\exists} !P.Z{\sim}\in CʻP.\supset .\Sigma \text{Nr}ʻ(P\unicode{x21f8} Z)=\Sigma \text{Nr}ʻP\dot{+} \text{Nr}ʻZ$

Dem. $\begin{array}{l} \vdash .*183·1.\supset \vdash .\Sigma \text{Nr}ʻ(P\unicode{x21f8} Z)&=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}(P\unicode{x21f8} Z)\\ [*161·4] &=\text{Nr}ʻ\Sigma ʻ(\breve{\downarrow}_{.,}^{;}P\unicode{x21f8} \breve{\downarrow}_{.,}ʻZ) &\qquad \text{(1)}\\ \vdash .(1).*162·43.\supset \vdash :\text{Hp}.\supset .\Sigma \text{Nr}ʻ(P\unicode{x21f8} Z)&=\text{Nr}ʻ(\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\unicode{x2909}\breve{\downarrow}_{.,}ʻZ)\\ [*182·12·15.*180·32] &=\text{Nr}ʻ\Sigma ʻ\breve{\downarrow}_{.,}^{;}P\dot{+} \text{Nr}ʻ\breve{\downarrow}_{.,}ʻZ\\ [*183·1.*182·05.*151·65] & =\Sigma \text{Nr}ʻP\dot{+} \text{Nr}ʻZ:\supset \vdash .\text{Prop} \end{array}$

*183·331. $\begin{align}&\vdash :\dot{\exists} !P.Z{\sim}\in CʻP.\supset .\Sigma \text{Nr}ʻ(Z\unicode{x21f7}P) = \text{Nr}ʻZ\dot{+} \Sigma \text{Nr}ʻP\\ &[\text{Proof as in *183·33}]\end{align}$

*183·42. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\breve{\downarrow_{,,}}\dagger^{{} ;}P\in \text{Rel}^{3}\text{arithm}$

Dem. $\begin{array}{l} \vdash .*163·3.*182·162.&\supset \vdash :\text{Hp}.\supset .\breve{\downarrow}_{.,}\dagger ^{;}P\in \text{Rel}^{2}\text{excl}&\qquad \text{(1)}\\ \vdash .*162·35. &\supset \vdash .\Sigma ʻ\breve{\downarrow_{,,}}\dagger^{{} ;}P = \breve{\downarrow}_{.,}^{;}\Sigma ʻP.\\ [*182·16] &\supset \vdash .\Sigma ʻ\breve{\downarrow_{,,}}\dagger^{{} ;}P\in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).*174·3.\supset \vdash .\text{Prop} \end{array}$

*183·43. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\Sigma \text{Nr}ʻ\Sigma ^{;}\breve{\downarrow_{,,}}\dagger^{{} ;}P = \Sigma \text{Nr}ʻ\Sigma ʻP$

Dem. $\begin{array}{l} \vdash .*183·42.*174·36. \supset \vdash :\text{Hp}.&\supset .\Sigma ^{;}\breve{\downarrow}_{.,}\dagger ^{;}P\in \text{Rel}^{2}\text{excl}.\\ [*183·13] \supset .\Sigma \text{Nr}ʻ\Sigma ^{;}\breve{\downarrow_{,,}}\dagger^{{} ;}P &= \text{Nr}ʻ\Sigma ʻ\Sigma ^{;}\breve{\downarrow}_{.,}\dagger ^{;}P\\ [*162·34] &= \text{Nr}ʻ\Sigma ʻ\Sigma ʻ\breve{\downarrow_{,,}}\dagger^{{} ;}P\\ [*162·35] &= \text{Nr}ʻ\Sigma ʻ\breve{\downarrow_{,,}}\dagger^{{} ;}\Sigma ʻP\\ [*183·1] & = \Sigma \text{Nr}ʻ\Sigma ʻP:\supset \vdash .\text{Prop} \end{array}$

*183·5. $\vdash :C\upharpoonright CʻP\in 1\rightarrow 1.\supset .Cʻʻ\Sigma \text{Nr}ʻP = \Sigma \text{Nc}ʻCʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*152·7.*183·1.\supset \vdash :\text{Hp}.\supset .Cʻʻ\Sigma \text{Nr}ʻP &= \text{Nc}ʻCʻ\Sigma ʻ\breve{\downarrow_{,,}}\dagger^{{} ;}P\\ [*182·54] &= \Sigma \text{Nc}ʻCʻʻCʻP.\supset \vdash .\text{Prop} \end{array}$

The propositions of this number are for the most part analogous to those of the propositions of *113 which are concerned with $\mu \times _{c} \nu$ . Those of *113 which are concerned with $\alpha \times \beta$ have their analogues in *166. We put

*184·01. $\mu \dot{\times} \nu =\hat{R} \{(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\times Q)\} \quad\text{Df}$

*184·02. $\text{Nr}ʻP\dot{\times} \nu =\text{N}_{0}\text{r}ʻP\dot{\times} \nu \quad\text{Df}$

*184·03. $\mu \dot{\times} \text{Nr}ʻQ=\mu \dot{\times} \text{N}_{0}\text{r}ʻQ \quad\text{Df}$

We prove that $\mu \dot{\times} \nu$ is only zero when one of its factors is zero (*184·16); we prove the associative law (*184·31), and the distributive law in the forms

*184·33. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\Sigma \text{Nr}ʻP\dot{\times} \text{Nr}ʻR=\Sigma \text{Nr}ʻ(\times R)^{;}P$

*184·35. $\vdash .(\nu \dot{+} \varpi )\dot{\times} \mu =(\nu \dot{\times} \mu )\dot{+} (\varpi \dot{\times} \mu )$

and we prove $2_{r}\dot{\times} \mu =\mu \dot{+} \mu$ (*184·4). Also we extend the distributive law to the case where one of the summands is $\dot{1}$ , i.e. we prove

*184·41. $\vdash :\nu \neq 0_{r}.\supset .(\nu \dot{+} \dot{1} )\dot{\times} \mu =(\nu \dot{\times} \mu )\dot{+} \mu$

*184·42. $\vdash :\nu \neq 0_{r}.\supset .(\dot{1} \dot{+} \nu) \dot{\times} \mu =\mu \dot{+} (\nu \dot{\times} \mu )$

*184·5. $\vdash :\mu ,\nu \in \text{NR}.\supset .Cʻʻ(\mu \dot{\times} \nu )=Cʻʻ\mu \times _{c}Cʻʻ\nu$

*184·01. $\mu \dot{\times} \nu =\hat{R} \{(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\times Q)\} \quad\text{Df}$

*184·02. $\text{Nr}ʻP\dot{\times} \nu =\text{N}_{0}\text{r}ʻP\dot{\times} \nu \quad\text{Df}$

*184·03. $\mu \dot{\times} \text{Nr}ʻQ=\mu \dot{\times} \text{N}_{0}\text{r}ʻQ \quad\text{Df}$

*184·1. $\begin{align}&\vdash :R\in \mu \dot{\times} \nu .\equiv .(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\times Q)\\ &[(*184·01)]\end{align}$

The proofs of the following propositions are omitted, since they are analogous to those of the corresponding propositions of *113.

*184·11. $\vdash :\exists !\mu \dot{\times} \nu .\supset .\mu ,\nu \in \text{N}_{0}\text{R}.\exists !\mu .\exists !\nu$

*184·111. $\vdash :{\sim}(\mu ,\nu \in \text{N}_{0}\text{R}).\supset .\mu \dot{\times} \nu =\Lambda$

*184·12. $\vdash \colon\ldotp \mu ,\nu \in \text{NR}.\supset :R\in \mu \dot{\times} \nu .\equiv .(\exists P,Q).P\in \mu .Q\in \nu .R\,\text{smor}\,(P\times Q)$

*184·13. $\begin{align}\vdash .\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ=\text{N}_{0}\text{r}ʻP\dot{\times} \text{Nr}ʻQ&=\text{Nr}ʻP\dot{\times} \text{N}_{0}\text{r}ʻQ\\ &=\text{N}_{0}\text{r}ʻP\dot{\times} \text{N}_{0}\text{r}ʻQ=\text{Nr}ʻ(P\times Q)\end{align}$

*184·14. $\vdash :P\,\,\text{smor}\,\,R.Q\,\text{smor}\,S.\supset .\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ=\text{Nr}ʻR\dot{\times} \text{Nr}ʻS$

*184·16. $\vdash \colon\ldotp \mu \dot{\times} \nu =0_{r}.\equiv :\mu ,\nu \in \text{NR}-\iota ʻ\Lambda :\mu =0_{r}.\lor.\nu =0_{r}$

*184·2. $\begin{align}&\vdash \colon\ldotp \text{Mult ax}.\supset :P\in \text{Nr}ʻR.CʻP\subset \text{Nr}ʻS.\supset .\Sigma \text{Nr}ʻP =\text{Nr}ʻR\dot{\times} \text{Nr}ʻS\\ &[*183·26.*184·13]\end{align}$

*184·21. $\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NR}.\nu \neq \Lambda .P \in \mu .CʻP\subset \nu .\supset .\Sigma \text{Nr}ʻP =\mu \dot{\times} \nu$

Dem. $\begin{array}{l} \vdash .*152·45.&\supset \vdash :\mu \in \text{NR}.P\in \mu .\supset .\mu =\text{Nr}ʻP &\qquad \text{(1)}\\ \vdash .*152·45.&\supset \vdash :\nu \in \text{NR}.CʻP\subset \nu .S\in CʻP.\nu =\text{Nr}ʻS.CʻP\subset \text{Nr}ʻS &\qquad \text{(2)}\\ \vdash .(1).(2).*184·2.\supset \\ \vdash \colon\ldotp \text{Mult ax}.&\supset :\mu ,\nu \in \text{NR}.P\in \mu .CʻP\subset \nu .S\in CʻP.\supset .\\ &\Sigma \text{Nr}ʻP=\text{Nr}ʻP\dot{\times} \text{Nr}ʻS.\mu =\text{Nr}ʻP.\nu =\text{Nr}ʻS.\\ [*13·13] &\supset .\Sigma \text{Nr}ʻP=\mu \dot{\times} \nu &\qquad \text{(3)}\\ \vdash .(3).*10·11·21·23.\supset \\ \vdash \colon\ldotp \text{Mult ax}.&\supset :\mu ,\nu \in \text{NR}.P\in \mu .CʻP\subset \nu .\exists !CʻP.\supset .\Sigma ΝrʻP=\mu \dot{\times} \nu &\qquad \text{(4)}\\ \vdash .*183·2.*162·4. &\supset \vdash :P=\dot{\Lambda} .\supset .\Sigma \text{Nr}ʻP=0_{r} &\qquad \text{(5)}\\ \vdash .*153·16.\text{Transp}. &\supset \vdash \colon\ldotp \mu \in \text{NR}.P\in \mu .P=\dot{\Lambda} .\supset :\mu =0_{r}:\\ [*184·16] &\supset :\nu \in \text{NR}-\iota ʻ\Lambda .\supset .\mu \dot{\times} \nu =0_{r} &\qquad \text{(6)}\\ \vdash .(5).(6).&\supset \vdash :\mu ,\nu \in \text{NR}.\nu \neq \Lambda .P\in \mu .CʻP\subset \nu .P=\dot{\Lambda} .\supset .\\ &\Sigma \text{Nr}ʻP=\mu \dot{\times} \nu &\qquad \text{(7)}\\ \vdash .(4).(7).\supset \vdash .\text{Prop} \end{array}$

*184·3. $\vdash .(\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ)\dot{\times} \text{Nr}ʻR=\text{Nr}ʻP\dot{\times} (\text{Nr}ʻQ\dot{\times} \text{Nr}ʻR)=\text{Nr}ʻ(P\times Q\times R)$

Dem. $\begin{array}{l} \vdash .*184·13. \supset \vdash .(\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ)\dot{\times} \text{Nr}ʻR&=\text{Nr}ʻ(P\times Q)\dot{\times} \text{Nr}ʻR\\ [*184·13] &=\text{Nr}ʻ(P\times Q\times R)\\ [*166·42] &=\text{Nr}ʻ\{P\times (Q\times R)\}\\ [*184·13] &=\text{Nr}ʻP\dot{\times} (\text{Nr}ʻQ\dot{\times} \text{Nr}ʻR).\supset \vdash .\text{Prop} \end{array}$

*184·31. $\vdash .(\mu \dot{\times} \nu )\dot{\times} \varpi =\mu \dot{\times} (\nu \dot{\times} \varpi )$

Dem. $\begin{array}{l} \vdash .*184·111.&\supset \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}).\supset .(\mu \dot{\times} \nu )\dot{\times} \varpi =\Lambda .\mu \dot{\times} (\nu \dot{\times} \varpi )=\Lambda &\qquad \text{(1)}\\ \vdash .*155·2. &\supset \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}.\supset .\\ &(\exists P,Q,R).\mu =\text{N}_{0}\text{r}ʻP.\nu =Ν_{0}rʻQ.\varpi =\text{N}_{0}\text{r}ʻR &\qquad \text{(2)}\\ \vdash .*184·13.\supset \\ \vdash :\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.\varpi =\text{N}_{0}\text{r}ʻR.\supset .(\mu \dot{\times} \nu )\dot{\times} \varpi &=\text{Nr}ʻ\{(P \times Q) \times R\}\\ [*184·3] &=\text{Nr}ʻ\{P\times (Q\times R)\}\\ [*184·13] &=\mu \dot{\times} (\nu \dot{\times} \varpi ) &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}.\supset .(\mu \dot{\times} \nu )\dot{\times} \varpi =\mu \dot{\times} (\nu \dot{\times} \varpi ) &\qquad \text{(4)}\\ \vdash .(1).(4).&\supset \vdash .\text{Prop} \end{array}$

*184·32. $\mu \dot{\times} \nu \dot{\times} \varpi =(\mu \dot{\times} \nu )\dot{\times} \varpi \quad\text{Df}$

*184·33. $\vdash :P\in \text{Rel}^{2}\text{excl}.\supset .\Sigma \text{Nr}ʻP\dot{\times} \text{Nr}ʻR=\Sigma \text{Nr}ʻ(\times R)^{;}P$

Dem. $\begin{array}{l} \vdash .*183·13.\supset \vdash :\text{Hp}.\supset .\Sigma \text{Nr}ʻP\dot{\times} \text{Nr}ʻR&=\text{Nr}ʻ\Sigma ʻP\dot{\times} \text{Nr}ʻR\\ [*184·13] &=\text{Nr}ʻ(\Sigma ʻP\times R)\\ [*166·44] &=\text{Nr}ʻ\Sigma ʻ(\times R)^{;}P &\qquad \text{(1)}\\ \vdash .*166·3. \supset \vdash :\text{Hp}.&\supset .(\times R)^{;}P\in \text{Rel}^{2}\text{excl}.\\ [*183·13] &\supset .\text{Nr}ʻ\Sigma ʻ(\times R)^{;}P=\Sigma \text{Nr}ʻ(\times R)^{;}P &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*184·34. $\vdash .(\text{Nr}ʻP\dot{+} \text{Nr}ʻQ)\dot{\times} \text{Nr}ʻR=(\text{Nr}ʻP\dot{\times} \text{Nr}ʻR)\dot{+} (\text{Nr}ʻQ\dot{\times} \text{Nr}ʻR)$

Dem. $\begin{array}{l} \vdash .*180·3.*184·13.\supset \\ \vdash .(\text{Nr}ʻP\dot{+} \text{Nr}ʻQ)\dot{\times} \text{Nr}ʻR&=\text{Nr}ʻ\{(P+Q)\times R\}\\ [*166·45.*180·1] &=\text{Nr}ʻ[\{\downarrow (\Lambda \cap CʻQ)^{;}\iota ^{;}P\}\times R\unicode{x2909}\{(\Lambda \cap CʻP)\downarrow ^{;}\iota ^{;}Q\}\times R]\\ [*166·3.*180·11·32] &=\text{Nr}ʻ[\{\downarrow (\Lambda \cap CʻQ)^{;}\iota ^{;}P\}\times R]\dot{+} \text{Nr}ʻ[\{(\Lambda \cap CʻP)\downarrow ^{;}\iota ^{;}Q\}\times R]\\ [*184·14.*180·12] &=\text{Nr}ʻ(P\times R)\dot{+} \text{Nr}ʻ(Q\times R)\\ [*184·13] &=(\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ)\dot{+} (\text{Nr}ʻQ\dot{\times} \text{Nr}ʻR).\supset \vdash .\text{Prop} \end{array}$

*184·35. $\vdash .(\nu \dot{+} \varpi )\dot{\times} \mu =(\nu \dot{\times} \mu )\dot{+} (\varpi \dot{\times} \mu ) \quad[*184·34]$

Dem. $\begin{array}{l} \vdash .*184·111.*180·4.&\supset \vdash :\mu {\sim}\in \text{N}_{0}\text{R}.\supset .2_{r}\dot{\times} \mu =\Lambda .\mu \dot{+} \mu =\Lambda &\qquad \text{(1)}\\ \vdash .*153·24.*184·13.\supset \\ \vdash :\mu& =\text{N}_{0}\text{r}ʻP.\supset .2_{r}\dot{\times} \mu =\text{Nr}ʻ\{\Lambda \downarrow (\iota ʻx)\times P\} &\qquad \text{(2)}\\ \vdash .*166·1.\supset \vdash .\Lambda \downarrow (\iota ʻx)\times P&=\Sigma ʻP\downarrow_{.,} ^{;}(\Lambda \downarrow \iota ʻx)\\ [*150·71] &=\Sigma ʻ\{(P\downarrow_{.,} \Lambda )\downarrow (P\downarrow_{.,} \iota ʻx)\}\\ [*162·3] & =(P\downarrow_{.,} \Lambda )\unicode{x2909}(P\downarrow_{.,} \iota ʻx) &\qquad \text{(3)}\\ \vdash .*180·31·32.*165·251·211.\text{Transp}.\supset \\ \vdash .\text{Nr}ʻ\{(P\downarrow_{.,} \Lambda )\unicode{x2909}(P\downarrow_{.,} \iota ʻx)\}&=\text{Nr}ʻP\dot{+} \text{Nr}ʻP &\qquad \text{(4)}\\ \vdash .(2).(3).(4).\supset \vdash :\mu =\text{N}_{0}\text{r}ʻP.\supset .2_{r}\dot{\times} \mu &=\text{Nr}ʻP\dot{+} \text{Nr}ʻP\\ [*180·3] &=\mu \dot{+} \mu &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*184·41. $\vdash :\nu \neq 0_{r}.\supset .(\nu \dot{+} \dot{1} )\dot{\times} \mu = (\nu \dot{\times} \mu) \dot{+} \mu$

Dem. $\begin{array}{l} \vdash .*166·53.*180·32.*165·251.\supset \\ \vdash :\dot{\exists} !Q.y{\sim}\in CʻQ.\supset .\text{Nr}ʻ\{(Q\unicode{x21f8} y)xP\} = \text{Nr}ʻ(QxP)\dot{+} \text{Nr}ʻP &\qquad \text{(1)}\\ \vdash .(1).*181·32.*184·13.\supset \\ \vdash :\mu = \text{Nr}ʻP.\nu = \text{Nr}ʻQ.\nu \neq 0_{r}.y{\sim}\in CʻQ.\supset .(\nu \dot{+} \dot{1} )\dot{\times} \mu = (\nu \dot{\times} \mu )\dot{+} \mu &\qquad \text{(2)}\\ \vdash .*181·11·12.\supset \vdash :\nu \in \text{NR}-\iota ʻ\Lambda .\supset .(\exists Q,y).\nu = \text{Nr}ʻQ.y{\sim}\in CʻQ &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \\ \vdash :\mu \in \text{NR}.\nu \in \text{NR}-\iota ʻ\Lambda .\nu \neq 0_{r}.\supset .(\nu \dot{+} \dot{1} )\dot{\times} \mu = (\nu \dot{\times} \mu )\dot{+} \mu &\qquad \text{(4)}\\ \vdash .*184·111.*181·4.\supset \\ \vdash :{\sim}(\mu \in \text{NR}.\nu \in \text{NR}-\iota ʻ\Lambda ).\supset .(\nu \dot{+} 1)\dot{\times} \mu = \Lambda .(\nu \dot{\times} \mu )\dot{+} \mu = \Lambda &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*184·42. $\vdash :\nu \neq 0_{r}.\supset .(\dot{1} \dot{+} \nu )\dot{\times} \mu = \mu \dot{+} (\nu \dot{\times} \mu ) \quad[\text{Proof as in *184·41}]$

*184·5. $\vdash :\mu ,\nu \in \text{NR}.\supset .Cʻʻ(\mu \dot{\times} \nu ) = Cʻʻ\mu \times _{c}Cʻʻ\nu$

Dem. $\begin{array}{l} \vdash .*184·13.\supset \vdash :\text{Hp}.P\in \mu .Q\in \nu .\supset .Cʻʻ(\mu \dot{\times} \nu ) &= Cʻʻ\text{Nr}ʻ(P\times Q)\\ [*152·7.*166·12] & = \text{Nc}ʻ(CʻP\times CʻQ)\\ [*152·7.*113·25] &= Cʻʻ\text{Nr}ʻP\times _{c}Cʻʻ\text{Nr}ʻQ\\ [*152·45] & = Cʻʻ\mu x_{c}Cʻʻ\nu &\qquad \text{(1)}\\ \vdash .*184·11.*113·204.\supset \\ \vdash :{\sim}(\exists !\mu .\exists !\nu ).\supset .Cʻʻ(\mu \dot{\times} \nu )& = \Lambda .Cʻʻ\mu \times _{c}Cʻʻ\nu = \Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The subject of this number is analogous to part of the subject of *114. The propositions concerned are immediate consequences of previously proved properties of $\Pi ʻP$ , and offer no difficulty of any kind.

*185·11. $\vdash :P \,\,\text{smor}\, \,\text{smor}\, Q.\supset .\Pi \text{Nr}ʻP=\Pi \text{Nr}ʻQ \quad[*172·44]$

*185·12. $\vdash .\Pi \text{Nr}ʻP=\text{Nr}ʻ\text{Prod}ʻ\breve{\downarrow}_{.,}^{;}P=\text{Nr}ʻ\Pi ʻ\breve{\downarrow}_{.,}^{;}P \quad[*182·44]$

*185·21. $\vdash .\Pi \text{Nr}ʻ(P\downarrow P)=\text{Nr}ʻP \quad[*172·2.*165·251]$

*185·22. $\vdash .\Pi \text{Nr}ʻ(\dot{\Lambda} \downarrow \dot{\Lambda} )=0_{r} \quad[*185·21]$

*185·23. $\vdash :\dot{\Lambda} \in CʻP.\supset .\Pi \text{Nr}ʻP=0_{r} \quad [*172·14]$

*185·25. $\vdash \colon\colon\text{Mult ax}.\supset \colon\ldotp \Pi \text{Nr}ʻP=0_{r}.\equiv :\dot{\Lambda} \in CʻP.\lor.P=\dot{\Lambda} \quad[*172·182]$

*185·27. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in &\text{Rel}^{2}\text{excl}.\exists !P\,\overline{\,\text{smor}\,}\,Q\cap \text{Rl}ʻ\,\text{smor}\,.\supset .\\ &\Pi \text{Nr}ʻP=\Pi \text{Nr}ʻQ \quad[*172·45]\end{align}$

*185·28. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P,Q\in &\text{Rel}^{2}\text{excl}.P,Q\in \text{Nr}ʻR.CʻP,CʻQ\in \text{Cl}ʻ\text{Nr}ʻS.\supset .\\ &\Pi \text{Nr}ʻP=\Pi \text{Nr}ʻQ \quad[*164·48.*185·11]\end{align}$

*185·29. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P\in &\text{Rel}^{2}\text{excl}.P\in \text{Nr}ʻR.CʻP\subset \text{Nr}ʻS.\supset .\\ &\Pi \text{Nr}ʻP=\text{Nr}ʻ(S\,\text{exp}\,\,R) \quad[*176·24]\end{align}$

*185·31. $\begin{align}&\vdash :\dot{\exists} !P.\dot{\exists} !Q.CʻP\cap CʻQ=\Lambda .\supset .\Pi \text{Nr}ʻ(P\unicode{x2909}Q)=\Pi \text{Nr}ʻP\dot{\times} \Pi \text{Nr}ʻQ\\ &[*172·35]\end{align}$

*185·32. $\vdash :Z{\sim}\in CʻP.\supset .\Pi \text{Nr}ʻ(P\unicode{x21f8} Z)=\Pi \text{Nr}ʻP\dot{\times} \text{Nr}ʻZ \quad[*172·32]$

*185·321. $\vdash :Z{\sim}\in CʻP.\supset .\Pi \text{Nr}ʻ(Z\unicode{x21f7}P)=\text{Nr}ʻZ\dot{\times} \Pi \text{Nr}ʻP \quad[*172·321]$

*185·35. $\vdash :P\neq Q.\supset .\Pi \text{Nr}ʻ(P\downarrow Q)=\text{Nr}ʻP\dot{\times} \text{Nr}ʻQ \quad [*172·23]$

*185·4. $\begin{align}&\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}:QPQ.\supset _{Q}.CʻQ\in 0\cup 1:\supset .\Pi \text{Nr}ʻ\Pi ^{;}P=\Pi \text{Nr}ʻ\Sigma ʻP\\ &[*174·241]\end{align}$

*185·41. $\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.\supset .\Pi \text{Nr}ʻ\Pi ^{;}P=\Pi \text{Nr}ʻ\Sigma ʻP \quad[*174·25]$

The following proposition gives the connection between ordinal and cardinal multiplication.

*185·5. $\vdash : P \in \text{Rel}^{2}\text{excl} . \dot{\exists} ! P . \supset . Cʻʻ\Pi \text{Nr}ʻP = \Pi \text{Nc}ʻCʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*173·16.\supset \vdash :\text{Hp}.\supset .Cʻʻ\Pi \text{Nr}ʻP&=Cʻʻ\text{Nr}ʻ\text{Prod}ʻP\\ [*152·7] &= \text{Nc}ʻCʻ\text{Prod}ʻP\\ [*173·161] &= \text{Nc}ʻ\text{Prod}ʻCʻʻCʻP\\ [*163·16.*115·12] &=\Pi \text{Nc}ʻCʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

For " $\mu$ to the $\nu$ th power," where ordinal powers are concerned, we use the notation " $\mu \,\text{exp}\,\,_{r}\nu$ ." We cannot use " $\mu ^\nu$ " or " $\mu \,\text{exp}\,\,\nu$ " because these have been already used for cardinals and classes (*116). We therefore put a suffix $r$ to " $\,\text{exp}\,$ " to show that it is relational powers that we are dealing with. We put $\mu \,\text{exp}\,\,_{r}\nu =\hat{R} \{(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\,\text{exp}\,\,Q)\} \quad\text{Df}.$

*186·2. $\vdash :\mu \in \text{N}_{0}\text{R}.\supset .0_{r}\,\text{exp}\,\,_{r}\mu =0_{r}.\mu \,\text{exp}\,\,_{r}0_{r}=0_{r}$

We do not have $\mu \,\text{exp}\,\,_{r}0_{r}=1$ , because there is no ordinal 1.

*186·22. $\vdash .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha$

*186·23. $\vdash .\alpha \,\text{exp}\,\,_{r}(\dot{1} \dot{+} \beta )=\alpha \dot{\times} (\alpha \,\text{exp}\,\,_{r}\beta )$

*186·14. $\vdash :\nu \neq 0_{r}.\varpi \neq 0_{r}.\supset .\mu \,\text{exp}\,\,_{r}(\nu \dot{+} \varpi )=(\mu \,\text{exp}\,\,_{r}\nu )\dot{\times} (\mu \,\text{exp}\,\,_{r}\varpi )$

*186·15. $\vdash :\varpi \subset \text{Rl}ʻJ.\supset .\mu \,\text{exp}\,\,_{r}(\varpi \dot{\times} \nu )=(\mu \,\text{exp}\,\,_{r}\nu )\,\text{exp}\,\,_{r}\varpi$

*186·31. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :\mu \nu \in \text{NR}-\iota ʻ\Lambda .P\in \text{Rel}^{2}\text{excl}\cap &\mu .CʻP\subset \nu .\supset .\\ &\Pi \text{Nr}ʻP=\mu \,\text{exp}\,\,_{r}\nu\end{align}$

*186·4. $\vdash .\text{Nr}ʻP_{\text{df}}=2_{r}\,\text{exp}\,\,_{r}(\text{Nr}ʻP)$ (cf.*177)

*186·5. $\vdash :\mu ,\nu \in \text{N}_{0}\text{R}.\nu \neq 0_{r}.\supset .Cʻʻ(\mu \,\text{exp}\,\,_{r}\nu )=(Cʻʻ\mu )^{Cʻʻ\nu }$

*186·01. $\mu \,\text{exp}\,\,_{r}\nu =\hat{R} \{(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\,\text{exp}\,\,Q)\} \quad\text{Df}$

*186·02. $(\text{Nr}ʻP)\,\text{exp}\,\,_{r}\nu =(\text{N}_{0}\text{r}ʻP)\,\text{exp}\,\,_{r}\nu \quad\text{Df}$

*186·03. $\mu \,\text{exp}\,\,_{r}(\text{Nr}ʻQ)=\mu \,\text{exp}\,\,_{r}(\text{N}_{0}\text{r}ʻQ) \quad\text{Df}$

*186·1. $\begin{align}&\vdash :R\in \mu \,\text{exp}\,\,_{r}\nu .\equiv .(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\text{smor}\,(P\,\text{exp}\,\,Q)\\ &[(*186·01)]\end{align}$

*186·11. $\vdash .\exists !\mu \,\text{exp}\,\,_{r}\nu .\supset .\mu ,\nu \in \text{N}_{0}\text{R}.\mu ,\nu \in \text{NR}-\iota ʻ\Lambda$

*186·111. $\vdash :{\sim}(\mu \nu \in \text{N}_{0}\text{R}).\supset .\mu \,\text{exp}\,\,_{r}\nu =\Lambda$

*186·12. $\begin{align}&\vdash :R\in \mu \,\text{exp}\,\,_{r}\nu .\equiv .(\exists P,Q).\mu =\text{N}_{0}\text{r}ʻP.\nu =\text{N}_{0}\text{r}ʻQ.R\,\,\text{smor}\,\,P^{Q}\\ &[*176·181.*186·1]\end{align}$

*186·13. $\begin{align}\vdash .(\text{Nr}ʻP)\,\text{exp}\,\,_{r}(\text{Nr}ʻQ)&=(\text{N}_{0}\text{r}ʻP)\,\text{exp}\,\,_{r}(\text{Nr}ʻQ)=(\text{Nr}ʻP)\,\text{exp}\,\,_{r}(\text{N}_{0}\text{r}ʻQ)\\ &=(\text{N}_{0}\text{r}ʻP)\,\text{exp}\,\,_{r}(\text{N}_{0}\text{r}ʻQ)=\text{Nr}ʻ(P\,\text{exp}\,\,Q)=\text{Nr}ʻ(P^{Q})\\ [\text{Proof as in *180·3}]\end{align}$

*186·14. $\vdash :\nu \neq 0_{r}.\varpi \neq 0_{r}.\supset .\mu \,\text{exp}\,\,_{r}(\nu \dot{+} \varpi )=(\mu \,\text{exp}\,\,_{r}\nu )\dot{\times} (\mu \,\text{exp}\,\,_{r}\varpi )$

Dem. $\begin{array}{l} \vdash .*180·4.*186·111.\supset \\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}).&\supset .\mu \,\text{exp}\,\,_{r}(\nu \dot{+} \varpi )=\Lambda .(\mu \,\text{exp}\,\,_{r}\nu )\dot{\times} (\mu \,\text{exp}\,\,_{r}\varpi )=\Lambda &\qquad \text{(1)}\\ \vdash .*186·13.*180·3.\supset \\ \vdash :\mu =\text{N}_{0}\text{r}ʻP.\nu &=\text{N}_{0}\text{r}ʻQ.\varpi =\text{N}_{0}\text{r}ʻR.\supset .\mu \,\text{exp}\,\,_{r}(\nu \dot{+} \varpi )=\text{Nr}ʻP^{Q+R} &\qquad \text{(2)}\\ \vdash .176·42.*180·11.\supset \\ \vdash :\text{Hp}.\text{Hp}(2).\supset .\text{Nr}ʻP^{Q+R}&=\text{Nr}ʻ(P^{\downarrow(\Lambda \cap CʻP){;}\iota{;}Q}\times P^{(\Lambda \cap CʻP)\downarrow{;}\iota{;}R})\\ [*180·12.*176·22.*166·23] &=\text{Nr}ʻ(P^{Q}\times P^{R})\\ [*186·13.*184·13] &=(\mu \,\text{exp}\,_{r}\nu )\dot{\times} (\mu \,\text{exp}\,_{r}\varpi ) &\qquad \text{(3)}\\ \vdash .(2).(3).*155·2.&\supset \vdash :\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}.\nu \neq 0_{r}.\varpi \neq 0_{r}.\supset .\\ &\mu \,\text{exp}\,_{r}(\nu \dot{+} \varpi )=(\mu \,\text{exp}\,_{r}\nu )\dot{\times} (\mu \,\text{exp}\,_{r}\varpi ) &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*186·15. $\vdash :\varpi \subset \text{Rl}ʻJ.\supset .\mu \,\text{exp}\,\,_{r}(\varpi \dot{\times} \nu )=(\mu \,\text{exp}\,\,_{r}\nu )\,\text{exp}\,\,_{r}\varpi )$

Dem. $\begin{array}{l} \vdash .*186·111.*184·111.\supset \\ \vdash :{\sim}(\mu ,\nu ,\varpi \in \text{N}_{0}\text{R}).&\supset .\mu \,\text{exp}\,\,_{r}(\varpi \dot{\times} \nu )=\Lambda .(\mu \,\text{exp}\,\,_{r}\nu )\,\text{exp}\,\,_{r}\varpi =\Lambda &\qquad \text{(1)}\\ \vdash .*186·13.*184·13.\supset \\ \vdash :\mu =\text{N}_{0}\text{r}ʻP.\nu& =\text{N}_{0}\text{r}ʻQ.\varpi =\text{N}_{0}\text{r}ʻR.\supset .\mu \,\text{exp}\,\,_{r}(\varpi \dot{\times} \nu )=\text{Nr}ʻ(P^{R\times Q}) &\qquad \text{(2)}\\ \vdash .*176·57.\supset \vdash :\text{Hp}.\text{Hp}(2).\supset .\text{Nr}ʻ(P^{P\times Q})&=\text{Nr}ʻ(P^{Q})^{R}\\ [*186·13] & =\{(\text{N}_{0}\text{r}ʻP)\,\text{exp}\,\,_{r}(\text{N}_{0}\text{r}ʻQ)\}\,\text{exp}\,\,_{r}(\text{N}_{0}\text{r}ʻR)\\ [\text{Hp}] &=(\mu \,\text{exp}\,\,_{r}\nu )\,\text{exp}\,\,_{r}\varpi &\qquad \text{(3)}\\ \vdash .(2).(3).*155·2.\supset \\ \vdash :\mu ,\nu ,\varpi \in &\text{N}_{0}\text{R}.\varpi \subset \text{Rl}ʻJ.\supset .\mu \,\text{exp}\,\,_{r}(\varpi \dot{\times} \nu )=(\mu \,\text{exp}\,\,_{r}\nu )\,\text{exp}\,\,_{r}\varpi &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*186·2. $\vdash :\mu \in \text{N}_{0}\text{R}\supset .0_{r}\,\text{exp}\,\,_{r}\mu =0_{r}.\mu \,\text{exp}\,\,_{r}0_{r}=0_{r} \quad[*176·151]$

Dem. $\begin{array}{l} \vdash .*186·111.*184·111.&\supset \vdash :\mu {\sim}\in \text{N}_{0}\text{R}.\supset .\mu \,\text{exp}\,\,_{r}2_{r}=\Lambda .\mu \dot{\times} \mu =\Lambda &\qquad \text{(1)}\\ \vdash .*186·13.*176·1. &\supset \vdash :\mu =N_{O}rʻP.x\neq y.\supset .\\ \mu \,\text{exp}\,\,_{r}2_{r}&=\text{Nr}ʻ\text{Prod}ʻP\downarrow_{.,} ^{;}(x\downarrow y)\\ [*150·71] &=\text{Nr}ʻ\text{Prod}ʻ\{(P\downarrow_{.,} x)\downarrow (P\downarrow_{.,} y)\}\\ [*173·24.*165·211.\text{Transp}] &=\text{Nr}ʻ\{(P\downarrow_{.,} x)\times (P\downarrow_{.,} y)\}\\ [*165·251.*166·23] &=\text{Nr}ʻ(P\times P)\\ [*184·13] & =\mu \dot{\times} \mu &\qquad \text{(2)}\\ \vdash .(2).*155·2.*24·1. &\supset \vdash :\mu \in N_{O}R.\supset .\mu \,\text{exp}\,\,_{r}2_{r}=\mu \dot{\times} \mu &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*186·22. $\vdash .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha$

Dem. $\begin{array}{l} \vdash .*186·111.*181·4.\supset\\ \vdash :{\sim}(\alpha ,\beta \in N_{O}R).&\supset .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=\Lambda .(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha =\Lambda &\qquad \text{(1)}\\ \vdash .*186·13.*181·22.\supset \\ \vdash :\alpha =N_{O}rʻP.\beta =N_{O}rʻQ.&\supset .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=\text{Nr}ʻ\{P\,\text{exp}\,\,(Q\dot{\unicode{x21f8}} z)\}.\\ &(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha =\text{Nr}ʻ(P\,\text{exp}\,\,Q)\dot{\times} \text{Nr}ʻP &\qquad \text{(2)}\\ \vdash .(2).*176·151.*166·13.\supset \\ \vdash :\text{Hp}(2).P=\dot{\Lambda} .&\supset .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=0_{r}.(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha =0_{r}&\qquad \text{(3)}\\ \vdash .*165·2.*161·4.*176·1.(*181·01).\supset \\ \vdash .\text{Nr}ʻ\{P\,\text{exp}\,\,(Q\dot{\unicode{x21f8}} z)\}&=\text{Nr}ʻ\text{Prod}ʻ[P\downarrow_{.,} ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}Q\unicode{x21f8} P\downarrow_{.,} \{(\Lambda \cap CʻP)\downarrow \iota ʻx\}] &\qquad \text{(4)}\\ \vdash .*165·221·222.*181·11.*162·22.\supset \\ \vdash :\dot{\exists} !P.\supset .P\downarrow_{.,} &\{(\Lambda \cap CʻP)\downarrow \iota ʻx\}{\sim}\in CʻP\downarrow_{.,} ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}Q.\\ &CʻP\downarrow_{.,} \{(\Lambda \cap CʻP)\downarrow \iota ʻx\}\cap Cʻ\Sigma ʻP\downarrow_{.,} ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}Q=\Lambda &\qquad \text{(5)}\\ \vdash .(4).(5).*165·21.*173·25.\supset \vdash :\dot{\exists} !P.\supset .\\ &\text{Nr}ʻ\{P\,\text{exp}\,\,(Q\dot{\unicode{x21f8}} z)\}=\text{Nr}ʻ[(\text{Prod}ʻP\downarrow_{.,} ^{;}\downarrow \Lambda _{x}^{;}\iota ^{;}Q)\times P\downarrow_{.,} \{(\Lambda \cap CʻP)\downarrow \iota ʻx\}]\\ [*181·12.*165·251.*176·1·22.*184·13]&=\text{Nr}ʻ(P\,\text{exp}\,\,Q)\dot{\times} \text{Nr}ʻP &\qquad \text{(6)}\\ \vdash .(2).(6).\supset \vdash :\text{Hp}(2).\dot{\exists} !P.&\supset .\alpha \,\text{exp}\,\,_{r}(\beta \dot{+} \dot{1} )=(\alpha \,\text{exp}\,\,_{r}\beta )\dot{\times} \alpha &\qquad \text{(7)}\\ \vdash .(1).(3).(7).\supset \vdash .\text{Prop} \end{array}$

*186·23. $\vdash .\alpha \,\text{exp}\,\,_{r}(\dot{1} \dot{+} \beta )=\alpha \dot{\times} (\alpha \,\text{exp}\,\,_{r}\beta ) \quad[\text{Proof as in *186·22}]$

*186·3. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :P\in &\text{Rel}^{2}\text{excl}\cap \text{Nr}ʻR.CʻP\subset \text{Nr}ʻS.\supset .\\ &\Pi \text{Nr}ʻP=(\text{Nr}ʻP)\,\text{exp}\,\,_{r}(\text{Nr}ʻS) \quad[*185·29]\end{align}$

*186·31. $\begin{align}\vdash \colon\ldotp \text{Mult ax}.\supset :\mu ,\nu \in \text{NR}-\iota ʻ\Lambda .P\in &\text{Rel}^{2}\text{excl}\cap \mu .CʻP\subset \nu .\supset .\\ &\Pi \text{Nr}ʻP=\mu \,\text{exp}\,\,_{r}\nu \quad[*186·3]\end{align}$

*186·4. $\vdash .\text{Nr}ʻP_{\text{df}}=2_{r}\,\text{exp}\,\,_{r}(\text{Nr}ʻP) \quad[*177·13]$

*186·5. $\vdash :\mu ,\nu \in \text{N}_{0}\text{R}.\nu \neq 0_{r}.\supset .Cʻʻ(\mu \,\text{exp}\,\,_{r}\nu )=(Cʻʻ\mu )^{Cʻʻ\nu }$

Dem. $\begin{array}{l} \vdash .*152·7.*186·13.\supset \vdash :\mu =\text{N}_{0}\text{r}ʻP.\nu &=\text{N}_{0}\text{r}ʻQ.\supset .\\ Cʻʻ(\mu \,\text{exp}\,\,_{r}\nu )&=\text{Nc}ʻCʻ(P\,\text{exp}\,\,Q) &\qquad \text{(1)}\\ \vdash .(1).*176·14.\supset \vdash :\text{Hp}(1).\nu \neq 0_{r}.\supset .Cʻʻ(\mu \,\text{exp}\,\,_{r}\nu )&=\text{Nc}ʻ\{(CʻP)\,\text{exp}\,\,(CʻQ)\}\\ [*116·222] &=(\text{N}_{0}\text{c}ʻCʻP)^{\text{N}_{0}\text{c}ʻCʻQ}\\ [*155·6] &=(Cʻʻ\text{N}_{0}\text{r}ʻP)^{Cʻʻ\text{N}_{0}\text{r}ʻQ}\\ [\text{Hp}] & =(Cʻʻ\mu )^{cʻʻ\nu }:\supset \vdash .\text{Prop} \end{array}$

A RELATION is said to be serial, or to generate a series, when it possesses three different properties, namely (1) being contained in diversity, (2) transitiveness, (3) connexity, i.e. the property that the relation or its converse holds between any two different members of its field. Thus $P$ is a serial relation if (1) $P\,\unicode{x2abd}\, J$ , (2) $P^{2}\,\unicode{x2abd}\, P$ , (3) $x,y\in CʻP.x\neq y.\supset _{x,y}:xPy.\lor.yPx$ . The third characteristic, that of connexity, may be written more shortly $x\in CʻP.\supset _{x}.\overrightarrow{P}ʻx\cup \iota ʻx\cup \overleftarrow{P}ʻx=CʻP,$ i.e. $x\in CʻP.\supset _{x}.\overleftrightarrow{P}ʻx=CʻP$ , using the notation of *97; and this, in virtue of *97·23, is equivalent to $\overleftrightarrow{P}ʻʻCʻP\in 0\cup 1.$

In virtue of *50·47, the first two characteristics are equivalent to $P\dot{\cap} \breve{P} =\dot{\Lambda} .P^{2}\,\unicode{x2abd}\, P.$ When $P\dot{\cap} \breve{P} =\dot{\Lambda}$ , we say that $P$ is "asymmetrical." Thus serial relations are such as are asymmetrical, transitive, and connected.

It might be thought that a serial relation need not be contained in diversity, since we commonly speak of series in which there are repetitions, i.e. in which an earlier term is identical with a later term. Thus, e.g. $a,\, b,\, c,\, a,\, e,\, f,\, b,\, g,\, h$ would be called a series of letters, although the letters $a$ and $b$ recur. But in all such cases, there is some means (in the above case, position in space) by which one occurrence of a given term is distinguished from another occurrence, and this will be found to mean that there is some other series (in the above case, the series of positions in a line) free from repetitions, with which our pseudo-series has a one-many correlation. Thus, in the above instance, we have a series of nine positions, which we may call $1,\, 2,\, 3,\, 4,\, 5,\, 6,\, 7,\, 8,\, 9,$ which form a true series without repetitions; we have a one-many relation, that of occupying these positions, by means of which we distinguish occurrences of $a$ , the first occurrence being a as the correlate of 1, the second being[Pg 514] $a$ as the correlate of 4. All series in which there are repetitions (which we may call pseudo-series) are thus obtained by correlation with true series, i.e, with series in which there is no repetition. That is to say, a pseudo-series has as its generating relation a relation of the form $S^{;}P$ , where $P$ is a serial relation, and $S$ is a one-many relation whose converse domain contains the field of $P$ . Thus what we may call self-subsistent series must be series without repetitions, i.e. series whose generating relations are contained in diversity.

For our purposes, there is no use in distinguishing a series from its generating relation. A series is not a class, since it has a definite order, while a class has no order, but is capable of many orders (unless it contains only one term or none). The generating relation determines the order, and also the class of terms ordered, since this class is the field of the generating relation. Hence the generating relation completely determines the series, and may, for all mathematical purposes, be taken to be the series.

When $P$ is transitive, we have $P_{\text{po}}=P.P_{*}=P\unicode{x228d} I\upharpoonright CʻP.$ Hence all the propositions of Part II, Section E become greatly simplified when applied to series.

Also, since the field of a connected relation consists of a single family, a series has one first term or none, and one last term or none.

In the case of a serial relation $P$ , the relation $P_{1}$ (defined in *121·02) becomes $P\dot{-} P^{2}$ , i.e. the relation "immediately preceding." In a discrete series, the terms in general immediately precede other terms. A compact series, on the contrary, is defined as one in which there are terms between any two: in such a series, $P_{1}=\dot{\Lambda}$ .

It very frequently occurs that we wish to consider the relations of various series which are all contained in some one series; for example, we may wish to consider various series of real numbers, all arranged in order of magnitude. In such a case, if $P$ is the series in which all the others are contained, and $\alpha$ , $\beta$ , $\gamma$ , ... are the fields of the contained series, the contained series themselves are $P\unicode{x0294f}\alpha$ , $P\unicode{x0294f}\beta$ , $P\unicode{x0294f}\gamma$ , .... Thus when series are given as contained in a given series, they are completely determined by their fields.

In what follows, Section A deals with the elementary properties of series, including maximum and minimum points, sequent points and limits.

Section B will deal with the theory of segments and kindred topics; in this section we shall define "Dedekindian" series, and shall prove the important proposition that the series of segments of a series is always Dedekindian, i.e. that every class of segments has either a maximum or a limit.

Section C, which stands outside the main developments of the book, is concerned with convergence and the limits of functions and the definition of a continuous function. Its purpose is to show how these notions can be expressed, and many of their properties established, in a much more general way than is usually done, and without assuming that the arguments or values of the functions concerned are either numerical or numerically measurable.

Section D will deal with "well-ordered" series, i.e. series in which every class containing members of the field has a first term. The properties of well-ordered series are many and important; most of them depend upon the fact that an extended variety of mathematical induction is possible in dealing with well-ordered series. The term "ordinal number" is confined by usage to the relation-number of a well-ordered series; ordinal numbers will also be considered in our fourth section.

Section E will deal with finite and infinite. We shall show that the distinction between "inductive" and "non-reflexive" does not arise in well-ordered series.

Section F will deal with "compact" series, i.e. series in which there is a term between any two, i.e. in which $P^{2}=P$ . In particular we shall consider "rational" series (i.e. series like the series of rationals in order of magnitude) and continuous series (i.e. series like the series of real numbers in order of magnitude). Our treatment of this subject will follow Cantor closely.

In the present section, we shall be concerned with the properties common to all series. Such properties, for the most part, are very simple, and present no difficulties of any kind. Many of the properties of series do not require all the three characteristics by which serial relations are defined, but only one or two of these properties: we therefore begin with numbers in which, though the properties proved derive their chief importance from their applicability to series, the hypotheses are only that the relations in question have one or two of the properties of serial relations. Thence we proceed to the most elementary properties peculiar to series, and thence to the theory of minimum and maximum members of classes contained in a series, and of the successors and limits of classes. We then proceed to the correlation of a series with part of itself. The ground covered is familiar, and the difficulties encountered are less than in most previous sections.

It will be observed that where series are concerned, if $\alpha$ is an existent class contained in $CʻP$ , $pʻ\overleftarrow{P}ʻʻ\alpha$ is correlative to $Pʻʻ\alpha$ (which is $sʻ\overrightarrow{P}ʻʻ\alpha$ ): $Pʻʻ\alpha$ is "predecessors of some $\alpha$ ," and $pʻ\overleftarrow{P}ʻʻ\alpha$ is "successors of all $\alpha$ 's." If $\alpha$ is an existent class contained in $CʻP$ , the whole of $CʻP$ , with the exception of the last term of $\alpha$ (if there is such a term), belongs to one or other of the classes $Pʻʻ\alpha$ , $pʻ\overleftarrow{P}ʻʻ\alpha$ , of which the first wholly precedes the second. The division of $CʻP$ into these two classes is the Dedekind "cut" defined by $\alpha$ . But when only part of $\alpha$ is contained in $CʻP$ , we must replace $pʻ\overleftarrow{P}ʻʻ\alpha$ by $pʻ\overleftarrow{P}ʻʻ(\alpha\cap CʻP)$ , since $pʻ\overleftarrow{P}ʻʻ\alpha =\Lambda$ if $\alpha$ has any member not belonging to $CʻP$ . Again, if $\alpha \cap CʻP=\Lambda$ , we have $pʻ\overleftarrow{P}ʻʻ(\alpha\cap CʻP)=\text{V}$ . But what we want is the complement to $Pʻʻ\alpha$ , which in this case is null. Hence we must replace $pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$ by $CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$ : this is $CʻP$ when $Pʻʻ\alpha =\Lambda$ , i.e. when $\alpha \cap CʻP=\Lambda$ . In any other event it is equal to $pʻ\overleftarrow{P}ʻʻ(\alpha\cap CʻP)$ . If $\alpha$ [Pg 517] is contained in $CʻP$ and is not null, $CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=pʻ\overleftarrow{P}ʻʻ\alpha$ . Thus the Dedekind "cut" defined by a class $\alpha$ , whether or not this class is contained in whole or part in $CʻP$ , is always the two classes $Pʻʻ\alpha , CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).$

Throughout the elementary propositions of this section, we have been careful to avoid stronger hypotheses than are required: we have not assumed $P$ to be serial, if our conclusion would follow (e.g.) from the hypothesis that $P$ is transitive and connected. It will be found that many properties of series depend upon the fact that, if $x$ , $y$ are two different terms of a series $P$ , then $xPy.\equiv .{\sim}(yPx)$ (*204·3). Here the implication $xPy.\supset .{\sim}(yPx)$ requires that $P$ should be asymmetrical, i.e. that we should have $P\dot{\cap} \breve{P}=\dot{\Lambda}$ , or $P^{2}\,\unicode{x2abd}\, J$ . The implication ${\sim}(yPx).\supset .xPy$ requires that $P$ should be connected. Thus the hypothesis required is not that $P$ should be serial, but that $P$ should be connected and asymmetrical (*202·5).

Again, consider the proposition that if $P$ is a series, $P_{1}=P\dot{-} P^{2}$ . This relation $P_{1}$ is the very useful relation "immediately preceding"; thus the above proposition is important, as is the further proposition that if $P$ is a series, $P_{1}$ is a one-one relation. It will be remembered that (by *121) " $xP_{1}y$ " means that $P(x\vdash\dashv y)$ consists of two terms. It was shown in *121·304 ·305 that if $P_{\text{po}}$ is contained in diversity, " $xP_{1}y$ " implies " $xPy$ " and is equivalent to the statement that $x$ and $y$ constitute the whole interval $P(x\vdash\dashv y)$ and are not identical. Also by *121·254, $P_{1}=(P_{\text{po}})_{1}$ . It is evident that, if $P_{\text{po}}$ is contained in diversity, and $xP_{1}y$ , we cannot have $xP^{2}y$ , because there is no term other than $x$ and $y$ in the interval $P(x\vdash\dashv y)$ , and we cannot have $xPx$ or $yPy$ . Hence if $P_{\text{po}}\,\unicode{x2abd}\, J$ , we have $P_{1}\,\unicode{x2abd}\, \dot{-} P^{2}$ . Hence by what was said above (*121·305), if $P_{\text{po}}\,\unicode{x2abd}\, J$ , we shall have $P_{1}\,\unicode{x2abd}\, P\dot{-} P^{2}$ . On the other hand, if $P$ is transitive, we have $P\dot{-} P^{2}\,\unicode{x2abd}\, P_{1}$ (*201·61). Combining these two facts, and remembering that if $P$ is transitive, $P=P_{\text{po}}$ (*201·18), we find that $P_{1}=P\dot{-} P^{2}$ if $P$ is transitive and contained in diversity. We find further (*202·7) that if $P$ is connected, $P\dot{-} P^{2}$ is one-one. Hence we need the full hypothesis that $P$ is a series in order to prove that $P_{1}$ is a one-one (*204·7). This is a good example of the way in which the various separate characteristics that make up the definition of series are relevant in proving the properties of series.

Some of the propositions of this number are repetitions or immediate consequences of previous propositions, especially those of the propositions of *50 which deal with diversity. But we are chiefly concerned here with propositions which will be useful in the theory of series; this leads us to introduce propositions on $pʻ\overleftarrow{P}ʻʻ\alpha$ and on matters connected with relation-arithmetic and other topics. It will be seen that " $P^{2}\,\unicode{x2abd}\, J$ " (i.e. " $P$ is asymmetrical") is an important hypothesis, as is also $P_{\text{po}}\,\unicode{x2abd}\, J$ , of the use of which we have already had examples in *96 and *121.

This is the proposition which makes it impossible to define an ordinal number 1 which shall take its place among relation-numbers applicable to series.

*200·35. $\vdash :P\,\unicode{x2abd}\, J.\alpha \in 1.\supset .P\unicode{x0294f}\alpha =\dot{\Lambda}$

*200·361. $\vdash :P^{2}\,\unicode{x2abd}\, J.\supset .\overrightarrow{P}ʻx\cap ({℩}ʻx\cup \overleftarrow{P}ʻx)=\Lambda .\overleftarrow{P}ʻx\cap (\overrightarrow{P}ʻx\cup {℩}ʻx)=\Lambda$

I.e. if $P^{2}\,\unicode{x2abd}\, J$ , no term precedes itself or any of its predecessors, and no term succeeds itself or any of its successors.

*200·38. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{\text{po}}=P_{*}\dot{\cap} J$

*200·39. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.x\in CʻP.\supset .\overrightarrow{P}_{*}ʻx\cap \overleftarrow{P}_{*}ʻx={℩}ʻx$

*200·211. $\vdash :P\,\unicode{x2abd}\, J.P\,\,\text{smor}\,\,Q.\supset .Q\,\unicode{x2abd}\, J$

I.e. the property of being contained in diversity is invariant for likeness-transformations;

*200·4. $\vdash :P\unicode{x2909}Q\in \text{Rl}ʻJ.\equiv .P,Q\in \text{Rl}ʻJ.CʻP\cap CʻQ=\Lambda$

*200·41. $\vdash : P \unicode{x21f8} x \,\unicode{x2abd}\, J . \equiv . x \unicode{x21f7} P \,\unicode{x2abd}\, J . \equiv . P \,\unicode{x2abd}\, J . x {\sim} \in CʻP$

We then have a set of propositions concerned with $pʻ\overrightarrow{P}ʻʻ\alpha$ and $pʻ\overleftarrow{P}ʻʻ\alpha$ . The most important are

*200·5. $\vdash : P \,\unicode{x2abd}\, J . \supset . \alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha = \Lambda . \alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha = \Lambda$

*200·52. $\vdash : P \,\unicode{x2abd}\, J . \supset . CʻP {\sim} \in \overrightarrow{P}ʻʻCʻP$

*200·53. $\vdash : P^{2} \,\unicode{x2abd}\, J . \supset . Pʻʻ\alpha \cap Pʻ\overleftarrow{P}ʻʻ\alpha = \Lambda . \breve{P} ʻʻ\alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha = \Lambda$

I.e. if $P$ is asymmetrical, the terms which precede part of $\alpha$ do not succeed the whole of $\alpha$ , and vice versa.

*200·11. $\vdash : P \in \text{Rl}ʻJ . \equiv . \breve{P} \in \text{Rl}ʻJ \quad[*50·23]$

Dem. $\begin{array}{l} \vdash .*50·11.*33·17. &\supset \vdash \colon\ldotp \text{Hp} : xPy . \lor . yPx : \supset . y \neq x . y \in CʻP &\qquad \text{(1)}\\ \vdash .(1).*33·132. \supset \vdash \colon\ldotp \text{Hp} . &\supset : x \in CʻP . \supset . (\exists y) . y \neq x . y \in CʻP :\\ [*52·181] &\supset : CʻP {\sim} \in 1 \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*200·2. $\vdash : T \in 1 \rightarrow 1 . \supset . T^{;}(P \dot{\cap} J) = T^{;}P \dot{\cap} J$

Dem. $\begin{array}{l} \vdash .*150·4. &\supset \vdash \colon\ldotp \text{Hp} . \supset :\\ x \{T^{;}(P \dot{\cap} J)\} y . &\equiv . (\exists z, w) . x = Tʻz . y = Tʻw . zPw . z \neq w .\\ [*71·56] &\equiv . (\exists z, w) . x \neq y . x = Tʻz . y = Tʻw . zPw .\\ [*150·4] &\equiv . x \{T^{;}P \dot{\cap} J\} y \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*200·21. $\vdash : T \in \text{Cls} \rightarrow 1. P \,\unicode{x2abd}\,J. \supset . T^{;}P \,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*150·1.*50·24. \supset \vdash \colon\ldotp \text{Hp} . &\supset : x (T^{;}P) y . \supset . (\exists z, w) . xTz . yTw . z \neq w .\\ [*71·171 . \text{Transp}] &\supset . x \neq y \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*200·211. $\vdash : P \,\unicode{x2abd}\, J . P \,\,\text{smor}\, \,Q . \supset . Q \,\unicode{x2abd}\, J \quad[*200·21 . *151·1]$

The properties of relations are very frequently common to all relations which are like a given relation, and this applies specially to the kinds of properties with which we are most concerned. The above proposition is an illustration of this fact: it shows that the property of being contained in diversity is invariant for likeness-transformations.

*200·22. $\vdash : P \,\unicode{x2abd}\, J . \equiv . \text{N}_{0}\text{r}ʻP \subset \text{Rl}ʻJ . \equiv . \exists ! \text{N}_{0}\text{r}ʻP \cap \text{Rl}ʻJ$

Dem. $\begin{array}{l} \vdash .*155·11.*200·211. &\supset \vdash : P \,\unicode{x2abd}\, J . \supset . \text{N}_{0}\text{r}ʻP \subset \text{Rl}ʻJ &\qquad \text{(1)}\\ \vdash .*155·12. &\supset \vdash : \text{N}_{0}\text{r}ʻP \subset \text{Rl}ʻJ . \supset . P \,\unicode{x2abd}\, J &\qquad \text{(2)}\\ \vdash .*155·12. &\supset \vdash : P \,\unicode{x2abd}\, J . \supset . \exists ! \text{N}_{0}\text{r}ʻP \cap \text{Rl}ʻJ &\qquad \text{(3)}\\ \vdash .*155·11.*200·211. &\supset \vdash : \exists ! \text{N}_{0}\text{r}ʻP \cap \text{Rl}ʻJ . \supset . P \,\unicode{x2abd}\, J &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

We have, without the need of typical definiteness, $\begin{aligned} &\vdash :P\,\unicode{x2abd}\, J.\supset .\text{Nr}ʻP\subset \text{Rl}ʻJ\\ \text{and}\quad &\vdash :\exists !\text{Nr}ʻP\cap \text{Rl}ʻJ.\supset .P\,\unicode{x2abd}\, J, \end{aligned}$ both of which are immediate consequences of *200·211. The converse implications, however, fail if $\text{Nr}ʻP$ is taken in a type in which $\text{Nr}ʻP=\Lambda$ .

*200·32. $\vdash :\alpha \uparrow \beta \,\unicode{x2abd}\, J.\equiv .\alpha \cap \beta =\Lambda \quad[*50·55]$

*200·33. $\vdash :P\,\unicode{x2abd}\, J.\supset .P\unicode{x0294f}\alpha \,\unicode{x2abd}\, J \quad[*35·442]$

*200·34. $\vdash :P\unicode{x0294f}\alpha \,\unicode{x2abd}\, J.\equiv .P\upharpoonright \alpha \,\unicode{x2abd}\, J.\equiv .\alpha \upharpoonleft P\,\unicode{x2abd}\, J \quad[*50·58]$

*200·35. $\vdash :P\,\unicode{x2abd}\, J.\alpha \in 1.\supset .P\unicode{x0294f}\alpha =\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*52·16.\supset \vdash \colon\ldotp \text{Hp}.\supset :x,y\in \alpha .&\supset _{x,y}.{\sim}(xJy).\\ [*23·81] &\supset _{x,y}.{\sim}(xPy):\\ [*11·521] &\supset :(x,y).{\sim}\{x,y\in \alpha .xPy\}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*200·36. $\vdash :P^{2}\,\unicode{x2abd}\, J.\supset .P\,\unicode{x2abd}\, J \quad[*50·45]$

*200·361. $\vdash :P^{2}\,\unicode{x2abd}\, J.\supset .\overrightarrow{P}ʻx\cap ({℩}ʻx\cup \overleftarrow{P}ʻx)=\Lambda .\overleftarrow{P}ʻx\cap (\overrightarrow{P}ʻx\cup {℩}ʻx)=\Lambda$

Dem. $\begin{array}{l} \vdash .*51·15. &\supset \vdash :y\in \overrightarrow{P}ʻx\cap {℩}ʻx.\supset .xPx &\qquad \text{(1)}\\ \vdash .*200·36. \supset \vdash :\text{Hp}.&\supset .{\sim}(xPx).\\ [(1).\text{Transp}] &\supset .\overrightarrow{P}ʻx\cap {℩}ʻx=\Lambda &\qquad \text{(2)}\\ \vdash .*34·11. &\supset \vdash :\exists !\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx.\equiv .xP^{2}x &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx=\Lambda &\qquad \text{(4)}\\ \vdash .(2).(4). &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx\cap ({℩}ʻx\cup \overleftarrow{P}ʻx)=\Lambda &\qquad \text{(5)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\overleftarrow{P}ʻx\cap (\overrightarrow{P}ʻx\cup {℩}ʻx)=\Lambda &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*200·37. $\vdash :\exists !\text{Pot}ʻP\cap \text{Rl}ʻJ.\supset .P\,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*91·373 \frac{xSx}{\phi S}.\supset \\ \vdash \colon\colon xPx:S\in \text{Pot}ʻP.xSx.&\supset _{s}.x(S\mid P)x:\supset :Q\in \text{Pot}ʻP.\supset _{Q}.xQx &\qquad \text{(1)}\\ \vdash .*3·2. \supset \vdash \colon\ldotp xPx.&\supset :xSx.\supset .xSx.xPx.\\ [*34·1] & \supset .x(S\mid P)x &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash \colon\ldotp xPx.&\supset :Q\in \text{Pot}ʻP.\supset _{Q}.xQx.\\ [*50·24] &\supset _{Q}.{\sim}(Q\,\unicode{x2abd}\, J) &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}.\supset \vdash :(\exists Q).Q\in \text{Pot}ʻP.Q\,\unicode{x2abd}\, J.&\supset .{\sim}(xPx).\\ [*50·24] & \supset .P\,\unicode{x2abd}\, J:\supset \vdash .\text{Prop} \end{array}$

*200·38. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P_{\text{po}}=P_{*}\dot{\cap} J \quad[*91·541]$

*200·381. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .\overrightarrow{P}_{\text{po}}ʻx\cap \overleftarrow{P}_{*}ʻx=\Lambda .\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{*}=\Lambda$

Dem. $\begin{array}{l} \vdash .*91·56.\supset \vdash :\text{Hp}.&\supset .P_{\text{po}}^{2}\,\unicode{x2abd}\, J.\\ [*200·361] & \supset .\overrightarrow{P}_{\text{po}}ʻx\cap (\iota ʻx\cup \overleftarrow{P}_{\text{po}}ʻx)=\Lambda .\overleftarrow{P}_{\text{po}}ʻx\cap (\overrightarrow{P}_{\text{po}}ʻx\cup \iota ʻx)=\Lambda .\\ [*91·54] &\supset .\overrightarrow{P}_{\text{po}}ʻx\cap \overleftarrow{P}_{*}ʻx=\Lambda .\overleftarrow{P}_{\text{po}}ʻx\cap \overrightarrow{P}_{*}ʻx=\Lambda :\supset \vdash .\text{Prop} \end{array}$

*200·39. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.x\in CʻP.\supset .\overrightarrow{P}_{*}ʻx\cap \overleftarrow{P}_{*}ʻx=\iota ʻx$

Dem. $\begin{array}{l} \vdash . *91·54. \supset \vdash :\text{Hp}.\supset .\overrightarrow{P}_{*}ʻx\cap \overleftarrow{P}_{*}ʻx&=(\overrightarrow{P}_{\text{po}}ʻx\cup \iota ʻx)\cap (\overleftarrow{P}_{\text{po}}ʻx\cup \iota ʻx)\\ [*22·69] & =(\overrightarrow{P}_{\text{po}}ʻx\cap \overleftarrow{P}_{\text{po}}ʻx)\cup \iota ʻx &\qquad \text{(1)}\\ \vdash .*91·56. & \supset \vdash :y\in \overrightarrow{P}_{\text{po}}ʻx\cap \overleftarrow{P}_{\text{po}}ʻx.\supset .yP_{\text{po}}y &\qquad \text{(2)}\\ \vdash .(2).\text{Transp}.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}_{\text{po}}ʻx\cap \overleftarrow{P}_{\text{po}}ʻx=\Lambda &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*200·391. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .\overrightarrow{P}_{*}^{;}P\,\,\text{smor}\,\,P.\overrightarrow{P}_{*}\upharpoonright CʻP\in (\overrightarrow{P}_{*}^{;}P)\,\overline{\,\text{smor}\,}\,P$

Dem. $\begin{array}{l} \vdash .*90·12.\supset \vdash :\text{Hp}.x,y\in CʻP.\overrightarrow{P}_[*]ʻx=\overrightarrow{P}_{*}ʻy.&\supset .xP_{*}y.yP_{*}x.\\ [*200·39] &\supset .x=y &\qquad \text{(1)}\\ \vdash .(1).*151·24.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with the ideas of relation-arithmetic. Analogous propositions will be proved for transitiveness and connection in *201 and *202, whence analogous propositions concerning series will be deduced in *204.

*200·4. $\vdash :P\unicode{x2909}Q\in \text{Rl}ʻJ.\equiv .P,Q\in \text{Rl}ʻJ.CʻP\cap CʻQ=\Lambda$

Dem. $\begin{array}{l} \vdash .*23·59.*160·1.\supset \\ \vdash :P\unicode{x2909}Q\in \text{Rl}ʻJ.&\equiv .P,Q\in \text{Rl}ʻJ.CʻP\uparrow CʻQ\,\unicode{x2abd}\, J.\\ [*200·32] &\equiv .P,Q\in \text{Rl}ʻJ.CʻP\cap CʻQ=\Lambda :\supset \vdash .\text{Prop} \end{array}$

This proposition is part of the proof that the sum of two mutually exclusive series is a series.

*200·41. $\vdash :P\unicode{x21f8} x\,\unicode{x2abd}\, J.\equiv .x\unicode{x21f7}P\,\unicode{x2abd}\, J.\equiv .P\,\unicode{x2abd}\, J.x{\sim}\in CʻP \quad[*23·59.*200·32]$

*200·42. $\vdash :\Sigma ʻP\,\unicode{x2abd}\, J.\equiv .CʻP\subset \text{Rl}ʻJ.F^{;}P\,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*23·59.*162·1.\supset \vdash :\Sigma ʻP\,\unicode{x2abd}\, J.&\equiv .\dot{s} ʻCʻP\,\unicode{x2abd}\, J.F^{;}P\,\unicode{x2abd}\, J.\\ [*61·52] &\equiv .CʻP\subset \text{Rl}ʻJ.F^{;}P\,\unicode{x2abd}\, J:\supset \vdash .\text{Prop} \end{array}$

*200·421. $\vdash :P\in \text{Rel}^{2}\text{excl}.P\,\unicode{x2abd}\, J.Q\in CʻP.\supset .Q=(\Sigma ʻP)\unicode{x0294f}CʻQ$

Dem. $\begin{array}{l} \vdash .*163·11.*162·13.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &x\{(\Sigma ʻP)\unicode{x0294f}CʻQ\}y.\equiv :\\ &(\exists R).R\in CʻP.x,y\in CʻQ.xRy.R=Q.\lor.\\ &(\exists R,S).RPS.x,y\in CʻQ.x\in CʻR.y\in CʻS.R=Q.S=Q:\\ [*13·195·22] &\equiv :xQy.\lor.QPQ.x,y\in CʻQ:\\ [*50·24.\text{Hp}] &\equiv :xQy\colon\colon\supset \vdash .\text{Prop} \end{array}$

*200·422. $\vdash :\Sigma ʻP\,\unicode{x2abd}\, J.\supset .P\unicode{x0294f}(-\iota ʻ\dot{\Lambda} )\,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*162·13.*50·24.\supset \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp QPR.\supset :x\in CʻQ.y\in CʻR.\supset .x\neq y:\\ [*24·37] & \supset :CʻQ\cap CʻR=\Lambda :\\ [*24·57] &\supset :\dot{\exists} !Q.\supset .CʻQ\neq CʻR.\\ [*30·37] &\supset .Q\neq R\colon\colon\supset \vdash .\text{Prop} \end{array}$

*200·423. $\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\Lambda {\sim}\in CʻP.\supset :\Sigma ʻP\,\unicode{x2abd}\, J.\equiv .P\,\unicode{x2abd}\, J.CʻP\subset \text{Rl}ʻJ$

Dem. $\begin{array}{l} \vdash .*200·422·42. &\supset \vdash :\text{Hp}.\Sigma ʻP\,\unicode{x2abd}\, J.\supset .P\,\unicode{x2abd}\, J.CʻP\subset \text{Rl}ʻJ &\qquad \text{(1)}\\ \vdash .*61·52. &\supset \vdash :CʻP\subset \text{Rl}ʻJ.\supset .\dot{s} ʻCʻP\,\unicode{x2abd}\, J &\qquad \text{(2)}\\ \vdash .*163·12.*200·21. &\supset \vdash :\text{Hp}.P\,\unicode{x2abd}\, J.\supset .F^{;}P\,\unicode{x2abd}\, J &\qquad \text{(3)}\\ \vdash .(2).(3).*162·1. &\supset \vdash :\text{Hp}.P\,\unicode{x2abd}\, J.CʻP\subset \text{Rl}ʻJ.\supset .\Sigma ʻP\,\unicode{x2abd}\, J &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*200·43. $\begin{align}\vdash :&P\,\unicode{x2abd}\, J.\supset .\Pi ʻP=\\ &\hat{M} \hat{N} \{M,N\in F_{\Delta }ʻCʻP:(\exists Q).(MʻQ)Q(NʻQ).M\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ\}\end{align}$

Dem. $\begin{array}{l} \vdash .*4·71.*172·1.\supset \vdash :\text{Hp}.\supset .\\ \Pi ʻP=\hat{M} \hat{N} \{M,N\in F_{\Delta }ʻCʻP\colon\ldotp (\exists Q):(MʻQ)Q(NʻQ):RPQ.\supset _{R}.MʻR=NʻR\}\\ [*35·71.*71·35] =\hat{M} \hat{N} \{M,N\in F_{\Delta }ʻCʻP:(\exists Q).(MʻQ)Q(NʻQ).M\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ\}.\supset \vdash .\text{Prop} \end{array}$

The following propositions, with the exception of *200·52, are concerned with $pʻ\overrightarrow{P}ʻʻ\alpha$ and $pʻ\overleftarrow{P}ʻʻ\alpha$ , i.e. the class of terms preceding (or succeeding) the whole of $\alpha$ .

*200·5. $\vdash :P\,\unicode{x2abd}\, J.\supset .\alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha =\Lambda .\alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha =\Lambda$

Dem. $\begin{array}{l} \vdash .*40·51.\supset \vdash \colon\ldotp x\in \alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha .&\supset :x\in \alpha :y\in \alpha .\supset _{y}.xPy:\\ [*10·26] &\supset :xPx:\\ [*50·24] &\supset :{\sim}(P\,\unicode{x2abd}\, J) &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash :\text{Hp}.\supset .\alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha =\Lambda &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha =\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*200·51. $\vdash :P\,\unicode{x2abd}\, J.\dot{\exists} !P.\supset .pʻ\overrightarrow{P}ʻʻCʻP=\Lambda .pʻ\overleftarrow{P}ʻʻCʻP=\Lambda$

Dem. $\begin{array}{l} \vdash .*40·62.\supset \vdash :\text{Hp}.&\supset .pʻ\overrightarrow{P}ʻʻCʻP\subset CʻP.\\ [*22·621] \supset .pʻ\overrightarrow{P}ʻʻCʻP&=CʻP\cap pʻ\overrightarrow{P}ʻʻCʻP\\ [*200·5] & =\Lambda &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻCʻP=\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*200·52. $\vdash :P\,\unicode{x2abd}\, J.\supset .CʻP{\sim}\in \overrightarrow{P}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*50·24.\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in CʻP.&\supset _{x}.x{\sim}\in \overrightarrow{P}ʻx.\\ [*13·14] &\supset _{x}.CʻP\neq \overrightarrow{P}ʻx:\\ [*37·7.\text{Transp}] &\supset :CʻP{\sim}\in \overrightarrow{P}ʻʻCʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*200·53. $\vdash :P^{2}\,\unicode{x2abd}\, J.\supset .Pʻʻ\alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha =\Lambda .\breve{P} ʻʻ\alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha =\Lambda$

Dem. $\begin{array}{l} \vdash .*37·1.*40·53.\supset \vdash \colon\ldotp x\in Pʻʻ\alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha .&\supset :(\exists y).y\in \alpha .xPy:y\in \alpha .\supset _{y}.yPx:\\ [*10·56] &\supset :(\exists y).xPy.yPx:\\ [*34·5] &\supset :xP^{2}x:\\ [*50·24] &\supset :{\sim}(P^{2}\,\unicode{x2abd}\, J) &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash :\text{Hp}.\supset .(x).x{\sim}\in Pʻʻ\alpha \cap pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .(x).x{\sim}\in \breve{P} ʻʻ\alpha \cap pʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

The above proposition is frequently used. If $\alpha$ is an existent class contained in $CʻP$ , $Pʻʻ\alpha$ and $pʻ\overleftarrow{P}ʻʻ\alpha$ are the two parts of the Dedekind "cut" determined by $\alpha$ (excluding the maximum of $\alpha$ , if any). The above proposition shows that these two parts are mutually exclusive.

*200·54. $\vdash :P\,\unicode{x2abd}\, J.\dot{\exists} !P.\supset .pʻ\overrightarrow{P}ʻʻ{CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha }=pʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*40·62. &\supset \vdash :\exists !\alpha.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha =pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*40·2. \supset \vdash :\alpha=\Lambda .&\supset .pʻ\overleftarrow{P}ʻʻ\alpha=\text{V}. &\qquad \text{(2)}\\ [*40·16] &\supset .pʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ\alpha \subset pʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(3)}\\ \vdash .(3).*200·51.&\supset \vdash :\text{Hp}.\alpha =\Lambda .\supset .pʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ\alpha =\Lambda &\qquad \text{(4)}\\ \vdash .(2).*24·26. &\supset \vdash :\alpha =\Lambda .\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha =CʻP &\qquad \text{(5)}\\ \vdash .(5).*200·51.&\supset \vdash :\text{Hp}.\alpha =\Lambda .\supset .pʻ\overrightarrow{P}ʻʻ(CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha )=\Lambda &\qquad \text{(6)}\\ \vdash .(1).(4).(6).&\supset \vdash .\text{Prop} \end{array}$

This proposition is a lemma whose purpose is to avoid the necessity of introducing the hypothesis $\exists !\alpha$ or in proofs in which it is not really necessary. The first use of this proposition occurs in *206·551.

There are two main varieties of transitive relations, namely those that are symmetrical $(P=\breve{P})$ , and those that are asymmetrical $(P\dot{\cap} \breve{P} =\dot{\Lambda})$ . Transitive symmetrical relations have the formal properties of equality: examples of such relations have occurred above, e.g. identity, similarity, and likeness. The propositions of the present number, however, are rather such as will be useful in connection with transitive asymmetrical relations, since they are intended to be applied to series.

We denote the class of transitive relations by " $\text{trans}$ "; thus $\text{trans}=\hat{P} (P^{2}\,\unicode{x2abd}\, P) \quad\text{Df}.$ Many propositions of this number are analogous to propositions whose numbers have the same decimal part in *200. Such are: If $P$ is transitive, so is its converse (*201·11), and so is any relation which is like P (*201·211); $\dot{\Lambda}$ and $x\downarrow y$ are transitive (*201·3 ·31); if $P$ is transitive, so is $P\unicode{x0294f}\alpha$ (*201·33). The propositions *201·4—·42, which deal with the ideas of relation-arithmetic, are also analogous to *200·4—·42.

Most of the other propositions of this number, however, have no analogues in *200. Among the most important of these are the following :

*201·14. $\vdash :P\in \text{trans}.xPy.\supset .\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻy$

*201·18. $\vdash :P^{2}\,\unicode{x2abd}\, P.\supset .P_{\text{po}}=P.P_{*}=P\unicode{x228d} I\upharpoonright CʻP$

This proposition is very important, since it effects an immense simplification in the use of all propositions involving $P_{\text{po}}$ or $P_{*}$ , when these propositions are to be applied to transitive relations. Owing to the above proposition, $P_{\text{po}}$ drops out where transitive relations are concerned. $P_{*}$ , on the other hand, remains useful: If $y\in CʻP$ , " $xP_{*}y$ " will mean " $x$ precedes or is $y$ ," which, if $P$ generates a series of which $x$ and $y$ are members, is equivalent to " $x$ does not follow $y$ ."

We have a series of propositions (*201·5—·56) on $Pʻʻ\alpha$ and $pʻ\overrightarrow{P}ʻʻ\alpha$ . The chief of these are

*201·5. $\vdash :P\in \text{trans}.\supset .PʻʻPʻʻ\alpha \subset Pʻʻ\alpha$

*201·501. $\vdash :P\in \text{trans}.\supset .Pʻʻ\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻx$

These two propositions express the fact that a predecessor of a predecessor is a predecessor.

*201·52. $\vdash :P\in \text{trans}.\supset .P_{*}ʻʻ\alpha =Pʻʻ\alpha \cup (\alpha \cap CʻP)$

Thus if $\alpha \subset CʻP,P_{*}ʻʻ\alpha$ consists of $\alpha$ together with the predecessors of its members.

*201·521. $\vdash :P\in \text{trans}.x\in CʻP.\supset .\overrightarrow{P}_{*}ʻx=\overrightarrow{P}ʻx\cup {℩}ʻx$

*201·55. $\vdash :P\in \text{trans}.\supset .Pʻʻ(\alpha \cup Pʻʻ\alpha )=Pʻʻ\alpha$

We have next a set of important propositions on $P\dot{-} P^{2}$ and $P_{1}$ . The chief are

*201·63. $\vdash :P\in \text{trans}\cap \text{Rl}ʻJ.\supset .P_{1}=P\dot{-} P^{2}$

*201·65. $\vdash \colon\ldotp P\in \text{trans}\cap \text{Rl}ʻJ.\supset :P_{1}=\dot{\Lambda} .\equiv .P^{2}=P$

*201·1. $\vdash :P\in \text{trans}.\equiv .P^{2}\,\unicode{x2abd}\, P \quad[(*201·01)]$

Dem. $\begin{array}{l} \vdash .*201·1.*31·4.\supset \vdash :P\in \text{trans}.&\equiv .\text{Cnv}ʻP^2\,\unicode{x2abd}\, \breve{P} .\\ [*34·63.*201·1] &\equiv .\breve{P} \in \text{trans}:\supset \vdash .\text{Prop} \end{array}$

*201·12. $\vdash \colon\ldotp P\in \text{trans}.\supset :P\,\unicode{x2abd}\, J.\equiv .P^{2}\,\unicode{x2abd}\, J.\equiv .P\dot{\cap} \breve{P} =\dot{\Lambda} \quad[*50·47]$

In virtue of this proposition, being contained in diversity is equivalent (where transitive relations are concerned) to asymmetry. This is not in general the case with relations which are not transitive; thus e.g. diversity itself is contained in diversity, but is symmetrical.

Dem. $\begin{array}{l} \vdash .*34·34.\supset \vdash :R\,\unicode{x2abd}\, I.&\supset .R^{2}\,\unicode{x2abd}\, R\mid I.\\ [*50·4] &\supset .R^{2}\,\unicode{x2abd}\, R:\supset \vdash .\text{Prop} \end{array}$

*201·14. $\vdash :P\in \text{trans}.xPy.\supset .\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻy$

Dem. $\begin{array}{l} \vdash .*201·1.\supset \vdash :\text{Hp}.zPx.\supset .zPy &\qquad \text{(1)}\\ \vdash .(1).*32·18.\supset \vdash .\text{Prop} \end{array}$

The following propositions (*201·15—·19) are concerned with $R_{*}$ and $R_{\text{po}}$ .

This proposition is important, since it often happens that a series is given as defined by a one-one relation $R$ , as in *122 for example, and in such cases $R_{\text{po}}$ is a serial relation in our present sense. By the above proposition, $R_{\text{po}}$ is always transitive; by *96·421, $R_{\text{po}}$ is connected when confined to the posterity of a given term, provided $R\in \text{Cls}\rightarrow 1$ ; by *96·23, if $R\in 1\rightarrow \text{Cls}$ and $xBR$ , $R_{\text{po}}$ is contained in diversity throughout the posterity of $x$ . Thus if $R$ is a one-one, $R_{\text{po}}$ confined to any family which has a beginning will be a serial relation.

*201·17. $\vdash :P^{2}\,\unicode{x2abd}\, P.Q\in \text{Pot}ʻP.\supset .Q\,\unicode{x2abd}\, P$

Dem. $\begin{array}{l} \vdash .*34·34.\supset \vdash \colon\ldotp \text{Hp}.\supset :S\,\unicode{x2abd}\, P.\supset _{S}.S\mid P\,\unicode{x2abd}\, P &\qquad \text{(1)}\\ \vdash .*91·171 \frac{S\,\unicode{x2abd}\, P}{\phi S}. \supset \\ \vdash \colon\ldotp Q\in \text{Pot}ʻP:S\,\unicode{x2abd}\, P.\supset _{S}.S\mid P\,\unicode{x2abd}\, P:P\,\unicode{x2abd}\, P:\supset .Q\,\unicode{x2abd}\, P &\qquad \text{(2)}\\ \vdash .(1).(2).*23·42.\supset \vdash .\text{Prop} \end{array}$

*201·18. $\vdash :P^{2}\,\unicode{x2abd}\, P.\supset .P_{\text{po}}=P.P_{*}=P\unicode{x228d} I\upharpoonright CʻP$

Dem. $\begin{array}{l} \vdash .*201·17.*41·151.(*91·05).\supset \vdash :\text{Hp}.&\supset .P_{\text{po}}\,\unicode{x2abd}\, P &\qquad \text{(1)}\\ \vdash .(1).*91·502. & \supset \vdash :\text{Hp}.\supset .P_{\text{po}}=P &\qquad \text{(2)}\\ \vdash .(2).*91·54.\supset \vdash .\text{Prop} \end{array}$

This proposition is important, since it simplifies all propositions concerning $P_{\text{po}}$ and $P_{*}$ in case $P$ is transitive. The following proposition is an instance of this simplification.

*201·19. $\vdash :P\in \text{trans}.\supset .P(x-y)=\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy \quad[*201·18.(*121·01)]$

The following propositions (*201·2—·22) are concerned in proving that transitiveness is unaffected by likeness-transformations, and therefore belongs to every member of a relation-number or to none.

*201·2. $\vdash :S\in \text{Cls}\rightarrow 1.\text{ᗡ}ʻQ\subset \text{ᗡ}ʻS.\supset .(S^{;}Q)^{2}=S^{;}Q^{2}$

Dem. $\begin{array}{l} \vdash .150·1. &\supset \vdash .(S^{;}Q)^{2}=S\mid Q\mid \breve{S} \mid S\mid Q\mid \breve{S} &\qquad \text{(1)}\\ \vdash .*72·601.&\supset \vdash :\text{Hp}.\supset .Q\mid \breve{S} \mid S=Q &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{Hp}.\supset .(S^{;}Q)^{2}=S\mid Q^{2}\mid \breve{S} :\supset \vdash .\text{Prop} \end{array}$

*201·201. $\begin{align}&\vdash :S\in \text{Cls}\rightarrow 1.\text{D}ʻQ\subset \text{ᗡ}ʻS.\supset .(S^{;}Q)^{2}=S^{;}Q^{2}\\ &[\text{Proof as in *201·2}]\end{align}$

*201·21. $\vdash :S\in \text{Cls}\rightarrow 1.Q\in \text{trans}.\supset .S^{;}Q\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*150·36.*35·452.&\supset \vdash .S^{;}Q=S^{;}Q\unicode{x0294f}\text{ᗡ}ʻS &\qquad \text{(1)}\\ \vdash .(1).*201·2. \supset \vdash :\text{Hp}.&\supset .(S^{;}Q)^{2}=S^{;}(Q\unicode{x0294f}\text{ᗡ}ʻS)^{2}.\\ [*150·31.*201·1] &\supset .(S^{;}Q)^{2}\,\unicode{x2abd}\, S^{;}Q:\supset \vdash .\text{Prop} \end{array}$

*201·211. $\vdash :P\in \text{trans}.Q\,\,\text{smor}\,\,P.\supset .Q\in \text{trans} \quad[*201·21.*151·1]$

This shows that transitiveness is a property which is unchanged by likeness-transformations. Hence

*201·212. $\vdash :P\in \text{trans}.\supset .\text{Nr}ʻP\subset \text{trans} \quad[*201·211]$

*201·22. $\begin{align}&\vdash :P\in \text{trans}.\equiv .\text{N}_{0}\text{r}ʻP\subset \text{trans}.\equiv .\exists !\text{N}_{0}\text{r}ʻP\cap \text{trans}\\ &[\text{Proof as in *200*22}]\end{align}$

Dem. $\begin{array}{l} \vdash .*34·32. &\supset \vdash .\dot{\Lambda} ^{2}=\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .(1).*23·42. &\supset \vdash .\dot{\Lambda} ^{2}\,\unicode{x2abd}\, \dot{\Lambda} .\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*55·13.\supset \vdash :z(x\downarrow y)^{2} w.&\equiv .(\exists u).z=x.u=y.u=x.w=y.\\ [*10·35] &\supset .z=x.w=y.\\ [*55·13] &\supset .z(x\downarrow y)w:\supset \vdash .\text{Prop} \end{array}$

Unless $x=y$ , $(x\downarrow y)^{2}=\dot{\Lambda}$ . A relation whose square is $\dot{\Lambda}$ is transitive, because $\dot{\Lambda}$ is contained in every relation.

Dem. $\begin{array}{l} \vdash .*35·103.\supset \vdash :x(\alpha \uparrow \beta )^{2}z.&\equiv .(\exists y).x\in \alpha .y\in \beta .y\in \alpha .z\in \beta .\\ [*10·35] &\supset .x\in \alpha .z\in \beta .\\ [*35·103] &\supset .x(\alpha \uparrow \beta )z:\supset \vdash .\text{Prop} \end{array}$

*201·33. $\vdash :P\in \text{trans}.\supset .P\unicode{x0294f}\alpha \in \text{trans}$

Dem. $\begin{array}{l} \vdash .*36·13.&\supset \vdash :x(P\unicode{x0294f}\alpha )^{2}z.\equiv .(\exists y).x,y,z\in \alpha .xPy.yPz &\qquad \text{(1)}\\ \vdash .(1). \supset \vdash \colon\ldotp \text{Hp}.\supset :x(P\unicode{x0294f}\alpha )^{2}z.&\supset .(\exists y).x,y,z\in \alpha .xPz.\\ [*10·35.*36·13]& \supset .x(P\unicode{x0294f}\alpha )z\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The following propositions (*201·4—·42) are concerned with the ideas of relation-arithmetic.

*201·4. $\vdash :P,Q\in \text{trans}.CʻP\cap CʻQ=\Lambda .\supset .P\unicode{x2909}Q\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*160·51. &\supset \vdash :\text{Hp}.\supset .(P\unicode{x2909}Q)^{2}=P^{2}\unicode{x228d} Q^{2}\unicode{x228d} \text{D}ʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow \text{ᗡ}ʻQ &\qquad \text{(1)}\\ \vdash .*201·1. &\supset \vdash :\text{Hp}.\supset .P^{2}\,\unicode{x2abd}\, P.Q^{2}\,\unicode{x2abd}\, Q &\qquad \text{(2)}\\ \vdash .*35·432·82. &\supset \vdash .\text{D}ʻP\uparrow CʻQ\,\unicode{x2abd}\, CʻP\uparrow CʻQ.CʻP\uparrow \text{ᗡ}ʻQ\,\unicode{x2abd}\, CʻP\uparrow CʻQ &\qquad \text{(3)}\\ \vdash .(1).(2).(3).&\supset \vdash :\text{Hp}.\supset .(P\unicode{x2909}Q)^{2}\,\unicode{x2abd}\, P\unicode{x228d} Q\unicode{x228d} CʻP\uparrow CʻQ:\supset \vdash .\text{Prop} \end{array}$

*201·401. $\vdash \colon\ldotp CʻP\cap CʻQ=\Lambda .\supset :P\unicode{x2909}Q\in \text{trans}.\equiv .P,Q\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*160·51.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :P\unicode{x2909}Q\in \text{trans}.&\equiv .P^{2}\unicode{x228d} Q^{2}\unicode{x228d} \text{D}ʻP\uparrow CʻQ\unicode{x228d} CʻP\uparrow \text{ᗡ}ʻQ\,\unicode{x2abd}\, P\unicode{x2909}Q.\\ [*160·1] &\equiv .P^{2}\unicode{x228d} Q^{2}\,\unicode{x2abd}\, P\unicode{x2909}Q.\\ [*160·5] &\supset .(P^{2}\unicode{x228d} Q^{2})\unicode{x0294f}CʻP\,\unicode{x2abd}\, P.(P^{2}\unicode{x228d} Q^{2})\unicode{x0294f}CʻQ\,\unicode{x2abd}\, Q.\\ [*36·4.*34·56] &\supset .P^{2}\,\unicode{x2abd}\, P.Q^{2}\,\unicode{x2abd}\, Q &\qquad \text{(1)}\\ \vdash .(1).*201·4.\supset \vdash .\text{Prop} \end{array}$

*201·41. $\vdash :.x{\sim}\in CʻP.\supset :P\in \text{trans}.\equiv .P\unicode{x21f8} x\in \text{trans}.\equiv .x\unicode{x21f7}P\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*34·301.\supset \vdash :\text{Hp}.&\supset .(CʻP\uparrow {℩}ʻx)\mid P=\dot{\Lambda} .\\ [*161·1] \supset .(P\unicode{x21f8} x)^{2}&=P^{2}\unicode{x228d} (CʻP\uparrow {℩}ʻx)^{2}\unicode{x228d} P\mid (CʻP\uparrow {℩}ʻx)\\ [*35·881] & =P^{2}\unicode{x228d} (CʻP\uparrow {℩}ʻx)^{2}\unicode{x228d} (\text{D}ʻP\uparrow {℩}ʻx)\\ [*35·895] & =P^{2}\unicode{x228d} (\text{D}ʻP\uparrow {℩}ʻx) &\qquad \text{(1)}\\ \vdash .(1).*201·1.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :(P\unicode{x21f8} x)\in \text{trans}.&\equiv .P^{2}\unicode{x228d} (\text{D}ʻP\uparrow {℩}ʻx)\,\unicode{x2abd}\, P\unicode{x228d} (CʻP\uparrow {℩}ʻx).\\ [*35·432·82] & \equiv .P^{2}\,\unicode{x2abd}\, P\unicode{x228d} (CʻP\uparrow {℩}ʻx) &\qquad \text{(2)}\\ \vdash .*33·33.*34·56.*35·86.&\supset \vdash :\text{Hp}.\supset .P^{2}\dot{\cap} (CʻP\uparrow {℩}ʻx)=\dot{\Lambda} &\qquad \text{(3)}\\ \vdash .(2).(3)*25·49.\supset \vdash \colon\ldotp \text{Hp}.\supset :P\unicode{x21f8} x\in \text{trans}.&\equiv .P^{2}\,\unicode{x2abd}\, P.\\ [*201·1] &\equiv .P\in \text{trans} &\qquad \text{(4)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp}.\supset :x\unicode{x21f7}P\in \text{trans}.&\equiv .P\in \text{trans} &\qquad \text{(5)}\\ \vdash .(4).(5).\supset \vdash .\text{Prop} \end{array}$

*201·411. $\vdash :z\neq x.z\neq y.\supset .x\downarrow y\unicode{x21f8} z\in \text{trans} \quad[*201·41·31]$

*201·42. $\vdash :P\in \text{trans}\cap \text{Rel}^{2}\text{excl}.CʻP\subset \text{trans}.\supset .\Sigma ʻP\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*162·1.\supset \\ \vdash .(\Sigma ʻP)^{2}&=(\dot{s} ʻCʻP)^{2}\unicode{x228d} (F^{;}P)^{2}\unicode{x228d} (\dot{s} ʻCʻP)\mid (F^{;}P)\unicode{x228d} (F^{;}P)\mid (\dot{s} ʻCʻP) &\qquad \text{(1)}\\ \vdash .*41·11.\supset \vdash :x(\dot{s} ʻCʻP)^{2}z.&\equiv .(\exists Q,R,y).Q,R\in CʻP.xQy.yRz.\\ [*33·17] &\equiv .(\exists Q,R,y).Q,R\in CʻP.xQy.yRz.\exists !CʻQ\cap CʻR &\qquad \text{(2)}\\ \vdash .(2).*163·11.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :x(\dot{s} ʻCʻP)^{2}z.\supset .(\exists Q,R,y).Q,R\in CʻP.xQy.yRz.Q=R.\\ [*13·195] &\supset .(\exists Q).Q\in CʻP.xQ^{2}z.\\ [*201·1.\text{Hp}] &\supset .(\exists Q).Q\in CʻP.xQz.\\ [*41·11] &\supset .x(\dot{s} ʻCʻP)z &\qquad \text{(3)}\\ \vdash .*201·21.*163·12.\supset \vdash :\text{Hp}.&\supset .(F^{;}P)^{2}\,\unicode{x2abd}\, F^{;}P &\qquad \text{(4)}\\ \vdash .*34·1.*41·11.*150·52.\supset\\ \vdash :x(\dot{s} ʻCʻP)\mid (F^{;}P)z.&\supset .(\exists Q,R,S,y).Q\in CʻP.xQy.RPS.y\in CʻR.z\in CʻS &\qquad \text{(5)}\\ \vdash .(5).*163·11.*13·195.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :x(\dot{s} ʻCʻP)\mid (F^{;}P)z.\supset .(\exists Q,S,y).Q\in CʻP.xQy.QPS.z\in CʻS.\\ [*33·17.*150·52] & \supset .x(F^{;}P)z &\qquad \text{(6)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp}.&\supset :x(F^{;}P)\mid (\dot{s} ʻCʻP)z.\supset .x(F^{;}P)z &\qquad \text{(7)}\\ \vdash .(1).(3).(4).(6).(7).\supset \\ \vdash :\text{Hp}.&\supset .(\Sigma ʻP)^{2}\,\unicode{x2abd}\, \dot{s} ʻCʻP\unicode{x228d} F^{;}P:\supset \vdash .\text{Prop} \end{array}$

The following propositions (*201·5—·56) are concerned with $Pʻʻ\alpha$ and $pʻ\overrightarrow{P}ʻʻ\alpha$ , i.e. with the predecessors of some part of a class and the predecessors of the whole of a class.

*201·5. $\vdash :P\in \text{trans}.\supset .PʻʻPʻʻ\alpha \subset Pʻʻ\alpha \quad[*37·33·201]$

*201·501. $\vdash :P\in \text{trans}.\supset .Pʻʻ\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻx \quad[*53·301.*201·5]$

*201·51. $\vdash :P\in \text{trans}.\supset .Pʻʻpʻ\overrightarrow{P}ʻʻ\alpha \subset pʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*37·1.*40·51.\supset \vdash \colon\ldotp x\in Pʻʻpʻ\overrightarrow{P}ʻʻ\alpha . &\equiv :(\exists y):z\in \alpha .\supset _{z}.yPz:xPy:\\ [*5·31] &\supset :z\in \alpha .\supset _{z}.xP^{2}z &\qquad \text{(1)}\\ \vdash .(1).*201·1. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in Pʻʻpʻ\overrightarrow{P}ʻʻ\alpha .\supset :z\in \alpha .\supset _{z}.xPz:\\ [*40·51] & \supset :x\in pʻ\overrightarrow{P}ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*201·52. $\vdash :P\in \text{trans}.\supset .P_{*}ʻʻ\alpha = Pʻʻ\alpha \cup (\alpha \cap CʻP) \quad[*91·543.*201·18]$

*201·521. $\vdash :P\in \text{trans}.x\in CʻP.\supset .\overrightarrow{P}_{*}ʻx = \overrightarrow{P}ʻx\cup \iota ʻx \quad[*201·52.*53·301]$

*201·53. $\vdash :P\in \text{trans}.\supset .P_{*}ʻʻPʻʻ\alpha = Pʻʻ\alpha \quad[*201·5·52.*37·265]$

*201·54. $\vdash :P\in \text{trans}.\supset .P_{*}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha \subset pʻ\overrightarrow{P}ʻʻ\alpha \quad[*201·51·52]$

*201·55. $\vdash :P\in \text{trans}.\supset .Pʻʻ(\alpha \cup Pʻʻ\alpha ) = Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*201·5.\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha &= Pʻʻ\alpha \cup PʻʻPʻʻ\alpha \\ [*37·22] &= Pʻʻ(\alpha \cup Pʻʻ\alpha ):\supset \vdash .\text{Prop} \end{array}$

*201·56. $\begin{align}&\vdash :P\in \text{trans}.\beta \subset Pʻʻ\alpha .\supset .\\ &Pʻʻ(\alpha \cup \beta ) = Pʻʻ\alpha .pʻ\overleftarrow{P}ʻʻ{\alpha \cup \beta )\cap CʻP} = pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*37·22. &\supset \vdash .Pʻʻ(\alpha \cup \beta ) = Pʻʻ\alpha \cup Pʻʻ\beta &\qquad \text{(1)}\\ \vdash .*37·2. \supset \vdash :\text{Hp}.&\supset .Pʻʻ\beta \subset PʻʻPʻʻ\alpha .\\ [*201·5] &\supset .Pʻʻ\beta \subset Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.&\supset .Pʻʻ(\alpha \cup \beta ) = Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*40·51.*37·265.\supset \\ \vdash \colon\colon\text{Hp}.&\supset :z\in pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).x\in \beta \cap CʻP.\supset :\\ &y\in \alpha \cap CʻP.\supset _{y}.yPz:(\exists y).y\in \alpha \cap CʻP.xPy:\\ [*10·56] &\supset :(\exists y).xPy.yPz:\\ [*34·5.\text{Hp}] &\supset :xPz &\qquad \text{(4)}\\ \vdash .(4).*40·51.\supset \vdash :\text{Hp}.&\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset pʻ\overleftarrow{P}ʻʻ(\beta \cap CʻP).\\ [*22·621] \supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻʻP)&=pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap pʻ\overleftarrow{P}ʻʻ(\beta \cap CʻP)\\ [*40·18.*37·22] & =pʻ\overleftarrow{P}ʻʻ\{(\alpha \cup \beta )\cap CʻP\} &\qquad \text{(5)}\\ \vdash .(3).(5).\supset \vdash .\text{Prop} \end{array}$

The following propositions, to the end of the number, are concerned with the relation $P_{1}$ defined in *121. We may regard $P_{1}$ as meaning "immediately precedes." *201·6 ·61 ·62 are lemmas for *201·63.

*201·6. $\vdash :P\in \text{trans}.{\sim}(xPx).{\sim}(yPy).xP_{1}y.\supset .x(P\dot{-} P^{2})y$

Dem. $\begin{array}{l} \vdash .*121·32·242.\supset \vdash :\text{Hp}.\supset .P(x\vdash\dashv y)&=\iota ʻx\cup \iota ʻy\cup P(x-y)\\ [*201·19] &=\iota ʻx\cup \iota ʻy\cup \overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy &\qquad \text{(1)}\\ \vdash .*121·321.*201·18. & \supset :\text{Hp}.\supset .xPy &\qquad \text{(2)}\\ \vdash .(2).*13·14.& \supset :\text{Hp}.\supset .x\neq y &\qquad \text{(3)}\\ \vdash .(1).(3).*54·53.*121·11. &\supset \vdash :\text{Hp}.\supset .\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy\subset \iota ʻx\cup \iota ʻy &\qquad \text{(4)}\\ \vdash .*32·18·181. &\supset \vdash :\text{Hp}.\supset .x{\sim}\in \overleftarrow{P}ʻx.y{\sim}\in \overrightarrow{P}ʻy &\qquad \text{(5)}\\ \vdash .(4).(5). \supset \vdash :\text{Hp}.&\supset .\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy=\Lambda .\\ [*34·11] &\supset .{\sim}(xP^{2}y) &\qquad \text{(6)}\\ \vdash .(2).(6).\supset \vdash .\text{Prop} \end{array}$

*201·61. $\vdash :P\in \text{trans}.\supset .P\dot{-} P^{2}\,\unicode{x2abd}\, P_{1}$

Dem. $\begin{array}{l} \vdash .*121·242.*90·151. &\supset \vdash :xPy.\supset .P(x\vdash\dashv y)=\iota ʻx\cup \iota ʻy\cup P(x-y) &\qquad \text{(1)}\\ \vdash .(1).*201·19. &\supset \vdash \colon\ldotp \text{Hp}.\supset :xPy.\supset .P(x\vdash\dashv y)=\iota ʻx\cup \iota ʻy\cup (\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy) &\qquad \text{(2)}\\ \vdash .*34·11. &\supset \vdash :{\sim}(xP^{2}y).\supset .\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy=\Lambda &\qquad \text{(3)}\\ \vdash .*34·54. &\supset \vdash :xPy.{\sim}(xP^{2}y).\supset .x\neq y &\qquad \text{(4)}\\ \vdash .(2).(3).(4). \supset \vdash \colon\ldotp \text{Hp}.&\supset :xPy.{\sim}(xP^{2}y).\supset .P(x\vdash\dashv y)=\iota ʻx\cup \iota ʻy.x\neq y.\\ [*54·101] &\supset .P(x\vdash\dashv y)\in 2.\\ [*121·11] &\supset .xP_{1}y\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*201·26. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}.{\sim}(xPx).{\sim}(yPy).\supset :xP_{1}y.\equiv .x(P\dot{-} P^{2})y\\ &[*201·6·61]\end{align}$

*201·63. $\vdash :P\in \text{trans}\cap \text{Rl}ʻJ.\supset .P_{1}=P\dot{-} P^{2} \quad[*201·62]$

The above proposition is of fundamental importance. The relation $P_{1}$ (defined in *121) plays a great part in the theory of series. It is the relation[Pg 532] "immediately preceding." Its domain consists of those terms which have immediate successors; its converse domain, of those that have immediate predecessors. In well-ordered series, $\text{D}ʻP_{1}=\text{D}ʻP$ , while $\text{ᗡ}ʻP_{1}$ consists of all terms (except the first) which do not belong to the first derivative (cf. *216). In any series, $\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1}$ consists of all the terms which are limits of ascending series, and $\text{D}ʻP-\text{D}ʻP_{1}$ . consists of all the terms which are limits of descending series.

*201·64. $\vdash \colon\ldotp P\in \text{trans}.\supset :P\dot{-} P^{2}=\dot{\Lambda} .\equiv .P^{2}=P$

Dem. $\begin{array}{l} \vdash .*23·41.\supset \vdash \colon\ldotp \text{Hp}.\supset :P^{2}=P.&\equiv .P\,\unicode{x2abd}\, P^{2}.\\ [*25·3] &\equiv .P\dot{-} P^{2}=\dot{\Lambda} \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*201·65. $\vdash \colon\ldotp P\in \text{trans}\cap \text{Rl}ʻJ.\supset :P_{1}=\dot{\Lambda} .\equiv .P^{2}=P \quad [*201·64·63]$

When $P$ is a series, $P^{2}=P$ is the condition for its being a compact series, i.e. one in which there are terms between any two. In virtue of *201·65, this condition is equivalent to $P_{1}=\dot{\Lambda}$ , which states that no term has an immediate predecessor.

*201·66. $\vdash :P\in \text{trans}.\text{E}!Pʻx.Pʻx\neq x.\supset .(Pʻx)P_{1}x$

Dem. $\begin{array}{l} \vdash .*201·521.*121·11.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :(Pʻx)P_{1}x.\equiv .({℩}ʻPʻx\cup \overleftarrow{P}ʻPʻx)\cap ({℩}ʻx\cup \overrightarrow{P}ʻx)\in 2 &\qquad \text{(1)}\\ \vdash .*53·31.\supset \vdash :\text{Hp}.\supset .\\ ({℩}ʻPʻx\cup \overleftarrow{P}ʻPʻx)\cap ({℩}ʻx\cup \overrightarrow{P}ʻx)&=({℩}ʻPʻx\cup \overleftarrow{P}ʻPʻx)\cap ({℩}ʻx\cup {℩}ʻPʻx)\\ [*30·32.*22·68] & ={℩}ʻx\cup {℩}ʻPʻx &\qquad \text{(2)}\\ \vdash .*54·26.&\supset \vdash :\text{Hp}.\supset .({℩}ʻx\cup {℩}ʻPʻx)\in 2 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*201·661. $\vdash :P\in \text{trans}.\text{ᗡ}ʻP\in 1.\exists !\text{D}ʻP-\text{ᗡ}ʻP.\supset .\text{ᗡ}ʻP\subset \text{ᗡ}ʻP_{1}$

Dem. $\begin{array}{l} \vdash .*33·151·4.*60·38.\supset \\ \vdash :\text{Hp}.y\in \text{D}ʻP-\text{ᗡ}ʻP.&\supset .\overleftarrow{P}ʻy\in 1.y{\sim}\in \overleftarrow{P}ʻy.\overleftarrow{P}ʻy=\text{ᗡ}ʻP.\\ [*53·3] &\supset .\text{E}!\breve{P} ʻy.y\neq \breve{P} ʻy.{℩}ʻ\breve{P} ʻy=\text{ᗡ}ʻP.\\ [*201·66·11.*121·26] &\supset .yP_{1}(\breve{P} ʻy).{℩}ʻ\breve{P} ʻy=\text{ᗡ}ʻP:\supset \vdash .\text{Prop} \end{array}$

*201·662. $\begin{align}&\vdash :P\in \text{trans}.\exists !\overrightarrow{B}ʻP.\exists !\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1}.\supset .\text{ᗡ}ʻP{\sim}\in 1\\ &[*201·661.\text{Transp}]\end{align}$

A relation is said to be connected when either it or its converse holds between any two different members of its field, i.e. when, if $x$ , $y \in CʻP . x \neq y$ , we have $xPy. \lor . yPx$ . Thus the field of a connected relation consists of a single family, unless the relation is null, in which case it has no families. Conversely, a relation which has one family or none is connected. Connection is necessary, in addition to transitiveness and asymmetry, in order that a relation may generate a single series. If $\lambda$ is a class of transitive or asymmetrical relations, $\dot{s} ʻ\lambda$ is transitive or asymmetrical; but if $\lambda$ is a class of connected relations, $\dot{s} ʻ\lambda$ is not in general connected. Hence if $\lambda$ is a class of series, $\dot{s}ʻ\lambda$ is not one series, but many detached series. This is one reason why the arithmetical sum of a relation of relations is not defined as $\dot{s} ʻCʻP$ , but as $\dot{s} ʻCʻP \unicode{x228d}F^{;}P$ (cf. *162), because the latter, but not in general the former, is connected when $P$ and all the members of $CʻP$ are connected (*202·42).

When $P$ is connected, if $\alpha$ is any class contained in $CʻP$ , we have $CʻP = Pʻʻ\alpha \cup \alpha \cup (CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha ),$ and there is at most one member of $\alpha$ belonging neither to $Pʻʻ\alpha$ nor to $CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha$ . This member of $\alpha$ , if it exists, is the maximum of $\alpha$ . If, further, $P^{2} \,\unicode{x2abd}\, J$ (i.e. if $P$ is asymmetrical), $(Pʻʻ\alpha \cup \alpha ) \cap (CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha) = \Lambda$ . Thus when $P$ is both connected and asymmetrical, $Pʻʻ\alpha\cup \alpha$ and $CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha$ are each other's complements, and the two together constitute the Dedekind cut defined by $\alpha , Pʻʻ\alpha \cup \alpha$ being all the terms that do not follow the whole of $\alpha$ , and $CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha$ being all the terms that do follow the whole of $\alpha$ .

More generally, if $\alpha$ is any class, not necessarily contained in $CʻP$ , then when $P$ is connected, we have $CʻP - pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \subset Pʻʻ\alpha \cup (\alpha \cap CʻP),$ and when $P$ is asymmetrical, we have $Pʻʻ\alpha \cup (\alpha \cap CʻP) \subset CʻP - pʻ\overleftarrow{P}ʻʻ\alpha . \$ Thus when both conditions are fulfilled, we have (*202·503) $CʻP - pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = Pʻʻ\alpha \cup (\alpha \cap CʻP).$

The above inclusions and the consequent equality will be constantly required throughout what follows. The division of $CʻP$ into the two mutually exclusive parts $Pʻʻ\alpha \cup (\alpha \cap CʻP) \,\text{and}\, CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$ is the Dedekind "cut" defined by the class $\alpha$ . If $\alpha\subset CʻP$ , the two parts become, as above mentioned, $Pʻʻ\alpha \cup \alpha \,\text{and}\, CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha .$ If, further, $\alpha$ is not null, they become $Pʻʻ\alpha \cup \alpha \,\text{and}\, pʻ\overleftarrow{P}ʻʻ\alpha .$ If $\alpha$ is contained in $CʻP$ and contains all its own predecessors, they become $\alpha\, \text{and}\, CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha.$ In this simplified form, Dedekind "cuts" will be considered later (*211).

We take as our definition $\text{connex} = \hat{P} \{x\in CʻP.\supset _{x}.\overleftrightarrow{P}ʻx = CʻP\} \quad\text{Df}.$

Some of the propositions of the present number are analogues of propositions in *200 and *201. Such are: If $P$ is connected, so is $\breve{P}$ (*202·11); if $P$ is connected, so is any similar relation (*202·211); $\dot{\Lambda}$ and $x\downarrow y$ are connected (*202·3 ·31); if $P$ is connected, so is $P\unicode{x0294f}\alpha$ (*202·33); and various propositions connected with relation-arithmetic (*202·4—·42). The majority of the propositions of this number, however, deal with properties peculiar to connexity. Among the most important of these are:

*202·101. $\vdash \colon\ldotp P\in \text{connex} . \equiv :x\in CʻP.\supset _{x}.\overrightarrow{P}ʻx\cup \iota ʻx\cup \overleftarrow{P}ʻx = CʻP$

*202·103. $\vdash \colon\colon P\in \text{connex} . \equiv \colon\ldotp x,y\in CʻP.\supset _{x,y}:xPy.\lor.x = y.\lor.yPx$

*202·13. $\vdash :R_{*}\in \text{connex} . \equiv .R_{\text{po}}\in \text{connex}$

*202·5. $\vdash \colon\ldotp P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.x,y\in CʻP.\supset :x \neq y.{\sim}(xPy). \equiv .yPx$

*202·501. $\vdash :P\in \text{connex} .\supset .CʻP-\alpha -Pʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$

*202·503. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = (\alpha \cap CʻP)\cup Pʻʻ\alpha$

*202·505. $\vdash :P\in \text{connex} .\supset .CʻP = Pʻʻ\alpha \cup (\alpha \cap CʻP)\cup \{CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}$

*202·52. $\vdash :P\in \text{connex} .\supset .\overrightarrow{B}ʻP,\overrightarrow{B}ʻ\breve{P} \in 0\cup 1$

*202·524. $\vdash :P\in \text{connex} .\exists !\overrightarrow{B}ʻP.\supset .\text{ᗡ}ʻP = \overleftarrow{P}ʻBʻP$

*202·55. $\vdash :P\unicode{x0294f}\alpha \in \text{connex} .\alpha \subset CʻP.\alpha {\sim}\in 1.\supset .CʻP\unicode{x0294f}\alpha = \alpha$

In virtue of this proposition (and others) if $P$ is a series and $\alpha$ is a class (not a unit class) contained in $CʻP$ , $P\unicode{x0294f}\alpha$ is the generating relation of the series consisting of the class $\alpha$ in the order which it has in the series $P$ .

*202·7. $\vdash :P\in \text{connex} .\supset .P\dot{-} P^{2}\in 1\rightarrow 1$

This proposition is to be taken in connection with *201·63. The two together show that when $P$ is a series, $P_{1}$ is one-one.

*202·01. $\text{connex} =\hat{P} \{x\in CʻP.\supset _{x}.\overleftrightarrow{P}ʻx=CʻP\} \quad\text{Df}$

*202·1. $\vdash \colon\ldotp P\in \text{connex} .\equiv :x\in CʻP.\supset _{x}.\overleftrightarrow{P}ʻx=CʻP \quad[(*202·01)]$

*202·101. $\begin{align}& \vdash \colon\ldotp P\in \text{connex} .\equiv .x\in CʻP.\supset _{x}.\overrightarrow{P}ʻx\cup \iota ʻx\cup \overleftarrow{P}ʻx=CʻP\\ &[*202·1.*97·1]\end{align}$

*202·102. $\vdash :P\in \text{connex} .\equiv .\overleftrightarrow{P}ʻʻCʻP\in 0\cup 1 \quad[*97·231.*202·101]$

*202·103. $\begin{align}& \vdash \colon\colon P\in \text{connex} .\equiv \colon\ldotp x,y\in CʻP.\supset _{x,y}:xPy.\lor.x=y.\lor.yPx\\ &[*97·23.*202·102]\end{align}$

*202·104. $\begin{align}& \vdash \colon\colon P\in \text{connex} .\equiv \colon\ldotp x,y\in CʻP.x\neq y.\supset _{x,y}:xPy.\lor.yPx\\ &[*202·103.*5·6]\end{align}$

*202·11. $\vdash :P\in \text{connex} .\equiv .\breve{P} \in \text{connex} \quad[*202·104.*33·22]$

*202·12. $\vdash \colon\ldotp \dot{\exists} !P.\supset :P\in \text{connex} .\equiv .\overleftrightarrow{P}ʻʻCʻP\in 1.\equiv .\overleftrightarrow{P}ʻʻCʻP=\iota ʻCʻP$

Dem. $\begin{array}{l} \vdash .*202·1. &\supset \vdash :P\in \text{connex} .\equiv .\overleftrightarrow{P}ʻʻCʻP\subset \iota ʻCʻP &\qquad \text{(1)}\\ \vdash .*37·45. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\overleftrightarrow{P}ʻʻCʻP:\\ [*54·102] &\supset :\overleftrightarrow{P}ʻʻCʻP{\sim}\in 0:\\ [*202·102] &\supset :P\in \text{connex} .\supset .\overleftrightarrow{P}ʻʻCʻP\in 1 &\qquad \text{(2)}\\ \vdash .*202·102. &\supset \vdash :\overleftrightarrow{P}ʻʻCʻP\in 1.\supset .P\in \text{connex} &\qquad \text{(3)}\\ \vdash .(2).(3).& \supset \vdash \colon\ldotp \text{Hp}.\supset :P\in \text{connex} .\equiv .\overleftrightarrow{P}ʻʻCʻP\in 1 &\qquad \text{(4)}\\ \vdash .(1).(4).*52·46.&\supset \vdash \colon\ldotp \text{Hp}.\supset :P\in \text{connex} .\supset .\overleftrightarrow{P}ʻʻCʻP=\iota ʻCʻP &\qquad \text{(5)}\\ \vdash .(1).*22·42. &\supset \vdash :\overleftrightarrow{P}ʻʻCʻP=\iota ʻCʻP.\supset .P\in \text{connex} &\qquad \text{(6)}\\ \vdash .(4).(5).(6).\supset \vdash .\text{Prop} \end{array}$

The following propositions, down to *202·181 inclusive (excepting *202·16 ·161) are concerned with $R_{*}$ and $R_{\text{po}}$ . It often happens that these are connected when $R$ is not so, e.g. if $R$ is the relation $+_{c}1$ among inductive cardinals.

*202·13. $\vdash : R_{*} \in \text{connex} . \equiv . R_{\text{po}} \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *202·104 . \supset \\ \vdash \colon\colon R_{*} \in \text{connex} . &\equiv \colon\ldotp x, y \in CʻR_{*} . x \neq y . \supset _{x, y} : xR_{*}y . \lor . yR_{*}x \colon\ldotp \\ [*91·542] &\equiv \colon\ldotp x, y \in CʻR_{*} . x \neq y . \supset _{x, y} : xR_{\text{po}}y . \lor . yR_{\text{po}}x \colon\ldotp \\ [*90·14 . *91·504] &\equiv \colon\ldotp x, y \in CʻR_{\text{po}} . x \neq y . \supset _{x, y} : xR_{\text{po}}y . \lor . yR_{\text{po}}x \colon\ldotp \\ [*202·104] &\equiv \colon\ldotp R_{\text{po}} \in \text{connex} \colon\colon \supset \vdash . \text{Prop} \end{array}$

*202·131. $\vdash : P \in \text{connex} . CʻP = CʻQ . P \,\unicode{x2abd}\, Q . \supset . Q \in \text{connex} \quad[*202·103]$

*202·132. $\begin{align}&\vdash : P \in \text{connex} . \supset . P_{\text{po}}, P_{*} \in \text{connex} \\ &[*202·131 . *90·14·151 . *91·502·504]\end{align}$

*202·133. $\vdash \colon\colon I \upharpoonright CʻP \,\unicode{x2abd}\, P . \supset \colon\ldotp P \in \text{connex} . \equiv : x \in CʻP . \supset _{x} . CʻP = \overrightarrow{P}ʻx \cup \overleftarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash . *35·101 . \supset \vdash \colon\ldotp \text{Hp} . \supset : x \in CʻP . \supset . \iota ʻx \subset \overrightarrow{P}ʻx &\qquad \text{(1)}\\ \vdash . (1) . *202·101 . \supset \vdash . \text{Prop} \end{array}$

*202·134. $\begin{align}&\vdash \colon\colon\ldotp I \upharpoonright CʻP \,\unicode{x2abd}\, P . \supset \colon\colon P \in \text{connex} . \equiv \colon\ldotp x, y \in CʻP . \supset _{x, y} : xPy . \lor . yPx\\ &[*202·103]\end{align}$

*202·135. $\vdash : P \in \text{connex} . \equiv . P \unicode{x228d} I \upharpoonright CʻP \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *202·134 . \supset \vdash \colon\colon &P \unicode{x228d} I \upharpoonright CʻP \in \text{connex} . \equiv \colon\ldotp \\ &x, y \in CʻP . \supset _{x, y} : x (P \unicode{x228d} I \upharpoonright CʻP) y . \lor . y (P \unicode{x228d} I \upharpoonright CʻP) x \colon\ldotp \\ [*202·103] &\equiv \colon\ldotp P \in \text{connex} \colon\colon \supset \vdash . \text{Prop} \end{array}$

*202·136. $\begin{align}&\vdash \colon\ldotp P_{*} \in \text{connex} . \equiv : x \in CʻP . \supset _{x} . CʻP = \overrightarrow{P}_{*}ʻx \cup \overleftarrow{P}_{*}ʻx\\ &[*202·133 . *90·14·15]\end{align}$

*202·137. $\begin{align}&\vdash \colon\colon P_{*} \in \text{connex} . \equiv \colon\ldotp x, y \in CʻP . \supset _{x, y} : xP_{*}y . \lor . yP_{*}x\\ &[*202·134 . *90·15]\end{align}$

*202·138. $\vdash \colon\ldotp P \in \text{trans} . \supset : P \in \text{connex} . \equiv . P_{*} \in \text{connex} \quad[*202·13 . *201·18]$

*202·14. $\vdash : R \in \text{Cls} \rightarrow 1 . \supset . R_{\text{po}} \unicode{x0294f} \overleftarrow{R}_{*}ʻx \in \text{connex} \quad[*96·303 . *202·104]$

*202·141. $\vdash : R \in 1 \rightarrow \text{Cls} . \supset . R_{\text{po}} \unicode{x0294f} \overrightarrow{R}_{*}ʻx \in \text{connex} \quad\left[*202·14 \frac{\breve{R}}{R}. *202·11\right]$

*202·15. $\vdash : R \in 1 \rightarrow 1 . \supset . R_{\text{po}} \unicode{x0294f} \overleftrightarrow{R}_{*}ʻx \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *97·13 . \supset \vdash \colon\ldotp y, z \in \overleftrightarrow{R}_{*}ʻx . \supset _{y, z} : &y, z \in \overrightarrow{R}_{*}ʻx . \lor . y, z \in \overleftarrow{R}_{*}ʻx . \lor .\\ &y \in \overrightarrow{R}_{*}ʻx . z \in \overleftarrow{R}_{*}ʻx . \lor . y \in \overleftarrow{R}_{*}ʻx . z \in \overrightarrow{R}_{*}ʻx &\qquad \text{(1)}\\ \vdash .*202·141·104. &\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp y,z\in \overrightarrow{R}_{*}ʻx.y \neq z.\supset :yR_{\text{po}}x.\lor.xR_{\text{po}}y &\qquad \text{(2)}\\ \vdash .*202·14·104. &\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp y,z\in \overleftarrow{R}_{*}ʻx.y \neq z.\supset :yR_{\text{po}}x.\lor.xR_{\text{po}}y &\qquad \text{(3)}\\ \vdash .*90·17. \supset \vdash :y\in \overrightarrow{R}_{*}ʻx.z\in \overleftarrow{R}_{*}ʻx.y \neq z.&\supset .yR_{*}z.y \neq z.\\ [*91·542] &\supset .yR_{\text{po}}z &\qquad \text{(4)}\\ \text{Similarly}\quad &\vdash :y\in \overleftarrow{R}_{*}ʻx.z\in \overrightarrow{R}_{*}ʻx.y \neq z.\supset .zR_{\text{po}}y &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp y,z\in \overleftrightarrow{R}_{*}ʻx.y \neq z.\supset _{y,z}:yR_{\text{po}}z.\lor.zR_{\text{po}}y &\qquad \text{(6)}\\ \vdash .(6).*202·104.\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in the ordinal theory of finite and infinite (*260·4).

*202·16. $\vdash :P\in \text{connex} .x,y\in CʻP.{\sim}(xPx).{\sim}(yPy).\overrightarrow{P}ʻx = \overrightarrow{P}ʻy.\supset .x = y$

Dem. $\begin{array}{l} \vdash .*32·18·181.\supset \vdash :\text{Hp}.&\supset .{\sim}(xPy).{\sim}(yPx).\\ [*202·103] &\supset .x = y:\supset \vdash .\text{Prop} \end{array}$

*202·161. $\vdash :P\in \text{connex} \cap R1ʻJ.\supset .\overrightarrow{P}\upharpoonright CʻP\in 1\rightarrow 1.\overrightarrow{P}\upharpoonright CʻP\in (\overrightarrow{P}^{;}P) \overline{\,\text{smor}\,} P$

Dem. $\begin{array}{l} \vdash .*202·16.\supset \vdash \colon\ldotp \text{Hp}.\supset :x,y\in CʻP.\overrightarrow{P}ʻx = \overrightarrow{P}ʻy.\supset .x = y &\qquad \text{(1)}\\ \vdash .(1).*71·55.*151·24.\supset \vdash .\text{Prop} \end{array}$

*202·162. $\vdash :P\in \text{connex} .P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P\unicode{x0294f}^{;}\overrightarrow{P}_{*}^{;}P \,\text{smor}\, P.P\unicode{x0294f}\mid \overrightarrow{P}_{*}\upharpoonright CʻP\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*36·13.\supset \vdash \colon\ldotp P\unicode{x0294f}\overrightarrow{P}_{*}ʻx = &P\unicode{x0294f}\overrightarrow{P}_{*}ʻy. \equiv :\\ &uPv.u,v\in \overrightarrow{P}_{*}ʻx. \equiv _{u,v}.uPv.u,v\in \overrightarrow{P}_{*}ʻy &\qquad \text{(1)}\\ \vdash .(1).*11·1.*90·12.\supset \\ \vdash \colon\ldotp x,y\in CʻP.P\unicode{x0294f}\overrightarrow{P}_{*}ʻx = P\unicode{x0294f}\overrightarrow{P}_{*}ʻy.\supset :&xPy.yP_{*}x. \equiv .xPy.xP_{*}y:\\ &yPx.yP_{*}x. \equiv .yPx.xP_{*}y:\\ [*90·151.*91·52]&\supset :xPy.\supset .xP_{\text{po}}x:yPx.\supset .yP_{\text{po}}y &\qquad \text{(2)}\\ \vdash .(2).&\supset \vdash :\text{Hp}.x,y\in CʻP.P\unicode{x0294f}\overrightarrow{P}_{*}ʻx = P\unicode{x0294f}\overrightarrow{P}_{*}ʻy.\supset .{\sim}(xPy).{\sim}(yPx).\\ [*202·103] &\supset .x = y:\supset \vdash .\text{Prop} \end{array}$

*202·17. $\vdash :P_{\text{po}}\in \text{connex} .y\in P(x\vdash\dashv z).\supset .P(x\vdash\dashv y)\cup P(y\vdash\dashv z) = P(x\vdash\dashv z)$

Dem. $\begin{array}{l} \vdash .*201·14·15.*121·103.\supset \\ \vdash :\text{Hp}.&\supset .P(x\vdash\dashv y)\subset P(x\vdash\dashv z).P(y\vdash\dashv z)\subset P(x\vdash\dashv z) &\qquad \text{(1)}\\ \vdash .*202·13·137.*121·103.\supset \\ \vdash \colon\ldotp \text{Hp}.\omega \in P(x\vdash\dashv z).&\supset :\omega P_{*}y.\lor.yP_{*}\omega :xP_{*}\omega .\omega P_{*}z:\\ [*121·103] &\supset :\omega \in P(x\vdash\dashv y)\cup P(y\vdash\dashv z) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*202·171. $\begin{align}&\vdash :P_{\text{po}}\in \text{connex} .y\in P(x\vdash\dashv z).\supset .\\ &P(x\dashv z)=P(x\dashv y)\cup P(y\dashv z).P(x\unicode{x27dd} z)=P(x\vdash y)\cup P(y\unicode{x27dd} z)\\ &[\text{Proof as in *202·17}]\end{align}$

*202·172. $\begin{align}\vdash :P_{\text{po}}\in &\text{connex} .y\in P(x-z).\supset .\\ &P(x-y)=P(x\dashv y)\cup P(y-z)=P(x-y)\cup P(y \unicode{x27dd} z)\\ &[\text{Proof as in *202·17}]\end{align}$

*202·18. $\vdash :P_{\text{po}}\in \text{connex} .\text{E}!BʻP.\supset .CʻP=\overleftarrow{P}_{*}ʻBʻP$

Dem. $\begin{array}{l} \vdash .*202·1.\supset \vdash :\text{Hp}.\supset .CʻP&=\overleftrightarrow{P}_{\text{po}}ʻBʻP\\ [*97·2.*91·504] &=\overleftarrow{P}_{*}ʻBʻP:\supset \vdash .\text{Prop} \end{array}$

*202·181. $\vdash :P_{\text{po}}\in \text{connex} .\text{E}!BʻP.\text{E}!Bʻ\breve{P} .\supset .CʻP=P(BʻP\vdash\dashv Bʻ\breve{P})$

Dem. $\begin{array}{l} \vdash .*202·18.\supset \vdash :\text{Hp}.\supset .CʻP&=\overleftarrow{P}_{*}ʻBʻP\cap \overrightarrow{P}_{*}ʻBʻ\breve{P} \\ [*121·103] &=P(BʻP\vdash\dashv Bʻ\breve{P} ):\supset \vdash .\text{Prop} \end{array}$

The above proposition is used in the ordinal theory of finite and infinite (*261·2).

The following proposition is a lemma for *202·211, which shows that if a relation is connected, so are all similar relations.

*202·21. $\vdash :P\in \text{connex} .S\in 1\rightarrow \text{Cls}.\supset .S^{;}P\in \text{connex}$

Dem. $\begin{array}{l} \vdash .*150·202.&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x,y\in CʻS^{;}P.x\neq y.\supset :x,y\in SʻʻCʻP.x\neq y:\\ [*71·4.*30·37]&\supset :(\exists z,w).z,w\in CʻP.x=Sʻz.y=Sʻw.z\neq w:\\ [*202·104] &\supset :(\exists z,w):x=Sʻz.y=Sʻw:zPw.\lor.wPz:\\ [*150·4] &\supset :x(S^{;}P)y.\lor.y(S^{;}P)x &\qquad \text{(1)}\\ \vdash .(1).*202·104.\supset \vdash .\text{Prop} \end{array}$

The proofs of the three following propositions proceed like the proofs of the analogous propositions in *200 and *201.

*202·211. $\vdash :P\in \text{connex} .Q\,\,\text{smor}\,\,P.\supset .Q\in \text{connex}$

*202·212. $\vdash :P\in \text{connex} .\supset .\text{Nr}ʻP\subset \text{connex}$

*202·22. $\vdash :P\in \text{connex} .\equiv .\text{N}_{0}\text{r}ʻP\subset \text{connex} .\equiv .\exists !\text{N}_{0}\text{r}ʻP\cap \text{connex}$

Dem. $\begin{array}{l} \vdash .*37·29.\supset \vdash :P=\dot{\Lambda} .&\supset .\overleftrightarrow{P}ʻʻCʻP=\Lambda .\\ [*202·102] &\supset .P\in \text{connex} :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*55·15.\supset \vdash \colon\ldotp &z,w\in Cʻ(x\downarrow y).\supset :\\ &z,w\in \iota ʻx.\lor.z,w\in \iota ʻy.\lor.z\in \iota ʻx.w\in \iota ʻy.\lor.z\in \iota ʻy.w\in \iota ʻx:\\ [*51·15.*13·172] &\supset :z=w.\lor.z=x.w=y.\lor.z=y.w=x:\\ [*55·15] &\supset :z=w.\lor.z(x\downarrow y)w.\lor.w(x\downarrow y)z &\qquad \text{(1)}\\ \vdash .(1).*202·103.\supset \vdash .\text{Prop} \end{array}$

*202·33. $\vdash :P\in \text{connex} .\supset .P\unicode{x0294f}\alpha \in \text{connex}$

Dem. $\begin{array}{l} \vdash .*37·41.&\supset \vdash :x,y\in CʻP\unicode{x0294f}\alpha .\supset .x,y\in \alpha .x,y\in CʻP &\qquad \text{(1)}\\ \vdash .(1).*202·103.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x,y\in CʻP\unicode{x0294f}\alpha .&\supset :x,y\in \alpha :xPy.\lor.x=y.\lor.yPx:\\ [*36·13] &\supset :x(P\unicode{x0294f}\alpha )y.\lor.x=y.\lor.y(P\unicode{x0294f}\alpha )x &\qquad \text{(2)}\\ \vdash .(2).*202·103.\supset \vdash .\text{Prop} \end{array}$

The following propositions (*202·4—·42) are concerned with applications of relation-arithmetic.

*202·4. $\vdash :P,Q\in \text{connex} .\supset .P\unicode{x2909}Q\in \text{connex}$

Dem. $\begin{array}{l} \vdash .*160·14.&\supset \vdash \colon\ldotp x,y\in Cʻ(P\unicode{x2909}Q).\equiv :\\ &x,y\in CʻP.\lor.x,y\in CʻQ.\lor.x\in CʻP.y\in CʻQ.\lor.x\in CʻQ.y\in CʻP &\qquad \text{(1)}\\ \vdash .*202·103.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x,y\in &CʻP.\supset :xPy.\lor.x=y.\lor.yPx:\\ [*160·1] &\supset :x(P\unicode{x2909}Q)y.\lor.x=y.\lor.y(P\unicode{x2909}Q)x &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x,y\in CʻQ.\supset :x(P\unicode{x2909}Q)y.\lor.x=y.\lor.y(P\unicode{x2909}Q)x &\qquad \text{(3)}\\ \vdash .*160·1.*35·103.&\supset \vdash :x\in CʻP.y\in CʻQ.\supset .x(P\unicode{x2909}Q)y &\qquad \text{(4)}\\ \vdash .*160·1.*35·103.&\supset \vdash :x\in CʻQ.y\in CʻP.\supset .y(P\unicode{x2909}Q)x &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x,y\in Cʻ(P\unicode{x2909}Q).\supset :x(P\unicode{x2909}Q)y.\lor.x=y.\lor.y(P\unicode{x2909}Q)x &\qquad \text{(6)}\\ \vdash .(6).*202·103.\supset \vdash .\text{Prop} \end{array}$

The above proposition illustrates the reasons for defining $P\unicode{x2909}Q$ as was done in *160. When $P$ and $Q$ are connected, $P\unicode{x228d} Q$ is in general not connected: it is the additional term $CʻP\uparrow CʻQ$ which insures connection.

*202·401. $\vdash \colon\ldotp CʻP\cap CʻQ=\Lambda .\supset :P\unicode{x2909}Q\in \text{connex} .\equiv .P,Q\in \text{connex}$

Dem. $\begin{array}{l} \vdash .*202·33.&\supset \vdash :P\unicode{x2909}Q\in \text{connex} .\supset .(P\unicode{x2909}Q)\unicode{x0294f}CʻP,(P\unicode{x2909}Q)\unicode{x0294f}CʻQ\in \text{connex} &\qquad \text{(1)}\\ \vdash .(1).*160·5.&\supset \vdash \colon\ldotp \text{Hp}.\supset :P\unicode{x2909}Q\in \text{connex} .\supset .P,Q\in \text{connex} &\qquad \text{(2)}\\ \vdash .(2).*202·4.&\supset \vdash .\text{Prop} \end{array}$

*202·41. $\vdash : P \in \text{connex} . \supset . P \unicode{x21f8} z \in \text{connex} . z \unicode{x21f7} P \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *161·14·2 . &\supset \vdash \colon\ldotp x, y \in Cʻ(P \unicode{x21f8} z) . x \neq y . \supset : x, y \in (CʻP \cup {℩}ʻz) . x \neq y :\\ [*51·236] &\supset : x, y \in CʻP . x\neq y . \lor . x \in CʻP . y = z . \lor . y \in CʻP . x = z &\qquad \text{(1)}\\ \vdash . (1) . *202·104 . \supset \\ \vdash \colon\colon P \in \text{connex} . \supset \colon\ldotp &x, y \in Cʻ(P \unicode{x21f8} z) . x \neq y . \supset :\\ &xPy . \lor . yPx . \lor . x \in CʻP . y = z . \lor . y \in CʻP . x = z :\\ [*161·11] &\supset : x (P \unicode{x21f8} z) y . \lor . y (P \unicode{x21f8} z) x \colon\ldotp \\ [*202·104] &\supset \colon\ldotp P \unicode{x21f8} z \in \text{connex} &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash : P \in \text{connex} . &\supset . z \unicode{x21f7} P \in \text{connex} &\qquad \text{(3)}\\ \vdash . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

*202·411. $\vdash . x \downarrow y \unicode{x21f8} z \in \text{connex} \quad[*202·41·31]$

*202·412. $\vdash \colon\ldotp z {\sim} \in CʻP . \supset : P \in \text{connex} . \equiv . P \unicode{x21f8} z \in \text{connex} . \equiv . z \unicode{x21f7} P \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *161·16 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : P = (P \unicode{x21f8} z) \unicode{x0294f} CʻP :\\ [*202·33] &\supset : P \unicode{x21f8} z \in \text{connex} . \supset . P \in \text{connex} &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \text{Hp} . \supset . z \unicode{x21f7} P \in \text{connex} . \supset . P \in \text{connex} &\qquad \text{(2)}\\ \vdash . (1) . (2) . *202·41 . \supset \vdash . \text{Prop} \end{array}$

*202·42. $\vdash : P \in \text{connex} . CʻP \subset \text{connex} . \supset . \Sigma ʻP \in \text{connex}$

Dem. $\begin{array}{l} \vdash . *162·22. &\supset \vdash : x, y \in Cʻ\Sigma ʻP . \equiv . (\exists Q, R) . Q, R \in CʻP . x \in CʻQ . y \in CʻR &\qquad \text{(1)}\\ \vdash . (1) . *202·103 . \supset \\ \vdash \colon\colon P \in \text{connex} . \supset \colon\ldotp x, y \in Cʻ\Sigma ʻP . \supset :\\ &(\exists Q, R) : QPR . \lor . Q = R . Q, R \in CʻP . \lor . RPQ : x \in CʻQ . y \in CʻR &\qquad \text{(2)}\\ \vdash . *162·13 . &\supset \vdash \colon\ldotp QPR . \lor . RPQ : x \in CʻQ . y \in CʻR : \supset :\\ &x (\Sigma ʻP) y . \lor . y (\Sigma ʻP) x &\qquad \text{(3)}\\ \vdash . *13·195 . &\supset \vdash : (\exists Q, R) . Q = R . Q, R \in CʻP . x \in CʻQ . y \in CʻR . \supset .\\ &(\exists Q) . Q \in CʻP . x, y \in CʻQ &\qquad \text{(4)}\\ \vdash . *202·103 . &\supset \vdash \colon\colon CʻP \subset \text{connex} . \supset \colon\ldotp (\exists Q) . Q \in CʻP . x, y \in CʻQ . \supset :\\ &(\exists Q) : Q \in CʻP : xQy . \lor . x = y . \lor . yQx :\\ [*162·13] &\supset : x (\Sigma ʻP) y . \lor . x = y . \lor . y (\Sigma ʻP) x &\qquad \text{(5)}\\ \vdash . (4) . (5) . \supset \\ \vdash \colon\colon CʻP \subset \text{connex} . &\supset \colon\ldotp (\exists Q, R) . Q = R . Q, R \in CʻP . x \in CʻQ . y \in CʻR . \supset :\\ &x (\Sigma ʻP) y . \lor . x = y . \lor . y (\Sigma ʻP) x &\qquad \text{(6)}\\ \vdash . (2) . (3) . (6) . &\supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp \\ &x, y \in Cʻ\Sigma ʻP . \supset : x (\Sigma ʻP) y . \lor . x = y . \lor . y (\Sigma ʻP) x &\qquad \text{(7)}\\ \vdash . (7) . *202·103 . \supset \vdash . \text{Prop} \end{array}$

*202·5. $\vdash \colon\ldotp P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.x,y\in CʻP.\supset :x\neq y.{\sim}(xPy).\equiv .yPx$

Dem. $\begin{array}{l} \vdash .*50·43. &\supset \vdash \colon\ldotp P^{2}\,\unicode{x2abd}\, J.\supset :yPx.\supset .{\sim}(xPy) &\qquad \text{(1)}\\ \vdash .*200·36. &\supset \vdash \colon\ldotp P^{2}\,\unicode{x2abd}\, J.\supset :yPx.\supset .x\neq y &\qquad \text{(2)}\\ \vdash .*202·104. &\supset \vdash \colon\ldotp P\in \text{connex} .x,y\in CʻP.\supset :x\neq y.{\sim}(xPy).\supset .yPx &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following propositions (*202·501-·51) are concerned with the relations of $Pʻʻ\alpha$ and $pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$ . They are important, and *202·501 ·503 ·505 will be often used.

*202·501. $\vdash :P\in \text{connex} .\supset .CʻP-\alpha -Pʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$

Dem. $\begin{array}{l} \vdash .*13·14.*37·1.\supset \vdash \colon\ldotp y\in CʻP-\alpha -Pʻʻ\alpha .x\in \alpha .\supset .x\neq y.{\sim}(yPx) &\qquad \text{(1)}\\ \vdash .(1).*202·103.\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in CʻP-\alpha -Pʻʻ\alpha .x\in \alpha \cap CʻP.\supset .xPy:\\ [*40·53]\supset :y\in CʻP-\alpha -Pʻʻ\alpha .\supset .y\in pʻ\overleftarrow{P}ʻʻ(a\cap CʻP)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*202·502. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\exists !\alpha \cap CʻP.\supset .CʻP-\alpha -Pʻʻ\alpha =pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$

Dem. $\begin{array}{l} \vdash .*40·62. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset CʻP &\qquad \text{(1)}\\ \vdash .*200·5. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -\alpha &\qquad \text{(2)}\\ \vdash .*200·53. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*202·501.\supset \vdash .\text{Prop} \end{array}$

*202·503. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=(\alpha \cap CʻP)\cup Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*202·501.*24·43.&\supset \vdash :\text{Hp}.\supset .CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset \alpha \cup Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*22·43. &\supset \vdash :\text{Hp}.\supset .CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset (\alpha \cup Pʻʻ\alpha )\cap CʻP\\ [*22·68.*37·15] & \subset (\alpha \cap CʻP)\cup Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*200·5·36. &\supset \vdash :\text{Hp}.\supset .\alpha \cap CʻP\subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(3)}\\ \vdash .*200·53.&\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha \subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(4)}\\ \vdash .*22·43.*37·15. &\supset \vdash .\alpha \cap CʻP\subset CʻP.Pʻʻ\alpha \subset CʻP &\qquad \text{(5)}\\ \vdash .(3).(4).(5).&\supset \vdash :\text{Hp}.\supset .(\alpha \cap CʻP)\cup Pʻʻ\alpha \subset CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(6)}\\ \vdash .(2).(6).\supset \vdash .\text{Prop} \end{array}$

*202·504 $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=CʻP-\alpha -Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*200·5·36. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -\alpha &\qquad \text{(1)}\\ \vdash .*200·53. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*22·48.&\supset \vdash :\text{Hp}.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset CʻP-\alpha -Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).*202·501.&\supset \vdash .\text{Prop} \end{array}$

*202·505. $\vdash :P\in \text{connex} .\supset .CʻP=Pʻʻ\alpha \cup (\alpha \cap CʻP)\cup \{CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}$

Dem. $\begin{array}{l} \vdash .*202·501. &\supset \vdash :\text{Hp}.\supset .CʻP-\alpha -Pʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).\\ [*24·43] &\supset .CʻP\subset \alpha \cup Pʻʻ\alpha \cup \{pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}.\\ [*22·621.*37·15] &\supset .CʻP=(\alpha \cap CʻP)\cup Pʻʻ\alpha \cup \{CʻP\cap pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}:\supset \vdash .\text{Prop} \end{array}$

*202·51. $\begin{align}\vdash :P\in \text{connex} .\alpha \subset CʻP.&\exists !\alpha .\supset .\\ &CʻP=Pʻʻ\alpha \cup \alpha \cup pʻ\overleftarrow{P}ʻʻ\alpha =\breve{P} ʻʻ\alpha \cup \alpha \cup pʻ\overrightarrow{P}ʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*40·62. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ\alpha \subset CʻP &\qquad \text{(1)}\\ \vdash .*22·621. &\supset \vdash :\text{Hp}.\supset .\alpha =\alpha \cap CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*202·505.&\supset \vdash :\text{Hp}.\supset .CʻP=Pʻʻ\alpha \cup \alpha \cup pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(3)\frac{\breve{P}}{P}.*202·11.&\supset \vdash :\text{Hp}.\supset .CʻP=\breve{P} ʻʻ\alpha \cup \alpha \cup pʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

The following propositions (*202·511—·524) are concerned with $\overrightarrow{B}ʻP$ . *202·52 shows that if $P\in \text{connex}$ , $P$ cannot have more than one first term or more than one last term, and *202·523 shows that this still holds if only $P_{*}$ is connected. *202·511 shows that if $P$ is a connected relation which has a first term, then if $\alpha$ is any class, there are predecessors of the whole of $\alpha \cap CʻP$ when and only when $BʻP$ is such a predecessor, and when and only when $BʻP{\sim}\in \alpha$ . *202·524 shows that if $P$ is connected and has a first term, $\text{ᗡ}ʻP$ consists of the successors of the first term. These propositions are much used.

*202·511. $\begin{align}\vdash \colon\ldotp P\in &\text{connex} .\text{E}!BʻP.\supset :\\ &\exists !pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\equiv .BʻP{\sim}\in \alpha .\equiv .BʻP\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*202·104.*93·1.\supset \vdash \colon\ldotp \text{Hp}.BʻP{\sim}\in \alpha .&\supset :x\in (\alpha \cap CʻP).\supset _{x}.(BʻP)Px:\\ [*40·51] & \supset :BʻP\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP): &\qquad \text{(1)}\\ [*10·24] &\supset :\exists !pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(2)}\\ \vdash .*93·1. \supset \vdash :\text{Hp}.BʻP\in \alpha .&\supset .(x).{\sim}\{xP(BʻP)\}.BʻP\in \alpha \cap CʻP.\\ [*40·51] &\supset .pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\Lambda . &\qquad \text{(3)}\\ [*24·105] &\supset .BʻP{\sim}\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(4)}\\ \vdash .(2).(3).&\supset \vdash \colon\ldotp \text{Hp}.\supset :BʻP{\sim}\in \alpha .\equiv .\exists !pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(5)}\\ \vdash .(1).(4).&\supset \vdash \colon\ldotp \text{Hp}.\supset :BʻP{\sim}\in \alpha .\equiv .BʻP\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(6)}\\ \vdash .(5).(6).&\supset \vdash .\text{Prop} \end{array}$

*202·52. $\vdash :P\in \text{connex} .\supset .\overrightarrow{B}ʻP,\overrightarrow{B}ʻ\breve{P} \in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*93·103. \supset \vdash :x,y\in \overrightarrow{B}ʻP.&\supset .x,y\in CʻP.x{\sim}\in \text{ᗡ}ʻP.y{\sim}\in \text{ᗡ}ʻP.\\ [*33·14] &\supset .x,y\in CʻP.{\sim}(xPy).{\sim}(yPx) &\qquad \text{(1)}\\ \vdash .(1).*202·103. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x,y\in \overrightarrow{B}ʻP.\supset .x=y:\\ [*52·4] &\supset :\overrightarrow{B}ʻP\in 0\cup 1 &\qquad \text{(2)}\\ \vdash .(2).*202·11. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\breve{P} \in 0\cup 1 &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*202·521. $\vdash :P_{*}\in \text{connex} .\supset .\overrightarrow{B}ʻP\subset pʻ\overrightarrow{P}_{*}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*202·13·103.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x\in \overrightarrow{B}ʻP.y\in CʻP.\supset :xP_{\text{po}}y.\lor.x=y.\lor.yP_{\text{po}}x &\qquad \text{(1)}\\ \vdash .*91·504.&\supset \vdash :x\in \overrightarrow{B}ʻP.\supset .{\sim}(yP_{\text{po}}x) &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in \overrightarrow{B}ʻP.y\in CʻP.\supset :xP_{\text{po}}y.\lor.x=y:\\ [*91·54] &\supset :xP_{*}y\colon\colon\supset \vdash .\text{Prop} \end{array}$

*202·522. $\vdash .\overrightarrow{B}ʻP=\overrightarrow{B}ʻP_{\text{po}} \quad[*91·504]$

*202·523. $\vdash :P_{*}\in \text{connex} .\supset .\overrightarrow{B}ʻP\in 0\cup 1 \quad[*202·13·52·522]$

*202·524. $\vdash :P\in \text{connex} .\exists !\overrightarrow{B}ʻP.\supset .\text{ᗡ}ʻP=\overleftarrow{P}ʻBʻP$

Dem. $\begin{array}{l} \vdash .*202·52.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{E}!BʻP:\\ [*202·104.*93·103] &\supset :x\in \text{ᗡ}ʻP.\supset .(BʻP)Px &\qquad \text{(1)}\\ \vdash .(1).*33·151.\supset \vdash \text{Prop} \end{array}$

The following propositions (*202·53—·55) are concerned with relations with limited fields. Such relations are constantly used in the theory of series.

*202·53. $\vdash :Q\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.Q\,\unicode{x2abd}\, P.\supset .Q=P\unicode{x0294f}CʻQ$

Dem. $\begin{array}{l} \vdash .*33·17.*36·13. &\supset \vdash \colon\ldotp \text{Hp}.\supset :xQy.\supset .x(P\unicode{x0294f}CʻQ)y &\qquad \text{(1)}\\ \vdash .*50·43. \supset \vdash \colon\ldotp \text{Hp}.&\supset :xPy.\supset .{\sim}(yPx).\\ [*23·81] &\supset .{\sim}(yQx). &\qquad \text{(2)}\\ \vdash .*200·36.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xPy.\supset .x\neq y &\qquad \text{(3)}\\ \vdash .(2).(3).*202·104.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x,y\in CʻQ.xPy.\supset .xQy:\\ [*36·13]&\supset :x(P\unicode{x0294f}CʻQ)y.\supset .xQy &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

This proposition is important in series. If $P$ and $Q$ are serial relations, and $Q\,\unicode{x2abd}\, P$ , they verify the above hypothesis; hence if $Q$ is a series contained in a given series $P$ , $Q$ is simply $P$ with its field limited. Thus series contained in a given series are completely determined by their fields.

*202·54. $\vdash :P\unicode{x0294f}\alpha \in \text{connex} .\alpha \cap CʻP{\sim}\in 1.\supset .CʻP\unicode{x0294f}\alpha = \alpha \cap CʻP$

Dem. $\begin{array}{l} \vdash .*52·181.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in \alpha \cap CʻP.&\supset _{x}:(\exists y).y\in \alpha \cap CʻP.y \neq x:\\ [*202·104] &\supset _{x}:(\exists y).y\in \alpha \cap CʻP:xPy.\lor.yPx:\\ [*36·13] &\supset _{x}:(\exists y):x(P\unicode{x0294f}\alpha )y.\lor.y(P\unicode{x0294f}\alpha )x:\\ [*33·132] &\supset _{x}:x\in CʻP\unicode{x0294f}\alpha &\qquad \text{(1)}\\ \vdash .*37·41·15·16.&\supset \vdash .CʻP\unicode{x0294f}\alpha \subset \alpha \cap CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The above proposition is frequently used. *202·55, which is an immediate consequence of *202·54, is used incessantly.

*202·541. $\vdash :P\in \text{trans} \cap \text{connex} .\alpha \cap CʻP{\sim}\in 1.\supset .(P\unicode{x0294f}\alpha )_{*} = P_{*}\unicode{x0294f}\alpha$

Dem. $\begin{array}{l} \vdash .*201·18·33 .\supset \vdash :\text{Hp}.\supset .(P\unicode{x0294f}\alpha )_{*} &= P\unicode{x0294f}\alpha \unicode{x228d} I\upharpoonright (CʻP\unicode{x0294f}\alpha )\\ [*202·54] &= P\unicode{x0294f}\alpha \unicode{x228d} I\upharpoonright (CʻP\cap \alpha )\\ [*201·18.*36·23.*50·5] &=P_{*}\unicode{x0294f}\alpha \end{array}$

*202·55. $\vdash :P\unicode{x0294f}\alpha \in \text{connex} .\alpha \subset CʻP.\alpha {\sim}\in 1.\supset .CʻP\unicode{x0294f}\alpha = \alpha \quad[*202·54]$

*202·56. $\vdash .P\in \text{connex} .P\,\unicode{x2abd}\, J.x\in CʻP.\beta \subset CʻP.Pʻʻ\beta \subset \overrightarrow{P}ʻx.\supset .\beta \subset \overrightarrow{P}ʻx\cup \iota ʻx$

Dem. $\begin{array}{l} \vdash .*37·1. &\supset \vdash :Pʻʻ\beta \subset \overrightarrow{P}ʻx.y\in \beta .xPy.\supset .xPx &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}. &\supset \vdash :\text{Hp}.y\in \beta .\supset .{\sim}(xPy) &\qquad \text{(2)}\\ \vdash .(2).*32·18. &\supset \vdash :\text{Hp}.y\in \beta - \overrightarrow{P}ʻx.\supset .{\sim}(xPy).{\sim}(yPx).\\ [*202·103] &\supset .y = x:\supset \vdash .\text{Prop} \end{array}$

*202·6. $\vdash \colon\colon P\in \text{connex} .P\,\unicode{x2abd}\, J.\supset \colon\ldotp x,y\in CʻP.x \neq y. \equiv :xPy.\lor.yPx$

Dem. $\begin{array}{l} \vdash .*202·104.& \supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x,y\in CʻP.x \neq y.\supset :xPy.\lor.yPx &\qquad \text{(1)}\\ \vdash .*50·11.*33·17. &\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp xPy.\lor.yPx:\supset .x,y\in CʻP.x \neq y &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The following proposition is a lemma for *202·62, which is itself a lemma for *204·52.

*202·61. $\begin{align}\vdash \colon\colon P\in &\text{connex} .P\,\unicode{x2abd}\, J:\phi (x,y). \equiv _{x,y}.\phi (y,x):\supset \colon\ldotp \\ &xPy.\supset _{x,y}.\phi (x,y): \equiv :x,y\in CʻP.x \neq y.\supset _{x,y}.\phi (x,y)\end{align}$

Dem. $\begin{array}{l} \vdash .*202·6.\supset \vdash \colon\colon\ldotp &\text{Hp}.\supset \colon\colon x,y\in CʻP.x \neq y.\supset _{x,y}.\phi (x,y): \equiv \colon\ldotp \\ &xPy.\lor.yPx:\supset _{x,y}.\phi (x,y)\colon\ldotp \\ [*4·77] &\equiv \colon\ldotp xPy.\supset _{x,y}.\phi (x,y):yPx.\supset _{x,y}.\phi (x,y)\colon\ldotp \\ [*4·85.\text{Hp}] &\equiv \colon\ldotp xPy.\supset _{x,y}.\phi (x,y):yPx.\supset _{x,y}.\phi (y,x)\colon\ldotp \\ [*4·24] &\equiv \colon\ldotp xPy.\supset _{x,y}.\phi (x,y)\colon\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*202·611. $\begin{align}&\vdash \colon\ldotp P \in \text{connex} . P \,\unicode{x2abd}\, J . R = \breve{R} . \supset : P \,\unicode{x2abd}\, R . \equiv . J \unicode{x0294f} CʻP \,\unicode{x2abd}\, R\\ &\left[*202·61 \frac{xRy}{\phi(x, y)}\right]\end{align}$

*202·62. $\vdash \colon\ldotp P \in \text{connex} . P \,\unicode{x2abd}\, J . \supset : P \in \text{Rel}^{2}\text{excl} . \equiv . F^{;}P \,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash . *202·61 . *163·1 . &\supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp \\ P \in \text{Rel}^{2}\text{excl} . &\equiv : QPR . \supset _{Q, R} . CʻQ \cap CʻR = \Lambda :\\ [*24·37] &\equiv : QPR . x \in CʻQ . y \in CʻR . \supset _{Q, R, x, y} . x \neq y :\\ [*150·52] &\equiv . x (F^{;}P) y . \supset _{x, y} . x \neq y \colon\colon \supset \vdash . \text{Prop} \end{array}$

The three following propositions (*202·7—·72) are concerned with $P\dot{-} P^{2}$ . Of these, *202·7 is important: it shows that if $P$ is connected, no term can have more than one immediate predecessor or successor. *202·72 is used in *204·71, which is an important proposition.

*202·7. $\vdash : P \in \text{connex} . \supset . P \dot{-} P^{2} \in 1 \rightarrow 1$

Dem. $\begin{array}{l} \vdash . *34·5 . \text{Transp} . &\supset \vdash : zPx . {\sim} (yP^{2}x) . \supset . {\sim} (yPz) &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash : yPx . {\sim} (zP^{2}x) . \supset . {\sim} (zPy) &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash : y (P \dot{-} P^{2}) x . z (P \dot{-} P^{2}) x . \supset . {\sim} (yPz) . {\sim} (zPy) &\qquad \text{(3)}\\ \vdash . (3) . *202·103 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : y (P \dot{-} P^{2}) x . z (P \dot{-} P^{2}) x . \supset . y = z &\qquad \text{(4)}\\ \text{Similarly}\quad &\vdash \colon\ldotp \text{Hp} . \supset : x (P \dot{-} P^{2}) y . x (P \dot{-} P^{2}) z . \supset . y = z &\qquad \text{(5)}\\ \vdash . (4) . (5) . \supset \vdash . \text{Prop} \end{array}$

*202·71. $\vdash : P \in \text{connex} . x (P \dot{-} P^{2}) y . \supset . \overrightarrow{P}_{\text{po}}ʻy = \overrightarrow{P}_{*}ʻx$

Dem. $\begin{array}{l} \vdash . *91·52 . \supset \vdash : \text{Hp} . &\supset . \overrightarrow{P}_{*}ʻx \subset \overrightarrow{P}_{\text{po}}ʻy &\qquad \text{(1)}\\ \vdash . *91·57 . \supset \vdash \colon\ldotp zP_{\text{po}}y . &\supset : zPy . \lor . zP_{\text{po}} \mid Py :\\ [*25·41] &\supset : z (P \dot{-} P^{2}) y . \lor . z (P \dot{\cap} P^{2}) y . \lor . z (P_{\text{po}} \mid P) y :\\ [*91·502] &\supset : z (P \dot{-} P^{2}) y . \lor . z (P_{\text{po}} \mid P) y &\qquad \text{(2)}\\ \vdash . *202·7. &\supset \vdash : \text{Hp} . z (P \dot{-} P^{2}) y . \supset . z = x &\qquad \text{(3)}\\ \vdash . (2) . (3) . &\supset \vdash : \text{Hp} . zP_{\text{po}}y . z \neq x . \supset . z (P_{\text{po}} \mid P) y .\\ [*34·1] &\supset . (\exists w) . zP_{\text{po}} w . wPy &\qquad \text{(4)}\\ \vdash . *34·5 . &\supset \vdash : wPy . xPw . \supset . xP^{2}y &\qquad \text{(5)}\\ \vdash . (5) . &\text{Transp} . \supset \vdash \colon\ldotp \text{Hp} . wPy . \supset : {\sim} (xPw) :\\ [*202·103] &\supset : wPx . \lor . w = x &\qquad \text{(6)}\\ \vdash . (4) . (6) . &\supset \vdash \colon\ldotp \text{Hp} . zP_{\text{po}}y . z \neq x . \supset : zP_{\text{po}}x . \lor . (\exists w) . zP_{\text{po}}w . wPx :\\ [*91·511] &\supset : zP_{\text{po}}x &\qquad \text{(7)}\\ \vdash . (7) . *91·54 . &\supset \vdash : \text{Hp} . \supset . \overrightarrow{P}_{\text{po}}ʻy \subset \overrightarrow{P}_{*}ʻx &\qquad \text{(8)}\\ \vdash . (1) . (8) . \supset \vdash . \text{Prop} \end{array}$

*202·72. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .x(P\dot{-} P^{2})y.\supset .\overrightarrow{P}ʻy=\overrightarrow{P}ʻx\cup \iota ʻx\\ &[*202·71.*201·18·521]\end{align}$

*202·8. $\begin{align}\vdash :Q\in \text{connex} .S\in P\,\overline{\,\text{smor}\,}\,Q.CʻQ\cap &\beta {\sim}\in 1.\supset .\\ &S\upharpoonright \beta \in (P\unicode{x0294f}Sʻʻ\beta )\overline{\,\text{smor}\,} Q\unicode{x0294f}\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*71·29. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright \beta \in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*35·64.*151·11. \supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻ(S\upharpoonright \beta )&=CʻQ\cap \beta \\ [*202·54] & =Cʻ(Q\unicode{x0294f}\beta ) &\qquad \text{(2)}\\ \vdash .*150·37. & \supset \vdash :\text{Hp}.\supset .(S\upharpoonright \beta )^{;}Q=P\unicode{x0294f}Sʻʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*202·81. $\vdash :Q\in \text{connex} .S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .(P\unicode{x0294f}Sʻʻ\beta )\text{ sm }Q\unicode{x0294f}\beta$

Dem. $\begin{array}{l} \vdash .*202·8. & \supset \vdash :\text{Hp}.CʻQ\cap \beta {\sim}\in 1.\supset .(P\unicode{x0294f}Sʻʻ\beta )\,\text{smor}\,Q\unicode{x0294f}\beta &\qquad \text{(1)}\\ \vdash .*36·13.*33·17. & \supset \vdash :CʻQ\cap \beta =\iota ʻy.\supset .Q\unicode{x0294f}\beta \,\unicode{x2abd}\, y\downarrow y &\qquad \text{(2)}\\ \vdash .*36·13. & \supset \vdash \colon\ldotp \text{Hp}(2).\supset :y(Q\unicode{x0294f}\beta )y.\equiv .yQy &\qquad \text{(3)}\\ \vdash .(2).(3).*55·341.& \supset \vdash :\text{Hp}(2).yQy.\supset .Q\unicode{x0294f}\beta =y\downarrow y &\qquad \text{(4)}\\ \vdash .*35·64.*151·11. &\supset \vdash :\text{Hp}.\supset .\text{ᗡ}ʻ(S\upharpoonright \beta )=CʻQ\cap \beta &\qquad \text{(5)}\\ \vdash .(4).(5).& \supset \vdash :\text{Hp}(4).\supset .\text{ᗡ}ʻ(S\upharpoonright \beta )=Cʻ(Q\unicode{x0294f}\beta ) &\qquad \text{(6)}\\ \vdash .*71·29.*150·37. &\supset \vdash :\text{Hp}.\supset .S\upharpoonright \beta \in 1\rightarrow 1.P\unicode{x0294f}Sʻʻ\beta =S^{;}(Q\unicode{x0294f}\beta ) &\qquad \text{(7)}\\ \vdash .(6).(7).*151·1. & \supset \vdash :\text{Hp}(4).\supset .(P\unicode{x0294f}Sʻʻ\beta )\,\text{smor}\,Q\unicode{x0294f}\beta &\qquad \text{(8)}\\ \vdash .(2).(3).*55·341. &\supset \vdash :\text{Hp}(2).{\sim}(yQy).\supset .Q\unicode{x0294f}\beta =\dot{\Lambda} . &\qquad \text{(9)}\\ [(7).*150·42] &\supset .P\unicode{x0294f}Sʻʻ\beta =\dot{\Lambda} &\qquad \text{(10)}\\ \vdash .(9).(10).*153·101. &\supset \vdash :\text{Hp}(9).\supset .(P\unicode{x0294f}Sʻʻ\beta )\,\text{smor}\,Q\unicode{x0294f}\beta &\qquad \text{(11)}\\ \vdash .(8).(11).*52·1.&\supset \vdash :\text{Hp}.CʻQ\cap \beta \in 1.\supset .(P\unicode{x0294f}Sʻʻ\beta )\,\text{smor}\,Q\unicode{x0294f}\beta &\qquad \text{(12)}\\ \vdash .(1).(12).\supset \vdash .\text{Prop} \end{array}$

The above proposition shows that if $Q$ is connected, and any class $\beta$ is picked out of $CʻQ$ , then $Q$ arranges $\beta$ in an order which is similar to that in which $P$ arranges the correlates of $\beta$ .

In this number we give the definition and a few of the simpler properties of series. Most of the propositions of this number result immediately from those of *200, *201, and *202. Our definition is $\text{Ser} =\text{Rl}ʻJ\cap \text{trans}\cap \text{connex} \quad\text{Df}.$

*204·16. $\vdash :P\in \text{Ser}.\equiv .P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.P^{3}\,\unicode{x2abd}\, J.\equiv .P\in \text{connex} .P_{\text{po}}\,\unicode{x2abd}\, J$

After a few propositions giving other possible forms of the definition of series, we proceed to a set of propositions which follow immediately from those of *200, *201, and *202. Such are

*204·21. $\vdash :P\in \text{Ser}.P\,\,\text{smor}\,\,Q.\supset .Q\in \text{Ser}$

*204·272. $\vdash \colon\ldotp P\in \text{Ser}.\supset :\text{D}ʻP\in 1.\equiv .P\in 2_{r}.\equiv .\text{ᗡ}ʻP\in 1$

so that couples are the only series having unit classes for their domains or converse domains.

*204·33. $\vdash \colon\ldotp P\in \text{Ser}.x,y\in CʻP.\supset :x\neq y.\overrightarrow{P}ʻyC\overrightarrow{P}ʻx.\equiv .yPx$

Also, if $P\in \text{Ser},\overrightarrow{P}\upharpoonright CʻP$ is a one-one and $\overrightarrow{P}^{;}P\,\,\text{smor}\,\,P$ (*204·34·35).

We then have some propositions (*204·4—·44) on relations with limited fields. The most important of these are

*204·4. $\vdash :P\in \text{Ser}.\supset .P\unicode{x0294f}\alpha \in \text{Ser}$

*204·41. $\vdash :P,Q\in \text{Ser}.Q\,\unicode{x2abd}\, P.\supset .Q=P\unicode{x0294f}CʻQ$

This proposition is important, since it shows that any series contained in a given series is wholly determined when its field is given.

We have next a number of propositions (*204·45—·59) applying relation-arithmetic to series. The first set of these (*204·45—·483) are concerned with the proof that if a "cut" is made in a series, the series is the sum of the two parts into which the cut divides it, where the sum is taken in the sense of *160 or *161, according as one part of the cut does not or does consist of a single term. Most of these propositions do not require the full hypothesis that $P$ is a series, but only some part of it. Thus we have for instance

*204·46. $\begin{align}\vdash : &P \in \text{connex} . \text{E}! BʻP . \text{ᗡ}ʻP {\sim} \in 1 . \supset .\\ &P = BʻP \unicode{x21f7} P \unicode{x0294f} \text{ᗡ}ʻP . \text{Nr}ʻP = \dot{1} \dot{+} \text{Nr}ʻ(P \unicode{x0294f} \text{ᗡ}ʻP)\end{align}$

We next prove that if $P$ , $Q$ are mutually exclusive series, their sum $(P \unicode{x2909} Q)$ is a series, and vice versa (*204·5); that if $P$ is a series to which $x$ does not belong, $P \unicode{x21f8} x$ and $x \unicode{x21f7} P$ are series, and vice versa (*204·51); that if $P$ is a series of mutually exclusive series, its sum $\Sigma ʻP$ is a series (*204·52); that if $P$ , $Q$ are series, so is $P \times Q$ (*204·55); that if $P$ is a series of series, $\Pi ʻP$ is contained in diversity and is transitive (*204·561), while if $P$ is also well-ordered, i.e. such that every existent sub-class of $CʻP$ has a first term, then $\Pi ʻP$ is a series (*204·57); and that if $P$ and $Q$ are series, and $Q$ is well-ordered, then $P^{Q}$ and $P \,\text{exp}\,\, Q$ are series (*204·59). These propositions are essential to ordinal arithmetic, but they will not be referred to again until we reach that stage (Sections D and E of this Part).

We have next a collection of propositions (*204·6—·65) on $pʻ\overrightarrow{P}ʻʻ\alpha$ for various values of $\alpha$ , and finally three propositions on $P_{1}$ . Two of these are much used, namely

*204·71. $\vdash : P \in \text{Ser} . xP_{1}y . \supset . \overrightarrow{P}ʻy = \overrightarrow{P}ʻx \cup {℩}ʻx$

*204·01. $\text{Ser} = \text{Rl}ʻJ \cap \text{trans} \cap \text{connex} \quad\text{Df}$

*204·1. $\begin{align}\vdash : P \in \text{Ser} . &\equiv . P \,\unicode{x2abd}\, J . P^{2} \,\unicode{x2abd}\, P . P \in \text{connex}.\\ &\equiv . P \in \text{Rl}ʻJ . P \in \text{trans} . P \in \text{connex} \quad[(*204·01)]\end{align}$

*204·11. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser} . \equiv : P \,\unicode{x2abd}\, J . P^{2} \,\unicode{x2abd}\, P : x \in CʻP . \supset _{x} . \overrightarrow{P}ʻx \cup {℩}ʻx \cup \overleftarrow{P}ʻx = CʻP\\ &[*204·1 . *202·101]\end{align}$

*204·12. $\begin{align}\vdash \colon\colon P \in \text{Ser} . \equiv \colon\ldotp P \,\unicode{x2abd}\, &J . P^{2} \,\unicode{x2abd}\, P \colon\ldotp x, y \in CʻP . \supset _{x, y} :\\ &xPy . \lor . x = y . \lor . yPx \quad[*204·1 . *202·103]\end{align}$

*204·121. $\begin{align}\vdash \colon\colon P \in \text{Ser} . \equiv \colon\ldotp P \,\unicode{x2abd}\, J . P^{2} \,\unicode{x2abd}\, &P \colon\ldotp x, y \in CʻP . x \neq y . \supset _{x, y} :\\ &xPy . \lor . yPx \quad[*204·1 . *202·104]\end{align}$

*204·13. $\vdash :P\in \text{Ser}.\supset .P^{2}\,\unicode{x2abd}\, J.P\dot{\cap} \breve{P} = \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*204·1.*23·44.\supset \vdash :P\in \text{Ser}.\supset .P^{2}\,\unicode{x2abd}\, J.P\in \text{trans} &\qquad \text{(1)}\\ \vdash .(1).*201·12.\supset \vdash .\text{Prop} \end{array}$

*204·14. $\begin{align}&\vdash :P\in \text{Ser}. \equiv .P\dot{\cap} \breve{P} = \dot{\Lambda} .P^{2}\,\unicode{x2abd}\, P.P\in \text{connex} \\ &[*204·1.*50·47]\end{align}$

*204·15. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.P^{3}\,\unicode{x2abd}\, J.\supset .P\in \text{trans}$

Dem. $\begin{array}{l} \vdash .*34·5. &\supset \vdash \colon\ldotp P^{2}\,\unicode{x2abd}\, J.\supset :xPy.yPz.\supset .x \neq z &\qquad \text{(1)}\\ \vdash .*50·41. &\supset \vdash \colon\ldotp P^{3}\,\unicode{x2abd}\, J.\supset :xPy.yPz.\supset .{\sim}(zPx) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash \colon\ldotp \text{Hp}.&\supset :xPy.yPz.\supset .x \neq z.{\sim}(zPx).\\ [*202·103] &\supset .xPz\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*204·151. $\begin{align}&\vdash :P\in \text{connex} .P_{\text{po}}\,\unicode{x2abd}\, J.\supset .P\in \text{trans}\\ &[*204·15.*91·502·503·511]\end{align}$

*204·16. $\begin{align}&\vdash :P\in \text{Ser}. \equiv .P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.P^{3}\,\unicode{x2abd}\, J. \equiv .P\in \text{connex} .P_{\text{po}}\,\unicode{x2abd}\, J\\ &[*204·15·151.*200·36.*201·18]\end{align}$

We have also $\vdash :P\in \text{Ser}. \equiv .P\in \text{connex} .P^{6}\,\unicode{x2abd}\, J.$ For, by *200·37, since $P^{6} = (P^{2})^{3} = (P^{3})^{2}$ , it follows that $P^{6}\,\unicode{x2abd}\, J.\supset .P^{2}\,\unicode{x2abd}\, J.P^{3}\,\unicode{x2abd}\, J.$

A relation such as $x\downarrow y\unicode{x228d} y\downarrow z\unicode{x228d} z\downarrow x$ , where $x \neq y.y \neq z.z \neq x$ , satisfies $P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J$ , but not $P^{3}\,\unicode{x2abd}\, J$ . On the other hand, $x\downarrow y\unicode{x228d} y\downarrow z\unicode{x228d} z\downarrow w\unicode{x228d} w\downarrow x$ satisfies $P^{2}\,\unicode{x2abd}\, J.P^{3}\,\unicode{x2abd}\, J$ , but not $P\in \text{connex}$ .

*204·2. $\vdash :P\in \text{Ser}. \equiv .\breve{P} \in \text{Ser} \quad[*200·11.*201·11.*202·11]$

*204·21. $\begin{align}&\vdash :P\in \text{Ser}.P \,\,\text{smor}\, \,Q.\supset .Q\in \text{Ser}\\ &[*200·211.*201·211.*202·211]\end{align}$

*204·22. $\vdash :P\in \text{Ser}.\supset .\text{Nr}ʻP\subset \text{Ser} \quad[*204·21]$

*204·23. $\begin{align}&\vdash :P\in \text{Ser}. \equiv .\text{N}_{0}\text{r}ʻP\subset \text{Ser}. \equiv .\exists !\text{N}_{0}\text{r}ʻP\cap \text{Ser}\\ &[*200·22.*201·22.*202·22]\end{align}$

*204·25. $\vdash :x \neq y. \equiv . x\downarrow y \in \text{Ser} \quad[*200·31.*201·31.*202·31]$

*204·26. $\begin{align}&\vdash :x \neq y.x \neq z.y \neq z.\supset .x\downarrow y\unicode{x21f8} z\in \text{Ser}\\ &[*200·31·41.*201·411.*202·411]\end{align}$

The three following propositions deal with couples. Couples often require special treatment, owing to the fact that, if $P$ is a couple, $P\unicode{x0294f}\text{D}ʻP =\dot{\Lambda}$ , so that $Cʻ(P\unicode{x0294f}\text{D}ʻP) \neq\text{D}ʻP$ , whereas in any other case, if $P$ is[Pg 550] a series, $Cʻ(P\unicode{x0294f}\text{D}ʻP)=\text{D}ʻP$ . Hence the following propositions are often required.

*204·27. $\vdash :P\in \text{Ser}.xPy.\text{D}ʻP={℩}ʻx.\supset .P=x\downarrow y$

Dem. $\begin{array}{l} \vdash .*33·14. \supset \vdash :\text{Hp}.zPw.&\supset .z=x &\qquad \text{(1)}\\ \vdash .(1).*50·24. \supset \vdash :\text{Hp}.zPw.&\supset .w\neq x.\\ \left[(1).\text{Transp} \frac{w,\,y}{z,\,w}\right] &\supset .{\sim}(wPy) &\qquad \text{(2)}\\ \vdash .(1).\text{Transp}.*50·24.&\supset \vdash :\text{Hp}.\supset .{\sim}(yPw) &\qquad \text{(3)}\\ \vdash .(2).(3).*204·12. &\supset \vdash :\text{Hp}.zPw.\supset .y=w &\qquad \text{(4)}\\ \vdash .(1).(4).&\supset \vdash \colon\ldotp \text{Hp}.\supset :zPw.\supset .z=x.y=w &\qquad \text{(5)}\\ \vdash .(5).*55·34.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*204·27.\supset \vdash :\text{Hp}.&\supset .(\exists x,y).P=x\downarrow y.\\ [*204·25] &\supset .(\exists x,y).x\neq y.P=x\downarrow y.\\ [*56·11] &\supset .P\in 2_r:\supset \vdash .\text{Prop} \end{array}$

*204·272. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.\supset :\text{D}ʻP\in 1.\equiv .P\in 2_r.\equiv .\text{ᗡ}ʻP\in 1\\ &[*204·271·2.*56·111]\end{align}$

*204·3. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.x,y\in CʻP.\supset :x\neq y.{\sim}(yPx).\equiv .xPy\\ &[*202·5.*204·13]\end{align}$

*204·32. $\vdash \colon\ldotp P\in \text{Ser}.x,y\in CʻP.\supset :\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx.\equiv .y\in \overrightarrow{P}ʻx\cup {℩}ʻx$

Dem. $\begin{array}{l} \vdash .*204·1. \supset \vdash \colon\ldotp \text{Hp}.&\supset :yPx.zPy.\supset .zPx:\\ [*32·18] &\supset :y\in \overrightarrow{P}ʻx.\supset .\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx &\qquad \text{(1)}\\ \vdash .*22·42. &\supset \vdash :y=x.\supset .\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \overrightarrow{P}ʻx\cup {℩}ʻx.\supset .\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash .*204·11. &\supset \vdash \colon\ldotp \text{Hp}.\supset :y{\sim}\in \overrightarrow{P}ʻx\cup {℩}ʻx.\supset .y\in \overleftarrow{P}ʻx.\\ [*32·18·181] & \supset .x\in \overrightarrow{P}ʻy &\qquad \text{(4)}\\ \vdash .*50·24. &\supset \vdash :\text{Hp}.\supset .x{\sim}\in \overrightarrow{P}ʻx &\qquad \text{(5)}\\ \vdash .(4).(5). &\supset \vdash \colon\ldotp \text{Hp}.\supset :y{\sim}\in \overrightarrow{P}ʻx\cup {℩}ʻx.\supset .{\sim}(\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx) &\qquad \text{(6)}\\ \vdash .(3).(6). &\supset \vdash .\text{Prop} \end{array}$

*204·33. $\vdash \colon\ldotp P\in \text{Ser}.x,y\in CʻP.\supset :x\neq y.\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx.\equiv .yPx$

Dem. $\begin{array}{l} \vdash .*204·32.\supset \vdash \colon\ldotp \text{Hp}.\supset :x\neq y.\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻx.&\equiv .x\neq y.y\in \overrightarrow{P}ʻx\cup {℩}ʻx.\\ [*51·15] &\equiv .x\neq y.y\in \overrightarrow{P}ʻx.\\ [\text{Hp}.*4·71] &\equiv .yPx\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The three following propositions only require $P\in \text{Rl}ʻJ\cap\text{connex}$ , but are required for application to series, and are therefore convenient in the form here given.

*204·331. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.x,y\in CʻP.\supset :\overrightarrow{P}ʻx=\overrightarrow{P}ʻy.\equiv .x=y\\ &[*202·161.*71·55]\end{align}$

*204·34. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{P}\upharpoonright CʻP\in 1\rightarrow 1.\overrightarrow{P}\upharpoonright CʻP\in (\overrightarrow{P}^{;}P)\overline{\,\text{smor}\,} P \quad[*202·161]$

*204·35. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{P}^{;}P\,\,\text{smor}\,\,P \quad[*204·34]$

This proposition shows that the series of segments which have upper limits is like the original series, for a segment whose upper limit is $x$ is $\overrightarrow{P}ʻx$ , and the series of such segments is $\overrightarrow{P}^{;}P$ .

The following propositions (*204·4—·44) are concerned with relations with limited fields.

*204·4. $\vdash :P\in \text{Ser}.\supset .P\unicode{x0294f}\alpha \in \text{Ser} \quad[*200·33.*201·33.*202·33]$

*204·41. $\vdash :P,Q\in \text{Ser}.Q\,\unicode{x2abd}\, P.\supset .Q=P\unicode{x0294f}CʻQ \quad[*202·53.*204·13]$

In virtue of the above two propositions, the series contained in a given series are the relations resulting from limitations of the field; the process of limiting the field is merely the process of selecting a part of the original series without changing the order.

*204·42. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.\supset :Q\in \text{Ser}.Q\,\unicode{x2abd}\, P.\equiv .(\exists \alpha ).Q=P\unicode{x0294f}\alpha .\equiv .Q\in \text{D}ʻP\unicode{x0294f}\\ &[*204·4·41]\end{align}$

*204·421. $\vdash :P\in \text{Ser}.\supset .\text{Ser}\cap \text{Rl}ʻP=\text{D}ʻP\unicode{x0294f} \quad[*204·42]$

*204·43. $\vdash :P^{2}\,\unicode{x2abd}\, P.P\,\unicode{x2abd}\, J.Q\,\unicode{x2abd}\, P.Q\in \text{connex} .\supset .Q\in \text{Ser}$

Dem. $\begin{array}{l} \vdash .*23·1.*34·55.\supset \vdash \colon\ldotp \text{Hp}.&\supset :xQy.yQz.\supset .xPz.\\ [*50·43.\text{Hp}] &\supset .{\sim}(zPx).x\neq z.\\ [*23·81.\text{Hp}] &\supset .{\sim}(zQx).x\neq z.\\ [*202·103] &\supset .xQz:\\ [*34·55] &\supset :Q^{2}\,\unicode{x2abd}\, Q &\qquad \text{(1)}\\ \vdash .*23·44.&\supset \vdash :\text{Hp}.\supset .Q\,\unicode{x2abd}\, J &\qquad \text{(2)}\\ \vdash .(1).(2).*204·1.\supset \vdash .\text{Prop} \end{array}$

*204·44. $\vdash :P\in \text{Rl}ʻJ\cap \text{trans}.\supset .\text{Rl}ʻP\cap \text{connex} \subset \text{Ser} \quad[*204·43]$

The following propositions (*204·45—*204·483) are concerned with the division of a series into two parts, one of which wholly precedes the other. The case where one of the parts consists of a single term requires special treatment, and so does the case where both parts consist of single terms, i.e. where the series is a couple.

*204·45. $\begin{align}\vdash :P\in \text{connex} .&\alpha \in \text{Cl}ʻCʻP-1.Pʻʻ\alpha \subset \alpha .\beta =CʻP-\alpha .\beta {\sim}\in 1.\supset .\\ &P=P\unicode{x0294f}\alpha \unicode{x2909}P\unicode{x0294f}\beta .\text{Nr}ʻP=\text{Nr}ʻP\unicode{x0294f}\alpha \dot{+} \text{Nr}ʻP\unicode{x0294f}\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*24·411.*33·17.\supset \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp \\ &xPy.\equiv :y\in \alpha .xPy.\lor.x\in \alpha .y\in \beta .xPy.\lor.x,y\in \beta .xPy &\qquad \text{(1)}\\ \vdash .*37·17. &\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \alpha .xPy.\supset .x\in \alpha &\qquad \text{(2)}\\ \vdash .(2).\text{Transp}.*202·103. &\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \alpha .x\in \beta .\supset .yPx &\qquad \text{(3)}\\ \vdash .*202·55. & \supset \vdash :\text{Hp}.\supset .\alpha =CʻP\unicode{x0294f}\alpha .\beta =CʻP\unicode{x0294f}\beta &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \\ xPy.&\equiv :x(P\unicode{x0294f}\alpha )y.\lor.x\in CʻP\unicode{x0294f}\alpha .y\in CʻP\unicode{x0294f}\beta .\lor.x(P\unicode{x0294f}\beta )y:\\ [*160·1] &\equiv :x{P\unicode{x0294f}\alpha \unicode{x2909}P\unicode{x0294f}\beta }y &\qquad \text{(5)}\\ \vdash .(5).*180·32.&\supset \vdash :\text{Hp}.\supset .\text{Nr}ʻP=\text{Nr}ʻP\unicode{x0294f}\alpha \dot{+} \text{Nr}ʻP\unicode{x0294f}\beta &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*204·46. $\begin{align}\vdash :P\in \text{connex} .&\text{E}!BʻP.\text{ᗡ}ʻP{\sim}\in 1.\supset .\\ &P=BʻP\unicode{x21f7}P\unicode{x0294f}\text{ᗡ}ʻP.\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻ(P\unicode{x0294f}\text{ᗡ}ʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*202·524. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x=BʻP.y\in \text{ᗡ}ʻP.\supset .xPy &\qquad \text{(1)}\\ \vdash .(1).*161·111.\supset \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x(BʻP\unicode{x21f7}P\unicode{x0294f}\text{ᗡ}ʻP)y.\equiv :\\ &x=BʻP.y\in \text{ᗡ}ʻP.xPy.\lor.x,y\in \text{ᗡ}ʻP.xPy:\\ [*93·103] &\equiv :x\in CʻP.y\in \text{ᗡ}ʻP.xPy:\\ [*33·14·17] &\equiv :xPy &\qquad \text{(2)}\\ \vdash .(2).*181·32. &\supset \vdash :\text{Hp}.\supset .\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻ(P\unicode{x0294f}\text{ᗡ}ʻP) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*204·461. $\begin{align}\vdash :P\in \text{connex} .&\text{E}!Bʻ\breve{P} .\text{D}ʻP{\sim}\in 1.\supset .\\ &P=P\unicode{x0294f}\text{D}ʻP\unicode{x21f8} Bʻ\breve{P} .\text{Nr}ʻP=\text{Nr}ʻ(P\unicode{x0294f}\text{D}ʻP)\dot{+} \dot{1}\\ &[\text{Proof as in *204·46}]\end{align}$

*204·462. $\begin{align}\vdash \colon\ldotp P,Q\in &\text{connex} .\text{E}!BʻP.\text{ᗡ}ʻP{\sim}\in 1.\text{E}!BʻQ.\text{ᗡ}ʻQ{\sim}\in 1.\supset :\\ &P\,\,\text{smor}\,\,Q.\equiv .P\unicode{x0294f}\text{ᗡ}ʻP\,\,\text{smor}\,\,Q\unicode{x0294f}\text{ᗡ}ʻQ \quad[*161·33.*204·46]\end{align}$

*204·463. $\begin{align}\vdash :P,Q\in &\text{Rl}ʻJ.\text{E}!BʻP.\text{ᗡ}ʻP\in 1.\text{E}!.BʻQ.\text{ᗡ}ʻQ\in 1.\supset .\\ &P\,\,\text{smor}\,\,Q.P\unicode{x0294f}\text{ᗡ}ʻP\,\,\text{smor}\,\,Q\unicode{x0294f}\text{ᗡ}ʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*56·37. &\supset \vdash :\text{Hp}.\supset .P,Q\in 2_{r} &\qquad \text{(1)}\\ \vdash .*200·35.&\supset \vdash :\text{Hp}.\supset .P\unicode{x0294f}\text{ᗡ}ʻP=\dot{\Lambda} .Q\unicode{x0294f}\text{ᗡ}ʻQ=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).*153·202·101.\supset \\ \vdash :\text{Hp}.&\supset .P\,\,\text{smor}\,\,Q.P\unicode{x0294f}\text{ᗡ}ʻP\,\,\text{smor}\,\,Q\unicode{x0294f}\text{ᗡ}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*204·47. $\begin{align}\vdash \colon\ldotp P,Q\in \text{connex} \cap \text{Rl}ʻJ.\text{E}!BʻP.&\text{E}!BʻQ.\supset :\\ P\,\,\text{smor}\,\,Q.\equiv .P\unicode{x0294f}\text{ᗡ}ʻrP\,\,\text{smor}\,\,Q\unicode{x0294f}\text{ᗡ}ʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*151·18.*200·35.*202·55.*153·102.\supset \\ \vdash :\text{Hp}.\text{ᗡ}ʻP\in 1.\text{ᗡ}ʻQ{\sim}\in 1.\supset .{\sim}(P\,\,\text{smor}\,\,Q).{\sim}(P\unicode{x0294f}\text{ᗡ}ʻP\,\,\text{smor}\,\,Q\unicode{x0294f}\text{ᗡ}ʻQ) &\qquad \text{(1)}\\ \vdash .(1).*204·462·463.\supset \vdash .\text{Prop} \end{array}$

*204·48. $\begin{align}\vdash \colon\colon &P\in \text{Ser}.\supset \colon\ldotp \\ &\text{E}!BʻP.\equiv :(\exists Q).\dot{\exists} !Q.\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ.\lor.\text{Nr}ʻP=2_{r}\end{align}$

Dem. $\begin{array}{l} \vdash .*204·46. &\supset \vdash :\text{Hp}.\text{E}!BʻP.\text{ᗡ}ʻP{\sim}\in 1.\supset .(\exists Q).\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ &\qquad \text{(1)}\\ \vdash .*161·2. &\supset \vdash :\dot{\exists} !P.\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ.\supset .\dot{\exists} !Q &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\text{E}!BʻP.\text{ᗡ}ʻP{\sim}\in 1.\supset .\\ &(\exists Q).\dot{\exists} !Q.\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ &\qquad \text{(3)}\\ \vdash .*204·272.&\supset \vdash :\text{Hp}.\text{ᗡ}ʻP\in 1.\supset .P\in 2_{r} &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\text{Hp}.\text{E}!BʻP.\supset :\\ &(\exists Q).\dot{\exists} !Q.\text{Nr}ʻP=\dot{1} +\text{Nr}ʻQ.\lor.\text{Nr}ʻP=2_{r} &\qquad \text{(5)}\\ \vdash .*181·11·12·32.&\supset \vdash :\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ.\supset .\\ &(\exists R,z).R\,\,\text{smor}\,\,Q.z{\sim}\in CʻR.\text{Nr}ʻP=\text{Nr}ʻ(z\unicode{x21f8} R) &\qquad \text{(6)}\\ \vdash .*161·15·12.\supset \vdash \colon\ldotp \dot{\exists} !R.z{\sim}\in CʻR.&\supset :\text{E}!Bʻ(z\unicode{x21f8} R):\\ [*151·5] &\supset :\text{Nr}ʻP=\text{Nr}ʻ(z\unicode{x21f8} R).\supset .\text{E}!BʻP &\qquad \text{(7)}\\ \vdash .(6).(7). &\supset \vdash :\text{Nr}ʻP=\dot{1} \dot{+} \text{Nr}ʻQ.\dot{\exists} !Q.\supset .\text{E}!BʻP &\qquad \text{(8)}\\ \vdash .*153·281.&\supset \vdash :P\in 2_{r}.\supset .\text{E}!BʻP &\qquad \text{(9)}\\ \vdash .(5).(8).(9).\supset \vdash .\text{Prop} \end{array}$

*204·481. $\begin{align}\vdash \colon\colon P\in &\text{Ser}.\supset \colon\ldotp \\ &\text{E}!Bʻ\breve{P} .\equiv :(\exists Q).\dot{\exists} !Q.\text{Nr}ʻP=\text{Nr}ʻQ\dot{+} \dot{1} .\lor.\text{Nr}ʻP=2_{r}\\ &[\text{Proof as in *204·48}]\end{align}$

*204·482. $\begin{align}\vdash \colon\colon\alpha \in \text{N}_{0}\text{r}ʻʻ\text{Ser}.\supset \colon\ldotp \alpha &\subset \text{ᗡ}ʻB:\equiv :\exists !\alpha \cap \text{ᗡ}ʻB:\\ &\equiv :(\exists \beta ).\beta \in \text{NR}-{℩}ʻ0_{r}.\alpha =\dot{1} \dot{+} \beta .\lor.\alpha =2_{r}\end{align}$

Dem. $\begin{array}{l} \vdash .*151·5.*155·13.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \subset \text{ᗡ}ʻB.\equiv .\exists !\alpha \cap \text{ᗡ}ʻB &\qquad \text{(1)}\\ \vdash .*204·23·48. &\supset \vdash \colon\colon \text{Hp}.P\in \alpha .\supset \colon\ldotp \\ &\text{E}!BʻP.\equiv :(\exists \beta ).\beta \in \text{NR}-{℩}ʻ0_{r}.\alpha =\dot{1} \dot{+} \beta .\lor.\alpha =2_{r} &\qquad \text{(2)}\\ \vdash .(1).(2).*202·52.\supset \vdash .\text{Prop} \end{array}$

*204·483. $\begin{align}\vdash \colon\colon\alpha \in \text{N}_{0}\text{r}ʻʻ\text{Ser}.\supset \colon\ldotp \alpha &\subset \text{ᗡ}ʻ(B\mid \text{Cnv}):\equiv :\exists !\alpha \cap \text{ᗡ}ʻ(B\mid \text{Cnv}):\\ &\equiv :(\exists \beta ).\beta \in \text{NR}-{℩}ʻ0_{r}.\alpha =\beta \dot{+} \dot{1} .\lor.\alpha =2_{r}\\ [\text{Proof as in *204·482}]\end{align}$

The following propositions are concerned with the application of relation-arithmetic to series.

*204·5. $\begin{align}&\vdash :P,Q\in \text{Ser}.CʻP\cap CʻQ=\Lambda .\equiv .P\unicode{x2909}Q\in \text{Ser}\\ &[*200·4.*201·401.*202·401]\end{align}$

*204·51. $\begin{align}&\vdash :P\in \text{Ser}.x{\sim}\in CʻP.\equiv .P\unicode{x21f8} x\in \text{Ser}.\equiv .\chi\unicode{x21f7}P\in \text{Ser}\\ &[*200·41.*201·41.*202·412]\end{align}$

*204·52. $\vdash :P\in \text{Rel}^{2}\text{excl}\cap \text{Ser}.CʻP\subset \text{Ser}.\supset .\Sigma ʻP \in \text{Ser}$

Dem. $\begin{array}{l} \vdash .*200·42.*202·62.\supset \vdash :\eta P .\supset .\Sigma ʻP\,\unicode{x2abd}\, J &\qquad \text{(1)}\\ \vdash .(1).*201·42.*202·42.\supset \vdash .\text{Prop} \end{array}$

*204·53. $\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\dot{\Lambda} {\sim}\in CʻP.\supset :\Sigma ʻP\in \text{Ser}.\equiv .P\in \text{Ser}.CʻP\subset \text{Ser}$

Dem. $\begin{array}{l} \vdash .*200·423. \supset \vdash \colon\ldotp \text{Hp}.\Sigma ʻP\in \text{Ser}.&\supset :P\,\unicode{x2abd}\, J: &\qquad \text{(1)}\\ [*200·421] &\supset :Q\in CʻP.\supset .Q=(\Sigma ʻP)\unicode{x0294f}CʻQ.\\ [*204·4] &\supset .Q\in \text{Ser} &\qquad \text{(2)}\\ \vdash .*162·13.\supset \\ \vdash \colon\ldotp \text{Hp}.\Sigma ʻP\in \text{Ser}.QPR.RPS.x\in CʻQ.y\in CʻR.z\in CʻS.&\supset :x(\Sigma ʻP)z: &\qquad \text{(3)}\\ [*162·13.*163·11] &\supset :(\exists M,N).MPN.x\in CʻM.z\in CʻN.M=Q.N=S.\lor.\\ &(\exists M).M\in CʻP.xMz.M=Q.M=S:\\ [*13·22·195] &\supset :QPS.\lor.Q=S &\qquad \text{(4)}\\ \vdash .(3).*50·24.*24·37. \supset \vdash :\text{Hp}(3).&\supset .CʻQ\cap CʻS=\Lambda .\\ [*24·57.*30·37] &\supset .Q\neq S &\qquad \text{(5)}\\ \vdash .(4).(5). \supset \vdash \colon\ldotp \text{Hp}.\Sigma ʻP\in \text{Ser}.&\supset :QPR.RPS.\supset .QPS &\qquad \text{(6)}\\ \vdash .*162·1. \supset \vdash \colon\ldotp \text{Hp}.\Sigma ʻP\in \text{Ser}.&Q,R\in CʻP.x\in CʻP.y\in CʻQ.Q\neq R.\supset :x\neq y:\\ [*202·104] &\supset :x(\Sigma ʻP)y.\lor.y(\Sigma ʻP)x:\\ [*162·13.*163·11] &\supset :QPR.\lor.RPQ &\qquad \text{(7)}\\ \vdash .(6).(7).& \supset \vdash :\text{Hp}.\Sigma ʻP\in \text{Ser}.\supset . P\in \text{trans}\cap \text{connex} &\qquad \text{(8)}\\ \vdash .(1).(2).(8).*204·52.\supset \vdash .\text{Prop} \end{array}$

*204·54. $\vdash :P\in \text{Rel}^{3}\text{arithm}\cap \text{Ser}.CʻP\subset \text{Ser}.Cʻ\Sigma ʻP\subset \text{Ser}.\supset .\Sigma ʻ\Sigma ʻP\in \text{Ser}$

Dem. $\begin{array}{l} \vdash .*204·52.&\supset \vdash :\text{Hp}.\supset .\Sigma ʻP\in \text{Ser} &\qquad \text{(1)}\\ \vdash .*174·3. &\supset \vdash :\text{Hp}.\supset .\Sigma ʻP\in \text{Rel}^{2}\text{excl} &\qquad \text{(2)}\\ \vdash .(1).(2).*204·52.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*165·27.*204·22. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\dot{\exists} !P.\supset .P\downarrow_{.,} ^{;}Q\in \text{Ser} &\qquad \text{(1)}\\ \vdash .*165·26.*204·22. &\supset \vdash :\text{Hp}.\supset .CʻP\downarrow_{.,} ^{;}Q\subset \text{Ser}. &\qquad \text{(2)}\\ \vdash .(1).(2).*165·21.*204·52.\supset \vdash :\text{Hp}.\dot{\exists} !P.&\supset .\Sigma ʻP\downarrow_{.,} ^{;}Q\in \text{Ser}.\\ [*166·1] &\supset .Q\times P\in \text{Ser} &\qquad \text{(3)}\\ \vdash .*166·13.*204·24. &\supset \vdash :P=\dot{\Lambda} .\supset .Q\times P\in \text{Ser} &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*204·551. $\vdash \colon\ldotp \dot{\exists} !P.\dot{\exists} !Q.\supset :P\times Q\in \text{Ser}.\equiv .P,Q\in \text{Ser}$

Dem. $\begin{array}{l} \vdash .*165·21·212. \supset \vdash \colon\ldotp \text{Hp}.&\supset :P\downarrow_{.,} ^{;}Q\in \text{Rel}^{2}\text{excl}.\dot{\Lambda} {\sim}\in CʻP\downarrow_{.,} ^{;}Q:\\ [*204·53.*166·1] \supset :P\times Q\in \text{Ser}.&\equiv .P\downarrow_{.,} ^{;}Q\in \text{Ser}.CʻP\downarrow_{.,} ^{;}Q\subset \text{Ser}.\\ [*165·27.*204·22] &\equiv .P,Q\in \text{Ser}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*204·56. $\vdash :CʻP\subset \text{Rl}ʻJ.\supset .\Pi ʻP\,\unicode{x2abd}\, J$

Dem. $\begin{array}{l} \vdash .*172·11. &\supset \vdash :M(\Pi ʻP)N.\supset .(\exists Q).Q\in CʻP.(MʻQ)Q(NʻQ) &\qquad \text{(1)}\\ \vdash .(1). \supset \vdash \colon\ldotp \text{Hp}.\supset :M(\Pi ʻP)N.&\supset .(\exists Q).MʻQ\neq NʻQ.\\ [*30·37.\text{Transp}] &\supset .M\neq N\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*204·561. $\vdash :P\in \text{Ser}.CʻP\subset \text{Ser}.\supset .\Pi ʻP\in \text{Rl}ʻJ\cap \text{trans}$

Dem. $\begin{array}{l} \vdash .*200·43. &\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp L(\Pi ʻP)M.M(\Pi ʻP)N.\supset :\\ &(\exists Q,R).Q,R\in CʻP.(LʻQ)Q(MʻQ).(MʻR)R(NʻR).L\upharpoonright \overrightarrow{P}ʻQ=M\upharpoonright \overrightarrow{P}ʻQ.\\ &M\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR:\\ [*204·12] &\supset :(\exists Q,R):Q=R.\lor.QPR.\lor.RPQ:(LʻQ)Q(MʻQ).(MʻR)R(NʻR).\\ &L\upharpoonright \overrightarrow{P}ʻQ=M\upharpoonright \overrightarrow{P}ʻQ.M\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR &\qquad \text{(1)}\\ \vdash .*204·1. &\supset \vdash :\text{Hp}.L(\Pi ʻP)M.M(\Pi ʻP)N.\\ &Q=R.(LʻQ)Q(MʻQ).(MʻR)R(NʻR).L\upharpoonright \overrightarrow{P}ʻQ=M\upharpoonright \overrightarrow{P}ʻQ.\\ &M\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR.\supset .(LʻQ)Q(NʻQ).L\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ &\qquad \text{(2)}\\ \vdash .*204·33.\supset \\ &\vdash :\text{Hp}.L(\Pi ʻP)M.M(\Pi ʻP)N.QPR.(LʻQ)Q(MʻQ).(MʻR)R(NʻR).\\ &L\upharpoonright \overrightarrow{P}ʻQ=M\upharpoonright \overrightarrow{P}ʻQ.M\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR.\supset .\\ &L\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ.MʻQ=NʻQ.\\ [*13·12] &\supset .L\upharpoonright \overrightarrow{P}ʻQ=N\upharpoonright \overrightarrow{P}ʻQ.(LʻQ)Q(NʻQ) &\qquad \text{(3)}\\ \vdash .*204·33.\supset\\ &\vdash :\text{Hp}.L(\Pi ʻP)M.M(\Pi ʻP)N.RPQ.(LʻQ)Q(MʻQ).(MʻR)R(NʻR).\\ &L\upharpoonright \overrightarrow{P}ʻQ=M\upharpoonright \overrightarrow{P}ʻQ.M\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR.\supset .\\ &L\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR.LʻR=MʻR.\\ [*13·12] &\supset .L\upharpoonright \overrightarrow{P}ʻR=N\upharpoonright \overrightarrow{P}ʻR.(LʻR)R(NʻR) &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).*200·43.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :L(\Pi ʻP)M.M(\Pi ʻP)N.\supset .L(\Pi ʻP)N &\qquad \text{(5)}\\ \vdash .(5).*204·56.\supset \vdash .\text{Prop} \end{array}$

In order to prove that $\Pi ʻP$ is connected, we require a further hypothesis, namely that $P$ is well-ordered, i.e. that every class contained in $CʻP$ and not null has a first term.

*204·562. $\vdash \colon\ldotp CʻP\subset ʻ\text{Ser}:\alpha \subset CʻP.\exists !\alpha .\supset _{\alpha }.\exists !\alpha -\breve{P} ʻʻ\alpha :\supset .\Pi ʻP\in \text{connex}$

Dem. $\begin{array}{l} \vdash .*172·1.*33·45.\text{Transp}.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp M,N\in Cʻ&\Pi ʻP.M\neq N.\supset :(\exists Q).Q\in CʻP.MʻQ\neq NʻQ:\\ [\text{Hp}] &\supset :(\exists Q):Q\in CʻP.MʻQ\neq NʻQ:RPQ.\supset _{R}.MʻR=NʻR:\\ [*204·121.*172·12] &\supset :(\exists Q):Q\in CʻP:(MʻQ)Q(NʻQ).\lor.(NʻQ)Q(MʻQ):\\ &RPQ.\supset _{R}.MʻR=NʻR:\\ [*172·11] &\supset :M(\Pi ʻP)N.\lor.N(\Pi ʻP )\mu &\qquad \text{(1)}\\ \vdash .(1).*202·104.\supset \vdash .\text{Prop} \end{array}$

*204·57. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.CʻP\subset \text{Ser}:\alpha \subset CʻP.\exists !\alpha .\supset _{\alpha }.\exists !\alpha -\breve{P} ʻʻ\alpha :\supset .\Pi ʻP\in \text{Ser}\\ &[*204·561·562]\end{align}$

*204·58. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.CʻP\subset \text{Ser}.Cʻ\Sigma ʻP\subset \text{Ser}.P\in \text{Rel}^{2}\text{excl}:\\ &\alpha \subset Cʻ\Sigma ʻP .\exists !\alpha .\supset _{\alpha }.\exists !\alpha -(\text{Cnv}ʻ\Sigma ʻP)ʻʻ\alpha :\supset .\Pi ʻ\Sigma ʻP,\Pi ʻ\Pi ^{;}P\in \text{Ser}\end{align}$

Dem. $\begin{array}{l} \vdash .*204·52. &\supset \vdash :\text{Hp}.\supset .\Sigma ʻP\in \text{Ser} &\qquad \text{(1)}\\ \vdash .(1).*204·57. &\supset \vdash :\text{Hp}.\supset .\Pi ʻ\Sigma ʻP \in \text{Ser} &\qquad \text{(2)}\\ \vdash .*174·25. &\supset \vdash :\text{Hp}.\supset .\Pi ʻ\Sigma ʻP\,\text{smor}\,\Pi ʻ\Pi ^{;}P &\qquad \text{(3)}\\ \vdash .(2).(3).*204·21. &\supset \vdash :\text{Hp}.\supset .\Pi ʻ\Pi ^{;}P\in \text{Ser} &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash .\text{Prop} \end{array}$

*204·581. $\begin{align}&\vdash :\text{Hp}*204·58.\Sigma ʻP\in \text{Rel}^{2}\text{excl}.\supset .\text{Prod}ʻ\text{Prod}^{;}P,\text{Prod}ʻ\Sigma ʻP\in \text{Ser}\\ &[*174·461·43.*204·58·21]\end{align}$

*204·59. $\begin{align}\vdash \colon\ldotp P,Q\in \text{Ser}:\alpha \subset CʻQ.\exists !\alpha .\supset _{\alpha }.\exists !\alpha -&\breve{Q} ʻʻ\alpha :\supset .\\ &P^{Q}\in \text{Ser}.(P\,\text{exp}\,\,Q)\in \text{Ser}\end{align}$

Dem. $\begin{array}{l} \vdash .*165·27·241.*204·22·24.&\supset \vdash :\text{Hp}.\supset .P\downarrow_{.,} ^{;}Q\in \text{Ser} &\qquad \text{(1)}\\ \vdash .*165·26.*204·22.&\supset \vdash :\text{Hp}.\supset .CʻP\downarrow_{.,} ^{;}Q\subset \text{Ser} &\qquad \text{(2)}\\ \vdash .*150·22.*71·47.&\supset \vdash :\beta \subset CʻP\downarrow_{.,} ^{;}Q.\exists !\beta .\supset .(\exists \alpha ).\alpha \subset CʻQ.\exists !\alpha .\beta =P\downarrow_{.,} ʻʻ\alpha :\\ [\text{Hp}] &\supset \vdash :\text{Hp}.\beta \subset CʻP\downarrow_{.,} ^{;}Q.\exists !\beta .\supset .(\exists \alpha ).\exists !\alpha -\breve{Q} ʻʻ\alpha .\beta =P\downarrow_{.,} ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*37·45.&\supset \vdash :\exists !\alpha -\breve{Q} ʻʻ\alpha .\equiv .\exists !P\downarrow_{.,} ʻʻ(\alpha -\breve{Q} ʻʻ\alpha ) &\qquad \text{(4)}\\ \vdash .(4).*71·381.*165·22.&\supset \vdash :\dot{\exists} !P.\exists !\alpha -\breve{Q} ʻʻ\alpha .\supset .\exists !P\downarrow_{.,} ʻʻ\alpha -P\downarrow_{.,} ʻʻ\breve{Q} ʻʻ\alpha &\qquad \text{(5)}\\ \vdash .*72·503.*165·22. &\supset \vdash :\dot{\exists} !P.\supset .\alpha =(\text{Cnv}ʻP\downarrow_{.,} )ʻʻP\downarrow_{.,} ʻʻ\alpha &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash :\dot{\exists} !P.\exists !\alpha -\breve{Q} ʻʻ\alpha .&\supset .\exists !P\downarrow_{.,} ʻʻ\alpha -P\downarrow_{.,} ʻʻ\breve{Q} ʻʻ(\text{Cnv}ʻP\downarrow_{.,} )ʻʻP\downarrow_{.,} ʻʻ\alpha .\\ [*165·18] &\supset .\exists !P\downarrow_{.,} ʻʻ\alpha -(\text{Cnv}ʻP\downarrow_{.,} ^{;}Q)ʻʻP\downarrow_{.,} ʻʻ\alpha &\qquad \text{(7)}\\ \vdash .(3).(7).\supset \vdash \colon\ldotp \text{Hp}.&\dot{\exists} !P.\supset :\\ &\beta \subset CʻP\downarrow_{.,} ^{;}Q.\exists !.\supset .\exists !\beta -(\text{Cnv}ʻP\downarrow_{.,} ^{;}Q)ʻʻ\beta &\qquad \text{(8)}\\ \vdash .(1).(2).(8).*204·57. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\Pi ʻP\downarrow_{.,} ^{;}Q\in \text{Ser} &\qquad \text{(9)}\\ \vdash .(9).*176·182.*204·21. & \supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .(P \,\text{exp}\,\, Q)\in \text{Ser} &\qquad \text{(10)}\\ \vdash .*176·151.*204·24. &\supset \vdash :P = \dot{\Lambda} .\supset .(P \,\text{exp}\,\, Q)\in \text{Ser} &\qquad \text{(11)}\\ \vdash .(10).(11). &\supset \vdash :\text{Hp}.\supset .(P \,\text{exp}\,\, Q)\in \text{Ser} &\qquad \text{(12)}\\ \vdash .(12).*176·181.*204·21. &\supset \vdash :\text{Hp}.\supset .P^{Q}\in \text{Ser} &\qquad \text{(13)}\\ \vdash .(12).(13).\supset \vdash .\text{Prop} \end{array}$

*204·6. $\vdash :P\in \text{trans} .\supset .\alpha \cup \breve{P} ʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*40·53.\supset \vdash \colon\colon x\in pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha . &\equiv \colon\ldotp y\in pʻ\overrightarrow{P}ʻʻ\alpha .\supset _{y}.yPx\colon\ldotp \\ [*40·51] &\equiv \colon\ldotp z\in \alpha .\supset _{z}.yPz:\supset _{y}.yPx &\qquad \text{(1)}\\ \vdash .*10·26.&\supset \vdash \colon\ldotp x\in \alpha :z\in \alpha .\supset _{z}.yPz:\supset .yPx:\\ [\text{Exp.(1)}] &\supset \vdash :x\in \alpha .\supset .x\in pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*10·1. &\supset \vdash \colon\ldotp u\in \alpha .uPx:z\in \alpha .\supset _{z}.yPz:\supset .yPu.uPx &\qquad \text{(3)}\\ \vdash .(3).*201·1.\supset \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp u\in \alpha .uPx:z\in \alpha .\supset _{z}.yPz:\supset .yPx\colon\ldotp \\ [*37·105] &\supset \colon\ldotp x\in \breve{P} ʻʻ\alpha :z\in \alpha .\supset _{z}.yPz:\supset .yPx\colon\ldotp \\ [Exp.(1)] &\supset \colon\ldotp x\in \breve{P} ʻʻ\alpha .\supset .x\in pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash .\text{Prop} \end{array}$

*204·61. $\vdash :P\in \text{Rl}ʻJ\cap \text{connex} .\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset \alpha \cup \breve{P} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*200·5.\supset \vdash :\text{Hp}.&\supset .pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) = \Lambda .\\ [*24·311] &\supset .pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\\ [*22·48] &\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset CʻP-pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*24·43.*202·505] &\subset \alpha \cup \breve{P} ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*204·62. $\vdash :P\in \text{Ser}.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) = (\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*204·6.*37·265.&\supset \vdash :\text{Hp}.\supset .(\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .*37·16.*22·43. &\supset \vdash .(\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha \subset CʻP &\qquad \text{(2)}\\ \vdash .*204·61.*22·43.&\supset \vdash :\text{Hp}.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset (\alpha \cup \breve{P} ʻʻ\alpha )\cap CʻP.\\ [*37·16] &\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset (\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*204·63. $\vdash :P\in \text{Ser}.\exists !pʻ\overrightarrow{P}ʻʻ\alpha .\supset .pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha =\alpha \cup \breve{P} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*40·65.\text{Transp}.&\supset \vdash :\text{Hp}.\supset .\alpha \subset CʻP &\qquad \text{(1)}\\ \vdash .*40·62. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P}ʻʻ\alpha \subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*204·62.\supset \vdash .\text{Prop} \end{array}$

*204·64. $\vdash :P\in \text{Ser}.x\in \text{D}ʻP.\supset .pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx=\overrightarrow{P}_{*}ʻx$

Dem. $\begin{array}{l} \vdash .*40·62. &\supset \vdash :\text{Hp}.\supset .pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx\subset CʻP &\qquad \text{(1)}\\ \vdash .*40·51.&\supset \vdash \colon\ldotp z\in pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx.\equiv :xPy.\supset _{y}.zPy &\qquad \text{(2)}\\ \vdash .(2).*50·11. \supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp z\in pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx.&\supset :xPy.\supset _{y}.z\neq y:\\ [(1).*202·103] &\supset :zPx.\lor.z=x &\qquad \text{(3)}\\<br> \vdash .*201·521. \supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp z\in \overrightarrow{P}_{*}ʻx.&\equiv :zPx.\lor.z=x: &\qquad \text{(4)}\\ [*201·1.*13·12] & \supset :xPy.\supset .zPy:\\ [(2)] &\supset :z\in pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx &\qquad \text{(5)}\\ \vdash .(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*204·65. $\vdash :P\in \text{Ser}.x\in CʻP.\supset .pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx\cap CʻP=\overrightarrow{P}_{*}ʻx$

Dem. $\begin{array}{l} \vdash .*40·2.\supset \vdash :\text{Hp}.x{\sim}\in \text{D}ʻP.\supset .pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx\cap CʻP&=CʻP\\ [*204·11] &=\overrightarrow{P}ʻx\cup \iota ʻx\\ [*201·521] &=\overrightarrow{P}_{*}ʻx &\qquad \text{(1)}\\ \vdash .*40·62.*204·64.\supset \vdash :\text{Hp}.x\in \text{D}ʻP.\supset .pʻ\overrightarrow{P}ʻʻ\overleftarrow{P}ʻx\cap CʻP&=\overrightarrow{P}_{*}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*204·7. $\vdash :P\in \text{Ser}.\supset .P_{1}\in 1\rightarrow 1 \quad[*201·63.*202·7]$

*204·71. $\vdash :P\in \text{Ser}.xP_{1}y.\supset .\overrightarrow{P}ʻy=\overrightarrow{P}ʻx\cup \iota ʻx \quad[*202·72.*201·63]$

*204·72. $\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp xP_{1}y.\equiv :xPy:xPz.z\neq y.\supset _{z}.yPz$

Dem. $\begin{array}{l} \vdash .*201·63. &\supset \vdash \colon\ldotp \text{Hp}.\supset :xP_{1}y.\supset .xPy &\qquad \text{(1)}\\ \vdash .*204·71.*121·26.\supset \vdash \colon\ldotp \text{Hp}.xP_{1}y.&\supset :\overleftarrow{P}ʻx=\overleftarrow{P}ʻy\cup \iota ʻy:\\ [*24·43.*32·181] &\supset :xPz.z\neq y.\supset _{z}.yPz &\qquad \text{(2)}\\ \vdash .*24·43.*32·181. &\supset \vdash \colon\ldotp xPz.z\neq y.\supset _{z}.yPz:\supset .\overleftarrow{P}ʻx\subset \iota ʻy\cup \overleftarrow{P}ʻy &\qquad \text{(3)}\\ \vdash .(3).*200·361. \supset \vdash \colon\ldotp \text{Hp}:xPz.z\neq y.\supset _{z}.yPz:&\supset .\overleftarrow{P}ʻx\cap \overrightarrow{P}ʻy=\Lambda .\\ [*34·11] &\supset .{\sim}(xP^{2}y) &\qquad \text{(4)}\\ \vdash .(4).\text{Fact}.\supset \vdash \colon\ldotp \text{Hp}:xPy:xPz.z\neq y.&\supset _{z}.yPz:\supset .x(P\dot{-} P^{2})y.\\ [*201·63] &\supset .xP_{1}y &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

The minimum points of a class $\alpha$ with respect to a relation $P$ are those members of $\alpha$ which belong to the field of $P$ but to which no members of $\alpha$ have the relation $P$ ; that is, they are those members of $\alpha$ which belong to $CʻP$ but have no predecessors in $\alpha$ . Similarly the maximum points of $\alpha$ are those members of $\alpha$ which belong to $CʻP$ but have no successors in $\alpha$ . Both these notions have been already defined in *93, but they were there only used for the special purpose of studying generations. Their chief utility is in connection with series, and it is in this connection that we shall now consider them. Many of the properties of maxima and minima in series do not demand the whole hypothesis " $P\in \text{Ser}$ ," but only " $P\in\text{connex}$ ." This is the case, in particular, with the fundamental property of maxima and minima in series, namely that each class has at most one maximum and one minimum. The minimum of a class, if it exists, is the first term of the class, and the maximum, if it exists, is the last term. The maxima with respect to $P$ are the minima with respect to $\breve{P}$ ; hence properties of maxima result immediately from the corresponding properties of minima, and will be set down without proof in what follows.

It will be seen that the maxima and minima of $\alpha$ depend only upon $\alpha \cap CʻP$ : the part of $\alpha$ (if any) which is not contained in $CʻP$ is irrelevant.

In accordance with the definitions of *93, the class of minima of $\alpha$ is denoted by $\overrightarrow{\text{min}}_{p}ʻ\alpha$ , where $\overrightarrow{\text{min}}_{p}ʻ\alpha =(\alpha \cap CʻP)-\breve{P} ʻʻ\alpha ,$ the definition being $\text{min}_{P}=\hat{x} \hat{\alpha} \{x\in (\alpha \cap CʻP)-\breve{P} ʻʻ\alpha\}.$ Thus $\text{min}_{P}$ is a relation contained in ${\in}$ . When $P$ is connected, we have $\overrightarrow{\text{min}}_{P}ʻ\alpha\in 0\cup 1$ , i.e. (by *71·12) $\text{min}_{P}\in 1\rightarrow \text{Cls}.$ It follows that, if $\kappa$ is a set of classes which all have minima, $\text{min}_{P}\upharpoonright \kappa$ is a selective relation for $\kappa$ , i.e. $\text{min}_{P}\upharpoonright \kappa \in {\in}_{\Delta}ʻ\kappa .$ [Pg 560] Owing to this fact, the existence of selections can sometimes be proved in dealing with series (especially with well-ordered series), in cases where such proof would be impossible if no serial arrangement were given.

The definition of $\text{min}_{P}$ is so chosen as to exclude from $\overrightarrow{\text{min}}_{P}ʻ\alpha$ whatever part of $\alpha$ is not contained in $CʻP$ , and to make $\overrightarrow{\text{min}}_{P}ʻ{℩}ʻx={℩}ʻx$ , i.e. $\text{min}_{P}ʻ{℩}ʻx=x$ , provided $x\in CʻP.{\sim}(xPx)$ . For these two reasons we have to reject two simpler definitions which might otherwise be thought preferable. One of these would give $\overrightarrow{\text{min}}_{P}ʻ\alpha =\alpha -\breve{P} ʻʻ\alpha ,$ which might be obtained by putting $\text{min}_{P}=\in \dot{-} \in \mid \breve{P} \quad\text{Df}.$ This agrees with our definition whenever $\alpha\subset CʻP$ , but not otherwise, since it includes in $\overrightarrow{\text{min}}_{P}ʻ\alpha$ any part of $\alpha$ not contained in $CʻP$ . Hence it necessitates the hypothesis $\alpha$ $\subset CʻP$ in many propositions which, with our definition, do not require this hypothesis, and in particular in the proposition $P\in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1,$ so that instead of having (as with our definition) $P\in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}\in 1\rightarrow \text{Cls}$ we should only have $P\in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}\upharpoonright \text{Cl}ʻCʻP\in 1\rightarrow \text{Cls}.$ For these reasons, this definition is less convenient than the one we have adopted.

The other definition which suggests itself is one which will give $\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{B}ʻP\unicode{x0294f}\alpha .$ If this definition were adopted, we might dispense with a special notation altogether, using $\overrightarrow{B}ʻP\unicode{x0294f}\alpha$ , $BʻP\unicode{x0294f}\alpha$ in place of $\overrightarrow{\text{min}}_{P}ʻ\alpha$ , $\text{min}_{P}ʻ\alpha$ . This definition, however, has the drawback that, if $\alpha \in 1$ and $P\,\unicode{x2abd}\, J$ , $P\unicode{x0294f}\alpha =\dot{\Lambda} ,$ so that we have $\overrightarrow{\text{min}}_{P}ʻ\alpha =\dot{\Lambda}\,\text{when}\, \alpha \in 1.\alpha \subset CʻP.$ This necessitates the addition of the hypothesis $\alpha{\sim}\in 1$ (as in *204·45 above, for example) in cases where, with our definition, no such hypothesis is required. If we take $\overrightarrow{B}ʻ\alpha \upharpoonleft P$ , instead of $\overrightarrow{B}ʻP\unicode{x0294f}\alpha$ , as the class of minimum points, we secure $\text{min}_{P}ʻ{℩}ʻx=x$ when $P\,\unicode{x2abd}\, J$ and $x\in \text{D}ʻP$ , but not when $x\in\overrightarrow{B}ʻ\breve{P}$ . Thus we still have exceptions to provide against which do not arise with the definition we have adopted.

The first few propositions of this number have already been proved in *93, but are repeated here for convenience of reference.

The propositions of this number are numerous and much used. Among the elementary properties of $\text{max}_{P}$ and $\text{min}_{P}$ with which the number begins, the following should be noted:

*205·12. $\vdash .\overrightarrow{B}ʻP=\overrightarrow{\text{min}}_{P}ʻ\text{D}ʻP=\overrightarrow{\text{min}}_{P}ʻCʻP$

*205·123. $\vdash :\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\equiv .\alpha \cap CʻP\subset Pʻʻ\alpha$

*205·14. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha =\hat{x} \{x\in \alpha \cap CʻP.\alpha \cap \overrightarrow{P}ʻx= \Lambda \}$

*205·15. $\vdash .\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha$

*205·18. $\vdash :{\sim}(xPx).x\in CʻP.\supset .\text{min}_{P}ʻ{℩}ʻx=\text{max}_{P}ʻ{℩}ʻx=x$

*205·19. $\vdash :P\in \text{trans}.\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \breve{P} ʻʻ\alpha )=\overrightarrow{\text{min}}_{P}ʻ\breve{P} _{*}ʻʻ\alpha$

Owing to this proposition, we can sometimes dispense with the hypothesis $P\,\unicode{x2abd}\, J$ in propositions about minima which would otherwise require this hypothesis.

*205·197. $\vdash \colon\ldotp P\in \text{Rl}ʻJ\cap \text{trans}.\supset :x\in CʻP.\equiv .x=\text{max}_{P}ʻ(\overrightarrow{P}ʻx\cup {℩}ʻx)$

Our next set of propositions (*205·2—·27) introduces the hypothesis that $P$ is connected, or transitive and connected. The chief of them are

*205·21. $\vdash :P\in \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .y\in \alpha \cap CʻP-{℩}ʻ\text{min}_{P}ʻ\alpha .\supset .\text{min}_{P}ʻ\alpha Py$

I.e. if the minimum of $\alpha$ exists, it precedes every other member of $\alpha \cap CʻP$ .

*205·22. $\vdash :P\in \text{trans}\cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .\supset .\breve{P} ʻʻ\alpha =\overleftarrow{P}ʻ\text{min}_{P}ʻ\alpha$

I.e. the terms which come after some part of $\alpha$ are those that come after its minimum (when the minimum exists).

*205·25. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx=(\overleftarrow{P}\dot{-} P^{2})ʻx$

*205·3. $\vdash :P\in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1.\overrightarrow{\text{max}}_{P}ʻ\alpha \in 0\cup 1$

*205·31. $\vdash :P\in \text{connex} .\supset .\text{min}_{P},\text{max}_{P}\in 1\rightarrow \text{Cls}$

*205·33. $\vdash :P\in \text{connex} .\kappa \subset \text{ᗡ}ʻ\text{min}_{P}.\supset .\text{min}_{P}\upharpoonright \kappa \in {\in}_{\Delta}ʻ\kappa$

This proposition is useful in the theory of well-ordered series. Observe that " $\kappa \subset \text{ᗡ}ʻ\text{min}_{P}$ " means that $\kappa$ consists of classes which have minima.

We have next a set of propositions (*205·4—·44) dealing with the relations of $\text{min}_{P}ʻ\alpha$ to $BʻP\unicode{x0294f}\alpha$ and $Bʻ\alpha \upharpoonleft P$ ; next we have propositions on the relations of the minima of two different classes, of which the most useful is

*205·55. $\vdash :P\in \text{connex} .BʻP\in \alpha .\supset .BʻP=\text{min}_{P}ʻ\alpha$

We have next various propositions on $pʻ\overrightarrow{P}ʻʻ(\alpha\cap CʻP)$ , of which the chief is

*205·65. $\vdash :P\in \text{trans}\cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .\supset .pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻ\text{min}_{P}ʻ\alpha$

I.e. the predecessors of the whole of a class contained in $CʻP$ are the predecessors of its minimum (if it has one).

*205·68. $\vdash :\breve{P} ʻʻ\alpha \subset \alpha .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}(P_{\text{po}})ʻ\alpha$

I.e. if $\alpha$ is a hereditary class, its minima with respect to $P$ are the same as its minima with respect to $P_{\text{po}}$ .

We prove next that if $Pʻʻ\alpha$ has a maximum, so has $\alpha$ (*205·7), and that if $P\in \text{connex}$ , only a unit class can have its maximum identical with its minimum (*205·73).

*205·8—·85 are concerned with relation-arithmetic. The chief proposition here is

*205·8. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha$

I.e. in any correlation, the minima of the correlates of a class are the correlates of the minima.

We end with two propositions on relations with limited fields. The more useful of these is

*205·9. $\vdash :P\in \text{connex} ·\kappa \subset CʻP.\kappa {\sim}\in 1.\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\kappa )ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \kappa )$

*205·1. $\vdash :x\text{min}_{P}\alpha .\equiv .x\in \alpha \cap CʻP-\breve{P} ʻʻ\alpha \quad[*93·11]$

*205·101. $\vdash :x\text{max}_{P}\alpha .\equiv .x\in \alpha \cap CʻP-Pʻʻ\alpha .\equiv .x \text{min}(\breve{P} )\alpha \quad[*93·115]$

*205·11. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha =\alpha \cap CʻP-\breve{P} ʻʻ\alpha \quad [*93·111]$

*205·111. $\vdash .\overrightarrow{\text{max}}_{P}ʻ\alpha =\alpha \cap CʻP-Pʻʻ\alpha \quad [*93·116]$

*205·12. $\vdash .\overrightarrow{B}ʻP=\overrightarrow{\text{min}}_{P}ʻ\text{D}ʻP=\overrightarrow{\text{min}}_{P}ʻCʻP \quad[*93·112]$

*205·121. $\vdash .\overrightarrow{B}ʻ\breve{P} =\overrightarrow{\text{max}}_{P}ʻ\text{ᗡ}ʻP=\overrightarrow{\text{max}}_{P}ʻCʻP \quad[*93·117]$

*205·122. $\vdash :\overrightarrow{\text{min}}_{P}ʻ\alpha =\Lambda .\equiv .\alpha \cap CʻP\subset \breve{P} ʻʻ\alpha \quad[*205·11.*24·3]$

*205·123. $\vdash :\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\equiv .\alpha \cap CʻP\subset Pʻʻ\alpha$

*205·13. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha \cup \breve{P} ʻʻ\alpha =(\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha \quad[*22·91.*205·11]$

*205·131. $\vdash .\overrightarrow{\text{max}}_{P}ʻ\alpha \cup Pʻʻ\alpha =(\alpha \cap CʻP)\cup Pʻʻ\alpha$

*205·14. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha =\hat{x} \{x\in \alpha \cap CʻP.\alpha \cap \overrightarrow{P}ʻx=\Lambda\} \quad[*37·462.*205·11]$

*205·141. $\vdash .\overrightarrow{\text{max}}_{P}ʻ\alpha =\hat{x} \{x\in \alpha \cap CʻP.\alpha \cap \overleftarrow{P}ʻx=\Lambda\}$

*205·15. $\vdash .\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha \quad[*37·265.*205·11]$

*205·151. $\vdash .\overrightarrow{\text{max}}_{P}ʻ(\alpha \cap CʻP)=\overrightarrow{\text{max}}_{P}ʻ\alpha$

*205·16. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\Lambda =\Lambda \quad[*205·11.*24·23]$

*205·17. $\begin{align}\vdash \colon\ldotp x\in (\alpha \cap CʻP).\supset _{x}.{\sim}(xPx):\alpha &\cap CʻP\in 1:\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha =\alpha \cap CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*13·14. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \alpha .xPy.\supset _{x,y}.x\neq y &\qquad \text{(1)}\\ \vdash .*52·16. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x,y\in \alpha \cap CʻP.\supset _{x,y}.x=y &\qquad \text{(2)}\\ \vdash .(1).(2).*33·17.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in \alpha .xPy.\supset _{x,y}.y{\sim}\in \alpha :\\ [*37·1] & \supset :\breve{P} ʻʻ\alpha \subset -\alpha :\\ [*22·811] &\supset :\alpha \subset -\breve{P} ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).*205·11.\supset \vdash .\text{Prop} \end{array}$

*205·18. $\vdash :{\sim}(xPx).x\in CʻP.\supset .\text{min}_{P}ʻ\iota ʻx=\text{max}_{P}ʻ\iota ʻx=x$

Dem. $\begin{array}{l} \vdash .*205·17.\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ\iota ʻx=\overrightarrow{\text{max}}_{P}ʻ\iota ʻx=\iota ʻx &\qquad \text{(1)}\\ \vdash .(1).*53·4.\supset \vdash .\text{Prop} \end{array}$

*205·181. $\vdash :xPy.{\sim}(xPx).{\sim}(yPx).\supset .\text{min}_{P}ʻ(\iota ʻx\cup \iota ʻy)=x$

Dem. $\begin{array}{l} \vdash .*37·105.&\supset \vdash :\text{Hp}.\supset .x{\sim}\in )\breve{P} ʻʻ(\iota ʻx\cup \iota ʻy).y\in \breve{P} ʻʻ(\iota ʻx\cup \iota ʻy) &\qquad \text{(1)}\\ \vdash .*33·17. &\supset \vdash :\text{Hp}.\supset .\iota ʻx\cup \iota ʻy\subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*205·11.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ(\iota ʻx\cup \iota ʻy)=\iota ʻx:\supset \vdash .\text{Prop} \end{array}$

*205·182. $\vdash :P^{2}\,\unicode{x2abd}\, J.xPy.\supset .\text{min}_{P}ʻ(\iota ʻx\cup \iota ʻy)=x$

Dem. $\begin{array}{l} \vdash .*200·36.*50·43.\supset \vdash :\text{Hp}.\supset .{\sim}(xPx).{\sim}(yPx) &\qquad \text{(1)}\\ \vdash .(1).*205·181.\supset \vdash .\text{Prop} \end{array}$

*205·183. $\begin{align}\vdash \colon\ldotp P^{2} \,\unicode{x2abd}\, J . P \in \text{connex} . &x, y \in CʻP . \supset :\\ &\text{min}_{P}ʻ({℩}ʻx \cup {℩}ʻy) = x . \lor . \text{min}_{P}ʻ({℩}ʻx \cup {℩}ʻy) = y\end{align}$

Dem. $\begin{array}{l} \vdash . *202·103 . &\supset \vdash \colon\ldotp \text{Hp} . \supset : x = y . \lor . xPy . \lor . yPx &\qquad \text{(1)}\\ \vdash . *205·18 . &\supset \vdash : \text{Hp} . x = y . \supset . \text{min}_{P}ʻ({℩}ʻx \cup {℩}ʻy) = x &\qquad \text{(2)}\\ \vdash . *205·182 . &\supset \vdash : \text{Hp} . xPy . \supset . \text{min}_{P}ʻ({℩}ʻx \cup {℩}ʻy) = x &\qquad \text{(3)}\\ \vdash . *205·182 . &\supset \vdash : \text{Hp} . yPx . \supset . \text{min}_{P}({℩}ʻx \cup {℩}ʻy) = y &\qquad \text{(4)}\\ \vdash . (1) . (2) . (3) . (4) . \supset \vdash . \text{Prop} \end{array}$

*205·19. $\vdash : P \in \text{trans} . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha = \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \breve{P} ʻʻ\alpha ) = \overrightarrow{\text{min}}_{P}ʻ\breve{P} _{*}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash . *205·11 . & \supset \vdash . \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \breve{P} ʻʻ\alpha ) = (\alpha \cup \breve{P} ʻʻ\alpha ) \cap CʻP - \breve{P} ʻʻ(\alpha \cup \breve{P} ʻʻ\alpha ) &\qquad \text{(1)}\\ \vdash . (1) . *201·55 . \supset \vdash : \text{Hp} . \supset . \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \breve{P} ʻʻ\alpha ) &= (\alpha \cup \breve{P} ʻʻ\alpha ) \cap CʻP - \breve{P} ʻʻ\alpha \\ [*22·9] &= \alpha \cap CʻP - \breve{P} ʻʻ\alpha\\ [*205·11] & = \overrightarrow{\text{min}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash . *201·52 . *37·265 . \supset \vdash : \text{Hp} . &\supset . \breve{P} _{*}ʻʻ\alpha = (\alpha \cap CʻP) \cup \breve{P} ʻʻ(\alpha \cap CʻP) .\\ [(2)] \supset . \overrightarrow{\text{min}}_{P}ʻ\breve{P} _{*}ʻʻ\alpha &= \overrightarrow{\text{min}}_{P}ʻ(\alpha \cap CʻP)\\ [*205·15] &= \overrightarrow{\text{min}}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

*205·191. $\vdash : P \in \text{trans} . \supset . \overrightarrow{\text{max}}_{P}ʻ\alpha = \overrightarrow{\text{max}}_{P}ʻ(\alpha \cup Pʻʻ\alpha) = \overrightarrow{\text{max}}_{P}ʻP_{*}ʻʻ\alpha$

*205·192. $\vdash : P \in \text{trans} . \beta \subset \breve{P} ʻʻ\alpha . \supset . \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \beta ) = \overrightarrow{\text{min}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *205·11 . *201·56 . \supset \\ \vdash : \text{Hp} . \supset . \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \beta ) &= (\alpha \cup \beta ) \cap CʻP - \breve{P} ʻʻ\alpha \\ [*22·68] & = (\alpha \cap CʻP - \breve{P} ʻʻ\alpha ) \cup (\beta \cap CʻP - \breve{P} ʻʻ\alpha )\\ [*24·3] & = \alpha \cap CʻP - \breve{P} ʻʻ\alpha \\ [*205·11] & = \overrightarrow{\text{min}}_{P}ʻ\alpha : \supset \vdash . \text{Prop} \end{array}$

*205·193. $\vdash : P \in \text{trans} . \beta \subset Pʻʻ\alpha . \supset . \overrightarrow{\text{max}}_{P}ʻ(\alpha \cup \beta ) = \overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *37·105 . &\supset \vdash . x \in \alpha . xPx . \supset . x \in \breve{P} ʻʻ\alpha &\qquad \text{(1)}\\) \vdash . (1) . \text{Transp} . &\supset \vdash : x \in \alpha - \breve{P} ʻʻ\alpha . \supset . {\sim} (xPx) &\qquad \text{(2)}\\ \vdash . (2) . *205·1 . &\supset \vdash . \text{Prop} \end{array}$

*205·196. $\vdash \colon\ldotp P\in \text{Rl}ʻJ\cap \text{trans}.\supset :x\in CʻP.\equiv .x=\text{min}_{P}ʻ({℩}ʻx\cup \overleftarrow{P}ʻx)$

Dem. $\begin{array}{l} \vdash .*205·19.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\overrightarrow{\text{min}}_{P}ʻ({℩}ʻx\cup \overleftarrow{P}ʻx)=\overrightarrow{\text{min}}_{P}ʻ{℩}ʻx:\\ [*205·18] &\supset :x\in CʻP.\supset .\text{min}_{P}ʻ({℩}ʻx\cup \overleftarrow{P}ʻx)=x &\qquad \text{(1)}\\ \vdash .*205·11.&\supset \vdash :\text{min}_{P}ʻ({℩}ʻx\cup \overleftarrow{P}ʻx)=x.\supset .x\in CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*205·197. $\vdash \colon\ldotp P\in \text{Rl}ʻJ\cap \text{trans}.\supset :x\in CʻP.\equiv .x=\text{max}_{P}ʻ(\overrightarrow{P}ʻx\cup {℩}ʻx)$

*205·2. $\vdash \colon\ldotp P\in \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .y\in \alpha \cap CʻP.\supset :\text{min}_{P}ʻ\alpha =y.\lor.\text{min}_{P}ʻ\alpha Py$

Dem. $\begin{array}{l} \vdash .*202·103. &\supset \vdash \colon\ldotp \text{Hp}.\supset :yP\,\text{min}_{P}\,ʻ\alpha .\lor.\text{min}_{P}ʻ\alpha =y.\lor.\text{min}_{P}ʻ\alpha Py &\qquad \text{(1)}\\ \vdash .*205·14. &\supset \vdash :\text{Hp}.\supset .{\sim}(yP\,\text{min}_{P}\,ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

In the remainder of the present number, when a proposition has been proved for $\text{min}_{P}$ , we shall not state the corresponding proposition for $\text{max}_{P}$ , unless it is specially important. When propositions concerning $\text{max}_{P}$ are required for reference in the sequel, we shall refer to the corresponding propositions for $\text{min}_{P}$ , in case no reference exists for $\text{max}_{P}$ .

*205·*21. $\begin{align}&\vdash :P\in \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .y\in \alpha \cap CʻP-{℩}ʻ\text{min}_{P}ʻ\alpha.\supset .\text{min}_{P}ʻ\alpha Py\\ &[*205·2]\end{align}$

*205·211. $\vdash :P\in \text{trans}\cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .y\in \breve{P} ʻʻ\alpha .\supset .\text{min}_{P}ʻ\alpha Py$

Dem. $\begin{array}{l} \vdash .*37·105. &\supset \vdash :\text{Hp}.\supset .(\exists x).x\in \alpha .xPy &\qquad \text{(1)}\\ \vdash .*13·13. &\supset \vdash :x\in \alpha .xPy.x=\text{min}_{P}ʻ\alpha .\supset .\text{min}_{P}ʻ\alpha Py &\qquad \text{(2)}\\ \vdash .*205·21. \supset \vdash :\text{Hp}.x\in \alpha .xPy.x\neq \text{min}_{P}ʻ\alpha .&\supset .\text{min}_{P}ʻ\alpha Px.xPy.\\ [\text{Hp}.*201·1] &\supset .\text{min}_{P}ʻ\alpha Py &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*205·22. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .\supset .\breve{P} ʻʻ\alpha =\overleftarrow{P}ʻ\text{min}_{P}ʻ\alpha \\ &[*205·211.*37·181]\end{align}$

*205·23. $\vdash :P\in \text{connex} .x\in \text{D}ʻP.y\in \overrightarrow{B}ʻ\breve{P} .\supset .xPy$

Dem. $\begin{array}{l} \vdash .*93·101.\supset \vdash :\text{Hp}.&\supset .x\neq y.{\sim}(yPx).\\ [*202·103] &\supset .xPy:\supset \vdash .\text{Prop} \end{array}$

*205·24. $\vdash :P\in \text{connex} .\supset .\overrightarrow{B}ʻ\breve{P} \subset pʻ\overleftarrow{P}ʻʻ\text{D}ʻP \quad[*205·23]$

*205·241. $\vdash :P\in \text{connex} .\supset .\overrightarrow{B}ʻP\subset pʻ\overrightarrow{P}ʻʻ\text{ᗡ}ʻP \quad[\text{Proof as in *205·24}]$

*205·25. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx=(\overleftarrow{P\dot{-} P^{2}})ʻx$

Dem. $\begin{array}{l} \vdash .*205·11.\supset \vdash .\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx&=\overleftarrow{P}ʻx-\breve{P} ʻʻ\overleftarrow{P}ʻx\\ [*37·301] &=\overleftarrow{P}ʻx-\overleftarrow{P}^{2}ʻx\\ [*32·31·35] &=(\overleftarrow{P\dot{-} P^{2}})ʻx.\supset \vdash .\text{Prop} \end{array}$

The following proposition is used in the theory of well-ordered series (*250·2).

*205·251. $\vdash :\exists !\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx.\equiv .x\in \text{D}ʻ(P\dot{-} P^{2}) \quad[*205·25]$

*205·252. $\vdash :\exists !\overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx.\equiv .x\in \text{ᗡ}ʻ(P\dot{-} P^{2})$

*205·253. $\vdash :P\in \text{connex} .\text{E}!BʻP.\supset .\text{ᗡ}ʻP=\overleftarrow{P}ʻBʻP \quad[*202·524]$

*205·254. $\vdash :P\in \text{connex} .\text{E}!BʻP.\supset .\overleftarrow{\text{min}}_{P}ʻ\text{ᗡ}ʻP=\overleftarrow{P\dot{-} P^{2}}ʻBʻP \quad[*205·253·25]$

*205·255. $\vdash :\exists !\overrightarrow{\text{min}}_{P}ʻ\text{ᗡ}ʻP.\supset .\exists !\overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*93·101.\supset \vdash :\overrightarrow{B}ʻP=\Lambda .&\supset .\text{D}ʻP\subset \text{ᗡ}ʻP.\\ [*37·271] &\supset .\text{ᗡ}ʻP=\breve{P} ʻʻ\text{ᗡ}ʻP.\\ [*205·122] &\supset .\overrightarrow{\text{min}}_{P}ʻ\text{ᗡ}ʻP=\Lambda &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

*205·256. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.&\supset :\\ &\text{E}!\text{min}_{P}ʻ\text{ᗡ}ʻP.\equiv .\text{E}!\breve{P} _{1}ʻBʻP.\equiv .\text{min}_{P}ʻ\text{ᗡ}ʻP=\breve{P} _{1}ʻBʻP\\ &[*205·254·255.*201·63.*202·52·7]\end{align}$

*205·26. $\vdash :Q\,\unicode{x2abd}\, P.\supset .\text{min}_{P}\upharpoonright \text{Cl}ʻCʻQ\,\unicode{x2abd}\, \text{min}_{Q}$

Dem. $\begin{array}{l} \vdash .*37·201.\supset \vdash \colon\ldotp \text{Hp}.\alpha \subset CʻQ.&\supset :\breve{Q} ʻʻ\alpha \subset \breve{P} ʻʻ\alpha .\alpha \subset CʻQ.\alpha \subset CʻP:\\ [\text{Transp}.*22·621] &\supset :\alpha - \breve{P} ʻʻ\alpha \subset \alpha -\breve{Q} ʻʻ\alpha .\alpha =\alpha \cap CʻQ=\alpha \cap CʻP:\\ [*205·11] &\supset :\overrightarrow{\text{min}}_{P}ʻ\alpha \subset \overrightarrow{\text{min}}_{Q}ʻ\alpha :\\ [*32·18] &\supset :x\text{min}_{P}\alpha .\supset .x\text{min}_{Q}\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*205·261. $\vdash :P\unicode{x0294f}\beta \in \text{connex} .\beta \cap CʻP{\sim}\in 1.\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta )$

Dem. $\begin{array}{l} \vdash .*205·11.*202·54.*37·413.*36·34.\supset \\ \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻ\alpha &=\alpha \cap \beta \cap CʻP-\{\beta \cap \breve{P} ʻʻ(\alpha \cap \beta )\}\\ [*22·93.*205·11] & =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ):\supset \vdash .\text{Prop} \end{array}$

*205·262. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .x\in \alpha \cap CʻP.\beta &=\overrightarrow{P}ʻx\cup {℩}ʻx.\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*32·18.\supset \vdash \colon\ldotp \text{Hp}.y\in \alpha ·yPx.&\supset :y\in \alpha \cap \beta :\\ [*37·105] &\supset :yPz.\supset .z\in \breve{P} ʻʻ(\alpha \cap \beta ) &\qquad \text{(1)}\\ \vdash .*51·15.\supset \vdash \colon\ldotp \text{Hp}.y\in \alpha .y=x.&\supset :y\in \alpha \cap \beta :\\ [*37·105] &\supset :yPz.\supset .z\in \breve{P} ʻʻ(\alpha \cap \beta ) &\qquad \text{(2)}\\ \vdash .*51·15.*201·1.\supset \vdash :\text{Hp}.y\in \alpha .xPy.yPz.&\supset .x\in \alpha .xPz.\\ [*37·105] &\supset .z\in \breve{P} ʻʻ(\alpha \cap \beta ) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*202·103.\supset \vdash \colon\ldotp \text{Hp}.&\supset :y\in \alpha .yPz.\supset .z\in \breve{P} ʻʻ(\alpha \cap \beta ):\\ [*37·105·2] &\supset :\breve{P} ʻʻ\alpha =\breve{P} ʻʻ(\alpha \cap \beta ) &\qquad \text{(4)}\\ \vdash .*37·181.*202·101.\supset \vdash :\text{Hp}.&\supset .\overleftarrow{P}ʻx\subset \overleftarrow{P}ʻʻ\alpha .\overleftarrow{P}ʻx=CʻP-\beta .\\ [*22·82] &\supset .CʻP-\breve{P} ʻʻ\alpha \subset \beta .\\ [*22·621.(4)] & \supset .CʻP\cap \alpha -\breve{P} ʻʻ\alpha=CʻP\cap \alpha \cap \beta -\breve{P} ʻʻ(\alpha \cap \beta ).\\ [*205·11] & \supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ):\supset \vdash .\text{Prop} \end{array}$

*205·27. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .x\in &\alpha \cap \text{ᗡ}ʻP.\beta =\overrightarrow{P}ʻx\cup \iota ʻx.\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*52·41. \supset \vdash :\text{Hp}.\overrightarrow{P}ʻx\neq \iota ʻx.&\supset .\beta {\sim}\in 1.\\ [*205·261] &\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ) &\qquad \text{(1)}\\ \vdash .*202·101. \supset \vdash :\text{Hp}.\overrightarrow{P}ʻx=\iota ʻx.&\supset .CʻP-\iota ʻx=\overleftarrow{P}ʻx.xPx.\\ [*37·105] &\supset .CʻP\subset \breve{P} ʻʻ(\alpha \cap \beta ).\\ [*205·122.*37·413] &\supset .\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta )=\Lambda .\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻ\alpha =\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\beta )ʻa=\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ) &\qquad \text{(3)}\\ \vdash .(3).*205·262.\supset \vdash .\text{Prop} \end{array}$

*205·3. $\vdash :P\in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1.\overrightarrow{\text{max}}_{P}ʻ\alpha \in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*205·11.\supset \vdash \colon\ldotp x,y\in \overrightarrow{\text{min}}_{P}ʻ\alpha .&\supset :x,y\in \alpha \cap CʻP:z\in \alpha .\supset _{z}.{\sim}(zPx).{\sim}(zPy):\\ [*10·1] &\supset :x,y\in \alpha \cap CʻP.{\sim}(yPx).{\sim}(xPy) &\qquad \text{(1)}\\ \vdash .(1).*202·103.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x,y\in \overrightarrow{\text{min}}_{P}ʻ\alpha .\supset .x=y:\\ [*52·4] &\supset :\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1 &\qquad \text{(2)}\\ \text{Similarly}\quad & \vdash \colon\ldotp \text{Hp}.\supset :\overrightarrow{\text{max}}_{P}ʻ\alpha \in 0\cup 1 &\qquad \text{(3)}\\) \vdash .(2).(3).\supset \vdash .\text{Prop}\ \end{array}$

The above proposition is of great importance in the theory of maxima and minima.

*205·31. $\vdash : P \in \text{connex} . \supset . \text{min}_{P}, \text{max}_{P} \in 1 \rightarrow \text{Cls} \quad[*205·3.*71·12]$

*205·32. $\begin{align}&\vdash \colon\ldotp P \in \text{connex} . \supset : \exists ! \overrightarrow{\text{min}}_{P}ʻ\alpha . \equiv . \text{E}! \text{min}_{P}ʻ\alpha . \equiv . \alpha \in \text{ᗡ}ʻ\text{min}_{P}\\ &[*205·31 . *71·163 . *33·41]\end{align}$

*205·33. $\vdash : P \in \text{connex} . \kappa \subset \text{ᗡ}ʻ\text{min}_{P} . \supset . \text{min}_{P} \upharpoonright \kappa \in {\in}_{\Delta}ʻ\kappa$

Dem. $\begin{array}{l} \vdash . *205·31 . &\supset \vdash : \text{Hp} . \supset . \text{min}_{P} \upharpoonright \kappa \in 1 \rightarrow \text{Cls} &\qquad \text{(1)}\\ \vdash . *205·1 . &\supset \vdash : \text{Hp} . \supset . \text{min}_{P} \upharpoonright \kappa \,\unicode{x2abd}\, \in &\qquad \text{(2)}\\ \vdash . *35·65 . &\supset \vdash : \text{Hp} . \supset . \text{ᗡ}ʻ\text{min}_{P} \upharpoonright \kappa = \kappa &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . *80·14 . \supset \vdash . \text{Prop} \end{array}$

*205·34. $\vdash : P \in \text{connex} . \kappa \subset \text{ᗡ}ʻ\text{min}_{P} . \supset . \kappa \in \text{Cls}^{2}\, \text{mult} \quad[*205·33 . *88·2]$

*205·35. $\begin{align}\vdash \colon\colon P^{2} \,\unicode{x2abd}\, J . &P \in \text{connex} . \supset \colon\ldotp \\ &x = \text{min}_{P}ʻ\alpha . \equiv : x \in \alpha \cap CʻP : y \in \alpha \cap CʻP - \iota ʻx . \supset _{y} . xPy\end{align}$

Dem. $\begin{array}{l} \vdash . *205·31 . *71·36 . &\supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp x = \text{min}_{P}ʻ\alpha . \equiv : x \text{min}_{P}\alpha :\\ [*205·1 . *37·265] &\equiv : x \in \alpha \cap CʻP - \breve{P} ʻʻ(\alpha \cap CʻP) :\\ [*37·105] &\equiv : x \in \alpha \cap CʻP : y \in \alpha \cap CʻP . \supset _{y} . {\sim} (yPx) :\\ [*51·221] &\equiv : x \in \alpha \cap CʻP : y = x . \supset _{y} . {\sim} (yPx) : y \in \alpha \cap CʻP - \iota ʻx . \supset _{x} . {\sim} (yPx) &\qquad \text{(1)}\\ \vdash . *200·36 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : yPz . \supset _{z, y} .y \neq z :\\ [\text{Transp} . *10·1] &\supset : y = x . \supset _{y} . {\sim} (yPx) &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash \colon\colon \text{Hp}. \supset \colon\ldotp \\ x = \text{min}_{P}ʻ\alpha . &\equiv : x \in \alpha \cap CʻP : y \in \alpha \cap CʻP - \iota ʻx . \supset _{y} . {\sim} (yPx) :\\ [*202·5] &\equiv : x \in \alpha \cap CʻP : y \in \alpha \cap CʻP - \iota ʻx . \supset _{y} . xPy \colon\colon \supset \vdash . \text{Prop} \end{array}$

*205·36. $\vdash : P \in \text{trans} \cap \text{connex} . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha \subset pʻP_{*}ʻʻ(\alpha \cap CʻP)$

Dem. $\vdash . *205·2 . *201·18 . \supset \vdash \colon\ldotp \text{Hp} . x = \text{min}_{P}ʻ\alpha . \supset : y \in (\alpha \cap CʻP) . \supset _{y} . xP_{*}y \colon\ldotp \supset \vdash . \text{Prop}$

*205·37. $\vdash : P \in \text{trans} . \overrightarrow{\text{max}}_{P}ʻ\alpha = \Lambda . \supset . P_{*}ʻʻ\alpha = Pʻʻ\alpha \quad[*201·52.*205·123]$

*205·38. $\vdash : P_{\text{po}} \,\unicode{x2abd}\, J . \supset . \mu \cap pʻ\overrightarrow{P}_{*}ʻʻ\mu \subset \overrightarrow{\text{min}} (P_{\text{po}})ʻ\mu$

Dem. $\begin{array}{l} \vdash . *200·381 . \supset \vdash \colon\colon \text{Hp} . &\supset \colon\ldotp x \in \mu . \supset _{x} . yP_{*}x : \supset : x \in \mu . \supset _{x}\\ . {\sim} (xP_{\text{po}}y) \colon\ldotp \\ [*40·51 . *37·105] &\supset \colon\ldotp pʻ\overrightarrow{P}_{*}ʻʻ\mu \subset - \breve{P} _{\text{po}}ʻʻ\mu &\qquad \text{(1)}\\ \vdash . *40·62 . &\supset \vdash : \exists ! \mu . \supset . pʻ\overrightarrow{P}_{*}ʻʻ\mu \subset CʻP &\qquad \text{(2)}\\ \vdash . *24·12 . &\supset \vdash : {\sim} \exists ! \mu . \supset . \mu \subset CʻP &\qquad \text{(3)}\\ \vdash . (1) . (2) . (3) . \supset \vdash : \text{Hp} . \supset . \mu \cap pʻ\overrightarrow{P}_{*}ʻʻ\mu &\subset \mu \cap CʻP - \breve{P} _{\text{po}}ʻʻ\mu \\ [*205·11 . *91·504] &\subset \overrightarrow{\text{min}} (P_{\text{po}})ʻ\mu : \supset \vdash . \text{Prop} \end{array}$

*205·381. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\overrightarrow{\text{max}}_{P}ʻ\mu = \Lambda .\supset .pʻ\overleftarrow{P}_{*}ʻʻ\mu = pʻ\overleftarrow{P}_{\text{po}}ʻʻ\mu$

Dem. $\begin{array}{l} \vdash .*205·38 \frac{\breve{P}}{P}.\supset \vdash :\text{Hp}.&\supset .\mu \cap pʻ\overleftarrow{P}_{*}ʻʻ\mu = \Lambda &\qquad \text{(1)}\\ \vdash .(1).*40·53.*24·37.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in pʻ\overleftarrow{P}_{*}ʻʻ\mu . &\equiv :y\in \mu .\supset _{y}.yP_{*}x.y \neq x:\\ [*200·38] &\equiv :y\in \mu .\supset _{y}.yP_{\text{po}}x:\\ [*40·53] &\equiv :x\in pʻ\overleftarrow{P}_{\text{po}}ʻʻ\mu \colon\colon\supset \vdash .\text{Prop} \end{array}$

The three following propositions lead up to *205·42, which is used in *261·26.

*205·4. $\vdash :CʻP\in 1.\supset .\overrightarrow{B}ʻP = \Lambda .\overrightarrow{B}ʻ\breve{P} = \Lambda$

Dem. $\begin{array}{l} \vdash .*56·381.*55·15.&\supset \vdash :\text{Hp}.\supset .(\exists x).\text{D}ʻP = \iota ʻx.\text{ᗡ}ʻP = \iota ʻx.\\ [*93·101] & \supset .\overrightarrow{B}ʻP = \Lambda .\overrightarrow{B}ʻ\breve{P} = \Lambda :\supset \vdash .\text{Prop} \end{array}$

*205·401. $\vdash :\exists !\overrightarrow{B}ʻP\unicode{x0294f}\alpha .\supset .\alpha \cap CʻP{\sim}\in 0\cup 1.CʻP\unicode{x0294f}\alpha {\sim}\in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*205·4.\text{Transp}.&\supset \vdash :\text{Hp}.\supset .CʻP\unicode{x0294f}\alpha {\sim}\in 1 &\qquad \text{(1)}\\ \vdash .*93·103. &\supset \vdash :\text{Hp}.\supset .\exists !CʻP\unicode{x0294f}\alpha &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .CʻP\unicode{x0294f}\alpha {\sim}\in 0\cup 1 &\qquad \text{(3)}\\ \vdash .*37·41. &\supset \vdash .CʻP\unicode{x0294f}\alpha \subset \alpha \cap CʻP &\qquad \text{(4)}\\ \vdash .(4).*60·32·371.\text{Transp}.&\supset \vdash :CʻP\unicode{x0294f}\alpha {\sim}\in 0\cup 1.\supset .\alpha \cap CʻP{\sim}\in 0\cup 1 &\qquad \text{(5)}\\ \vdash .(3).(5).\supset \vdash .\text{Prop} \end{array}$

The following proposition, besides being required for *205·41, is used in *250·151.

*205·41. $\vdash :P\in \text{connex} .\alpha \cap CʻP{\sim}\in 1.\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha = \overrightarrow{B}ʻP\unicode{x0294f}\alpha$

Dem. $\begin{array}{l} \vdash .*202·54. &\supset \vdash :\text{Hp}.\supset .CʻP\unicode{x0294f}\alpha = \alpha \cap CʻP &\qquad \text{(1)}\\ \vdash .*37·41. & \supset \vdash .\text{ᗡ}ʻP\unicode{x0294f}\alpha = \alpha \cap \breve{P} ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*93·103. \supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻP\unicode{x0294f}\alpha & = \alpha \cap CʻP-(\alpha \cap \breve{P} ʻʻ\alpha )\\ [*22·93.*205·11] &= \overrightarrow{\text{min}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·42. $\vdash :P\in \text{connex} .\text{E}!BʻP\unicode{x0294f}\alpha .\supset .BʻP\unicode{x0294f}\alpha = \text{min}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·401.\supset \vdash :\text{Hp}.&\supset .\alpha \cap CʻP{\sim}\in 1.\\ [*205·41] &\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha = \overrightarrow{B}ʻP\unicode{x0294f}\alpha &\qquad \text{(1)}\\ \vdash .(1).*32·41.\supset \vdash .\text{Prop} \end{array}$

*205·43. $\vdash :P\in \text{connex} .\exists !\alpha \cap \text{D}ʻP.\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{B}ʻ\alpha \upharpoonleft P$

Dem. $\begin{array}{l} \vdash .*205·11. \supset \vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha &=(\alpha \cap \text{D}ʻP-\breve{P} ʻʻ\alpha )\cup (\alpha \cap \overrightarrow{B}ʻ\breve{P} -\breve{P} ʻʻ\alpha )\\ [*35·61.*37·4] &=\overrightarrow{B}ʻ\alpha \upharpoonleft P\cup (\alpha \cap \overrightarrow{B}ʻ\breve{P} -\breve{P} ʻʻ\alpha )&\qquad \text{(1)}\\ \vdash .*205·23. &\supset \vdash :P\in \text{connex} .x\in \alpha \cap \text{D}ʻP.y\in \overrightarrow{B}ʻ\breve{P} .\supset .x\in \alpha .xPy.\\ [*37·1] &\supset .y\in \breve{P} ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*10·23. \supset \vdash :\text{Hp}.&\supset .\overrightarrow{B}ʻ\breve{P} \subset \breve{P} ʻʻ\alpha .\\ [*24·3] &\supset .\alpha \cap \overrightarrow{B}ʻ\breve{P} -\breve{P} ʻʻ\alpha =\Lambda &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*205·44. $\vdash :P\in \text{connex} .\text{E}!Bʻ\alpha \upharpoonleft P.\supset .\text{min}_{P}ʻ\alpha =Bʻ\alpha \upharpoonleft P \quad[*205·43.*32·41]$

The following propositions deal with the circumstances under which the minimum of one class is identical with, or earlier than, that of another.

*205·5. $\vdash :P\in \text{connex} .\alpha \subset \beta .\text{min}_{P}ʻ\beta \in \alpha .\supset .\text{E}!\text{min}_{P}ʻ\alpha .\text{min}_{P}ʻ\alpha =\text{min}_{P}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*37·2. \text{Transp}.\supset \vdash :\text{Hp}.&\supset .-Pʻʻ\beta \subset -Pʻʻ\alpha .\\ [*205·11.\text{Hp}] &\supset .\text{min}_{P}ʻ\beta \in \alpha -Pʻʻ\alpha .\\ [*205·1] &\supset .\text{min}_{P}ʻ\beta \in \overrightarrow{\text{min}}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*205·3.\supset \vdash .\text{Prop} \end{array}$

*205·501. $\vdash :P\in \text{connex} .\text{min}_{P}ʻ\alpha =\text{min}_{P}ʻ\beta .\supset .\beta \subset -pʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·11. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{min}_{P}ʻ\alpha {\sim}\in \breve{P} ʻʻ\beta :\\ [*37·105] &\supset :y\in \beta .\supset _{y}.{\sim}(yP\text{min}_{P}ʻ\alpha ):\\ [*205·11] &\supset :y\in \beta .\supset _{y}.(\exists x).x\in \alpha .{\sim}(yPx):\\ [*40·51] &\supset :\beta \subset -pʻ\overrightarrow{P}ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*205·51. $\begin{align}\vdash \colon\ldotp P\in \text{connex} .\alpha \subset \beta .\text{E}!&\text{min}_{P}ʻ\alpha .\text{E}!\text{min}_{P}ʻ\beta .\supset :\\ &\text{min}_{P}ʻ\alpha =\text{min}_{P}ʻ\beta .\lor.\text{min}_{P}ʻ\beta P\text{min}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*22·1.*205·1.\supset \vdash :\text{Hp}.\supset .\text{min}_{P}ʻ\alpha \in \beta \cap CʻP &\qquad \text{(1)}\\ \vdash .(1).*205·2.\supset \vdash .\text{Prop} \end{array}$

*205·52. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .&\exists !\alpha \cap pʻ\overrightarrow{P}ʻʻ\beta .\\ &\text{E}!\text{min}_{P}ʻ\alpha .\text{E}!\text{min}_{P}ʻ\beta .\supset .\text{min}_{P}ʻ\alpha P\text{min}_{P}ʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*40·51.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists x):x\in \alpha :y\in \beta .\supset _{y}.xPy &\qquad \text{(1)}\\ \vdash .*205·2.\supset \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x\in \alpha \cap CʻP.\supset _{x}:\text{min}_{P}ʻ\alpha =x.\lor.\text{min}_{P}ʻ\alpha Px &\qquad \text{(2)}\\ \vdash .(1). *205·1 . \supset \vdash \colon\ldotp \text{Hp}. &\supset : (\exists x) . x \in \alpha . xP \text{min}_{P}ʻ\beta :\\ [*33·17] &\supset : (\exists x) . x \in \alpha \cap CʻP . xP \text{min}_{P}ʻ\beta &\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash \colon\ldotp \text{Hp}. &\supset : (\exists x) : xP \text{min}_{P}ʻ\beta : \text{min}_{P}ʻ\alpha = x . \lor . \text{min}_{P}ʻ\alpha Px :\\ [*201·1 . *13·195] &\supset : \text{min}_{P}ʻ\alpha P \text{min}_{P}ʻ\beta \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*205·53. $\vdash : P \in \text{connex} \cap \text{Rl}ʻJ . x \in \alpha \cap CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha . \supset . x = \text{max}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *50·24 . \supset \vdash : \text{Hp} . &\supset . x \in \alpha \cap CʻP - \overrightarrow{P}ʻx .\\ [\text{Hp}] &\supset . x \in \alpha \cap CʻP - Pʻʻ\alpha .\\ [*205·111] &\supset . x \in \overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . (1) . *205·3 . \supset \vdash . \text{Prop} \end{array}$

*205·54. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser} . \supset : x \in \alpha \cap CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha . \equiv . x = \text{max}_{P}ʻ\alpha \\ &[*205·53·22]\end{align}$

*205·55. $\vdash : P \in \text{connex} . BʻP \in \alpha . \supset . BʻP = \text{min}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *93·101 . *37·16 . &\supset \vdash : \text{E}! BʻP . \supset . BʻP \in CʻP - \breve{P} ʻʻ\alpha &\qquad \text{(1)}\\ \vdash . (1) . *205·1 . &\supset \vdash : BʻP \in \alpha . \supset . BʻP \text{min}_{P}\alpha &\qquad \text{(2)}\\ \vdash . (2) . *205·31 . \supset \vdash . \text{Prop} \end{array}$

*205·56. $\vdash . \overrightarrow{\text{max}}_{P}ʻsʻ\kappa \subset \text{max}_{P}ʻʻ\kappa$

Dem. $\begin{array}{l} \vdash . *205·111 . *40·38 . &\supset \vdash . \overrightarrow{\text{max}}_{P}ʻsʻ\kappa \subset sʻ\kappa \cap CʻP - sʻPʻʻʻ\kappa \\ [*40·11] &\subset \hat{y} \{(\exists \alpha ) . \alpha \in \kappa . y \in \alpha \cap CʻP : {\sim} (\exists \alpha ) . \alpha \in \kappa . y \in Pʻʻ\alpha\}\\ [*10·56] &\subset \hat{y} \{(\exists \alpha ) . \alpha \in \kappa . y \in \alpha \cap CʻP - Pʻʻ\alpha\}\\ [*205·111] &\subset \hat{y} \{(\exists \alpha ) . \alpha \in \kappa . y \in \overrightarrow{\text{max}}_{P}ʻ\alpha\}\\ [*40·5] &\subset \text{max}_{P}ʻʻ\kappa . \supset \vdash . \text{Prop} \end{array}$

*205·561. $\vdash : \kappa \subset - \text{ᗡ}ʻ\text{max}_{P} . \supset . sʻ\kappa {\sim} \in \text{ᗡ}ʻ\text{max}_{P} \quad[*205·56 . *37·26·29]$

*205·6. $\vdash \colon\ldotp P \in \text{connex} . \supset : {\sim} \text{E}! \text{min}_{P}ʻ\alpha . \equiv . \alpha \cap CʻP \subset \breve{P} ʻʻ\alpha \quad[*205·32·122]$

*205·601. $\vdash : P \in \text{connex} . \alpha \subset CʻP . \supset : {\sim} \text{E}! \text{min}_{P}ʻ\alpha . \equiv . \alpha \subset \breve{P} ʻʻ\alpha \quad[*205·6]$

*205·61. $\begin{align}&\vdash : P \in \text{connex} . \supset . CʻP = {CʻP \cap pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)} \cup \overrightarrow{\text{min}}_{P}ʻ\alpha \cup \breve{P} ʻʻ\alpha\\ &[*202·505 . *205·13]\end{align}$

*205·62. $\begin{align}&\vdash : P \in \text{connex} . \exists ! \alpha \cap CʻP . \supset . CʻP = pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) \cup \overrightarrow{\text{min}}_{P}ʻ\alpha \cup \breve{P} ʻʻ\alpha \\ &[*40·62 . *205·61]\end{align}$

*205·63. $\begin{align}\vdash : P \in \text{connex} . P^{2} \,\unicode{x2abd}\, J . &\exists ! (\alpha \cap CʻP) . \supset .\\ &pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) = CʻP - \breve{P} ʻʻ\alpha - \overrightarrow{\text{min}}_{P}ʻ\alpha\\ [*202·502 . *205·13]\end{align}$

*205·64. $\begin{align}\vdash :P\in \text{connex} .\exists !&(\alpha \cap CʻP).\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ\alpha =CʻP-\breve{P} ʻʻ\alpha -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*205·62.&\supset \vdash :\text{Hp}.\supset .\\ &CʻP-\breve{P} ʻʻ\alpha -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha -\breve{P} ʻʻ\alpha -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .*205·11.&\supset \vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha -\breve{P} ʻʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*205·14.\supset \vdash \colon\ldotp x\in \overrightarrow{\text{min}}_{P}ʻ\alpha .&\supset :y\in \alpha .\supset _{y}.{\sim}(yPx):\\ [*205·11.*10·1] &\supset :{\sim}(xPx).x\in \alpha \cap CʻP:\\ [*40·51] &\supset :x{\sim}\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(3)}\\ \vdash .(3).&\supset \vdash .\overrightarrow{\text{min}}_{P}ʻ\alpha -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).(2).(4).\supset \vdash .\text{Prop} \end{array}$

*205·65. $\vdash :P\in \text{trans}\alpha \cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .\supset .pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻ\text{min}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·2.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp xP\text{min}_{P}ʻ\alpha .&\supset :y\in \alpha \cap CʻP.\supset _{y}.xPy:\\ [*40·51] &\supset :x\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .*205·1.*40·12.&\supset \vdash :\text{Hp}.\supset .pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\subset \overrightarrow{P}ʻ\text{min}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*205·66. $\begin{align}\vdash :P\in \text{trans}\alpha &\cap \text{connex} .\text{E}!\text{min}_{P}ʻ\alpha .\supset .\\ &pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻ\text{min}_{P}ʻ\alpha .\breve{P} ʻʻ\alpha =\overleftarrow{P}ʻ\text{min}_{P}ʻ\alpha .\\ &CʻP=pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\cup \iota ʻ\text{min}_{P}ʻ\alpha \cup \breve{P} ʻʻ\alpha\\ &[*205·65·22.*202·101]\end{align}$

*205·67. $\vdash \colon\ldotp P\in \text{Ser}.\supset :x=\text{min}_{P}ʻ\alpha .\equiv .\overrightarrow{P}ʻx=pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).x\in CʻP$

Dem. $\begin{array}{l} \vdash .*205·65·11.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :x=\text{min}_{P}ʻ\alpha .\supset .\overrightarrow{P}ʻx=pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).x\in CʻP &\qquad \text{(1)}\\ \vdash .*50·24.&\supset \vdash :\text{Hp}.\overrightarrow{P}ʻx=pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).\supset .x{\sim}\in pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(2)}\\ \vdash .*200·5.\supset \vdash :\text{Hp}(2).&\supset .\alpha \cap \overrightarrow{P}ʻx=\Lambda .\\ [*37·462] &\supset .x{\sim}\in \breve{P} ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).*202·505.\supset \vdash :\text{Hp}(2).x\in CʻP.&\supset .x\in \alpha \cap CʻP-\breve{P} ʻʻ\alpha .\\ [*205·3·11] &\supset .x=\text{min}_{P}ʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*205·68. $\vdash :\breve{P} ʻʻ\alpha \subset \alpha .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}(P_{\text{po}})ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*91·711.&\supset \vdash :\text{Hp}.\supset .\breve{P} _{\text{po}}ʻʻ\alpha =\breve{P} ʻʻ\alpha .\\ [*205·11] &\supset .\overrightarrow{\text{min}}(P_{\text{po}})ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·681. $\vdash :P_{\text{po}}\in \text{connex} .\breve{P} ʻʻ\alpha \subset \alpha .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1 \quad[*205·68·3]$

*205·7. $\vdash :\exists !\overrightarrow{\text{max}}_{P}ʻPʻʻ\alpha .\supset .\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*37·2·265. &\supset \vdash :\alpha \cap CʻP\subset Pʻʻ\alpha .\supset .Pʻʻ\alpha \subset PʻʻPʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.&\supset \vdash :\exists !Pʻʻ\alpha -PʻʻPʻʻ\alpha .\supset .\exists !\alpha \cap CʻP-Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*205·111.\supset \vdash .\text{Prop} \end{array}$

*205·71. $\vdash :P\in \text{connex} .\exists !\overrightarrow{\text{max}}_{P}ʻPʻʻ\alpha .\supset .\text{max}_{P}ʻPʻʻ\alpha (P\dot{-} P^{2})\text{max}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·7·3.\supset \vdash :\text{Hp}.&\supset .\text{E}!\text{max}_{P}ʻPʻʻ\alpha .\text{E}!\text{max}_{P}ʻ\alpha . &\qquad \text{(1)}\\ [*205·101] &\supset .\text{max}_{P}ʻPʻʻ\alpha \in Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).*205·101.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{max}_{P}ʻPʻʻ\alpha {\sim}\in PʻʻPʻʻ\alpha :\\ [*37·39] &\supset :y\in \alpha .\supset _{y}.{\sim}(\text{max}_{P}ʻPʻʻ\alpha P^{2}y):\\ [(1)] &\supset :{\sim}(\text{max}_P{}ʻPʻʻ\alpha P^{2}\text{max}_{P}ʻ\alpha ): &\qquad \text{(3)}\\ [*34·5.\text{Transp}] & \supset :zP\text{max}_{P}ʻ\alpha .\supset .{\sim}(\text{max}_{P}ʻPʻʻ\alpha Pz):\\ [*205·21] &\supset :z\in \alpha -\iota ʻ\text{max}_{P}ʻ\alpha .\supset .{\sim}(\text{max}_{P}ʻPʻʻ\alpha Pz) &\qquad \text{(4)}\\ \vdash .(2).*37·1.&\supset \vdash :\text{Hp}.\supset .(\exists z).z\in \alpha .\text{max}_{P}ʻPʻʻ\alpha Pz &\qquad \text{(5)}\\ \vdash .(4).(5). &\supset \vdash :\text{Hp}.\supset .\text{max}_{P}ʻPʻʻ\alpha P\text{max}_{P}ʻ\alpha &\qquad \text{(6)}\\ \vdash .(3).(6).\supset \vdash .\text{Prop} \end{array}$

*205·72. $\vdash :P\in \text{connex} .P\,\unicode{x2abd}\, P^{2}.\supset .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻPʻʻ\alpha \quad[*205·71.\text{Transp}]$

*205·73. $\vdash :P\in \text{connex} .\text{min}_{P}ʻ\gamma =\text{max}_{P}ʻ\gamma .\supset .\gamma \cap CʻP\in 1.\gamma \cap CʻP=\iota ʻ\text{min}_{P}ʻ\gamma$

Dem. $\begin{array}{l} \vdash . *205·21. \supset \vdash :.\text{Hp}.\supset :x\in \gamma \cap CʻP-\iota ʻ\text{min}_{P}ʻ\gamma .&\supset .\text{max}_{P}ʻ\gamma Px.\\ [*37·1] &\supset .\text{max}_{P}ʻ\gamma \in Pʻʻ\gamma &\qquad \text{(1)}\\ \vdash .*205·111.&\supset \vdash :\text{Hp}.\supset .\text{max}_{P}ʻ\gamma {\sim}\in Pʻʻ\gamma &\qquad \text{(2)}\\ \vdash .(2).(1).\text{Transp}.\supset \vdash :\text{Hp}.&\supset .\gamma \cap CʻP-\iota ʻ\text{min}_{P}ʻ\gamma =\Lambda .\\ [*205·11] &\supset .\gamma \cap CʻP=\iota ʻ\text{min}_{P}ʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

*205·731. $\begin{align}&\vdash \colon\ldotp P\in \text{connex} \cap \text{Rl}ʻJ.\supset :\text{min}_{P}ʻ\gamma =\text{max}_{P}ʻ\gamma .\equiv .\gamma \cap CʻP\in 1\\ &[*205·17·73]\end{align}$

*205·732. $\begin{align}\vdash :P\in \text{connex} .\gamma \cap CʻP{\sim}\in 1.\text{E}!&\text{min}_{P}ʻ\gamma .\text{E}!\text{max}_{P}ʻ\gamma .\supset .\\ &\text{min}_{P}ʻ\gamma P\text{max}_{P}ʻ\gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*205·73.\text{Transp}.\supset \vdash :\text{Hp}.&\supset .\text{max}_{P}ʻ\alpha \neq \text{min}_{P}ʻ\alpha .\\ [*205·21] &\supset .\text{min}_{P}ʻ\alpha P\text{max}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

The following propositions lead up to *205·75, which shows that the minimum of a class belongs to $\text{D}ʻP$ unless the part of the class contained in $CʻP$ is $\iota ʻBʻ\breve{P}$ .

*205·74. $\vdash : \alpha \cap CʻP \subset \overrightarrow{B}ʻ\breve{P} . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha = \alpha \cap CʻP$

Dem. $\begin{array}{l} \vdash . *93·101 . \supset \vdash : \text{Hp} . &\supset . \alpha \cap \text{D}ʻP = \Lambda .\\ [*37·261·29] &\supset . \breve{P} ʻʻ\alpha = \Lambda .\\ [*205·11] &\supset · \overrightarrow{\text{min}}_{P}ʻ\alpha = \alpha \cap CʻP : \supset \vdash . \text{Prop} \end{array}$

*205·741. $\vdash : P \in \text{connex} . \alpha \cap CʻP {\sim} \in 1 . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha \subset \text{D}ʻP$

Dem. $\begin{array}{l} \vdash . *205·21 . &\supset \vdash : P \in \text{connex} . y = \text{min}_{P}ʻ\alpha . z \in \alpha \cap CʻP - {℩}ʻy . \supset . yPz :\\ [*205·3] &\supset \vdash : P \in \text{connex} . y \in \overrightarrow{\text{min}}_{P}ʻ\alpha . z \in \alpha \cap CʻP - {℩}ʻy . \supset . yPz :\\ [*33·13] &\supset \vdash : P \in \text{connex} . y \in \overrightarrow{\text{min}}_{P}ʻ\alpha . \exists ! \alpha \cap CʻP - {℩}ʻy . \supset . y \in \text{D}ʻP :\\ [*52·181] &\supset \vdash : P \in \text{connex} . \alpha \cap CʻP {\sim} \in 1 . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha \subset \text{D}ʻP : \supset \vdash . \text{Prop} \end{array}$

*205·742. $\vdash \colon\ldotp P \in \text{connex} . \supset : \exists ! \overrightarrow{\text{min}}_{P}ʻ\alpha - \text{D}ʻP . \equiv . \alpha \cap CʻP = {℩}ʻBʻ\breve{P}$

Dem. $\begin{array}{l} \vdash . *205·74 . \supset \vdash : \alpha \cap CʻP = {℩}ʻBʻ\breve{P} . &\supset . \overrightarrow{\text{min}}_{P}ʻ\alpha = {℩}ʻBʻ\breve{P} .\\ [*93·101] &\supset . \exists ! \text{min}_{P}ʻ\alpha - \text{D}ʻP &\qquad \text{(1)}\\ \vdash . *205·741 . &\supset \vdash : \text{Hp} . \exists ! \overrightarrow{\text{min}}_{P}ʻ\alpha - \text{D}ʻP . \supset . \alpha \cap CʻP \in 1 &\qquad \text{(2)}\\ \vdash . *205·11 . \supset \vdash : \exists ! \overrightarrow{\text{min}}_{P}ʻ\alpha - \text{D}ʻP . &\supset . \exists ! \alpha \cap CʻP - \text{D}ʻP .\\ [*93·103] &\supset . \exists ! \alpha \cap \overrightarrow{B}ʻ\breve{P} &\qquad \text{(3)}\\ \vdash . (2) . (3) . *202·52 . &\supset \vdash : \text{Hp} . \exists ! \overrightarrow{\text{min}}_{P}ʻ\alpha - \text{D}ʻP . \supset . \alpha \cap CʻP = {℩}ʻBʻ\breve{P} &\qquad \text{(4)}\\ \vdash . (1) . (4). \supset \vdash . \text{Prop} \end{array}$

*205·75. $\begin{align}&\vdash \colon\ldotp P \in \text{connex} . \supset : {\sim} (\alpha \cap CʻP = {℩}ʻBʻ\breve{P} ) . \equiv . \overrightarrow{\text{min}}_{P}ʻ\alpha \subset \text{D}ʻP\\ &[*205·742]\end{align}$

Observe that ${\sim} (\alpha \cap CʻP = {℩}ʻBʻ\breve{P})$ is not in general equivalent to $\alpha \cap CʻP \neq {℩}ʻBʻ\breve{P}$ , since the latter implies $\text{E}! Bʻ\breve{P}$ , while the former does not.

*205·8. $\vdash : S \in P \overline{\,\text{smor}\,} Q . \supset . \overrightarrow{\text{min}}_{P}ʻ\alpha = Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash . *205·11 . &\supset \vdash . Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha = Sʻʻ\{\breve{S} ʻʻ\alpha \cap CʻQ - \breve{Q} ʻʻ\breve{S} ʻʻ\alpha\} &\qquad \text{(1)}\\ \vdash . *151·11 . &\supset \vdash : \text{Hp} . \supset . \breve{S} ʻʻ\alpha \subset CʻQ &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash : \text{Hp} . \supset . Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha &= Sʻʻ\{\breve{S} ʻʻ\alpha - \breve{Q} ʻʻ\breve{S} ʻʻ\alpha\}\\ [*71·381] &= Sʻʻ\breve{S} ʻʻ\alpha - Sʻʻ\breve{Q} ʻʻ\breve{S} ʻʻ\alpha \\ [*72·5 . *150·23] &= \alpha \cap CʻP - \breve{P} ʻʻ\alpha \\ [*205·11] &= \overrightarrow{\text{min}}_{P}ʻ\alpha : \supset \vdash . \text{Prop} \end{array}$

*205·81. $\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\supset :\text{E}!\text{min}_{P}ʻ\alpha .\equiv .\text{E}!\text{min}_{Q}ʻ\breve{S}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·8.*73·22.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\overrightarrow{\text{min}}_{P}ʻ\alpha \text{ sm }\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha :\\ [*73·44] &\supset :\overrightarrow{\text{min}}_{P}ʻ\alpha \in 1.\equiv .\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha \in 1:\\ [*53·3] &\supset :\text{E}!\text{min}_{P}ʻ\alpha .\equiv .\text{E}!\text{min}_{Q}ʻ\breve{S} ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*205·82. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\text{E}!\text{min}_{P}ʻ\alpha .\supset .\text{min}_{P}ʻ\alpha =Sʻ\text{min}_{Q}ʻ\breve{S} ʻʻ\alpha\\ &[*53·31.*205·8·81]\end{align}$

*205·83. $\vdash :z{\sim}\in CʻP.\exists !CʻP\cap \alpha .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha =\overrightarrow{\text{min}}(P\unicode{x21f8} z)ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*161·1. \supset \vdash :\text{Hp}.&\supset .\{\text{Cnv}ʻ(P\unicode{x21f8} z)\}ʻʻ\alpha =\breve{P} ʻʻ\alpha \cup \iota ʻz.\\ [*161·14·2.*24·495] &\supset .\alpha \cap Cʻ(P\unicode{x21f8} z)-\{\text{Cnv}ʻ(P\unicode{x21f8} z)\}ʻʻ\alpha =\alpha \cap CʻP-\breve{P} ʻʻ\alpha .\\ [*205·11] &\supset .\overrightarrow{\text{min}}(P\unicode{x21f8} z)ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·831. $\vdash :z{\sim}\in CʻP.Cʻ(P\unicode{x21f8} z)\cap \alpha =\iota ʻz.\supset .\overrightarrow{\text{min}}(P\unicode{x21f8} z)ʻ\alpha =\iota ʻz$

Dem. $\begin{array}{l} \vdash .*161·11. \supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in \alpha .\supset _{x}.{\sim}\{x(P\unicode{x21f8} z)z\}:\\ [*37·1.\text{Transp}] &\supset :z{\sim}\in \{\text{Cnv}ʻ(P\unicode{x21f8} z)\}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*22·621.\supset \vdash :\text{Hp}.\supset .\iota ʻz&=Cʻ(P\unicode{x21f8} z)\cap \alpha -\{\text{Cnv}ʻ(P\unicode{x21f8} z)\}ʻʻ\alpha \\ [*205·11] &=\overrightarrow{\text{min}}(P\unicode{x21f8} z)ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·832. $\vdash :z{\sim}\in CʻP.z{\sim}\in \alpha .\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·111.*161·2.&\supset \vdash :P=\dot{\Lambda} .\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha =\Lambda &\qquad \text{(1)}\\ \vdash .*205·111.*161·11·14.\supset \\ \vdash :\text{Hp}.\exists !CʻP\cap \alpha .\supset .\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha &=\alpha \cap (CʻP\cup \iota ʻz)-(\breve{P} ʻʻ\alpha \cup \iota ʻz)\\ [*24·495.*205·111] &=\overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*161·14.*205·151·161.\supset\\ \vdash :\text{Hp}.\dot{\exists} !P.CʻP\cap \alpha &=\Lambda .\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha =\Lambda &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*205·833. $\vdash :\dot{\exists} !P.z{\sim}\in CʻP.z\in \alpha .\supset .\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha =\iota ʻz$

Dem. $\begin{array}{l} \vdash .*161·11.\supset \vdash :\text{Hp}.&\supset .(P\unicode{x21f8} z)ʻʻ\alpha =CʻP.\\ [*161·14.*205·111] \supset .\overrightarrow{\text{max}}(P\unicode{x21f8} z)ʻ\alpha &=\alpha \cap (CʻP\cup \iota ʻz)-CʻP\\ [*22·621.\text{Hp}] &=\iota ʻz:\supset \vdash .\text{Prop} \end{array}$

*205·84. $\vdash :CʻP\cap CʻQ=\Lambda .\exists !CʻP\cap \alpha .\supset .\overrightarrow{\text{min}}(P\unicode{x2909}Q)ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*160·11.\supset \vdash :\text{Hp}.&\supset .\{\text{Cnv}ʻ(P\unicode{x2909}Q)\}ʻʻ\alpha =\breve{P} ʻʻ\alpha \cup CʻQ.\\ [*205·11.*160·14] \supset .\overrightarrow{\text{min}}(P\unicode{x2909}Q)ʻ\alpha &=\alpha \cap (CʻP\cup CʻQ)-(\breve{P} ʻʻ\alpha \cup CʻQ)\\ [*24·495] &=\alpha \cap CʻP-\breve{P} ʻʻ\alpha \\ [*205·11] &=\overrightarrow{\text{min}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·841. $\vdash :CʻP\cap \alpha =\Lambda .\supset .\overrightarrow{\text{min}}(P\unicode{x2909}Q)ʻ\alpha =\overrightarrow{\text{min}}_{Q}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*160·11.\supset \vdash :\text{Hp}.&\supset .\{\text{Cnv}ʻ(P\unicode{x2909}Q)\}ʻʻ\alpha =\breve{Q} ʻʻ\alpha .\\ [*205·11.*160·14] \supset .\overrightarrow{\text{min}}(P\unicode{x2909}Q)ʻ\alpha &=\alpha \cap (CʻP\cup CʻQ)-\breve{Q} ʻʻ\alpha \\ [\text{Hp}] &=\alpha \cap CʻQ-\breve{Q} ʻʻ\alpha \\ [*205·11] & =\overrightarrow{\text{min}}_{Q}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*205·85. $\vdash \colon\ldotp P\in \text{Rel}^{2}\text{excl}.\supset :x\{\text{min}(\Sigma ʻP)\}\alpha .\equiv .(\exists Q).Q\text{min}_{P}(\breve{F} ʻʻ\alpha ).x\text{min}_{Q}\alpha$

Dem. $\begin{array}{l} \vdash .*162·12·23.*205·1.&\supset \vdash \colon\ldotp x{\text{min}(\Sigma ʻP)}\alpha .\equiv :\\ &x\in \alpha :(\exists Q).Q\in CʻP.xFQ:{\sim}(\exists Q,y).Q\in CʻP.y\in \alpha .yQx:\\ &{\sim}(\exists Q,R,y).xFQ.RPQ.yFR.y\in \alpha :\\ [*37·105]&\equiv :x\in \alpha :(\exists Q).Q\in CʻP.xFQ:xFQ.Q\in CʻP.\supset _{Q}.x{\sim}\in \breve{Q} ʻʻ\alpha :\\ &xFQ.Q\in CʻP.\supset _{Q}.Q{\sim}\in \breve{P} ʻʻ\breve{F} ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*163·12.*14·26.&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x{\text{min}(\Sigma ʻP)}\alpha .\equiv :\\ &(\exists Q).xFQ.Q\in CʻP.x\in \alpha -\breve{Q} ʻʻ\alpha :xFQ.Q\in CʻP.\supset _{Q}.Q\in \breve{F} ʻʻ\alpha -\breve{P} ʻʻ\breve{F} ʻʻ\alpha :\\ [*163·12.*14·26]&\equiv :(\exists Q).xFQ.Q\in CʻP.x\in \alpha -\breve{Q} ʻʻ\alpha .Q\in \breve{F} ʻʻ\alpha -\breve{P} ʻʻ\breve{F} ʻʻ\alpha :\\ [*205·1] &\equiv :(\exists Q).Q\text{min}_{P}(\breve{F} ʻʻ\alpha ).x\text{min}_{Q}a\colon\colon\supset \vdash .\text{Prop} \end{array}$

*205·9. $\begin{align}&\vdash :P\in \text{connex} .\kappa \subset CʻP.\kappa {\sim}\in 1.\supset .\overrightarrow{\text{min}}(P\unicode{x0294f}\kappa )ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(a\cap \kappa )\\ &[*205·261]\end{align}$

*205·91. $\vdash :\breve{P} ʻʻ\alpha \subset \alpha .P_{\text{po}}\unicode{x0294f}\alpha \in \text{connex} .\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*205·261.\supset \vdash :\text{Hp}.\alpha \cap CʻP{\sim}\in 1.\supset .\overrightarrow{\text{min}}(P_{\text{po}}\unicode{x0294f}\alpha )ʻ\alpha &=\overrightarrow{\text{min}}(P_{\text{po}})ʻ\alpha \\ [*205·68] &=\overrightarrow{\text{min}}_{P}ʻ\alpha .\\ [*205·3] &\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1 &\qquad \text{(1)}\\ \vdash .*93·113.*60·371.&\supset \vdash :\alpha \cap CʻP\in 1.\supset .\overrightarrow{\text{min}}_{P}ʻ\alpha \in 0\cup 1 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

A "sequent" of a class $\alpha$ is a minimum of the terms that come after the whole of $\alpha \cap CʻP$ ; that is, we put $\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).$ Thus the sequents of $\alpha$ are its immediate successors. If $\alpha$ has a maximum, the sequents are the immediate successors of the maximum; but if $\alpha$ has no maximum, there will be no one term of $\alpha$ which is immediately succeeded by a sequent of $\alpha$ ; in this case, if $\alpha$ has a single sequent, the sequent is the "upper limit" of $\alpha$ . Whenever $P$ is connected, and therefore whenever $P$ is serial, every class has one sequent or none with respect to $P$ , by *205·3.

It will be seen that the sequents of $\alpha$ are the same as the sequents of $\alpha \cap CʻP$ , and therefore that $\overrightarrow{\text{seq}}_{P}ʻ\alpha$ depends only upon $\alpha\cap CʻP$ : if $\alpha$ has terms not belonging to $CʻP$ , they are irrelevant.

For the immediate predecessors of a class $\alpha$ , we put $\overrightarrow{\text{prec}} _{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).$ We have $\text{prec}_{P}=\text{seq}(\breve{P})$ , so that propositions about $\text{prec}_{P}$ result from those about $\text{seq}_{P}$ by merely writing $\breve{P}$ in place of $P$ ; they will therefore not be given in what follows.

Among the elementary properties of $\text{seq}_{P}$ with which this number begins, the following are the most important:

*206·13. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$

*206·131. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cap CʻP)$

*206·134. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} \{\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}$

*206·14. $\vdash :\alpha \cap CʻP=\Lambda .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{B}ʻP$

Thus if $P$ has a first term, this is the sequent of the null class, or of any other class which has no members in common with $CʻP$ .

*206·16. $\vdash :P\in \text{connex} .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha \in 0\cup 1$

*206·161. $\vdash :P\in \text{connex} .\supset .\text{seq}_{P}\in 1\rightarrow \text{Cls}$

Thus if $P$ is a connected relation, no class has more than one sequent. This is not in general the case with relations which are not connected, even where the idea of sequents is quite naturally applicable. Take, e.g., the relation of descendent to ancestor, and let $\alpha$ be the class of monarchs of England. Then $\overrightarrow{\text{seq}} _{P}ʻ\alpha$ will be such parents of monarchs as were not themselves monarchs.

*206·171. $\begin{align}\vdash :P&\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} \{\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset (\alpha \cap CʻP)\cup Pʻʻ\alpha\}\end{align}$

This proposition states that $x$ is a sequent of $\alpha$ if the whole of $\alpha \cap CʻP$ precedes $x$ , but every term that precedes $x$ either belongs to $\alpha$ or precedes some term of $\alpha$ . When $P$ is a series and $\alpha$ has no maximum, we have $\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\overrightarrow{P}ʻx=Pʻʻ\alpha ) \quad(*206·174),$ i.e. the sequent of $\alpha$ , if any, is a term whose predecessors are identical with the predecessors of members of $\alpha$ . This is the case of a limit (cf. *207).

We have next a set of propositions (*206·211 ·28) concerned with $\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha$ and $\overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha$ . When $P$ is transitive and connected, and $\alpha$ is an existent class contained in $CʻP$ and having a sequent, we shall have $\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =\alpha \cup Pʻʻ\alpha .{℩}ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha =pʻ\overleftarrow{P}ʻʻ\alpha .$ That is, the predecessors of the sequent are the members of $\alpha$ and the predecessors of members, while the sequent and its successors are the successors of the whole of $\alpha$ . The various parts of this statement require various parts of the hypothesis. Thus we have

*206·211. $\vdash :\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha$

*206·213. $\vdash :P\in \text{connex} .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \subset (\alpha \cap CʻP)\cup Pʻʻ\alpha$

*206·22. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .&\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =(\alpha \cap CʻP)\cup Pʻʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha \cup Pʻʻ\alpha\end{align}$

*206·23. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .&\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &{℩}ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha =pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP\end{align}$

If $P$ is transitive, the value of $\overrightarrow{\text{seq}}_{P}ʻ\alpha$ is unchanged if we add to $\alpha$ any set of terms contained in $Pʻʻ\alpha$ (*206·24); thus in particular, $\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup Pʻʻ\alpha ) =\overrightarrow{\text{seq}} _{P}ʻ\alpha$ (*206·25). Thus we can fill up any gaps in $\alpha$ , and take the whole series up to the end of $\alpha$ , without altering the sequent.

We have next a set of propositions (*206·3—*206·38) on the sequent of $Pʻʻ\alpha$ , i.e. of the segment defined by $\alpha$ . If $P$ is a series, $\text{seq}_{P}ʻPʻʻ\alpha$ is the maximum of $\alpha$ if $\alpha$ has a maximum, the sequent of $\alpha$ if $\alpha$ has a sequent but no maximum, and non-existent if $\alpha$ has neither a maximum nor a sequent (*206·35 ·331 ·36).

Our next set of propositions (*206·4—·52) concerns the sequents of unit classes, especially of $\iota ʻ\text{max}_{P}ʻ\alpha$ , and of classes of the form $\overrightarrow{P}ʻx$ . We have

*206·4. $\vdash :P\,\unicode{x2abd}\, J.x\in CʻP.\supset .x \text{seq}_{P}\overrightarrow{P}ʻx$

*206·42. $\vdash :x\in CʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\iota ʻx = \overleftarrow{P\dot{-} P^{2}}ʻx = \overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx$

*206·43. $\vdash :P\in \text{trans} \cap \text{Rl}ʻJ.x\in CʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\iota ʻx = \overleftarrow{P}_{1}ʻx$

*206·45. $\vdash \colon\ldotp P\in \text{Ser}.x\in CʻP.\supset :\text{E}!\text{seq}_{P}ʻ\iota ʻx. \equiv .x\in \text{D}ʻP_{1}$

*206·46. $\vdash :P\in \text{trans} \cap \text{connex} .\text{E}! \text{max}_{P}ʻ\alpha .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{max}}_{P}ʻ\alpha$

From the above propositions it results that, when $P$ is a series, any member of $CʻP$ is the sequent of the class of its predecessors, $\breve{P} _{1}ʻx$ is the sequent of $\iota ʻx$ if either exists, and the sequent of a class which has a maximum is the immediate successor (if any) of the maximum, i.e.

*206·5. $\vdash :P\in \text{trans} \cap \text{connex} .\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{max}_{P}ʻ\alpha (P\dot{-} P^{2})\text{seq}_{P}ʻ\alpha$

We then have a set of propositions (*206·53—·57) on the sequent of $pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)$ , i.e. the sequent of the predecessors of the whole of $\alpha \cap CʻP$ . These propositions are specially useful in connection with "Dedekindian" series, i.e. series in which every class has either a maximum or a sequent (*214). These propositions all require the full hypothesis that $P$ is a series. In this case, $\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) = \overrightarrow{\text{min}}_{P}ʻ\alpha$ , i.e. the sequent (if any) of the predecessors of the whole of $\alpha \cap CʻP$ is the minimum (if any) of $\alpha$ . Moreover by definition the maximum of $pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)$ , if any, is the precedent of $\alpha$ . Hence $\alpha$ has either a minimum or a precedent if $pʻ\overrightarrow{P}ʻʻ(\alpha\cap CʻP)$ has either a sequent or a maximum (*206·54). Moreover the sequent and maximum of $\alpha$ are respectively (if they exist) the sequent and maximum of the predecessors of all the successors of the whole of $\alpha \cap CʻP$ (*206·551). Hence we arrive at the conclusion that the assumption that every class of the form $pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)$ has either a maximum or a sequent is equivalent both to the[Pg 580] assumption that every class has either a maximum or a sequent (*206·56) and to the assumption that every class has either a minimum or a precedent (*206·55). It follows that these two latter assumptions are equivalent (*206·57), i.e. that a series is Dedekindian when, and only when, its converse is Dedekindian (*214·14).

We deal next (*206·6—*206·63) with correlations, showing that if two relations are correlated, the sequents of the correlates of any class are the correlates of the sequents, i.e.

*206·61. $\vdash :S\in P\overline{\,\text{smor}\,}Q.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{seq}} _{Q}ʻ\breve{S} ʻʻ\alpha$

We end with a set of propositions (*206·7—·732) showing that the sequent of a class is unchanged if we remove from the class any term other than its maximum (*206·72); that if a class has terms in $CʻP$ , and has both a precedent and a sequent, the precedent has the relation $P^{2}$ to the sequent (*206·73), and that the precedent is not identical with the sequent (*206·732). These propositions are in the nature of lemmas, whose use is chiefly in the theory of stretches (*215).

*206·01. $\text{seq}_{P}=\hat{x} \hat{\alpha} \{x\text{min}_{P}pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\} \quad\text{Df}$

*206·02. $\text{prec}_{P}=\hat{x} \hat{\alpha} \{x\text{max}_{P}pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\} \quad\text{Df}$

*206·1. $\vdash :x\text{seq}_{P}\alpha .\equiv .x\text{min}_{P}pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \quad[(*206·01)]$

*206·101. $\vdash .\text{prec}_{P}=\text{seq}(\breve{P} ) \quad[*32·241.*33·22.*205·102]$

We shall not enunciate any other propositions on $\text{prec}_{P}$ (unless for some special reason), since the above proposition enables them to be immediately deduced from the corresponding propositions on $\text{seq}_{P}$ .

*206·11. $\begin{align}&\vdash :x\text{seq}_{P}\alpha .\equiv .x\in pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP-\breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ &[*206·1.*205·1]\end{align}$

Observe that when $\alpha \cap CʻP$ is not null, $pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset CʻP$ , so that the factor $CʻP$ on the right is unnecessary; but when $\alpha\cap CʻP=\Lambda$ , we have $pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=\text{V}$ , so that the factor $CʻP$ becomes relevant. Owing to this factor, the sequents of $\Lambda$ are $\overrightarrow{B}ʻP$ , so that if $BʻP$ exists, is the sequent of $\Lambda$ .

*206·12. $\begin{align}\vdash \colon\colon &x\text{seq}_{P}\alpha .\equiv \colon\ldotp y\in \alpha \cap CʻP.\supset _{y}.yPx:x\in CʻP\colon\ldotp \\ &y\in \alpha \cap CʻP.\supset _{y}.yPz:\supset _{z}.{\sim}(zPx) \quad[*206·11.*40·53.*37·105]\end{align}$

*206·13. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \quad[*206·1]$

*206·131. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cap CʻP) \quad[*206·13.*22·43·621]$

*206·132. $\vdash . \overrightarrow{\text{seq}} _{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \cap CʻP - \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \quad[*206·11]$

*206·133. $\vdash : x \text{seq}_{P}\alpha . \supset . {\sim} (xPx) \quad[*205·194 . *206·13]$

*206·134. $\vdash . \overrightarrow{\text{seq}} _{P}ʻ\alpha = CʻP \cap \hat{x} \{\alpha \cap CʻP \subset \overrightarrow{P}ʻx . \overrightarrow{P}ʻx \subset - pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\}$

Dem. $\begin{array}{l} \vdash . *206·12 . *32·18 . \supset \\ \vdash . \overrightarrow{\text{seq}} _{P}ʻ\alpha &= CʻP \cap \hat{x} (\alpha \cap CʻP \subset \overrightarrow{P}ʻx) \cap \hat{x} \{y \in \alpha \cap CʻP . \supset _{y} . yPz : \supset _{z} . {\sim} (zPx)\}\\ [*40·53] &= CʻP \cap \hat{x} (\alpha \cap CʻP \subset \overrightarrow{P}ʻx) \cap \hat{x} \{z \in pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) . \supset _{z} . {\sim} (zPx)\}\\ [\text{Transp} . *32·18]\\ &= CʻP \cap \hat{x} (\alpha \cap CʻP \subset \overrightarrow{P}ʻx) \cap \hat{x}\{\overrightarrow{P}ʻx \subset - pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\} . \supset \vdash . \text{Prop} \end{array}$

This formula for $\overrightarrow{\text{seq}} _{P}ʻ\alpha$ is usually more convenient than *206·13 ·132.

*206·14. $\vdash : \alpha \cap CʻP = \Lambda . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash . *206·13 . *40·2 . \supset \vdash : \text{Hp} . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha &= \overrightarrow{\text{min}}_{P}ʻ\text{V}\\ [*205·15 . *24·26] &= \overrightarrow{\text{min}}_{P}ʻCʻP\\ [*205·12] &= \overrightarrow{B}ʻP : \supset \vdash . \text{Prop} \end{array}$

*206·141. $\vdash : \exists ! \alpha \cap CʻP . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) - \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)$

Dem. $\begin{array}{l} \vdash . *40·62 . \supset \vdash : \text{Hp} . \supset . pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \subset CʻP &\qquad \text{(1)}\\ \vdash . (1) . *206·132 . \supset \vdash . \text{Prop} \end{array}$

*206·142. $\vdash : \exists ! \alpha \cap CʻP . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha \subset \breve{P} ʻʻ\alpha \quad[*40·61 . *206·141]$

*206·143. $\begin{align}&\vdash : \alpha \subset CʻP . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ\alpha \cap CʻP - \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ\alpha \\ &[*206·132 . *22·621]\end{align}$

*206·144. $\vdash : \exists ! \overrightarrow{\text{seq}} _{P}ʻ\alpha . \supset . \exists ! pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) \quad[*206·132]$

*206·15. $\begin{align}&\vdash : \alpha \subset CʻP . \exists ! \alpha . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ\alpha - \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ\alpha\\ &[*206·141 . *22·621]\end{align}$

*206·16. $\vdash : P \in \text{connex} . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha \in 0 \cup 1 \quad[*205·3 . *206·13]$

*206·161. $\vdash : P \in \text{connex} . \supset . \text{seq}_{P} \in 1 \rightarrow \text{Cls} \quad[*206·16 . *71·12]$

Thus in a series, or in any connected relation, no class has more than one sequent.

*206·17. $\begin{align}\vdash \colon\ldotp x \text{seq}_{P}\alpha .\equiv :y\in \alpha \cap CʻP.\supset _{y}.&yPx:x\in CʻP:\\ &yPx.\supset _{y}.(\exists z).z\in \alpha \cap CʻP.{\sim}(zPy)\end{align}$

Dem. $\begin{array}{l} \vdash .*37·462.*206·11.\supset \\ \vdash \colon\ldotp x \text{seq}_{P}\alpha .&\equiv :x\in pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP):\\ [*40·53] &\equiv :y\in \alpha \cap CʻP.\supset _{y}.yPx:x\in CʻP:\\ &yPx.\supset _{y}.(\exists z).z\in \alpha \cap CʻP.{\sim}(zPy)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The following propositions give simplified formulae for $\overrightarrow{\text{seq}} _{P}ʻ\alpha$ in various special cases.

*206·171. $\begin{align}\vdash :P\in &\text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} \{\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset (\alpha \cap CʻP)\cup Pʻʻ\alpha\}\end{align}$

Dem. $\begin{array}{l} \vdash .*206·134.*33·152.\supset \\ \vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x}\{\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset CʻP-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\} &\qquad \text{(1)}\\ \vdash .(1).*202·503.\supset \vdash .\text{Prop} \end{array}$

*206·172. $\begin{align}\vdash :P\in &\text{connex} .P^{2}\,\unicode{x2abd}\, J.Pʻʻ\alpha \subset \alpha .\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\alpha \cap CʻP=\overrightarrow{P}ʻx) \quad[*206·171.*22·62]\end{align}$

*206·173. $\begin{align}\vdash :P\in &\text{connex} .P^{2}\,\unicode{x2abd}\, J.\alpha \cap CʻP\subset Pʻʻ\alpha .\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} \{\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha\} &[*206·171.*22·62]\end{align}$

*206·174. $\vdash :P\in \text{Ser}.\alpha \cap CʻP\subset Pʻʻ\alpha .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\overrightarrow{P}ʻx=Pʻʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*13·12.*22·42.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &\overrightarrow{P}ʻx=Pʻʻ\alpha .\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*37·265.&\supset \vdash :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\supset .Pʻʻ\alpha \subset Pʻʻ\overrightarrow{P}ʻx:\\ [*201·501] \supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\supset .Pʻʻ\alpha \subset \overrightarrow{P}ʻx:\\ [\text{Fact}] &\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha .\supset .Pʻʻ\alpha =\overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).*206·173.\supset \vdash .\text{Prop} \end{array}$

The propositions *206·173 ·174 deal with limits. When a class $\alpha$ has no maximum, i.e. when $\alpha \cap CʻP\subset Pʻʻ\alpha$ , its sequent (if any) is called its limit. By the above propositions, the limit is a term $x$ such that $\alpha \cap CʻP$ precedes $x$ , but every predecessor of $x$ precedes some member of $\alpha \cap CʻP$ (*206·173); it is also a term $x$ whose predecessors are identical with the predecessors of $\alpha$ (*206·174). The subject of limits will be explicitly treated in *207.

*206·18. $\vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha \subset CʻP \quad[*206·132]$

*206·181. $\vdash :\exists !\alpha \cap CʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha \subset \text{ᗡ}ʻP \quad[*206·142.*37·16]$

Dem. $\begin{array}{l} \vdash .*40·68.\text{Transp}.\supset \vdash .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)-\breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .(1).*206·132.\supset \vdash .\text{Prop} \end{array}$

*206·21. $\vdash :P^{2}\,\unicode{x2abd}\, J.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha \subset -Pʻʻ\alpha \quad[*200·53.*206·132]$

*206·211. $\vdash :\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha$

Dem. $\vdash .*206·17.\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \alpha \cap CʻP.\supset _{y}.yP\text{seq}_{P}ʻ\alpha \colon\ldotp \supset \vdash .\text{Prop}$

*206·212. $\vdash :P\in \text{trans}.\text{E}!\text{seq}_{P}ʻ\alpha .\supset .Pʻʻ\alpha \subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *206·211.\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha &\subset Pʻʻ\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \\ [*201·501] &\subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·213. $\vdash :P\in \text{connex} .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \subset (\alpha \cap CʻP)\cup Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·17.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp yP\text{seq}_{P}ʻ\alpha .&\supset _{y}:(\exists z).z\in (\alpha \cap CʻP).{\sim}(zPy):\\ [*202·103] &\supset _{y}:(\exists z):z\in \alpha \cap CʻP:y=z.\lor.yPz:\\ [*13·195.*37·1] &\supset _{y}:y\in \alpha \cap CʻP.\lor.y\in Pʻʻ(\alpha \cap CʻP):\\ [*37·265] & \supset _{y}:y\in (\alpha \cap CʻP)\cup Pʻʻ\alpha \colon\colon\supset \vdash .\text{Prop} \end{array}$

*206·22. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .&\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =(\alpha \cap CʻP)\cup Pʻʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha \cup Pʻʻ\alpha \\ &[*206·211·212·213.*205·131]\end{align}$

*206·23. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .&\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\iota ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha =pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*205·22.*206·13.\supset \\ \vdash :\text{Hp}.\supset .\iota ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha &=\iota ʻ\text{seq}_{P}ʻ\alpha \cup \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*206·13.*53·31]&=\overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cup \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*205·13] &=pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP\cup \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*201·51.*37·16] &=pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP:\supset \vdash .\text{Prop} \end{array}$

*206·24. $\vdash : P \in \text{trans} . \beta \subset Pʻʻ\alpha . \supset . \overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup \beta ) = \overrightarrow{\text{seq}} _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *201·56 . \supset \vdash : \text{Hp} . \supset . pʻ\overleftarrow{P}ʻʻ\{(\alpha \cup \beta ) \cap CʻP\} = pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash . (1) . *206·13 . \supset \vdash . \text{Prop} \end{array}$

*206·25. $\vdash : P \in \text{trans} . \supset . \overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup Pʻʻ\alpha ) = \overrightarrow{\text{seq}} _{P}ʻ\alpha \quad[*206·24]$

*206·26. $\begin{align}\vdash : P \in \text{trans} \cap \text{connex} . \exists ! \alpha \cap &CʻP . \text{E}! \text{seq}_{P}ʻ\alpha . \supset .\\ &pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = {℩}ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha\end{align}$

*206·27. $\begin{align}\vdash : P \in \text{trans} \cap \text{connex} . \text{E}! \text{seq}_{P}ʻ&\alpha . \text{E}! \text{max}_{P}ʻ\alpha . \supset .\\ &\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha = \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup {℩}ʻ\text{max}_{P}ʻ\alpha.\\ &\overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha = \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha \cup {℩}ʻ\text{seq}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash . *206·22 . \supset \vdash : \text{Hp} . \supset . \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha &= \overrightarrow{\text{max}}_{P}ʻ\alpha \cup Pʻʻ\alpha \\ [*205·22] &= {℩}ʻ\text{max}_{P}ʻ\alpha \cup \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *205·65 . &\supset \vdash : \text{Hp} . \supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(2)}\\ \vdash . *205·151·161 . &\supset \vdash : \text{Hp} . \supset . \exists ! (\alpha \cap CʻP) &\qquad \text{(3)}\\ \vdash . (3) . *206·26 . &\supset \vdash : \text{Hp} . \supset . pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = {℩}ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha &\qquad \text{(4)}\\ \vdash . (2) . (4) . &\supset \vdash : \text{Hp} . \supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha = {℩}ʻ\text{seq}_{P}ʻ\alpha \cup \overleftarrow{P}ʻ\text{seq}_{P}ʻ\alpha &\qquad \text{(5)}\\ \vdash . (1) . (5) . \supset \vdash . \text{Prop} \end{array}$

*206·28. $\begin{align}\vdash \colon\ldotp P \in \text{Ser} . &\supset :\\ &x \in CʻP - \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha . \equiv . x = \text{seq}_{P}ʻ\alpha . {\sim} \text{E}! \text{max}_{P}ʻ\alpha \end{align}$

Dem. $\begin{array}{l} \vdash . *206·174 . *205·6 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : x = \text{seq}_{P}ʻ\alpha . {\sim} \text{E}! \text{max}_{P}ʻ\alpha . &\supset . x \in CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha .\\ [*206·2] &\supset . x \in CʻP - \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash . *37·1 . &\supset \vdash : xPy . y \in \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha . \supset . x \in \overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash . (2) . \text{Transp} . &\supset \vdash : P \,\unicode{x2abd}\, J . y \in \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha . \supset . {\sim} (xPy) &\qquad \text{(3)}\\ \vdash . *13·14 . &\supset \vdash : x \in CʻP - \alpha . y \in \alpha . \supset . x \neq y &\qquad \text{(4)}\\ \vdash . (3) . (4) . *202·103 . &\supset \vdash \colon\ldotp \text{Hp} . \supset :\\ &x \in CʻP - \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha . y \in \alpha \cap CʻP . \supset . yPx :\\ [*32·18] &\supset : x \in CʻP - \alpha . \overrightarrow{P}ʻx = Pʻʻ\alpha . \supset . \alpha \cap CʻP \subset \overrightarrow{P}ʻx &\qquad \text{(5)}\\ \vdash .(5).*206·171·16.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &x\in CʻP-\alpha .\overrightarrow{P}ʻx = Pʻʻ\alpha .\supset .x = \text{seq}_{P}ʻ\alpha &\qquad \text{(6)}\\ \vdash .(5).*205·123. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &x\in CʻP-\alpha .\overrightarrow{P}ʻx = Pʻʻ\alpha .\supset .{\sim}\text{E}!\text{max}_{P}ʻ\alpha &\qquad \text{(7)}\\ \vdash .(1).(6).(7).\supset \vdash .\text{Prop} \end{array}$

*206·3. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\alpha \subset CʻP.Pʻʻ\alpha \subset &\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha = \alpha \quad[*206·22]\end{align}$

*206·31. $\begin{align}&\vdash :P\in \text{trans} \cap \text{connex} .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\supset .\overrightarrow{P}ʻ\text{seq}_{P}ʻPʻʻ\alpha = Pʻʻ\alpha\\ &[*206·3.*201·5]\end{align}$

*206·32. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ&Pʻʻ\alpha .\supset .\\ &\text{max}_{P}ʻ\alpha = \text{seq}_{P}ʻPʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*206·31.*205·22.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha = \overrightarrow{P}ʻ\text{seq}_{P}ʻPʻʻ\alpha :\\ [*205·194.*206·133]&\supset :{\sim}(\text{seq}_{P}ʻPʻʻ\alpha P \text{max}_{P}ʻ\alpha ).{\sim}(\text{max}_{P}ʻ\alpha P \text{seq}_{P}ʻʻ\alpha ):\\ [*202·103] &\supset :\text{max}_{P}ʻ\alpha = \text{seq}_{P}ʻPʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

In the hypothesis of *206·32, we have both $\text{E}!\text{max}_{P}ʻ\alpha$ and $\text{E}!\text{seq}_{P}ʻPʻʻ\alpha$ . So long as $P$ is not contained in diversity, these are both necessary. For example, suppose we take $P = \alpha \uparrow (\alpha \cup \iota ʻx),\,\text{where}\, x{\sim}\in \alpha .\exists !\alpha .$ Then $P$ is transitive and connected, but not contained in diversity. We have $\alpha \cup \iota ʻx = CʻP.Pʻʻ(\alpha \cup \iota ʻx) = \alpha = \text{D}ʻP.$ Also $\begin{aligned} \text{max}_{P}ʻ(\alpha \cup \iota ʻx) &= x\,\\ \overrightarrow{\text{seq}} _{P}ʻPʻʻ(\alpha \cup \iota ʻx) &= \overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ\alpha = \overrightarrow{\text{min}}_{P}ʻ(\alpha \cup \iota ʻx) = \Lambda . \end{aligned}$ Thus in this case $\text{max}_{P}ʻ(\alpha \cup \iota ʻx)$ exists, but $\text{seq}_{P}ʻPʻʻ(\alpha \cup \iota ʻx)$ does not exist. When $P$ is serial, i.e. when $P$ is contained in diversity, in addition to being transitive and connected, the existence of $\text{max}_{P}ʻ\alpha$ involves that of $\text{seq}_{P}ʻPʻʻ\alpha$ , and therefore the hypothesis $\text{E}!\text{seq}_{P}ʻPʻʻ\alpha$ , which appears in *206·32, becomes unnecessary.

*206·33. $\vdash :P\in \text{trans} \cap \text{connex} .{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\supset .\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·6. \supset \vdash :\text{Hp}.&\supset .\alpha \cap CʻP\subset Pʻʻ\alpha .\\ [*22·62.*37·15] &\supset .(\alpha \cup Pʻʻ\alpha )\cap CʻP = Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*206·25 .\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha &= \overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup Pʻʻ\alpha )\\ [*206·131] &= \overrightarrow{\text{seq}} _{P}ʻ\{(\alpha \cup Pʻʻ\alpha )\cap CʻP\}\\ [(1)] &= \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·331. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{seq}_{P}ʻPʻʻ\alpha =\text{seq}_{P}ʻ\alpha \\ &[*206·33]\end{align}$

*206·34. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha \subset \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha$

Dem. $\begin{array}{l} \vdash *205·101.*37·265.\supset \\ \vdash \colon\ldotp y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .\equiv :&y\in \alpha \cap CʻP:z\in \alpha \cap CʻP.\supset _{z}.{\sim}(yPz) &\qquad \text{(1)}\\ \vdash .(1).*202·103.&\supset \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon\\ &y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .\supset \colon\ldotp y\in \alpha \cap CʻP\colon\ldotp z\in \alpha \cap CʻP.\supset _{z}:z=y.\lor.zPy &\qquad \text{(2)}\\ \vdash .(2).*13·195.*201·1.\supset \vdash \colon\colon\ldotp \text{Hp}.\supset \colon\colon\\ &y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .\supset \colon\ldotp y\in \alpha \cap CʻP\colon\ldotp z\in \alpha \cap CʻP.uPz.\supset _{u,z}.uPy\colon\ldotp \\ [*37·1·265] &\supset \colon\ldotp u\in Pʻʻ\alpha .\supset _{u}.uPy\colon\ldotp \\ [*40·53] &\supset \colon\ldotp y\in pʻ\overleftarrow{P}ʻʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).*37·1. &\supset \vdash :y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .vPy.\supset .v\in Pʻʻ\alpha &\qquad \text{(4)}\\ \vdash .*50·24. & \supset \vdash :\text{Hp}.\supset .{\sim}(vPv) &\qquad \text{(5)}\\ \vdash .(4).(5). & \supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .vPy.\supset .(\exists w).w\in Pʻʻ\alpha .{\sim}(wPv).\\ [*40·53] & \supset .v{\sim}\in pʻ\overleftarrow{P}ʻʻPʻʻ\alpha :\\ [*10·51] \supset :y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .&\supset .{\sim}(\exists v)·v\in pʻ\overleftarrow{P}ʻʻPʻʻ\alpha .vPy.\\ [*37·105] &\supset .y{\sim}\in \breve{P} ʻʻpʻ\overleftarrow{P}ʻʻPʻʻ\alpha &\qquad \text{(6)}\\ \vdash .(3).(6).(1).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ &y\in \overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .y\in pʻ\overleftarrow{P}ʻʻPʻʻ\alpha \cap CʻP-\breve{P} ʻʻpʻ\overleftarrow{P}ʻʻPʻʻ\alpha .\\ [*206·143] &\supset .y\in \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*206·35. $\vdash :P\in \text{Ser}.\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{max}_{P}ʻ\alpha =\text{seq}_{P}ʻPʻʻ\alpha .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·34. &\supset \vdash :\text{Hp}.\supset .\text{max}_{P}ʻ\alpha \in \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*206·16.&\supset \vdash :\text{Hp}.\supset .\text{max}_{P}ʻ\alpha =\text{seq}_{P}ʻPʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*14·21. &\supset \vdash :\text{Hp}.\supset .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*206·36. $\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp \text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\equiv :\text{E}!\text{max}_{P}ʻ\alpha .\lor.\text{E}!\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·35·331.&\supset \vdash \colon\ldotp \text{Hp}:\text{E}!\text{max}_{P}ʻ\alpha .\lor.\text{E}!\text{seq}_{P}ʻ\alpha :\supset .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*206·34. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\supset .{\sim}\text{E}!\text{max}_{P}ʻ\alpha . &\qquad \text{(2)}\\ [*206·33] &\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).&\supset \vdash .\text{Prop} \end{array}$

The condition $(\alpha ):\text{E}!\text{max}_{P}ʻ\alpha.\lor.\text{E}!\text{seq}_{P}ʻ\alpha$ is the definition of what may be called "Dedekindian" series, i.e. series in which, when any division of the field into two parts is made in such a way that the first part wholly precedes the second, then either the first part has a last term or the second part has a first term. (When these alternatives are also mutually exclusive, the series has "Dedekindian continuity.") If $\alpha$ is any class, $Pʻʻ\alpha$ is the segment of $CʻP$ defined by $\alpha$ . In virtue of the above proposition, every segment of a Dedekindian series has a sequent. The sequent of a class having no maximum is what is commonly called a limit. Thus in a series having Dedekindian continuity (in which segments never have maxima), every segment has a limit.

*206·37. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*205·16.\supset \vdash :&\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\Lambda .\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=\Lambda &\qquad \text{(1)}\\ \vdash .*206·36.\supset \vdash :\text{Hp}.\text{Hp}(1).&\supset .{\sim}\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\\ [*206·16] &\supset .\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha =\Lambda &\qquad \text{(2)}\\ \vdash .*24·24. \supset \vdash :\text{Hp}.&\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=\overrightarrow{\text{min}}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻ\alpha \\ [*205·17.*206·16] &=\overrightarrow{\text{seq}} _{P}ʻ\alpha \\ [*206·33] &=\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*205·17·3.&\supset \vdash :\text{Hp}.\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\Lambda .\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=\overrightarrow{\text{max}}_{P}ʻ\alpha \\ [*206·35] & =\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(4)}\\ \vdash .*206·16.*205·3.\supset \\ \vdash :\text{Hp}.\exists !&\overrightarrow{\text{max}}_{P}ʻ\alpha .\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .\\ &\overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=\overrightarrow{\text{min}}_{P}ʻ({℩}ʻ\text{max}_{P}ʻ\alpha \cup {℩}ʻ\text{seq}_{P}ʻ\alpha )\\ [*206·27.*205·182] & ={℩}ʻ\text{max}_{P}ʻ\alpha \\ [*206·35] &=\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*206·38. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\alpha \cap \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·35.*205·111.\supset\\ \vdash :\text{Hp}.\text{E}!\text{max}_{P}ʻ\alpha .&\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha .\overrightarrow{\text{max}}_{P}ʻ\alpha \subset \alpha .\\ [*22·621] &\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\alpha \cap \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*205·3. \supset \vdash :\text{Hp}.{\sim}\text{E}!\text{max}_{P}ʻ\alpha .&\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda &\qquad \text{(2)}\\ \vdash .*206·33. \supset \vdash :\text{Hp}.{\sim}\text{E}!\text{max}_{P}ʻ\alpha .&\supset .\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha .\\ [*206·2] &\supset .\alpha \cap \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha =\Lambda .\\ [(2)] &\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\alpha \cap \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*206·4. $\vdash :P\,\unicode{x2abd}\, J.x\in CʻP.\supset .x\text{seq}_{P}\overrightarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash .*206·134.*22·43.\supset \\ \vdash :x\text{seq}_{P}\overrightarrow{P}ʻx.\equiv .x\in .CʻP.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(1)}\\ \vdash .*200·5.\supset \vdash :P\,\unicode{x2abd}\, J.\supset .\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*206·401. $\vdash :P\in \text{connex} \cap \text{Rl}ʻJ.x\in CʻP.\supset .x=\text{seq}_{P}ʻ\overrightarrow{P}ʻx \quad[*206·4·161]$

*206·41. $\vdash .\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx=\overleftarrow{P\dot{-} P^{2}}ʻx \quad[*205·25]$

*206·42. $\vdash :x\in CʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ{℩}ʻx=\overleftarrow{P\dot{-} P^{2}}ʻx=\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash .*53·01·31.\supset \vdash .pʻ\overleftarrow{P}ʻʻ{℩}ʻx=\overleftarrow{P}ʻx &\qquad \text{(1)}\\ \vdash .(1).*206·41·143.\supset \vdash .\text{Prop} \end{array}$

*206·43. $\begin{align}&\vdash :P\in \text{trans}\cap \text{Rl}ʻJ.x\in CʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ{℩}ʻx=\overleftarrow{P}_{1}ʻx\\ &[*206·42.*201·63]\end{align}$

*206·44. $\begin{align}\vdash \colon\ldotp P\in &\text{trans}\cap \text{Rl}ʻJ.x\in CʻP.\supset :\\ &\text{E}!\text{seq}_{P}ʻ{℩}ʻx.\equiv .\text{E}!\breve{P} _{1}ʻx:\text{E}!\text{seq}_{P}ʻ{℩}ʻx.\supset .\text{seq}_{P}ʻ{℩}ʻx=\breve{P} _{1}ʻx\\ [*206·43]\end{align}$

*206·45. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.x\in CʻP.\supset :\text{E}!\text{seq}_{P}ʻ{℩}ʻx.\equiv .x\in \text{D}ʻP_{1}\\ &[*206·44.*204·7.*71·165]\end{align}$

*206·451. $\vdash :P\in \text{Ser}.\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{P}_{1}ʻ\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·41.\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}_{1}ʻ\text{seq}_{P}ʻ\alpha &=\overrightarrow{\text{max}}pʻ\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \\ [*206·22] &=\overrightarrow{\text{max}}pʻ{(\alpha \cap CʻP)\cup Pʻʻ\alpha } [*205·191] &=\overrightarrow{\text{max}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·46. $\vdash : P \in \text{trans} \cap \text{connex} . \text{E}! \text{max}_{P}ʻ\alpha . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *206·42 . \supset \vdash : \text{Hp} . \supset . &\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{max}}_{P}ʻ\alpha\\ &= \overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha\\ [*205·65] &= \overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*206·13] &= \overrightarrow{\text{seq}} _{P}ʻ\alpha : \supset \vdash . \text{Prop} \end{array}$

*206·47. $\vdash : P \in \text{trans} . \text{E}! \text{seq}_{P}ʻ\alpha . \supset . \text{seq}_{P}ʻ\alpha = \text{max}_{P}ʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash . *206·134 . \supset \vdash : \text{Hp} . &\supset . \alpha \cap CʻP \subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha .\\ [*205·193·151] \supset . \overrightarrow{\text{max}}_{P}ʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) &=\overrightarrow{\text{max}}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻ\alpha \\ [*206·133 . *205·18] &= {℩}ʻ\text{seq}_{P}ʻ\alpha : \supset \vdash . \text{Prop} \end{array}$

*206·48. $\vdash : P \in \text{trans} \cap \text{connex} . \text{E}! \text{seq}_{P}ʻ\alpha . \supset . \overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash . *206·47 . &\supset \vdash : \text{Hp} . \supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{max}}_{P}ʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) . \text{E}! \text{max}_{P}ʻ(\alpha \cup \text{seq}_{P}ʻ\alpha ) .\\ [*206·46] &\supset . \overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) : \supset \vdash . \text{Prop} \end{array}$

*206·5. $\begin{align}\vdash : P \in \text{trans} \cap \text{connex} . \text{E}! \text{max}_{P}ʻ\alpha . \text{E}! &\text{seq}_{P}ʻ\alpha . \supset .\\ &\text{max}_Pʻ\alpha (P \dot{-} P^{2}) \text{seq}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash . *206·46 . \supset \vdash : \text{Hp} . \supset . \overrightarrow{\text{seq}} _{P}ʻ\alpha &= \overrightarrow{\text{seq}} _{P}ʻ{℩}ʻ\text{max}_{P}ʻ\alpha\\ [*206·42] &= \overleftarrow{P\dot{-} P^{2}}ʻ\text{max}_{P}ʻ\alpha : \supset \vdash . \text{Prop} \end{array}$

*206·51. $\vdash : \exists ! \overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx . \supset . x \text{seq}_{P} \overrightarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash . *205·161 . \supset \vdash : \text{Hp} . &\supset . \exists ! \overrightarrow{P}ʻx .\\ [*33·42] &\supset . x \in CʻP &\qquad \text{(1)}\\ \vdash . (1) . *206·134 . \supset \vdash \colon\ldotp \text{Hp} . \supset : x \text{seq}_{P}\overrightarrow{P}ʻx . &\equiv . \overrightarrow{P}ʻx \subset \overrightarrow{P}ʻx . \overrightarrow{P}ʻx \subset - pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx .\\ [*22·42] &\equiv . \overrightarrow{P}ʻx \subset - pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash . *205·101 . \supset \vdash \colon\ldotp y \in \overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx . &\supset : yPx . y {\sim} \in Pʻʻ\overrightarrow{P}ʻx :\\ [*37·1] &\supset : yPx : zPx . \supset _{z} . {\sim} (yPz) :\\ [*32·18 . *5·31] &\supset : zPx . \supset _{z} . y \in \overrightarrow{P}ʻx . {\sim} (yPz) .\\ [*40·53] &\supset _{z} . z {\sim} \in pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx :\\ [*32·18] &\supset : \overrightarrow{P}ʻx \subset - pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash . (2) . (3) . &\supset \vdash : \text{Hp} . y \in \overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx . \supset . x \text{seq}_{P}\overrightarrow{P}ʻx : \supset \vdash . \text{Prop} \end{array}$

*206·52. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\text{E}!\text{max}_{P}ʻ&Pʻʻ\alpha .\supset .\\ &\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\text{seq}_{P}ʻPʻʻ\alpha =\text{max}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*205·7. \supset \vdash :\text{Hp}.&\supset .\text{E}!\text{max}_{P}ʻ\alpha . &\qquad \text{(1)}\\ [*205·22] &\supset .Pʻʻ\alpha =\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*206·51. \supset \vdash :\text{Hp}.&\supset .\text{max}_{P}ʻ\alpha \text{seq}_{P}Pʻʻ\alpha .\\ [*206·161] &\supset .\text{max}_{P}ʻ\alpha =\text{seq}_{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*206·53. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·13.\supset \vdash .\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)&=\overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ\{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP\}\\ [*205·15·16.*206·18.*200·54] &=\overrightarrow{\text{min}}_{P}ʻ\{CʻP\cap pʻ\overleftarrow{P}ʻʻpʻ\overrightarrow{P} ʻʻ(\alpha \cap CʻP)\} &\qquad \text{(1)}\\ \vdash .(1).*204·62. \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP )&=\overrightarrow{\text{min}}_{P}ʻ\{(\alpha \cap CʻP)\cup \breve{P} ʻʻ\alpha\}\\ [*205·19.*201·52] &=\overrightarrow{\text{min}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·531. $\begin{align}\vdash :P&\in \text{Ser}.\supset .\\ &CʻP\cap \hat{x} \{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻx\}=\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{\text{min}}_{P}ʻ\alpha \end{align}$

Dem. $\begin{array}{l} \vdash .*206·172.*201·51.\supset \\ \vdash :\text{Hp}.\supset .&\overrightarrow{\text{seq}} _{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=CʻP\cap \hat{x} \{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP=\overrightarrow{P}ʻx\} &\qquad \text{(1)}\\ \vdash .(1).*40·62.&\supset \vdash :\text{Hp}.\exists !(\alpha \cap CʻP).\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=CʻP\cap \hat{x} \{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻx\} &\qquad \text{(2)}\\ \vdash .*205·16.*206·53. &\supset \vdash :\text{Hp}.\alpha \cap CʻP=\Lambda .\supset .\overrightarrow{\text{seq}} _{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)=\Lambda &\qquad \text{(3)}\\ \vdash .*40·2.\supset \vdash :\alpha \cap CʻP=\Lambda .\supset . &CʻP\cap \hat{x} \{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻx\}=CʻP\cap \hat{x} (\text{V}=\overrightarrow{P}ʻx) &\qquad \text{(4)}\\ \vdash .*50·24. \supset \vdash :\text{Hp}.&\supset .(x).x{\sim}\in \overrightarrow{P}ʻx.\\ [*24·104] &\supset .(x).\overrightarrow{P}ʻx\neq \text{V} &\qquad \text{(5)}\\ \vdash .(4).(5). \supset \vdash :\text{Hp}.\alpha \cap CʻP=\Lambda .\supset .CʻP\cap \hat{x} &\{pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)=\overrightarrow{P}ʻx\}=\Lambda \\ [(3)] &=\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(6)}\\ \vdash .(2).(6).*206·53.\supset \vdash .\text{Prop} \end{array}$

*206·54. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\supset :&\text{E}!\text{seq}_{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\equiv .\text{E}!\text{min}_{P}ʻ\alpha :\\ &\text{E}!\text{max}_{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\equiv .\text{E}!\text{prec}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*206·53. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{seq}_{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\equiv .\text{E}!\text{min}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*206·13·101. &\supset \vdash :\text{E}!\text{max}_{P}ʻpʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\equiv .\text{E}!\text{prec}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*206·55. $\begin{align}\vdash \colon\ldotp &P\in \text{Ser}.\supset :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{min}_{P}\cup \text{ᗡ}ʻ\text{prec}_{P}.\equiv .\\ &(\alpha ).pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} \quad[*206·54·161.*205·32]\end{align}$

*206·551. $\begin{align}\vdash :P\in \text{Ser}.\supset .&\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha = \overrightarrow{\text{max}}_{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\end{align}$

Dem. $\begin{array}{l} \vdash .*206·13. &\supset \vdash .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{min}}_{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .(1).*206·53.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻ{pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\cap CʻP} &\qquad \text{(2)}\\ \vdash .(2).*200·54.&\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(3)}\\ \vdash .*206·18. &\supset \vdash :P = \dot{\Lambda} .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \Lambda .\overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = \Lambda &\qquad \text{(4)}\\ \vdash .(3).(4). & \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(5)}\\ \vdash .*206·53. \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha &= \overrightarrow{\text{prec}} _{P}ʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ [*206·13·101.*200·54] & = \overrightarrow{\text{max}}_{P}ʻpʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*206·56. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\supset :(\alpha ).pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\in &\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}. \equiv .\\ &(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*10·1·11.\supset \vdash :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}&\cup \text{ᗡ}ʻ\text{seq}_{P}.\supset .\\ &(\alpha ).pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(1)}\\ \vdash .*10·1. \supset \vdash :(\alpha ).&pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\supset .\\ &pʻ\overrightarrow{P}ʻʻpʻ\overleftarrow{P}ʻʻ(\beta \cap CʻP)\in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\\ [*206·551] &\supset .\beta \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*206·57. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\supset :&(\alpha ).\alpha \in \text{ᗡ}ʻ\text{min}_{P}\cup \text{ᗡ}ʻ\text{prec}_{P}. \equiv .\\ &(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} \quad[*206·55·56]\end{align}$

This proposition is important, since it shows that when a serial relation satisfies Dedekind's axiom, so does its converse. Thus if all classes which have no maximum have an upper limit, then all classes which have no minimum have a lower limit, and vice versa.

*206·6. $\vdash :S\in P \overline{\,\text{smor}\,} Q.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) = Sʻʻpʻ\overleftarrow{Q}ʻʻ\breve{S} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*151·11.\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &= pʻSʻʻʻ\breve{Q} ʻʻʻ\overleftarrow{S}ʻʻ(\alpha \cap \text{D}ʻS)\\ [*72·341] &= Sʻʻpʻ\breve{Q} ʻʻʻ\overleftarrow{S}ʻʻ(\alpha \cap \text{D}ʻS)\\ [*71·613] & = Sʻʻpʻ\overleftarrow{Q}ʻʻ\breve{S} ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·61. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{seq}} _{Q}ʻ\breve{S} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·8.*206·6·13.\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha &=Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻSʻʻpʻ\overleftarrow{Q}ʻʻ\breve{S} ʻʻ\alpha\\ [*72·501.*151·11] &=Sʻʻ\overrightarrow{\text{min}}_{Q}ʻ(pʻ\overleftarrow{Q}ʻʻ\breve{S} ʻʻ\alpha \cap CʻQ)\\ [*206·13.*205·15] &=Sʻʻ\overrightarrow{\text{seq}} _{Q}ʻ\breve{S} ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*206·62. $\begin{align}&\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\supset :\text{E}!\text{seq}_{P}ʻ\alpha .\equiv .\text{E}!\text{seq}_{Q}ʻ\breve{S} ʻʻ\alpha \\ &[*206·61.*73·22·44.*53·3]\end{align}$

*206·63. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{seq}_{P}ʻ\alpha =Sʻ\text{seq}_{Q}ʻ\breve{S} ʻʻ\alpha \\ &[*206·61·62.*53·31]\end{align}$

*206·7. $\begin{align}\vdash :P\in \text{trans}.\beta \subset CʻP.{\sim}(yPy).y{\sim}\in &\overrightarrow{\text{max}}_{P}ʻ\beta .\supset .\\ &pʻ\overleftarrow{P}ʻʻ\beta =pʻ\overleftarrow{P}ʻʻ(\beta -{℩}ʻy)\end{align}$

Dem. $\begin{array}{l} \vdash .*51·222. \supset \vdash :y{\sim}\in \beta .&\supset .pʻ\overleftarrow{P}ʻʻ\beta =pʻ\overleftarrow{P}ʻʻ(\beta -{℩}ʻy) &\qquad \text{(1)}\\ \vdash .*205·111.\supset \vdash \colon\ldotp \text{Hp}.y\in \beta .&\supset :y\in Pʻʻ\beta .{\sim}(yPy):\\ [*37·1] &\supset :(\exists x).x\in \beta -{℩}ʻy.yPx:\\ [*10·56.\text{Hp}] &\supset :z\in pʻ\overleftarrow{P}ʻʻ(\beta -{℩}ʻy).\supset .yPz:\\ [*53·14.*51·221] &\supset :pʻ\overleftarrow{P}ʻʻ(\beta -{℩}ʻy)\subset pʻ\overleftarrow{P}ʻʻ\beta :\\ [*40·16] &\supset :pʻ\overleftarrow{P}ʻʻ(\beta -{℩}ʻy)=pʻ\overleftarrow{P}ʻʻ\beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*206·71. $\vdash :P\in \text{trans}.\beta \subset CʻP.{\sim}(yPy).y{\sim}\in \overrightarrow{\text{max}}_{P}ʻ\beta .\supset .\overrightarrow{\text{seq}} _{P}ʻ\beta =\overrightarrow{\text{seq}} _{P}ʻ(\beta -{℩}ʻy)$

Dem. $\begin{array}{l} \vdash .*51·222. \supset \vdash :y{\sim}\in \beta .&\supset .\overrightarrow{\text{seq}} _{P}ʻ\beta =\overrightarrow{\text{seq}} _{P}ʻ(\beta -{℩}ʻy) &\qquad \text{(1)}\\ \vdash .*205·111.\supset \vdash :\text{Hp}.y\in \beta .&\supset .y\in Pʻʻ\beta .{\sim}(yPy).\\ [*37·1] & \supset .(\exists z).z\in \beta -{℩}ʻy.yPz &\qquad \text{(2)}\\ \vdash .(2).*10·56.*201·1.&\supset \vdash :\text{Hp}.y\in \beta .\beta -{℩}ʻy\subset \overrightarrow{P}ʻx.\supset .yPx.\\ [*32·18] &\supset .\beta \subset \overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash .(3).*206·7.&\supset \vdash \colon\ldotp \text{Hp}(2).\supset :\\ &\beta \subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overrightarrow{P}ʻʻ\beta .\equiv .\beta -{℩}ʻy\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overrightarrow{P}ʻʻ(\beta -{℩}ʻy):\\ [*206·134]&\supset :x\text{seq}_{P}\beta .\equiv .x\text{seq}_{P}(\beta -{℩}ʻy) &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*206·72. $\vdash :P\in \text{trans}.{\sim}(yPy).y{\sim}\in \overrightarrow{\text{max}}_{P}ʻ\beta .\supset .\overrightarrow{\text{seq}} _{P}ʻ\beta =\overrightarrow{\text{seq}} _{P}ʻ(\beta -{℩}ʻy)$

Dem. $\begin{array}{l} \vdash .*206·71·131.*205·151.\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\beta &=\overrightarrow{\text{seq}} _{P}ʻ(\beta \cap CʻP-{℩}ʻy)\\ [*206·131] & =\overrightarrow{\text{seq}} _{P}ʻ(\beta -{℩}ʻy):\supset \vdash .\text{Prop} \end{array}$

*206·73. $\vdash :\exists !\gamma \cap CʻP.\text{E}!\text{prec}_{P}ʻ\gamma .\text{E}!\text{seq}_{P}ʻ\gamma .\supset .\text{prec}_{P}ʻ\gamma P^{2}\text{seq}_{P}ʻ\gamma$

Dem. $\begin{array}{l} \vdash .*206·211.\supset \vdash :\text{Hp}.&\supset .\gamma \cap CʻP\subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\gamma \cap \overleftarrow{P}ʻ\text{prec}_{P}ʻ\gamma .\exists !\gamma \cap CʻP.\\ [*34·11] &\supset .\text{prec}_{P}ʻ\gamma P^{2}\text{seq}_{P}ʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

*206·731. $\vdash \colon\ldotp \exists !\gamma \cap CʻP:P\in \text{trans}.\lor.P^{2}\,\unicode{x2abd}\, J:\supset .{\sim}(\text{prec}_{P}ʻ\gamma =\text{seq}_{P}ʻ\gamma )$

Dem. $\begin{array}{l} \vdash .*206·73.\supset \\ \vdash :\exists !\gamma \cap CʻP.\text{E}!\text{prec}_{P}ʻ\gamma .\text{E}!\text{seq}_{P}ʻ\gamma .P\in \text{trans}.&\supset .\text{prec}_{P}ʻ\gamma P\text{seq}_{P}ʻ\gamma .\\ [*206·133] &\supset .\text{prec}_{P}ʻ\gamma \neq \text{seq}_{P}ʻ\gamma &\qquad \text{(1)}\\ \vdash .*206·73.\supset \\ \vdash :\exists !\gamma \cap CʻP.\text{E}!\text{prec}_{P}ʻ\gamma .\text{E}!\text{seq}_{P}ʻ\gamma .P^{2}\,\unicode{x2abd}\, J.&\supset .\text{prec}_{P}ʻ\gamma \neq \text{seq}_{P}ʻ\gamma &\qquad \text{(2)}\\ \vdash .*14·21.\supset \vdash :{\sim}(\text{E}!\text{prec}_{P}ʻ\gamma .\text{E}!\text{seq}_{P}ʻ\gamma ).\supset .&{\sim}(\text{prec}_{P}ʻ\gamma =\text{seq}_{P}ʻ\gamma ) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

Note that " $\text{prec}_{P}ʻ\gamma \neq \text{seq}_{P}ʻ\gamma$ " is not the same proposition as ${\sim}(\text{prec}_{P}ʻ\gamma=\text{seq}_{P}ʻ\gamma)$ . The former involves $\text{E}!\text{prec}_{P}ʻ\gamma.\text{E}!\text{seq}_{P}ʻ\gamma$ , while the latter does not, in virtue of the conventions as to descriptive symbols explained in *14.

*206·732. $\vdash \colon\ldotp P\in \text{trans}.\lor.P^{2}\,\unicode{x2abd}\, J:\supset .{\sim}(\text{prec}_{P}ʻ\gamma =\text{seq}_{P}ʻ\gamma )$

Dem. $\begin{array}{l} \vdash .*206·14.\supset \vdash :\gamma \cap CʻP=\Lambda .&\supset .\overrightarrow{\text{prec}} _{P}ʻ\gamma =\overrightarrow{B}ʻ\breve{P} .\text{seq}_{P}ʻ\gamma =\overrightarrow{B}ʻP.\\ [*93·101] &\supset .\overrightarrow{\text{prec}} _{P}ʻ\gamma \cap \overrightarrow{\text{seq}} _{P}ʻ\gamma =\Lambda .\\ [*53·4] &\supset .{\sim}(\text{prec}_{P}ʻ\gamma =\text{seq}_{P}ʻ\gamma ) &\qquad \text{(1)}\\ \vdash .(1).*206·731.\supset \vdash .\text{Prop} \end{array}$

A term $x$ is said to be the "upper limit" of $\alpha$ in $P$ if $\alpha$ has no maximum and $x$ is the sequent of $\alpha$ . In this case, $x$ immediately follows the class $\alpha$ , though there is no one member of $\alpha$ which $x$ immediately follows. Sequents which are limits have special importance, and it is convenient to have a special notation for them. We write " $\text{lt}_Pʻ\alpha$ " for the upper limit of $\alpha$ ; or, if it is more convenient, " $\text{lt}(P)ʻ\alpha$ ". (This is more convenient when $P$ is replaced by an expression consisting of several letters, or by a letter with a suffix.) The lower limit of $\alpha$ will be the immediate predecessor of $\alpha$ when $\alpha$ has no minimum; this we denote by $\text{tl}_Pʻ\alpha$ .

The following propositions on limits for the most part follow immediately from the propositions of *206 on sequents.

Our definition is so framed that the limit of the null-class is the first member of our series (if any). This departure from usage is convenient in order that, whenever our series contains any limiting point in the ordinary sense, the series of limiting points may exist, i.e. in order that $P\unicode{x0294f}\text{D}ʻ\text{lt}_P$ may exist whenever there are existent parts of CʻP which have upper limits. The series $P\unicode{x0294f}\text{D}ʻ\text{lt}_P$ is the "first derivative" of $P$ . The definition of a limit is $\text{lt}_P=\text{seq}_{P}\upharpoonright (-\text{ᗡ}ʻ\text{max}_{P}) \quad\text{Df}.$

Besides the limit, we require, for many purposes, a single notation for the "limit or maximum." This we denote by " $\text{limax}_P$ ," putting $\text{limax}_P=\text{max}_{P}\unicode{x228d} \text{lt}_P \quad\text{Df}.$ Similarly for the lower limit or minimum we use " $\text{limin}_{P}$ ," putting $\text{limin}_{P}=\text{min}_{P}\unicode{x228d} \text{tl}_P \qquad\text{Df}.$ We have $\text{tl}_P=\text{lt}(\breve{P})$ (*207·101) and $\text{limin}_{P}=\text{limax}(\breve{P})$ (*207·401). Hence it is unnecessary to prove propositions concerning lower limits, since they result immediately from propositions concerning upper limits.

In virtue of our definition of a limit, $x$ limits $\alpha$ if $x$ is a sequent of $\alpha$ and $\alpha$ has no maximum (*207·1). Thus if $\alpha$ has a maximum, it has no limit (*207·11), but if it has no maximum, the class of its limits is the class of its sequents (*207·12). Thus the existence of the class of limits is equivalent[Pg 595] to the existence of the class of sequents combined with the non-existence of the class of maxima, i.e.

*207·13. $\vdash :\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha .\equiv .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha$

*207·2—·232 consist of various formulae for $\overrightarrow{\text{lt}}_Pʻ\alpha$ . We have

*207·2. $\vdash :P\in \text{connex} .x\,\text{lt}_P\,\alpha .\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha$

I.e. the whole of $\alpha \cap CʻP$ precedes $x$ , but any predecessor of $x$ precedes some member of $\alpha$ .

*207·231. $\vdash :P\in \text{Ser}.\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\overrightarrow{P}ʻx=Pʻʻ\alpha )$

I.e. the limit of $\alpha$ , if it exists, is the term whose predecessors are identical with the predecessors of some part of $\alpha$ .

*207·232. $\vdash \colon\ldotp P\in \text{Ser}.\supset :x=\text{lt}_Pʻ\alpha .\equiv .x\in CʻP-\alpha .\overrightarrow{P}ʻx=Pʻʻ\alpha$

This proposition should be compared with *205·54, which (slightly re-written) is $\vdash \colon\ldotp P\in \text{Ser}.\supset :x=\text{max}_{P}ʻ\alpha .\equiv .x\in CʻP\cap \alpha .\overrightarrow{P}ʻx=Pʻʻ\alpha$

*207·51. $\vdash \colon\ldotp P\in \text{Ser}.\supset :x=\text{limax}_Pʻ\alpha .\equiv .x\in CʻP.\overrightarrow{P}ʻx=Pʻʻ\alpha$

*207·24. $\vdash :P\in \text{connex} .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha \in 0\cup 1.\text{lt}_P\in 1\rightarrow \text{Cls}$

*207·25. $\vdash :P\in \text{trans}.\beta \subset Pʻʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup \beta )=\overrightarrow{\text{lt}} _{P}ʻ\alpha$

I.e. any terms which have some $\alpha$ 's beyond them may be added to $\alpha$ without altering the limit.

We next have a set of propositions (*207·251—·27) proving that if a class has a limit, any single term of the class may be removed without altering the limit (*207·261), and that in any case, provided the class is not a unit class, its minimum (if any) may be removed without altering the limit (*207·27). We then prove (*207·291) that if $P$ is a series, and $\alpha$ is a class which has a limit, the predecessors of the limit are the class $P_{*}ʻʻ\alpha$ .

We then have a set of propositions (*207·3—·36) on the limit of $\overrightarrow{P}ʻx$ and kindred matters. If $x$ has no immediate predecessor, the limit of $\overrightarrow{P}ʻx$ is $x$ , and vice versa (*207·32 ·33). Hence

*207·35. $\vdash :P\in \text{Rl}ʻJ\cap \text{connex} .\supset .\text{D}ʻ\text{lt}_P=CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})$

We next turn our attention to " $\text{limax}_P$ ." This again is one-many, provided $P$ is connected (*207·41). We have by the definition

*207·42. $\vdash :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha$

*207·43. $\vdash :\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ\alpha$

*207·44. $\vdash .\text{ᗡ}ʻ\text{limax}_P=\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{lt}_P=\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}$

*207·45. $\vdash .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{lt}} _{P}ʻ\alpha$

*207·46. $\vdash \colon\ldotp x=\text{limax}_Pʻ\alpha .\equiv :x=\text{max}_{P}ʻ\alpha .\lor.x=\text{lt}_Pʻ\alpha$

A useful proposition in dealing with classes of classes contained in a series is

*207·54. $\vdash :P\in \text{Ser}.\kappa \subset \text{ᗡ}ʻ\text{lt}_P.\supset .\overrightarrow{\text{limax}} _{P}ʻ\text{lt}_Pʻʻ\kappa =\overrightarrow{\text{limax}} _{P}ʻsʻ\kappa =\overrightarrow{\text{lt}} _{P}ʻsʻ\kappa$

I.e. if every member of $\kappa$ has a limit, the limit or maximum (if any) of the limits is the limit or maximum, and in fact the limit, of $sʻ\kappa$ .

We have next a set of propositions (*207·6—·66) on correlations, proving that the limit, or the $\text{limax}$ , of the correlates is the correlate of the limit or $\text{limax}$ , i.e.

*207·6. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{lt}} _{Q}ʻ\breve{S} ʻʻ\alpha$

*207·64. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{limax}} _{Q}ʻ\breve{S} ʻʻ\alpha$

The last three propositions (*207·7—·72) are lemmas for use in the theory of stretches (*215·5 ·51).

*207·01. $\text{lt}_P=\text{lt}(P)=\text{seq}_{P}\upharpoonright (-\text{ᗡ}ʻ\text{max}_{P}) \quad\text{Df}$

*207·02. $\text{tl}_P=tl(P)=\text{prec}_{P}\upharpoonright (-\text{ᗡ}ʻ\text{min}_{P}) \quad\text{Df}$

*207·03. $\text{limax}_P=\text{max}_{P}\unicode{x228d} \text{lt}_P \quad\text{Df}$

*207·04. $\text{limin}_P=\text{min}_{P}\unicode{x228d} \text{tl}_P \quad\text{Df}$

*207·1. $\vdash :x\,\text{lt}_P\,\alpha .\equiv .x\text{seq}_{P}\alpha .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha \quad[(*207·01)]$

*207·101. $\vdash .\text{tl}_P=\text{lt}(\breve{P} ) \quad[*205·102.*206·101.(*207·02)]$

We shall not give further propositions on lower limits, unless for some special reason, since all of them result from propositions on upper limits by means of *207·101.

*207·11. $\vdash :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\Lambda \quad[*207·1]$

*207·12. $\vdash :\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha \quad[*207·1]$

*207·121. $\vdash :\alpha \cap CʻP\subset Pʻʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha \quad[*207·12.*205·123]$

*207·13. $\vdash :\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha .\equiv .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha \quad[*207·1]$

*207·14. $\begin{align}&\vdash \colon\ldotp \exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\lor.\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha :\equiv :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\lor.\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha \\ &[*207·13.*5·63]\end{align}$

The above proposition is important because $(\alpha ):\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\lor.\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha$ is the characteristic of "Dedekindian" series, i.e. of such as fulfil Dedekind's axiom.

*207·15. $\begin{align}&\vdash :x\,\text{lt}_P\,\alpha .\equiv .x\in CʻP.\alpha \cap CʻP\subset Pʻʻ\alpha \cap \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\\ &[*207·1.*205·123.*206·134]\end{align}$

*207·16. $\vdash .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cap CʻP) \quad[*207·15.*37·265]$

*207·17. $\vdash .\overrightarrow{\text{lt}} _{P}ʻ\Lambda =\overrightarrow{B}ʻP \quad[*207·12.*205·161.*206·14]$

*207·18. $\vdash :\text{ᗡ}ʻP\subset \text{D}ʻ\text{lt}_P.\equiv .CʻP=\text{D}ʻ\text{lt}_P$

Dem. $\begin{array}{l} \vdash .*207·17.\supset \vdash :\text{ᗡ}ʻP\subset \text{D}ʻ\text{lt}_P.&\equiv .\text{ᗡ}ʻP\cup \overrightarrow{B}ʻP\subset \text{D}ʻ\text{lt}_P.\\ [*93·103] &\equiv .CʻP\subset \text{D}ʻ\text{lt}_P.\\ [*207·15] &\equiv .CʻP=\text{D}ʻ\text{lt}_P:\supset \vdash .\text{Prop} \end{array}$

*207·2. $\begin{align}&\vdash :P\in \text{connex} .x\,\text{lt}_P\,\alpha .\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha \\ &[*207·15.*202·503]\end{align}$

*207·21. $\vdash :P^{2}\,\unicode{x2abd}\, J.x\in CʻP.\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha .\supset .x\,\text{lt}_P\,\alpha$

Dem. $\begin{array}{l} \vdash .*200·53.&\supset \vdash :P^{2}\,\unicode{x2abd}\, J.\supset .Pʻʻ\alpha \subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .(1). \supset \vdash :\text{Hp}.&\supset .x\in CʻP.\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP).\\ [*206·134] & \supset .x\text{seq}_{P}\alpha &\qquad \text{(2)}\\ \vdash .*22·44. \supset \vdash :\text{Hp}.&\supset .\alpha \cap CʻP\subset Pʻʻ\alpha .\\ [*205·123] &\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).*207·1.\supset \vdash .\text{Prop} \end{array}$

*207·22. $\begin{align}&\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha )\\ &[*207·2·21]\end{align}$

This is very often the most convenient form for $\overrightarrow{\text{lt}} _{P}\alpha$ . It states that a limit of $\alpha$ is a member $x$ of $CʻP$ such that $\alpha \cap CʻP$ wholly precedes $x$ , but every predecessor of $x$ precedes some member of $\alpha$ .

*207·23. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\overrightarrow{P}ʻx=Pʻʻ\alpha .\alpha \cap CʻP\subset Pʻʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*13·12.*22·42.\supset \\ \vdash :\overrightarrow{P}ʻx=Pʻʻ\alpha .\alpha \cap CʻP\subset Pʻʻ\alpha .&\supset .\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*201·501.*37·265.&\supset \vdash \colon\ldotp P\in \text{trans}.\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\supset .Pʻʻ\alpha \subset \overrightarrow{P}ʻx:\\ [\text{Fact}] &\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha .\supset .\overrightarrow{P}ʻx=Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*22·44.&\supset \vdash :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha .\supset .\alpha \cap CʻP\subset Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \\ \vdash \colon\ldotp P\in \text{trans}.&\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset Pʻʻ\alpha .\equiv .\overrightarrow{P}ʻx=Pʻʻ\alpha .\alpha \cap CʻP\subset Pʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(4).*207·22.\supset \vdash .\text{Prop} \end{array}$

*207·231. $\vdash :P\in \text{Ser}.\exists !\overrightarrow{\text{lt}} _{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =CʻP\cap \hat{x} (\overrightarrow{P}ʻx=Pʻʻ\alpha ) \quad[*207·23]$

*207·232. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.\supset :x=\text{lt}_Pʻ\alpha .\equiv .x\in CʻP-\alpha .\overrightarrow{P}ʻx=Pʻʻ\alpha \\ &[*206·28.*207·1]\end{align}$

*207·24. $\vdash :P\in \text{connex} .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha \in 0\cup 1.\text{lt}_P\in 1\rightarrow \text{Cls}$

Dem. $\begin{array}{l} \vdash .*206·161.*71·26.(*207·01).\supset \vdash :\text{Hp}.&\supset .\text{lt}_P\in 1\rightarrow \text{Cls}. &\qquad \text{(1)}\\ [*71·12] &\supset .\text{lt}_Pʻ\alpha \in 0\cup 1 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*207·25. $\vdash :P\in \text{trans}.\beta \subset Pʻʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup \beta )=\overrightarrow{\text{lt}} _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·193. &\supset \vdash :\text{Hp}.\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\exists !\overrightarrow{\text{max}}_{P}ʻ(\alpha \cup \beta ) &\qquad \text{(1)}\\ \vdash .(1).*207·11.&\supset \vdash :\text{Hp}.\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\Lambda .\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup \beta )=\Lambda &\qquad \text{(2)}\\ \vdash .*205·193.*207*12.\supset \\ \vdash :\text{Hp}.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .&\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha .\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup \beta )=\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cup \beta ).\\ [*206·24] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup \beta ) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*207·251. $\vdash :P\in \text{trans}.y\in Pʻʻ(\beta -{℩}ʻy).\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -{℩}ʻy)$

Dem. $\begin{array}{l} \vdash .*51·222. &\supset \vdash :y{\sim}\in \beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -{℩}ʻy) &\qquad \text{(1)}\\ \vdash .*207·25. & \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{lt}} _{P}ʻ\{(\beta -{℩}ʻy)\cup {℩}ʻy\}=\overrightarrow{\text{lt}} _{P}ʻ(\beta -{℩}ʻy) &\qquad \text{(2)}\\ \vdash .(2).*51·21.&\supset \vdash :\text{Hp}.y\in \beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -{℩}ʻy) (3) \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*207·26. $\begin{align}&\vdash :P\in \text{trans}.{\sim}(yPy).\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\iota ʻy)\\ &[*207·13·12.*206·72]\end{align}$

*207·261. $\begin{align}&\vdash :P\in \text{trans}.y\in \overrightarrow{\text{min}}_{P}ʻ\beta .\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\iota ʻy)\\ &[*207·26.*205·194]\end{align}$

*207·262. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\overrightarrow{\text{min}}_{P}ʻ\beta )\\ &[*207·261.*205·3]\end{align}$

*207·263. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \overrightarrow{\text{lt}} _{P}ʻ(\beta -\overrightarrow{\text{min}}_{P}ʻ\beta )\\ &[*207·262.*24·12]\end{align}$

*207·27. $\vdash :P\in \text{trans}\cap \text{connex} .\beta \cap CʻP{\sim}\in 1.\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\overrightarrow{\text{min}}_{P}ʻ\beta )$

Dem. $\begin{array}{l} \vdash .*24·26·101.&\supset \vdash :\overrightarrow{\text{min}}_{P}ʻ\beta =\Lambda .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\overrightarrow{\text{min}}_{P}ʻ\beta ) &\qquad \text{(1)}\\ \vdash .*52·181.\supset \\ \vdash :\text{Hp}.\exists !\overrightarrow{\text{min}}_{P}ʻ\beta .&\supset .(\exists y).y\in \beta \cap CʻP.y\neq \text{min}_{P}ʻ\beta .\\ [*205·2] &\supset .(\exists y).y\in (\beta \cap CʻP)-\iota ʻ\text{min}_{P}ʻ\beta .\text{min}_{P}ʻ\beta Py.\\ [*37·1] &\supset .\text{min}_{P}ʻ\beta \in Pʻʻ(\beta -\iota ʻ\text{min}_{P}ʻ\beta ).\\ [*207·251] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻ(\beta -\iota ʻ\text{min}_{P}ʻ\beta ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*207·28. $\vdash :P\in \text{trans}.\supset .\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cup Pʻʻ\alpha )=\overrightarrow{\text{lt}} _{P}ʻ\alpha \quad[*207·25]$

*207·281. $\begin{align}&\vdash :P\in \text{trans}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻPʻʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ\alpha \\ &[*207·28·16.*205·123]\end{align}$

*207·282. $\begin{align}&\vdash :P\in \text{trans}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\beta .Pʻʻ\alpha =Pʻʻ\beta .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ\beta \\ &[*207·281]\end{align}$

*207·29. $\vdash :P\in \text{trans}.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻP_{*}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*207·16·28.\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha &=\overrightarrow{\text{lt}} _{P}ʻ\{(\alpha \cup Pʻʻ\alpha )\cap CʻP\}\\ [*201·52] &=\text{lt}_PʻP_{*}ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*207·291. $\vdash :P\in \text{trans}\cap \text{connex} .\text{E}!\text{lt}_Pʻ\alpha .\supset .\overrightarrow{P}ʻ\text{lt}_Pʻ\alpha =P_{*}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*207·29. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻ\text{lt}_Pʻ\alpha =\overrightarrow{P}ʻ\text{lt}_PʻP_{*}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*90·14·172. &\supset \vdash .P_{*}ʻʻ\alpha \subset CʻP.PʻʻP_{*}ʻʻ\alpha \subset P_{*}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*207·11·12. &\supset \vdash :\text{Hp}.\supset .\text{seq}_{P}ʻP_{*}ʻʻ\alpha =\text{lt}_PʻP_{*}ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).*206·3. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻ\text{seq}_{P}ʻP_{*}ʻʻ\alpha =P_{*}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*207·3. $\vdash :\alpha \cap CʻP=\Lambda .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*205·151·161.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda &\qquad \text{(1)}\\ \vdash .*206·14.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{B}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*207·12.\supset \vdash .\text{Prop} \end{array}$

*207·31. $\vdash :P\,\unicode{x2abd}\, J.x\in CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2}).\supset .x\text{lt}_P\overrightarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash .*206·41.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx=\Lambda &\qquad \text{(1)}\\ \vdash .*206·4. &\supset \vdash :\text{Hp}.\supset .x\text{seq}_{P}\overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2).*207·1.\supset \vdash .\text{Prop} \end{array}$

*207·32. $\begin{align}&\vdash :P\in \text{Rl}ʻJ\cap \text{connex} .x\in CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2}).\supset .x=\text{lt}_Pʻ\overrightarrow{P}ʻx\\ &[*207·31·24]\end{align}$

*207·33. $\vdash :x\in \text{ᗡ}ʻ(P\dot{-} P^{2}).\supset .\overrightarrow{\text{lt}} _{P}ʻ\overrightarrow{P}ʻx=\Lambda \quad[*205·252.*207·11]$

*207·34. $\vdash :P\in \text{connex} .x\,\text{lt}_P\,\alpha .\supset .x\text{lt}_P\overrightarrow{P}ʻx.x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2})$

Dem. $\begin{array}{l} \vdash .*207·15. \supset \vdash :\text{Hp}.\supset .x\in CʻP.&\alpha \cap CʻP\subset Pʻʻ\alpha .\alpha \cap CʻP\subset \overrightarrow{P}ʻx.\\ &\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP) &\qquad \text{(1)}\\ \vdash .*40·16. \supset \vdash :\alpha \cap CʻP\subset \overrightarrow{P}ʻx.&\supset .pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx\subset pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP).\\ [*22·81] &\supset .-pʻ\overleftarrow{P}ʻʻ(\alpha \cap CʻP)\subset -pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(2)}\\ \vdash .(1).(2). \supset \vdash :\text{Hp}.&\supset .x\in CʻP.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx.\\ [*22·42] &\supset .x\in CʻP.\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ\overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash .(1).*202·505. \supset \vdash :\text{Hp}.&\supset .\overrightarrow{P}ʻx\subset (\alpha \cap CʻP)\cup Pʻʻ\alpha .\alpha \cap CʻP\subset Pʻʻ\alpha .\\ [*22·62] &\supset .\overrightarrow{P}ʻx\subset Pʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).*37·2·265. &\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha \subset Pʻʻ\overrightarrow{P}ʻx &\qquad \text{(5)}\\ \vdash .(4).(5). &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx\subset Pʻʻ\overrightarrow{P}ʻx &\qquad \text{(6)}\\ \vdash .(3).(6).*207·15.\supset \vdash .\text{Prop} \end{array}$

*207·35. $\vdash :P\in R1ʻJ\cap \text{connex} .\supset .\text{D}ʻ\text{lt}_P=CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})$

Dem. $\begin{array}{l} \vdash .*207·34.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\text{lt}_P\subset -\text{ᗡ}ʻ(P\dot{-} P^{2}) &\qquad \text{(1)}\\ \vdash .*207·15.&\supset \vdash .\text{D}ʻ\text{lt}_P\subset CʻP &\qquad \text{(2)}\\ \vdash .*207·32.&\supset \vdash :\text{Hp}.\supset .CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\subset \text{D}ʻ\text{lt}_P &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*207·36. $\begin{align}\vdash :P\in \text{Rl}ʻJ\cap &\text{connex} .\supset .\\ &\text{D}ʻ\text{lt}_P=\text{lt}_Pʻʻ\overrightarrow{P}ʻʻ{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})}=\text{lt}_Pʻʻ\overrightarrow{P}ʻʻCʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*207·32.&\supset \vdash :\text{Hp}.\supset .CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})=\text{lt}_Pʻʻ\overrightarrow{P}ʻʻ\{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\} &\qquad \text{(1)}\\ \vdash .(1).*207·35.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\text{lt}_P=\text{lt}_Pʻʻ\overrightarrow{P}ʻʻ\{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\} &\qquad \text{(2)}\\ \vdash .*207·33. &\supset \vdash .\text{lt}_Pʻʻ\overrightarrow{P}ʻʻ\{CʻP\cap \text{ᗡ}ʻ(P\dot{-} P^{2})\}=\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\text{lt}_P=\text{lt}_Pʻʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \vdash .\text{Prop} \end{array}$

In virtue of this proposition, all limits are limits of classes of the form $\overrightarrow{P}ʻx$ . In this respect, limits (in general) differ from segments. If we call $Pʻʻ\alpha$ the segment defined by $\alpha$ , there will in general be segments not of the form $\overrightarrow{P}ʻx$ . These, however, will be the segments which have no sequents, and therefore no limits; thus their existence does not introduce limits not derivable from classes of the form $\overrightarrow{P}ʻx$ .

*207·4. $\begin{align}\vdash \colon\ldotp x \text{limax}_P \alpha .&\equiv :x \text{max}_{P} \alpha .\lor.x \text{lt}_P \alpha :\\ &\equiv :x \text{max}_{P} \alpha .\lor.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .x \text{seq}_{P} \alpha \quad[(*207·03)]\end{align}$

*207·41. $\begin{align}&\vdash :P\in \text{connex} .\supset .\text{limax}_P,\text{limin}_P\in 1\rightarrow \text{Cls}\\ &[*71·24.*205·31.*207·24.(*207·03·04)]\end{align}$

*207·42. $\vdash :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha \quad[*207·4]$

*207·44. $\begin{align}&\vdash .\text{ᗡ}ʻ\text{limax}_P=\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{lt}_P=\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\\ &[*207·14.(*207·03)]\end{align}$

*207·45. $\vdash .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{lt}} _{P}ʻ\alpha \quad[(*207·03)]$

*207·46. $\vdash \colon\ldotp x=\text{limax}_Pʻ\alpha .\equiv :x=\text{max}_{P}ʻ\alpha .\lor.x=\text{lt}_Pʻ\alpha$

Dem. $\begin{array}{l} \vdash .*207·45·11.&\supset \vdash \colon\ldotp \exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset :x=\text{limax}_Pʻ\alpha .\equiv .x=\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*207·45·12.&\supset \vdash \colon\ldotp \overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .\supset :x=\text{limax}_Pʻ\alpha .\equiv .x=\text{lt}_Pʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*5·32.\supset \\ \vdash \colon\ldotp &\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .x=\text{limax}_Pʻ\alpha .\lor.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .x=\text{limax}_Pʻ\alpha :\equiv :\\ &\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .x=\text{max}_{P}ʻ\alpha .\lor.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .x=\text{lt}_Pʻ\alpha &\qquad \text{(3)}\\ \vdash .(3).*4·42.\supset \\ \vdash \colon\ldotp x=\text{limax}_Pʻ\alpha .&\equiv :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .x=\text{max}_{P}ʻ\alpha .\lor.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .x=\text{lt}_Pʻ\alpha :\\ [*30·32] &\equiv :x=\text{max}_{P}ʻ\alpha .\lor.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .x=\text{lt}_Pʻ\alpha :\\ [*207·13] &\equiv :x=\text{max}_{P}ʻ\alpha .\lor.x=\text{lt}_Pʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*207·47. $\vdash : \exists ! \overrightarrow{\text{lt}} _{P}ʻ\alpha . \equiv . \exists ! \overrightarrow{\text{limax}} _{P}ʻ\alpha . {\sim} \exists ! \overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *207·45·11 . &\supset \vdash : \exists ! \overrightarrow{\text{lt}} _{P}ʻ\alpha . \supset . \exists ! \overrightarrow{\text{limax}} _{P}ʻ\alpha . {\sim} \exists ! \overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *207·45 . &\supset \vdash : \exists ! \overrightarrow{\text{limax}} _{P}ʻ\alpha . {\sim} \exists ! \overrightarrow{\text{max}}_{P}ʻ\alpha . \supset . \exists ! \overrightarrow{\text{lt}} _{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*207·48. $\vdash . \overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{limax}} _{P}ʻ(\alpha \cap CʻP) \quad[*207·45 . *205·151 . *207·16]$

*207·481. $\begin{align}&\vdash : P \in \text{trans} . \supset . \overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{limax}} _{P}ʻP_{*}ʻʻ\alpha\\ &[*207·45 . *205·191 . *207·29]\end{align}$

*207·482. $\vdash : P \in \text{Ser} . \alpha \subset CʻP . \alpha = \text{limax}_Pʻ\alpha . \supset . \alpha \subset \overrightarrow{P}_{*}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *205·22 . *90·151 . &\supset \vdash : \text{Hp} . a = \text{max}_{P}ʻ\alpha . \supset . \alpha \subset \overrightarrow{P}_{*}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *207·291 . *90·151 . \supset \vdash : \text{Hp} . a = \text{lt}_Pʻ\alpha . &\supset . P_{*}ʻʻ\alpha \subset \overrightarrow{P}_{*}ʻa .\\ [*90·21] &\supset . \alpha \subset \overrightarrow{P}_{*}ʻa &\qquad \text{(2)}\\ \vdash . (1) . (2) . *207·46 . \supset \vdash . \text{Prop} \end{array}$

*207·5. $\begin{align}&\vdash : P \in \text{Ser} . \supset . \overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha = \overrightarrow{\text{min}}_{P}ʻ(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}}_{P}ʻ\alpha )\\ &[*206·33·35·37]\end{align}$

*207·51. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser} . \supset : x = \text{limax}_Pʻ\alpha . \equiv . x \in CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha \\ &[*205·54 . *207·232·46]\end{align}$

*207·52. $\vdash \colon\ldotp P \in \text{Ser} . \exists ! Pʻʻ\alpha . \supset : x = \text{limax}_Pʻ\alpha . \equiv . \overrightarrow{P}ʻx = Pʻʻ\alpha \quad[*207·51]$

*207·521. $\vdash \colon\ldotp P \in \text{Ser} . \supset : x = \text{lt}_Pʻ\alpha . \equiv . x \in CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha . {\sim} \text{E}! \text{max}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *207·51 . \supset \vdash \colon\ldotp \text{Hp} . \supset :\\ x \in CʻP . \overrightarrow{P}ʻx = Pʻʻ\alpha . {\sim} \text{E}! \text{max}_{P}ʻ\alpha . &\equiv . x = \text{limax}_Pʻ\alpha . {\sim} \text{E}! \text{max}_{P}ʻ\alpha .\\ [*207·46] &\equiv . x = \text{lt}_Pʻ\alpha \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*207·53. $\vdash : P \in \text{Ser} . \kappa \subset \text{ᗡ}ʻ\text{limax}_P . \supset . \overrightarrow{\text{limax}} _{P}ʻ\text{limax}_Pʻʻ\kappa = \overrightarrow{\text{limax}} _{P}ʻsʻ\kappa$

Dem. $\begin{array}{l} \vdash . *207·51 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : \alpha \in \kappa . \supset _\alpha . \overrightarrow{P}ʻ\text{limax}_Pʻ\alpha = Pʻʻ\alpha :\\ [*37·68] &\supset : \overrightarrow{P}ʻʻ\text{limax}_Pʻʻ\kappa = Pʻʻʻ\kappa :\\ [*40·5·38] &\supset : Pʻʻ\text{limax}_Pʻʻ\kappa = Pʻʻsʻ\kappa :\\ [*207·51] &\supset : x = \text{limax}_Pʻ\text{limax}_Pʻʻ\kappa . \equiv . x = \text{limax}_Pʻsʻ\kappa \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*205·561.*207·13.\supset \vdash :\text{Hp}.&\supset .sʻ\kappa {\sim}\in \text{ᗡ}ʻ\text{max}_{P}.\\ [*207·43] & \supset .\overrightarrow{\text{limax}} _{P}ʻsʻ\kappa =\overrightarrow{\text{lt}} _{P}ʻsʻ\kappa &\qquad \text{(1)}\\ \vdash .*207·13·43.\supset \vdash :\text{Hp}.&\supset .\text{lt}_Pʻʻ\kappa =\text{limax}_Pʻʻ\kappa .\\ [*207·53] &\supset .\overrightarrow{\text{limax}} _{P}ʻ\overrightarrow{\text{lt}} _{P}ʻʻ\kappa =\overrightarrow{\text{limax}} _{P}ʻsʻ\kappa &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*207·55. $\begin{align}&\vdash :P\in \text{Ser}.\kappa \subset \text{ᗡ}ʻ\text{lt}_P.sʻ\kappa \in \text{ᗡ}ʻ\text{lt}_P.\supset .\text{limax}_Pʻ\text{lt}_Pʻʻ\kappa =\text{lt}_Pʻsʻ\kappa\\ &[*207·54]\end{align}$

*207·6. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{lt}} _{Q}ʻ\breve{S} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*205·8.*37·43.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\equiv .\exists !\overrightarrow{\text{max}}_{Q}ʻ\breve{S} ʻʻ\alpha : &\qquad \text{(1)}\\ [*207·11] &\supset :\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\Lambda .\overrightarrow{\text{lt}} _{Q}ʻ\breve{S} ʻʻ\alpha =\Lambda &\qquad \text{(2)}\\ \vdash .(1).\text{Transp}.*207·12.\supset \\ \vdash \colon\ldotp \text{Hp}.\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda .&\supset :\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\alpha .\overrightarrow{\text{lt}} _{Q}ʻ\breve{S} ʻʻ\alpha =\overrightarrow{\text{seq}} _{Q}ʻ\breve{S} ʻʻ\alpha :\\ [*206·61] &\supset :\overrightarrow{\text{lt}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{lt}} _{Q}ʻ\breve{S} ʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).*37·29.\supset \vdash .\text{Prop} \end{array}$

*207·61. $\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\supset :\text{E}!\text{lt}_Pʻ\alpha .\equiv .\text{E}!\text{lt}_{Q}ʻ\breve{S} ʻʻ\alpha \quad[*207·6.*53·3]$

*207·62. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\text{E}!\text{lt}_Pʻ\alpha .\supset .\text{lt}_Pʻ\alpha =Sʻ\text{lt}_{Q}ʻ\breve{S} ʻʻ\alpha \quad[*207·6.*53·31]$

*207·63. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\text{lt}_Pʻʻ\kappa =Sʻʻ\text{lt}_{Q}ʻʻ\breve{S} ʻʻʻ\kappa$

Dem. $\begin{array}{l} \vdash .*207·6.*40·5.\supset \vdash :\text{Hp}.\supset .\text{lt}_Pʻʻ\kappa &=sʻSʻʻʻ\overrightarrow{\text{lt}} _{Q}ʻʻ\breve{S} ʻʻʻ\kappa \\ [*40·38·5] &=Sʻʻ\text{lt}_{Q}ʻʻ\breve{S} ʻʻʻ\kappa :\supset \vdash .\text{Prop} \end{array}$

*207·64. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =Sʻʻ\overrightarrow{\text{limax}} _{Q}ʻ\breve{S} ʻʻ\alpha\\ &[*205·8.*207·6·45]\end{align}$

*207·65. $\begin{align}&\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\supset :\text{E}!\text{limax}_Pʻ\alpha .\equiv .\text{E}!\text{limax}_{Q}ʻ\breve{S} ʻʻ\alpha\\ &[*207·64]\end{align}$

*207·66. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\text{E}!\text{limax}_Pʻ\alpha .\supset .\text{limax}_Pʻ\alpha =Sʻ\text{limax}_{Q}ʻ\breve{S} ʻʻ\alpha\\ &[*207·64]\end{align}$

*207·7. $\begin{align}\vdash \colon\ldotp P\in \text{trans}.\lor.&P^{2}\,\unicode{x2abd}\, J:\supset :\\ &\text{limin}_Pʻ\gamma =\text{limax}_Pʻ\gamma .\supset .\text{limin}_Pʻ\gamma =\text{min}_{P}ʻ\gamma =\text{max}_{P}ʻ\gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*207·42·43.\supset \vdash :&\text{E}!\text{min}_{P}ʻ\gamma .\text{E}!\text{limax}_Pʻ\gamma .{\sim}\text{E}!\text{max}_{P}ʻ\gamma .\supset .\\ &\text{limin}_Pʻ\gamma =\text{min}_{P}ʻ\gamma .\text{limax}_Pʻ\gamma =\text{seq}_{P}ʻ\gamma .\\ [*205·11.*206·2] &\supset .\text{limin}_Pʻ\gamma \in \gamma .\text{limax}_Pʻ\gamma {\sim}\in \gamma .\\ [*13·14] &\supset .\text{limin}_Pʻ\gamma \neq \text{limax}_Pʻ\gamma &\qquad \text{(1)}\\ \text{Similarly}\\ \vdash :\text{E}!\text{max}_{P}ʻ\gamma .\text{E}!&\text{limin}_Pʻ\gamma .{\sim}\text{E}!\text{min}_{P}ʻ\gamma .\supset .\text{limin}_Pʻ\gamma \neq \text{limax}_Pʻ\gamma &\qquad \text{(2)}\\ \vdash .*206·732.*207·43·12.\supset \\ \vdash :\text{Hp}.{\sim}\text{E}&!\text{min}_{P}ʻ\gamma .{\sim}\text{E}!\text{max}_{P}ʻ\gamma .\supset .{\sim}{\text{limin}_Pʻ\gamma =\text{limax}_Pʻ\gamma } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).&\supset \vdash :\text{Hp}.\text{limin}_Pʻ\gamma =\text{limax}_Pʻ\gamma .\supset .\text{E}!\text{min}_{P}ʻ\gamma .\text{E}!\text{max}_{P}ʻ\gamma .\\ [*207·42] & \supset .\text{limin}_Pʻ\gamma =\text{min}_{P}ʻ\gamma =\text{max}_{P}ʻ\gamma :\supset \vdash .\text{Prop} \end{array}$

*207·71. $\begin{align}\vdash \colon\ldotp P\in \text{connex} :P\in \text{trans}.\lor.P^{2}\,\unicode{x2abd}\, &J:\text{limin}_Pʻ\gamma =\text{limax}_Pʻ\gamma :\supset .\\ &\gamma \cap CʻP\in 1.\gamma \cap CʻP={℩}ʻ\text{limax}_Pʻ\gamma \\ &[*207·7.*205·73]\end{align}$

*207·72. $\begin{align}&\vdash \colon\ldotp P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset :\text{limin}_Pʻ\gamma =\text{limax}_Pʻ\gamma .\equiv .\gamma \cap CʻP\in 1\\ &[*207·71.*205·731·17.*207·42]\end{align}$

The propositions of this number are chiefly important on account of their consequences in the theory of well-ordered series (*250 ff.) and in the theory of vector-families (*330 ff.). When two well-ordered series are ordinally similar, they have only one correlator; and a well-ordered series is not ordinally similar to any of its segments. Of these two propositions, the first is an immediate consequence of *208·41, and the second is an immediate consequence of *208·47.

Propositions concerning correlators of two relations $P$ and $Q$ are obtained from propositions concerning correlators of $P$ with itself, by means of the fact that, if $S$ , $T$ are two correlators of $P$ and $Q$ , $S\mid \breve{T}$ is a correlator of $P$ with itself. Again, correlators of $P$ with itself are considered, in this number, as a special case of correlators of $P$ with parts of itself. This latter is a notion which will prove important for other reasons than those for which it is used in our present context. If $P$ is connected, and $S$ correlates $P$ with part of itself (so that $S^{;}P\,\unicode{x2abd}\, P$ ), $CʻP$ will contain terms of three kinds, (1) those for which $Sʻx=x$ , (2) those for which $(Sʻx)Px$ , (3) those for which $xP(Sʻx)$ . Our propositions result from the non-existence (under certain circumstances) of maxima or minima of classes (2) and (3).

The following definition defines "correlations of P with parts (or the whole) of itself." The letters " $\text{cror}$ " stand for "ordinal correlation." For a cardinal correlation, should occasion arise, we should use " $\text{cr}$ ," i.e. we should put $\text{cr}ʻ\alpha =sʻ\,\overline{\text{ sm }}\, \alpha ʻʻ\text{Cl}ʻ\alpha \quad\text{Df},$ so that $S\in \text{cr}ʻ\alpha .\equiv .S\in 1\rightarrow 1.\text{ᗡ}ʻS=\alpha .\text{D}ʻS\subset \alpha$ . For the present, we are concerned with the corresponding ordinal notion; thus we require $S\in \text{cror}ʻP.\equiv .S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.S^{;}P\,\unicode{x2abd}\, P.$ This is secured by putting $\text{cror}ʻP=sʻ\,\overline{\,\text{smor}\,}\,Pʻʻ\text{Rl}ʻP \quad\text{Df}.$

It will be observed that if $\alpha$ is what we called a "non-reflexive" class (cf. *124), $\text{cr}ʻ\alpha={℩}ʻI\upharpoonright \alpha$ , and $S\in \text{cr}ʻ\alpha .\supset.\text{D}ʻS=\alpha$ . When $CʻP$ is non-reflexive, the same is true of $P$ ; and when $CʻP$ is reflexive, $P$ is also reflexive, in the sense that it contains proper parts similar to itself, though if $P$ is well-ordered, such proper parts cannot be segments of $P$ , but must extend to the end of $CʻP$ .

The class of correlators of $P$ with the whole of itself, i.e. $P\,\overline{\,\text{smor}\,}\,P$ , is a sub-class of $\text{cror}ʻP$ , and is specially important. This class differs widely in its properties from the corresponding cardinal class. If $\alpha$ has more than one member, the class $\alpha \,\overline{\text{ sm }}\, \alpha$ (which is the "permutations" of $\alpha$ in the usual elementary sense) always has more than one member. But the class $P\,\overline{\,\text{smor}\,}\,P$ (which consists of such permutations of $CʻP$ as keep the order unchanged) will consist of the single term $I\upharpoonright CʻP$ , unless $CʻP$ contains classes which have neither a minimum nor a maximum, in which case there will be many correlators of $P$ with itself. As a simple illustration, take the series of negative and positive integers in their natural order. Then if $\nu$ is any one of these integers, $+\nu$ is a correlator of the whole series with itself. If we take only the positive integers, $+\nu$ is no longer a correlator of the whole series with itself, since all integers less than $\nu$ are omitted from the correlate.

The first important use of the propositions of this number is in the beginning of the theory of well-ordered series (*250). The propositions there used are

*208·41. $\begin{align}\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ&\text{min}_{P}\cup \text{ᗡ}ʻ\text{max}_{P}.\\ &S,T\in P \,\,\text{smor}\, \,Q.\supset .(P \overline{\,\text{smor}\,}Q) \in 1\end{align}$

I.e. if $P$ is connected and asymmetrical, and every existent sub-class of $CʻP$ has either a minimum or a maximum, $P$ and $Q$ cannot have more than one correlator.

*208·42. $\text{In the same circumstances},\, P\,\overline{\,\text{smor}\,}\,P={℩}ʻ(I\upharpoonright CʻP)$

*208·43. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.S\in \text{cror}ʻP.\supset .{\sim}(\exists x).(Sʻx)Px$

I.e. if every existent sub-class of $CʻP$ has a minimum, a correlator of $P$ with part of itself can never move terms backwards. Thus for example, to take a simple instance, an infinite series consisting of some of the natural numbers in order of magnitude cannot have its $\mu$ th term less than $\mu$ .

*208·45. $\vdash :P\in \text{connex} .\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}\cap \text{ᗡ}ʻ\text{max}_{P}.\supset .\text{Rl}ʻP\cap \text{Nr}ʻP={℩}ʻP$

I.e. if $P$ is connected and every existent sub-class of $CʻP$ has both a maximum and a minimum, no proper part of $P$ is similar to $P$ . This proposition is important in the theory of finite series and finite ordinals.

*208·46. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.S\in \text{cror}ʻP.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS=\Lambda$

I.e. if every existent sub-class of $CʻP$ has a minimum, a part of $P$ which is similar to $P$ must go up to the end of $P$ , i.e. must not wholly precede any member of $CʻP$ .

*208·47. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.Q\,\unicode{x2abd}\, P.\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻCʻQ.\supset .{\sim}(Q\,\,\text{smor}\,\,P)$

The proof of the above propositions proceeds simply by showing that if $S\in \text{cror}ʻP$ and $(Sʻx)Px$ , then $(SʻSʻx)P(Sʻx)$ , so that $x$ is not the earliest term for which $(Sʻx)Px$ , since $Sʻx$ is an earlier term for which the same thing holds. Hence $\hat{x}\{(Sʻx)Px\}$ can have no minimum; and similarly $\hat{x}\{xP(Sʻx)\}$ can have no maximum (*208·14). So far we require no hypothesis as to $P$ . Assuming now $P\in \text{connex}.P^{2}\,\unicode{x2abd}\, J$ , we show similarly that if $S$ correlates the whole of $P$ with itself, $\hat{x}\{(Sʻx)Px\}$ can have no maximum and $\hat{x}\{xP(Sʻx)\}$ can have no minimum.

Propositions about correlators of $P$ with $Q$ follow from the above by taking two correlators $S$ and $T$ , and applying the above propositions to $S\mid \breve{T}$ , which is a correlator of $P$ with the whole of itself.

*208·01. $\text{cror}ʻP=sʻ\,\overline{\,\text{smor}\,}\,Pʻʻ\text{Rl}ʻP \quad\text{Df}$

*208·1. $\vdash :S\in \text{cror}ʻP.\equiv .S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.S^{;}P\,\unicode{x2abd}\, P$

Dem. $\begin{array}{l} \vdash .*40·4.(*208·01).*151·11.\supset \\ \vdash :S\in \text{cror}ʻP.&\equiv .(\exists Q).Q\,\unicode{x2abd}\, P.S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.Q=S^{;}P.\\ [*13·195] &\equiv .S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.S^{;}P\,\unicode{x2abd}\, P:\supset \vdash .\text{Prop} \end{array}$

*208·11. $\vdash :S\in \text{cror}ʻP.\supset .S^{;}P\,\unicode{x2abd}\, P\unicode{x0294f}\text{D}ʻS$

Dem. $\begin{array}{l} \vdash .*150·203.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x(S^{;}P)y.\supset .x,y\in \text{D}ʻS &\qquad \text{(1)}\\ \vdash .*208·1. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x(S^{;}P)y.\supset .xPy &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash .\text{Prop} \end{array}$

*208·111. $\begin{align}&\vdash :S\in \text{cror}ʻP.\supset .\text{D}ʻS=CʻS^{;}P=SʻʻCʻP.\text{D}ʻS\subset \text{ᗡ}ʻS\\ &[*150·22·23.*208·1.*33·265]\end{align}$

*208·12. $\vdash :S\in \text{cror}ʻP.\supset .\breve{S} ^{;}S^{;}P=P.P\,\unicode{x2abd}\, \breve{S} ^{;}P \quad[*151·252·26.*208·1]$

Dem. $\begin{array}{l} \vdash .*208·12.\supset \vdash :\text{Hp}.&\supset .(Sʻx)(\breve{S} ^{;}P)x.\\ [*150·41] & \supset .(SʻSʻx)P(Sʻx):\supset \vdash .\text{Prop} \end{array}$

*208·131. $\vdash :S\in \text{cror}ʻP.xP(Sʻx).\supset .(Sʻx)P(SʻSʻx) \quad[\text{Proof as in *208·13}]$

*208·14. $\vdash :S\in \text{cror}ʻP.\supset .\overrightarrow{\text{min}}_{P}ʻ\hat{x}\{(Sʻx)Px\}=\Lambda .\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{xP(Sʻx)\}=\Lambda$

Dem. $\begin{array}{l} \vdash .*208·13.*20·3.\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \hat{x}\{(Sʻx)Px\}.&\supset .Sʻx\in \hat{x}\{(Sʻx)Px\}.(Sʻx)Px.\\ [*37·105] &\supset .x\in \breve{P} ʻʻ\hat{x} \{(Sʻx)Px\} &\qquad \text{(1)}\\ \vdash .(1).*24·3. \supset \vdash :\text{Hp}.&\supset .\hat{x}\{(Sʻx)Px\}-\breve{P} ʻʻ\hat{x}\{(Sʻx)Px\}=\Lambda .\\ [*205·11] &\supset .\overrightarrow{\text{min}}_{P}ʻ\hat{x}\{(Sʻx)Px\}=\Lambda&\qquad \text{(2)}\\ \text{Similarly}\quad \vdash :\text{Hp}.&\supset .\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{xP(Sʻx)\}=\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

Thus the proof that $\hat{x}\{(Sʻx)Px\}$ has no minimum, and $\hat{x}\{xP(Sʻx)\}$ no maximum, requires no hypothesis as to $P$ . The proof that $\hat{x}\{(Sʻx)Px\}$ has no maximum, and $\hat{x}\{xP(Sʻx)\}$ no minimum, requires the hypothesis $P\in\text{connex} .P^{2}\,\unicode{x2abd}\, J$ . This proof results from the following propositions.

*208·2. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.S\in \text{cror}ʻP.\supset .P=\breve{S} ^{;}P.S^{;}P=P\unicode{x0294f}\text{D}ʻS$

Dem. $\begin{array}{l} \vdash .*150·41.\supset \vdash \colon\ldotp \text{Hp}.\supset :x(\breve{S} ^{;}P)y.&\equiv .(Sʻx)P(Sʻy).\\ [*50·43·45] &\supset .Sʻx\neq Sʻy.{\sim}\{(Sʻy)P(Sʻx)\}.\\ [*30·37.*150·41] &\supset .x\neq y.{\sim}\{y(S^{;}P)x\}.\\ [*208·12.\text{Transp}] &\supset .x\neq y.{\sim}(yPx) &\qquad \text{(1)}\\ \vdash .*150·203.&\supset \vdash :x(\breve{S} ^{;}P)y.\supset .x,y\in \text{ᗡ}ʻS &\qquad \text{(2)}\\ \vdash .(2).*208·1.&\supset \vdash \colon\ldotp \text{Hp}.\supset :x(\breve{S} ^{;}P)y.\supset .x,y\in CʻP &\qquad \text{(3)}\\ \vdash .(1).(3).*202·103.&\supset \vdash \colon\ldotp \text{Hp}.\supset :x(\breve{S} ^{;}P)y.\supset .xPy &\qquad \text{(4)}\\ \vdash .(4).*208·12. &\supset \vdash :\text{Hp}.\supset .P=\breve{S} ^{;}P &\qquad \text{(5)}\\ \vdash .(5). \supset \vdash :\text{Hp}.\supset .S^{;}P&=S^{;}\breve{S} ^{;}P\\ [*150·38] &=P\unicode{x0294f}\text{D}ʻS &\qquad \text{(6)}\\ \vdash .(5).(6).\supset \vdash .\text{Prop} \end{array}$

*208·21. $\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.S\in \text{cror}ʻP.(Sʻx)Px.x\in \text{D}ʻS.\supset .xP(\breve{S} ʻx)$

Dem. $\begin{array}{l} \vdash .*33·43.\supset \vdash :\text{Hp}.&\supset .(Sʻx)(P\unicode{x0294f}\text{D}ʻS)x.\\ [*208·2] &\supset .(Sʻx)(S^{;}P)x.\\ [*150·41] &\supset .(\breve{S} ʻSʻx)P(\breve{S} ʻx).\\ [*72·241.*33·43] &\supset .xP(\breve{S} ʻx):\supset \vdash .\text{Prop} \end{array}$

*208·211. $\begin{align}&\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.S\in \text{cror}ʻP.xP(Sʻx).x\in \text{D}ʻS.\supset .(\breve{S} ʻx)Px\\ &[\text{Proof as in *208·21}]\end{align}$

*208·22. $\begin{align}\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.&S\in \text{cror}ʻP.\text{ᗡ}ʻS\subset \text{D}ʻS.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{(Sʻx)Px\}=\Lambda .\overrightarrow{\text{min}}_{P}ʻ\hat{x}\{xP(Sʻx)\}=\Lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*33·43. \supset \vdash \colon\ldotp \text{Hp}.&\supset :(Sʻx)Px.\supset .x\in \text{D}ʻS.x\in \text{ᗡ}ʻS.\\ [*208·21] &\supset .xP(\breve{S} ʻx).x\in \text{ᗡ}ʻS.\\ [*72·241] & \supset .xP(\breve{S} ʻx).\breve{S} ʻx\in \hat{x}\{(Sʻx)Px\}.\\ [*37·1] &\supset .x\in Pʻʻ\hat{x}\{(Sʻx)Px\} &\qquad \text{(1)}\\ \vdash .(1).*205·123.\supset &\vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{(Sʻx)Px\}=\Lambda &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ\hat{x}\{xP(Sʻx)\}=\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

Observe that, in virtue of *208·111, the above hypothesis gives $\text{D}ʻS=\text{ᗡ}ʻS=CʻP$ , so that $S\in P\overline{\,\text{smor}\,}P$ . Hence we are led to *208·3.

*208·3. $\begin{align}\vdash :P&\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.S\in P\,\overline{\,\text{smor}\,}\,P.\supset .\\ &{\sim}\exists !\text{min}_{P}ʻ\hat{x}\{(Sʻx)Px\}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{(Sʻx)Px\}.\\ &{\sim}\exists !\text{min}_{P}ʻ\hat{x}\{xP(Sʻx)\}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{xP(Sʻx)\}\end{align}$

Dem. $\begin{array}{l} \vdash .*151·11.*150·23.\supset \vdash :\text{Hp}.&\supset .S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.S^{;}P=P.\text{D}ʻS=CʻP.\\ [*208·1] &\supset .S\in \text{cror}ʻP.\text{ᗡ}ʻS=\text{D}ʻS &\qquad \text{(1)}\\ \vdash .(1).*208·14·22.\supset \vdash .\text{Prop} \end{array}$

*208·31. $\vdash :S,T\in P\,\overline{\,\text{smor}\,}\,Q.\supset .S\mid \breve{T} \in P\,\overline{\,\text{smor}\,}\,P \quad[*151·131·141]$

*208·32. $\begin{align}\vdash :P&\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.S,T\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\\ &{\sim}\exists !\overrightarrow{\text{min}}_{P}ʻ\hat{x} \{(Sʻ\breve{T} ʻx)Px\}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{(Sʻ\breve{T} ʻx)Px\}.\\ &{\sim}\exists !\overrightarrow{\text{min}}_{P}ʻ\hat{x}\{xP(Sʻ\breve{T} ʻx)\}.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\hat{x}\{xP(Sʻ\breve{T} ʻx)\}\\\ &[*208·3·31.*34·41]\end{align}$

*208·4. $\begin{align}\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ&\text{min}_{P}\cup \text{ᗡ}ʻ\text{max}_{P}.\\ &S,T\in P\,\overline{\,\text{smor}\,}\,Q.\supset .S=T\end{align}$

Dem. $\begin{array}{l} \vdash .*208·32. &\supset \vdash :\text{Hp}.\supset .\hat{x}\{(Sʻ\breve{T} ʻx)Px\}=\Lambda .\hat{x}\{xP(Sʻ\breve{T} ʻx)\}=\Lambda &\qquad \text{(1)}\\ \vdash .*208·31.*34·41. &\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in CʻP.\supset .Sʻ\breve{T} ʻx\in CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*202·103.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in CʻP.\supset .Sʻ\breve{T} ʻx=x.\\ [*72·241] &\supset .\breve{T} ʻx=\breve{S} ʻx:\\ [*150·23] &\supset :x\in \text{D}ʻS\cup \text{D}ʻT.\supset .\breve{T} ʻx=\breve{S} ʻx:\\ [*33·46] &\supset :S=T\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*208·41. $\begin{align}\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ&\text{min}_{P}\cup \text{ᗡ}ʻ\text{max}_{P}.\\ &P\,\,\text{smor}\,\,Q.\supset .(P\,\overline{\,\text{smor}\,}\,Q)\in 1\\ [*208·4.*151·12.*52·16]\end{align}$

The above proposition is of great importance in the theory of well-ordered series.

*208·42. $\begin{align}\vdash :P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}\cup &\text{ᗡ}ʻ\text{max}_{P}.\supset .\\ &P\,\overline{\,\text{smor}\,}\,P={℩}ʻ(I\upharpoonright CʻP)\\ [*208·4.*51·141.*151·121]\end{align}$

*208·43. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.S\in \text{cror}ʻP.\supset .{\sim}(\exists x).(Sʻx)Px \quad[*208·14]$

*208·431. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{max}_{P}.S\in \text{cror}ʻP.\supset .{\sim}(\exists x).xP(Sʻx) \quad[*208·14]$

*208·44. $\begin{align}\vdash :P\in \text{connex} .\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}\cap &\text{ᗡ}ʻ\text{max}_{P}.S\in \text{cror}ʻP.\supset .\\ &S=I\upharpoonright CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*208·43·431.*202·103.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in CʻP.\supset .Sʻx=x.\\ [*50·14.*35·7] &\supset .Sʻx=(I\upharpoonright CʻP)ʻx:\\ [*208·1.*50·5·52] &\supset :x\in \text{ᗡ}ʻS\cup \text{ᗡ}ʻ(I\upharpoonright CʻP).\supset .Sʻx=(I\upharpoonright CʻP)ʻx:\\ [*33·45] &\supset :S=I\upharpoonright CʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

In virtue of this proposition, if $P$ is a finite series, no proper part of $P$ is ordinally similar to $P$ . (It will be shown later that a finite series is one in which every existent contained class has both a maximum and a minimum.) The following proposition gives a more explicit form of the above result.

*208·45. $\vdash :P\in \text{connex} .\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}\cap \text{ᗡ}ʻ\text{max}_{P}.\supset .\text{Rl}ʻP\cap \text{Nr}ʻP={℩}ʻP$

Dem. $\begin{array}{l} \vdash .*208·441. \supset \vdash \colon\ldotp \text{Hp}.&\supset :S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.S^{;}P\,\unicode{x2abd}\, P.\supset .S=I\upharpoonright CʻP.\\ [*150·534] &\supset .S^{;}P=P &\qquad \text{(1)}\\ \vdash .(1).*13·12.\supset \vdash \colon\ldotp \text{Hp}.&\supset :Q\,\unicode{x2abd}\, P.S\in 1\rightarrow 1.\text{ᗡ}ʻS=CʻP.Q=S^{;}P.\supset .Q=P:\\ [*151·1] &\supset :Q\,\unicode{x2abd}\, P.Q\,\,\text{smor}\,\,P.\supset .Q=P:\\ [*152·1] &\supset :\text{Rl}ʻP\cap \text{Nr}ʻP\subset {℩}ʻP &\qquad \text{(2)}\\ \vdash .*61·34.*152·3.&\supset \vdash .{℩}ʻP\subset \text{Rl}ʻP\cap \text{Nr}ʻP &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

The following propositions are useful in the theory of segments of well-ordered series, since they show that a well-ordered series is never ordinally similar to any of its segments.

*208·46. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.S\in \text{cror}ʻP.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS=\Lambda$

Dem. $\begin{array}{l} \vdash .*208·1. \supset \vdash \colon\ldotp S\in \text{cror}ʻP.&\supset :x\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS.\supset .(Sʻx)Px:\\ [\text{Transp}] &\supset :{\sim}\{(Sʻx)Px\}.\supset .x{\sim}\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS &\qquad \text{(1)}\\ \vdash .(1).*208·43.&\supset \vdash :\text{Hp}.\supset .(x).x{\sim}\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS:\supset \vdash .\text{Prop} \end{array}$

*208·461. $\begin{align}&\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.S\in \text{cror}ʻP.\dot{\exists} !P.\supset .pʻ\overleftarrow{P}ʻʻ\text{D}ʻS=\Lambda\\ &[*208·46·1.*40·62]\end{align}$

*208·47. $\vdash :\text{Cl ex}ʻCʻP\subset \text{ᗡ}ʻ\text{min}_{P}.Q\,\unicode{x2abd}\, P.\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻCʻQ.\supset .{\sim}(Q\,\,\text{smor}\,\,P)$

Dem. $\begin{array}{l} \vdash .*208·46.(*208·01).\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q\,\unicode{x2abd}\, P.S\in Q\,\overline{\,\text{smor}\,}\,P.\supset .CʻP\cap pʻ\overleftarrow{P}ʻʻ\text{D}ʻS=\Lambda &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.*151·11.*150·23.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :Q\,\unicode{x2abd}\, P.\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻCʻQ.\supset .(S).S{\sim}\in Q\,\overline{\,\text{smor}\,}\,P.\\ [*151·12] &\supset .{\sim}(Q\,\,\text{smor}\,\,P)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

In this section, our chief topic will be sections and segments. This topic will occupy *211, *212 and *213, and *210 will consist of propositions whose chief utility lies in their application to segments. In *214, we shall consider Dedekindian series, which are intimately connected with segments, owing to the fact that one of the chief propositions in the subject is that the series of segments of a series is Dedekindian. In *215, we shall consider "stretches," which consist of any consecutive piece of a series, and are constituted by the product of an upper and lower section. Finally, in *216, we shall consider the derivative of a series, or of a class $\alpha$ contained in a series: the former is the series of limit-points of the series, i.e. $P\unicode{x0294f}\text{D}ʻ\text{lt}_P$ , the latter is the class of limits of existent sub-classes of $\alpha \cap CʻP$ , i.e. $\text{lt}_Pʻʻ\text{Cl ex}ʻ(\alpha \cap CʻP)$ .

A class is called a section of $P$ when it is contained in $CʻP$ , and contains all the predecessors of its members, i.e. $\alpha$ is a section of $P$ if $\alpha \subset CʻP.Pʻʻ\alpha\subset \alpha$ . Thus a section consists of all the field up to a certain point. It may consist of all the predecessors of $x$ , i.e. it may be of the form $\overrightarrow{P}ʻx$ ; or again, it may consist of these together with $x$ , in which case it is of the form $\overrightarrow{P}ʻx\cup {℩}ʻx$ ; or again, it may be not definable by means of a single sequent or maximum, but be of the form $Pʻʻ\alpha$ , where $\alpha$ is a class without a limit or maximum. The class of sections of $P$ is denoted by $\text{sect}ʻP$ . A section of $\breve{P}$ will be called an "upper section" of $P$ .

The idea of a segment is slightly less general than that of a section. We define a segment of $P$ as any class of the form $Pʻʻ\alpha$ , i.e. as any member of $\text{D}ʻP_{\in }$ . Provided $P$ is transitive, segments are contained among sections. But even in a series sections are not, in general, contained among segments: if $P$ is a series, and if $x$ is a member of $CʻP$ which has no immediate successor, $\overrightarrow{P}ʻx\cup {℩}ʻx$ will be a section but not a segment.

If a segment has a maximum, it must also have a sequent. Segments which have no maximum form a specially important class of segments: these are classes $\alpha$ such that $\alpha =Pʻʻ\alpha$ ; they form the class [Pg 613] $\text{D}ʻ(P_{\in }\dot{\cap} I)$ .

The properties of sections and segments considered as classes of classes are many and various: they are considered in *211. In *212, we pass to the consideration of the series of sections and segments. These series are $P_{\text{lc}}\unicode{x0294f}\text{sect}ʻP$ and $P_{\text{lc}}\unicode{x0294f}\text{D}ʻP_{\in}$ (cf. *170). The series of such segments as have no maximum is $P_{\text{lc}}\unicode{x0294f}\text{D}ʻ(P_{\in }\dot{\cap} I)$ . We put $\begin{aligned} \varsigma ʻP&=P_{\text{lc}}\unicode{x0294f}\text{D}ʻP_{\in } \quad\text{Df},\\ \text{sgm}ʻP&=P_{\text{lc}}\unicode{x0294f}\text{D}ʻ(P_{\in }\dot{\cap} I) \quad\text{Df}. \end{aligned}$ It then appears that $\varsigma ʻP_{*}=\text{sgm}ʻP_{*}=P_{\text{lc}}\unicode{x0294f}\text{sect}ʻP,$ so that it is unnecessary to introduce a special notation for the series of sections.

Whenever $P$ is connected and transitive, $P_{\text{lc}}\unicode{x0294f}\text{D}ʻP_{\in}$ turns out to be equivalent to logical inclusion combined with diversity (with the field limited to $\text{D}ʻP_{\in }$ ). That is to say (*212·23), $\vdash :P\in \text{trans}\cap \text{connex} .\supset .\varsigma ʻP=\hat{\alpha} \hat{\beta}\{\alpha ,\beta \in \text{D}ʻP_{\in }.\alpha \subset \beta .\alpha \neq \beta\}.$ Hence it follows (*212·24) that $\vdash :P_{*}\in \text{connex} .\supset .\varsigma ʻP_{*}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{sect}ʻP.\alpha \subset \beta .\alpha \neq \beta\}·$ We have also (*211·6 ·17) $\vdash \colon\ldotp P_{*}\in \text{connex} .\alpha ,\beta \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset \alpha$ Hence it easily follows that whenever $P_{*}$ is connected, $\varsigma ʻP_{*}$ is a series. Similarly $\varsigma ʻP$ will be a series if $P$ is transitive and connected.

The fact of connection, which is required in order that $\varsigmaʻP$ or $\varsigma ʻP_{*}$ may be a series, results from $\begin{aligned} \alpha ,\beta \in \text{sect}ʻP.&\supset :\alpha \subset \beta .\lor.\beta \subset \alpha \\ \text{or}\quad \alpha ,\beta \in \text{D}ʻP_{\in }.&\supset :\alpha \subset \beta .\lor.\beta \subset \alpha . \end{aligned}$ In order to deal with such cases generally, we study, in a preliminary number (*210), the consequences to be deduced from the hypothesis $\alpha ,\beta \in \kappa .\supset _{\alpha ,\beta }:\alpha \subset \beta .\lor.\beta \subset \alpha .$ We find that, with this hypothesis, putting $Q=\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\alpha \subset \beta .\alpha \neq \beta ),$ $Q=P_{\text{lc}}\unicode{x0294f}\kappa$ if $\kappa \subset\text{Cl}ʻCʻP$ (*210·13), and thus in the same circumstances $P_{\text{lc}}\unicode{x0294f}\kappa$ is a series (*210·14).

The interesting point about such series is their behaviour with regard to limits. Assuming that $\kappa$ is not a unit class (so as to insure $\dot{\exists} !Q)$ , if $\lambda$ is any sub-class of $\kappa$ , the logical product $pʻ\lambda$ is the minimum of $\lambda$ if it is a member of $\lambda$ (*210·21), and the lower limit of $\lambda$ if it is a member of $\kappa$ but not of $\lambda$ (*210·23). Similarly $sʻ\lambda$ is the maximum of $\lambda$ if it is a member of $\lambda$ (*210·211), and the upper limit of $\lambda$ if it is not a member of $\lambda$ but is a member of $\kappa$ (*210·231). Thus if $\kappa$ is such that, whenever $\lambda \subset \kappa$ , we have[Pg 614] $sʻ\lambda \in \kappa$ , it follows that every sub-class of $\kappa$ has either a maximum or a limit, i.e. the series $P_{\text{lc}}\unicode{x0294f}\kappa$ is Dedekindian. Now each of the three classes $\text{sect}ʻP$ , $\text{D}ʻP_{\in }$ , $\text{D}ʻ(P_{\in }\dot{\cap} I)$ verifies this condition, i.e. the sum of any sub-class of any one of these classes belongs to the class in question (*211·63 ·64 ·65). (This holds without any hypothesis as to $P$ .) Hence we arrive at the result that $\varsigma ʻP_{*}$ (i.e. the series of sections) is a Dedekindian series whenever $P_{*}$ is connected and $P$ is not null (*214·32), while $\varsigma ʻP$ (i.e. the series of segments) is a Dedekindian series whenever $P$ is transitive and connected and not null (*214·33), and $\text{sgm}ʻP$ (the series of segments having no maximum) is a Dedekindian series whenever it exists and $P$ is connected (*214·34). These propositions are important, and are the source of much of the utility of sections and segments.

For many purposes, especially in ordinal arithmetic, it is necessary to consider sections not as classes, but as series. That is to say, if $\alpha$ is a member of $\text{sect}ʻP$ , we want to deal with $P\unicode{x0294f} \alpha$ rather than with $\alpha$ . The series of all such terms as $P \unicode{x0294f} \alpha$ might be supposed to be $P \unicode{x0294f} ^{;}\varsigma ʻP_{*}$ . But here a limitation is necessary owing to the fact that, if $BʻP$ exists, $\Lambda$ and $\iota ʻBʻP$ are both sections, and $P \unicode{x0294f} \Lambda$ and $P \unicode{x0294f} \iota ʻBʻP$ are both $\dot{\Lambda}$ , so that $P \unicode{x0294f} ^{;}\varsigma ʻP_{*}$ will be a relation which $\dot{\Lambda}$ will have to itself. In order to avoid this, we first exclude $\Lambda$ from the sections to be considered, and thus put $P_{\varsigma }=P\unicode{x0294f}^{;}(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) \quad\text{Df}.$ Then $P_{\varsigma }$ is the series of segments considered as series. Provided $P_{\text{po}}$ is a series, the relation $P_{\varsigma}$ holds between any two members $Q$ and $R$ of its field when, and only when, $Q\,\unicode{x2abd}\, R.Q\neq R$ . The subject of $P_{\varsigma }$ is considered in *213; the utility of the propositions of this number will not appear until we come to ordinal arithmetic.

The subject of Dedekindian relations is next considered (*214). We define a Dedekindian relation as one such that every class has either a maximum or a sequent. A Dedekindian series must have a first and a last term, since the first term must be the sequent of $\Lambda$ , and the last must be the maximum of the field. A Dedekindian series may be discrete, or compact (i.e. such that there is a term between any two, i.e. such that $P^{2}=P$ ), or partly one and partly the other. A finite series must be Dedekindian: a well-ordered series is Dedekindian if it has a last term. But the chief importance of the Dedekindian property is in connection with compact series. A compact Dedekindian series is said to possess "Dedekindian continuity"; such series have many important properties. They are a wider class than series possessing Cantorian continuity; these latter will be considered in Section F of this Part.

In the theory of series it frequently happens that we have to deal with a class of classes such that, of any two, one is contained in the other. I.e. if $\kappa$ is the class of classes, we have $\alpha ,\beta \in \kappa .\supset _{\alpha ,\beta }:\alpha \subset \beta .\lor.\beta \subset \alpha .$

Instances of this are afforded by the various classes of sections, to be considered in *211. When $\kappa$ fulfils the above condition, the classes composing $\kappa$ can be arranged in a series by the relation of inclusion (combined with inequality), i.e. by the relation $\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\alpha \subset \beta .\alpha \neq \beta ),$ or, what comes to the same, $\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\exists !\beta -\alpha ).$ If $P$ is any relation such that $\kappa \subset \text{Cl}ʻCʻP$ , the above relation of inclusion is equal to $P_{\text{lc}}\unicode{x0294f}\kappa .$ (For the definition of $P_{\text{lc}}$ , see *170.) Thus under the above circumstances, $P_{\text{lc}}\unicode{x0294f}\kappa$ is a series, whatever $P$ may be.

The importance of such relations of inclusion, as generators of series, is in connection with the existence of maxima and minima or limits. If we put $Q=\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\exists !\beta -\alpha ).$ where $\kappa$ satisfies the above condition, then if $\lambda\subset \kappa$ and if $sʻ\lambda \in \kappa$ , $sʻ\lambda$ is the maximum or the upper limit of $\lambda$ with respect to $Q$ , according as $sʻ\lambda$ is a member of $\lambda$ or not. Similarly if $pʻ\lambda \in \kappa$ , p $ʻ\lambda$ is the minimum or lower limit of $\lambda$ , according as $pʻ\lambda$ is a member of $\lambda$ or not. Hence if $\kappa$ is such that the sum of any sub-class of $\kappa$ is a member of $\kappa$ , every sub-class of $\kappa$ has either a maximum or an upper limit; and if the product of every sub-class of $\kappa$ is a member of $\kappa$ , every sub-class of $\kappa$ has either a minimum or a lower limit.

In order that every sub-class of $\kappa$ should have a minimum or a lower limit, it is sufficient that the sum of every sub-class of $\kappa$ should be a member[Pg 616] of $\kappa$ . For, if $\lambda$ is any sub-class of $\kappa$ , consider those members of $\kappa$ which are contained in $pʻ\lambda$ , i.e. $\kappa \cap \text{Cl}ʻpʻ\lambda$ If $pʻ\lambda \in \kappa$ , the sum of these classes = $pʻ\lambda$ , and is the lower limit or minimum of $\kappa$ . But if $pʻ\lambda{\sim}\in \kappa$ , then every member of $\kappa$ which is not contained in $sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )$ is also not contained in $pʻ\lambda$ , and is therefore not contained in some member of $\lambda$ . Hence $sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )$ is the lower limit of $\lambda$ .

It is owing to these propositions that segments of series are of such great importance in connection with limits.

The hypothesis that if $\lambda \subset \kappa$ , $pʻ\lambda$ is a member of $\kappa$ , will usually fail to be verified in the case when $\lambda =\Lambda$ , since in this case $pʻ\lambda =\text{V}$ . But all the results desired can be obtained from the hypothesis that, if $\lambda \subset \kappa$ , $(pʻ\lambda \cap sʻ\kappa )\in \kappa$ . This hypothesis is equivalent to the other except in the case of $\Lambda$ , in which case it requires $sʻ\kappa \in \kappa$ , which is much more often verified than $\text{V}\in \kappa$ , which was required by the other hypothesis.

*210·1. $\vdash \colon\colon\alpha ,\beta \in \kappa .\supset _{\alpha ,\beta }:\alpha \subset \beta .\lor.\beta \subset \alpha \colon\ldotp \supset \colon\ldotp \alpha ,\beta \in \kappa .\supset :\alpha \subset \beta .\alpha \neq \beta .\equiv .\exists !\beta -\alpha$

*210·11. $\vdash :Q=\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\alpha \subset \beta .\alpha \neq \beta ).\supset .Q\in \text{trans}\cap \text{Rl}ʻJ$

*210·13. $\vdash :\text{Hp} *210·12.\kappa \subset \text{Cl}ʻCʻP.\supset .Q=P_{\text{lc}}\unicode{x0294f}\kappa$

*210·2. $\vdash :\text{Hp} *210·12.\kappa {\sim}\in 1.\supset .\overrightarrow{\text{min}}_{Q}ʻ\lambda =\lambda \cap \kappa \cap \iota ʻpʻ(\lambda \cap \kappa )$

*210·21. $\vdash :\text{Hp} *210·2.\lambda \subset \kappa .pʻ\lambda \in \lambda .\supset .\text{min}_{Q}ʻ\lambda =pʻ\lambda$

*210·211 gives an analogous proposition for $sʻ\lambda$ and $\text{max}_{Q}$ . We shall not here mention such analogues, unless for some special reason.

*210·23. $\vdash :\text{Hp} *210·2.\lambda \subset \kappa .pʻ\lambda -\lambda .\supset .pʻ\lambda =\text{prec}_{Q}ʻ\lambda =\text{tl}_{Q}ʻ\lambda$

*210·232. $\vdash :\text{Hp} *210·2.\lambda \subset \kappa .pʻ\lambda \in \kappa .\supset .pʻ\lambda =\text{limin}_Pʻ\lambda$

*210·251. $\vdash :\text{Hp} *210·2:\lambda \subset \kappa .\supset _{\lambda }.sʻ\lambda \in \kappa :\supset :\lambda \in \kappa .\supset .sʻ\lambda (\overrightarrow{\text{max}}_{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda )$

*210·252. $\begin{align}\vdash :&\text{Hp} *210·2:\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \cap sʻ\kappa :\supset :\\ &\lambda \subset \kappa .\supset .pʻ\lambda \cap sʻ\lambda \in (\overrightarrow{\text{min}}_{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ).pʻ\lambda \cap sʻ\kappa =\text{limin}_{Q}ʻ\lambda\end{align}$

*210·254. $\vdash :\text{Hp} *210·251.\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q}$

*210·26. $\begin{align}\vdash :\text{Hp} *210·2.\lambda \subset \kappa .pʻ\lambda {\sim}\in \lambda .&sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\in \kappa .\supset .\\ &sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )=\text{prec}_{Q}ʻ\lambda\end{align}$

*210·28. $\begin{align}\vdash :\text{Hp} *210·2.sʻʻ&\text{Cl}ʻ\kappa \subset \kappa .\supset .\\ &(\lambda ).\lambda \in (\text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q})(\text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q})\end{align}$

Thus if $\kappa$ is a class of not less than two classes such that, of any two of its members, one must be contained in the other, and if $Q$ is the relation[Pg 617] $\alpha \subset \beta .\alpha \neq \beta$ confined to members of $\kappa$ , then $Q$ is a series (*210·12) in which, provided the sums of sub-classes of $\kappa$ are always members of $\kappa$ , every class has either a maximum or an upper limit, and every class has either a minimum or a lower limit (*210·28).

The reader will observe that, if $\alpha$ , $\beta \in \kappa.\supset _{\alpha ,\beta }:\alpha \subset \beta .\lor.\beta \subset\alpha$ , any finite sub-class of $\kappa$ must contain its own sum and product as members. For example, if we have two classes $\alpha$ and $\beta$ , if $\alpha \subset \beta$ , then $\alpha =pʻ(\iota ʻ\alpha\cup \iota ʻ\beta )$ and $\beta =sʻ(\iota ʻ\alpha \cup \iota ʻ\beta)$ ; if we have three classes $\alpha$ , $\beta$ , $\gamma$ , and $\alpha \subset \beta.\beta \subset \gamma$ , then $\alpha =pʻ(\iota ʻ\alpha \cup \iotaʻ\beta \cup \iota ʻ\gamma )$ and $\gamma =sʻ(\iota ʻ\alpha \cup\iota ʻ\beta \cup \iota ʻ\gamma )$ ; and so on. Thus the hypothesis $sʻʻ\text{Cl}ʻ\kappa \subset \kappa$ is only required in order to enable us to deal with infinite sub-classes of $\kappa$ .

Dem. $\begin{array}{l} \vdash .*24·6. &\supset \vdash :\alpha \subset \beta .\alpha \neq \beta .\supset .\exists !\beta -\alpha &\qquad \text{(1)}\\ \vdash .*24·55. &\supset \vdash :\exists !\beta -\alpha .\supset .{\sim}(\beta \subset \alpha ). &\qquad \text{(2)}\\ [*22·42] &\supset .\alpha \neq \beta &\qquad \text{(3)}\\ \vdash .*2·53. &\supset \vdash \colon\ldotp \text{Hp}.\alpha ,\beta \in \kappa .{\sim}(\beta \subset \alpha ).\supset .\alpha \subset \beta &\qquad \text{(4)}\\ \vdash .(2).(3).(4). &\supset \vdash \colon\ldotp \text{Hp}.\alpha ,\beta \in \kappa .\supset :\exists !\beta -\alpha .\supset .\alpha \subset \beta .\alpha \neq \beta &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*210·11. $\vdash :Q=\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\alpha \subset \beta .\alpha \neq \beta ).\supset .Q\in \text{trans}\cap \text{Rl}ʻJ$

Dem. $\begin{array}{l} \vdash .*50·11. &\supset \vdash :\text{Hp}.\supset .Q\in \text{Rl}ʻJ &\qquad \text{(1)}\\ \vdash .*22·44. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha Q\beta .\beta Q\gamma .\supset .\alpha \subset \gamma &\qquad \text{(2)}\\ \vdash .*24·6.*21·33. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha Q\beta .\beta Q\gamma .\supset .\exists !\beta -\alpha .\beta \subset \gamma .\\ [*24·58] &\supset .\exists !\gamma -\alpha .\\ [*24·21] &\supset .\alpha \neq \gamma &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha Q\beta .\beta Q\gamma .\supset .\alpha Q\gamma &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*10·1. \supset \vdash \colon\ldotp \text{Hp}.\alpha ,\beta \in \kappa .&\supset :\alpha \subset \beta .\lor.\beta \subset \alpha :\\ [*5·62] &\supset :\alpha \subset \beta .\alpha \neq \beta .\lor.\beta \subset \alpha .\beta \neq \alpha .\lor.\alpha =\beta &\qquad \text{(1)}\\ \vdash .*21·33. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha Q\beta .\supset _{\alpha ,\beta }.\alpha ,\beta \in \kappa :\\ [*33·352] &\supset :CʻQ\subset \kappa &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \alpha ,\beta \in CʻQ.\supset :\alpha Q\beta .\lor.\beta Q\alpha .\lor.\alpha =\beta &\qquad \text{(3)}\\ \vdash .*210·11.(3).*204·12.\supset \vdash .\text{Prop} \end{array}$

*210·121. $\vdash : \text{Hp} *210·12 . \supset . \text{D}ʻQ = \kappa - \iota ʻsʻ\kappa . \text{ᗡ}ʻQ = \kappa - \iota ʻpʻ\kappa$

Dem. $\begin{array}{l} \vdash . *21·33 . \supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp \alpha \in \text{D}ʻQ . &\equiv : \alpha \in \kappa : (\exists \beta ) . \beta \in \kappa . \alpha \subset \beta . \alpha \neq \beta :\\ [*210·1] &\equiv : \alpha \in \kappa : (\exists \beta ) . \beta \in \kappa . \exists ! \beta - \alpha :\\ [*40·151.\text{Transp}] &\equiv : \alpha \in \kappa . \exists ! sʻ\kappa - \alpha :\\ [*24·55] &\equiv : \alpha \in \kappa . {\sim} (sʻ\kappa \subset \alpha ) :\\ [*22·41 . *40·13] &\equiv : \alpha \in \kappa . \alpha \neq sʻ\kappa &\qquad \text{(1)}\\ \vdash . *21·33 . \supset \vdash \colon\colon \text{Hp} . \supset \colon\ldotp \alpha \in \text{ᗡ}ʻQ . &\equiv : \alpha \in \kappa : (\exists \beta ) . \beta \in \kappa . \beta \subset \alpha . \beta \neq \alpha :\\ [*210·1] &\equiv : \alpha \in \kappa : (\exists \beta ) . \beta \in \kappa . \exists ! \alpha - \beta :\\ [*40·15 . \text{Transp}] &\equiv : \alpha \in \kappa . \exists ! \alpha - pʻ\kappa :\\ [*24·55] &\equiv : \alpha \in \kappa . {\sim} (\alpha \subset pʻ\kappa ) :\\ [*22·41 . *40·12] &\equiv : \alpha \in \kappa . \alpha \neq pʻ\kappa &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*210·122. $\vdash : \text{Hp} *210·12 . \kappa {\sim} \in 1 . \supset . CʻQ = \kappa$

Dem. $\begin{array}{l} \vdash . *52·181 . \supset \vdash \colon\colon \text{Hp} . &\supset \colon\ldotp \alpha \in \kappa . \supset : (\exists \beta ) . \beta \in \kappa . \beta \neq \alpha :\\ [\text{Hp} . *10·1] &\supset : (\exists \beta ) : \beta \in \kappa . \beta \neq \alpha : \alpha \subset \beta . \lor . \beta \subset \alpha :\\ [*21·33] &\supset : (\exists \beta ) : \beta \in \kappa : \alpha Q\beta . \lor . \beta Q\alpha :\\ [*33·132] &\supset : \alpha \in CʻQ &\qquad \text{(1)}\\ \vdash . *21·33 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : \alpha Q\beta . \supset _{\alpha , \beta } . \alpha , \beta \in \kappa :\\ [*33·352] &\supset : CʻQ \subset \kappa &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*210·123. $\vdash : \text{Hp} *210·12 . \kappa \in 0 \cup 1 . \supset . Q = \dot{\Lambda}$

Dem. $\begin{array}{l} \vdash . *52·41 . \text{Transp} . \supset \vdash : \text{Hp} . &\supset . {\sim} (\exists \alpha , \beta ) . \alpha , \beta \in \kappa . \alpha \neq \beta .\\ [*21·33] &\supset . {\sim} (\exists \alpha , \beta ) . \alpha Q\beta : \supset \vdash . \text{Prop} \end{array}$

*210·124. $\vdash \colon\ldotp \text{Hp} *210·12 . \supset : \alpha Q\beta . \equiv . \alpha , \beta \in \kappa . \exists ! \beta - \alpha \quad[*210·1]$

*210·13. $\vdash : \text{Hp} *210·12 . \kappa \subset \text{Cl}ʻCʻP . \supset . Q = P_{\text{lc}} \unicode{x0294f} \kappa$

Dem. $\begin{array}{l} \vdash . *170·102 . \supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha (P_{\text{lc}} \unicode{x0294f} \kappa )\beta . &\equiv . \alpha , \beta \in \kappa . \exists ! \beta - \alpha - Pʻʻ(\alpha - \beta ) . &\qquad \text{(1)}\\ [*210·124] &\supset . \alpha Q\beta &\qquad \text{(2)}\\ \vdash . *210·1·124 . \supset \vdash \colon\ldotp \text{Hp} . \supset : \alpha Q\beta . &\supset . \alpha , \beta \in \kappa . \exists ! \beta - \alpha . \alpha \subset \beta .\\ [*37·29] &\supset . \alpha , \beta \in \kappa . \exists ! \beta - \alpha . Pʻʻ(\alpha - \beta ) = \Lambda .\\ [*24·23·313] &\supset . \alpha , \beta \in \kappa . \exists ! \beta - \alpha - Pʻʻ(\alpha - \beta ) .\\ [(1)] &\supset . \alpha (P_{\text{lc}} \unicode{x0294f} \kappa ) \beta &\qquad \text{(3)}\\ \vdash . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

Thus under the hypothesis of *210·1, $P_{\text{lc}}\unicode{x0294f}\kappa$ does not depend upon $P$ , so long as $\kappa \subset \text{Cl}ʻCʻP$ . Also we have

*210·14. $\begin{align}&\vdash :\text{Hp}*210·1.\kappa \subset \text{Cl}ʻCʻP.\supset .P_{\text{lc}}\unicode{x0294f}\kappa \in \text{Ser}\\ &[*210·12·13]\end{align}$

*210·15. $\begin{align}&\vdash \colon\ldotp \text{Hp}*210·12.\alpha ,\beta \in \kappa .\supset :{\sim}(\alpha Q\beta ).\equiv .\beta \subset \alpha \\ &[*210·124.*24·55]\end{align}$

*210·16. $\begin{align}&\vdash \colon\colon\text{Hp}*210·1.\supset \colon\ldotp \\ &\alpha \in \kappa .\lambda \subset \kappa .\supset :\alpha \subset pʻ\lambda .\lor.pʻ\lambda \subset \alpha :\alpha \subset sʻ\lambda .\lor.sʻ\lambda \subset \alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*10·1.\supset \vdash \colon\colon\text{Hp}.\alpha \in \kappa .\lambda \subset \kappa .&\supset \colon\ldotp \beta \in \lambda .\supset _{\beta }:\alpha \subset \beta .\lor.\beta \subset \alpha \colon\ldotp &\qquad \text{(1)}\\ [*10·57] &\supset \colon\ldotp \beta \in \lambda .\supset _{\beta }.\alpha \subset \beta :\lor:(\exists \beta ).\beta \in \lambda .\beta \subset \alpha \colon\ldotp \\ [*40·15·12]&\supset \colon\ldotp \alpha \subset pʻ\lambda .\lor.pʻ\lambda \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).*10·57.\supset \\ \vdash \colon\colon\text{Hp}.\alpha \in \kappa .\lambda \subset \kappa .&\supset \colon\ldotp \beta \in \lambda .\supset _{\beta }.\beta \subset \alpha :\lor:(\exists \beta ).\beta \in \kappa .\alpha \subset \beta \colon\ldotp \\ [*40·151·13] &\supset \colon\ldotp sʻ\lambda \subset \alpha .\lor.\alpha \subset sʻ\lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*210·17. $\begin{align}\vdash :\text{Hp}*210·12.&\lambda \subset \kappa .\supset .\\ &\kappa -\breve{Q} ʻʻ\lambda =\kappa \cap \text{Cl}ʻpʻ\lambda .\kappa -Qʻʻ\lambda =\kappa \cap \hat{\gamma} (sʻ\lambda \subset y)\end{align}$

Dem. $\begin{array}{l} \vdash .*37·105.\text{Transp}.&\supset \vdash \colon\ldotp \alpha \in \kappa -\breve{Q} ʻʻ\lambda .\equiv :\alpha \in \kappa :\beta \in \lambda .\supset _{\beta }.{\sim}(\beta Q\alpha ) &\qquad \text{(1)}\\ \vdash .(1).*210·15.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \alpha \in \kappa -\breve{Q} ʻʻ\lambda .&\equiv :\alpha \in \kappa :\beta \in \lambda .\supset _{\beta }.\alpha \subset \beta :\\ [*40·15] &\equiv :\alpha \in \kappa \cap \text{Cl}ʻpʻ\lambda &\qquad \text{(2)}\\ \text{Similarly}\quad \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \kappa -Qʻʻ\lambda .\equiv .\alpha \in \kappa \cap \hat{\gamma} (sʻ\lambda \subset \gamma ) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*210·2. $\vdash :\text{Hp}*210·12.\kappa {\sim}\in 1.\supset .\overrightarrow{\text{min}}_{Q}ʻ\lambda =\lambda \cap \kappa \cap \iota ʻpʻ(\lambda \cap \kappa )$

Dem. $\begin{array}{l} \vdash .*205·15.*210·122.\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{Q}ʻ\lambda &=\overrightarrow{\text{min}}_{Q}ʻ(\lambda \cap \kappa )\\ [*205*11] & =\lambda \cap \kappa -\breve{Q} ʻʻ(\lambda \cap \kappa )\\ [*210·17] & =\lambda \cap \kappa \cap \text{Cl}ʻpʻ(\lambda \cap \kappa ) &\qquad \text{(1)}\\ \vdash .*40·12.\supset \vdash \colon\ldotp \alpha \in \lambda \cap \kappa .&\supset :pʻ(\lambda \cap \kappa )\subset \alpha :\\ [*22·41] &\supset :\alpha \subset pʻ(\lambda \cap \kappa ).\equiv .\alpha =pʻ(\lambda \cap \kappa ) &\qquad \text{(2)}\\ \vdash .(2).*5·32.&\supset \vdash .\lambda \cap \kappa \cap \text{Cl}ʻpʻ(\lambda \cap \kappa )=\lambda \cap \kappa \cap \iota ʻpʻ(\lambda \cap \kappa ) &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

Observe that $\lambda \cap \kappa \cap \iota ʻpʻ(\lambda \cap \kappa)$ is either $\iota ʻpʻ(\lambda \cap \kappa )$ or $\Lambda$ , according as $pʻ(\lambda \cap \kappa )$ is or is not a member of $\lambda \cap \kappa$ .

*210·201. $\begin{align}&\vdash : \text{Hp} *210·2 . \lambda \subset \kappa . \supset . \overrightarrow{\text{min}}_{Q}ʻ\lambda = \lambda \cap \iota ʻp ʻ\lambda \\ &[*210·2 . *22·621]\end{align}$

*210·202. $\begin{align}&\vdash : \text{Hp} *210·2 . \supset . \overrightarrow{\text{max}}_{Q}ʻ\lambda = \lambda \cap \kappa \cap {℩}ʻsʻ(\lambda \cap \kappa )\\ &[\text{Proof as in *210·2}]\end{align}$

*210·203. $\begin{align}&\vdash : \text{Hp} *210·2 . \lambda \subset \kappa . \supset . \overrightarrow{\text{max}}_{Q}ʻ\lambda = \lambda \cap {℩}ʻsʻ\lambda \\ &[*210·202 . *22·621]\end{align}$

*210·21. $\begin{align}&\vdash : \text{Hp} *210·2 . \lambda \subset \kappa . pʻ\lambda \in \lambda . \supset . \text{min}_{Q}ʻ\lambda = pʻ\lambda\\ &[*210·201 . *51·31]\end{align}$

*210·211. $\begin{align}&\vdash : \text{Hp} *210·2 . \lambda \subset \kappa . sʻ\lambda \in \lambda . \supset . \text{max}_{Q}ʻ\lambda = sʻ\lambda\\ &[*210·203 . *51·31]\end{align}$

*210·22. $\begin{align}&\vdash : \text{Hp} *210·12 . \lambda \subset \kappa . pʻ\lambda {\sim} \in \lambda . \supset . {\sim} \exists ! \overrightarrow{\text{min}}_{Q}ʻ\lambda \\ &[*210·201·123 . *51·211]\end{align}$

*210·221. $\begin{align}&\vdash : \text{Hp} *210·12 . \lambda \subset \kappa . sʻ\lambda {\sim} \in \lambda . \supset . {\sim} \exists ! \overrightarrow{\text{max}}_{Q}ʻ\lambda \\ &[*210·203·123 . *51·211]\end{align}$

*210·222. $\begin{align}&\vdash \colon\ldotp \text{Hp} *210·2 . \lambda \subset \kappa . \supset : pʻ\lambda \in \lambda . \equiv . \text{E}! \text{min}_{Q}ʻ\lambda \\ &[*210·21·22]\end{align}$

*210·223. $\begin{align}&\vdash \colon\ldotp \text{Hp} *210·2 . \lambda \subset \kappa . \supset : sʻ\lambda \in \lambda . \equiv . \text{E}! \text{max}_{Q}ʻ\lambda\\ &[*210·211·221]\end{align}$

*210·23. $\vdash : \text{Hp} *210·2 . \lambda \subset \kappa . pʻ\lambda \in \kappa - \lambda . \supset . pʻ\lambda = \text{prec}_{Q}ʻ\lambda = \text{tl}_{Q}ʻ\lambda$

Dem. $\begin{array}{l} \vdash . *210·22 . &\supset \vdash : \text{Hp} . \supset . \overrightarrow{\text{min}}_{Q}ʻ\lambda = \Lambda . &\qquad \text{(1)}\\ [*205·122 . *210·122] &\supset . \lambda \subset \breve{Q} ʻʻ\lambda &\qquad \text{(2)}\\ \vdash . (2) . *210·12 . *206·174 . \supset \\ \vdash : \text{Hp} . \supset . \overrightarrow{\text{prec}} _{Q}ʻ\lambda &= CʻQ \cap \hat{\alpha} (\overleftarrow{Q}ʻ\alpha = \breve{Q} ʻʻ\lambda )\\ [*210·122] &= \kappa \cap \hat{\alpha} (\overleftarrow{Q}ʻ\alpha = \breve{Q} ʻʻ\lambda ) &\qquad \text{(3)}\\ \vdash . *37·105 . *210·124 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : \beta \in \breve{Q} ʻʻ\lambda . &\equiv . (\exists \gamma ) . \gamma \in \lambda . \exists ! \beta - \gamma . \beta \in \kappa .\\ [*40·15 . \text{Transp}] &\equiv . \exists ! \beta - pʻ\lambda . \beta \in \kappa .\\ [*210·124] &\equiv . (pʻ\lambda ) Q\beta &\qquad \text{(4)}\\ \vdash . (4) . \supset \vdash : \text{Hp} . &\supset . pʻ\lambda \in \kappa . \overleftarrow{Q}ʻpʻ\lambda = \breve{Q} ʻʻ\lambda .\\ [(3)] &\supset . pʻ\lambda \in \overrightarrow{\text{prec}} _{Q}ʻ\lambda &\qquad \text{(5)}\\ \vdash . (5) . *210·12 . *206·16 . &\supset \vdash : \text{Hp} . \supset . pʻ\lambda = \text{prec}_{Q}ʻ\lambda &\qquad \text{(6)}\\ \vdash . (1) . (6) . *207·12 . &\supset \vdash : \text{Hp} . \supset . pʻ\lambda = \text{tl}_{Q}ʻ\lambda &\qquad \text{(7)}\\ \vdash . (6) . (7) . \supset \vdash . \text{Prop} \end{array}$

*210·231. $\begin{align}&\vdash :\text{Hp}*210·2.\lambda \subset \kappa .sʻ\lambda \in \kappa -\lambda .\supset .sʻ\lambda =\text{seq}_{Q}ʻ\lambda =\text{lt}_{Q}ʻ\lambda \\ &[\text{Proof as in *210·23}]\end{align}$

In virtue of *210·21 ·23, every class which is contained in $\kappa$ , and whose product is a member of $\kappa$ , has either a minimum or a lower limit; and in virtue of *210·211 ·231, every class which is contained in $\kappa$ , and whose sum is a member of $\kappa$ , has either a maximum or an upper limit.

*210·232. $\vdash :\text{Hp}*210·2.\lambda \subset \kappa .pʻ\lambda \in \kappa .\supset .pʻ\lambda =\text{limin}_Pʻ\lambda \quad[*210·21·23]$

*210·233. $\vdash :\text{Hp}*210·2.\lambda \subset \kappa .sʻ\lambda \in \kappa .\supset .sʻ\lambda =\text{limax}_Pʻ\lambda \quad[*210·211·231]$

*210·24. $\begin{align}&\vdash :\text{Hp}*210·2.\supset .\kappa \cap {℩}ʻpʻ\kappa =\overrightarrow{B}ʻQ.\kappa \cap {℩}ʻsʻ\kappa =\overrightarrow{B}ʻ\breve{Q} \\ &[*205·12·121.*210·201·203·122]\end{align}$

*210·241. $\vdash :\text{Hp}*210·2.pʻ\kappa \in \kappa .\supset .pʻ\kappa =BʻQ \quad[*210·24]$

*210·242. $\vdash :\text{Hp}*210·2.sʻ\kappa \in \kappa .\supset .sʻ\kappa =Bʻ\breve{Q} \quad [*210·24]$

*210·25. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \in &\kappa :\supset :\\ &\lambda \subset \kappa .\supset .pʻ\lambda \in (\overrightarrow{\text{min}}_{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda )\end{align}$

Dem. $\begin{array}{l} \vdash .*210·21.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\lambda \subset \kappa .pʻ\lambda \in \lambda .\supset .pʻ\lambda \in \overrightarrow{\text{min}}_{Q}ʻ\lambda &\qquad \text{(1)}\\ \vdash .*210·23.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\lambda \subset \kappa .pʻ\lambda {\sim}\in \lambda .\supset .pʻ\lambda \in \overrightarrow{\text{prec}} _{Q}ʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*210·251. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:\lambda \subset \kappa .\supset _{\lambda }.sʻ\lambda \in &\kappa :\supset :\\ &\lambda \supset \kappa .\supset .sʻ\lambda \in (\overrightarrow{\text{max}}_{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda )\\ [\text{Proof as in *210·25}]\end{align}$

*210·252. $\begin{align}\vdash \colon\ldotp &\text{Hp}*210·2:\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \cap sʻ\kappa \in \kappa :\supset :\\ &\lambda \subset \kappa .\supset .pʻ\lambda \cap sʻ\kappa \in (\overrightarrow{\text{min}}_{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ).pʻ\lambda \cap sʻ\kappa =\text{limin}_Pʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*40·23·161.\supset \vdash :\lambda \subset \kappa .\exists !\lambda .&\supset .pʻ\lambda \subset sʻ\kappa .\\ [*22·621] &\supset .pʻ\lambda \cap sʻ\kappa =pʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*210·21·23.&\supset \vdash :\text{Hp}.\lambda \subset \kappa .\exists !\lambda .\supset .pʻ\lambda \cap sʻ\kappa \in (\overrightarrow{\text{min}}_{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ) &\qquad \text{(2)}\\ \vdash .*40·2. &\supset \vdash :{\sim}\exists !\lambda .\supset .pʻ\lambda \cap sʻ\kappa =sʻ\kappa &\qquad \text{(3)}\\ \vdash .(3).*24·12.\supset \vdash :\text{Hp}.&\supset .sʻ\kappa \in \kappa .\\ [*210·242] &\supset .sʻ\kappa =Bʻ\breve{Q} .\\ [*206·14] &\supset .sʻ\kappa =\text{prec}_{Q}ʻ\Lambda &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash :\text{Hp}.{\sim}\exists !\lambda .\supset .pʻ\lambda \cap sʻ\kappa \in (\overrightarrow{\text{min}}_{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ) &\qquad \text{(5)}\\ \vdash .(2).(5).\supset \vdash .\text{Prop} \end{array}$

This proposition is more useful than *210·25, because its hypothesis is much oftener verified. In order that the hypothesis of *210·25 may be[Pg 622] verified, we must have $\text{V}\in \kappa$ , since $\Lambda \subset\kappa .pʻ\Lambda =\text{V}$ ; hence we must also have $sʻ\kappa =\text{V}$ . But the hypothesis of *210·252 only requires, as far as $\Lambda$ is concerned, that we should have $sʻ\kappa \in \kappa$ .

*210·253. $\begin{align}&\vdash :\text{Hp}*210·252.\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q}\\ &[*210·252.*205·15.*206·131]\end{align}$

*210·254. $\begin{align}&\vdash :\text{Hp}*210·251.\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q}\\ &[\text{Proof as in *210·253}]\end{align}$

*210·26. $\begin{align}\vdash :\text{Hp}*210·2.\lambda \subset \kappa .pʻ\lambda {\sim}\in \lambda .&sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\in \kappa .\supset .\\ &sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )=\text{prec}_{Q}ʻ\lambda \end{align}$

Dem. $\begin{array}{l} \vdash .*210·22.\supset \vdash :\text{Hp}.&\supset .{\sim}\exists !\overrightarrow{\text{min}}_Qʻ\lambda .\\ [*205·122] &\supset .\lambda \subset \breve{Q} ʻʻ\lambda &\qquad \text{(1)}\\ \vdash .*60·2. & \supset \vdash :\beta \in \kappa \cap \text{Cl}ʻpʻ\lambda .\supset .\beta \subset pʻ\lambda :\\ [*40·151] &\supset \vdash :sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\subset pʻ\lambda &\qquad \text{(2)}\\ \vdash .(2). \supset \vdash :\text{Hp}.&\supset .sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\in \kappa \cap \text{Cl}ʻpʻ\lambda . &\qquad \text{(3)}\\ [*210·211] \supset .sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )&=\text{max}_{Q}ʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\\ [*210·17] &=\text{max}_{Q}ʻ(\kappa -\breve{Q} ʻʻ\lambda )\\ [(1)]&=\text{max}_{Q}ʻ(\kappa -\lambda -\breve{Q} ʻʻ\lambda )\\ [*210·122.*202·502.(3)]&=\text{max}_{Q}ʻpʻ\overrightarrow{Q}ʻʻ\lambda \\ [*206·1·101] & =\text{prec}_{Q}ʻ\lambda :\supset \vdash .\text{Prop} \end{array}$

*210·261. $\begin{align}\vdash :\text{Hp}*210·2.&\lambda \subset k.sʻ\lambda {\sim}\in \lambda .pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )\in \kappa .\supset .\\ &pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\text{seq}_{Q}ʻ\lambda \quad[\text{Proof as in *210·26}]\end{align}$

*210·262. $\begin{align}\vdash :\text{Hp}*210·2.\lambda \subset \kappa .sʻ\lambda {\sim}\in \lambda .&sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )\in \kappa .\supset .\\ &sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\text{seq}_{Q}ʻ\lambda \end{align}$

Dem. $\begin{array}{l} \vdash .*40·23·161.\supset \\ \vdash :\text{Hp}.\exists !\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha ).&\supset .pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )\subset sʻ\kappa .\\ [*22·621] &\supset .sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha ).\\ [*210·261] &\supset .sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\text{seq}_{Q}ʻ\lambda &\qquad \text{(1)}\\ \vdash .*10·51. &\supset \vdash \colon\ldotp \hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\Lambda .\supset :\alpha \in \kappa .\supset _{\alpha }.{\sim}(sʻ\lambda \subset \alpha ) &\qquad \text{(2)}\\ \vdash .(2).*210·16.&\supset \vdash \colon\ldotp \text{Hp}.\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\Lambda .\supset :\alpha \in \kappa .\supset _{\alpha }.\alpha \subset sʻ\lambda :\\ [*40·151] & \supset :sʻ\kappa \subset sʻ\lambda :\\ [*40·161] &\supset :sʻ\kappa =sʻ\lambda &\qquad \text{(3)}\\ \vdash .*40·2.\supset \vdash :\text{Hp}(3).&\supset .sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=sʻ\kappa . &\qquad \text{(4)}\\ [\text{Hp}.(3)] & \supset .sʻ\lambda \in \kappa .\\ [*210·231] &\supset .sʻ\lambda =\text{seq}_{Q}ʻ\lambda .\\ [(3).(4)] &\supset .sʻ\kappa \cap pʻ\hat{\alpha} (\alpha \in \kappa .sʻ\lambda \subset \alpha )=\text{seq}_{Q}ʻ\lambda &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*210·27. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:&\lambda \subset \kappa .\supset _{\lambda }.sʻ\lambda \in \kappa :\supset :\\ &\lambda \subset \kappa .\supset _{\lambda }.\exists !(\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda ).\exists !(\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda )\end{align}$

Dem. $\begin{array}{l} \vdash .*210·251.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\lambda \subset \kappa .\supset _{\lambda }.\exists !(\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda ) &\qquad \text{(1)}\\ \vdash .*210·222.&\supset \vdash :\text{Hp}.\lambda \subset \kappa .pʻ\lambda \in \lambda .\supset .\exists !\overrightarrow{\text{min}} _{Q}ʻ\lambda &\qquad \text{(2)}\\ \vdash .*10·1. \supset \vdash \colon\ldotp \text{Hp}.&\supset :sʻ(\kappa \cap \text{Cl}ʻpʻ\lambda )\in \kappa :\\ [*210·26] &\supset :\lambda \subset \kappa .pʻ\lambda {\sim}\in \lambda .\supset .\exists !\overrightarrow{\text{prec}} _{P}ʻ\lambda &\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash \colon\ldotp \text{Hp}.&\supset :\lambda \subset \kappa .\supset .\exists !(\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ) &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*210·271. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:&\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \in \kappa :\supset :\\ &\lambda \subset \kappa .\supset _{\lambda }.\exists !(\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda ).\exists !(\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda )\\ &[\text{Proof as in *210·27}]\end{align}$

*210·272. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:&\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \cap sʻ\kappa \in \kappa :\supset :\\ &\lambda \subset \kappa .\supset _{\lambda }.\exists !(\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda ).\exists !(\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda )\\ &[\text{Proof as in *210·27, using *210·262}]\end{align}$

*210·28. $\begin{align}\vdash :\text{Hp}*210·2.sʻʻ&\text{Cl}ʻ\kappa \subset \kappa .\supset .\\ &(\lambda ).\lambda \in (\text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q})\cap (\text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q})\end{align}$

Dem. $\begin{array}{l} \vdash .*37·61.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\lambda \subset \kappa .\supset _{\lambda }.sʻ\lambda \in \kappa :\\ [*210·27] \supset :\lambda \subset \kappa .\supset _{\lambda }.&\exists !(\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda ).\exists !(\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda ) &\qquad \text{(1)}\\ \vdash .(1).*22·43.\supset \\ \vdash :\text{Hp}.\supset .(\lambda ).&\exists !\{\overrightarrow{\text{max}} _{Q}ʻ(\lambda \cap \kappa )\cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda \cap \kappa )\}.\\ &\exists !.\{\overrightarrow{\text{min}} _{Q}ʻ(\lambda \cap \kappa )\cup \overrightarrow{\text{prec}} _{Q}ʻ(\lambda \cap \kappa )\}.\\ [*210·122]\supset .(\lambda ).&\exists !\{\overrightarrow{\text{max}} _{Q}ʻ(\lambda \cap CʻQ)\cup \overrightarrow{\text{seq}} _{Q}ʻ(\lambda \cap CʻQ)\}.\\ &\exists !\{\overrightarrow{\text{min}} _{Q}ʻ(\lambda \cap CʻQ)\cup \overrightarrow{\text{prec}} _{Q}ʻ(\lambda \cap CʻQ)\}.\\ [*205·15·151.*206·131]\supset .(\lambda ).&\exists !\{\overrightarrow{\text{max}} _{Q}ʻ\lambda \cup \overrightarrow{\text{seq}} _{Q}ʻ\lambda\}.\exists !\{\overrightarrow{\text{min}} _{Q}ʻ\lambda \cup \overrightarrow{\text{prec}} _{Q}ʻ\lambda\}.\\ [*33·41] &\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q}.\lambda \in \text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q}:\supset \vdash .\text{Prop} \end{array}$

*210·281. $\begin{align}\vdash :\text{Hp}*210·2.pʻʻ&\text{Cl}ʻ\kappa \subset \kappa .\supset .\\ &(\lambda ).\lambda \in (\text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q})\cap (\text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q})\end{align}$

*210·282. $\begin{align}\vdash \colon\ldotp \text{Hp}*210·2:\lambda &\subset \kappa .\supset _{\lambda }.pʻ\lambda \cap sʻ\kappa \in \kappa :\supset .\\ &(\lambda ).\lambda \in (\text{ᗡ}ʻ\text{max}_{Q}\cup \text{ᗡ}ʻ\text{seq}_{Q})\cap (\text{ᗡ}ʻ\text{min}_{Q}\cup \text{ᗡ}ʻ\text{prec}_{Q})\end{align}$

Thus when either of the hypotheses of *210·281 ·282 is fulfilled, the series $Q$ is Dedekindian both upwards and downwards.

*210·29. $\vdash :\text{Hp}*210·251.\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{limax}_P\cap \text{ᗡ}ʻ\text{limin}_P \quad[*210·28.*207·44]$

*210·291. $\begin{align}\vdash :\text{Hp}*210·252.\supset .(\lambda ).\lambda \in \text{ᗡ}ʻ\text{limax}_P\cap \text{ᗡ}ʻ\text{limin}_P\\ &[*210·282.*207·44]\end{align}$

The theory of the modes of separation of a series into two classes, one of which wholly precedes the other, and which together make up the whole series, is of fundamental importance. When one out of a pair of such classes is given, the other is the rest of the series; we may therefore, for most purposes, confine our attention to that one of the two classes which comes first in the serial order. Any class which can be the first of such a pair we shall call a section of our series. If $P$ is the series, we shall denote the class of its sections by " $\text{sect}ʻP$ ." If $\alpha$ is a section of $P$ , we shall call $CʻP - \alpha$ (which is the second class of our pair) the complement of $\alpha$ . The class of complements of sections is $(CʻP -)ʻʻ\text{sect}ʻP,$ which is identical with $\text{sect}ʻ\breve{P}$ (*211·75).

In order that a class may be a section of $P$ , it is necessary and sufficient that it should be contained in $CʻP$ and should contain all its own predecessors; thus we put $\text{sect}ʻP = \hat{\alpha} (\alpha \subset CʻP . Pʻʻ\alpha \subset \alpha ) \quad\text{Df}.$ We have also, by *90·23, $\text{sect}ʻP = \hat{\alpha} (\alpha = P_{*}ʻʻ\alpha ) \quad(*211·13).$

Among sections, a specially important class consists of classes which are composed of all the predecessors of some class, i.e. classes of the form $Pʻʻ\beta$ , i.e. classes which are members of $\text{D}ʻP_{\in}$ . Whenever $P$ is transitive, $PʻʻPʻʻ\beta\subset Pʻʻ\beta$ ; hence $Pʻʻ\beta$ is a section according to the above definition. When $P$ is a series, the complement of $Pʻʻ\beta$ (when $\beta$ exists and is contained in $CʻP$ ) is $\overrightarrow{\text{max}} _Pʻ\beta \cup pʻ\overleftarrow{P}ʻʻ\beta .$

The members of $\text{D}ʻP_{\in}$ are called segments of the series generated by P. In a series in which every sub-class has a maximum or a sequent, $\text{D}ʻP_{\in} = \overrightarrow{P}ʻʻCʻP$ (*211·38), i.e. the predecessors of a class are always the predecessors of a single term, namely the maximum of the class if it exists,[Pg 625] or the sequent if no maximum exists. But if there are classes which have neither a maximum nor a sequent, the predecessors of such classes are not coextensive with the predecessors of any single term. Thus in general the series of segments will be larger than the original series. For example, if our original series is of the type of the series of rationals in order of magnitude, the series of segments is of the type of the series of real numbers, i.e. the type of the continuum.

Among segments, a specially important class consists of those which have no maximum. In this case, if $\alpha$ is such a segment, we have $\alpha \subset Pʻʻ\alpha$ ; and since (provided $P$ is transitive) we also have, for all segments, $Pʻʻ\alpha \subset \alpha$ , the segments having no maximum are those for which $\alpha = Pʻʻ\alpha$ , i.e. they are the class $\text{D}ʻ(P_{\in} \dot{\cap} I)$ . In compact series, all segments belong to this latter class, but in general only those segments belong to it which correspond to a "Häufungsstelle." In all cases in which the existence of a limit is not known, the segment fulfils the functions of a limit; that is to say, in those places in the series where a limit might be expected, we have a segment having no limit or maximum, which takes the same place in the series of segments as would be taken by the limit in the original series if the limit existed. Segments having no limit or maximum are limiting points in the series of segments, and every class of segments which has no maximum in the series of segments has a limit in that series.

We have thus three classes to deal with, namely $\begin{aligned} &(1)\quad \text{sect}ʻP,\\ &(2) \quad\text{D}ʻP_{\in },\\ &(3) \quad\text{D}ʻ(P_{\in } \dot{\cap} I). \end{aligned}$ Of these the second is contained in the first when $P$ is transitive (*211·15), and the third is contained in the first and second (*211·14). The second consists of those members of the first which have either a sequent or no maximum (*211·32); the third consists of those members of the first which have no maximum (*211·41). If every member of the third class has a limit, i.e. if $\text{D}ʻ(P_{\in } \dot{\cap} I) \subset \text{ᗡ}ʻ\text{seq}_{P},$ then every class has either a sequent or a maximum, i.e. the series is Dedekindian; and the converse also holds (*211·47).

When $P$ is connected, of any two sections one must be contained in the other (*211·6). Moreover, if $\lambda$ is contained in any one of the three classes $\text{sect}ʻP$ , $\text{D}ʻP_{\in }$ , $\text{D}ʻ(P_{\in } \dot{\cap} I)$ , then $sʻ\lambda$ is a member of that class (*211·63 ·64 ·65). Hence the propositions of *210 become available. It is thus that the existence of limits in series of segments or sections is proved: the maximum or upper limit of any class $\lambda$ consisting of segments or sections is $sʻ\lambda$ , and the minimum or lower limit is the sum of the segments that are contained in every $\lambda$ .

We begin, in this number, with elementary properties of $\text{sect}ʻP$ . The sections of $P$ are the segments of $P_{*}$ (*211·13) and the sections of $P_{\text{po}}$ (*211·17). We have

We then proceed to the elementary properties of segments, i.e. of $\text{D}ʻP_{\in }$ (*211·3—·38). We have

*211·302. $\vdash :P \in \text{Ser}.\supset .\overrightarrow{P}ʻʻCʻP=\text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}$

*211·351. $\vdash :P \in \text{Ser}.\supset .\text{sect}ʻP - \text{D}ʻP_{\in }=\overrightarrow{P}_{*}ʻʻ(CʻP - \text{D}ʻP_{1})$

We then proceed to elementary properties of segments having no maximum, i.e. of $\text{D}ʻ(P_{\in }\dot{\cap} I)$ (*211·4—·47). We have

*211·42. $\vdash :P \in \text{trans}.\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)=\text{D}ʻP_{\in } - \text{ᗡ}ʻ\text{max}_{P}$

*211·44. $\vdash .\Lambda \in \text{D}ʻ(P_{\in }\dot{\cap} I).\Lambda \in \text{D}ʻP_{\in }.\Lambda \in \text{sect}ʻP$

*211·451. $\vdash :\overrightarrow{P}ʻx\in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2})$

Our next set of propositions (*211·5—·553) is concerned with compact series, i.e. with the hypothesis $P^{2}=P$ . We have

*211·51. $\vdash :P^{2}=P.\supset .\text{D}ʻP_{\in }=\text{D}ʻ(P_{\in }\dot{\cap} I)$

*211·551. $\vdash \colon\ldotp P \in \text{Ser}.\supset :\text{ᗡ}ʻ\text{max}_{P}\cap \text{ᗡ}ʻ\text{seq}_{P}=\Lambda .\equiv .P=P^{2}$

I.e. a series is compact when, and only when, no class has both a maximum and a sequent.

We come next to the application of the propositions of *210 (*211·56—·692). These propositions proceed from

*211·56. $\vdash \colon\ldotp P \in \text{connex} .\alpha ,\beta \in \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset Pʻʻ\alpha$

(Here " $P_{\text{po}} \in \text{connex}$ " may be substituted in the hypothesis: cf. *211·561.) The propositions of this set, which are very important, have been already mentioned.

Our next set of propositions (*211·7—·762) are concerned with the complements of sections and segments. Some of these propositions have been already mentioned; others of importance are:

*211·7. $\vdash :\alpha \in \text{sect}ʻP.\supset .CʻP-\alpha \in \text{sect}ʻ\breve{P}$

*211·703. $\vdash :P \in \text{connex} .\alpha \in \text{sect}ʻP-\iota ʻCʻP.\supset .\exists !pʻ\overleftarrow{P}ʻʻ\alpha$

*211·726. $\begin{align}\vdash :P \in \text{connex} \cap &\text{Rl}ʻJ.\alpha \in \text{sect}ʻP.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ).\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )\end{align}$

*211·727. $\begin{align}\vdash \colon\ldotp P\in \text{connex} \cap \text{Rl}ʻJ.\alpha \in &\text{sect}ʻP.\supset :\\ &\text{E}!\text{limax}_Pʻ\alpha .\equiv .\text{E}!\text{limin}_Pʻ(CʻP-\alpha )\end{align}$

*211·728. $\begin{align}\vdash \colon\ldotp P\in \text{connex} \cap &\text{Rl}ʻJ.\alpha \in \text{sect}ʻP:{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\lor.\\ &{\sim}\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ):\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{limin}} _{P}ʻ(CʻP-\alpha )\end{align}$

The remaining propositions are mainly occupied with relation-arithmetic. The most important of them is

*211·82. $\begin{align}\vdash \colon\colon P\in \text{Ser}.&Q\in \text{D}ʻP\unicode{x0294f}.\supset \colon\ldotp \\ &CʻQ\in \text{sect}ʻP.\equiv :(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x:\\ &\equiv :(\exists R).P=Q\unicode{x2909}R.\lor.P=Q\unicode{x21f8} Bʻ\breve{P}\end{align}$

That is, given any series contained in $P$ , if something can be added to make it into $P$ , its field is a section of $P$ , and vice versa.

*211·01. $\text{sect}ʻP=\hat{\alpha} (\alpha \subset CʻP.Pʻʻ\alpha \subset \alpha ) \quad\text{Df}$

*211·1. $\vdash :\alpha \in \text{sect}ʻP.\equiv .\alpha \subset CʻP.Pʻʻ\alpha \subset \alpha \quad[(*211·01)]$

*211·11. $\vdash :\alpha \in \text{D}ʻP_{\in }.\equiv .(\exists \beta ).\alpha =Pʻʻ\beta \quad[*37·101]$

*211·12. $\vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .\alpha =Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*37·101.*50·1. \supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).&\equiv .(\exists \beta ).\alpha =Pʻʻ\beta .\alpha =\beta .\\ [*13·195] &\equiv .\alpha =Pʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·13. $\vdash :\alpha \in \text{sect}ʻP.\equiv .\alpha =P_{*}ʻʻ\alpha .\equiv .\alpha \in \text{D}ʻ{(P_{*})_{\in }\dot{\cap} I}.\equiv .\alpha \in \text{D}ʻ(P_{*})_{\in }$

Dem. $\begin{array}{l} \vdash .*211·1.*90·23. &\supset \vdash :\alpha \in \text{sect}ʻP.\equiv .\alpha =P_{*}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*90·17. &\supset \vdash .P_{*}ʻʻP_{*}ʻʻ\beta =P_{*}ʻʻ\beta \\ [*13·12] &\supset \vdash :\alpha =P_{*}ʻʻ\beta .\supset .P_{*}ʻʻ\alpha =\alpha :\\ [*211·11] &\supset \vdash :\alpha \in \text{D}ʻ(P_{*})_{\in }.\supset .\alpha =P_{*}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*10·24.*211·11. &\supset \vdash :\alpha =P_{*}ʻʻ\alpha .\supset .\alpha \in \text{D}ʻ(P_{*})_{\in } &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*211·12.\supset \vdash .\text{Prop} \end{array}$

In virtue of the above proposition, the properties of $\text{sect}ʻP$ can be deduced from those of $\text{D}ʻP_{\in }$ or $\text{D}ʻ(P_{\in }\dot{\cap} I)$ by substituting $P_{*}$ for $P$ .

*211·131. $\vdash :\alpha \in \text{sect}ʻP.\supset .Pʻʻ\alpha =P_{\text{po}}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*211·13. \supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha &=PʻʻP_{*}ʻʻ\alpha\\ [*91·52] &=P_{\text{po}}ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·132. $\begin{align}\vdash :\alpha \in \text{sect}ʻP.\supset .&\text{D}ʻ(P\unicode{x0294f}\alpha )=\text{D}ʻ(P_{\text{po}}\unicode{x0294f}\alpha ).\text{ᗡ}ʻ(P\unicode{x0294f}\alpha )=\text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha ).\\ &Cʻ(P\unicode{x0294f}\alpha )=Cʻ(P_{\text{po}}\unicode{x0294f}\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*37·41.*211·131.\supset \vdash :\text{Hp}.\supset .\text{D}ʻ(P_{\text{po}}\unicode{x0294f}\alpha )&=\alpha \cap Pʻʻ\alpha \\ [*37·41] &=\text{D}ʻ(P\unicode{x0294f}\alpha ) &\qquad \text{(1)}\\ \vdash .*91·502. & \supset \vdash .\text{ᗡ}ʻ(P\unicode{x0294f}\alpha )\subset \text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha ) &\qquad \text{(2)}\\ \vdash .*37·41. \supset \vdash \colon\ldotp y\in \text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha ).&\equiv :y\in \alpha \cap \breve{P} _{\text{po}}ʻʻ\alpha :\\ [*91·57] &\equiv :y\in (\alpha \cap \breve{P} ʻʻ\alpha )\cup (\alpha \cap \breve{P} ʻʻ\breve{P} _{\text{po}}ʻʻ\alpha ) &\qquad \text{(3)}\\ \vdash .*211·1. \supset \vdash :\text{Hp}.y\in \alpha \cap \breve{P} ʻʻ\breve{P} _{\text{po}}ʻʻ\alpha .&\supset .(\exists z).zPy.z\in \alpha .\\ [*37·105] &\supset .y\in \breve{P} ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha )\subset \alpha \cap \breve{P} ʻʻ\alpha .\\ [*37·41] &\supset .\text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha )\subset \text{ᗡ}ʻ(P\unicode{x0294f}\alpha ) &\qquad \text{(5)}\\ \vdash .(2).(5). \supset \vdash :\text{Hp}.&\supset .\text{ᗡ}ʻ(P_{\text{po}}\unicode{x0294f}\alpha )=\text{ᗡ}ʻ(P\unicode{x0294f}\alpha ) &\qquad \text{(6)}\\ \vdash .(1).(6).\supset \vdash .\text{Prop} \end{array}$

*211·133. $\vdash :P_{\text{po}}\in \text{connex} .\alpha \in \text{sect}ʻP-1.\supset .Cʻ(P\unicode{x0294f}\alpha )=\alpha$

Dem. $\begin{array}{l} \vdash .*202·55.\supset \vdash :\text{Hp}.&\supset .Cʻ(P_{\text{po}}\unicode{x0294f}\alpha )=\alpha .\\ [*211·132] &\supset .Cʻ(P\unicode{x0294f}\alpha )=\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·14. $\vdash .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{D}ʻP_{\in }.\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*33·263. &\supset \vdash .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .*211·12.*22·42.&\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .Pʻʻ\alpha \subset \alpha &\qquad \text{(2)}\\ \vdash .*211·12.*37·15.&\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\alpha \subset CʻP &\qquad \text{(3)}\\ \vdash .(2).(3).*211·1.&\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\alpha \in \text{sect}ʻP &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*211·15. $\vdash :P\in \text{trans}.\supset .\text{D}ʻP_{\in }\subset \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*211·11.*37·15.&\supset \vdash :\alpha \in \text{D}ʻP_{\in }.\supset .\alpha \subset CʻP &\qquad \text{(1)}\\ \vdash .*211·11.*201·5.&\supset \vdash :P\in \text{trans}.\alpha \in \text{D}ʻP_{\in }.\supset .Pʻʻ\alpha \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*91·504.*37·15.&\supset \vdash .P_{\text{po}}ʻʻ\alpha \subset CʻP &\qquad \text{(1)}\\ \vdash .*91·51·511. &\supset \vdash .PʻʻP_{\text{po}}ʻʻ\alpha \subset P_{\text{po}}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*211·1.&\supset \vdash .\text{Prop} \end{array}$

*211·17. $\begin{align}&\vdash .\text{sect}ʻP=\text{sect}ʻP_{\text{po}}=\text{sect}ʻP_{*} &[*211·13.*90·4.*91·602]\end{align}$

The following propositions are useful in dealing with sectional relations, i.e. relations of the form $P\unicode{x0294f}\alpha$ , where $\alpha \in \text{sect}ʻP$ . Unit sections often need special treatment, owing to the fact that for them we do not have $CʻP\unicode{x0294f}\alpha =\alpha$ .

*211·18. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .\text{sect}ʻP\cap 1=\iotaʻʻ\overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*211·13.\supset \vdash :\alpha \in \text{sect}ʻP\cap 1.&\equiv .\alpha =P_{*}ʻʻ\alpha .\alpha \in 1.\\ [*52·1.*53·301] &\equiv .(\exists x).\alpha =\iota ʻx.\overrightarrow{P}_{*}ʻx=\iota ʻx.\\ [*91·54.*90·12] &\equiv .(\exists x).\alpha =\iota ʻx.\overrightarrow{P}_{\text{po}}ʻx\subset \iota ʻx.x\in CʻP &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻP\cap 1.&\equiv .(\exists x).\alpha =\iota ʻx.\overrightarrow{P}_{\text{po}}ʻx=\Lambda .x\in CʻP.\\ [*91·504] &\equiv .(\exists x).\alpha =\iota ʻx.x{\sim}\in \text{ᗡ}ʻP.x\in CʻP.\\ [*93·103] &\equiv .\alpha \in \iotaʻʻ\overrightarrow{B}ʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·181. $\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset .\text{sect}ʻP\cap 1=\iota ʻ\iota ʻBʻP$

Dem. $\begin{array}{l} \vdash .*202·13·523.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻP\in 1 &\qquad \text{(1)}\\ \vdash .(1).*211·18.*53·3.\supset \vdash .\text{Prop} \end{array}$

*211·182. $\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\text{sect}ʻP\cap 1=\Lambda \quad[*211·18]$

*211·2. $\vdash :\alpha \in \text{sect}ʻP.\supset .\alpha =\alpha \cap CʻP=a\cup Pʻʻ\alpha =(\alpha \cap CʻP)\cup Pʻʻ\alpha =Pʻʻ\alpha \cup \overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*211·1.*22·621·62.\supset \vdash :\text{Hp}.&\supset .\alpha =a\cap CʻP.\alpha =\alpha \cup Pʻʻ\alpha . &\qquad \text{(1)}\\ [*13·12] \supset .\alpha &=(\alpha \cap CʻP)\cup Pʻʻ\alpha &\qquad \text{(2)}\\ [*205·131] &=Pʻʻ\alpha \cup \overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*211·21. $\vdash \colon\ldotp \alpha \in \text{sect}ʻP.\supset :{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\equiv .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*211·2·12. &\supset \vdash :\alpha \in \text{sect}ʻP.{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(1)}\\ \vdash .*211·12.*205·111.&\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·22. $\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP.\supset .\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha \in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*24·24.*13·12. &\supset \vdash :\text{Hp}.\overrightarrow{\text{seq}} _{P}ʻ\alpha =\Lambda .\supset .\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha \in \text{sect}ʻP &\qquad \text{(1)}\\ \vdash .*206·16.*53·3·31.\supset \vdash :\text{Hp}.\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .&Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=Pʻʻ\alpha \cup \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \\ [*206·213] &\subset Pʻʻ\alpha \cup (\alpha \cap CʻP)\cup Pʻʻ\alpha \\ [*211·2] &\subset \alpha &\qquad \text{(2)}\\ \vdash .*211·1.*206·18. &\supset \vdash :\text{Hp}.\supset .\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha \subset CʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*211·1.\supset \vdash .\text{Prop} \end{array}$

*211·23. $\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP.\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\alpha =Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )=\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·211.*211·2.&\supset \vdash :\text{Hp}.\supset .\alpha \subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*206·213.*211·2.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .\alpha =\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash .*53·3·31. \supset \vdash :\text{Hp}.\supset .Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )&=Pʻʻ\alpha \cup \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \\ [(3)] &=Pʻʻ\alpha \cup \alpha \\ [*211·2] & =\alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*211·24. $\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap (\text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ\text{max}_{P}).\supset .\alpha \in \text{D}ʻP_{\in }$

Dem. $\begin{array}{l} \vdash .*211·23·11.&\supset \vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}.\supset .\alpha \in \text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .*211·21·14.&\supset \vdash :\alpha \in \text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P}.\supset .\alpha \in \text{D}ʻP_{\in } &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*22·42.*37·15. &\supset \vdash .CʻP\subset CʻP.PʻʻCʻP\subset CʻP.\\ [*211·1] &\supset \vdash .CʻP\in \text{sect}ʻP &\qquad \text{(1)}\\ \vdash .(1).*40·13.&\supset \vdash .CʻP\subset sʻ\text{sect}ʻP &\qquad \text{(2)}\\ \vdash .*40·151.*211·1. &\supset \vdash .sʻ\text{sect}ʻP\subset CʻP &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash .sʻ\text{sect}ʻP=CʻP &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*211·27. $\vdash :P\in \text{trans}.\supset .(\alpha \cap CʻP)\cup Pʻʻ\alpha \in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*22·43.*37·15.&\supset \vdash .(\alpha \cap CʻP)\cup Pʻʻ\alpha \subset CʻP &\qquad \text{(1)}\\ \vdash .*37·22·265. &\supset \vdash .Pʻʻ\{(\alpha \cap CʻP)\cup Pʻʻ\alpha\}=Pʻʻ\alpha \cup PʻʻPʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*201·5. &\supset \vdash :\text{Hp}.\supset .Pʻʻ\{(\alpha \cap CʻP)\cup Pʻʻ\alpha\}=Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).*211·1.\supset \vdash .\text{Prop} \end{array}$

*211·271. $\vdash :P\in \text{trans}.\supset .(\exists \beta ).\beta \in \text{sect}ʻP.\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\beta .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\beta$

Dem. $\begin{array}{l} \vdash .*205·15·19.\supset \\ \vdash :\text{Hp}.&\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ\{(\alpha \cap CʻP)\cup Pʻʻ\alpha\} &\qquad \text{(1)}\\ \vdash .*206·131·25.\supset \\ \vdash :\text{Hp}.&\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\{(\alpha \cap CʻP)\cup Pʻʻ\alpha\} &\qquad \text{(2)}\\ \vdash .(1).(2).*211·27.\supset \vdash .\text{Prop} \end{array}$

*211·272. $\begin{align}\vdash \colon\ldotp P\in &\text{trans}.\supset :\\ &(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\equiv .\text{sect}ʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*24·11·14.&\supset \vdash :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\supset .\text{sect}ʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(1)}\\ \vdash .*33·41.&\supset \vdash \colon\ldotp \text{sect}ʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\supset :\\ &\beta \in \text{sect}ʻP.\supset _{\beta }.\exists !(\overrightarrow{\text{max}}_{P}ʻ\beta \cup \overrightarrow{\text{seq}} _{P}ʻ\beta ):\\ [*13·12]\supset :\beta \in \text{sect}ʻP.\overrightarrow{\text{max}}_{P}ʻ\alpha &=\overrightarrow{\text{max}}_{P}ʻ\beta .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\beta .\supset _{\alpha ,\beta }.\\ &\exists !(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ):\\ [*10·23]\supset :(\exists \beta ).\beta \in \text{sect}ʻP.\overrightarrow{\text{max}}_{P}ʻ\alpha &=\overrightarrow{\text{max}}_{P}ʻ\beta .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ\beta .\supset _{\alpha }.\\ &\exists !(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(2).*211·271.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{sect}ʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.&\supset .(\alpha ).\exists !(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ).\\ [*33·41] &\supset .(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*211·28. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\alpha \subset CʻP.\alpha {\sim}\in 1.&(CʻP-\alpha ){\sim}\in 1.\supset :\\ &\alpha \in \text{sect}ʻP.\equiv .P =P \unicode{x0294f}\alpha \unicode{x2909}P \unicode{x0294f}(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*204·45.&\supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP.\supset .P=P\unicode{x0294f}\alpha \unicode{x2909}P \unicode{x0294f}(CʻP -\alpha ) &\qquad \text{(1)}\\ \vdash .*160·1.*202·55.&\supset \vdash \colon\ldotp \text{Hp}.P=P\unicode{x0294f}\alpha \unicode{x2909}P\unicode{x0294f}(CʻP-\alpha ).\supset :\\ &x\in \alpha .y\in CʻP-\alpha .\supset .xPy:\\ [\text{Transp}.*204·3] &\supset :x\in \alpha .yPx.\supset .y\in \alpha :\\ [*211·1] &\supset :\alpha \in \text{sect}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·281. $\vdash :P\in \text{Ser}.CʻQ\cap CʻR=\Lambda .P=Q\unicode{x2909}R.\supset .CʻQ\in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*160·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in CʻQ.y\in CʻR.\supset .xPy:\\ [\text{Transp}.*204·3] &\supset :x\in CʻQ.yPx.\supset .y\in CʻQ:\\ [*211·1] &\supset :CʻQ\in \text{sect}ʻP\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·282. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.Q\in &\text{D}ʻP\unicode{x0294f}.CʻP-CʻQ{\sim}\in I.\supset :\\ &CʻQ\in \text{sect}ʻP.\equiv .(\exists R).CʻQ\cap CʻR=\Lambda .P=Q\unicode{x2909}R\\ &[*211·28·281.*200·12]\end{align}$

*211·283. $\vdash :P\,\unicode{x2abd}\, J.P=Q\unicode{x2909}R.\supset .CʻQ\cap CʻR=\Lambda$

Dem. $\begin{array}{l} \vdash .*160·1.\supset \vdash :\text{Hp}.&\supset .CʻQ\uparrow CʻR\,\unicode{x2abd}\, J.\\ [*200·32] & \supset .CʻQ\cap CʻR=\Lambda :\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with $\text{D}ʻP_{\in }$ . This is to be compared with two other classes, namely $\text{sect}ʻP$ and $\overrightarrow{P}ʻʻCʻP$ . The members of $\text{sect}ʻP$ which do not belong to $\text{D}ʻP_{\in }$ are those which have a maximum but no sequent, i.e. (if $P$ is a series), those classes which consist of a term $x$ together with all its predecessors, where x has no immediate successor. In series in which every term except the last has an immediate successor, $CʻP$ will be the only member of $\text{sect}ʻP-\text{D}ʻP_{\in }$ , if the series has a last term; if the series has no last term, $\text{sect}ʻP=\text{D}ʻP_{\in }$ .

The members of $\text{D}ʻP_{\in }$ which are not members of $\overrightarrow{P}ʻʻCʻP$ are those that have no sequent, i.e. those that have no upper limit (for a member of $\text{D}ʻP_{\in}$ which has no sequent has also no maximum). These are the members of $\text{D}ʻP_{\in }$ corresponding to a "gap," i.e. to a Dedekind section in which neither the earlier terms have a maximum nor the later terms a minimum. Hence in a Dedekindian series, $\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP$ ; and conversely, if $\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP$ , the series is Dedekindian. These properties of $\text{D}ʻP_{\in }$ are proved in the following propositions.

*211·3. $\vdash .\overrightarrow{P}ʻʻCʻP\subset \text{D}ʻP_{\in } \quad[*53·301.*211·11]$

*211·302. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{P}ʻʻCʻP=\text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}$

Dem. $\begin{array}{l} \vdash .*206·4. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻʻCʻP\subset \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(1)}\\ \vdash .*211·3·15.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻʻCʻP\subset \text{sect}ʻP &\qquad \text{(2)}\\ \vdash .*211·23. &\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}\subset \overrightarrow{P}ʻʻCʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*211·31. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} .\alpha \in \text{D}ʻP_{\in }.\supset :\text{E}!\text{seq}_{P}ʻ\alpha .\lor.{\sim}\text{E}!\text{max}_{P}ʻ\alpha \\ &[*206·52.*211·11]\end{align}$

*211·311. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\alpha \in \text{D}ʻP_{\in }.\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\alpha =\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha \\ &[*206·31.*211·11]\end{align}$

*211·312. $\vdash :P\in \text{trans}\cap \text{connex} .\alpha \in \text{D}ʻP_{\in }.\supset .\alpha =Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*211·15·23.\supset \vdash :\text{Hp}.\text{E}!\text{seq}_{P}ʻ\alpha .&\supset .\alpha =Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) &\qquad \text{(1)}\\ \vdash .*211·31. \supset \vdash :\text{Hp}.{\sim}\text{E}!\text{seq}_{P}ʻ\alpha .&\supset .{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\\ [*211·21·15·12]&\supset .\alpha =Pʻʻ\alpha .\\ [*24·24.\text{Hp}] &\supset .\alpha =Pʻʻ(\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·313. $\vdash :\alpha \in \text{sect}ʻP\cap \text{D}ʻP_{\in }.\supset .(\exists \beta ).\beta \in \text{sect}ʻP.\alpha =Pʻʻ\beta$

Dem. $\begin{array}{l} \vdash .*211·1·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :Pʻʻ\alpha \subset \alpha :(\exists \beta ).\alpha =Pʻʻ\beta :\\ [*37·265] &\supset :Pʻʻ\alpha \subset \alpha :(\exists \beta ).\beta \subset CʻP.\alpha =Pʻʻ\beta :\\ [*22·62] &\supset :(\exists \beta ).\beta \subset CʻP.\alpha =Pʻʻ(\alpha \cup \beta ):\\ [*22·58] &\supset :(\exists \beta ).\beta \subset CʻP.Pʻʻ(\alpha \cup \beta )\subset \alpha \cup \beta .\alpha =Pʻʻ(\alpha \cup \beta ):\\ [*37·15] &\supset :(\exists \beta ).\alpha \cup \beta \subset CʻP.Pʻʻ(\alpha \cup \beta )\subset \alpha \cup \beta .\alpha =Pʻʻ(\alpha \cup \beta ):\\ [*211·1] & \supset :(\exists \beta ).\alpha \cup \beta \in \text{sect}ʻP.\alpha =Pʻʻ(\alpha \cup \beta )\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·314. $\vdash :P\in \text{Rl}ʻJ\cap \text{connex} .\alpha \in \text{sect}ʻP\cap \text{D}ʻP_{\in }.\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{E}!\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*211·313.*205·7.\supset \\ \vdash :\text{Hp}.&\supset .(\exists \beta ).\beta \in \text{sect}ʻP.\alpha =Pʻʻ\beta .\text{E}!\text{max}_{P}ʻ\beta &\qquad \text{(1)}\\ \vdash .*37·18.\supset \\ \vdash :\beta \in \text{sect}ʻP.\alpha =Pʻʻ\beta .\text{E}!\text{max}_{P}ʻ\beta .&\supset .\overrightarrow{P}ʻ\text{max}_{P}ʻ\beta \subset \alpha &\qquad \text{(2)}\\ \vdash .*211·1.*205·111.\supset \\ \vdash :\text{Hp}(2).P\in \text{connex} .y\in Pʻʻ\beta .&\supset .y\in \beta -\iota ʻ\text{max}_{P}ʻ\beta .\\ [*205·21] &\supset .yP\text{max}_{P}ʻ\beta &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash :\text{Hp}(2).P\in \text{connex} .&\supset .\alpha =\overrightarrow{P}ʻ\text{max}_{P}ʻ\beta .\\ [*206·4] &\supset .\text{max}_{P}ʻ\beta \text{seq}_{P}\alpha &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

The above proposition and the two following propositions enable us in certain cases to prove propositions concerning the relations of $\text{sect}ʻP$ and $\text{D}ʻP_{\in }$ without assuming that $P$ is transitive. An example of the use of these propositions occurs in *211·754, where the hypothesis assumes $P_{\in }\text{Rl}ʻJ\cap\text{connex}$ . If we used *211·31 and its consequences instead of *211·314 and its consequences, the hypothesis of *211·754 would have to assume $P\in \text{Ser}$ .

*211·315. $\begin{align}\vdash \colon\ldotp P\in \text{Rl}ʻJ\cap \text{connex} .\alpha \in &\text{sect}ʻP.\supset :\\ &\alpha \in \text{D}ʻP_{\in }.\equiv .\alpha \in \text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ\text{max}_{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·314. \supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{D}ʻP_{\in }.\supset .\alpha \in \text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ\text{max}_{P} &\qquad \text{(1)}\\ \vdash .(1).*211·24.\supset \vdash .\text{Prop} \end{array}$

*211·316. $\begin{align}&\vdash :P\in \text{Rl}ʻJ\cap \text{connex} .\supset .\text{sect}ʻP-\text{D}ʻP_{\in }=\text{sect}ʻP\cap \text{ᗡ}ʻ\text{max}_{P}-\text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·315.\text{Transp}]\end{align}$

*211·317. $\vdash :P\in \text{trans}.\supset .\text{D}ʻP_{\in }=P_{\in }ʻʻ\text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*211·15·313. \supset \vdash :\text{Hp}.\supset .\text{D}ʻP_{\in }\subset P_{\in }ʻʻ\text{sect}ʻP &\qquad \text{(1)}\\ \vdash .(1).*37·15.\supset \vdash .\text{Prop} \end{array}$

*211·32. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\supset .\text{D}ʻP_{\in }=\text{sect}ʻP\cap (\text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ\text{max}_{P})\\ &[*211·24·15·31]\end{align}$

*211·321. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\supset .\text{sect}ʻP-\text{D}ʻP_{\in }=\text{sect}ʻP\cap \text{ᗡ}ʻ\text{max}_{P}-\text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·32]\end{align}$

*211·33. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}.\alpha \in \text{sect}ʻP.\supset :\\ &\alpha {\sim}\in \text{D}ʻP_{\in }.\supset .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .{\sim}\text{E}!\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*211·321. \supset \vdash :\text{Hp}.\alpha {\sim}\in \text{D}ʻP_{\in }.&\supset .\text{E}!\text{max}_{P}ʻ\alpha . &\qquad \text{(1)}\\ [*206·35] & \supset .\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .\text{seq}_{P}ʻPʻʻ\alpha =\text{max}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).*206·46. \supset \vdash :\text{Hp}.\alpha {\sim}\in \text{D}ʻP_{\in }.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha &=\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{max}}_{P}ʻ\alpha \\ [(2)] & =\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*211·321. \supset \vdash :\text{Hp}.\alpha {\sim}\in \text{D}ʻP_{\in }.&\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha .\\ [(3)] &\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(2).(4). &\supset \vdash :\text{Hp}.\alpha {\sim}\in \text{D}ʻP_{\in }.\supset .\\ &\text{E}!\text{seq}_{P}ʻPʻʻ\alpha .{\sim}\text{E}!\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·34. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\supset :\alpha \in &\text{sect}ʻP-\text{D}ʻP_{\in }.\equiv .\\ &\alpha =Pʻʻ\alpha \cup \iota ʻ\text{seq}_{P}ʻPʻʻ\alpha .{\sim}\text{E}!\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*211·321. \supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP-\text{D}ʻP_{\in }.&\supset .\text{E}!\text{max}_{P}ʻ\alpha .\\ [*206·35] &\supset .\text{max}_{P}ʻ\alpha =\text{seq}_{P}ʻPʻʻ\alpha . &\qquad \text{(1)}\\ [*211·2] & \supset .\alpha =Pʻʻ\alpha \cup \iota ʻ\text{seq}_{P}ʻPʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*211·321. \supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP-\text{D}ʻP_{\in }.&\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha .\\ [*206·46.(1)] &\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*206·21.*205·111.\supset \vdash :\text{Hp}.\alpha =Pʻʻ\alpha \cup \iota ʻ&\text{seq}_{P}ʻPʻʻ\alpha .\supset .\\ &\text{seq}_{P}ʻPʻʻ\alpha =\text{max}_{P}ʻ\alpha &\qquad \text{(4)}\\ \vdash . (4) . *206·46 . \supset \vdash : \text{Hp} . \alpha = Pʻʻ\alpha \cup {℩}ʻ\text{seq}_{P}ʻPʻʻ\alpha . {\sim} \text{E}! &\text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha . \supset .\\ &{\sim} \text{E}! \text{seq}_{P}ʻ\alpha &\qquad \text{(5)}\\ \vdash . *206·18 . *22·58 . \supset \vdash : &\alpha = Pʻʻ\alpha \cup {℩}ʻ\text{seq}_{P}ʻPʻʻ\alpha . \supset . \alpha \subset CʻP . Pʻʻ\alpha \subset \alpha &\qquad \text{(6)}\\ \vdash . (4) . (5) . (6) . *211·321 . \supset \\ \vdash : \text{Hp} . \alpha = Pʻʻ\alpha \cup {℩}ʻ\text{seq}_{P}ʻPʻʻ\alpha . {\sim} &\text{E}! \text{seq}_{P}ʻ\overrightarrow{\text{seq}} _{P}ʻPʻʻ\alpha . \supset . \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } &\qquad \text{(7)}\\ \vdash . (2) . (3) . (7) . \supset \vdash . \text{Prop} \end{array}$

*211·35. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser} . \supset : \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . \equiv .\\ &(\exists x) . x \in CʻP . \alpha = \overrightarrow{P}ʻx \cup {℩}ʻx . {\sim} \text{E}! \breve{P} _{1}ʻx\end{align}$

Dem. $\begin{array}{l} \vdash . *211·34 . \supset \vdash \colon\ldotp \text{Hp} . \supset :\\ \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . &\equiv . (\exists x) . x = \text{seq}_{P}ʻPʻʻ\alpha . \alpha = Pʻʻ\alpha \cup {℩}ʻx . {\sim} \text{E}! \text{seq}_{P}ʻ{℩}ʻx\\ [*206·21 . *205·111] \equiv . (\exists x) . x = \text{seq}_{P}ʻPʻʻ\alpha . x &= \text{max}_{P}ʻ\alpha .\\ \alpha &= Pʻʻ\alpha \cup {℩}ʻx . {\sim} \text{E}! \text{seq}_{P}ʻ{℩}ʻx .\\ [*206·35] &\equiv . (\exists x) . x = \text{max}_{P}ʻ\alpha . \alpha = Pʻʻ\alpha \cup {℩}ʻx . {\sim} \text{E}! \text{seq}_{P}ʻ{℩}ʻx .\\ [*205·22] &\equiv . (\exists x) . x = \text{max}_{P}ʻ\alpha . \alpha = \overrightarrow{P}ʻx \cup {℩}ʻx . {\sim} \text{E}! \text{seq}_{P}ʻ{℩}ʻx .\\ [*205·197] &\equiv . (\exists x) . x \in CʻP . \alpha = \overrightarrow{P}ʻx \cup {℩}ʻx . {\sim} \text{E}! \text{seq}_{P}ʻ{℩}ʻx .\\ [*206·44] &\equiv . (\exists x) . x \in CʻP . \alpha = \overrightarrow{P}ʻx \cup {℩}ʻx . {\sim} \in ! \breve{P} _{1}ʻx \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*211·351. $\vdash : P \in \text{Ser} . \supset . \text{sect}ʻP - \text{D}ʻP_{\in } = \overrightarrow{P}_{*}ʻʻ(CʻP - \text{D}ʻP_{1})$

Dem. $\begin{array}{l} \vdash . *204·7 . *211·35 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . &\equiv . (\exists x) . x \in CʻP - \text{D}ʻP_{1} . \alpha = \overrightarrow{P}ʻx \cup {℩}ʻx .\\ [*201·521] &\equiv . (\exists x) . x \in CʻP - \text{D}ʻP_{1} . \alpha = \overrightarrow{P}_{*}ʻx .\\ [*37·7] &\equiv . \alpha \in \overrightarrow{P}_{*}ʻʻ(CʻP - \text{D}ʻP_{1}) \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*211·36. $\vdash \colon\ldotp P \in \text{Ser} . \text{D}ʻP_{1} = \text{D}ʻP . \supset : \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . \equiv . \alpha = CʻP . \text{E}! Bʻ\breve{P}$

Dem. $\begin{array}{l} \vdash . *211·351 . \supset \vdash : \text{Hp} . &\supset . \text{sect}ʻP - \text{D}ʻP_{\in } = \overrightarrow{P}_{*}ʻʻ\overrightarrow{B}ʻ\breve{P} &\qquad \text{(1)}\\ \vdash . (1) . *202·52 . &\supset \vdash \colon\ldotp \text{Hp} . \supset :\\ &\alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . \equiv . (\exists x) . x = Bʻ\breve{P} . \alpha = \overrightarrow{P}_{*}ʻx .\\ [*204·11 . *201·521] &\equiv . (\exists x) . x = \beta ʻ\breve{P} . \alpha = CʻP .\\ [*14·204] &\equiv . \alpha = CʻP . \text{E}! Bʻ\breve{P} \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*211·361. $\vdash :P\in \text{Ser}.\text{D}ʻP_{1}=CʻP.\supset .\text{sect}ʻP=\text{D}ʻP_{\in }$

Dem. $\begin{array}{l} \vdash .*201·63. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP_{1}\subset \text{D}ʻP.\\ [*93·103] &\supset .\overrightarrow{B}ʻ\breve{P} =\Lambda &\qquad \text{(1)}\\ \vdash .(1).*211·36.&\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP-\text{D}ʻP_{\in }=\Lambda &\qquad \text{(2)}\\ \vdash .(2).*211·15.&\supset \vdash .\text{Prop} \end{array}$

*211·371. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}:\supset .\text{D}ʻP_{\in }\subset \text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·32]\end{align}$

*211·372. $\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}:\supset .\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*211·371.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{D}ʻP_{\in }.\supset .\text{E}!\text{seq}_{P}ʻ\alpha .\\ [*206·3.*211·1·15] &\supset .\alpha =\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha .\\ [*206·18] &\supset .\alpha \in \overrightarrow{P}ʻʻCʻP &\qquad \text{(1)}\\ \vdash .(1).*211·3.\supset \vdash .\text{Prop} \end{array}$

*211·38. $\vdash \colon\ldotp P\in \text{Ser}.\supset :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\equiv .\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*211·11.&\supset \vdash \colon\ldotp \text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP.\equiv :(\beta ):(\exists x).Pʻʻ\beta =\overrightarrow{P}ʻx.x\in CʻP &\qquad \text{(1)}\\ \vdash .*206·174.*205·111.\supset \\ \vdash :P\in \text{Ser}.{\sim}&\exists !\overrightarrow{\text{max}}_{P}ʻ\beta .\supset .\overrightarrow{\text{seq}} _{P}ʻ\beta =CʻP\cap \hat{x} (Pʻʻ\beta =\overrightarrow{P}ʻx) &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp P\in \text{Ser}.\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP.\supset :{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\beta .\supset .\exists !\overrightarrow{\text{seq}} _{P}ʻ\beta :\\ [*33·41] &\supset :\beta \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(3)}\\ \vdash .(3).*211·372.\supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with $\text{D}ʻ(P_{\in}\dot{\cap} I)$ , i.e. with those sections of $P$ which have no maximum. If $P$ is compact (i.e. if $P^{2}=P$ ), $\text{D}ʻ(P_{\in }\dot{\cap} I)=\text{D}ʻP_{\in }$ . If $P$ is also a Dedekindian series, $\text{D}ʻ(P_{\in }\dot{\cap}I)=\overrightarrow{P}ʻʻCʻP$ . This is the mark of Dedekindian continuity, since it states that, if $Pʻʻ\alpha$ has no maximum, there is an $x$ for which $Pʻʻ\alpha=\overrightarrow{P}ʻx$ , and this $x$ is the upper limit of $\overrightarrow{P}ʻx$ has no maximum, so that the series is compact.

*211·4. $\vdash .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset -\text{ᗡ}ʻ\text{max}_{P}$

Dem. $\begin{array}{l} \vdash .*211·12.\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).&\supset .\alpha -Pʻʻ\alpha =\Lambda .\\ [*205·111] &\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\Lambda :\supset \vdash .\text{Prop} \end{array}$

*211·41. $\vdash .\text{D}ʻ(P_{\in }\dot{\cap} I)=\text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P}$

Dem. $\begin{array}{l} \vdash .*211·1.*205·111.\supset \\ \vdash :\alpha \in \text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P}.&\equiv .\alpha \subset CʻP.Pʻʻ\alpha \subset a.\alpha \subset Pʻʻ\alpha .\\ [*22·41] &\equiv .\alpha \subset CʻP.\alpha =Pʻʻ\alpha .\\ [*37·15.*211·12] &\equiv .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I):\supset \vdash .\text{Prop} \end{array}$

*211·411. $\vdash :P\in \text{trans}.\alpha =Pʻʻ\beta .\alpha \subset Pʻʻ\alpha .\supset .\alpha =Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*30·37. &\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha =PʻʻPʻʻ\beta \\ [*201·5] &\subset Pʻʻ\beta \\ [\text{Hp}] &\subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*22·41.&\supset \vdash :\text{Hp}.\supset .\alpha =Pʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·42. $\vdash :P\in \text{trans}.\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)=\text{D}ʻP_{\in }-\text{ᗡ}ʻ\text{max}_{P}$

Dem. $\begin{array}{l} \vdash .*211·14·4. & \supset \vdash .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{D}ʻP_{\in }-\text{ᗡ}ʻ\text{max}_{P} &\qquad \text{(1)}\\ \vdash .*211·411·11.*205·111.&\supset \vdash :\text{Hp}.\alpha \in \text{D}ʻP_{\in }-\text{ᗡ}ʻ\text{max}_{P}.\supset .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·43. $\vdash :P\in \text{trans}\cap \text{connex} .\supset .\text{D}ʻP_{\in }-\text{ᗡ}ʻ\text{seq}_{P}\subset \text{D}ʻ(P_{\in }\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*211·312.\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{D}ʻP_{\in }.\overrightarrow{\text{seq}} _{P}ʻ\alpha =\Lambda .&\supset .\alpha =Pʻʻ\alpha .\\ [*211·12] &\supset .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·431. $\begin{align}\vdash :P\in \text{trans}\cap &\text{connex} .\supset .\\ &\text{D}ʻP_{\in }-\text{D}ʻ(P_{\in }\dot{\cap} I)=\text{sect}ʻP\cap \text{ᗡ}ʻ\text{max}_{P}\cap \text{ᗡ}ʻ\text{seq}_{P}\\ [*211·32·41]\end{align}$

*211·44. $\begin{align}&\vdash .\Lambda \in \text{D}ʻ(P_{\in }\dot{\cap} I).\Lambda \in \text{D}ʻP_{\in }.\Lambda \in \text{sect}ʻP\\ &[*37·29.*211·12·14]\end{align}$

*211·45. $\vdash :P\in \text{trans}.x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2}).\supset .\overrightarrow{P}ʻx\in \text{D}ʻ(P_{\in}\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*201·501. &\supset \vdash :\text{Hp}.\supset .Pʻʻ\overrightarrow{P}ʻx\subset \overrightarrow{P}ʻx &\qquad \text{(1)}\\ \vdash .*33·41.*32·3·34.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx-Pʻʻ\overrightarrow{P}ʻx=\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx=Pʻʻ\overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash .(3).*211·12.\supset \vdash .\text{Prop} \end{array}$

*211·451. $\vdash :\overrightarrow{P}ʻx\in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2})$

Dem. $\begin{array}{l} \vdash .*211·12.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\overrightarrow{P}ʻx=Pʻʻ\overrightarrow{P}ʻx:\\ [*37·3] &\supset :yPx.\equiv _{y}.yP^{2}x:\\ [*10·51]&\supset :{\sim}(\exists y).yPx.{\sim}(yP^{2}x)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·452. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}.\supset :\overrightarrow{P}ʻx\in \text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2})\\ &[*211*·45·451]\end{align}$

*211·46. $\begin{align}\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} :(\alpha ).\alpha \in &\text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}:\supset .\\ &\text{D}ʻ(P_{\in }\dot{\cap} I)=\overrightarrow{P}ʻʻ\{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·452.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻʻ{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})}\subset \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(1)}\\ \vdash .*211·372·14.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).&\supset .(\exists x).x\in CʻP.\alpha =\overrightarrow{P}ʻx.\overrightarrow{P}ʻx\in \text{D}ʻ(P_{\in }\dot{\cap} I).\\ [*211·452] &\supset .(\exists x).x\in .CʻP.\alpha =.\overrightarrow{P}ʻx.x{\sim}\in \text{ᗡ}ʻ(P\dot{-} P^{2}).\\ [*37·7] &\supset .\alpha \in \overrightarrow{P}ʻʻ\{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·47. $\vdash \colon\ldotp P\in \text{trans}.\supset :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.\equiv .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{ᗡ}ʻ\text{seq}_{P}$

Dem. $\begin{array}{l} \vdash .*211·272.*24·43.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}.&\equiv .\text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P}\subset \text{ᗡ}ʻ\text{seq}_{P}.\\ [*211·41] &\equiv .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{ᗡ}ʻ\text{seq}_{P}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

The following propositions are concerned with certain consequences of the hypothesis $P^{2}=P$ . This hypothesis is important because it is the defining characteristic of compact series.

Dem. $\begin{array}{l} \vdash .*37·33.\supset \vdash :\text{Hp}.&\supset .Pʻʻ\beta =PʻʻPʻʻ\beta .\\ [\text{Hp}.*13·12] &\supset .\alpha =Pʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·51. $\vdash :P^{2}=P.\supset .\text{D}ʻP_{\in }=\text{D}ʻ(P_{\in }\dot{\cap} I) \quad[*211·5·11·12]$

Thus in compact series there is no distinction between the two sorts of segments.

*211·52. $\vdash \colon\ldotp P^{2}=P.P\in \text{connex} .\supset :\text{E}!\text{max}_{P}ʻ\alpha .\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·5.\supset \vdash :P^{2}\,\unicode{x2abd}\, P.P\in \text{connex} .&\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\dot{\exists} !(P\dot{-} P^{2}) &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}.\supset \vdash :P^{2}=P.P\in \text{connex} .&\text{E}!\text{max}_{P}ʻ\alpha .\supset .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha :\\ &\supset \vdash .\text{Prop} \end{array}$

*211·53. $\begin{align}\vdash \colon\colon P^{2}=P.P\in \text{connex} .\supset \colon\ldotp \text{E}!\text{max}_{P}ʻ\alpha .&\lor.\text{E}!\text{seq}_{P}ʻ\alpha :\equiv :\\ &\text{E}!\text{max}_{P}ʻ\alpha .\equiv .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*4·64.\supset \vdash \colon\ldotp \text{E}!\text{max}_{P}ʻ\alpha .\lor.\text{E}!\text{seq}_{P}ʻ\alpha :&\equiv :{\sim}\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{E}!\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*4·73.*211·52.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp {\sim}\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{E}!\text{max}_{P}ʻ\alpha :&\equiv :\text{E}!\text{max}_{P}ʻ\alpha .\equiv .{\sim}\text{E}!\text{seq}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The condition $(\alpha ):\text{E}!\text{max}_{P}ʻ\alpha .\equiv.{\sim}\text{E}!\text{seq}_{P}ʻ\alpha$ is the Dedekindian definition of continuity. In virtue of the above proposition, this is equivalent, in a series, to compactness combined with Dedekind's axiom, namely $(\alpha ):\text{E}!\text{max}_{P}ʻ\alpha .\lor.\text{E}!\text{seq}_{P}ʻ\alpha .$

*211*54. $\vdash \colon\ldotp P\,\unicode{x2abd}\, J:\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset _{\alpha }.{\sim}\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha :\supset .P\,\unicode{x2abd}\, P^{2}$

Dem. $\begin{array}{l} \vdash .*10·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\overrightarrow{\text{max}}_{P}ʻ\iota ʻx.\supset .{\sim}\exists !\text{seq}_{P}ʻ\iota ʻx:\\ [*205·18] &\supset :x\in CʻP.\supset .{\sim}\exists !\text{seq}_{P}ʻ\iota ʻx.\\ [*206·42] &\supset .{\sim}\exists !\overleftarrow{P\dot{-} P^{2}}ʻx.\\ [*33·4] &\supset .x{\sim}\in \text{D}ʻ(P\dot{-} P^{2}) &\qquad \text{(1)}\\ \vdash .*33·263.&\supset \vdash :x{\sim}\in CʻP.\supset .x{\sim}\in \text{D}ʻ(P\dot{-} P^{2}) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.&\supset .\text{D}ʻ(P\dot{-} P^{2})=\Lambda .\\ [*33·241.*25·3] &\supset .P\,\unicode{x2abd}\, P^{2}:\supset \vdash .\text{Prop} \end{array}$

*211·541. $\vdash \colon\ldotp P\in \text{Rl}ʻJ\cap \text{trans}:\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset _{\alpha }.{\sim}\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha :\supset .P=P^{2}$

Dem. $\begin{array}{l} \vdash .*201·1.&\supset \vdash :\text{Hp}.\supset .P^{2}\,\unicode{x2abd}\, P &\qquad \text{(1)}\\ \vdash .*211·54.&\supset \vdash :\text{Hp}.\supset .P\,\unicode{x2abd}\, P^{2} &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*211·55. $\begin{align}&\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp \exists !\overrightarrow{\text{max}}_{P}ʻ\alpha .\supset _{\alpha }.{\sim}\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha :\equiv .P=P^{2}\\ &[*211·52·541]\end{align}$

*211·551. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.\supset :\text{ᗡ}ʻ\text{max}_{P}\cap \text{ᗡ}ʻ\text{seq}_{P}=\Lambda .\equiv .P=P^{2}\\ &[*211·55.*33·41]\end{align}$

*211·552. $\begin{align}\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp \text{E}!\text{max}_{P}ʻ\alpha .&\equiv _{\alpha }.{\sim}\text{E}!\text{seq}_{P}ʻ\alpha :\equiv :\\ &P=P^{2}:(\alpha ):\text{E}!\text{max}_{P}ʻ\alpha .\lor.\text{E}!\text{seq}_{P}ʻ\alpha \\ &[*211·55]\end{align}$

*211·553. $\begin{align}\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp \text{ᗡ}ʻ\text{max}_{P}=-&\text{ᗡ}ʻ\text{seq}_{P}.\equiv :\\ &P=P^{2}:(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\\ [*211·552.*71·163]\end{align}$

The following propositions are concerned in showing that $\text{sect}ʻP$ , $\text{D}ʻP_{\in }$ , and $\text{D}ʻ(P_{\in}\dot{\cap} I)$ all verify the hypotheses of *210, if taken as the $\kappa$ of that number.

*211·56. $\vdash \colon\ldotp P\in \text{connex} .\alpha ,\beta \in \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset Pʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*211·2.\supset \vdash \colon\ldotp \text{Hp}.\exists !\alpha -\beta .&\supset .\exists !\alpha \cap CʻP-\beta -Pʻʻ\beta \\. [*202·501] &\supset .\exists !\alpha \cap pʻ\overleftarrow{P}ʻʻ\beta .\\ [*40·682] &\supset .\beta \subset Pʻʻ\supset \alpha &\qquad \text{(1)}\\ \vdash .(1).*24·55.\supset \vdash .\text{Prop} \end{array}$

*211·561. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{connex} .\alpha ,\beta \in \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset Pʻʻ\alpha \\ &[*211·56·17·131]\end{align}$

*211·562. $\vdash \colon\ldotp P_{\text{po}}\in \text{connex} .\alpha ,\beta \in \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset \alpha \quad[*211·561·1]$

*211·6. $\vdash \colon\ldotp P\in \text{connex} .\alpha ,\beta \in \text{sect}ʻP.\supset :\alpha \subset \beta .\lor.\beta \subset \alpha \quad[*211·56·1]$

*211·61. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} .\alpha ,\beta \in \text{D}ʻP_{\in }.\supset :\alpha \subset \beta .\lor.\beta \subset \alpha \\ &[*211·15·6]\end{align}$

*211·62. $\vdash \colon\ldotp P\in \text{connex} .\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset :\alpha \subset \beta .\lor.\beta \subset \alpha \quad[*211·14·6]$

In the hypothesis of *211·61, it is necessary that $P$ should be transitive as well as connected. Take, for example, $P=x\downarrow y\unicode{x228d} y\downarrow z\unicode{x228d} z\downarrow x (x\neq y.x\neq z.y\neq z).$ Then $P$ is connected, but not transitive; also we have $\overrightarrow{P}ʻy=\iota ʻx.\overrightarrow{P}ʻz=\iota ʻy.$ Hence $\iota ʻx,\iota ʻy\in \text{D}ʻP_{\in }.{\sim}(\iota ʻx\subset\iota ʻy).{\sim}(\iota ʻy\subset \iota ʻx)$ . Thus connection is not sufficient in the hypothesis of *211·61.

*211·63. $\vdash :\lambda \subset \text{sect}ʻP.\supset .sʻ\lambda \in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*211·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \lambda .\supset _{\alpha }.\alpha \subset CʻP:\\ [*40·151] &\supset :sʻ\lambda \subset CʻP &\qquad \text{(1)}\\ \vdash .*211·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \lambda .\supset _{\alpha }.Pʻʻ\alpha \subset \alpha :\\ [*40·8] &\supset :Pʻʻsʻ\lambda \subset sʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*211·1.\supset \vdash .\text{Prop} \end{array}$

This proposition shows that $\text{sect}ʻP$ verifies the hypothesis of *210·251, with the exception of $\text{sect}ʻP{\sim}\in 1$ , which requires $\dot{\exists} !P$ .

*211·631. $\vdash :\lambda \subset \text{sect}ʻP.\supset .pʻ\lambda \cap CʻP\in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*22·43.&\supset \vdash .pʻ\lambda \cap CʻP\subset CʻP &\qquad \text{(1)}\\ \vdash .*211·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \lambda .\supset_\alpha.Pʻʻ\alpha \subset \alpha :\\ [*40·81] &\supset :Pʻʻpʻ\lambda \subset pʻ\lambda :\\ [*37·265·15] &\supset :Pʻʻ(pʻ\lambda \cap CʻP)\subset pʻ\lambda \cap CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·632. $\vdash :\lambda \subset \text{sect}ʻP.\exists !\lambda .\supset .pʻ\lambda \in \text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*40·23.\supset \vdash :\text{Hp}.&\supset .pʻ\lambda \subset sʻ\lambda .\\ [*211·63·1] &\supset .pʻ\lambda \subset CʻP &\qquad \text{(1)}\\ \vdash .(1).*211·631.\supset \vdash .\text{Prop} \end{array}$

*211·633. $\vdash :\lambda \subset \text{sect}ʻP.\supset .pʻ\lambda \cap sʻ\text{sect}ʻP\in \text{sect}ʻP \quad[*211·631·26]$

This proposition shows that $\text{sect}ʻP$ verifies the hypothesis of *210·252, with the exception of $\text{sect}ʻP{\sim}\in 1$ , which requires $\dot{\exists} !P$ .

*211·64. $\vdash :\lambda \subset \text{D}ʻP_{\in }.\supset .sʻ\lambda \in \text{D}ʻP_{\in }$

Dem. $\begin{array}{l} \vdash .*72·504.\supset \vdash :\text{Hp}.\supset .sʻ\lambda &=sʻP_{\in }ʻʻ\breve{P} _{\in }ʻʻ\lambda \\ [*40·38] &=Pʻʻsʻ\breve{P} _{\in }ʻʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*211·11.\supset \vdash .\text{Prop} \end{array}$

*211·65. $\vdash :\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .sʻ\lambda \in \text{D}ʻ(P_{\in }\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*211·12.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \lambda .\supset _{\alpha }.\alpha =P_{\in }ʻ\alpha :\\ [*50·17] &\supset :\lambda =P_{\in }ʻʻ\lambda :\\ [*40·38] &\supset :sʻ\lambda =Pʻʻsʻ\lambda :\\ [*211·12] &\supset :sʻ\lambda \in \text{D}ʻ(P_{\in }\dot{\cap} I)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·66. $\vdash :\dot{\exists} !P.\supset .\text{sect}ʻP,\text{D}ʻP_{\in }{\sim}\in 1$

Dem. $\begin{array}{l} \vdash .*211·44·26. &\supset \vdash .\Lambda ,CʻP\in \text{sect}ʻP &\qquad \text{(1)}\\ \vdash .*33·24.&\supset \vdash :\text{Hp}.\supset .\Lambda \neq CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*52·41. &\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP{\sim}\in 1 &\qquad \text{(3)}\\ \vdash .*211·44·301. &\supset \vdash :\text{Hp}.\supset .\Lambda ,\text{D}ʻP\in \text{D}ʻP_{\in } &\qquad \text{(4)}\\ \vdash .*33·24. &\supset \vdash :\text{Hp}.\supset .\Lambda \neq \text{D}ʻP &\qquad \text{(5)}\\ \vdash .(4).(5).*52·41. &\supset \vdash :\text{Hp}.\supset .\text{D}ʻP_{\in }{\sim}\in 1 &\qquad \text{(6)}\\ \vdash .(3).(6).\supset \vdash .\text{Prop} \end{array}$

*211·661. $\vdash :P\in \text{trans}.\exists !\text{Cl ex}ʻCʻP-\text{ᗡ}ʻ\text{max}_{P}.\supset .\text{D}ʻ(P_{\in }\dot{\cap} I){\sim}\in 1$

Dem. $\begin{array}{l} \vdash .*205·111.\supset \vdash :\alpha \in \text{Cl ex}ʻCʻP-\text{ᗡ}ʻ\text{max}_{P}.&\supset .\exists !\alpha .\alpha \subset CʻP.\alpha \subset Pʻʻ\alpha .\\ [*24·58.*37·2]&\supset .\exists !Pʻʻ\alpha .Pʻʻ\alpha \subset PʻʻPʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*201·5.\supset \\ \vdash \colon\ldotp P\in \text{trans}.\supset :\alpha \in \text{Cl ex}ʻCʻP-\text{ᗡ}ʻ\text{max}_{P}.&\supset .Pʻʻ\alpha =PʻʻPʻʻ\alpha .\exists !Pʻʻ\alpha .\\ [*211·12] & \supset .Pʻʻ\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\exists !Pʻʻ\alpha .\\ [*10·24] &\supset .\exists !\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(2).*211·44.\supset \vdash .\text{Prop} \end{array}$

The following propositions sum up the above results in relation to the hypotheses of *210. The relation $P_{\text{lc}}$ with its field limited to sections or segments, which occurs in the following propositions, is important, and will be considered at length in the following number.

*211·67. $\begin{align}&\vdash :P\in \text{connex} .\kappa =\text{sect}ʻP.Q=P_{\text{lc}}\unicode{x0294f}\kappa .\supset .\text{Hp}*210·12\\ &[*211·6.*210·13]\end{align}$

*211·671. $\begin{align}\vdash : P \in \text{connex} . \kappa = &\text{sect}ʻP . Q = P_{\text{lc}} \unicode{x0294f} \kappa . \dot{\exists} ! P . \supset .\\ &\text{Hp} *210·251 . \text{Hp} *210·252 \quad[*211·67·66·63·633]\end{align}$

*211·68. $\begin{align}&\vdash : P \in \text{trans} \cap \text{connex} . \kappa = \text{D}ʻP_{\in } . Q = P_{\text{lc}} \unicode{x0294f} \kappa . \supset . \text{Hp} *210·12\\ &[*211·61 . *210·13]\end{align}$

*211·681. $\begin{align}&\vdash : P \in \text{trans} \cap \text{connex} . \kappa = \text{D}ʻP_{\in } . Q = P_{\text{lc}} \unicode{x0294f} \kappa . \dot{\exists} ! P . \supset . \text{Hp} *210·251\\ &[*211·68·66·64]\end{align}$

*211·69. $\begin{align}&\vdash : P \in \text{connex} . \kappa = \text{D}ʻ(P_{\in } \dot{\cap} I) . Q = P_{\text{lc}} \unicode{x0294f} \kappa . \supset . \text{Hp} *210·12\\ &[*211·62 . *210·13]\end{align}$

*211·691. $\begin{align}\vdash : P \in \text{connex} . \kappa = \text{D}ʻ(P_{\in } \dot{\cap} I) . Q = P_{\text{lc}} &\unicode{x0294f} \kappa . \text{D}ʻ(P_{\in } \dot{\cap} I) {\sim} \in 1 . \supset .\\ &\text{Hp} *210·251 \quad[*211·69·65]\end{align}$

*211·692. $\begin{align}\vdash : P \in &\text{trans} \cap \text{connex} . \kappa = \text{D}ʻ(P_{\in } \dot{\cap} I) . Q = P_{\text{lc}} \unicode{x0294f} \kappa .\\ &\exists ! \text{Cl ex}ʻCʻP - \text{ᗡ}ʻ\text{max}_{P} . \supset . \text{Hp} *210·251 \quad[*211·691·661]\end{align}$

The following propositions are concerned with the relations of sections and segments of $P$ to sections and segments of $\breve{P}$ . When $\alpha \in \text{sect}ʻP$ , $CʻP - \alpha \in\text{sect}ʻ\breve{P}$ , and vice versa. Also, if $P$ is connected, the maximum of $\alpha$ (if any) is the precedent with respect to $P$ (i.e. the sequent with respect to $\breve{P}$ of $CʻP - \alpha$ , and the sequent of $\alpha$ (if any) is the minimum with respect to $P$ (i.e. the maximum with respect to $\breve{P}$ ) of $CʻP -\alpha$ . Hence the relations to be proved follow easily.

*211·7. $\vdash : \alpha \in \text{sect}ʻP . \supset . CʻP - \alpha \in \text{sect}ʻ\breve{P}$

Dem. $\begin{array}{l} \vdash . *22·43 . &\supset \vdash . CʻP - \alpha \subset CʻP &\qquad \text{(1)}\\ \vdash . *211·1 . *37·1 . \supset \vdash \colon\ldotp \text{Hp} . &\supset : x \in \alpha . yPx . \supset . y \in \alpha :\\ [\text{Transp}] &\supset : x \in \alpha . y {\sim} \in \alpha . \supset . {\sim} (yPx) :\\ [*37·1 . \text{Transp}] &\supset : x \in \alpha . \supset . x {\sim} \in \breve{P} ʻʻ(- \alpha ) :\\ [*37·265] &\supset : \alpha \subset - \breve{P} ʻʻ(CʻP - \alpha ) :\\ [\text{Transp}] &\supset : \breve{P} ʻʻ(CʻP - \alpha ) \subset - \alpha :\\ [*37·15] &\supset : \breve{P} ʻʻ(CʻP - \alpha ) \subset CʻP - \alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . *211·1 . \supset \vdash . \text{Prop} \end{array}$

*211·701. $\vdash : \alpha \in \text{sect}ʻP . \text{E}! \text{max}_{P}ʻ\alpha . \supset . pʻ\overleftarrow{P}ʻʻ\alpha \subset \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha \subset CʻP - \alpha$

Dem. $\begin{array}{l} \vdash . *40·12 . \supset \vdash : \text{Hp} . &\supset . pʻ\overleftarrow{P}ʻʻ\alpha \subset \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *205·101 . \supset \vdash : \text{Hp} . &\supset . \text{max}_{P}ʻ\alpha {\sim} \in Pʻʻ\alpha .\\ [*37·1 . \text{Transp} . *32·181] &\supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha \subset - \alpha .\\ [*33·152] &\supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha \subset CʻP - \alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*211·702. $\vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP . \supset . CʻP - \alpha \subset pʻ\overleftarrow{P}ʻʻ\alpha \quad[*202·501 . *211·1]$

*211·703. $\begin{align}&\vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP - {℩}ʻCʻP . \supset . \exists ! pʻ\overleftarrow{P}ʻʻ\alpha \\ &[*211·702·1 . *24·58]\end{align}$

*211·71. $\begin{align}\vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP . \text{E}! &\text{max}_{P}ʻ\alpha . \supset .\\ &pʻ\overleftarrow{P}ʻʻ\alpha = \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha = CʻP - \alpha\end{align}$

Dem. $\begin{array}{l} \vdash . *202·501 . *211·2 . \supset \vdash : \text{Hp} . &\supset . CʻP - \alpha \subset pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash . (1) . *211·701 . \supset \vdash : \text{Hp} . &\supset . CʻP - \alpha = pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash . (2) . *211·701 . \supset \vdash : \text{Hp} . &\supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha \subset pʻ\overleftarrow{P}ʻʻ\alpha .\\ [*211·701] &\supset . \overleftarrow{P}ʻ\text{max}_{P}ʻ\alpha = pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(3)}\\ \vdash . (2) . (3) . \supset \vdash . \text{Prop} \end{array}$

If $\alpha$ is a section of $P$ , we shall call $CʻP - \alpha$ the complement of $\alpha$ . By the above proposition, if $\alpha$ is a section of $P$ having a maximum, its complement is a section of $\breve{P}$ which is a member of $\overleftarrow{P}ʻʻCʻP$ .

*211·711. $\begin{align}\vdash : P &\in \text{connex} . P^{2} \,\unicode{x2abd}\, J . \alpha \in \text{sect}ʻP . \supset .\\ &\alpha = CʻP - pʻ\overleftarrow{P}ʻʻ\alpha . CʻP \cap pʻ\overleftarrow{P}ʻʻ\alpha = CʻP - \alpha \quad[*202·503 . *211·2]\end{align}$

*211·712. $\vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP . \text{E}! \text{min}_{P}ʻ(CʻP - \alpha ) . \supset . \alpha = \overrightarrow{P}ʻ\text{min}_{P}ʻ(CʻP - \alpha )$

Dem. $\begin{array}{l} \vdash . *211·71 \frac{\breve{P}}{P}. \supset \\ \vdash : P \in \text{connex} . \beta \in \text{sect}ʻ\breve{P} . \text{E}! \text{min}_{P}ʻ\beta . \supset . \overrightarrow{P}ʻ\text{min}_{P}ʻ\beta = CʻP - \beta &\qquad \text{(1)}\\ \vdash . *211·7 . *24·492 . \supset \vdash : \alpha \in \text{sect}ʻP . \beta = CʻP - \alpha . \supset . \beta \in \text{sect}ʻ\breve{P} . \alpha = CʻP - \beta &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*211·713. $\vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP - \text{D}ʻP_{\in } . \supset . \text{E}! \text{max}_{P}ʻ\alpha . {\sim} \text{E}! \text{min}_{P}ʻ(CʻP - \alpha )$

Dem. $\begin{array}{l} \vdash . *211·24 . \text{Transp} . &\supset \vdash : \text{Hp} . \supset . \text{E}! \text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *211·712·3 . &\supset \vdash : P \in \text{connex} . \alpha \in \text{sect}ʻP . \text{E}! \text{min}_{P}ʻ(CʻP - \alpha ) . \supset . \alpha \in \text{D}ʻP_{\in } &\qquad \text{(2)}\\ \vdash . (2) . \text{Transp} . &\supset \vdash : \text{Hp} . \supset . {\sim} \text{E}! \text{min}_{P}ʻ(CʻP - \alpha ) &\qquad \text{(3)}\\ \vdash . (1) . (3) . \supset \vdash . \text{Prop} \end{array}$

*211·714. $\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha \subset \overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )$

Dem. $\begin{array}{l} \vdash .*206·18·2.&\supset \vdash :x\in \overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .x\in CʻP-\alpha &\qquad \text{(1)}\\ \vdash .*206·134. &\supset \vdash :x\in \overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .\overrightarrow{P}ʻx\subset CʻP-pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*202·501.*211·2.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x\in \overrightarrow{\text{seq}} _{P}ʻ\alpha .&\supset .\overrightarrow{P}ʻx\subset \alpha .\\ [*37·462] &\supset .x{\sim}\in \breve{P} ʻʻ(CʻP-\alpha ) &\qquad \text{(3)}\\ \vdash .(1).(3).*205·11.\supset \vdash .\text{Prop} \end{array}$

The above hypothesis is not sufficient to secure $\overrightarrow{\text{seq}}_{P}ʻ\alpha =\text{min}_{P}ʻ(CʻP-\alpha)$ , as may be seen by putting $P=\alpha \uparrow (\alpha \cup \iota ʻx),\,\text{where}\,\exists !\alpha .x{\sim}\in \alpha .$ We then have $P\in \text{connex} .Pʻʻ\alpha =\alpha .CʻP-\alpha=\iota ʻx.pʻ\overleftarrow{P}ʻʻ\alpha =\alpha \cup \iota ʻx$ . Thus $\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )=\iotaʻx.\overrightarrow{\text{seq}}_{P}ʻ\alpha =\Lambda$ . It will be seen that $\alpha \uparrow (\alpha \cup \iota ʻx)\in\text{trans}$ , so that it is useless to add $P\in \text{trans}$ to the hypothesis of *211·714. A sufficient addition is $P\,\unicode{x2abd}\,J$ , as is proved in the following proposition.

*211·715. $\vdash :P\in \text{connex} \cap \text{Rl}ʻJ.\alpha \in \text{sect}ʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )$

Dem. $\begin{array}{l} \vdash .*205·14.&\supset \vdash :x\text{min}_{P}(CʻP-\alpha ).\supset .x\in CʻP-\alpha .\overrightarrow{P}ʻx\cap (CʻP-\alpha )=\Lambda &\qquad \text{(1)}\\ \vdash .(1).*33·152.*211·2.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x\text{min}_{P}(CʻP-\alpha ).&\supset .x\in CʻP-\alpha -Pʻʻ\alpha .\overrightarrow{P}ʻx\subset \alpha .\\ [*202·501] &\supset .x\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha.\overrightarrow{P}ʻx\subset \alpha .\\ [*200·5] &\supset .x\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha .\overrightarrow{P}ʻx\subset -pʻ\overleftarrow{P}ʻʻ\alpha .\\ [*37·1.\text{Transp}] &\supset .x\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha -\breve{P} ʻʻpʻ\overleftarrow{P}ʻʻ\alpha .\\ [*206·11] &\supset .x\text{seq}_{P}\alpha &\qquad \text{(2)}\\ \vdash .(2).*211·714.\supset \vdash .\text{Prop} \end{array}$

*211·72. $\begin{align}\vdash :&P\in \text{connex} .\alpha \in \text{sect}ʻP-\text{D}ʻP_{\in }.\supset .\\ &CʻP-\alpha =\breve{P} ʻʻ(CʻP-\alpha ).CʻP-\alpha \in \text{D}ʻ\{(\breve{P} )_{\in }\dot{\cap} I\} \quad[*211·21·7·713]\end{align}$

*211·721. $\begin{align}\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap (\text{ᗡ}ʻ\text{max}_{P}&\cup \text{ᗡ}ʻ\text{seq}_{P}).\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·71.\supset \vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{max}_{P}.&\supset .pʻ\overleftarrow{P}ʻʻ\alpha =CʻP-\alpha .\\ [*206·13] &\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(1)}\\ \vdash .*211·714.\supset \vdash \colon\ldotp P\in \text{connex} .\alpha \in \text{sect}ʻP.&\supset :\overrightarrow{\text{seq}} _{P}ʻ\alpha \subset \overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ):\\ [*205·3.*206·16] &\supset :\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha .\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(2)}\\ \vdash .(2).&\supset \vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*211·722. $\begin{align}\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP.\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!&\text{seq}_{P}ʻ\alpha .\supset .\\ &\text{max}_{P}ʻ\alpha =\text{prec}_{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·721·7.\supset \vdash :\text{Hp}.&\supset .CʻP-\alpha \in \text{sect}ʻ\breve{P} .\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ).\\ \left[*211·721 \frac{\breve{P},\,CʻP-\alpha}{P,\,\,\alpha}\right] \supset .\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )&=\overrightarrow{\text{max}}_{P}ʻ\{CʻP-(CʻP-\alpha )\}\\ [*24·492] &=\overrightarrow{\text{max}}_{P}ʻ\alpha \\ [\text{Hp}] & =\iota ʻ\text{max}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

We have always, if $P\in \text{connex} .\alpha \in \text{sect}ʻP$ , $\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )\subset \overrightarrow{\text{max}}_{P}ʻ\alpha .$ The converse inclusion does not always hold, as appears (on writing $\breve{P}$ in place of $P$ ) from the note to *211·714. To secure the converse implication, it is sufficient to assume $P\,\unicode{x2abd}\, J$ or $\text{E}!\text{seq}_{P}ʻ\alpha$ or ${\sim}\text{E}!\text{max}_{P}ʻ\alpha$ .

*211·723. $\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP.\supset .\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )\subset \overrightarrow{\text{max}}_{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*202·11.*211·7.\supset \vdash :\text{Hp}.\supset .\breve{P} \in \text{connex} .CʻP-\alpha \in \text{sect}ʻ\breve{P} .\\ \left[*211·714 \frac{\breve{P}}{P}.*205·102.*206·101\right] \supset .\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )\subset \overrightarrow{\text{max}}_{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*211·724. $\begin{align}\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap (\text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ&\text{max}_{P}).\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·722.\supset \vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}&\cap \text{ᗡ}ʻ\text{max}_{P}.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ) &\qquad \text{(1)}\\ \vdash .*211·723.*24·13.\supset \vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP&-\text{ᗡ}ʻ\text{max}_{P}.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).*22·91.\supset \vdash .\text{Prop} \end{array}$

*211·725. $\begin{align}&\vdash :P\in \text{connex} .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{seq}_{P}.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ).\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ) \quad[*211·721·724]\end{align}$

*211·726. $\begin{align}\vdash :P\in \text{connex} \cap \text{Rl}ʻ&J.\alpha \in \text{sect}ʻP.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha = \overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ).\overrightarrow{\text{seq}} _{P}ʻ\alpha = \overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*200·11.*202·11.*211·7.\supset \vdash :\text{Hp}.&\supset .\breve{P} \in \text{connex} \cap \text{Rl}ʻJ.CʻP-\alpha \in \text{sect}ʻ\breve{P}\\ . [*211·715.*205·102.*206·101] &\supset .\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha ) = \overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*211·715.\supset \vdash .\text{Prop} \end{array}$

*211·727. $\begin{align}\vdash \colon\ldotp &P\in \text{connex} \cap \text{Rl}ʻJ.\alpha \in \text{sect}ʻP.\supset :\\ &\text{E}!\text{limax}_Pʻ\alpha . \equiv .\text{E}!\text{limin}_Pʻ(CʻP-\alpha ) \quad[*211·726.*207·44]\end{align}$

*211·728. $\begin{align}\vdash \colon\ldotp P\in \text{connex} &\cap \text{Rl}ʻJ.\alpha \in \text{sect}ʻP:{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\lor.\\ &{\sim}\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ):\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{limin}} _{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·726.*207·43·12.\supset \vdash :\text{Hp}.{\sim}\text{E}!&\text{max}_{P}ʻ\alpha .\supset .\\ \overrightarrow{\text{limax}} _{P}ʻ\alpha &= \overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )\\ [*207·46.*211·726] &= \overrightarrow{\text{limin}} _{P}ʻ(CʻP-\alpha ) &\qquad \text{(1)}\\ \text{Similarly}\quad \vdash :\text{Hp}.{\sim}\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ).&\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{limin}} _{P}ʻ(CʻP-\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*211·729. $\begin{align}\vdash :P\in \text{connex} \cap \text{Rl}ʻJ.&\alpha \in \text{sect}ʻP-(\text{ᗡ}ʻ\text{max}_{P}\cap \text{ᗡ}ʻ\text{seq}_{P}).\supset .\\ &\overrightarrow{\text{limax}} _{P}ʻ\alpha = \overrightarrow{\text{limin}} _{P}ʻ(CʻP-\alpha ) \quad[*211·728·726]\end{align}$

*211·73. $\begin{align}\vdash :P\in \text{connex} .&\alpha \in \text{sect}ʻP-\text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\\ &CʻP-\alpha \in \text{D}ʻ\{(\breve{P} )_{\in }\dot{\cap} I\}-\text{ᗡ}ʻ\text{prec}_{P}\cup \{\text{sect}ʻP-\text{D}ʻ(\breve{P} )_{\in }\}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·21.\supset \vdash :\text{Hp}.&\supset .\alpha \in \text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P}.\\ [*211·7·723] &\supset .CʻP-\alpha \in \text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{prec}_{P}.\\ [*24·41] \supset .CʻP-\alpha \in &(\text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{max}_{P}-\text{ᗡ}ʻ\text{prec}_{P})\cup \\ &(\text{sect}ʻ\breve{P} \cap \text{ᗡ}ʻ\text{max}_{P}-\text{ᗡ}ʻ\text{prec}_{P}).\\ [*211·31·21] &\supset .CʻP-\alpha \in {\text{D}ʻ(\breve{P} )_{\in }\dot{\cap} I}-\text{ᗡ}ʻ\text{prec}_{P}\cup \{\text{sect}ʻP-\text{D}ʻ(\breve{P} )_{\in }\}:\\ \supset \vdash .\text{Prop} \end{array}$

*211·74. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\alpha \in \text{D}ʻP_{\in }-&\text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\\ &CʻP-\alpha \in \text{D}ʻ(\breve{P} )_{\in }-\text{D}ʻ\{(\breve{P} )_{\in }\dot{\cap} I\}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·431.&\supset \vdash :\text{Hp}.\supset .\alpha \in \text{sect}ʻP\cap \text{ᗡ}ʻ\text{max}_{P}\cap \text{ᗡ}ʻ\text{seq}_{P}.\\ [*211·7·725] &\supset .CʻP-\alpha \in \text{sect}ʻ\breve{P} \cap \text{ᗡ}ʻ\text{prec}_{P}\cap \text{ᗡ}ʻ\text{min}_{P}.\\ \left[*211·431 \frac{\breve{P}}{P}\right] &\supset .CʻP-\alpha \in \text{D}ʻ(\breve{P} )_{\in }-\text{D}ʻ\{(\breve{P} )_{\in }\dot{\cap} I\}:\supset \vdash .\text{Prop} \end{array}$

*211·75. $\vdash \colon\ldotp \alpha \subset CʻP.Q=\breve{P} .\supset :\alpha \in \text{sect}ʻP.\equiv .CʻP-\alpha \in \text{sect}ʻQ \quad[*211·7]$

*211·751. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\alpha &\subset CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{D}ʻP_{\in }.\equiv .CʻP-\alpha \in \text{sect}ʻQ\cap (\text{ᗡ}ʻ\text{max}_{Q}\cup -\text{ᗡ}ʻ\text{seq}_{Q})\end{align}$

Dem. $\begin{array}{l} \vdash .*211·32.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{D}ʻP_{\in }.\equiv .\alpha \in \text{sect}ʻP\cap (\text{ᗡ}ʻ\text{seq}_{P}\cup -\text{ᗡ}ʻ\text{max}_{P}).\\ [*211·75·726] &\equiv .CʻP-\alpha \in \text{sect}ʻQ\cap (\text{ᗡ}ʻ\text{max}_{Q}\cup -\text{ᗡ}ʻ\text{seq}_{Q})\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

In the above proposition, " $P \in \text{trans}$ " is necessary in order that $\text{D}ʻP_{\in }$ may be contained in $\text{sect}ʻP$ , and " $P \in \text{Rl}ʻJ$ " is necessary in order that " $(CʻP-\alpha){\sim}\in \text{ᗡ}ʻ\text{seq}_{Q}$ " may imply " $\alpha {\sim}\in\text{ᗡ}ʻ\text{max}_{P}$ ." Hence the full hypothesis " $P\in\text{Ser}$ " becomes necessary.

*211·752. $\begin{align}\vdash \colon\ldotp P\in \text{connex} .\alpha \subset &CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .CʻP-\alpha \in \text{sect}ʻQ-\text{ᗡ}ʻ\text{seq}_{Q}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·41. &\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .\alpha \in \text{sect}ʻP-\text{ᗡ}ʻ\text{max}_{P} &\qquad \text{(1)}\\ \vdash .(1).*211·7·723.&\supset \vdash :\text{Hp}.\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\\ &CʻP-\alpha \in \text{sect}ʻQ-\text{ᗡ}ʻ\text{seq}_{Q}:\supset \vdash .\text{Prop} \end{array}$

*211·753. $\begin{align}\vdash \colon\ldotp P&\in \text{Rl}ʻJ\cap \text{connex} .\alpha \subset CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .CʻP-\alpha \in \text{sect}ʻQ- \text{ᗡ}ʻ\text{seq}_{Q} \quad[*211·41·7·726]\end{align}$

*211·754. $\begin{align}\vdash \colon\ldotp P \in\text{Rl}ʻJ\cap &\text{connex} .\alpha \subset CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{sect}ʻP-\text{D}ʻP_{\in }.\equiv .CʻP-\alpha \in \text{D}ʻ(Q_{\in }\dot{\cap} I)\cap \text{ᗡ}ʻ\text{seq}_{Q}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·316.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻP-\text{D}ʻP_{\in }.&\equiv .\alpha \in \text{sect}ʻP\cap (\text{ᗡ}ʻ\text{max}_{P}\cap -\text{ᗡ}ʻ\text{seq}_{P}).\\ [*211·7·726] &\equiv .CʻP-\alpha \in \text{sect}ʻQ\cap (\text{ᗡ}ʻ\text{seq}_{Q}\cap -\text{ᗡ}ʻ\text{max}_{Q}).\\ [*211·41] & \equiv .CʻP-\alpha \in \text{D}ʻ(Q_{\in }\dot{\cap} I)\cap \text{ᗡ}ʻ\text{seq}_{Q}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·755. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} .\alpha \subset CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{D}ʻP_{\in }-\text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .CʻP-\alpha \in \text{D}ʻQ_{\in }-\text{D}ʻ(Q_{\in }\dot{\cap} I) \quad[*211·74]\end{align}$

*211·756. $\begin{align}&\vdash \colon\ldotp P\in \text{ᗡ}ʻʻʻJ\cap \text{connex} .\alpha \subset CʻP.Q=\breve{P} .\supset :\\ &\alpha \in \text{sect}ʻP-\text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .CʻP-\alpha \in \text{sect}ʻQ\cap \text{ᗡ}ʻ\text{seq}_{Q} \quad[*211·41·7·726]\end{align}$

*211·757. $\begin{align}\vdash \colon\ldotp P&\in \text{Ser}.\alpha \subset CʻP.\supset :\\ &\alpha \in \text{sect}ʻP- \text{D}ʻ(P_{\in }\dot{\cap} I).\equiv .CʻP-\alpha \in \overleftarrow{P}ʻʻCʻP \quad[*211·756·302]\end{align}$

*211·76. $\vdash :P\in \text{Ser}.\supset .\text{D}ʻP_{\in }=(CʻP-)ʻʻ(\text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{tl}_P)$

Dem. $\begin{array}{l} \vdash .*207·13.\text{Transp}.&\supset \vdash .-\text{ᗡ}ʻ\text{tl}_P=\text{ᗡ}ʻ\text{min}_{P}\cup -\text{ᗡ}ʻ\text{seq}_{P} &\qquad \text{(1)}\\ \vdash .(1).*211·751.\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{D}ʻP_{\in }.&\equiv .\alpha \subset CʻP.CʻP-\alpha \in \text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{tl}_P.\\ [*24·492] &\equiv .(\exists \beta ).\beta \in \text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{tl}_P.\alpha =CʻP-\beta .\\ [*38·13] &\equiv .\alpha \in (CʻP-)ʻʻ(\text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{tl}_P)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*211·761. $\begin{align}&\vdash :P\in \text{Ser}.\supset .\text{sect}ʻP\cap \text{ᗡ}ʻ\text{lt}_P=(CʻP-)ʻʻ\{\text{sect}ʻ\breve{P} -\text{D}ʻ(\breve{P} )_{\in }\}\\ &[\text{Proof as in *211·76}]\end{align}$

*211·762. $\vdash :P\in \text{Ser}.\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)=(CʻP-)ʻʻ(\text{sect}ʻ\breve{P} -\overleftarrow{P}ʻʻCʻP)$

Dem. $\begin{array}{l} \vdash .*211·757.\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻP.CʻP-\alpha {\sim}\in \overleftarrow{P}ʻʻCʻP.\equiv .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(1)}\\ \vdash .(1).*24·492.*38·13.\supset \vdash .\text{Prop} \end{array}$

*211·8. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\alpha \in \text{sect}ʻP.\supset .\\ &\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}(P_{\text{po}})ʻ\alpha .\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )=\overrightarrow{\text{min}}(P_{\text{po}})ʻ(CʻP-\alpha )=\overrightarrow{\text{seq}} (P_{\text{po}})ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*211·13.*91·602. &\supset \vdash :\text{Hp}.\supset .\alpha \in \text{sect}ʻP_{\text{po}} &\qquad \text{(1)}\\ \vdash .*211·131.*205·111. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}(P_{\text{po}})ʻ\alpha &\qquad \text{(2)}\\ \vdash .(2) \frac{\breve{P}}{P}.*211·7.(1). \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )&=\overrightarrow{\text{min}}(P_{\text{po}})ʻ(CʻP-\alpha ) &\qquad \text{(3)}\\ [*211·726]&=\overrightarrow{\text{seq}} (P_{\text{po}})ʻ\alpha &\qquad \text{(4)}\\ \vdash .(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*211·81. $\begin{align}\vdash :P\in \text{Ser}.\alpha \in \text{sect}ʻP.\alpha &{\sim}\in 1.CʻP-\alpha \in 1.\supset .\\ &CʻP-\alpha =\iota ʻBʻ\breve{P} .P=P\unicode{x0294f}\alpha \unicode{x21f8} Bʻ\breve{P} .\alpha =\text{D}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*211·7·181·182 \frac{\breve{P}}{P}.&\supset \vdash :\text{Hp}.\supset .CʻP-\alpha =\iota ʻBʻ\breve{P} &\qquad \text{(1)}\\ \vdash .*204·461. &\supset \vdash :\text{Hp}.\supset .P= P\unicode{x0294f}\text{D}ʻP\unicode{x21f8} Bʻ\breve{P} &\qquad \text{(2)}\\ \vdash .(1).*211·1. &\supset \vdash :\text{Hp}.\supset .\alpha =\text{D}ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*211·811. $\vdash :P\in \text{Ser}-\iota ʻ\dot{\Lambda} .P=Q\unicode{x21f8} x.\supset .CʻQ\in \text{sect}ʻP.x=Bʻ\breve{P} .CʻQ=\text{D}ʻP$

Dem. $\begin{array}{l} \vdash .*161·11.\supset \vdash \colon\ldotp \text{Hp}.&\supset :y\in CʻQ.\supset _{y}.yPx:\\ [*204·1] &\supset :x{\sim}\in CʻQ:\\ [*161·15] &\supset :x=Bʻ\breve{P} &\qquad \text{(1)}\\ \vdash .*161·13.\supset \vdash :\text{Hp}.&\supset .CʻQ=\text{D}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*211·1.\supset \vdash .\text{Prop} \end{array}$

*211·812. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}-\iota ʻ\dot{\Lambda} .Q\in \text{D}ʻP\unicode{x0294f}.\supset :\\ &CʻQ\in \text{sect}ʻP.CʻP-CʻQ\in 1.\equiv .(\exists x).P=Q\unicode{x21f8} x.\equiv .P=Q\unicode{x21f8} Bʻ\breve{P}\end{align}$

Dem. $\begin{array}{l} \vdash .*204·4.*201·12. &\supset \vdash :\text{Hp}.\supset .CʻQ{\sim}\in 1 &\qquad \text{(1)}\\ \vdash .*204·41.&\supset \vdash :\text{Hp}.\supset .Q=P\unicode{x0294f}CʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).*211·81.\supset \vdash :\text{Hp}.CʻQ\in &\text{sect}ʻP.CʻP-CʻQ\in 1.\supset .\\ &CʻP-CʻQ=\iota ʻBʻ\breve{P} .P=Q\unicode{x21f8} Bʻ\breve{P} &\qquad \text{(3)}\\ \vdash .*211·811.&\supset \vdash \colon\ldotp \text{Hp}.\supset :(\exists x).P=Q\unicode{x21f8} x.\equiv .P=Q\unicode{x21f8} Bʻ\breve{P} &\qquad \text{(4)}\\ \vdash .*211·811.&\supset \vdash :\text{Hp}.P=Q\unicode{x21f8} x.\supset .CʻQ\in \text{sect}ʻP.CʻP-CʻQ\in 1 &\qquad \text{(5)}\\ \vdash .(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*211·82. $\begin{align}\vdash \colon\colon P\in \text{Ser}.&Q\in \text{D}ʻP\unicode{x0294f}.\supset \colon\ldotp \\ CʻQ\in \text{sect}ʻP.&\equiv :(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x:\\ &\equiv :(\exists R).P=Q\unicode{x2909}R.\lor.P=Q\unicode{x21f8} Bʻ\breve{P} \\ &[*211·282·283·812.*160·22.*161·2]\end{align}$

*211·83. $\vdash :\dot{\exists} !P.x{\sim}\in CʻP.\supset .\text{sect}ʻ(P\unicode{x21f8} x)=\text{sect}ʻP\cup \iota ʻ(CʻP\cup \iota ʻx)$

Dem. $\begin{array}{l} \vdash .*211·1.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻ(P\unicode{x21f8} x).&\equiv .\alpha \subset CʻP\cup \iota ʻx.(P\unicode{x21f8} x)ʻʻ\alpha \subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*161·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻ(P\unicode{x21f8} x).x\in \alpha .&\equiv .\alpha \subset CʻP\cup \iota ʻx.Pʻʻ\alpha \cup CʻP\subset \alpha .x\in \alpha .\\ [*22·41] &\equiv .\alpha =CʻP\cup \iota ʻx &\qquad \text{(2)}\\ \vdash .(1).*161·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻ(P\unicode{x21f8} x).x{\sim}\in \alpha .&\equiv .\alpha \subset CʻP\cup \iota ʻx.Pʻʻ\alpha \subset \alpha .x{\sim}\in \alpha .\\ [*51·25] &\equiv .\alpha \subset CʻP.Pʻʻ\alpha \subset \alpha .\\ [*211·1] &\equiv .\alpha \in \text{sect}ʻP &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*211·84. $\begin{align}\vdash :CʻP\cap CʻQ=\Lambda .\supset .\text{sect}ʻ(P\unicode{x2909}Q)&=\text{sect}ʻP\cup (CʻP\cup )ʻʻ\text{sect}ʻQ\\ &=\text{sect}ʻP\cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·1. &\supset \vdash :\alpha \in \text{sect}ʻ(P\unicode{x2909}Q).\equiv .\alpha \subset CʻP\cup CʻQ.(P\unicode{x2909}Q)ʻʻ\alpha \subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*160·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{sect}ʻ(P\unicode{x2909}Q).\alpha \subset CʻP.&\equiv .\alpha CʻP.Pʻʻ\alpha \subset \alpha .\\ [*211·1] &\equiv .\alpha \in \text{sect}ʻP &\qquad \text{(2)}\\ \vdash .(1).*160·11.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in &\text{sect}ʻ(P\unicode{x2909}Q).\exists !\alpha \cap CʻQ.\equiv .\\ &\alpha \subset CʻP\cup CʻQ.CʻP\cup Qʻʻ\alpha \subset \alpha .\exists !\alpha \cap CʻQ.\\ [*24·43·491] &\equiv .\alpha -CʻP\subset CʻQ.CʻP\subset \alpha .Qʻʻ\alpha \subset \alpha -CʻP.\exists !\alpha -CʻP.\\ [*24·491.*37·265]&\equiv .\alpha -CʻP\subset CʻQ.CʻP\subset \alpha .Qʻʻ(\alpha -CʻP)\subset \alpha -CʻP.\exists !\alpha -CʻP.\\ [*211·1]&\equiv .\alpha -CʻP\in \text{sect}ʻQ-\iota ʻ\Lambda .CʻP\subset \alpha .\\ [*22*92]&\equiv .\alpha \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ) &\qquad \text{(3)}\\ \vdash .*211·26·44.&\supset \vdash .CʻP\in \text{sect}ʻP.CʻP\in (CʻP\cup )ʻʻ(\text{sect}ʻQ\cap \iota ʻ\Lambda ) &\qquad \text{(4)}\\ \vdash .(2).(3).\supset \vdash :\text{Hp}.\supset .\text{sect}ʻ(P\unicode{x2909}Q)&=\text{sect}ʻP\cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda )\\ [(4)] & =\text{sect}ʻP\cup (CʻP\cup )ʻʻ\text{sect}ʻQ:\supset \vdash .\text{Prop} \end{array}$

*211·841. $\begin{align}&\vdash :CʻP\cap CʻQ=\Lambda .\supset .\\ &\text{sect}ʻ(P\unicode{x2909}Q)-\iota ʻ\Lambda =(\text{sect}ʻP-\iota ʻ\Lambda )\cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ) \quad[*211·84]\end{align}$

*211·9. $\vdash .\text{sect}ʻ(x\downarrow y)=\iota ʻ\Lambda \cup \iota ʻ\iota ʻx\cup \iota ʻ(\iota ʻx\cup \iota ʻy)$

Dem. $\begin{array}{l} \vdash .*211·1·26.&\supset \vdash .\Lambda \in \text{sect}ʻ(x\downarrow y).\iota ʻx\cup \iota ʻy\in \text{sect}ʻ(x\downarrow y) &\qquad \text{(1)}\\ \vdash .*55·13. &\supset \vdash :x\neq y.\supset .(x\downarrow y)ʻʻ\iota ʻx=\Lambda &\qquad \text{(2)}\\ \vdash .*55·13. &\supset \vdash :x=y.\supset .(x\downarrow y)ʻʻ\iota ʻx=\iota ʻx &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash .(x\downarrow y)ʻʻ\iota ʻx\subset \iota ʻx.\\ [*211·1] &\supset \vdash .\iota ʻx\in \text{sect}ʻ(x\downarrow y) &\qquad \text{(4)}\\ \vdash .*211·1.*54·4.\supset \\ \vdash \colon\ldotp \beta \in \text{sect}ʻ(x\downarrow y).&\supset :\beta =\Lambda .\lor.\beta =\iota ʻx.\lor.\beta =\iota ʻy.\lor.\beta =\iota ʻx\cup \iota ʻy &\qquad \text{(5)}\\ \vdash .*55·13. \supset \vdash :x\neq y.&\supset .x\in (x\downarrow y)ʻʻ\iota ʻy-\iota ʻy\\ [*211·1] &\supset .\iota ʻy{\sim}\in \text{sect}ʻP &\qquad \text{(6)}\\ \vdash .*51·23. & \supset \vdash :x=y.\supset .\iota ʻy=\iota ʻx &\qquad \text{(7)}\\ \vdash .(5).(6).(7).&\supset \vdash \colon\ldotp \beta \in \text{sect}ʻ(x\downarrow y).\supset :\beta =\Lambda .\lor.\beta =\iota ʻx.\lor.\beta =\iota ʻx\cup \iota ʻy &\qquad \text{(8)}\\ \vdash .(1).(4).(8).\supset \vdash .\text{Prop} \end{array}$

The series of segments or sections of a series may be ordered by the relation of inclusion, after the manner considered in *210. Since, as was shown in *211, sections and segments have the properties assigned to $\kappa$ in the hypothesis of *210, the resulting series are such that every class has either a maximum or a sequent, and either a minimum or a precedent; i.e. the series of segments or sections are Dedekindian. Most of the properties of the series of sections and of the series of segments which have no maximum, only require that the original relation should be connected. The properties of the series of segments in general $(\text{D}ʻP_{\in })$ require also that the original relation should be transitive.

We denote the series of segments by $\varsigma ʻP$ , putting $\varsigma ʻP=P_{\text{lc}}\unicode{x0294f}\text{D}ʻP_{\in } \quad\text{Df}.$

*212·23. $\vdash :P\in \text{trans}\cap \text{connex} .\supset .\varsigma ʻP=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{D}ʻP_{\in }.\alpha \subset \beta .\alpha \neq \beta\}$

In like manner, for the series of segments which have no maximum, we put $\text{sgm}ʻP=P_{\text{lc}}\unicode{x0294f}\text{D}ʻ(P_{\in }\dot{\cap} I) \quad\text{Df},$ and we have

*212·22. $\vdash :P\in \text{connex} .\supset .\text{sgm}ʻP=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\alpha \subset \beta .\alpha \neq \beta\}$

We do not need a special notation for the series of sections, since, in virtue of *211·13, it is $\varsigmaʻP_{*}$ or $\text{sgm}ʻP_{*}$ . Thus, by *212·23,

*212·24. $\vdash :P_{*}\in \text{connex} .\supset .\varsigma ʻP_{*}=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{sect}ʻP.\alpha \subset \beta .a\neq \beta\}$

We begin the number with various propositions on the fields, etc. of these relations, and on the conditions for their existence. We have

*212·132. $\vdash .\text{D}ʻ\varsigma ʻP=\text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP.\text{ᗡ}ʻ\varsigma ʻP=\text{D}ʻP_{\in }-\iota ʻ\Lambda$

*212·133. $\vdash :\dot{\exists} !P.\supset .Cʻ\varsigma ʻP=\text{D}ʻP_{\in }.Bʻ\varsigma ʻP=\Lambda .Bʻ\text{Cnv}ʻ\varsigma ʻP=\text{D}ʻP$

*212·152. $\vdash .\text{ᗡ}ʻ\text{sgm}ʻP=\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda$

*212·17. $\vdash :\dot{\exists} !\varsigma ʻP_{*}.\equiv .\exists !\text{sect}ʻP-\iota ʻ\Lambda .\equiv .\text{sect}ʻP{\sim}\in 1.\equiv .\dot{\exists} !P$

*212·172. $\vdash :\dot{\exists} !P.\supset .Cʻ\varsigma ʻP_{*}=\text{sect}ʻP.Bʻ\varsigma ʻP_{*}=\Lambda .Bʻ\text{Cnv}ʻ\varsigma ʻP_{*}=CʻP$

Of the next set of propositions (*212·2—·25), several have already been mentioned. An important proposition is

*212·25. $\vdash :P\in \text{Ser}.\supset .\overrightarrow{P}^{;}P=(\varsigma ʻP)\unicode{x0294f}\overrightarrow{P}ʻʻCʻP$

We take up next the application of the propositions of *210 to the series of sections and segments. We show that if $P\in\text{connex}$ , $\text{sgm}ʻP$ and $\varsigma ʻP_{*}$ are series (*212·3), and that if $P$ is also transitive, $\varsigma ʻP$ is a series (*212·31). We have

*212·322. $\vdash :P\in \text{connex} .\dot{\exists} !P.\lambda \subset \text{sect}ʻP.\supset .sʻ\lambda =\text{limax}(\varsigma ʻP_{*})ʻ\lambda$

*212·34. $\vdash :P\in \text{connex} .\dot{\exists} !P.\lambda \subset \text{sect}ʻP.\supset .pʻ\lambda \cap CʻP=\text{limin}(\varsigma ʻP_{*})ʻ\lambda$

so that every class of sections has both an upper limit or maximum and a lower limit or minimum (*212·35).

We then prove similar propositions for $\varsigma ʻP$ and $\text{sgm}ʻP$ , except that in place of *212·34 we have

*212·431. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .\dot{\exists} !&P.\lambda \subset \text{D}ʻP_{\in }.\supset .\\ &sʻ(\text{D}ʻP_{\in }\cap \text{Cl}ʻpʻ\lambda )=\text{limin}(\varsigma ʻP)ʻ\lambda\end{align}$

*212·53. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ&(P_{\in }\dot{\cap} I).\supset .\\ &sʻ{\text{D}ʻ(P_{\in }\dot{\cap} I)\cap \text{Cl}ʻpʻ\lambda }=\text{limin}(\text{sgm}ʻP)ʻ\lambda \end{align}$

The reason of the difference from *212·34 is that the product of an existent class of segments may not be a segment. Suppose, for example, the segments are all those that contain a given term $x$ , where $x$ has no immediate successor; then their logical product is $\overrightarrow{P}ʻx\cup \iota ʻx$ , which is a section but not a segment.

We have next (*212·6—·667) a number of propositions on the limits and maxima of sub-classes of $\overrightarrow{P}ʻʻCʻP$ in the series $\varsigma ʻP$ . The interest of this subject lies in its relation to irrationals. If $\alpha$ is a class contained in $CʻP$ and having no limit or maximum, $\overrightarrow{P}ʻʻ\alpha$ is contained in $Cʻ\varsigma ʻP$ , and has a limit in $\varsigma ʻP$ . We may call this limit an irrational segment. There is no irrational term in $CʻP$ , because in $P$ there is no limit to $\alpha$ ; but the limit, in $\varsigma ʻP$ , of $\overrightarrow{P}ʻʻ\alpha$ may be called irrational, because it corresponds to no term in $CʻP$ . It should be observed that (as will be proved in Section F) if $P$ is similar to the series of rationals, $\varsigma ʻP$ is similar to the series of real numbers.

*212·6. $\begin{align}\vdash :P\in \text{Ser}.\alpha \subset CʻP.&\supset .\\ &\overrightarrow{\text{max}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{\text{max}}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻʻ\overrightarrow{\text{max}}_{P}ʻ\alpha \end{align}$

*212·601. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}.\alpha \subset CʻP.\supset :\\ &\text{E}!\text{max}_{P}ʻ\alpha .\equiv .\text{E}!\text{max}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha .\equiv .\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \end{align}$

*212·602. $\vdash \colon\ldotp P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.\supset :\text{E}!\text{max}_{P}ʻ\alpha .\equiv .Pʻʻ\alpha \in \overrightarrow{P}ʻʻ\alpha$

*212·61. $\vdash :P\in \text{trans}\cap \text{connex} .\dot{\exists} !P.\supset .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =Pʻʻ\alpha$

*212·632. $\vdash :P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.Pʻʻ\alpha {\sim}\in \overrightarrow{P}ʻʻCʻP.\supset .Pʻʻ\alpha =\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha$

*212·661. $\begin{align}\vdash :P\in \text{Ser}.\kappa \subset \text{D}ʻP_{\in }.\text{E}!\text{lt}(\varsigma ʻP)ʻ&\kappa .\supset .\\ &\text{lt}(\varsigma ʻP)ʻ\kappa =\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa =sʻ\kappa\end{align}$

This shows that every limit in the series of segments is a limit of a class of what we may call rational segments (i.e. segments of the form $\overrightarrow{P}ʻx$ ), namely it is the limit of $\overrightarrow{P}ʻʻsʻ\kappa$ .

*212·667. $\vdash :P\in \text{Ser}.\supset .\text{D}ʻ\text{lt}(\varsigma ʻP)-\iota ʻ\Lambda =\text{ᗡ}ʻ\text{sgm}ʻP$

This shows that the segments (other than $\Lambda$ ) which are limits of classes of segments are the segments (other than $\Lambda$ ) which have no maximum in $P$ .

The number ends with a set of propositions (*212·7—·72) on the relations of the sections and segments of two correlated series. If $S$ is a correlator of $P$ with $Q$ , then $S_{\in }$ (with its converse domain limited) is a correlator of $\varsigma ʻP_{*}$ with $\varsigma ʻQ_{*}$ , $\varsigma ʻP$ with $\varsigma ʻQ$ and $\text{sgm}ʻP$ with $\text{sgm}ʻQ$ (*212·71 ·711 ·712). Hence

*212·72. $\vdash :P\,\,\text{smor}\,\,Q.\supset .\varsigma ʻP_{*}\,\text{smor}\,\varsigma ʻQ_{*}.\varsigma ʻP\,\text{smor}\,\varsigma ʻQ.\text{sgm}ʻP\,\text{smor}\,\text{sgm}ʻQ$

*212·01. $\varsigma ʻP=P_{\text{lc}}\unicode{x0294f}\text{D}ʻP_{\in } \quad\text{Df}$

*212·02. $\text{sgm}ʻP=P_{\text{lc}}\unicode{x0294f}\text{D}ʻ(P_{\in }\dot{\cap} I) \quad\text{Df}$

*212·1. $\begin{align}&\vdash :\alpha (\varsigma ʻP)\beta .\equiv .\alpha ,\beta \in \text{D}ʻP_{\in }.\exists !\beta -\alpha -Pʻʻ(\alpha -\beta )\\ &[*170·102.*37·15]\end{align}$

*212·11. $\vdash :\alpha (\text{sgm}ʻP)\beta .\equiv .\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\exists !\beta -\alpha$

Dem. $\begin{array}{l} \vdash .*170·102.*37·15.\supset\\ \vdash :\alpha (\text{sgm}ʻP)\beta .&\equiv .\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\exists !\beta -\alpha -Pʻʻ(\alpha -\beta ) &\qquad \text{(1)}\\ \vdash .*211·12.\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).&\supset .-\alpha =-Pʻʻ\alpha .\\ [*37·2.\text{Transp}] &\supset .-\alpha \subset -Pʻʻ(\alpha -\beta ).\\ [*22·621] &\supset .-\alpha -Pʻʻ(\alpha -\beta )=-\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·12. $\vdash :\alpha (\text{sgm}ʻP_{*})\beta .\equiv .\alpha ,\beta \in \text{sect}ʻP.\exists !\beta -\alpha \quad[*211·13.*212·11]$

Thus $\text{sgm}ʻP_{*}$ has the same connection with $\text{sect}ʻP$ as $\text{sgm}ʻP$ has with $\text{D}ʻ(P_{\in}\dot{\cap} I)$ . When $P$ is transitive, $\text{sgm}ʻP_{*}$ also has the same connection[Pg 654] with $\text{sect}ʻP$ as $\varsigma ʻP$ has with $\text{D}ʻP_{\in }$ . The following proposition makes these facts more explicit.

*212·121. $\vdash .\text{sgm}ʻP_{*}=\varsigma ʻP_{*}=P_{\text{lc}}\unicode{x0294f}\text{sect}ʻP$

Dem. $\begin{array}{l} \vdash .*211·13. &\supset \vdash .\text{sgm}ʻP_{*}=P_{\text{lc}}\unicode{x0294f}\text{sect}ʻP &\qquad \text{(1)}\\ \vdash .*212·1.*211·13. &\supset \vdash :\alpha (\varsigma ʻP_{*})\beta .\equiv .\alpha ,\beta \in \text{sect}ʻP.\exists !\beta -\alpha -P_{*}ʻʻ(\alpha -\beta ) &\qquad \text{(2)}\\ \vdash .*211·13. \supset \vdash :\alpha \in \text{sect}ʻP.&\supset .\alpha =P_{*}ʻʻ\alpha .\\ [*37·2] &\supset .P_{*}ʻʻ(\alpha -\beta )\subset \alpha .\\ [\text{Transp}.*22·621] &\supset .-\alpha -P_{*}ʻʻ(\alpha -\beta )=-\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash :\alpha (\varsigma ʻP_{*})\beta .&\equiv .\alpha ,\beta \in \text{sect}ʻP.\exists !\beta -\alpha .\\ [*211·12] &\equiv.\alpha (\text{sgm}ʻP_{*})\beta &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*212·122. $\vdash .\varsigma ʻP,\text{sgm}ʻP\in \text{ᗡ}ʻʻʻJ \quad[*170·17]$

*212·123. $\vdash .Cʻ\varsigma ʻP,Cʻ\text{sgm}ʻP{\sim}\in 1 \quad[*200·12.*212·122]$

*212·13. $\vdash :\Lambda (\varsigma ʻP)\beta .\equiv .\beta \in \text{D}ʻP_{\in }-\iota ʻ\Lambda \quad[*170·6]$

*212·131. $\vdash :\alpha (\varsigma ʻP)(\text{D}ʻP).\equiv .\alpha \in \text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP$

Dem. $\begin{array}{l} \vdash .*212·1. \supset \vdash :\alpha (\varsigma ʻP)(\text{D}ʻP).&\equiv .\alpha ,\text{D}ʻP\in \text{D}ʻP_{\in }.\exists !\text{D}ʻP-\alpha -Pʻʻ(\alpha -\text{D}ʻP).\\ [*211·301.*37·15] &\equiv .\alpha \in \text{D}ʻP_{\in }.\alpha \subset \text{D}ʻP.\exists !\text{D}ʻP-\alpha .\\ [*24·55.*22·41] &\equiv .\alpha \in \text{D}ʻP_{\in }.\alpha \subset \text{D}ʻP.\alpha \neq \text{D}ʻP.\\ [*37·15] &\equiv .\alpha \in \text{D}ʻP_{\in }.\alpha \neq \text{D}ʻP:\supset \vdash .\text{Prop} \end{array}$

*212·132. $\vdash .\text{D}ʻ\varsigma ʻP=\text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP.\text{ᗡ}ʻ\varsigma ʻP= \text{D}ʻP_{\in }-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash .*212·13·131.&\supset \vdash .\text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP\subset \text{D}ʻ\varsigma ʻP.\text{D}ʻP_{\in }-\iota ʻ\Lambda \subset \text{ᗡ}ʻ\varsigma ʻP &\qquad \text{(1)}\\ \vdash .*212·1.&\supset \vdash .\text{D}ʻ\varsigma ʻP\subset \text{D}ʻP_{\in }.\text{ᗡ}ʻ\varsigma ʻP\subset \text{D}ʻP_{\in } &\qquad \text{(2)}\\ \vdash .*212·1.\supset \vdash :\alpha \in \text{D}ʻ\varsigma ʻP.&\supset .(\exists \beta ).\beta \in \text{D}ʻP_{\in }.\exists !\beta -\alpha .\\ [*37·15] & \supset .\exists !\text{D}ʻP-\alpha &\qquad \text{(3)}\\ \vdash .*212·1.\supset \vdash :\beta \in \text{ᗡ}ʻ\varsigma ʻP.&\supset .(\exists \alpha ).\exists !\beta -\alpha .\\ [*24·561] &\supset .\exists !\beta &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash .\text{D}ʻ\varsigma ʻP\subset -\iota ʻ\text{D}ʻP.\text{ᗡ}ʻ\varsigma ʻP\subset -\iota ʻ\Lambda &\qquad \text{(5)}\\ \vdash .(1).(2).(5).\supset \vdash .\text{Prop} \end{array}$

*212·133. $\vdash :\dot{\exists} !P.\supset .Cʻ\varsigma ʻP=\text{D}ʻP_{\in }.Bʻ\varsigma ʻP=\Lambda .Bʻ\text{Cnv}ʻ\varsigma ʻP= \text{D}ʻP$

Dem. $\begin{array}{l} \vdash .*33·24.\supset \vdash :\text{Hp}.&\supset .\Lambda \neq \text{D}ʻP.\\ [*212·132] &\supset .\Lambda \in \text{D}ʻ\varsigma ʻP.\text{D}ʻP\in \text{ᗡ}ʻ\varsigma ʻP.\\ [*51·221] \supset .\text{D}ʻ\varsigma ʻP&=\{(\text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP)-\iota ʻ\Lambda\}\cup \iota ʻ\Lambda .\\ [*212·132] \supset .Cʻ\varsigma ʻP&=\{(\text{D}ʻP_{\in }-\iota ʻ\Lambda )-\iota ʻ\text{D}ʻP\}\cup \iota ʻ\Lambda \cup (\text{D}ʻP_{\in }-\iota ʻ\Lambda )\\ [*22·63] & =(\text{D}ʻP_{\in }-\iota ʻ\Lambda )\cup \iota ʻ\Lambda \\ [*51·221] & =\text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .(1).*93·103.*212·132.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\varsigma ʻP&=\text{D}ʻP_{\in }-(\text{D}ʻP_{\in }-\iota ʻ\Lambda )\\ [*211·44] &=\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).*93·103.*212·132.\supset \vdash :\text{Hp}.\supset .\overrightarrow{B}ʻ\text{Cnv}ʻ\varsigma ʻP&=\text{D}ʻP_{\in }-(\text{D}ʻP_{\in }-\iota ʻ\text{D}ʻP)\\ [*211·301] & =\iota ʻ\text{D}ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*212·134. $\vdash :P=\dot{\Lambda} .\supset .\varsigma ʻP=\dot{\Lambda} \quad[*170·35]$

Dem. $\begin{array}{l} \vdash .*212·133.*211·301.\supset \vdash :\dot{\exists} !P.&\supset .\exists !Cʻ\varsigma ʻP.\\ [*33·24] &\supset .\dot{\exists} !\varsigma ʻP &\qquad \text{(1)}\\ \vdash .(1).*212·134.\supset \vdash .\text{Prop} \end{array}$

*212·141. $\vdash :\alpha \in Cʻ\varsigma ʻP.\equiv .\alpha \in \text{D}ʻP_{\in }.\dot{\exists} !P$

Dem. $\begin{array}{l} \vdash .*10·24. \supset \vdash :\alpha \in Cʻ\varsigma ʻP.&\supset .\exists !Cʻ\varsigma ʻP.\\ [*33·24.*212·14] &\supset .\dot{\exists} !P. &\qquad \text{(1)}\\ [*212·133.\text{Hp}] &\supset .\alpha \in \text{D}ʻP_{\in } &\qquad \text{(2)}\\ \vdash .*212·133.\supset \vdash :\alpha \in \text{D}ʻP_{\in }.\dot{\exists} !P.&\supset .\alpha \in Cʻ\varsigma ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*212·142. $\vdash :\dot{\exists} !\varsigma ʻP.\equiv .\text{D}ʻP_{\in }{\sim}\in 1$

Dem. $\begin{array}{l} \vdash .*211·66.*212·14. &\supset \vdash :\dot{\exists} !\varsigma ʻP.\supset .\text{D}ʻP_{\in }{\sim}\in 1 &\qquad \text{(1)}\\ \vdash .*212·132.*211·44.\supset \vdash :\text{D}ʻP_{\in }{\sim}\in 1.&\supset .\exists !\text{ᗡ}ʻ\varsigma ʻP.\\ [*33·24] &\supset .\dot{\exists} !\varsigma ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·15. $\vdash :\Lambda (\text{sgm}ʻP)\beta .\equiv .\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda \quad[\text{Proof as in *212·13}]$

*212·151. $\vdash :P=\dot{\Lambda} .\supset .\text{sgm}ʻP=\dot{\Lambda} \quad[*170·35]$

The converse implication does not hold in this case. For the existence of $\text{sgm}ʻP$ , it is necessary that $CʻP$ should contain classes having no maximum.

*212·152. $\vdash .\text{ᗡ}ʻ\text{sgm}ʻP=\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda \quad[\text{Proof as in *212·132}]$

*212·153. $\vdash :\dot{\exists} !\text{sgm}ʻP.\equiv .\exists !\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda .\equiv .\text{D}ʻ(P_{\in }\dot{\cap} I){\sim}\in 1$

Dem. $\begin{array}{l} \vdash .*212·15. &\supset \vdash :\exists !\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda .\supset .\dot{\exists} !\text{sgm}ʻP &\qquad \text{(1)}\\ \vdash .*212·152.&\supset \vdash :\dot{\exists} !\text{sgm}ʻP.\supset .\exists !\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .*212·11. \supset \vdash :\dot{\exists} !\text{sgm}ʻP.&\supset .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\alpha \neq \beta .\\ [*52·16.\text{Transp}] &\supset .\text{D}ʻ(P_{\in }\dot{\cap} I){\sim}\in 1 &\qquad \text{(3)}\\ \vdash .*211·44.*52·181.\supset \\ \vdash :\text{D}ʻ(P_{\in }\dot{\cap} I){\sim}\in 1.&\supset .(\exists \beta ).\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\beta \neq \Lambda .\\ [*212·15] & \supset .\dot{\exists} !\text{sgm}ʻP &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*212·154. $\vdash :\dot{\exists} !\text{sgm}ʻP.\supset .Cʻ\text{sgm}ʻP=\text{D}ʻ(P_{\in }\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*212·153·15.\supset \vdash :\text{Hp}.&\supset .\Lambda \in \text{D}ʻ\text{sgm}ʻP.\\ [*212·152] &\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)\subset Cʻ\text{sgm}ʻP &\qquad \text{(1)}\\ \vdash .*212·11.&\supset \vdash .Cʻ\text{sgm}ʻP\subset \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·155. $\vdash :\dot{\exists} !\text{sgm}ʻP.\supset .\Lambda =Bʻ\text{sgm}ʻP \quad[*212·152·154.*93·103]$

*212·156. $\begin{align}\vdash :\alpha \in Cʻ\text{sgm}ʻP.&\equiv .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\dot{\exists} !\text{sgm}ʻP.\\ &\equiv .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\text{D}ʻ(P_{\in }\dot{\cap} I){\sim}\in 1\end{align}$

Dem. $\begin{array}{l} \vdash .*212·154.&\supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).\dot{\exists} !\text{sgm}ʻP.\supset .\alpha \in Cʻ\text{sgm}ʻP &\qquad \text{(1)}\\ \vdash .*10·24.*33·24.\supset \vdash :\alpha \in Cʻ\text{sgm}ʻP.&\supset .\dot{\exists} !\text{sgm}ʻP. &\qquad \text{(2)}\\ [*212·154] &\supset .\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*212·153.\supset \vdash .\text{Prop} \end{array}$

*212·16. $\vdash :\text{ᗡ}ʻP\subset \text{D}ʻP.\supset .\text{D}ʻP\in \text{D}ʻ(P_{\in }\dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*37·27.\supset \vdash :\text{Hp}.\supset .Pʻʻ\text{D}ʻP=\text{D}ʻP &\qquad \text{(1)}\\ \vdash .(1).*211·12.\supset \vdash .\text{Prop} \end{array}$

*212·161. $\vdash :\text{ᗡ}ʻP\subset \text{D}ʻP.\dot{\exists} !P.\supset .\dot{\exists} !\text{sgm}ʻP$

Dem. $\begin{array}{l} \vdash .*33·24.*212·16.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻP\in \text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda .\\ [*212·15] &\supset .\Lambda (\text{sgm}ʻP)(\text{D}ʻP).\\ [*11·36] & \supset .\dot{\exists} !\text{sgm}ʻP:\supset \vdash .\text{Prop} \end{array}$

*212·162. $\begin{align}\vdash :\text{ᗡ}ʻP\subset \text{D}ʻ&P.\dot{\exists} !P.\supset .\\ &\text{D}ʻP=Bʻ\text{Cnv}ʻ\text{sgm}ʻP.\text{D}ʻ\text{sgm}ʻP=\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\text{D}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*212·16·152.*33·24.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻP\in \text{ᗡ}ʻ\text{sgm}ʻP &\qquad \text{(1)}\\ \vdash .*212·11.*37·24.&\supset \vdash :\text{Hp}.\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\text{D}ʻP.\supset .\alpha (\text{sgm}ʻP)(\text{D}ʻP) &\qquad \text{(2)}\\ \vdash .*37·24. \supset \vdash :\alpha \in \text{D}ʻ(P_{\in }\dot{\cap} I).&\supset .{\sim}\exists !(\alpha -\text{D}ʻP).\\ [*212·11] & \supset .{\sim}\{(\text{D}ʻP)(\text{sgm}ʻP)\alpha\} &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash :\text{Hp}.&\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\text{D}ʻP\subset \text{D}ʻ\text{sgm}ʻP.\text{D}ʻP{\sim}\in \text{D}ʻ\text{sgm}ʻP &\qquad \text{(4)}\\ \vdash .(1).(4).*212·154.\supset \vdash .\text{Prop} \end{array}$

*212·17. $\vdash :\dot{\exists} !\varsigma ʻP_{*}.\equiv .\exists !\text{sect}ʻP-\iota ʻ\Lambda .\equiv .\text{sect}ʻP{\sim}\in 1.\equiv .\dot{\exists} !P$

Dem. $\begin{array}{l} \vdash .*212·132.*211·13.&\supset \vdash :\dot{\exists} !\varsigma ʻP_{*}.\equiv .\exists !\text{sect}ʻP-\iota ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*212·142.*211·13.&\supset \vdash :\dot{\exists} !\varsigma ʻP_{*}.\equiv .\text{sect}ʻP{\sim}\in 1 &\qquad \text{(2)}\\ \vdash .*212·14. \supset \vdash :\dot{\exists} !\varsigma ʻP_{*}.&\equiv .\dot{\exists} !P_{*}.\\ [*90·141] &\equiv .\dot{\exists} !P &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*212·171. $\begin{align}&\vdash .\text{D}ʻ\varsigma ʻP_{*}=\text{sect}ʻP-\iota ʻCʻP.\text{ᗡ}ʻ\varsigma ʻP_{*}=\text{sect}ʻP-\iota ʻ\Lambda \\ &[*212·132.*211·13.*90·14]\end{align}$

*212·172. $\begin{align}&\vdash :\dot{\exists} !P.\supset .Cʻ\varsigma ʻP_{*}=\text{sect}ʻP.Bʻ\varsigma ʻP_{*}=\Lambda .Bʻ\text{Cnv}ʻ\varsigma ʻP_{*}=CʻP\\ &[*212·133.*211·13.*90·141]\end{align}$

*212·173. $\begin{align}&\vdash :\alpha \in Cʻ\varsigma ʻP_{*}.\equiv .\alpha \in \text{sect}ʻP.\dot{\exists} !P.\equiv .\alpha \in \text{sect}ʻP.\text{sect}ʻP{\sim}\in 1\\ &[*212·141·142·14.*211·13]\end{align}$

*212·18. $\vdash.\varsigmaʻ\breve{P}_{*}=(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP_{*}$

Dem. $\begin{array}{l} \vdash .*212·12·121.&\supset \vdash :\alpha (\varsigma ʻ\breve{P} _{*})\beta .\equiv .\alpha ,\beta \in \text{sect}ʻ\breve{P} .\exists !\beta -\alpha .\\ [*211·7] &\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{sect}ʻP.\alpha =CʻP-\gamma .\beta =CʻP-\delta .\exists !\beta -\alpha .\\ [*24·55] & \equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{sect}ʻP.\alpha =CʻP-\gamma .\beta =CʻP-\delta .{\sim}(\beta \subset \alpha ).\\ [*211·1.*24·492]&\equiv .(\exists \gamma ,\delta ).\gamma ,\delta \in \text{sect}ʻP.\alpha =CʻP-\gamma .\beta =CʻP-\delta .{\sim}(\gamma \subset \delta ).\\ [*212·12.*24·55]&\equiv .\alpha {(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP_{*}}\beta :\supset \vdash .\text{Prop} \end{array}$

*212·181. $\vdash .(\varsigma ʻ\breve{P} _{*})\,\text{smor}\,(\text{Cnv}ʻ\varsigma ʻP_{*}) \quad[*212·18]$

*212·2. $\vdash .\text{sgm}ʻP\,\unicode{x2abd}\, \varsigma ʻP.\text{sgm}ʻP\,\unicode{x2abd}\, \varsigma ʻP_{*} \quad[*211·14.*212·1·11·12]$

*212·21. $\vdash :P\in \text{trans}.\supset .\varsigma ʻP\,\unicode{x2abd}\, \varsigma ʻP_{*} \quad[*211·15.*212·12]$

*212·22. $\begin{align}&\vdash :P\in \text{connex} .\supset .\text{sgm}ʻP=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{D}ʻ(P_{\in }\dot{\cap} I).\alpha \subset \beta .\alpha \neq \beta\}\\ &[*211·62.*210·1.*212·11]\end{align}$

*212·23. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\supset .\varsigma ʻP=\hat{\alpha} \hat{\beta} \{\alpha ,\beta \in \text{D}ʻP_{\in }.\alpha \subset \beta .\alpha \neq \beta\}\\ &[*210·13.*211·61.(*212·01)]\end{align}$

*212·24. $\begin{align}&\vdash : P_{*} \in \text{connex} . \supset . \varsigma ʻP_{*} = \hat{\alpha}\hat{\beta} \{\alpha , \beta \in \text{sect}ʻP . \alpha \subset \beta . \alpha \neq \beta\}\\ &[*212·121·22 . *211·13]\end{align}$

*212·25. $\vdash : P \in \text{Ser} . \supset . \overrightarrow{P}^{;}P = (\varsigma ʻP) \unicode{x0294f} \overrightarrow{P}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash . *204·33·331 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : \alpha (\overrightarrow{P}^{;}P)\beta . &\equiv . \alpha , \beta \in \overrightarrow{P}ʻʻCʻP . \alpha \subset \beta . \alpha \neq \beta .\\ [*212·23 . *211·3] &\equiv . \alpha , \beta \in \overrightarrow{P}ʻʻCʻP . \alpha (\varsigma ʻP)\beta \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

The following propositions, down to *212·55, consist of applications of the propositions of *210, where the $\kappa$ of that number is replaced by $\text{sect}ʻP$ , $\text{D}ʻP_{\in }$ , or $\text{D}ʻ(P_{\in } \dot{\cap} 1)$ , and the $Q$ is replaced by $P_{\text{lc}} \unicode{x0294f} \kappa$ , i.e. by $\varsigmaʻP_{*}$ , $\varsigma ʻP$ , or $\text{sgm}ʻP$ . The propositions which follow are important, since the use of segments, especially in connection with continuity, depends largely upon them.

*212·3. $\begin{align}&\vdash : P \in \text{connex} . \supset . \text{sgm}ʻP, \varsigma ʻP_{*} \in \text{Ser}\\ &[*211·67 . *210·14 . *212·121]\end{align}$

*212·31. $\begin{align}&\vdash : P \in \text{trans} \cap \text{connex} . \supset . \varsigma ʻP \in \text{Ser}\\ &[*211·68 . *210·14 . (*212·01)]\end{align}$

*212·32. $\begin{align}&\vdash : P \in \text{connex} . \dot{\exists} ! P . \lambda \in \text{sect}ʻP . sʻ\lambda \in \lambda . \supset . sʻ\lambda = \text{max}(\varsigma ʻP_{*})ʻ\lambda \\ &[*210·211.*211·67.*212·17]\end{align}$

We write $\text{max}(\varsigma ʻP_{*})ʻ\lambda$ , instead of putting $\varsigma ʻP_{*}$ below the line, because, when we have to deal with an expression not consisting of a single letter, it is inconvenient to write it as a suffix, especially when it contains a suffix itself, as in this case.

*212·321. $\begin{align}\vdash : P \in \text{connex} . \dot{\exists} ! P . \lambda \subset \text{sect}ʻP . sʻ\lambda {\sim} \in \lambda . \supset . sʻ\lambda &= \text{seq}(\varsigma ʻP_{*})ʻ\lambda \\ &= \text{lt}(\varsigma ʻP_{*})ʻ\lambda \\ [*210·231 . *211·67 . *212·17 . *211·63]\end{align}$

*212·322. $\begin{align}&\vdash : P \in \text{connex} . \dot{\exists} ! P . \lambda \subset \text{sect}ʻP . \supset . sʻ\lambda = \text{limax}(\varsigma ʻP_{*})ʻ\lambda \\ &[*212·32·321.*207·46]\end{align}$

*212·33. $\begin{align}\vdash : P \in \text{connex} . \dot{\exists} ! P . \lambda \subset \text{sect}ʻP . &pʻ\lambda \cap CʻP \in \lambda . \supset .\\ pʻ\lambda \cap CʻP = \text{min}(\varsigma ʻP_{*})ʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash . *211·671 . *210·252 . *211·26 . \supset \\ \vdash : \text{Hp} . &\supset . pʻ\lambda \cap CʻP \in \overrightarrow{\text{min}}(\varsigma ʻP_{*})ʻ\lambda \cup \overrightarrow{\text{prec}} (\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(1)}\\ \vdash . *206·2 . &\supset \vdash : pʻ\lambda \cap CʻP \in \lambda . \supset . pʻ\lambda \cap CʻP {\sim} e \overrightarrow{\text{prec}} (\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(2)}\\ \vdash . (1) . (2) . &\supset \vdash : \text{Hp} . \supset . pʻ\lambda \cap CʻP \in \overrightarrow{\text{min}}(\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(3)}\\ \vdash . (3) . *205·31 . \supset \vdash . \text{Prop} \end{array}$

*212·331. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !P.\lambda \subset \text{sect}ʻP.&pʻ\lambda \cap CʻP{\sim}\in \lambda .\supset .\\ &pʻ\lambda \cap CʻP = \text{prec} (\varsigma ʻP_{*})ʻ\lambda = \text{tl}(\varsigma ʻP_{*})ʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*211·671.*210·252.*211·26.\supset \\ \vdash :\text{Hp}.\supset .pʻ\lambda \cap CʻP = \text{limin}(\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(1)}\\ \vdash .*205·1.\text{Transp}.\supset \vdash :pʻ\lambda \cap CʻP{\sim}\in \lambda .\supset .pʻ\lambda \cap CʻP{\sim}\in \overrightarrow{\text{min}}(\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*206·161.\supset \vdash .\text{Prop} \end{array}$

*212·34. $\begin{align}&\vdash :P\in \text{connex} .\dot{\exists} !P.\lambda \subset \text{sect}ʻP.\supset .pʻ\lambda \cap CʻP = \text{limin}(\varsigma ʻP_{*})ʻ\lambda \\ &[*212·33·331.*207·46]\end{align}$

*212·35. $\begin{align}&\vdash :P\in \text{connex} .\dot{\exists} !P.\supset .\\ &(\lambda ).\lambda \in \{\text{ᗡ}ʻ\text{max}(\varsigma ʻP_{*})\cup \text{ᗡ}ʻ\text{seq}(\varsigma ʻP_{*})\}\cap \{\text{ᗡ}ʻ\text{min}(\varsigma ʻP_{*})\cup \text{ᗡ}ʻ\text{prec}(\varsigma ʻP_{*})\}\\ &[*210·28.*211·671.*212·121]\end{align}$

*212·36. $\vdash \colon\ldotp P\in \text{connex} .\supset :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP_{*}.\supset .\text{E}!\text{seq}(\varsigma ʻP_{*})ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*211·47.*212·35·3.\supset \\ \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.\supset :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP_{*}.&\supset .\text{E}!\text{seq}(\varsigma ʻP_{*})ʻ\lambda &\qquad \text{(1)}\\ \vdash .*33·24.\supset \vdash :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP_{*}.&\supset .\dot{\exists} !\text{sgm}ʻ\varsigma ʻP_{*}.\\ [*212·151.\text{Transp}] &\supset .\dot{\exists} !\varsigma ʻP_{*}.\\ [*212·17] &\supset .\dot{\exists} !P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·4. $\begin{align}&\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻP_{\in }.sʻ\lambda \in \lambda .\supset .sʻ\lambda = \text{max}(\varsigma ʻP)ʻ\lambda\\ &[*211·68·66.*210·211]\end{align}$

*212·401. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻ&P_{\in }.sʻ\lambda {\sim}\in \lambda .\supset .\\ &sʻ\lambda = \text{seq}(\varsigma ʻP)ʻ\lambda = \text{lt}(\varsigma ʻP)ʻ\lambda \\ [*211·68·66·64.*210·231]\end{align}$

*212·402. $\begin{align}&\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻP_{\in }.\supset .sʻ\lambda = \text{limax}(\varsigma ʻP)ʻ\lambda \\ &[*212·4·401.*207·46]\end{align}$

*212·41. $\begin{align}&\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻP_{\in }.pʻ\lambda \in \lambda .\supset .pʻ\lambda = \text{min}(\varsigma ʻP)ʻ\lambda \\ &[*211·68·66.*210·21]\end{align}$

*212·411. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻ&P_{\in }.pʻ\lambda \in \text{D}ʻP_{\in }-\lambda .\supset .\\ &pʻ\lambda = \text{prec}(\varsigma ʻP)ʻ\lambda = \text{tl}(\varsigma ʻP)ʻ\lambda \\ [*211·68·66.*210·23]\end{align}$

*212·42. $\begin{align}&\vdash :P\in \text{trans} \cap \text{connex} .\dot{\exists} !P.\lambda \subset \text{D}ʻP_{\in }.pʻ\lambda {\sim}\in \lambda .\supset .\\ &sʻ(\text{D}ʻP_{\in }\cap \text{Cl}ʻpʻ\lambda ) = \text{prec}(\varsigma ʻP)ʻ\lambda = \text{tl}(\varsigma ʻP)ʻ\lambda \\ &[*210·26·22.*211·68·66·64]\end{align}$

The cases considered in *212·411 and *212·42 are not mutually exclusive, since if $pʻ\lambda \in \text{D}ʻP_{\in }$ , we have $sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = pʻ\lambda$ .

*212·421. $\begin{align}\vdash : P \in \text{trans} \cap \text{connex} . \dot{\exists} ! P . \lambda \subset \text{D}ʻ&P_{\in } . pʻ\lambda {\sim} \in \text{D}ʻP_{\in } . \supset .\\ &sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = Pʻʻpʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*211·15·1. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \alpha \in \lambda . \supset _{\alpha } . Pʻʻ\alpha \subset \alpha :\\ [*40·81] &\supset : Pʻʻpʻ\lambda \subset pʻ\lambda &\qquad \text{(1)}\\ \vdash .(1).*211·11. \supset \vdash : \text{Hp} . &\supset . Pʻʻpʻ\lambda \in \text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda .\\ [*40·13] &\supset . Pʻʻpʻ\lambda \subset sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) &\qquad \text{(2)}\\ \vdash .*13·196.*60·2. \supset \vdash \colon\ldotp \text{Hp} . &\supset : \alpha \in \text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda . \supset _{\alpha } . \alpha \subset pʻ\lambda . \alpha \neq pʻ\lambda :\\ [*211·56·15·632] &\supset : \exists ! \lambda . \alpha \in \text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda . \supset _{\alpha } . \alpha \subset Pʻʻpʻ\lambda :\\ [*40·151] &\supset : \exists ! \lambda . \supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) \subset Pʻʻpʻ\lambda &\qquad \text{(3)}\\ \vdash .*40·2.*37·24. \supset \vdash : \lambda = \Lambda .&\supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) \subset \text{D}ʻP . Pʻʻpʻ\lambda = \text{D}ʻP &\qquad \text{(4)}\\ \vdash .(3).(4). \supset \vdash : \text{Hp} . &\supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) \subset Pʻʻpʻ\lambda &\qquad \text{(5)}\\ \vdash .(2).(5).\supset \vdash .\text{Prop} \end{array}$

*212·43. $\begin{align}\vdash : P \in \text{trans} \cap &\text{connex} . \dot{\exists} ! P . \lambda \subset \text{D}ʻP_{\in } . pʻ\lambda {\sim} \in \text{D}ʻP_{\in } . \supset .\\ &Pʻʻpʻ\lambda = \text{prec}(\varsigma ʻP)ʻ\lambda = \text{tl}(\varsigma ʻP)ʻ\lambda \quad[*212·42·421]\end{align}$

Thus with regard to the lower end of a class chosen out of $Cʻ\varsigma ʻP$ , we have three cases to distinguish: (1) if $pʻ\lambda \in \lambda$ , $pʻ\lambda$ is the minimum; (2) if $pʻ\lambda \in \text{D}ʻP_{\in } - \lambda$ , $pʻ\lambda$ is the lower limit; (3) if $pʻ\lambda {\sim} \in \text{D}ʻP_{\in }$ , $Pʻʻpʻ\lambda$ is the lower limit.

*212·431. $\begin{align}\vdash : P \in \text{trans} \cap \text{connex} . \dot{\exists} ! P . \lambda &\subset \text{D}ʻP_{\in } . \supset .\\ &sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = \text{limin}(\varsigma ʻP)ʻ\lambda\end{align}$

Dem. $\begin{array}{l} \vdash .*212·42. &\supset \vdash : \text{Hp} . pʻ\lambda {\sim} \in \lambda . \supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = tl(\varsigma ʻP)ʻ\lambda &\qquad \text{(1)}\\ \vdash .*22·441. \supset \vdash : \text{Hp} . pʻ\lambda \in \lambda . &\supset . pʻ\lambda \in (\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) .\\ [*40·13] &\supset . pʻ\lambda \subset sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) &\qquad \text{(2)}\\ \vdash .*60·2. &\supset \vdash : \alpha \in \text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda . \supset . \alpha \subset pʻ\lambda :\\ [*40·151] &\supset \vdash . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) \subset pʻ\lambda &\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash : \text{Hp} . pʻ\lambda \in \lambda . &\supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = pʻ\lambda .\\ [*212·41] &\supset . sʻ(\text{D}ʻP_{\in } \cap \text{Cl}ʻpʻ\lambda ) = min(\varsigma ʻP)ʻ\lambda &\qquad \text{(4)}\\ \vdash .(1).(4).*207·46. \supset \vdash . \text{Prop} \end{array}$

*212·44. $\begin{align}\vdash : &P \in \text{trans} \cap \text{connex} . \dot{\exists} ! P . \supset .\\ &(\lambda ) . \lambda \in \{\text{ᗡ}ʻ\text{max}(\varsigma ʻP) \cup \text{ᗡ}ʻ\text{seq}(\varsigma ʻP)\} \cap \{\text{ᗡ}ʻ\text{min}(\varsigma ʻP) \cup \text{ᗡ}ʻ\text{prec}(\varsigma ʻP)\}\\ &[*211·681.*210·28]\end{align}$

*212·45. $\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} .\supset :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP.\supset .\text{E}!\text{seq}(\varsigma ʻP)ʻ\lambda$

Dem. $\begin{array}{l} \vdash .*211·47.*212·44·31.\supset \\ \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.\supset :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP.&\supset .\text{E}!\text{seq}(\varsigma ʻP)ʻ\lambda &\qquad \text{(1)}\\ \vdash .*33·24.\supset \vdash :\lambda \in Cʻ\text{sgm}ʻ\varsigma ʻP.&\supset .\dot{\exists} !\text{sgm}ʻ\varsigma ʻP.\\ [*212·151.\text{Transp}] &\supset .\dot{\exists} !\varsigma ʻP.\\ [*212·14] &\supset .\dot{\exists} !P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

The proofs of the following propositions are exactly analogous to those of the corresponding propositions on $\varsigma ʻP$ .

*212·5. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).&sʻ\lambda \in \lambda .\supset .\\ &sʻ\lambda =\text{max}(\text{sgm}ʻP)ʻ\lambda\end{align}$

*212·501. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda &\subset \text{D}ʻ(P_{\in }\dot{\cap} I).sʻ\lambda {\sim}\in \lambda .\supset .\\ &sʻ\lambda =\text{seq}(\text{sgm}ʻP)ʻ\lambda =\text{lt}(\text{sgm}ʻP)ʻ\lambda\end{align}$

*212·502. $\begin{align}&\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .sʻ\lambda =\text{limax}(\text{sgm}ʻP)ʻ\lambda\\ &[*212·5·501]\end{align}$

*212·51. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).&pʻ\lambda \in \lambda .\supset .\\ &pʻ\lambda =\text{min}(\text{sgm}ʻP)ʻ\lambda \end{align}$

*212·511. $\begin{align}\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda &\subset \text{D}ʻ(P_{\in }\dot{\cap} I).pʻ\lambda \in \text{D}ʻ(P_{\in }\dot{\cap} I)-\lambda .\supset .\\ &pʻ\lambda =\text{prec}(\text{sgm}ʻP)ʻ\lambda =\text{tl}(\text{sgm}ʻP)ʻ\lambda\end{align}$

*212·52. $\begin{align}\vdash :P\in &\text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).pʻ\lambda {\sim}\in \lambda .\supset .\\ &sʻ\{\text{D}ʻ(P_{\in }\dot{\cap} I)\cap \text{Cl}ʻpʻ\lambda \}=\text{prec}(\text{sgm}ʻP)ʻ\lambda =\text{tl}(\text{sgm}ʻP)ʻ\lambda\end{align}$

This proposition includes *212·511, since, if $pʻ\lambda \in\text{D}ʻ(P_{\in }\dot{\cap} I)$ , we have $sʻ\{\text{D}ʻ(P_{\in }\dot{\cap} I)\cap \text{Cl}ʻpʻ\lambda\}=pʻ\lambda .$

*212·53. $\begin{align}\vdash :P\in &\text{connex} .\dot{\exists} !\text{sgm}ʻP.\lambda \subset \text{D}ʻ(P_{\in }\dot{\cap} I).\supset .\\ &sʻ\{\text{D}ʻ(P_{\in }\dot{\cap} I)\cap \text{Cl}ʻpʻ\lambda\}=\text{limin}(\text{sgm}ʻP)ʻ\lambda \quad[*212·51·52]\end{align}$

*212·54. $\begin{align}&\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\supset .\\ &(\lambda ).\lambda \in \{\text{ᗡ}ʻ\text{max}(\text{sgm}ʻP)\cup \text{ᗡ}ʻ\text{seq}(\text{sgm}ʻP)\}\cap \{\text{ᗡ}ʻ\text{min}(\text{sgm}ʻP)\cap\text{ᗡ}ʻ\text{prec}(\text{sgm}ʻP)\}\end{align}$

*212·55. $\vdash \colon\ldotp P\in \text{connex} .\supset :\lambda \in Cʻ\text{sgm}ʻ\text{sgm}ʻP.\supset .\text{E}!\text{seq}(\text{sgm}ʻP)ʻ\lambda$

The following propositions are concerned with the relations of maxima, limits and sequents in $P$ and $\varsigma ʻP$ respectively. The series $\overrightarrow{P}^{;}P$ , which is ordinally similar to $P$ , is contained in $\varsigma ʻP$ ; and if $\alpha$ has a maximum or limit in $P$ , the maximum or limit of $\overrightarrow{P}ʻʻ\alpha$ in $\varsigma ʻP$ is $\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha$ or $\overrightarrow{P}ʻ\text{lt}_Pʻ\alpha$ . In this way, a series (namely $\overrightarrow{P}^{;}P$ ) which has the same ordinal properties as $P$ can be placed in a certain Dedekindian series (namely $\varsigma ʻP$ ) in such a way that the classes which have limits in $P$ are those whose correlates have[Pg 662] limits which are members of $\overrightarrow{P}ʻʻCʻP$ , while those whose correlates have limits which are not members of $\overrightarrow{P}ʻʻCʻP$ are those which have neither a maximum nor a limit in $P$ . These relations are important in many connections. For example, if $P$ is of the type of the rationals, $\varsigma ʻP$ is of the type of the real numbers: $Cʻ\varsigma ʻP-\overrightarrow{P}ʻʻCʻP$ corresponds to the irrationals, and classes contained in $\overrightarrow{P}ʻʻCʻP$ but having a limit not belonging to $\overrightarrow{P}ʻʻCʻP$ correspond to series of rationals having an irrational limit. In the original series $P$ , there are no irrational limits; but if $\alpha$ is a class in $CʻP$ and having no limit, $\overrightarrow{P}ʻʻ\alpha$ has an irrational limit in $\varsigmaʻP$ .

*212·6. $\begin{align}\vdash :P\in \text{Ser}.\alpha \subset Cʻ&P.\supset .\\ &\overrightarrow{\text{max}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{\text{max}}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻʻ\overrightarrow{\text{max}}_{P}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*205·9.*200·12.\supset \\ \vdash :\text{Hp}.&\supset .\overrightarrow{\text{max}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{\text{max}}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*204·35.*205·8.\supset \\ \vdash :\text{Hp}.&\supset .\overrightarrow{\text{max}}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻʻ\overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·602. $\vdash \colon\ldotp P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.\supset :\text{E}!\text{max}_{P}ʻ\alpha .\equiv .Pʻʻ\alpha \in \overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*212·601.*210·223.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{max}_{P}ʻ\alpha .&\equiv .sʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\alpha .\\ [*40·5] & \equiv .Pʻʻ\alpha \in \overrightarrow{P}ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*212·61. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\dot{\exists} !P.\supset .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =Pʻʻ\alpha\\ &[*212·402.*40·5]\end{align}$

*212·62. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\dot{\exists} !&P.\supset :\\ &\text{E}!\text{limax}_Pʻ\alpha .\equiv .\text{E}!\text{limax}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha .\\ &\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha .\\ &\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*204·35.*207·65.\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{limax}_Pʻ\alpha .&\equiv .\text{E}!\text{limax}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*207·51.\supset \vdash \colon\ldotp \text{Hp}.\supset :\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha =Pʻʻ\alpha .&\equiv .\text{limax}_Pʻ\alpha =\text{limax}_Pʻ\alpha .\\ [*14·28] &\equiv .\text{E}!\text{limax}_Pʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*212·61.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{limax}_Pʻ\alpha .&\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻ\text{limax}_{ P}ʻ\alpha &\qquad \text{(3)}\\ \vdash .*207·51.*14·204.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\,\text{limax}_{P}ʻ\alpha .&\equiv .(\exists x).x\in CʻP.\overrightarrow{P}ʻx=Pʻʻ\alpha .\\ [*37·7] &\equiv .Pʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP &\qquad \text{(4)}\\ \vdash .(1).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*212·621. $\vdash \colon\ldotp P\in \text{Ser}.\beta \subset CʻP.\supset :\text{limax}_Pʻ\alpha \in \beta .\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\beta$

Dem. $\begin{array}{l} \vdash .*33·24. \supset \vdash :\text{Hp}.\text{limax}_Pʻ\alpha \in \beta .&\supset .\dot{\exists} !P.\text{limax}_Pʻ\alpha \in \beta .\\ [*14·21] &\supset .\dot{\exists} !P.\text{E}!\text{limax}_Pʻ\alpha .\text{limax}_Pʻ\alpha \in \beta .\\ [*212·62] &\supset .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\beta &\qquad \text{(1)}\\ \vdash .*33·24.*22·621.&\supset \vdash :\text{Hp}.\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\beta .\supset .\\ &\dot{\exists} !P.\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\beta \cap \overrightarrow{P}ʻʻCʻP.\\ [*212·62] &\supset .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻ\beta .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\beta =\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha .\\ [*72·512.*204·34] &\supset .\text{limax}_Pʻ\alpha \in \beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*212·63. $\begin{align}&\vdash :P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =Pʻʻ\alpha \\ &[*212·61·601.*207·43]\end{align}$

*212·631. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.\supset :\text{E}!\text{lt}_Pʻ\alpha .&\equiv .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻ\text{lt}_Pʻ\alpha .\\ &\equiv .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*207·47. \supset \vdash :\text{E}!\text{lt}_Pʻ\alpha .&\equiv .\text{E}!\text{limax}_Pʻ\alpha .{\sim}\text{E}!\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*212·62·601.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{lt}_Pʻ\alpha .&\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha .{\sim}\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha .\\ [*207·43·11] &\equiv .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻ\text{lt}_Pʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).*212·62·601.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{lt}_Pʻ\alpha .&\equiv .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP.{\sim}\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha .\\ [*207·43·11] &\equiv .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*212·632. $\vdash :P\in \text{Ser}.\dot{\exists} !P.\alpha \subset CʻP.Pʻʻ\alpha {\sim}\in \overrightarrow{P}ʻʻCʻP.\supset .Pʻʻ\alpha =\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*212·602.\supset \vdash :\text{Hp}.&\supset .{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\\ [*212·601] &\supset .{\sim}\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha .\\ [*212·61] &\supset .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =Pʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*212·633. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.\dot{\exists} !P.x\in CʻP.\beta \subset &CʻP.\supset :\\ &x=\text{lt}_Pʻ\beta .\equiv .\overrightarrow{P}ʻx=\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*212·631.*14·21.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x&=\text{lt}_Pʻ\beta .\supset .\overrightarrow{P}ʻx=\text{lt}(\varsigma P)ʻ\overrightarrow{P}ʻʻ\beta &\qquad \text{(1)}\\ \vdash .*212·402.\supset \vdash :\text{Hp}.\overrightarrow{P}ʻx&=\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\beta .\supset .\overrightarrow{P}ʻx=Pʻʻ\beta &\qquad \text{(2)}\\ \vdash .*206·2. \supset \vdash :\text{Hp}.\overrightarrow{P}ʻx&=\text{lt}(\varsigma ʻP )ʻ\overrightarrow{P} ʻʻ\beta .\supset .\overrightarrow{P}ʻx{\sim}\in \overrightarrow{P}ʻʻ\beta .\\ [*72·512.*204·34] &\supset .x{\sim}\in \beta &\qquad \text{(3)}\\ \vdash .(2).(3).*207·232.\supset \vdash :\text{Hp}.\overrightarrow{P}ʻx=\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\beta .\supset .x&=\text{lt}_Pʻ\beta &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*212·65. $\vdash \colon\ldotp P\in \text{Ser}.\alpha \subset CʻP.\supset :\text{E}!\text{seq}_{P}ʻ\alpha .\equiv .\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =\text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*206·17.*210·15.*211·3.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &\overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =\text{seq}(\varsigma ʻP )ʻ\overrightarrow{P} ʻʻ\alpha .\equiv :\\ &y\in \alpha \cap CʻP,\supset _{y}.\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha .\overrightarrow{P}ʻy\neq \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha :\\ &\gamma \in \text{D}ʻP_{\in }.\gamma \subset \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha .\gamma \neq \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha .\supset _{\gamma }.(\exists z).z\in \alpha .\gamma \subset \overrightarrow{P}ʻz :\\ [*204·33.*206·22]&\equiv :y\in \alpha \cap CʻP.\supset _{y}.yP\text{seq}_{P}ʻ\alpha :\\ &\gamma \in \text{D}ʻP_{\in }.\gamma \subset (\alpha \cap CʻP)\cup Pʻʻ\alpha .\gamma \neq (\alpha \cap CʻP)\cup Pʻʻ\alpha .\supset _{\gamma }.(\exists z).z\in \alpha .\gamma \subset \overrightarrow{P}ʻz &\qquad \text{(1)}\\ \vdash .*211·56.&\supset \vdash :\text{Hp}.\gamma \in \text{D}ʻP_{\in }.z\in CʻP-\gamma .\supset .\gamma \subset \overrightarrow{P}ʻz &\qquad \text{(2)}\\ \vdash .(2).&\supset \vdash :\text{Hp}.\gamma \in \text{D}ʻP_{\in }.\gamma \subset (\alpha \cap CʻP)\cup Pʻʻ\alpha .\gamma \neq (\alpha \cap CʻP)\cup Pʻʻ\alpha .\supset .\\ &(\exists z).z\in \alpha .\gamma \subset \overrightarrow{P}ʻz &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =\text{seq}(\varsigma ʻP )ʻ\overrightarrow{P} ʻʻ\alpha .&\equiv :y\in \alpha \cap CʻP.\supset _{y}.yP\text{seq}_{P}ʻ\alpha :\\ [*206·211.*14·21] &\equiv :\text{E}!\text{seq}_{P}ʻ\alpha \colon\colon\supset \vdash .\text{Prop} \end{array}$

*212·651. $\begin{align}\vdash \colon\ldotp &P\in \text{Ser}.\alpha \subset CʻP.\supset :\\ &\text{E}!\text{seq}_{P}ʻ\alpha .\equiv .\text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P} ʻʻCʻP .\equiv .\text{E}!\text{seq}(\overrightarrow{P}^{;}P)ʻ\overrightarrow{P}ʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*212·65.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P}ʻʻCʻP &\qquad \text{(1)}\\ \vdash .*206·17.*210·15.*211·3.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &\text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha =\overrightarrow{P}ʻw.w\in CʻP.\equiv :\\ &y\in \alpha \cap CʻP.\supset _{y}.\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻw.\overrightarrow{P}ʻy\neq \overrightarrow{P}ʻw:\\ &\gamma \in \text{D}ʻP_{\in }.\gamma \subset \overrightarrow{P}ʻw.\gamma \neq \overrightarrow{P}ʻw.\supset _{\gamma }.(\exists z).z\in \alpha .\gamma \subset \overrightarrow{P}ʻz:w\in CʻP:\\ [*204·33.*211·3]&\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻw:yPw.\supset _{y}.(\exists z).z\in \alpha .\overrightarrow{P}ʻy\subset \overrightarrow{P}ʻz:w\in CʻP :\\ [*204·32] &\supset :\alpha \cap CʻP\subset \overrightarrow{P}ʻw.\overrightarrow{P}ʻw\subset \alpha \cup Pʻʻ\alpha .w\in CʻP:\\ [*206·171.*33·15] &\supset :w=\text{seq}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash . (2) . *37·7 . *14·204 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \in \overrightarrow{P} ʻʻCʻP . \supset . \text{E}! \text{seq}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash . (1) . (3) . *206·62 . \supset \vdash . \text{Prop} \end{array}$

*212·652. $\begin{align}\vdash : P \in \text{Ser} . \alpha \subset CʻP . \text{E}! \text{max}_{P}ʻ\alpha . \text{E}! &\text{seq}(\varsigma ʻP )ʻ\overrightarrow{P} ʻʻ\alpha . \supset .\\ &\text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha = \alpha \cup Pʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash . *212·6·601 . *206·46 . &\supset \vdash : \text{Hp} . \supset . \text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha = \text{seq}(\varsigma ʻP)ʻ\iota ʻ\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash . *206·17 . *210·15 . *211·3 . \supset \\ \vdash \colon\colon \text{Hp} . &\supset \colon\ldotp \beta = \text{seq}(\varsigma ʻP)ʻ\iota ʻ\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha . \equiv :\\ &\beta \in \text{D}ʻP_{\in } . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \subset \beta . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \neq \beta :\\ &\gamma \in \text{D}ʻP_{\in } . \gamma \subset \beta . \gamma \neq \beta . \supset _{\gamma } . \gamma \subset \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha :\\ [*201·55 . *210·1] \supset : \beta \in \text{D}ʻP_{\in } . \exists ! &\beta - Pʻʻ(\overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup \iota ʻ\text{max}_{P}ʻ\alpha ) :\\ &\gamma \in \text{D}ʻP_{\in } . \gamma \subset \beta . \gamma \neq \beta . \supset _{\gamma } . \gamma \subset \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha :\\ [*211·56] &\supset : \beta \in \text{D}ʻP_{\in } . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup \iota ʻ\text{max}_{P}ʻ\alpha \subset \beta :\\ &\gamma \in \text{D}ʻP_{\in } . \gamma \subset \beta . \gamma \neq \beta . \supset _{\gamma } . \gamma \subset \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha :\\ [*211·3] &\supset : \beta \in \text{D}ʻP_{\in } . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup \iota ʻ\text{max}_{P}ʻ\alpha \subset \beta : x \in \beta . \supset _{x} . \overrightarrow{P}ʻx \subset \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha :\\ [*40·5] &\supset : \beta \in \text{D}ʻP_{\in } . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup \iota ʻ\text{max}_{P}ʻ\alpha \subset \beta . P ʻʻ\beta \subset \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha :\\ [*202·56] &\supset : \beta \in \text{D}ʻP_{\in } . \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha \cup \iota ʻ\text{max}_{P}ʻ\alpha = \beta :\\ [*205·131·22] &\supset : \beta = \alpha \cup Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash . (1) . (2) . \supset \vdash . \text{Prop} \end{array}$

*212·653. $\vdash \colon\ldotp P \in \text{Ser} . \text{E}! \text{max}_{P}ʻ\alpha . \alpha \subset CʻP . \supset : \text{E}! \text{seq}_{P}ʻ\alpha . \equiv . \text{E}! \text{seq}(\varsigma ʻP) ʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash . *212·652 . &\supset \vdash \colon\ldotp \text{Hp} . \text{E}! \text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha . \supset . \alpha \cup Pʻʻ\alpha \in \text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash . *205·191 . &\supset \vdash : \text{Hp} . \supset . \text{E}! \text{max}_{P}ʻ(\alpha \cup Pʻʻ\alpha ) &\qquad \text{(2)}\\ \vdash . (1) . (2) . *211·31 . \supset \vdash : \text{Hp} (1) . &\supset . \text{E}! \text{seq}_{P}ʻ(\alpha \cup Pʻʻ\alpha ) .\\ [*206·25] &\supset . \text{E}! \text{seq}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash . *212·65 . &\supset \vdash : \text{Hp} . \text{E}! \text{seq}_{P}ʻ\alpha . \supset . \text{E}! \text{seq}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash . (3) . (4) . \supset \vdash . \text{Prop} \end{array}$

*212·66. $\vdash : P \in \text{trans} \cap \text{connex} . \kappa \subset \text{D}ʻP_{\in } . {\sim} \text{E}! \text{max}(\varsigma ʻP )ʻ\kappa . \supset . {\sim} \text{E}! \text{max}_{P}ʻsʻ\kappa$

Dem. $\begin{array}{l} \vdash . *210·1 . *212·23 . \supset \\ \vdash \colon\ldotp \text{Hp} . &\supset : \beta \in \kappa . \supset _{\beta } . (\exists \gamma ) . \gamma \in \kappa . \beta \subset \gamma . \exists ! \gamma - \beta :\\ [*201·5] &\supset : \beta \in \kappa . x \in \beta . \supset _{\beta ,x} . (\exists \gamma ) . \gamma \in \kappa . \exists ! \gamma - \overrightarrow{P} ʻx - \iota ʻx :\\ [*202·101] \supset : x \in sʻ\kappa . &\supset _{x} . (\exists \gamma ) . \gamma \in \kappa . \exists ! \gamma \cap \overleftarrow{P}ʻx .\\ [*37·46] &\supset _{x} . x \in Pʻʻsʻ\kappa \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*212·661. $\vdash : P \in \text{Ser}.\kappa \subset \text{D}ʻP_{\in } . \text{E}! \text{lt}(\varsigma ʻP)ʻ\kappa .\supset .\text{lt}(\varsigma ʻP)ʻ\kappa = \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa = sʻ\kappa$

Dem. $\begin{array}{l} \vdash . *212·402. \supset \vdash : \text{Hp}.\supset .\text{lt}(\varsigma ʻP)ʻ\kappa &= sʻ\kappa &\qquad \text{(1)}\\ \vdash . *212·402. \supset \vdash : \text{Hp}.\supset .\text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa &= Pʻʻsʻ\kappa \\ [*212·66] & = sʻ\kappa &\qquad \text{(2)}\\ \vdash . *212·601·66 .\supset \vdash :\text{Hp}.&\supset .{\sim}\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa &\qquad \text{(3)}\\ \vdash .(2).(3). \supset \vdash :\text{Hp}.\supset .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa &= sʻ\kappa &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*212·662. $\begin{align}\vdash : P \in \text{Ser}. \kappa \subset \text{D}ʻP_{\in } . \text{E}! &\text{lt}(\varsigma ʻP)ʻ\kappa .\supset .\\ &(\exists \lambda ).\lambda \subset \overrightarrow{P}ʻʻCʻP.\text{lt}(\varsigma ʻP)ʻ\kappa = \text{lt}(\varsigma ʻP)ʻ\lambda \\ [*212·661]\end{align}$

*212·663. $\begin{align}\vdash : P \in \text{Ser}. x \in CʻP.\overrightarrow{P}ʻx \in \text{D}ʻ&\text{lt}(\varsigma ʻP).\supset .\\ &\overrightarrow{P}ʻx = \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\overrightarrow{P}ʻx.x = \text{lt}_Pʻ\overrightarrow{P}ʻx\end{align}$

Dem. $\begin{array}{l} \vdash . *212·661 . \supset \vdash : P \in \text{Ser}. x \in CʻP.\overrightarrow{P}ʻx &= lt (\varsigma ʻP)ʻ\kappa .\supset .\\ \overrightarrow{P}ʻx = sʻ\kappa .\overrightarrow{P}ʻx &= lt (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa .\\ [*13·12.*212·66] \supset . \overrightarrow{P}ʻx &= \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\overrightarrow{P}ʻx.{\sim}\text{E}! \text{max}_{P}ʻ\overrightarrow{P}ʻx.\\ [*206·4] \supset . \overrightarrow{P}ʻx = \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\overrightarrow{P}ʻx.x &= \text{lt}_Pʻ\overrightarrow{P}ʻx : \supset \vdash .\text{Prop} \end{array}$

*212·664. $\vdash \colon\ldotp P \in \text{Ser}.x \in CʻP.\supset :x \in \text{D}ʻ\text{lt}_P . \equiv .\overrightarrow{P}ʻx \in \text{D}ʻ\text{lt}(\varsigma ʻP)$

Dem. $\begin{array}{l} \vdash . *212.631 .\supset \vdash : \text{Hp} . x = \text{lt}_Pʻ\alpha .\supset .\overrightarrow{P}ʻx = \text{lt}_Pʻ\overrightarrow{P}ʻʻ\alpha &\qquad \text{(1)}\\ \vdash . (1) . *212.663 .\supset \vdash . \text{Prop} \end{array}$

*212·665. $\vdash : P \in \text{Ser}. \dot{\exists} ! P . \alpha \in \text{D}ʻ(P_{\in } \dot{\cap} I) .\supset . \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha = \alpha$

Dem. $\begin{array}{l} \vdash .*211·4 .\supset \vdash : \text{Hp} .&\supset . {\sim} \text{E}! \text{max}_{P}ʻ\alpha .\\ [*212·601·44] \supset .\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha &= \text{limax}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \\ [*212·402·*40·5] &= Pʻʻ\alpha \\ [*211·12] & = \alpha :\supset \vdash .\text{Prop} \end{array}$

*212·666. $\vdash : P \in \text{Ser}. \dot{\exists} ! P .\supset . \text{D}ʻ\text{lt}(\varsigma ʻP) = \text{D}ʻ(P_{\in } \dot{\cap} I)$

Dem. $\begin{array}{l} \vdash .*212·66·661 .\supset \vdash : \text{Hp} . \kappa \subset \text{D}ʻP_{\in }.\gamma = \text{lt}(\varsigma ʻP)ʻ\kappa .&\supset . \gamma = sʻ\kappa . {\sim} \text{E}!\text{max}_{P}ʻ\gamma .\\ [*211·64·42] &\supset .\gamma \in \text{D}ʻ(P_{\in } \dot{\cap} I) &\qquad \text{(1)}\\ \vdash .(1).*212·665 .\supset \vdash .\text{Prop} \end{array}$

*212·667. $\vdash : P \in \text{Ser}.\supset . \text{D}ʻ\text{lt}(\varsigma ʻP) - \iota ʻ\Lambda = \text{ᗡ}ʻ\text{sgm}ʻP \quad[*212·152·151·666]$

*212·7. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\text{sect}ʻP = S_{\in }ʻʻ\text{sect}ʻQ.Cʻ\varsigma ʻP_{*} = S_{\in }ʻʻCʻ\varsigma ʻQ_{*}$

Dem. $\begin{array}{l} \vdash .*151·11·131. &\supset \vdash :\text{Hp}.\beta \subset CʻQ.\supset .Sʻʻ\beta \subset CʻP &\qquad \text{(1)}\\ \vdash .*37·2.& \supset \vdash :Qʻʻ\beta \subset \beta .\supset .SʻʻQʻʻ\beta \subset Sʻʻ\beta &\qquad \text{(2)}\\ \vdash .(2).*72·503. \supset \vdash :\text{Hp}.\beta \subset CʻQ.Qʻʻ\beta \subset \beta .&\supset .SʻʻQʻʻ\breve{S} ʻʻSʻʻ\beta \subset Sʻʻ\beta .\\ [*151·11] &\supset .PʻʻSʻʻ\beta \subset Sʻʻ\beta &\qquad \text{(3)}\\ \vdash .(1).(3).*211·1.&\supset \vdash :\text{Hp}.\beta \in \text{sect}ʻQ.\supset .Sʻʻ\beta \in \text{sect}ʻP &\qquad \text{(4)}\\ \vdash .(4).*151·131. \supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP.&\supset .\breve{S} ʻʻ\alpha \in \text{sect}ʻQ.\\ [*72·502] &\supset .\alpha \in S_{\in }ʻʻ\text{sect}ʻQ &\qquad \text{(5)}\\ \vdash (4).(5). &\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP = S_{\in }ʻʻ\text{sect}ʻQ &\qquad \text{(6)}\\ \vdash .(6).*212·17·172.\supset \vdash .\text{Prop} \end{array}$

*212·701. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\text{D}ʻP_{\in } = S_{\in }ʻʻ\text{D}ʻQ_{\in }.Cʻ\varsigma ʻP = S_{\in }ʻʻCʻ\varsigma ʻQ\\ &[\text{Proof as in *212·7}]\end{align}$

*212·702. $\begin{align}\vdash :S\in P\overline{\,\text{smor}\,} &Q.\supset .\\ &\text{D}ʻ(P_{\in }\dot{\cap} I) = S_{\in }ʻʻ\text{D}ʻ(Q_{\in }\dot{\cap} I).Cʻ\text{sgm}ʻP = S_{\in }ʻʻCʻ\text{sgm}ʻQ\\ &[\text{Proof as in *212·7}]\end{align}$

*212·71. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .S_{\in }\upharpoonright Cʻ\varsigma ʻQ_{*}\in (\varsigma ʻP_{*})\overline{\,\text{smor}\,} (\varsigma ʻQ_{*})$

Dem. $\begin{array}{l} \vdash .*71·381.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \alpha ,\beta \in \text{sect}ʻQ.\supset :\exists !\beta -\alpha . &\equiv .\exists !Sʻʻ\beta -Sʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*212·7.\supset \vdash \colon\ldotp \text{Hp}.\alpha ,\beta \in \text{sect}ʻQ.\supset :\alpha (\varsigma ʻQ_{*})\beta . &\equiv .Sʻʻ\alpha (\varsigma ʻP_{*})Sʻʻ\beta .\\ [*150·41] & \equiv .\alpha \{\breve{S} _{\in }^{;}(\varsigma ʻP_{*})\}\beta &\qquad \text{(2)}\\ \vdash .(2).*212·172.&\supset \vdash :\text{Hp}.\supset .\varsigma ʻQ_{*}\,\unicode{x2abd}\, \breve{S} _{\in }^{;}(\varsigma ʻP_{*}) &\qquad \text{(3)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\varsigma ʻP_{*}\,\unicode{x2abd}\, S_{\in }^{;}(\varsigma ʻQ_{*}) &\qquad \text{(4)}\\ \vdash .*72·451. &\supset \vdash :\text{Hp}.\supset .S_{\in }\upharpoonright Cʻ\varsigma ʻQ_{*}\in 1\rightarrow 1 &\qquad \text{(5)}\\ \vdash .(3).(4).(5).*151·27.\supset \vdash .\text{Prop} \end{array}$

*212·711. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .S_{\in }\upharpoonright Cʻ\varsigma ʻQ\in (\varsigma ʻP)\overline{\,\text{smor}\,} (\varsigma ʻQ)\\ &[\text{Proof as in *212·71}]\end{align}$

*212·712. $\begin{align}&\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .S_{\in }\upharpoonright Cʻ\text{sgm}ʻP\in (\text{sgm}ʻP)\overline{\,\text{smor}\,} (\text{sgm}ʻQ)\\ &[\text{Proof as in *212·7}]\end{align}$

*212·72. $\begin{align}&\vdash :P \,\,\text{smor}\, \,Q.\supset .\varsigma ʻP_{*}\,\text{smor}\, \varsigma ʻQ_{*}.\varsigma ʻP \,\,\text{smor}\, \varsigma ʻQ.\text{sgm}ʻP \,\,\text{smor}\, \text{sgm}ʻ Q\\ &[*212·71·711·712]\end{align}$

If $\alpha$ is a section of $P$ , $P\unicode{x0294f}\alpha$ is called a sectional relation of $P$ ; and if $\alpha$ is a segment of $P$ , $P\unicode{x0294f}\alpha$ is called a segmental relation of $P$ . If $P_{\text{po}}$ is serial, sectional relations may be arranged in a series by the relation of inclusion (*213·153). That is, if we call the series of sectional relations $P_{\varsigma}$ , we shall so define $P_{\varsigma }$ as to secure that if $P_{\text{po}}$ is serial, $QP_{\varsigma }R.\equiv .Q,R\in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda ).Q\,\unicode{x2abd}\, R.Q\neq R \quad(*213·21).$ The natural definition to take would be $P_{\varsigma }=P\unicode{x0294f}^{;}\varsigma ʻP_{*}.$ But this has the disadvantage that if $xBP$ , $P\unicode{x0294f}\iota ʻx=P\unicode{x0294f}\Lambda .\Lambda ,\iota ʻx\in \text{sect}ʻP.$ Thus $P\unicode{x0294f}\alpha =P\unicode{x0294f}\beta$ does not imply $\alpha =\beta$ ; and when $P$ is serial, $P\unicode{x0294f}^{;}\varsigma ʻP_{*}$ is not serial, because $\dot{\Lambda} (P\unicode{x0294f}^{;}\varsigma ʻP_{*})\dot{\Lambda}$ . In order to obviate this inconvenience, we confine ourselves to sections which are not null, putting $P_{\varsigma }=P\unicode{x0294f}^{;}(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) \quad\text{Df}.$ With the above definition, we have (*213·151 ·152), if $P_{\text{po}}\in \text{Ser}$ , $(P\unicode{x0294f})\upharpoonright Cʻ{(\varsigma ʻP_{*})\unicode{x0294f}-\iota ʻ\Lambda }\in 1\rightarrow 1$ and $P_{\varsigma }\,\text{smor}\,(\varsigmaʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )$ .

The relation $P_{\varsigma }$ is very useful in dealing with well-ordered series; in this case, we have (as will be shown later) $P_{\varsigma }=P\unicode{x0294f}^{;}\overrightarrow{P}^{;}P\unicode{x0294f}\text{ᗡ}ʻP\unicode{x21f8}P.$ It will be seen that, if $P_{\text{po}}\in \text{Ser}$ , whenever $P$ exists, $P=Bʻ\breve{P} _{\varsigma }$ (*213·158); and whenever $\overrightarrow{B}ʻP$ exists, $\dot{\Lambda} =BʻP_{\varsigma }$ (*213·155).

We have, if $P_{\text{po}}\in \text{Ser}$ , $QP_{\varsigma }R.\equiv .R\in CʻP_{\varsigma }.Q\in \text{D}ʻR_{\varsigma } \quad(*213·245).$ Hence $R\in CʻP_{\varsigma }.\supset .\overrightarrow{P}_{\varsigma}ʻR=\text{D}ʻR_{\varsigma }.R_{\varsigma }=P_{\varsigma}\unicode{x0294f}CʻR_{\varsigma }$ (*213·246 ·242).

If $P$ is serial, the sectional relations of $P$ are all relations such that by adding something to them they become $P$ , i.e. they are $\hat{Q} \{(\exists R).P=Q\unicode{x2909} R.\lor.(\exists x).P=Q\unicode{x21f8}x\} \quad(*213·4).$ [Pg 669] Hence their relation-numbers are those that can be made equal to that of $P$ by being added to. This fact is important in connection with the theory of greater and less among relation-numbers.

The propositions of this number are rendered complicated by the necessity of taking account of the possibility of a section being a unit class. This necessitates a good many propositions which are merely lemmas; but in the end the complications mostly disappear.

*213·141. $\vdash .\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP)$

*213·142. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .CʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )$

*213·16. $\vdash .\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )-\iota ʻP$

*213·161. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\exists !\overrightarrow{B}ʻP.\supset . P\unicode{x0294f}ʻʻ\text{sect}ʻP= P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )=CʻP_{\varsigma }$

*213·162. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{sect}ʻP-\iota ʻ\dot{\Lambda}$

*213·17. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{Nr}ʻ\varsigma ʻP_{*}=\dot{1} \dot{+} &\text{Nr}ʻP_{\varsigma }.\\ &\text{Nr}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})=\text{Nr}ʻP_{\varsigma }\end{align}$

If $P$ is finite, it follows from the above that $\varsigma ʻP_{*}$ is not similar to $P_{\varsigma }$ ; but if $P$ is infinite and has a beginning and is well-ordered, we find $\text{Nr}ʻ\varsigma ʻP_{*}=\text{Nr}ʻP_{\varsigma }.$

*213·172. $\vdash :P_{\text{po}},Q_{\text{po}}\in \text{Ser}.P \,\,\text{smor}\, \,Q.\supset .P_{\varsigma } \,\text{smor}\, Q_{\varsigma }$

We then have a set of propositions (*213·2—·251) chiefly concerned with the sections of $R$ , where $R\in CʻP_{\varsigma }$ . Besides those already mentioned, the following are important:

*213·24. $\vdash :\beta \in \text{sect}ʻP.R=P\unicode{x0294f}\beta .\supset .\text{sect}ʻR=\text{sect}ʻP\subset \text{Cl}ʻCʻR$

*213·243. $\vdash .\overrightarrow{P}_{\varsigma }ʻP=\text{D}ʻP_{\varsigma }$

*213·25. $\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.Q,R\in CʻP_{\varsigma }.\supset :Q\in \text{D}ʻR_{\varsigma }.\lor.R\in \text{D}Q_{\varsigma }.\lor.Q=R$

Our next set (*213·3—·32) is concerned with $\dot{\Lambda}$ and $x\downarrow y$ . We have

*213·32. $\vdash :P\in 2_{r}.\supset .P_{\varsigma }=\dot{\Lambda} \downarrow P.P_{\varsigma }\in 2_{r}$

We then have three propositions (*213·4 ·41 ·42) showing that a sectional relation of $P$ is one which becomes $P$ by being added to. We proceed to a set of propositions (*213·5—·58) on $(P\unicode{x21f8}x)_{\varsigma }$ , and $(P\unicode{x2909}Q)_{\varsigma }$ , leading to

*213·57. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\text{Nr}ʻQ=\text{Nr}ʻP\dot{+} \dot{1} .\supset .\text{Nr}ʻQ_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \dot{1}$

*213·58. $\begin{align}\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.Q_{\text{po}}\in \text{Ser}.CʻP\cap &CʻQ=\Lambda .\supset .\\ &\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma }\end{align}$

*213·01. $P_{\varsigma }=P\unicode{x0294f}^{;}(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) \quad\text{Df}$

*213·1. $\begin{align}\vdash :QP_{\varsigma }&R.\equiv .\\ &(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\exists !\beta -\alpha .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta \\ &[*212·12·121.(*213·01)]\end{align}$

*213·11. $\begin{align}\vdash \colon\ldotp &P_{\text{po}}\in \text{connex} .\supset :QP_{\varsigma }R.\equiv .\\ &(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\alpha \subset \beta .\alpha \neq \beta .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta \\ &[*213·1.*211·6·17.*210·1]\end{align}$

*213·12. $\vdash .\text{D}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP$

Dem. $\begin{array}{l} \vdash .*212·12. \supset \vdash :\alpha \in \text{D}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ).&\equiv .(\exists \beta ).\beta \in \text{sect}ʻP.\exists !\beta -\alpha .\alpha \neq \Lambda .\\ [*212·12] &\equiv .\alpha \neq \Lambda .\in \text{D}ʻ\varsigma ʻP_{*}.\\ [*212·171] &\equiv .\alpha \in \text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP:\supset \vdash .\text{Prop} \end{array}$

*213·121. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .\overrightarrow{B}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP\cap 1=\iota ʻʻ\overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*212·12.*213·12.&\supset \vdash \colon\ldotp \beta \in \overrightarrow{B}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ).\equiv :\\ &\beta \in \text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP:\alpha \in \text{sect}ʻP.\exists !\beta -\alpha .\supset _{\alpha }.\alpha =\Lambda &\qquad \text{(1)}\\ \vdash .*211·3·13·1.*37·18.\supset \\ \vdash :\beta \in \text{sect}ʻP.x\in \beta .&\supset .\overrightarrow{P}_{*}ʻx\in \text{sect}ʻP.\overrightarrow{P}_{*}ʻx\subset \beta .\exists !\overrightarrow{P}_{*}ʻx &\qquad \text{(2)}\\ \vdash .(1).\text{Transp}.(2). &\supset \vdash \colon\ldotp \beta \in \overrightarrow{B}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ).\supset :\\ &\beta \in \text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP:x\in \beta .\supset _{x}.\overrightarrow{P}_{*}ʻx=\beta &\qquad \text{(3)}\\ \vdash .*200·391.\supset \vdash \colon\ldotp \text{Hp}.&\beta \in \text{sect}ʻP-\iota ʻ\Lambda :x\in \beta .\supset _{x}.\overrightarrow{P}_{*}ʻx=\beta .\supset :\\ &\beta \in \text{sect}ʻP-\iota ʻ\Lambda :x,y\in \beta .\supset _{x,y}.x=y:\\ [*52·16] &\supset :\beta \in \text{sect}ʻP\cap 1 &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\text{Hp}.\supset .\overrightarrow{B} ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )\subset \text{sect}ʻP\cap 1 &\qquad \text{(5)}\\ \vdash .*213·12.*200·12. &\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP\cap 1\subset \text{D}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) &\qquad \text{(6)}\\ \vdash .*51·401. &\supset \vdash \colon\ldotp \beta \in \text{sect}ʻP\cap 1.\supset :\alpha \subset \beta .\alpha \neq \beta .\supset .\alpha =\Lambda &\qquad \text{(7)}\\ \vdash .(7).*212·22·121. &\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP\cap 1\subset -\text{ᗡ}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) &\qquad \text{(8)}\\ \vdash .(5).(6).(8).*211·18.\supset \vdash .\text{Prop} \end{array}$

*213·122. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\text{D}.Bʻ(\varsigma ʻP)\unicode{x0294f}(-\iota ʻ\Lambda )=\iota ʻBʻP\\ &[*213·121.*211·181]\end{align}$

*213·123. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\overrightarrow{B}ʻ(\varsigma ʻP)\unicode{x0294f}(-\iota ʻ\Lambda )=\Lambda \\ &[*213·121]\end{align}$

*213·124. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\supset :\text{E}!Bʻ(\varsigma ʻP)\unicode{x0294f}(-\iota ʻ\Lambda ).\equiv .\text{E}!BʻP\\ &[*213·122·123]\end{align}$

*213·125. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .Cʻ\varsigma ʻP_{*}-\iota ʻ\Lambda {\sim}\in 1$

Dem. $\begin{array}{l} \vdash .*212·17. \supset \vdash :P=\dot{\Lambda} .&\supset .Cʻ\varsigma ʻP_{*}=\Lambda .\\ [*52·21] &\supset .Cʻ\varsigma ʻP_{*}-\iota ʻ\Lambda {\sim} \in 1 &\qquad \text{(1)}\\ \vdash .*212·172.&\supset \vdash :\dot{\exists} !P.\supset .Cʻ\varsigma ʻP_{*}=\text{sect}ʻP.CʻP\in Cʻ\varsigma ʻP_{*}-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .*211·13·3.*200·39.&\supset \vdash :\text{Hp}.x\in \text{D}ʻP.\supset .\overrightarrow{P}_{*}ʻx\in \text{sect}ʻP.\exists !CʻP-\overrightarrow{P}_{*}ʻx &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .Cʻ\varsigma ʻP_{*}-\iota ʻ\Lambda {\sim}\in 1 &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

The hypothesis $P_{\text{po}}\,\unicode{x2abd}\, J$ , in the above proposition, restricts $P$ more than is necessary for the truth of the conclusion. What we really require is $P = \dot{\Lambda}.\lor.(\exists x).x\in CʻP .\overrightarrow{P}_{*}ʻx\neq CʻP$ , i.e. $\overrightarrow{P}_{*}ʻʻCʻP\neq \iota ʻCʻP$ . This holds if either (1) the field of $P$ does not consist of a single family, or (2) there is a member of $CʻP$ which does not have the relation $P_{\text{po}}$ to itself. Thus the only case excluded is that of a single cyclic family. The hypothesis $\overrightarrow{P}_{*}ʻʻCʻP\neq\iota ʻCʻP$ may be substituted for $P_{\text{po}}\,\unicode{x2abd}\,J$ in most of the subsequent propositions of this number in which $P_{\text{po}}\,\unicode{x2abd}\, J$ occurs in the hypothesis. We have, however, preferred the hypothesis $P_{\text{po}}\,\unicode{x2abd}\,J$ , as it gives a more immediate application to the case of $P\in\text{Ser}$ , which is the case in which the propositions of the present number are important.

*213·126. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\dot{\exists} !P.\supset .\exists !\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP$

Dem. $\begin{array}{l} \vdash .*213·125.*212·172.&\supset \vdash :\text{Hp}.\supset .\text{sect}ʻP-\iota ʻ\Lambda {\sim}\in 1 &\qquad \text{(1)}\\ \vdash .*211·26.*33*·24. &\supset \vdash :\text{Hp}.\supset .CʻP\in \text{sect}ʻP-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*52·181.\supset \vdash .\text{Prop} \end{array}$

*213·13. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .Cʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda$

Dem. $\begin{array}{l} \vdash *213·125.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp \alpha \in \text{sect}ʻP-\iota ʻ\Lambda .\supset :(\exists \beta ):\beta \in \text{sect}ʻP-\iota ʻ\Lambda :\exists !\alpha -\beta .\lor.\exists !\beta -\alpha :\\ [*212·12] &\supset :(\exists \beta ):\alpha \{(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )\}\beta .\lor.\beta \{(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )\}\alpha :\\ [*33·132] &\supset :\alpha \in Cʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ) &\qquad \text{(1)}\\ \vdash .(1).*212·172. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .Cʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .*212·17.*211·1.&\supset \vdash :P=\dot{\Lambda} .\supset .Cʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*213·131. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{ᗡ}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻʻ\overrightarrow{B}ʻP\\ &[*213·13·121]\end{align}$

*213·132. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset .\text{ᗡ}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻP\\ &[*213·13·122]\end{align}$

*213·133. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\text{ᗡ}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=\text{sect}ʻP-\iota ʻ\Lambda\\ &[*213·13·123]\end{align}$

*213·134. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\dot{\exists} !P.\supset .Bʻ\text{Cnv}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=CʻP \quad[*213·12·13]$

*213·14. $\begin{align}\vdash .&\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{D}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ).\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{ᗡ}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda ).\\ &CʻP_{\varsigma }=P\unicode{x0294f}ʻʻCʻ(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )\\ &[*150·21·211·22]\end{align}$

*213·141. $\begin{align}&\vdash .\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP)\\ &[*213·12·14]\end{align}$

*213·142. $\begin{align}&\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\supset .CʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )\\ &[*213·13·14]\end{align}$

*213·143. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda -\iotaʻʻ\overrightarrow{B}ʻP)\\ &[*213·131·14]\end{align}$

*213·144. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset .\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻP)\\ &[*213·132·14]\end{align}$

*213·145. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )\\ &[*213·143]\end{align}$

*213·146. $\vdash :P\,\unicode{x2abd}\, J.\supset .P\unicode{x0294f}ʻʻ\text{sect}ʻP=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-1)$

Dem. $\begin{array}{l} \vdash .*37·22. &\supset \vdash .P\unicode{x0294f}ʻʻ\text{sect}ʻP=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-1)\cup P\unicode{x0294f}ʻʻ(\text{sect}ʻP\cap 1) &\qquad \text{(1)}\\ \vdash .*200·35.\supset \vdash :Q\in P\unicode{x0294f}ʻʻ(\text{sect}ʻP\cap 1).&\supset .Q=\dot{\Lambda} .\\ [*36·27] &\supset .Q=P\unicode{x0294f}\Lambda .\\ [*211·44] &\supset .Q\in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-1) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*213·15. $\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .\supset :P\unicode{x0294f}\alpha =\dot{\Lambda} .\equiv .\alpha \in 1$

Dem. $\begin{array}{l} \vdash .*200·35.&\supset \vdash :\text{Hp}.\alpha \in 1.\supset .P\unicode{x0294f}\alpha =\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*52·41. \supset \vdash \colon\ldotp \text{Hp}.\alpha {\sim}\in 1.&\supset :(\exists x,y).x,y\in \alpha .x\neq y:\\ [*211·1.*202·103] &\supset :(\exists x,y):x(P_{\text{po}}\unicode{x0294f}\alpha )y.\lor.y(P_{\text{po}}\unicode{x0294f}\alpha )x:\\ [*11·7] &\supset :\dot{\exists} !P_{\text{po}}\unicode{x0294f}\alpha :\\ [*37·41] &\supset :\exists !\alpha \cap P_{\text{po}}ʻʻ\alpha :\\ [*211·131] &\supset :\exists !\alpha \cap Pʻʻ\alpha :\\ [*37·41] &\supset :\dot{\exists} !P\unicode{x0294f}\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*213·151. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .(P\unicode{x0294f})\upharpoonright (\text{sect}ʻP-{℩}ʻ\Lambda )\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*213·15.\supset \\ \vdash :\text{Hp}.\alpha \in \text{sect}ʻP-{℩}ʻ\Lambda -1.\beta \in \text{sect}ʻP-{℩}ʻ&\Lambda .P\unicode{x0294f}\alpha =P\unicode{x0294f}\beta .\supset .\beta {\sim}\in 1.\\ [*211·133] & \supset .CʻP\unicode{x0294f}\beta =\beta .CʻP\unicode{x0294f}\alpha =\alpha .\\ [\text{Hp}] &\supset .\alpha =\beta &\qquad \text{(1)}\\ \vdash .*213·15.\supset \\ \vdash :\text{Hp}.&\alpha \in \text{sect}ʻP\cap 1.\beta \in \text{sect}ʻP-{℩}ʻ\Lambda .P\unicode{x0294f}\alpha =P\unicode{x0294f}\beta .\supset .\beta \in 1 &\qquad \text{(2)}\\ \vdash .(2).*211·18.\supset \vdash :\text{Hp}(2).&\supset .\alpha ,\beta \in {℩}ʻʻ\overrightarrow{B}ʻP.\\ [*202·523·13] & \supset .\alpha =\beta &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\beta \in \text{sect}ʻP-{℩}ʻ\Lambda .P\unicode{x0294f}\alpha =P\unicode{x0294f}\beta .\supset .\alpha =\beta \colon\ldotp \\ &\supset \vdash .\text{Prop} \end{array}$

*213·152. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .P_{\varsigma }\,\text{smor}\,(\varsigma ʻP_{*})\unicode{x0294f}(-{℩}ʻ\Lambda ) \quad[*213·151·13]$

*213·153. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .P_{\varsigma }\in \text{Ser} \quad[*213·152.*212·3.*204·4·21]$

*213·154. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .\overrightarrow{B}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ{℩}ʻʻ\overrightarrow{B}ʻP \quad[*213·151·121.*151·5]$

*213·155. $\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset .BʻP_{\varsigma }=\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*213·151·122.*151·5.\supset \\ \vdash :\text{Hp}.\supset .BʻP_{\varsigma }&=P\unicode{x0294f}({℩}ʻBʻP)\\ [*200·35] &=\dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

*213·156. $\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\overrightarrow{B}ʻP_{\varsigma }=\Lambda \quad[*213·154]$

*213·157. $\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\supset :\text{E}!BʻP.\equiv .\text{E}!BʻP_{\varsigma } \quad[*213·155·156]$

*213·158. $\vdash :P_{\text{po}}\in \text{Ser}.\dot{\exists} !P.\supset .Bʻ\breve{P} _{\varsigma }=P$

Dem. $\vdash .*213·151·134.*151·5.\supset \vdash :\text{Hp}.\supset .Bʻ\breve{P} _{\varsigma }=P\unicode{x0294f}CʻP:\supset \vdash .\text{Prop}$

*213·16. $\vdash .\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-{℩}ʻ\Lambda )-{℩}ʻP$

Dem. $\begin{array}{l} \vdash .*213·141.\supset \\ \vdash :Q\in \text{D}ʻP_{\varsigma }.&\equiv .(\exists \alpha ).\alpha \in \text{sect}ʻP-{℩}ʻ\Lambda .Q=P\unicode{x0294f}\alpha .\alpha \neq CʻP &\qquad \text{(1)}\\ \vdash .*211·1.\supset \vdash \colon\ldotp \alpha \in \text{sect}ʻP.Q=P\unicode{x0294f}\alpha .\supset :\alpha \neq CʻP.&\equiv .\exists !CʻP-\alpha .\\ [*36·25.\text{Transp}] &\equiv .Q\neq P &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :Q\in \text{D}ʻP_{\varsigma }.&\equiv .(\exists \alpha ).\alpha \in \text{sect}ʻP-{℩}ʻ\Lambda .Q=P\unicode{x0294f}\alpha .Q\neq P:\\ &\supset \vdash .\text{Prop} \end{array}$

*213·161. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\exists !\overrightarrow{B}ʻP.\supset .P\unicode{x0294f}ʻʻ\text{sect}ʻP=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )=CʻP_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*211·18.\supset \vdash :\text{Hp}.&\supset .\iotaʻʻ\overrightarrow{B}ʻP\subset \text{sect}ʻP\cap 1.\exists !\iotaʻʻ\overrightarrow{B}ʻP.\\ [*37·2·45] &\supset .P\unicode{x0294f}ʻʻ\iotaʻʻ\overrightarrow{B}ʻP\subset P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda ).\exists !P\unicode{x0294f}ʻʻ\iotaʻʻ\overrightarrow{B}ʻP.\\ [*200·35] &\supset .\dot{\Lambda} \in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda ).\\ [*36·27] &\supset .P\unicode{x0294f}\Lambda \in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda ).\\ [*37·22] \supset .P\unicode{x0294f}ʻʻ\text{sect}ʻP&=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )\\ [*213·142] &=CʻP_{\varsigma }:\supset \vdash .\text{Prop} \end{array}$

*213·162. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{ᗡ}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{sect}ʻP-\iota ʻ\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*213·143.\supset \vdash \colon\ldotp \text{Hp}.&\supset :Q\in \text{ᗡ}ʻP_{\varsigma }.\equiv .\\ &(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda -\iotaʻʻ\overrightarrow{B}ʻP.Q=P\unicode{x0294f}\alpha . &\qquad \text{(1)}\\ [*213·15.*211·18]&\supset .Q\in P\unicode{x0294f}ʻʻ\text{sect}ʻP-\iota ʻ\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .*213·15. \supset \vdash \colon\ldotp &\text{Hp}.\supset :Q\in P\unicode{x0294f}ʻʻ\text{sect}ʻP-\iota ʻ\dot{\Lambda} .\supset .\\ &(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda -\iotaʻʻ\overrightarrow{B}ʻP.Q=P\unicode{x0294f}\alpha .\\ [(1)] & \supset .Q\in \text{ᗡ}ʻP_{\varsigma } &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*213·163. $\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .CʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{sect}ʻP_\iota ʻ\dot{\Lambda}$

Dem. $\begin{array}{l} \vdash .*213·156.\supset \vdash :\text{Hp}.\supset .CʻP_{\varsigma }=\text{ᗡ}ʻP_{\varsigma } &\qquad \text{(1)}\\ \vdash .(1).*213·162.\supset \vdash .\text{Prop} \end{array}$

*213·164. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\text{D}ʻP_{\varsigma }=P\unicode{x0294f}ʻʻ\text{sect}ʻP-\iota ʻ\dot{\Lambda} -\iota ʻP\\ &[*213·142·163·16]\end{align}$

*213·17. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.\supset .\text{Nr}ʻ\varsigma ʻP_{*}=\dot{1} \dot{+} &\text{Nr}ʻP_{\varsigma }.\\ &\text{Nr}ʻ(\varsigma P_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})=\text{Nr}ʻP_{\varsigma }\end{align}$

Dem. $\begin{array}{l} \vdash .*212·171·172. \supset \vdash :\dot{\exists} !P.&\supset .Bʻ\varsigma ʻP_{*}=\Lambda .\text{ᗡ}ʻ\varsigma ʻP_{*}=\text{sect}ʻP-\iota ʻ\Lambda .\\ &(\varsigma ʻP_{*})\unicode{x0294f}(-\iota ʻ\Lambda )=(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*}) &\qquad \text{(1)}\\ \vdash .(1).*213·125. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\text{ᗡ}ʻ\varsigma ʻP_{*}{\sim}\in 1 &\qquad \text{(2)}\\ \vdash .*212·3.*91·602.&\supset \vdash :\text{Hp}.\supset .\varsigma ʻP_{*}\in \text{connex} &\qquad \text{(3)}\\ \vdash .(1).*213·152. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\text{Nr}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})=\text{Nr}ʻP_{\varsigma } &\qquad \text{(4)}\\ \vdash .(1).(2).(3).*204·46.\supset \\ \vdash :\text{Hp}.\dot{\exists} !P.\supset .\text{Nr}ʻ\varsigma ʻP_{*}&=\dot{1} \dot{+} \text{Nr}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})\\ [(4)] &=\dot{1} \dot{+} \text{Nr}ʻP_{\varsigma } &\qquad \text{(5)}\\ \vdash .*212·17.*150·42.&\supset \vdash :P=\dot{\Lambda} .\supset .\varsigma ʻP_{*}=\dot{\Lambda} .P_{\varsigma }=\dot{\Lambda} .\\ [*161·201]&\supset .\text{Nr}ʻ\varsigma ʻP_{*}=\dot{1} \dot{+} \text{Nr}ʻP_{\varsigma }.\text{Nr}ʻ(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})=\text{Nr}ʻP_{\varsigma } &\qquad \text{(6)}\\ \vdash .(4).(5).(6).\supset \vdash .\text{Prop} \end{array}$

*213·171. $\vdash \colon\ldotp P_{\text{po}},Q_{\text{po}}\in \text{Ser}.\supset :P_{\varsigma }\,\text{smor}\, Q_{\varsigma }. \equiv .\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}$

Dem. $\begin{array}{l} \vdash .*212·172.&\supset \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.\dot{\exists} !Q.\supset :\text{E}!Bʻ\varsigma ʻP_{*}.\text{E}!Bʻ\varsigma ʻQ_{*}:\\ [*204·47.*91·602.*212·3] \supset :\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}. &\equiv .(\varsigma ʻP_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻP_{*})\,\text{smor}\,(\varsigma ʻQ_{*})\unicode{x0294f}(\text{ᗡ}ʻ\varsigma ʻQ_{*}).\\ [*213·17] &\equiv .P_{\varsigma } \,\text{smor}\, Q_{\varsigma } &\qquad \text{(1)}\\ \vdash .*213·158. \supset \vdash :\text{Hp}.\dot{\exists} !P.P_{\varsigma } \,\text{smor}\, Q_{\varsigma }.&\supset .\dot{\exists} !Q_{\varsigma }.\\ [*212·17.*150·42] &\supset .\dot{\exists} !Q &\qquad \text{(2)}\\ \vdash .*212·17. &\supset \vdash :\text{Hp}.\dot{\exists} !P.\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}.\supset .\dot{\exists} !Q &\qquad \text{(3)}\\ \vdash .(1).(2).(3).&\supset \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.\supset :\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}. \equiv .P_{\varsigma} \,\text{smor}\, Q_{\varsigma } &\qquad \text{(4)}\\ \vdash .*212·17. \supset \vdash :\text{Hp}.P = \dot{\Lambda} .\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}.&\supset .\varsigma ʻP_{*} = \dot{\Lambda} .\varsigma ʻQ_{*} = \dot{\Lambda} .\\ [*150·42] &\supset .P_{\varsigma } = \dot{\Lambda} .Q_{\varsigma } = \dot{\Lambda} &\qquad \text{(5)}\\ \vdash .*213·17. &\supset \vdash :\text{Hp}.P_{\varsigma } \,\text{smor}\, Q_{\varsigma }.\supset .\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*} &\qquad \text{(6)}\\ \vdash .(5).(6). &\supset \vdash \colon\ldotp \text{Hp}.P = \dot{\Lambda} .\supset :\varsigma ʻP_{*} \,\text{smor}\, \varsigma ʻQ_{*}. \equiv .P_{\varsigma } \,\text{smor}\, Q_{\varsigma } &\qquad \text{(7)}\\ \vdash .(4).(7). &\supset \vdash .\text{Prop} \end{array}$

*213·172. $\vdash :P_{\text{po}},Q_{\text{po}}\in \text{Ser}.P \,\,\text{smor}\, \,Q.\supset .P_{\varsigma } \,\text{smor}\, Q_{\varsigma } \quad[*212·72.*213·171]$

*213·18. $\vdash :P\in \text{connex} .R\in \text{D}ʻP_{\varsigma }.\supset .\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻCʻR$

Dem. $\begin{array}{l} \vdash .*213·1.\supset \vdash :R\in \text{D}ʻP_{\varsigma }.&\supset .(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻCʻP.R = P\unicode{x0294f}\alpha .\\ [*37·41] &\supset .(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻCʻP.CʻR\subset \alpha .\\ [*40·16] &\supset .(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻCʻP.pʻ\overleftarrow{P}ʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻCʻR &\qquad \text{(1)}\\ \vdash .*211·703.&\supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP-\iota ʻCʻP.\supset .\exists !pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .*211·1. &\supset \vdash :\alpha \in \text{sect}ʻP-\iota ʻCʻP.\supset .\exists !CʻP-\alpha .\\ [*33·24] &\supset .\dot{\exists} !P &\qquad \text{(3)}\\ \vdash .(2).(3).*40·69.&\supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP-\iota ʻCʻP.\supset .\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \\ \vdash :\text{Hp}.R\in \text{D}ʻP_{\varsigma }.&\supset .(\exists \alpha ).\exists !CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha .pʻ\overleftarrow{P}ʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻCʻR:\supset \vdash .\text{Prop} \end{array}$

*213·2. $\begin{align}\vdash \colon\ldotp &P_{\text{po}}\in \text{Ser}.\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .Q = P\unicode{x0294f}\alpha .R = P\unicode{x0294f}\beta .\supset :\\ &\exists !\beta -\alpha . \equiv .\dot{\exists} !R\dot{-} Q. \equiv .Q\,\unicode{x2abd}\, R.Q \neq R. \equiv .\alpha \subset \beta .\alpha \neq \beta\end{align}$

Dem. $\begin{array}{l} \vdash .*36·24. &\supset \vdash :\alpha \subset \beta .\supset .P\unicode{x0294f}\alpha \,\unicode{x2abd}\, P\unicode{x0294f}\beta &\qquad \text{(1)}\\ \vdash .*211·133. &\supset \vdash :\text{Hp}.\alpha ,\beta {\sim}\in 1.P\unicode{x0294f}\alpha \,\unicode{x2abd}\, P\unicode{x0294f}\beta .\supset .\alpha \subset \beta&\qquad \text{(2)}\\ \vdash .*211·181·182.\supset \vdash :\text{Hp}.\alpha \in 1.&\supset .\alpha = \iota ʻBʻP.\\ [*202·521] &\supset .\alpha \subset \beta &\qquad \text{(3)}\\ \vdash .*213·15. &\supset \vdash :\text{Hp}.\beta \in 1.\alpha {\sim}\in 1.\supset .{\sim}(P\unicode{x0294f}\alpha \,\unicode{x2abd}\, P\unicode{x0294f}\beta ) &\qquad \text{(4)}\\ \vdash .(2).(3).(4). &\supset \vdash :\text{Hp}.P\unicode{x0294f}\alpha \,\unicode{x2abd}\, P\unicode{x0294f}\beta .\supset .\alpha \subset \beta &\qquad \text{(5)}\\) \vdash .(1).(5).\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \subset \beta .\equiv .Q\,\unicode{x2abd}\, R: &\qquad \text{(6)}\\ [\text{Transp}] &\supset :\exists !\alpha -\beta .\equiv .\dot{\exists} !Q\dot{-} R &\qquad \text{(7)}\\ \vdash .(6).*213·151.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \subset \beta .\alpha \neq \beta .\equiv .Q\,\unicode{x2abd}\, R.Q\neq R &\qquad \text{(8)}\\ \vdash .(7).(8).*210·1.*211·562.\supset \vdash .\text{Prop} \end{array}$

*213·21. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\supset :QP_{\varsigma }R.&\equiv .Q,R\in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-{℩}ʻ\Lambda ).\dot{\exists} !R\dot{-} Q.\\ &\equiv .Q,R\in P\unicode{x0294f}ʻʻ(\text{sect}ʻP-{℩}ʻ\Lambda ).Q\,\unicode{x2abd}\, R.Q\neq R\end{align}$

Dem. $\begin{array}{l} \vdash .*213·1·2.\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ QP_{\varsigma }R.&\equiv .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-{℩}ʻ\Lambda .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta .\dot{\exists} !R\dot{-} Q.\\ &\equiv .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-{℩}ʻ\Lambda .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta .Q\,\unicode{x2abd}\, R.Q\neq R &\qquad \text{(1)}\\ \vdash .(1).*37·6.\supset \vdash .\text{Prop} \end{array}$

*213·22. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset :\\ &QP_{\varsigma }R.\equiv .Q,R\in P\unicode{x0294f}ʻʻ\text{sect}ʻP.\dot{\exists} !R\dot{-} Q.\equiv .Q,R\in P\unicode{x0294f}ʻʻ\text{sect}ʻP.Q\,\unicode{x2abd}\, R.Q\neq R\\ &[*213·21·161]\end{align}$

*213·23. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{connex} .Q,R\in CʻP_{\varsigma }.\supset :Q\,\unicode{x2abd}\, R.\lor.R\,\unicode{x2abd}\, Q\\ &[*213·1.*211·6·17.*36·24]\end{align}$

*213·24. $\vdash :\beta \in \text{sect}ʻP.R=P\unicode{x0294f}\beta .\supset .\text{sect}ʻR=\text{sect}ʻP\cap \text{Cl}ʻCʻR$

Dem. $\begin{array}{l} \vdash .*36·29.\supset \vdash \colon\ldotp \text{Hp}.&\supset :R\,\unicode{x2abd}\, P:&\qquad \text{(1)}\\ [*211·1] &\supset :\alpha \in \text{sect}ʻP\cap \text{Cl}ʻCʻR.\supset .\alpha \subset CʻR.Rʻʻ\alpha \subset \alpha .\\ &\supset .\alpha \in \text{sect}ʻR &\qquad \text{(2)}\\ \vdash .(1).*211·1.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{sect}ʻR.\supset .\alpha \subset CʻP.\alpha \subset CʻP.(P\unicode{x0294f}\beta )ʻʻ\alpha \subset \alpha &\qquad \text{(3)}\\ \vdash .(3).*37·41·413.\supset \\ \vdash :\text{Hp}.\alpha \in \text{sect}ʻR.&\supset .\alpha \subset \beta .\beta \cap Pʻʻ(\alpha \cap \beta )\subset \alpha .\\ [*22·621.*37·2] &\supset .\beta \cap Pʻʻ\alpha \subset \alpha .Pʻʻ\alpha \subset Pʻʻ\beta .\\ [*211·1] &\supset .\beta \cap Pʻʻ\alpha \subset \alpha .Pʻʻ\alpha \subset \beta .\\ [*22·621] &\supset .Pʻʻ\alpha \subset \alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{sect}ʻR.\supset .\alpha \subset CʻR.\alpha \in \text{sect}ʻP &\qquad \text{(5)}\\ \vdash .(2).(5).\supset \vdash .\text{Prop} \end{array}$

*213·241. $\vdash :R\in P\unicode{x0294f}ʻʻ\text{sect}ʻP.\supset .R_{\varsigma }\,\unicode{x2abd}\, P_{\varsigma }\unicode{x0294f}CʻR_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·1.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :QR_{\varsigma }Qʻ.&\equiv .(\exists \alpha ,\alpha').\alpha ,\alpha'\in \text{sect}ʻR-\iota ʻ\Lambda .\\ &Q=R\unicode{x0294f}\alpha .Qʻ=R\unicode{x0294f}\alpha'.\exists !\alpha '-\alpha .\\ [*213·24] &\equiv .(\exists \alpha ,\alpha').\alpha ,\alpha'\in \text{sect}ʻP\cap \text{Cl}ʻCʻR-\iota ʻ\Lambda .\\ &Q=R\unicode{x0294f}\alpha .Qʻ=R\unicode{x0294f}\alpha'.\exists !\alpha '-\alpha .\\ [*213·1] &\supset .QP_{\varsigma }Qʻ &\qquad \text{(1)}\\ \vdash .(1).*33·17.\supset \vdash :\text{Hp}.\supset .R_{\varsigma }\,\unicode{x2abd}\, P_{\varsigma }\unicode{x0294f}CʻR_{\varsigma }:\supset \vdash .\text{Prop} \end{array}$

*213·242. $\vdash :P_{\text{po}}\in \text{Ser}.R\in P\unicode{x0294f}ʻʻ\text{sect}ʻP.\supset .R_{\varsigma }=P_{\varsigma }\unicode{x0294f}CʻR_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·1.*211·1.&\supset \vdash \colon\ldotp Q(P_{\varsigma }\unicode{x0294f}CʻR_{\varsigma })Qʻ.\supset :\\ &(\exists \alpha , \alpha').\alpha ,\alpha'\in \text{sect}ʻP-\iota ʻ\Lambda .Q=P\unicode{x0294f}\alpha .Qʻ=P\unicode{x0294f}\alpha'.\exists !\alpha '-\alpha :\\ &(\exists \gamma ,\gamma').\gamma ,\gamma'\in \text{sect}ʻR-\iota ʻ\Lambda .Q=R\unicode{x0294f}\gamma .Qʻ=R\unicode{x0294f}\gamma' &\qquad \text{(1)}\\ \vdash .*213·24·151.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{sect}ʻP.\gamma \in \text{sect}ʻR.Q=P\unicode{x0294f}\alpha =P\unicode{x0294f}\gamma .\supset .\alpha =\gamma &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash \colon\ldotp \text{Hp}.\supset :Q(P_{\varsigma }\unicode{x0294f}CʻR_{\varsigma })Qʻ.\supset .\\ &(\exists \gamma ,\gamma').\gamma ,\gamma'\in \text{sect}ʻR-\iota ʻ\Lambda .Q=R\unicode{x0294f}\gamma .Qʻ=R\unicode{x0294f}\gamma'.\exists !\gamma '-\gamma . [*213·1] \supset . QR_{\varsigma }Qʻ &\qquad \text{(3)}\\ \vdash . (3) . *213·241 . \supset \vdash . \text{Prop} \end{array}$

*213·243. $\vdash . \overrightarrow{P}_{\varsigma }ʻP = \text{D}ʻP_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·1.\supset \vdash :R\in \overrightarrow{P}_{\varsigma }ʻP.&\equiv .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\\ &R=P\unicode{x0294f}\alpha .P=P\unicode{x0294f}\beta .\exists !\beta -\alpha &\qquad \text{(1)}\\ \vdash .*37·41.&\supset \vdash .Cʻ(P\unicode{x0294f}\beta )\subset \beta &\qquad \text{(2)}\\ \vdash .(2). \supset \vdash :\exists !CʻP-\beta .&\supset .\exists !CʻP-Cʻ(P\unicode{x0294f}\beta ).\\ [*13·14] &\supset .P\neq P\unicode{x0294f}\beta &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}.&\supset \vdash :\beta \in \text{sect}ʻP.P=P\unicode{x0294f}\beta .\supset .CʻP=\beta &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash :R\in \overrightarrow{P}_{\varsigma }ʻP.&\equiv .(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .R=P\unicode{x0294f}\alpha .\exists !CʻP-\alpha .\\ [*211·1] &\equiv .(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP.R=P\unicode{x0294f}\alpha .\\ [*213·141] &\equiv .R\in \text{D}ʻP_{\varsigma }:\supset \vdash .\text{Prop} \end{array}$

*213·244. $\vdash :R\in CʻP_{\varsigma }.Q\in \text{D}ʻR_{\varsigma }.\supset .QP_{\varsigma }R$

Dem. $\begin{array}{l} \vdash .*213·243.\supset \vdash \colon\ldotp R\in CʻP_{\varsigma }.\supset :Q\in \text{D}ʻR_{\varsigma }.&\supset .QR_{\varsigma }R.\\ [*213·241] &\supset .QP_{\varsigma }R:\supset \vdash .\text{Prop} \end{array}$

*213·245. $\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\supset :QP_{\varsigma }R.\equiv .R\in CʻP_{\varsigma }.Q\in \text{D}ʻR_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :\\ QP_{\varsigma }R.&\equiv .(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta .\alpha \subset \beta .\alpha \neq \beta .\\ [*213·24] &\equiv .(\exists \alpha ,\beta ).\beta \in \text{sect}ʻP-\iota ʻ\Lambda .R=P\unicode{x0294f}\beta .\alpha \in \text{sect}ʻR-\iota ʻ\Lambda .\\ &\alpha \subset \beta .\alpha \neq \beta .Q=P\unicode{x0294f}\alpha .\\ [*213·142.*211·133.*36·21] &\equiv .(\exists \alpha ).R\in CʻP_{\varsigma }.\alpha \in \text{sect}ʻR-\iota ʻ\Lambda .\alpha \subset CʻR.\alpha \neq CʻR.Q=R\unicode{x0294f}\alpha .\\ [*213·141]&\equiv .R\in CʻP_{\varsigma }.Q\in \text{D}ʻR_{\varsigma }\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*213·246. $\vdash :P_{\text{po}}\in \text{Ser}.R\in CʻP_{\varsigma }.\supset .\overrightarrow{P}_{\varsigma }ʻR=\text{D}ʻR_{\varsigma } \quad[*213·245]$

*213·247. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.\supset :Q(P_{\varsigma }\unicode{x0294f}\text{D}ʻP_{\varsigma })R.\equiv .R\in \text{D}ʻP_{\varsigma }.Q\in \text{D}ʻR_{\varsigma }\\ &[*213·245]\end{align}$

*213·25. $\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.Q,R\in CʻP_{\varsigma }.\supset :Q\in \text{D}ʻR_{\varsigma }.\lor.R\in \text{D}ʻQ_{\varsigma }.\lor.Q=R$

Dem. $\begin{array}{l} \vdash .*213·153.\supset \vdash \colon\ldotp \text{Hp}.&\supset :QP_{\varsigma }R.\lor.RP_{\varsigma }Q.\lor.Q=R:\\ [*213·245] &\supset :Q\in \text{D}ʻR_{\varsigma }.\lor.R\in \text{D}ʻQ_{\varsigma }.\lor.Q=R\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*213·251. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.Q,R\in CʻP_{\varsigma }.{\sim}&(Q=\dot{\Lambda} .R=\dot{\Lambda} ).\supset :\\ &Q\in CʻR_{\varsigma }.\lor.R\in \text{D}ʻQ_{\varsigma }\end{align}$

Dem. $\begin{array}{l} \vdash .*213·158. &\supset \vdash :\text{Hp}.\dot{\exists} !R.Q=R.\supset .Q\in CʻR_{\varsigma } &\qquad \text{(1)}\\ \vdash .(1).*13·12. &\supset \vdash :\text{Hp}.\dot{\exists} !Q.Q=R.\supset .Q\in CʻR_{\varsigma } &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.Q=R.\supset .Q\in CʻR_{\varsigma } &\qquad \text{(3)}\\ \vdash .(3).*213·25.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*212·17.\supset \vdash :\text{Hp}.&\supset .\varsigma ʻP_{*}=\dot{\Lambda} .\\ [*150·42] & \supset .P_{\varsigma }=\dot{\Lambda} :\supset \vdash .\text{Prop} \end{array}$

*213·301. $\vdash :\exists !\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻCʻP.\supset .\dot{\exists} !P_{\varsigma } \quad[*213·141]$

*213·302. $\vdash \colon\ldotp P_{\text{po}}\,\unicode{x2abd}\, J.\supset :\dot{\exists} !P.\equiv .\dot{\exists} !P_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·126·301.\supset \vdash :\text{Hp}.\dot{\exists} !P.\supset .\dot{\exists} !P_{\varsigma } &\qquad \text{(1)}\\ \vdash .(1).*213·3.\supset \vdash .\text{Prop} \end{array}$

*213·31. $\vdash :x\neq y.\supset .(x\downarrow y)_{\varsigma }=\dot{\Lambda} \downarrow (x\downarrow y)$

Dem. $\begin{array}{l} \vdash .*211·9.\supset \\ \vdash :\text{Hp}.&\supset .\text{sect}ʻ(x\downarrow y)-\iota ʻ\Lambda =\iota ʻ\iota ʻx\cup \iota ʻ(\iota ʻx\cup \iota ʻy).\exists !(\iota ʻx\cup \iota ʻy)-\iota ʻx.\\ [*213·1·141] &\supset .\{(x\downarrow y)\unicode{x0294f}{℩}ʻx\}(x\downarrow y)_{\varsigma }\{(x\downarrow y)\unicode{x0294f}({℩}ʻx\cup {℩}ʻy)\}.\\ &\text{D}ʻ(x\downarrow y)_{\varsigma }={℩}ʻ(x\downarrow y)\unicode{x0294f}{℩}ʻx.\\ [*200·35.*55·15]&\supset .\dot{\Lambda} (x\downarrow y)_{\varsigma }(x\downarrow y).\text{D}ʻ(x\downarrow y)_{\varsigma }=\iota ʻ\dot{\Lambda} &\qquad \text{(1)}\\ \vdash .*213·153.*204·25.&\supset \vdash :\text{Hp}.\supset .(x\downarrow y)_{\varsigma }\in \text{Ser}&\qquad \text{(2)}\\ \vdash .(1).(2).*204·27.\supset \vdash .\text{Prop} \end{array}$

*213·32. $\vdash :P\in 2_{r}.\supset .P_{\varsigma }=\dot{\Lambda} \downarrow P.P_{\varsigma }\in 2_{r} \quad[*213·31]$

*213·4. $\begin{align}\vdash :P\in &\text{Ser}.\supset .\\ &P\unicode{x0294f}ʻʻ\text{sect}ʻP=\hat{Q} \{(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x\}\end{align}$

Dem. $\begin{array}{l} \vdash .*211·82.*5·32.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp Q\in P\unicode{x0294f}ʻʻ\text{sect}ʻP.\equiv :\\ &Q\in \text{D}ʻP\unicode{x0294f}:(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x &\qquad \text{(1)}\\ \vdash .*211·283.*160·5.&\supset \vdash :\text{Hp}.P=Q\unicode{x2909}R.\supset .Q\in \text{D}ʻP\unicode{x0294f} &\qquad \text{(2)}\\ \vdash .*161·11.&\supset \vdash :\text{Hp}.P=Q\unicode{x21f8} x.\supset .Q=P\unicode{x0294f}CʻP &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash \colon\ldotp \text{Hp}:(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x:\supset .\\ &Q\in \text{D}ʻP\unicode{x0294f} &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*213·41. $\begin{align}\vdash :&P\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\supset .\\ &CʻP_{\varsigma }=\hat{Q} \{(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x\} \quad[*213·4·161]\end{align}$

*213·42. $\begin{align}&\vdash :P\in \text{Ser}.\overrightarrow{B}ʻP=\Lambda .\supset .\\ &CʻP_{\varsigma }=\hat{Q} \{(\exists R).P=Q\unicode{x2909}R.\lor.(\exists x).P=Q\unicode{x21f8} x\}-\iota ʻ\dot{\Lambda} \quad[*213·4·163]\end{align}$

*213·5. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.x{\sim}\in CʻP.\supset .\text{D}ʻ(P\unicode{x21f8} x)_{\varsigma }=CʻP_{\varsigma }$

Dem. $\begin{array}{l} \vdash .*213·141.*211·83.\supset \\ \vdash :\text{Hp}.\dot{\exists} !P.\supset .\text{D}ʻ(P\unicode{x21f8} x)_{\varsigma }&=(P\unicode{x21f8} x)\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )\\ [*36·4.*161·1] &=P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda )\\ [*213·142] &= CʻP_{\varsigma } &\qquad \text{(1)}\\ \vdash .*213·3.*161·2.\supset \vdash :P&=\dot{\Lambda} .\supset .\text{D}ʻ(P\unicode{x21f8} x)_{\varsigma }=\Lambda .CʻP_{\varsigma }=\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*213·51. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.x{\sim}\in CʻP.\supset .(P\unicode{x21f8} x)_{\varsigma }=P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} x)$

Dem. $\begin{array}{l} \vdash .*213·1.*211·83.\supset \vdash \colon\colon\text{Hp}.\dot{\exists} !&P.\supset \colon\ldotp Q(P\unicode{x21f8} x)_{\varsigma }R.\equiv :\\ &(\exists \alpha , \beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda \cup \iota ʻ(CʻP\cup \iota ʻx).\\ &\exists !\beta -\alpha .Q=(P\unicode{x21f8} x)\unicode{x0294f}\alpha .R=(P\unicode{x21f8} x)\unicode{x0294f}\beta .\\ [*211·1.*36·4] &\equiv :(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\exists !\beta -\alpha .Q=P\unicode{x0294f}\alpha .R=P\unicode{x0294f}\beta .\lor.\\ &(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .Q=P\unicode{x0294f}\alpha .R=P\unicode{x21f8} x:\\ [*213·1·142] &\equiv :QP_{\varsigma }R.\lor.Q\in CʻP_{\varsigma }.R=P\unicode{x21f8} x:\\ [*161·11] &\equiv :Q{P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} x)}R &\qquad \text{(1)}\\ \vdash .*213·3.*161·2.& \supset \vdash :P=\dot{\Lambda} .\supset .(P\unicode{x21f8} x)_{\varsigma }=\dot{\Lambda} .P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} x)=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*213·52. $\begin{align}&\vdash \colon\ldotp Q_{\text{po}}\in \text{connex} .CʻP\cap CʻQ=\Lambda .\supset :\\ &(\exists \beta ).\beta \cap CʻQ{\sim}\in 1.\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\equiv .\\ &(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda -1.S=P\unicode{x2909}Q\unicode{x0294f}\gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*37·6. \supset \vdash :&\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\equiv .\\ &(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda .\beta =CʻP\cup \gamma .S=(P\unicode{x2909}Q)\unicode{x0294f}(CʻP\cup \gamma ) &\qquad \text{(1)}\\ \vdash .*160·11.\supset \vdash \colon\colon\text{Hp}.\gamma \in \text{sect}ʻQ.\supset \colon\ldotp &x\{(P\unicode{x2909}Q)\unicode{x0294f}(CʻP\cup \gamma )\}y.\equiv :\\ &xPy.\lor.x\in CʻP.y\in \gamma .\lor.x(Q\unicode{x0294f}\gamma )y\colon\ldotp \\ [*211·133.*160·11]& \supset \colon\ldotp \gamma {\sim}\in 1.\supset .(P\unicode{x2909}Q)\unicode{x0294f}(CʻP\cup \gamma )=P\unicode{x2909}Q\unicode{x0294f}\gamma &\qquad \text{(2)}\\ \vdash .*24·24. &\supset \vdash :\text{Hp}.\beta =CʻP\cup \gamma .\supset .\beta \cap CʻQ=\gamma \cap CʻQ &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\beta \cap &CʻQ{\sim}\in 1.\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\equiv .\\ &(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda -1.S=P\unicode{x2909}Q\unicode{x0294f}\gamma .\beta =CʻP\cup \gamma &\qquad \text{(4)}\\ \vdash .(4).*10·281.*13·19.\supset \vdash .\text{Prop} \end{array}$

*213·53. $\begin{align}\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.Q_{\text{po}}\in \text{Ser}.\overrightarrow{B}ʻQ=\Lambda .CʻP\cap &CʻQ=\Lambda .\supset .\\ &(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x2909}(P\unicode{x2909}^{;}Q_{\varsigma })\end{align}$

Dem. $\begin{array}{l} \vdash .*213·1.*211·841.&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp R(P\unicode{x2909}Q)_{\varsigma }S.\equiv :\\ &(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda \cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).\\ &\exists !\beta -\alpha .R=(P\unicode{x2909}Q)\unicode{x0294f}\alpha .S=(P\unicode{x2909}Q)\unicode{x0294f}\beta :\\ [*211·182]\equiv :(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻ&P-\iota ʻ\Lambda \cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-1-\iota ʻ\Lambda ).\\ &\exists !\beta -\alpha .R=(P\unicode{x2909}Q)\unicode{x0294f}\alpha .S=(P\unicode{x2909}Q)\unicode{x0294f}\beta :\\ [*160·1.*213·52] &\equiv :(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\exists !\beta -\alpha .R=P\unicode{x0294f}\alpha .S=P\unicode{x0294f}\beta .\lor.\\ &(\exists \alpha ,\gamma ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda .R=P\unicode{x0294f}\alpha .S=P\unicode{x2909}Q\unicode{x0294f}\gamma .\lor.\\ &(\exists \gamma ,\delta ).\gamma ,\delta \in \text{sect}ʻQ-\iota ʻ\Lambda .\exists !\delta -\gamma .R=P\unicode{x2909}Q\unicode{x0294f}\gamma .S=P\unicode{x2909}Q\unicode{x0294f}\delta :\\ [*213·1·142]&\equiv :RP_{\varsigma }S.\lor.R\in CʻP_{\varsigma }.S\in CʻP\unicode{x2909}^{;}Q_{\varsigma }.\lor.R(P\unicode{x2909}^{;}Q_{\varsigma })S:\\ [*160·11]. &\equiv :R\{P_{\varsigma }\unicode{x2909}(P\unicode{x2909}^{;}Q_{\varsigma })\}S\colon\colon\supset \vdash .\text{Prop} \end{array}$

*213·531. $\begin{align}&\vdash \colon\colon Q_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻQ.CʻP\cap CʻQ=\Lambda .\supset \colon\ldotp \\ &(\exists \beta ).\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\equiv :\\ &S=P\unicode{x21f8} BʻQ.\lor.(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻQ.S=P\unicode{x2909}Q\unicode{x0294f}\gamma\end{align}$

Dem. $\begin{array}{l} \vdash .*213·52.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &(\exists \beta ).\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\equiv :\\ R(\exists \beta ).\beta \in (CʻP\cup )ʻʻ(\text{sect}ʻQ\cap 1).S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\lor. &(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda -1.S=P\unicode{x2909}Q\unicode{x0294f}\gamma :\\ [*211·181]&\equiv :(\exists \beta ).\beta =CʻP\cup \iota ʻBʻQ.S=(P\unicode{x2909}Q)\unicode{x0294f}\beta .\lor.\\ &(\exists \gamma ).\gamma \in \text{sect}ʻQ-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻQ.S=P\unicode{x2909}Q\unicode{x0294f}\gamma &\qquad \text{(1)}\\ \vdash .*160·11.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &x\{(P\unicode{x2909}Q)\unicode{x0294f}(CʻP\cup \iota ʻBʻQ)\}y.\equiv :\\ &xPy.\lor.x\in CʻP.y=BʻQ:\\ [*161·11] &\equiv :x(P\unicode{x21f8} BʻQ)y &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*213·54. $\begin{align}\vdash :\dot{\exists} !P.P_{\text{po}}\,\unicode{x2abd}\, J.&Q_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻQ.CʻP\cap CʻQ=\Lambda .\text{ᗡ}ʻQ_{\varsigma }{\sim}\in 1.\supset .\\ &(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x2909}\{P\unicode{x2909}^{;}(Q_{\varsigma }\unicode{x0294f}\text{ᗡ}ʻQ_{\varsigma })\}\end{align}$

Dem. $\begin{array}{l} \vdash .*213·1.*211·841.&\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp R(P\unicode{x2909}Q)_{\varsigma }S.\equiv :\\ &(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda \cup (CʻP\cup )ʻʻ(\text{sect}ʻQ-\iota ʻ\Lambda ).\exists !\beta -\alpha .\\ &R=(P\unicode{x2909}Q)\unicode{x0294f}\alpha .S=(P\unicode{x2909}Q)\unicode{x0294f}\beta :\\ [*213·531] &\equiv :(\exists \alpha ,\beta ).\alpha ,\beta \in \text{sect}ʻP-\iota ʻ\Lambda .\exists !\beta -\alpha .R=P\unicode{x0294f}\alpha .Q=P\unicode{x0294f}\beta .\lor.\\ &(\exists \alpha ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .R=P\unicode{x0294f}\alpha .S=P\unicode{x21f8} BʻQ.\lor.\\ &(\exists \alpha ,\gamma ).\alpha \in \text{sect}ʻP-\iota ʻ\Lambda .R=P\unicode{x0294f}\alpha .\beta \in \text{sect}ʻQ-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻQ.\\ &S=P\unicode{x2909}Q\unicode{x0294f}\gamma .\lor.\\ &(\exists \gamma ).R=P\unicode{x21f8} BʻQ.\beta \in \text{sect}ʻQ-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻQ.S=P\unicode{x2909}Q\unicode{x0294f}\gamma .\lor.\\ &(\exists \gamma ,\delta ).\gamma ,\delta \in \text{sect}ʻQ-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻQ.\exists !\delta -\gamma .R=P\unicode{x2909}Q\unicode{x0294f}\gamma .\\ &S=P\unicode{x2909}Q\unicode{x0294f}\delta :\\ [*213·1·142·132] \equiv :RP_{\varsigma }S.&\lor.R\in CʻP_{\varsigma }.S=P\unicode{x21f8} BʻQ.\lor.R=P\unicode{x21f8} BʻQ.S\in P\unicode{x2909}ʻʻ\text{ᗡ}ʻQ_{\varsigma }.\\ &\lor.R,S\in (P\unicode{x2909}ʻʻ)\text{ᗡ}ʻQ_{\varsigma }.R(P\unicode{x2909}^{;}Q)S.\lor.R\in CʻP_{\varsigma }.S\in P\unicode{x2909}ʻʻ\text{ᗡ}ʻQ_{\varsigma }:\\ [*161·11.*211·133.*160·11] &\equiv :R{P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x2909}(P\unicode{x2909}^{;}Q_{\varsigma }\unicode{x0294f}\text{ᗡ}ʻQ_{\varsigma })}S\colon\colon\supset \vdash .\text{Prop} \end{array}$

*213·541. $\vdash :P_{\text{po}}\in \text{Ser}.\exists !\overrightarrow{B}ʻP.\text{ᗡ}ʻP_{\varsigma }\in 1.\supset .P\in 2_{r}$

Dem. $\begin{array}{l} \vdash .*213·144.*211·26.\supset \vdash \colon\ldotp \text{Hp}.&\supset :P\unicode{x0294f}ʻʻ(\text{sect}ʻP-\iota ʻ\Lambda -\iota ʻ\iota ʻBʻP)=\iota ʻP:\\ [*211·3·13] \supset :x\in \text{ᗡ}ʻP.&\supset .P\unicode{x0294f}\overrightarrow{P}_{*}ʻx=P.\\ [*202·55] &\supset .\overrightarrow{P}_{*}ʻx=CʻP.\\ [*200·39] & \supset .\overleftarrow{P}_{\text{po}}ʻx=\Lambda .\\ [*202·522·523] & \supset .x=Bʻ\breve{P} :\\ [*204·271] &\supset :P_{\text{po}}\in 2_{r}:\\ [*56·111.*91·504] &\supset :P\in 2_{r}\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*213·55. $\begin{align}\vdash :\dot{\exists} !P.P_{\text{po}}\,\unicode{x2abd}\, J.Q\in 2_{r}.&CʻP\cap CʻQ=\Lambda .\supset .\\ &(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x21f8} (P\unicode{x2909}Q)\end{align}$

$\begin{array}{l} \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp R(P\unicode{x2909}Q)_{\varsigma }S.\\ \equiv :RP_{\varsigma }S.&\lor.R\in CʻP_{\varsigma }.S=P\unicode{x21f8} BʻQ.\lor.R\in CʻP_{\varsigma }.S\in P\unicode{x2909}ʻʻ\text{ᗡ}ʻQ_{\varsigma }.\\ &\lor.R=P\unicode{x21f8} BʻQ.S\in P\unicode{x2909}ʻʻ\text{ᗡ}ʻQ_{\varsigma }.\lor.R,S\in P\unicode{x2909}ʻʻ\text{ᗡ}ʻQ_{\varsigma }.\\ &R(P\unicode{x2909}^{;}Q_{\varsigma })S:\\ [*213·32]&\equiv :RP_{\varsigma }S.\lor.R\in CʻP_{\varsigma }.S=P\unicode{x21f8} BʻQ.\lor.R\in CʻP_{\varsigma }.S=P\unicode{x2909}Q.\\ &\lor.R=P\unicode{x21f8} BʻQ.S=P\unicode{x2909}Q.\lor.R=P\unicode{x2909}Q.S=P\unicode{x2909}Q.\\ &R(P\unicode{x2909}^{;}Q_{\varsigma })S:\\ [*213·32]\equiv :RP_{\varsigma }S.&\lor.R\in CʻP_{\varsigma }.S=P\unicode{x21f8} BʻQ.\lor.R\in CʻP_{\varsigma }.S=P\unicode{x2909}Q.\\ &\lor.R=P\unicode{x21f8} BʻQ.S=P\unicode{x2909}Q:\\ [*161·11]&\equiv :R\{P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x21f8} (P\unicode{x2909}Q)\}S\colon\colon\supset \vdash .\text{Prop} \end{array}$

*213·56. $\begin{align}\vdash \colon\ldotp &P_{\text{po}}\,\unicode{x2abd}\, J.Q_{\text{po}}\in \text{Ser}.CʻP\cap CʻQ=\Lambda .\supset :\\ &\overrightarrow{B}ʻQ=\Lambda .\supset .(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x2909}(P\unicode{x2909}^{;}Q_{\varsigma }):\\ &\dot{\exists} !P.\exists !\overrightarrow{B}ʻQ.Q{\sim}\in 2_{r}.\supset .\\ &(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x2909}\{P\unicode{x2909}^{;}(Q_{\varsigma }\unicode{x0294f}\text{ᗡ}ʻQ_{\varsigma })\}:\\ &\dot{\exists} !P.Q\in 2_{r}.\supset .(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x21f8} (P\unicode{x21f8} BʻQ)\unicode{x21f8} (P\unicode{x2909}Q):\\ &P=\dot{\Lambda} .\supset .(P\unicode{x2909}Q)_{\varsigma }=Q_{\varsigma } \quad[*213·53·54·541·55.*160·22]\end{align}$

*213·561. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .(P\unicode{x2909})\unicode{x0294f}CʻQ_{\varsigma }\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*213·1.\supset \vdash :R\in CʻQ_{\varsigma }.&\supset .CʻR\subset CʻQ &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash \colon\ldotp \text{Hp}.R,S\in CʻQ_{\varsigma }.&\supset :CʻP\cap CʻR=\Lambda .CʻP\cap CʻS=\Lambda :\\ [*160·52] & \supset :P\unicode{x2909}R=P\unicode{x2909}S.\supset .R=S\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*213·57. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.\text{Nr}ʻQ=\text{Nr}ʻP\dot{+} \dot{1} .\supset .\text{Nr}ʻQ_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \dot{1}$

Dem. $\begin{array}{l} \vdash .*181·2·12.(*181·01).\supset \\ \vdash :\text{Hp}.&\supset .(\exists R,x).R\,\,\text{smor}\,\,P.x{\sim}\in CʻR.Q=R\unicode{x21f8} x.\\ [*213·51] &\supset .(\exists R,x).R\,\,\text{smor}\,\,P.x{\sim}\in CʻR.Q_{\varsigma }=R_{\varsigma }\unicode{x21f8} (R\unicode{x21f8} x).\\ [*181·32] &\supset .(\exists R).R\,\,\text{smor}\,\,P.\text{Nr}ʻQ_{\varsigma }=\text{Nr}ʻR_{\varsigma }\dot{+} \dot{1} .\\ [*213·172] &\supset .\text{Nr}ʻQ_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \dot{1} :\supset \vdash .\text{Prop} \end{array}$

*213·58. $\vdash :P_{\text{po}}\,\unicode{x2abd}\, J.Q_{\text{po}}\in \text{Ser}.CʻP\cap CʻQ=\Lambda .\supset .\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma }$

Dem. $\begin{array}{l} \vdash . *213·53·561 .\supset \\ \vdash :\text{Hp}.\overrightarrow{B}ʻQ=\Lambda .&\supset .(P\unicode{x2909}Q)_{\varsigma }=P_{\varsigma }\unicode{x2909}(P\unicode{x2909}^{;}Q_{\varsigma }).\text{Nr}ʻP\unicode{x2909}^{;}Q_{\varsigma }=\text{Nr}ʻQ_{\varsigma }.\\ [*180·32] &\supset .\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma } &\qquad \text{(1)}\\ \vdash .*213·54·561.*181·32.\supset\\ \vdash :\text{Hp}.\dot{\exists} !P.\exists !\overrightarrow{B}ʻQ.\text{ᗡ}ʻQ_{\varsigma }{\sim}\in 1.\supset .\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }&=\text{Nr}ʻP_{\varsigma }\dot{+} \dot{1} \dot{+} \text{Nr}ʻQ_{\varsigma }\unicode{x0294f}\text{ᗡ}ʻQ_{\varsigma }\\ [*204·46.*213·157] &=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma } &\qquad \text{(2)}\\ \vdash .*213·541·55.*181·32.\supset \\ \vdash :\text{Hp}.\dot{\exists} !P.\text{ᗡ}ʻQ_{\varsigma }\in 1.&\supset .Q\in 2_{r}.\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \dot{1} \dot{+} \dot{1} .\\ [*181·56] &\supset .Q\in 2_{r}.\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} 2_{r}.\\ [*213·32] &\supset .\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma } &\qquad \text{(3)}\\ \vdash .*160·22.*213·3.&\supset \vdash :P=\dot{\Lambda} .\supset .\text{Nr}ʻ(P\unicode{x2909}Q)_{\varsigma }=\text{Nr}ʻP_{\varsigma }\dot{+} \text{Nr}ʻQ_{\varsigma } &\qquad \text{(4)}\\ \vdash .(1).(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

We call a relation "Dedekindian" when it is such that every class has either a maximum or a sequent with respect to it. As a rule, the hypothesis that a relation is Dedekindian is only important in the case of serial relations. Dedekindian series have considerable importance, especially in connection with limits.

When $P$ is transitive, the hypothesis that $P$ is Dedekindian is equivalent to the hypothesis that every section of $P$ has a maximum or a sequent (*214·13); it is also equivalent to the assumption that every segment of $P$ has a maximum or a sequent (*214·131), i.e. to the assumption that every segment of $P$ which has no maximum has a limit, i.e. to $\text{D}ʻ(P_{\in }\dot{\cap} I)\subset \text{ᗡ}ʻ\text{lt}_P.$ When $P$ is a series, the hypothesis that it is Dedekindian is equivalent to the hypothesis that every segment has a sequent (*214·15), i.e. to the hypothesis that the class of segments is the class $\overrightarrow{P}ʻʻCʻP$ (*214·151). If $P$ is a Dedekindian series, so is $\breve{P}$ , and vice versa (*214·14). Whenever $P$ is connected and not null, $\varsigma ʻP_{*}$ is a Dedekindian series (*214·32), and so is $\text{sgm}ʻP$ if it exists (*214·34); whenever $P$ is transitive and connected and not null, $\varsigma ʻP$ is a Dedekindian series (*214·33). All these propositions have been virtually proved already: almost the only thing new in the present number is the definition, which is $\text{Ded}=\hat{P}\{(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\} \quad\text{Df}.$

*214·4—·43 give properties of series which have Dedekindian continuity. We have

*214·4. $\vdash \colon\ldotp P^{2}=P.P\in \text{connex} .\supset :P\in \text{Ded}.\equiv .\text{ᗡ}ʻ\text{max}_{P}=-\text{ᗡ}ʻ\text{seq}_{P}$

*214·41. $\vdash \colon\ldotp P\in \text{Ser}.\supset :P^{2}=P.P\in \text{Ded}.\equiv .\text{ᗡ}ʻ\text{max}_{P}=-\text{ᗡ}ʻ\text{seq}_{P}$

I.e. in a series, Dedekindian continuity is equivalent to the assumption that the classes which have a maximum are the same as the classes which have no sequent.

*214·42. $\vdash :P\in \text{Ser} \cap \text{Ded}.P^{2} = P.\alpha \in \text{sect}ʻP.\supset .\text{limax}_Pʻ\alpha = \text{limin}_Pʻ(CʻP-\alpha )$

*214·43. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser} \cap \text{Ded}.\alpha \in \text{sect}ʻP.\supset :\\ &\text{limax}_Pʻ\alpha = \text{limin}_Pʻ(CʻP-\alpha ).\lor.\text{max}_{P}ʻ\alpha P_{1} \text{min}_{P}ʻ(CʻP-\alpha )\end{align}$

*214·5 shows that a Dedekindian relation has a beginning and an end; the following propositions deal with $P\dot{\cap} J$ when $P$ is Dedekindian.

*214·6 shows that a relation which is similar to a Dedekindian relation is Dedekindian.

We call a relation "semi-Dedekindian" if it becomes Dedekindian by the addition of one term at the end; the definition is

*214·02. $\text{semi Ded} = \hat{P} (\text{sect}ʻP-\iota ʻCʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}) \quad\text{Df}$

*214·01. $\text{Ded} = \hat{P}\{(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\} \quad\text{Df}$

*214·02. $\text{semi Ded} = \hat{P} (\text{sect}ʻP-\iota ʻCʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}) \quad\text{Df}$

*214·1. $\vdash :P\in \text{Ded}. \equiv .(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P} \quad[(*214·01)]$

*214·101. $\begin{align}& \vdash :P\in \text{Ded}. \equiv .-\text{ᗡ}ʻ\text{max}_{P}\subset \text{ᗡ}ʻ\text{seq}_{P}. \equiv .-\text{ᗡ}ʻ\text{max}_{P}\subset \text{ᗡ}ʻ\text{lt}_P\\ &[*214·1.*24·312.*207·12]\end{align}$

*21·411. $\begin{align}& \vdash :P\in \text{Ded}. \equiv .(\alpha ).\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{lt}_P. \equiv .(\alpha ).\alpha \in \text{ᗡ}ʻ\text{limax}_P\\ &[*214·1.*207·14·44]\end{align}$

*214·12. $\begin{align}& \vdash \colon\ldotp P\in \text{Ded}. \equiv :\alpha \subset CʻP.\supset _{\alpha }.\alpha \in \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\\ &[*214·1.*205·151.*206·131]\end{align}$

*214·13. $\begin{align}& \vdash \colon\ldotp P\in \text{trans}.\supset :P\in \text{Ded}. \equiv .\text{sect}ʻP\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·272.*214·1]\end{align}$

*214·131. $\vdash \colon\ldotp P\in \text{trans}.\supset :P\in \text{Ded}. \equiv .\text{D}(ʻP_{\in }\dot{\cap} I)\subset \text{ᗡ}ʻ\text{seq}_{P} \quad[*211·47.*214·1]$

*214·132. $\begin{align}& \vdash \colon\ldotp P\in \text{trans}.\supset :P\in \text{Ded}. \equiv .\text{D}ʻP_{\in }\subset \text{ᗡ}ʻ\text{max}_{P}\cup \text{ᗡ}ʻ\text{seq}_{P}\\ &[*214·131.*211·42]\end{align}$

*214·14. $\vdash \colon\ldotp P\in \text{Ser}.\supset :P\in \text{Ded}. \equiv .\breve{P} \in \text{Ded} \quad[*206·57.*214·1]$

*214·141. $\begin{align}& \vdash \colon\ldotp P\in \text{Ser}.\supset :P\in \text{Ded}. \equiv .(\alpha ).pʻ\overrightarrow{P}ʻʻ(\alpha \cap CʻP)\in \text{ᗡ}ʻ\text{max}_{P}\text{ᗡ}ʻ\text{seq}_{P}\\ &[*206·56.*214·1]\end{align}$

*214·15. $\begin{align}& \vdash \colon\ldotp P\in \text{Ser}.\supset :P\in \text{Ded}. \equiv .\text{D}ʻP_{\in }\subset \text{ᗡ}ʻ\text{seq}_{P}\\ &[*206·36.*214·1.*211·11]\end{align}$

*214·151. $\vdash P\in \text{Ser}.\supset :P\in \text{Ded}. \equiv .\text{D}ʻP\in = \overrightarrow{P}ʻʻCʻP \quad[*211·38.*214·1]$

*214·2. $\vdash :P\in \text{trans}\cap \text{connex} \cap \text{Ded}.\supset .\text{D}ʻP_{\in }\subset \text{ᗡ}ʻ\text{seq}_{P} \quad[*211·371]$

*214·21. $\vdash :P\in \text{trans}\cap \text{connex} \cap \text{Ded}.\supset .\text{D}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP \quad [*211·372]$

*214·22. $\begin{align}& \vdash :P\in \text{trans}\cap \text{connex} \cap \text{Ded}.\supset .\text{D}ʻ(P_{\in }\dot{\cap} I)=\overrightarrow{P}ʻʻ\{CʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\}\\ &[*211·46]\end{align}$

*214·23. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} \cap \text{Ded}.{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\supset .\\ &\text{seq}_{P}ʻ\alpha =\text{max}_{P}ʻ(\alpha \cup \iota ʻ\text{seq}_{P}ʻ\alpha ).\text{E}!\text{max}_{P}ʻ(\alpha \cup \iota ʻ\text{seq}_{P}ʻ\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*214·101.\supset \vdash :\text{Hp}.&\supset .\text{E}!\text{seq}_{P}ʻ\alpha .\\ [*206·47] &\supset .\text{seq}_{P}ʻ\alpha =\text{max}_{P}ʻ(\alpha \cup \iota ʻ\text{seq}_{P}ʻ\alpha ). &\qquad \text{(1)}\\ [*14·21] &\supset .\text{E}!\text{max}_{P}ʻ(\alpha \cup \iota ʻ\text{seq}_{P}ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*214·24. $\begin{align}& \vdash :P\in \text{connex} \cap \text{Ded}.\alpha \in \text{sect}ʻP.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha )\\ &[*211·721]\end{align}$

*214·241. $\begin{align}& \vdash :P\in \text{connex} .\breve{P} \in \text{Ded}.\alpha \in \text{sect}ʻP.\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{prec}} _{P}ʻ(CʻP-\alpha )\\ &\left[*214·24 \frac{\breve{P}}{P}. *211·7\right]\end{align}$

*214·3. $\begin{align}\vdash \colon\colon\alpha ,&\beta \in \kappa .\supset _{\alpha ,\beta }:\alpha \subset \beta .\lor.\beta \subset \alpha \colon\ldotp\\ &\kappa {\sim}\in 1.Q=\hat{\alpha} \hat{\beta} (\alpha ,\beta \in \kappa .\alpha \subset \beta .\alpha \neq \beta )\colon\ldotp \supset \colon\ldotp\\ &\lambda \subset \kappa .\supset _{\lambda }.sʻ\lambda \in \kappa :\supset .Q\in \text{Ser}\cap \text{Ded}\\ &[*210·12·253]\end{align}$

*214·31. $\begin{align}& \vdash \colon\ldotp \text{Hp}*214·3:\lambda \subset \kappa .\supset _{\lambda }.pʻ\lambda \cap sʻ\kappa \in \kappa :\supset .Q\in \text{Ser}\cap \text{Ded}\\ &[*210·12·254]\end{align}$

*214·32. $\vdash :P\in \text{connex} .\dot{\exists} !P.\supset .\varsigma ʻP_{*}\in \text{Ser}\cap \text{Ded} \quad[*212·3·35]$

*214·33. $\vdash :P\in \text{trans}\cap \text{connex} .\dot{\exists} !P.\supset .\varsigma ʻP\in \text{Ser}\cap \text{Ded} \quad[*212·31·44]$

*214·34. $\vdash :P\in \text{connex} .\dot{\exists} !\text{sgm}ʻP.\supset .\text{sgm}ʻP\in \text{Ser}\cap \text{Ded} \quad[*212·3·54]$

*214·4. $\begin{align}& \vdash \colon\ldotp P^{2}=P.P\in \text{connex} .\supset :P\in \text{Ded}.\equiv .\text{ᗡ}ʻ\text{max}_{P}=-\text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·53]\end{align}$

*214·41. $\begin{align}& \vdash \colon\ldotp P\in \text{Ser}.\supset :P^{2}=P.P\in \text{Ded}.\equiv .\text{ᗡ}ʻ\text{max}_{P}=-\text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·552]\end{align}$

*214·42. $\vdash :P\in \text{Ser}\cap \text{Ded}.P^{2}=P.\alpha \in \text{sect}ʻP.\supset .\text{limax}_Pʻ\alpha =\text{limin}_Pʻ(CʻP-\alpha )$

Dem. $\begin{array}{l} \vdash .*211·721.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ(CʻP-\alpha ):\\ [*214·101] &\supset :{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{lt}_Pʻ\alpha =\text{min}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(1)}\\ \vdash .*211·726.&\supset \vdash :\text{Hp}.\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{max}_{P}ʻ\alpha =\text{prec}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(2)}\\ \vdash .*214·14·41.&\supset \vdash :\text{Hp}.\text{E}!\text{prec}_{P}ʻ(CʻP-\alpha ).\supset .{\sim}\text{E}!\text{max}_{P}ʻ(CʻP-\alpha ).\\ [*207·12] &\supset .\text{prec}_{P}ʻ(CʻP-\alpha )=\text{tl}_Pʻ(CʻP-\alpha ) &\qquad \text{(3)}\\ \vdash .(2).(3). &\supset \vdash :\text{Hp}.\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{max}_{P}ʻ\alpha =\text{tl}_Pʻ(CʻP-\alpha ) &\qquad \text{(4)}\\ \vdash .(1).(4).*207·46.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\text{limax}_Pʻ\alpha =\text{min}_{P}ʻ(CʻP-\alpha ).\lor.\text{limax}_Pʻ\alpha =\text{tl}_Pʻ(CʻP-\alpha ):\\ [*207·46] &\supset :\text{limax}_Pʻ\alpha =\text{limin}_Pʻ(CʻP-\alpha )\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*214·43. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}\cap \text{Ded}.\alpha \in \text{sect}ʻP.\supset :\\ &\text{limax}_Pʻ\alpha =\text{limin}_Pʻ(CʻP-\alpha ).\lor.\text{max}_{P}ʻ\alpha P_{1}\text{min}_{P}ʻ(CʻP-\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*214·11. \supset \vdash \colon\ldotp \text{Hp}.\supset :{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\supset .\text{limax}_Pʻ\alpha &=\text{seq}_{P}ʻ\alpha \\ [*211·715] &=\text{min}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(1)}\\ \vdash .*211·726.\supset \vdash :\text{E}!\text{max}_{P}ʻ\alpha .{\sim}\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ).\supset .\\ &\text{limax}_Pʻ\alpha =\text{tl}_Pʻ(CʻP-\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).*207·46.&\supset \vdash \colon\ldotp \text{Hp}:{\sim}\text{E}!\text{max}_{P}ʻ\alpha .\lor.{\sim}\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ):\supset .\\ &\text{limax}_Pʻ\alpha =\text{limin}_Pʻ(CʻP-\alpha ) &\qquad \text{(3)}\\ \vdash .*211·726.\supset \vdash :\text{Hp}.\text{E}!&\text{max}_{P}ʻ\alpha .\text{E}!\text{min}_{P}ʻ(CʻP-\alpha ).\supset .\\ &\text{E}!\text{max}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\text{seq}_{P}ʻ\alpha =\text{min}_{P}ʻ(CʻP-\alpha ).\\ [*206·5] &\supset .\text{max}_{P}ʻ\alpha P_{1}\text{min}_{P}ʻ(CʻP-\alpha ) &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*214·5. $\vdash :P\in \text{Ded}.\supset .\exists !\overrightarrow{B}ʻP.\exists !\overrightarrow{B}ʻ\breve{P} .\overrightarrow{B}ʻP=\overrightarrow{\text{seq}} _{P}ʻ\Lambda .\overrightarrow{B}ʻ\breve{P} =\overrightarrow{\text{max}}_{P}ʻCʻP$

Dem. $\begin{array}{l} \vdash .*205·161.*214·101.\supset \vdash :\text{Hp}.&\supset .\exists !\overrightarrow{\text{seq}} _{P}ʻ\Lambda .\\ [*206·14] &\supset .\exists !\overrightarrow{B}ʻP.\overrightarrow{B}ʻP=\overrightarrow{\text{seq}} _{P}ʻ\Lambda &\qquad \text{(1)}\\ \vdash .*206·18·2. &\supset \vdash .\overrightarrow{\text{seq}} _{P}ʻCʻP=\Lambda &\qquad \text{(2)}\\ \vdash .(2).*214·1.\supset \vdash :\text{Hp}.&\supset .\exists !\overrightarrow{\text{max}}_{P}ʻCʻP.\\ [*93·117] &\supset .\exists !\overrightarrow{B}ʻ\breve{P} .\overrightarrow{B}ʻ\breve{P} =\overrightarrow{\text{max}}_{P}ʻCʻP &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*214·51. $\vdash \colon\ldotp P\in \text{Ded}.\supset :{\sim}(xPx).\lor.x\in \text{D}ʻ(P\dot{-} P^{2})$

Dem. $\begin{array}{l} \vdash .*214·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\overrightarrow{\text{max}}_{P}ʻ\iota ʻx.\lor.\exists !\overrightarrow{\text{seq}} _{P}ʻ\iota ʻx:\\ [*53·301.*206·42] &\supset :\exists !\iota ʻx-\overrightarrow{P}ʻx.\lor.\exists ! \overleftarrow{P\dot{-} P^{2}}ʻx:\\ [*51·31.*33·4] &\supset :{\sim}(xPx).\lor.x\in \text{D}ʻ(P\dot{-} P^{2})\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*214·52. $\vdash :P\in \text{Ded}.P\,\unicode{x2abd}\, P^{2}.\supset .P\,\unicode{x2abd}\, J \quad[*214·51]$

*214·53. $\vdash :P\in \text{Ded}.\supset .\text{D}ʻP=\text{D}ʻ(P\dot{\cap} J)$

Dem. $\begin{array}{l} \vdash .*214·51.\supset \vdash :\text{Hp}.xPx.&\supset .x\in \text{D}ʻ(P\dot{-} P^{2}).\\ [*33·13] &\supset .(\exists y).xPy.x\dot{-} P^{2}y.\\ [*34·54.\text{Transp}] &\supset .(\exists y).xPy.x\neq y &\qquad \text{(1)}\\ \vdash .(1).*13·195.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(\exists y).xPy.\supset .(\exists y).xPy.x\neq y:\\ [*33·13] &\supset :\text{D}ʻP\subset \text{D}ʻ(P\dot{\cap} J):\\ [*33·25] &\supset :\text{D}ʻP=\text{D}ʻ(P\dot{\cap} J)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*93·12.\supset \vdash \colon\ldotp x\in \overrightarrow{B}ʻ\breve{P} .&\supset :x{\sim}\in \text{D}ʻP:(\exists y).yPx:\\ [*13·14] &\supset :(\exists y).yPx.x\neq y:\\ [*33·13] &\supset :x\in \text{ᗡ}ʻ(P\dot{\cap} J) &\qquad \text{(1)}\\ \vdash .(1).*214·53. \supset \vdash :\text{Hp}.&\supset .\text{D}ʻP\cup \overrightarrow{B}ʻ\breve{P} \subset Cʻ(P\dot{\cap} J).\\ [*93·12] &\supset .CʻP\subset Cʻ(P\dot{\cap} J).\\ [*33·252] &\supset .CʻP=Cʻ(P\dot{\cap} J):\supset \vdash .\text{Prop} \end{array}$

*214·532. $\vdash :P\in \text{Ded}.\supset .\text{ᗡ}ʻP=\text{ᗡ}ʻ(P\dot{\cap} J)$

Dem. $\begin{array}{l} \vdash .*34·54. \supset \vdash :\overrightarrow{P}ʻx=\iota ʻx.&\supset .\overrightarrow{P}ʻx=Pʻʻ\overrightarrow{P}ʻx.\\ [*205·123] &\supset .\overrightarrow{\text{max}}_{P}ʻ\iota ʻx=\Lambda &\qquad \text{(1)}\\ \vdash .*206·134.&\supset \vdash :\overrightarrow{P}ʻx=\iota ʻx.\supset .\\ &\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{P}ʻx=CʻP\cap \hat{y} \{\iota ʻx\subset \overrightarrow{P}ʻy.\overrightarrow{P}ʻy\subset -pʻ\overleftarrow{P}ʻʻ\iota ʻx\}\\ [*53·301·01] &=CʻP\cap \hat{y} \{\iota ʻx\subset \overrightarrow{P}ʻy.\overrightarrow{P}ʻy\subset -\overleftarrow{P}ʻx\}\\ [\text{Hp}] &=CʻP \cap \hat{y} \{\iota ʻx\subset \overrightarrow{P}ʻy.\overrightarrow{P}ʻy\subset -\iota ʻx\}\\ [*51·161] & =\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\overrightarrow{P}ʻx=\iota ʻx.\supset .\overrightarrow{\text{max}}_{P}ʻ\overrightarrow{P}ʻx=\Lambda .\overrightarrow{\text{seq}} _{P}ʻ\overrightarrow{P}ʻx=\Lambda &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}.\supset \vdash \colon\ldotp \text{Hp}.&\supset :(x).\overrightarrow{P}ʻx\neq \iota ʻx:\\ [*51·401.\text{Transp}] &\supset :(x):\exists !\overrightarrow{P} ʻx.\supset .\exists !\overrightarrow{P}ʻx-\iota ʻx:\\ [*33·41] &\supset :x\in \text{ᗡ}ʻP.\supset .x\in \text{ᗡ}ʻ(P\dot{\cap} J) &\qquad \text{(4)}\\ \vdash .(4).*33·251.\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*205·111·195.\supset \vdash .\overrightarrow{\text{max}}_{P}ʻ\alpha &\subset \alpha \cap Cʻ(P\dot{\cap} J)-Pʻʻ\alpha \\ [*37·201] &\subset \alpha \cap Cʻ(P\dot{\cap} J)-(P\dot{\cap} J)ʻʻ\alpha \\ [*205·111] &\subset \overrightarrow{\text{max}}(P\dot{\cap} J)ʻ\alpha .\\ [*24·59] &\supset \vdash :{\sim}\exists !\overrightarrow{\text{max}}(P\dot{\cap} J)ʻ\alpha .\supset .{\sim}\exists !\overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*214·1. &\supset \vdash :\text{Hp}.{\sim}\exists !\overrightarrow{\text{max}}(P\dot{\cap} J)ʻ\alpha .\supset .\exists !\overrightarrow{\text{seq}} _{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*206·2·17.\supset \\ \vdash \colon\ldotp x\text{seq}_{P}\alpha .&\equiv :y\in \alpha \cap CʻP.\supset _{y}.yPx.y\neq x:x\in CʻP:\\ &yPx.\supset _{y}.(\exists z).z\in \alpha .{\sim}(zPy):\\ [*214·531] &\equiv :y\in \alpha \cap Cʻ(P\dot{\cap} J).\supset _{y}.y(P\dot{\cap} J)x:x\in Cʻ(P\dot{\cap} J):\\ &yPx.\supset _{y}.(\exists z).z\in \alpha .{\sim}(zPy):\\ [*23·43.*3·14]\supset :y\in \alpha \cap Cʻ&(P\dot{\cap} J).\supset _{y}.y(P\dot{\cap} J)x:x\in Cʻ(P\dot{\cap} J):\\ &y(P\dot{\cap} J)x.\supset _{y}.(\exists z).z\in \alpha .{\sim}\{z(P\dot{\cap} J)y\}:\\ [*206·17] &\supset :x\text{seq}(P\dot{\cap} J)\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).&\supset \vdash :\text{Hp}.{\sim}\exists !\overrightarrow{\text{max}}(P\dot{\cap} J)ʻ\alpha .\supset .\exists !\text{seq}(P\dot{\cap} J)ʻ\alpha &\qquad \text{(4)}\\ \vdash .(4).*214·1.\supset \vdash .\text{Prop} \end{array}$

*214·6. $\vdash :P\in \text{Ded}.P\,\,\text{smor}\,\,Q.\supset .Q\in \text{Ded}$

Dem. $\begin{array}{l} \vdash .*207·65.*214·11.\supset \\ \vdash :P\in \text{Ded}.S\in P\,\overline{\,\text{smor}\,}\,Q.&\supset .(\alpha ).\breve{S} ʻʻ\alpha \in \text{ᗡ}ʻ\text{limax}_{Q}.\\ [*71·481] &\supset .\text{Cl}ʻ\text{ᗡ}ʻS\subset \text{ᗡ}ʻ\text{limax}_{Q} .\\ [*151·11.*214·12]&\supset .Q\in \text{Ded}:\supset \vdash .\text{Prop} \end{array}$

*214·7. $\begin{align}& \vdash \colon\ldotp P \in \text{semi Ded}.\equiv :\alpha \in \text{sect}ʻP.\alpha \neq CʻP.\supset _{\alpha }.\exists !(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha )\\ &[(*214·02)]\end{align}$

*214·72. $\begin{align}& \vdash \colon\ldotp P \in \text{trans}.\supset :P \in \text{Ded}.\equiv .P \in \text{semi Ded}.\exists !\overrightarrow{B}ʻ\breve{P}\\ &[*214·7·13.*205·121]\end{align}$

*214·73. $\vdash . \text{semi Ded}-\iota ʻ\dot{\Lambda} \subset \text{ᗡ}ʻB \quad[*206·14.*211·44.*214·7]$

The proof of the following proposition is given in a somewhat compressed form, since, if given with the usual fullness, it would require various lemmas not required elsewhere.

*214·74. $\vdash :P\in \text{Ser}\cap \text{semi Ded}.\supset .P\unicode{x0294f}\overleftarrow{P}_{*}ʻx\in \text{semi Ded}$

Dem. $\begin{array}{l} \vdash .*214·7.&\supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP.\alpha \neq CʻP.\supset .\exists !(\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha ) &\qquad \text{(1)}\\ \vdash .*205·261.\supset \\ \vdash :\text{Hp}(1).\overleftarrow{P}_{*}ʻx{\sim}\in 1.x\in \alpha .\supset .\overrightarrow{\text{max}}(P\unicode{x0294f}\overleftarrow{P}_{*}ʻx)ʻ\alpha &=\overrightarrow{\text{max}}_{P}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx)\\ [*205·262] &=\overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*211·75·56.&\supset \vdash :\text{Hp}(2).\supset .CʻP-\alpha \subset \overleftarrow{P}_{*}ʻx &\qquad \text{(3)}\\ \vdash .(3).*211·715.\supset \vdash :\text{Hp}(2).Q=P\unicode{x0294f}\overleftarrow{P}_{*}ʻx.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha &=\overrightarrow{\text{min}}_{P}ʻ(\overleftarrow{P}_{*}ʻx-\alpha )\\ [*205·261] &=\overrightarrow{\text{min}}_{Q}ʻ(-\alpha )\\ [*211·715.*206·25] &=\overrightarrow{\text{seq}} _{Q}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx) &\qquad \text{(4)}\\ \vdash .(2).(4).\supset \\ \vdash :\text{Hp}(4).\supset .\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{\text{seq}} _{P}ʻ\alpha &=\overrightarrow{\text{max}}_{Q}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx)\cup \overrightarrow{\text{seq}} _{Q}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx) &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash :\text{Hp}.\alpha \in \text{sect}ʻP.\alpha &\neq CʻP.\overleftarrow{P}_{*}ʻx{\sim}\in 1.x\in \alpha .Q=P\unicode{x0294f}\overleftarrow{P}_{*}ʻx.\supset .\\ &\exists !\{\overrightarrow{\text{max}}_{Q}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx)\cup \overrightarrow{\text{seq}} _{Q}ʻ(\alpha \cap \overleftarrow{P}_{*}ʻx)\} &\qquad \text{(6)}\\ \vdash .*211·715.\supset \vdash :\text{Hp}.\overleftarrow{P}_{*}ʻx{\sim}\in 1.\alpha &=\overrightarrow{P}ʻx.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{min}}_{P}ʻ\overleftarrow{P}_{*}ʻx\\ [*205·261]&=\overrightarrow{\text{min}}(P\unicode{x0294f}\overleftarrow{P}_{*}ʻx)ʻ\overleftarrow{P}_{*}ʻx\\ [*206·14] &=\overrightarrow{\text{seq}} (P\unicode{x0294f}\overleftarrow{P}_{*}ʻx)ʻ\Lambda &\qquad \text{(7)}\\ \vdash .(7).*206·401&.\supset \vdash :\text{Hp}.\overleftarrow{P}_{*}ʻx{\sim}\in 1.\supset .\exists !\overrightarrow{\text{seq}} (P\unicode{x0294f}\overleftarrow{P}_{*}ʻx)ʻ\Lambda &\qquad \text{(8)}\\ \vdash .(6).(8).\supset \vdash \colon\ldotp \text{Hp}.\overleftarrow{P}_{*}ʻx&{\sim}\in 1.Q=P\unicode{x0294f}\overleftarrow{P}_{*}ʻx.\supset :\\ &\beta \in \text{sect}ʻQ-\iota ʻCʻQ.\supset _{\beta }.\exists !(\overrightarrow{\text{max}}_{Q}ʻ\beta \cup \overrightarrow{\text{seq}} _{Q}ʻ\beta ):\\ [*214·7] &\supset :Q\in \text{semi Ded} &\qquad \text{(9)}\\ \vdash .*214·7.*200·35.&\supset \vdash :\text{Hp}.\overleftarrow{P}_{*}ʻx\in 1.\supset .P\unicode{x0294f}\overleftarrow{P}_{*}ʻx\in \text{semi Ded} &\qquad \text{(10)}\\ \vdash .(9).(10).\supset \vdash .\text{Prop} \end{array}$

*214·75. $\begin{align}& \vdash :P\in \text{semi Ded}.P\,\,\text{smor}\,\,Q.\supset .Q\in \text{semi Ded}\\ &[*205·8.*206·61.*212·7]\end{align}$

A stretch of a series is any piece taken out of it, and not having any gaps; that is, it is a class contained in the series, and containing all terms which come between any two of its terms. Thus it is defined as $\hat{\alpha} (\alpha \subset CʻP.Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha \subset \alpha ).$

We denote the class of stretches by " $\text{str}ʻP$ ," where " $\text{str}$ " stands for "stretch" or "Strecke." A stretch which has no predecessors is a section of $P$ ; one which has no successors is a section of $\breve{P}$ . The properties of stretches are chiefly important in connection with compact series. In discrete series, stretches are the same as intervals.

If $P$ is transitive, stretches of $P$ are the products of sections of $P$ and sections of $\breve{P}$ , i.e. of upper and lower sections of $P$ (*215·16). If $P$ is connected, and $\alpha$ is a lower section, $\beta$ an upper section, then if the two have a stretch $\alpha \cap \beta$ in common, we have $\alpha =Pʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ).\beta =\breve{P} ʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ) \quad(*215·161).$ A slightly more general form of this proposition is

*215·165. $\begin{align}&\vdash :P_{\text{po}}\in \text{connex} .\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\exists !\alpha \cap \beta .\supset .\\ &\alpha =P_{*}ʻʻ(\alpha \cap \beta ).\beta =\breve{P} _{*}ʻʻ(\alpha \cap \beta ).Pʻʻ\alpha =P_{\text{po}}ʻʻ(\alpha \cap \beta ).\breve{P} ʻʻ\beta =\breve{P} _{\text{po}}ʻʻ(\alpha \cap \beta )\end{align}$

A specially important case is when $\alpha$ and $\beta$ have just one term in common. In this case we have

*215·166. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cap \beta \in 1.\supset .\\ &\alpha \cap \beta =\iota ʻ\text{max}_{P}ʻ\alpha =\iota ʻ\text{min}_{P}ʻ\beta\end{align}$

When $\alpha \cap \beta$ has more than one term, if the upper limit or maximum of $\alpha$ and the lower limit or minimum of $\beta$ both exist, the latter precedes the former (*215·52); if $\alpha$ and $\beta$ have no common part, but together exhaust the field of $P$ , we have either $\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta$ or $\text{limax}_Pʻ\alpha P_{1}\text{limin}_Pʻ\beta$ , assuming $\text{E}!\text{limax}_Pʻ\alpha .\text{E}!\text{limin}_Pʻ\beta$ (*215·54). Hence if $\text{limax}_Pʻ\alpha$ has no immediate successor, it must be identical with $\text{limin}_Pʻ\beta$ . Thus we have

*215·543. $\begin{align}\vdash :P\in \text{Ser}.&\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cup \beta =CʻP.\alpha \cap \beta \in 0\cup 1.\\ &\text{E}!\text{limax}_Pʻ\alpha .\text{limax}_Pʻ\alpha {\sim}\in \text{D}ʻP_{1}.\supset .\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta\end{align}$

*215·01. $\text{str}ʻP=\hat{\alpha} (\alpha \subset CʻP.Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha \subset \alpha ) \quad\text{Df}$

*215·1. $\vdash :\alpha \in \text{str}ʻP.\equiv .\alpha \subset CʻP.Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha \subset \alpha \quad[(*215·01)]$

*215·11. $\vdash .\text{str}ʻP=\text{str}ʻ\breve{P} \quad[(*215·01).*33·22]$

*215·13. $\vdash .\text{sect}ʻP\subset \text{str}ʻP.\text{sect}ʻ\breve{P} \subset \text{str}ʻP \quad[*215·1.*211·1]$

*215·14. $\vdash :\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\supset .\alpha \cap \beta \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*211·1.\supset \vdash :\text{Hp}.&\supset .\alpha \subset CʻP.Pʻʻ\alpha \subset \alpha .\breve{P} ʻʻ\beta \subset \beta .\\ [*22·43.*37·21] &\supset .\alpha \cap \beta \subset CʻP.Pʻʻ(\alpha \cap \beta )\subset \alpha .\breve{P} ʻʻ(\alpha \cap \beta )\subset \beta .\\ [*22·49] &\supset .\alpha \cap \beta \subset CʻP.Pʻʻ(\alpha \cap \beta )\cap \breve{P} ʻʻ(\alpha \cap \beta )\subset \alpha \cap \beta .\\ [*215·1] &\supset .\alpha \cap \beta \in \text{str}ʻP:\supset \vdash .\text{Prop} \end{array}$

*215·15. $\begin{align}&\vdash :P\in \text{trans}.\alpha \in \text{str}ʻP.\supset .\alpha \cup Pʻʻ\alpha \in \text{sect}ʻP.\alpha \cup \breve{P} ʻʻ\alpha \in \text{sect}ʻ\breve{P} .\\ &\alpha =(\alpha \cup Pʻʻ\alpha )\cap (\alpha \cup \breve{P} ʻʻ\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·27.*215·1.\supset \vdash :\text{Hp}.&\supset .\alpha \cup Pʻʻ\alpha \in \text{sect}ʻP.\alpha \cup \breve{P} ʻʻ\alpha \in \text{sect}ʻ\breve{P} &\qquad \text{(1)}\\ \vdash .*215·1.*22·62. \supset \vdash :\text{Hp}.\supset .\alpha &=\alpha \cup (Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha )\\ [*22·69] &=(\alpha \cup Pʻʻ\alpha )\cap (\alpha \cup \breve{P} ʻʻ\alpha ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*215·16. $\begin{align}\vdash :P\in \text{trans}.\supset .\text{str}ʻP=\hat{\gamma} \{(\exists \alpha ,\beta ).\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\gamma &=\alpha \cap \beta\}\\ &=sʻ\{(\text{sect}ʻP)\cap_{,,} ʻʻ\text{sect}ʻ\breve{P}\}\\ [*215·14·15.*40·7]\end{align}$

*215·161. $\begin{align}\vdash :P\in \text{connex} .&\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\exists !\alpha \cap \beta .\supset .\\ &\alpha =Pʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ).\beta =\breve{P} ʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·1.*37·2.&\supset \vdash :\text{Hp}.\supset .Pʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta )\subset \alpha &\qquad \text{(1)}\\ \vdash .*211·702. \supset \vdash \colon\ldotp \text{Hp}.x\in \alpha -\beta .&\supset :y\in \beta .\supset .xPy:\\ [*37·1] &\supset :\exists !(\alpha \cap \beta ).\supset .x\in Pʻʻ(\alpha \cap \beta ) &\qquad \text{(2)}\\ \vdash .(2). & \supset \vdash :\text{Hp}.x\in \alpha .\supset .x\in Pʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ) &\qquad \text{(3)}\\ \vdash .(1).(3).&\supset \vdash :\text{Hp}.\supset .\alpha =Pʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ) &\qquad \text{(4)}\\ \vdash .(4)\frac{\breve{P}}{P}.&\supset \vdash :\text{Hp}.\supset \beta =\breve{P} ʻʻ(\alpha \cap \beta )\cup (\alpha \cap \beta ) &\qquad \text{(5)}\\ \vdash .(4).(5).&\supset \vdash .\text{Prop} \end{array}$

*215·162. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .\alpha \in &\text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\exists !\alpha \cap \beta .\supset .\\ &Pʻʻ\alpha =Pʻʻ(\alpha \cap \beta ).\breve{P} ʻʻ\beta =\breve{P} ʻʻ(\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*215·161.\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha &=PʻʻPʻʻ(\alpha \cap \beta )\cup Pʻʻ(\alpha \cap \beta )\\ [*201·5] & =Pʻʻ(\alpha \cap \beta ) &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\breve{P} ʻʻ\beta =\breve{P} ʻʻ(\alpha \cap \beta ) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*215·163. $\begin{align}\vdash :P\in \text{trans}\cap \text{connex} .\alpha \in \text{sect}ʻP.\beta \in &\text{sect}ʻ\breve{P} .\exists !\alpha \cap \beta .\supset .\\ &pʻ\overleftarrow{P}ʻʻ\alpha =pʻ\overleftarrow{P}ʻʻ(\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*40·16. &\supset \vdash .pʻ\overleftarrow{P}ʻʻ\alpha \subset pʻ\overleftarrow{P}ʻʻ(\alpha \cap \beta ) &\qquad \text{(1)}\\ \vdash .*10·56.*37·1.&\supset \vdash \colon\ldotp \text{Hp}:y\in \alpha \cap \beta .\supset _{y}.yPx:z\in Pʻʻ(\alpha \cap \beta ):\supset .zPx &\qquad \text{(2)}\\ \vdash .(2).*215·161.&\supset \vdash \colon\ldotp \text{Hp}:y\in \alpha \cap \beta .\supset _{y}.yPx:\supset :z\in \alpha .\supset _{z}.zPx &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*215·164. $\begin{align}\vdash :\text{Hp}*215·162.\supset .&\overrightarrow{\text{min}}_{P}ʻ\beta =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ).\overrightarrow{\text{max}}_{P}ʻ\alpha =\overrightarrow{\text{max}}_{P}ʻ(\alpha \cap \beta ).\\ &\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cap \beta ).\overrightarrow{\text{prec}} _{P}ʻ\beta =\overrightarrow{\text{prec}} _{P}ʻ(\alpha \cap \beta ).\\ &\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cap \beta ).\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{limax}} _{P}ʻ(\alpha \cap \beta )\end{align}$

Dem. $\begin{array}{l} \vdash .*215·162. \supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}} _{P}ʻ\alpha &=\alpha -Pʻʻ(\alpha \cap \beta )\\ [*215·161] &=\alpha \cap \beta -Pʻʻ(\alpha \cap \beta )\\ [*205·111] &=\overrightarrow{\text{max}}_{P}ʻ(\alpha \cup \beta ) &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ\beta =\overrightarrow{\text{min}}_{P}ʻ(\alpha \cap \beta ) &\qquad \text{(2)}\\ \vdash .*215·163.*206·13. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{seq}} _{P}ʻ\alpha =\overrightarrow{\text{seq}} _{P}ʻ(\alpha \cap \beta ) &\qquad \text{(3)}\\ \text{Similarly}\quad & \vdash :\text{Hp}.\supset .\overrightarrow{\text{prec}} _{P}ʻ\beta =\overrightarrow{\text{prec}} _{P}ʻ(\alpha \cap \beta ) &\qquad \text{(4)}\\ \vdash .(1).(3).*207·11·12.&\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{lt}} _{P}ʻ\alpha =\overrightarrow{\text{lt}} _{P}ʻ(\alpha \cap \beta ) &\qquad \text{(5)}\\ \vdash .(1).(5).*207·45. &\supset \vdash :\text{Hp}.\supset .\overrightarrow{\text{limax}} _{P}ʻ\alpha =\overrightarrow{\text{limax}} _{P}ʻ(\alpha \cap \beta ) &\qquad \text{(6)}\\ \vdash .(1).(2).(3).(4).(5).(6).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*211·17.\supset \vdash :\text{Hp}.&\supset .\alpha \in \text{sect}ʻP_{\text{po}}.\beta \in \text{sect}ʻ\breve{P} _{\text{po}}.\exists !\alpha \cap \beta .\\ [*215·161] &\supset .\alpha =P_{*}ʻʻ(\alpha \cap \beta ).\beta =\breve{P} _{*}ʻʻ(\alpha \cap \beta ). &\qquad \text{(1)}\\ [*91·52] & \supset .Pʻʻ\alpha =P_{\text{po}}ʻʻ(\alpha \cap \beta ).\breve{P} ʻʻ\beta =\breve{P} _{\text{po}}ʻʻ(\alpha \cap \beta )&\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*215·166. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.\alpha \in \text{sect}ʻP.\beta \in &\text{sect}ʻ\breve{P} .\alpha \cap \beta \in 1.\supset .\\ &\alpha \cap \beta = \iota ʻ\text{max}_{P}ʻ\alpha = \iota ʻ\text{min}_{P}ʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*215·161.*211·17.\supset \vdash :\text{Hp}.&\supset .\alpha = (\alpha \cap \beta )\cup P_{\text{po}}ʻʻ(\alpha \cap \beta ).\\ [*215·165] &\supset .\alpha -Pʻʻ\alpha = (\alpha \cap \beta )-P_{\text{po}}ʻʻ(\alpha \cap \beta ).\\ [*205·11] \supset .\overrightarrow{\text{max}}_{P}ʻ\alpha &= \overrightarrow{\text{max}}(P_{\text{po}})ʻ(\alpha \cap \beta )\\ [*205·17] & = \alpha \cap \beta &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\overrightarrow{\text{min}}_{P}ʻ\beta = \alpha \cap \beta &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*215·17. $\vdash :P\in \text{trans}.\supset .\breve{P} ʻʻ\alpha \cap Pʻʻ\beta \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*211·15·11.\supset \vdash :\text{Hp}.\supset .Pʻʻ\beta \in \text{sect}ʻP.\breve{P} ʻʻ\alpha \in \text{sect}ʻ\breve{P} &\qquad \text{(1)}\\ \vdash .(1).*215·14.\supset \vdash .\text{Prop} \end{array}$

*215·18. $\vdash .P(x\vdash\dashv y),P(x\unicode{x27dd} y),P(x\dashv y),P(x-y)\in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*211·13·3.&\supset \vdash .\overrightarrow{P}_{*}ʻy\in \text{sect}ʻP.\overleftarrow{P}_{*}ʻx\in \text{sect}ʻ\breve{P} &\qquad \text{(1)}\\ \vdash .*211·16. &\supset \vdash .\overrightarrow{P}_{\text{po}}ʻy\in \text{sect}ʻP.\overleftarrow{P}_{\text{po}}ʻx\in \text{sect}ʻ\breve{P} &\qquad \text{(2)}\\ \vdash .(1).(2).*215·14.\supset \vdash .\text{Prop} \end{array}$

*215·19. $\vdash :P^{2}\,\unicode{x2abd}\, J.x\in CʻP.\supset .\iota ʻx\in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*53·301. &\supset \vdash .Pʻʻ\iota ʻx\cap \breve{P} ʻʻ\iota ʻx = \overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx &\qquad \text{(1)}\\ \vdash .(1).*50·43.&\supset \vdash .:\text{Hp}.\supset .Pʻʻ\iota ʻx\cap \breve{P} ʻʻ\iota ʻx = \Lambda &\qquad \text{(2)}\\ \vdash .(2).*215·1.&\supset \vdash .\text{Prop} \end{array}$

*215·2. $\begin{align}\vdash :P\in \text{connex} .\alpha \in \text{str}ʻP.x\in \alpha .\supset .&Pʻʻ\alpha = \alpha -\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{P}ʻx.\\ &\breve{P} ʻʻ\alpha = \alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha \cup \overleftarrow{P}ʻx\end{align}$

Dem. $\begin{array}{l} \vdash .*205·111.&\supset \vdash .\alpha -\overrightarrow{\text{max}}_{P}ʻ\alpha \subset Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*37·18 . &\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻx\subset Pʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2). &\supset \vdash :\text{Hp}.\supset .\alpha -\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{P}ʻx\subset Pʻʻ\alpha &\qquad \text{(3)}\\ \vdash .*202·103.&\supset \vdash \colon\ldotp \text{Hp}.y\in Pʻʻ\alpha .\supset :y\in \overrightarrow{P}ʻx\cup \iota ʻx\cup \overleftarrow{P}ʻx:\\ [*37·181] &\supset :y\in \overrightarrow{P}ʻx\cup \iota ʻx.\lor.y\in \breve{P} ʻʻ\alpha :\\ [*4·73] &\supset :y\in \overrightarrow{P}ʻx\cup \iota ʻx.\lor.y\in Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha :\\ [*215·1] &\supset :y\in \overrightarrow{P}ʻx\cup \iota ʻx\cup \alpha :\\ [\text{Hp}] &\supset :y\in \overrightarrow{P}ʻx\cup \alpha &\qquad \text{(4)}\\ \vdash .*205·111.&\supset \vdash .y\in Pʻʻ\alpha .\supset .y{\sim}\in \overrightarrow{\text{max}}_{P}ʻ\alpha &\qquad \text{(5)}\\ \vdash .(4).(5). &\supset \vdash :\text{Hp}.y\in Pʻʻ\alpha .\supset .y\in \alpha -\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{P}ʻx &\qquad \text{(6)}\\ \vdash .(3).(6). &\supset \vdash :\text{Hp}.\supset .Pʻʻ\alpha =\alpha -\overrightarrow{\text{max}}_{P}ʻ\alpha \cup \overrightarrow{P}ʻx &\qquad \text{(7)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\breve{P} ʻʻ\alpha =\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha \cup \overleftarrow{P}ʻx &\qquad \text{(8)}\\ \vdash .(7).(8).\supset \vdash .\text{Prop} \end{array}$

*215·21. $\vdash :P\in \text{connex} .\alpha ,\beta \in \text{str}ʻP.\exists !\alpha \cap \beta .\supset .\alpha \cap \beta \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*215·2.&\supset \vdash :\text{Hp}.\supset .(\exists x).x\in \alpha \cap \beta .Pʻʻ\alpha \subset \alpha \cup \overrightarrow{P}ʻx.Pʻʻ\beta \subset \beta \cup \overrightarrow{P}ʻx.\\ &\breve{P} ʻʻ\alpha \subset \alpha \cup \overleftarrow{P}ʻx.\breve{P} ʻʻ\beta \subset \beta \cup \overleftarrow{P}ʻx.\\ [*22·68]&\supset .(\exists x).x\in \alpha \cap \beta .Pʻʻ\alpha \cap Pʻʻ\beta \subset (\alpha \cap \beta )\cup \overrightarrow{P}ʻx.\\ &\breve{P} ʻʻ\alpha \cap \breve{P} ʻʻ\beta \subset (\alpha \cap \beta )\cup \overleftarrow{P}ʻx.\\ [*37·21]&\supset .(\exists x).x\in \alpha \cap \beta .Pʻʻ(\alpha \cap \beta )\subset (\alpha \cap \beta )\cup \overrightarrow{P}ʻx.\breve{P} ʻʻ(\alpha \cap \beta )\subset (\alpha \cap \beta )\cup \overleftarrow{P}ʻx.\\ [*22·69]&\supset .(\exists x).x\in \alpha \cap \beta .Pʻʻ(\alpha \cap \beta )\cap \breve{P} ʻʻ(\alpha \cap \beta )\subset (\alpha \cap \beta )\cup (\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx) &\qquad \text{(1)}\\ \vdash .*37·18.\supset \vdash :x\in \alpha \cap \beta .&\supset .\overrightarrow{P}ʻx\subset Pʻʻ\alpha \cap Pʻʻ\beta .\overleftarrow{P}ʻx\subset \breve{P} ʻʻ\alpha \cap \breve{P} ʻʻ\beta .\\ [*22·49] &\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx\subset Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha \cap Pʻʻ\beta \cap \breve{P} ʻʻ\beta &\qquad \text{(2)}\\ \vdash .(2).*215·1.&\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in \alpha \cap \beta .\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx\subset \alpha \cap \beta &\qquad \text{(3)}\\ \vdash .(1).(3). \supset \vdash :\text{Hp}.&\supset .(\exists x).x\in \alpha \cap \beta .Pʻʻ(\alpha \cap \beta )\cap \breve{P} ʻʻ(\alpha \cap \beta )\subset \alpha \cap \beta .\\ [*215·1] &\supset .\alpha \cap \beta \in \text{str}ʻP:\supset \vdash .\text{Prop} \end{array}$

*215·22. $\vdash :\alpha ,\beta \in \text{str}ʻP.\supset .\alpha \cap \beta \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*215·1.\supset \vdash :\text{Hp}.&\supset .\alpha \subset CʻP.\beta \subset CʻP.Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha \subset \alpha .Pʻʻ\beta \cap \breve{P} ʻʻ\beta \subset \beta .\\ [*22·47·49] &\supset .\alpha \cap \beta \subset CʻP.Pʻʻ\alpha \cap Pʻʻ\beta \cap \breve{P} ʻʻ\alpha \cap \breve{P} ʻʻ\beta \subset \alpha \cap \beta .\\ [*37·21] & \supset .\alpha \cap \beta \subset CʻP.Pʻʻ(\alpha \cap \beta )\cap \breve{P} ʻʻ(\alpha \cap \beta )\subset \alpha \cap \beta .\\ [*215·1] &\supset .\alpha \cap \beta \in \text{str}ʻP:\supset \vdash .\text{Prop} \end{array}$

*215·23. $\vdash :P\in \text{connex} .\mu \subset \text{str}ʻP.\exists !pʻ\mu .\supset .sʻ\mu \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*215·2.\supset \vdash \colon\ldotp \text{Hp}.x\in pʻ\mu .&\supset :\alpha \in \mu .\supset _{\alpha }.Pʻʻ\alpha \subset \alpha \cup \overrightarrow{P}ʻx.\breve{P} ʻʻ\alpha \subset \alpha \cup \overleftarrow{P}ʻx:\\ [*40·13] &\supset :\alpha \in \mu .\supset _{\alpha }.Pʻʻ\alpha \subset sʻ\mu \cup \overrightarrow{P}ʻx.\breve{P} ʻʻ\alpha \subset sʻ\mu \cup \overleftarrow{P}ʻx:\\ [*40·43·38] &\supset :Pʻʻsʻ\mu \subset sʻ\mu \cup \overrightarrow{P}ʻx.\breve{P} ʻʻsʻ\mu \subset sʻ\mu \cup \overleftarrow{P}ʻx:\\ [*22·49·69] &\supset :Pʻʻsʻ\mu \cap \breve{P} ʻʻsʻ\mu \subset sʻ\mu \cup (\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx) &\qquad \text{(1)}\\ \vdash .*40·14.\supset \vdash :\text{Hp}.x\in pʻ\mu .\alpha \in \mu .&\supset .x\in \alpha .\alpha \in \text{str}ʻP.\\ [*37·18] &\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx\subset Pʻʻ\alpha \cap \breve{P} ʻʻ\alpha .\alpha \in \text{str}ʻP.\\ [*215·1] &\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx\subset \alpha .\\ [*40·13] &\supset .\overrightarrow{P}ʻx\cap \overleftarrow{P}ʻx\subset sʻ\mu &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{Hp}.\exists !\mu .\supset .P ʻʻsʻ\mu \cap \breve{P} ʻʻsʻ\mu \subset sʻ\mu &\qquad \text{(3)}\\ \vdash .*37·29. &\supset \vdash :\mu =\Lambda .\supset .P ʻʻsʻ\mu \cap \breve{P} ʻʻsʻ\mu \subset sʻ\mu &\qquad \text{(4)}\\ \vdash .(3).(4).&\supset \vdash .\text{Prop} \end{array}$

*215·24. $\vdash :\mu \subset \text{str}ʻP.\supset .CʻP\cap pʻ\mu \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*37·265.&\supset \vdash .P ʻʻ(pʻ\mu \cap CʻP)\cap \breve{P} ʻʻ(pʻ\mu \cap CʻP)=P ʻʻpʻ\mu \cap \breve{P} ʻʻpʻ\mu &\qquad \text{(1)}\\ \vdash .*37·2. &\supset \vdash :\alpha \in \mu .\supset .Pʻʻpʻ\mu \cap \breve{P} ʻʻpʻ\mu \subset P ʻʻ\alpha \cap \breve{P} ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(2).*215·1.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \mu .\supset .Pʻʻpʻ\mu \cap \breve{P} ʻʻpʻ\mu \subset \alpha :\\ [*40·15] &\supset :Pʻʻpʻ\mu \cap \breve{P} ʻʻpʻ\mu \subset pʻ\mu &\qquad \text{(3)}\\ \vdash .(1).(3).*215·1.\supset \vdash .\text{Prop} \end{array}$

*215·25. $\vdash :\mu \subset \text{str}ʻP.\exists !\mu .\supset .pʻ\mu \in \text{str}ʻP$

Dem. $\begin{array}{l} \vdash .*40·24.*215·1.\supset \vdash :\text{Hp}.\supset .pʻ\mu \subset CʻP &\qquad \text{(1)}\\ \vdash .(1).*215·24.\supset \vdash .\text{Prop} \end{array}$

*215·3. $\begin{align}\vdash \colon\ldotp P\in &\text{connex} .\alpha ,\beta \in \text{str}ʻP-{℩}ʻ\Lambda .\alpha \cap \beta =\Lambda .\supset :\\ &\alpha \subset Pʻʻ\beta .\equiv .\alpha \subset pʻ\overrightarrow{P}ʻʻ\beta .\equiv .\beta \subset pʻ\overleftarrow{P}ʻʻ\alpha .\equiv .\beta \subset \breve{P} ʻʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*215·1.&\supset \vdash :\text{Hp}.\supset .\alpha \subset CʻP-\beta &\qquad \text{(1)}\\ \vdash .*22·48.&\supset \vdash :\alpha \subset P ʻʻ\beta .\supset .\alpha \cap \breve{P} ʻʻ\beta \subset Pʻʻ\beta \cap \breve{P} ʻʻ\beta :\\ [*215·1] \supset \vdash :\text{Hp}.\alpha \subset Pʻʻ\beta .&\supset .\alpha \cap \breve{P} ʻʻ\beta \subset \beta .\\ [*22·621.\text{Hp}] &\supset .\alpha \cap \breve{P} ʻʻ\beta =\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash :\text{Hp}.\alpha \subset P ʻʻ\beta .&\supset .\alpha \subset CʻP-\beta -\breve{P} ʻʻ\beta .\\ [*202·501] &\supset .\alpha \subset pʻ\overrightarrow{P}ʻʻ\beta &\qquad \text{(3)}\\ \vdash .*40·61. &\supset \vdash \colon\ldotp \text{Hp}.\alpha \subset pʻ\overrightarrow{P} ʻʻ\beta .\supset .\alpha \subset Pʻʻ\beta &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \subset Pʻʻ\beta .&\equiv .\alpha \subset pʻ\overrightarrow{P}ʻʻ\beta . &\qquad \text{(5)}\\ [*40·67] &\equiv .\beta \subset pʻ\overleftarrow{P}ʻʻ\alpha .&\qquad \text{(6)}\\ \left[(5) \frac{\breve{P}}{P}\right] & \equiv .\beta \subset \breve{P} ʻʻ\alpha &\qquad \text{(7)}\\ \vdash .(5).(6).(7).\supset \vdash .\text{Prop} \end{array}$

*215·31. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\alpha \in \text{str}ʻP.\text{E}!&\text{min}_{P}ʻ\alpha .\text{E}!\text{max}_{P}ʻ\alpha .\supset .\\ &\alpha = P(\text{min}_{P}ʻ\alpha \vdash\dashv \text{max}_{P}ʻ\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*205·2.*90·15·151.&\supset \vdash :\text{Hp}.y\in \alpha .\supset .\text{min}_{P}ʻ\alpha P_{*}y &\qquad \text{(1)}\\ \vdash .(1)\frac{\breve{P}}{P}.*205·102. &\supset \vdash :\text{Hp}.y\in \alpha .\supset .yP_{*}\text{max}_{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*121·103. &\supset \vdash :\text{Hp}.\supset .\alpha \subset P(\text{min}_{P}ʻ\alpha \vdash\dashv \text{max}_{P}ʻ\alpha ) &\qquad \text{(3)}\\ \vdash .*121·242.*201·19.*205·2.\supset \vdash :\text{Hp}.\supset .\\ P(\text{min}_{P}ʻ\alpha \vdash\dashv \text{max}_{P}ʻ\alpha )&=\iota ʻ\text{min}_{P}ʻ\alpha \cup (\overleftarrow{P}ʻ\text{min}_{P}ʻ\alpha \cap \overrightarrow{P}ʻ\text{max}_{P}ʻ\alpha )\cup \iota ʻ\text{max}_{P}ʻ\alpha\\ [*37·18] &\subset \iota ʻ\text{min}_{P}ʻ\alpha \cup (\breve{P} ʻʻ\alpha \cap Pʻʻ\alpha )\cup \iota ʻ\text{max}_{P}ʻ\alpha \\ [*205·11·111.*215·1] &\subset \alpha &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*215·32. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .\alpha \in \text{str}ʻP.\text{E}!&\text{min}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\alpha=P(\text{min}_{P}ʻ\alpha \vdash \text{seq}_{P}ʻ\alpha )\end{align}$

Dem. $\begin{array}{l} \vdash .*206·211.*205·2.\supset \vdash :\text{Hp}.&\supset .\alpha \subset \overleftarrow{P}_{*}ʻ\text{min}_{P}ʻ\alpha \cap \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*206·22.*205·22.\supset \vdash :\text{Hp}.&\supset .\overleftarrow{P}ʻ\text{min}_{P}ʻ\alpha \cap \overrightarrow{P}ʻ\text{seq}_{P}ʻ\alpha =\breve{P} ʻʻ\alpha \cap (\alpha \cup Pʻʻ\alpha )\\ [*215·1] &\subset \alpha .\\ [*201·19.*121·241] &\supset .P(\text{min}_{P}ʻ\alpha \vdash \text{seq}_{P}ʻ\alpha )\subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*215·33. $\begin{align}\vdash :P\in \text{trans} \cap \text{connex} .&\alpha \in \text{str}ʻP.\text{E}!\text{prec}_{P}ʻ\alpha .\text{E}!\text{seq}_{P}ʻ\alpha .\supset .\\ &\alpha =P(\text{prec}_{P}ʻ\alpha -\text{seq}_{P}ʻ\alpha ) \quad[*206·22.*215·1]\end{align}$

*215·4. $\vdash :P\in \text{connex} .\mu \in \text{Cl excl}ʻ(\text{str}ʻP-\iota ʻ\Lambda ).\supset .P_{\text{cl}}\unicode{x0294f}\mu =P_{\text{lc}}\unicode{x0294f}\mu$

Dem. $\begin{array}{l} \vdash .*84·12.\supset \vdash \colon\ldotp \text{Hp}.&\supset :\alpha ,\beta \in \mu .\alpha \neq \beta .\supset .\alpha \cap \beta =\Lambda : &\qquad \text{(1)}\\ [*170·1] \supset :\alpha (P_{\text{cl}}\unicode{x0294f}\mu )\beta .&\equiv .\alpha ,\beta \in \mu .\exists !\alpha -\breve{P} ʻʻ\beta .\\ [*215·3.\text{Transp}] &\equiv .\alpha ,\beta \in \mu .\exists !\beta -Pʻʻ\alpha .\\ [(1).*170·102] &\equiv .\alpha ,\beta \in \mu .\alpha P_{\text{lc}}\mu \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*215·41. $\vdash :P\in \text{trans} \cap \text{connex} .\mu \in \text{Cl excl}ʻ(\text{str}ʻP-\iota ʻ\Lambda ).\supset .P_{\text{lc}}\unicode{x0294f}\mu \in \text{Ser}$

Dem. $\begin{array}{l} \vdash .*84·12.*170·102.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha (P_{\text{lc}}\unicode{x0294f}\mu )\beta .\equiv .\exists !\beta -Pʻʻ\alpha &\qquad \text{(1)}\\ \vdash .*215·3.\supset \\ \vdash :\text{Hp}.\alpha ,\beta \in \mu .\alpha \subset Pʻʻ\beta .\beta \subset Pʻʻ\alpha .&\supset .\alpha \subset Pʻʻ\beta .\alpha \subset \breve{P} ʻʻ\beta .\\ [*215·1] &\supset .\alpha \subset \beta &\qquad \text{(2)}\\ \text{Similarly}\quad &\vdash :\text{Hp}(2).\supset .\beta \subset \alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash \colon\colon\text{Hp}.\alpha ,\beta \in \mu .&\supset \colon\ldotp \alpha \subset Pʻʻ\beta .\beta \subset Pʻʻ\alpha .\supset .\alpha =\beta \colon\ldotp \\ [\text{Transp}.(1)] & \supset \colon\ldotp \alpha \neq \beta .\supset :\alpha (P_{\text{lc}}\unicode{x0294f}\mu )\beta .\lor.\beta (P_{\text{lc}}\unicode{x0294f}\mu )\alpha &\qquad \text{(4)}\\ \vdash .*37·1.\supset \\ \vdash \colon\colon \text{Hp}.\beta \cap \gamma =\Lambda .{\sim}(\gamma \subset Pʻʻ\beta ).&\supset \colon\ldotp (\exists z):z\in \gamma :y\in \beta .\supset _{y}.{\sim}(zPy).z\neq y\colon\ldotp \\ [*202·103] &\supset \colon\ldotp (\exists z):z\in \gamma :y\in \beta .\supset _{y}.yPz\colon\ldotp \\ [*11·61] & \supset \colon\ldotp y\in \beta .\supset _{y}.(\exists z).z\in \gamma .yPz\colon\ldotp \\ [*37·1] &\supset \colon\ldotp \beta \subset Pʻʻ\gamma \colon\ldotp \\ [*201·5.*37·2] &\supset \colon\ldotp \gamma \subset Pʻʻ\alpha .\supset .\beta \subset Pʻʻ\alpha \colon\ldotp \\ [\text{Transp}] &\supset \colon\ldotp \exists !\beta -Pʻʻ\alpha .\supset .\exists !\gamma -Pʻʻ\alpha &\qquad \text{(5)}\\ \vdash .(5).(1).&\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha (P_{\text{lc}}\unicode{x0294f}\mu )\beta ·\beta (P_{\text{lc}}\unicode{x0294f}\mu )\gamma .\supset .\alpha (P_{\text{lc}}\unicode{x0294f}\mu )\gamma &\qquad \text{(6)}\\ \vdash .(4).(6).*170·17.\supset \vdash .\text{Prop} \end{array}$

*215·42. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .\mu \in \text{Cl excl}ʻ(\text{str}ʻP-{℩}ʻ\Lambda ).\mu {\sim}\in 1.\supset .CʻP_{\text{lc}}\unicode{x0294f}\mu =\mu \\ &[*202·55.*215·41]\end{align}$

*215·5. $\begin{align}&\vdash \colon\ldotp P\in \text{trans}\cap \text{connex} .\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\supset :\\ &\exists !\alpha \cap \beta .\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta .\supset .\alpha \cap \beta \in 1 \quad[*207·71.*215·164]\end{align}$

*215·51. $\begin{align}\vdash :P\in \text{Ser}.\alpha \in &\text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cap \beta \in 1.\supset .\\ &\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta =\breve{{℩}} ʻ(\alpha \cap \beta ) \quad[*207·72.*215·164]\end{align}$

*215·52. $\begin{align}\vdash :\text{Hp}*215·5.\alpha \cap \beta {\sim}\in 0\cup 1.\text{E}!\text{limax}_Pʻ\alpha .\text{E}!&\text{limin}_Pʻ\beta .\supset .\\ &\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*215·164.\supset \vdash \colon\ldotp \text{Hp}.\supset :\text{limax}_Pʻ\alpha &=\text{max}_{P}ʻ(\alpha \cap \beta ).\lor.\text{limax}_Pʻ\alpha =\text{seq}_{P}ʻ(\alpha \cap \beta ):\\ &\text{limin}_Pʻ\beta =\text{min}_{P}ʻ(\alpha \cap \beta ).\lor.\text{limin}_Pʻ\beta =\text{prec}_{P}ʻ(\alpha \cap \beta ) &\qquad \text{(1)}\\ \vdash .*205·732.\supset \vdash :\text{Hp}.\text{limax}_Pʻ\alpha =\text{max}_{P}ʻ(\alpha \cap \beta ).&\text{limin}_Pʻ\beta =\text{min}_{P}ʻ(\alpha \cap \beta ).\supset .\\ &\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha &\qquad \text{(2)}\\ \vdash .*206·15. \supset \vdash :\text{Hp}.\text{limax}_Pʻ\alpha =\text{seq}_{P}ʻ(\alpha \cap \beta ).&\text{limin}_Pʻ\beta =\text{min}_{P}ʻ(\alpha \cap \beta ).\supset .\\ &\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha &\qquad \text{(3)}\\ \vdash .(3)\frac{\breve{P},\,\beta,\,\alpha}{P,\,\alpha,\,\beta}.\supset \vdash :\text{Hp}.\text{limax}_Pʻ\alpha =\text{max}_{P}ʻ(\alpha \cap \beta ).&\text{limin}_Pʻ\beta =\text{prec}_{P}ʻ(\alpha \cap \beta ).\supset .\\ &\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha &\qquad \text{(4)}\\ \vdash .*206·73. \supset \vdash :\text{Hp}.\text{limax}_Pʻ\alpha =\text{seq}_{P}ʻ(\alpha \cap \beta ).&\text{limin}_Pʻ\beta =\text{prec}_{P}ʻ(\alpha \cap \beta ).\supset .\\ &\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha &\qquad \text{(5)}\\ \vdash .(1).(2).(3).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*215·53. $\begin{align}\vdash :\text{Hp}*215·5.\alpha \cap \beta =\Lambda .\text{E}!\text{limax}_Pʻ\alpha .\text{E}!&\text{limin}_Pʻ\beta .\supset .\\ &\text{limax}_Pʻ\alpha P_{*}\text{limin}_Pʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*207·2.*205·22.\supset \vdash :\text{Hp}.&\supset .\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha \subset Pʻʻ\alpha .\overleftarrow{P}ʻ\text{limin}_Pʻ\beta \subset \breve{P} ʻʻ\beta .\\ [*211·1] &\supset .\overrightarrow{P}ʻ\text{limax}_Pʻ\alpha \subset Pʻʻ\alpha .\overleftarrow{P}ʻ\text{limin}_Pʻ\beta \subset \beta &\qquad \text{(1)}\\ \vdash .(1).*37·1.\supset \vdash :\text{Hp}.\text{limin}_Pʻ\beta P\text{limax}_Pʻ\alpha .&\supset .(\exists x).x\in \alpha .\text{limin}_Pʻ\beta Px.\\ [(1)] &\supset .\exists !\alpha \cap \beta &\qquad \text{(2)}\\ \vdash .(2).\text{Transp}.\supset \vdash .\text{Prop} \end{array}$

*215·54. $\begin{align}\vdash :P&\in \text{Ser}.\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cap \beta =\Lambda .\alpha \cup \beta =CʻP.\\ &\text{E}!\text{limax}_Pʻ\alpha .\text{E}!\text{limin}_Pʻ\beta .\supset :\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta .\lor.\\ &\text{limax}_Pʻ\alpha P_{1}\text{limin}_Pʻ\beta\end{align}$

Dem. $\begin{array}{l} \vdash .*211·726.\supset \vdash :\text{Hp}.\text{E}!&\text{max}_{P}ʻ\alpha .\text{E}!\text{min}_{P}ʻ\beta .\supset .\\ &\text{limax}_Pʻ\alpha =\text{max}_{P}ʻ\alpha .\text{limin}_Pʻ\beta =\text{seq}_{P}ʻ\alpha .\\ [*206·5] &\supset .\text{limax}_Pʻ\alpha P_{1}\text{limin}_Pʻ\beta &\qquad \text{(1)}\\ \vdash .*211·726.\supset \vdash :\text{Hp}.{\sim}\text{E}!&\text{max}_{P}ʻ\alpha .\supset .\\ &\text{limax}_Pʻ\alpha =\text{min}_{P}ʻ\beta .\text{limin}_Pʻ\beta =\text{min}_{P}ʻ\beta &\qquad \text{(2)}\\ \vdash .*211·726.\supset \vdash :\text{Hp}.{\sim}\text{E}!\text{min}_{P}ʻ&\beta .\supset .\\ &\text{limax}_Pʻ\alpha =\text{max}_{P}ʻ\alpha .\text{limin}_Pʻ\beta =\text{max}_{P}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*215·541. $\begin{align}&\vdash \colon\colon P\in \text{Ser}.\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cup \beta =CʻP.\supset \colon\ldotp \\ &\alpha \cap \beta \in 0\cup 1.\supset :\text{E}!\text{limax}_Pʻ\alpha .\equiv .\text{E}!\text{limin}_Pʻ\beta \quad[*211·727.*215·51]\end{align}$

*215·542. $\begin{align}\vdash :\text{Hp}*215·541.\alpha \cap \beta =&\Lambda .\text{E}!\text{limax}_Pʻ\alpha .\text{limax}_Pʻ\alpha {\sim}\in \text{D}ʻP_{1}.\supset .\\ &\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta \quad [*215·54.*211·727]\end{align}$

*215·543. $\begin{align}&\vdash :P\in \text{Ser}.\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha \cup \beta =CʻP.\alpha \cap \beta \in 0\cup 1.\\ &\text{E}!\text{limax}_Pʻ\alpha .\text{limax}_Pʻ\alpha {\sim}\in \text{D}ʻP_{1}.\supset .\text{limax}_Pʻ\alpha =\text{limin}_Pʻ\beta \quad[*215·542·51]\end{align}$

If $\alpha$ is any class, and $P$ is any series, the derivative (or first derivative) of $\alpha$ with respect to $P$ is the class of limits of existent sub-classes of $\alpha \cap CʻP$ , i.e. $\text{lt}_{p}ʻʻ\text{Cl ex}ʻ(\alpha\cap CʻP)$ . That is, a term $x$ belongs to the derivative of $\alpha$ if a set of terms exists which is contained both in $\alpha$ and in $CʻP$ , and has $x$ for its limit. The derivative of $\alpha$ with respect to $P$ will be denoted by $\delta _{p}ʻ\alpha$ .

In general, there will be members of $\alpha$ not contained in $\delta_{p}ʻ\alpha$ , and members of $\delta _{p}ʻ\alpha$ not contained in $\alpha$ . $\alpha$ is said to be dense in $P$ if all its terms except the first (if there is a first) belong to $\delta _{p}ʻ\alpha$ , that is, if all its terms except the first are limits of existent classes contained in $\alpha$ . $\alpha$ is said to be closed in $P$ if every existent sub-class of $\alpha$ which has no maximum has a limit which belongs to $\alpha$ , i.e. if every existent sub-class of $\alpha$ has a limit or a maximum, and the derivative of $\alpha$ is contained in $\alpha$ . If $\alpha$ is both dense and closed, it is called perfect. In this case, all its terms are limits of classes chosen out of $\alpha$ , and every class chosen out of $\alpha$ has a limit or maximum in $\alpha$ .

The second derivative of $\alpha$ is $\delta _{p}ʻ\delta_{p}ʻ\alpha$ , i.e. $\delta _{p}^{2}ʻ\alpha$ , and so on. (Derivatives of infinite order cannot be dealt with till a later stage.) If $P$ is serial, the second derivative of $\alpha$ is always contained in the first (*216·14).

If $P$ is a Dedekindian series, $\alpha$ is closed whenever $\delta _{p}ʻ\alpha \subset \alpha$ . In order to secure a Dedekindian series, it is sometimes convenient to replace $P$ by the ordinally similar series $\overrightarrow{P}^{;}P$ , which is contained in the Dedekindian series $\varsigma ʻP$ . Then $\alpha$ is replaced by $\overrightarrow{P}ʻʻ\alpha$ , and $\alpha$ is closed if the derivative of $\overrightarrow{P}ʻʻ\alpha$ with respect to $\varsigma ʻP$ is contained in $\overrightarrow{P}ʻʻ\alpha$ . The relation of the derivative of $\alpha$ in $P$ to the derivative of $\overrightarrow{P}ʻʻ\alpha$ in $\varsigma ʻP$ has been treated in *212·6 and following propositions. This subject is resumed below (*216·5 ff.).

The derivative of the series P will be defined as the series of its limit-points, and denoted by $\nabla ʻP$ . Thus we put $\nabla ʻP=P\unicode{x0294f}\text{D}ʻ\text{lt}_{p}.$

If $P$ is a series, the derivative of a class $\alpha$ consists of those members $x$ of $\text{ᗡ}ʻP$ which are such that members of $\alpha$ exist in every interval which ends in $x$ , i.e.

*216·13. $\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp x\in \delta _{p}ʻ\alpha .\equiv :x\in \text{ᗡ}ʻP:yPx.\supset _{y}.\exists !\alpha \cap \overleftarrow{P}ʻy\cap \overrightarrow{P}ʻx$

*216·2. $\vdash .\delta _{p}ʻCʻP=\text{D}ʻ\text{lt}_{p}-\overrightarrow{B}ʻP$

*216·3. $\vdash :\alpha \in \text{dense}ʻP.\equiv .\alpha -\overrightarrow{\text{min}}_{p}ʻ\alpha \subset \delta _{p}ʻ\alpha$

*216·32. $\vdash :\alpha \in \text{closed}ʻP.\equiv .\text{Cl ex}ʻ(\alpha \cap CʻP)\subset \text{ᗡ}ʻ\text{limax}_{p}.\delta _{p}ʻ\alpha \subset \alpha$

We prove (*216·4—·412) that the properties of $\alpha$ with respect to $P$ , as regards being dense, closed, or perfect, belong to $\breve{S} ʻʻ\alpha$ with respect to $Q$ if $S$ is a correlator of $P$ with $Q$ .

We next consider the relation of $\alpha$ in $P$ to $\overrightarrow{P}ʻʻ\alpha$ in $\varsigma ʻP$ (*216·5—·56). The point of these propositions is that $\varsigma ʻP$ is Dedekindian, so that a class is closed in $\varsigma ʻP$ if it contains its first derivative. (It is usual to define a class as closed whenever it contains its first derivative; but this involves the tacit assumption that the series $P$ is Dedekindian. If $P$ is the series of real numbers, this assumption is of course verified.) We prove (*216·52) that the derivative of $\overrightarrow{P}ʻʻ\alpha$ in $\varsigma ʻP$ is $Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{p})$ , i.e. is the class of segments defined by such existent sub-classes of $\alpha$ as have no maximum; we show that $\alpha$ is dense, closed, or perfect in $P$ according as $\overrightarrow{P}ʻʻ\alpha$ is dense, closed, or perfect in $\varsigma ʻP$ (*216·53 ·54 ·56), and that $\alpha$ and $\overrightarrow{P}ʻʻ\alpha$ are closed if $\overrightarrow{P}ʻʻ\alpha$ contains its first derivative (*216·54).

We end with various propositions on $\nabla ʻP$ (*216·6—·621), of which the chief is

*216·611. $\vdash :P\in \text{Ser}.\dot{\exists} !\nabla ʻP.\supset .Cʻ\nabla ʻP=CʻP-\text{ᗡ}ʻP_{1}=\delta _{p}ʻCʻP\cup \overrightarrow{B}ʻP$

*216·01. $\delta _{p}ʻ\alpha =\text{lt}_{p}ʻʻ\text{Cl ex}ʻ(\alpha \cap CʻP)\quad\text{Df}$

*216·02. $\text{dense}ʻP=\hat{\alpha} (\alpha -\overrightarrow{\text{min}}_{p}ʻ\alpha \subset \delta _{p}ʻ\alpha ) \quad\text{Df}$

*216·03. $\text{closed}ʻP=\hat{\alpha} \{\text{Cl ex}ʻ(\alpha \cap CʻP)\subset \text{ᗡ}ʻ\text{limax}_{p}.\delta _{p}ʻ\alpha \subset \alpha\} \quad\text{Df}$

*216·1. $\vdash :x\in \delta _{p}ʻ\alpha .\equiv .(\exists \beta ).\beta \subset \alpha \cap CʻP.\exists !\beta .x\text{lt}_{p}\beta \quad[(*216·01)]$

*216·101. $\vdash :x\in \delta _{P}ʻ\alpha .\equiv .(\exists \beta ).\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .x\text{seq}_{P}\beta$

Dem. $\begin{array}{l} \vdash .*216·1.*207·1.\supset \\ \vdash :x\in \delta _{P}ʻ\alpha .&\equiv .(\exists \beta ).\beta \subset \alpha \cap CʻP.\exists !\beta .\beta \cap CʻP\subset Pʻʻ\beta .x\text{seq}_{P}\beta .\\ [*37·15] &\equiv .(\exists \beta ).\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .x\text{seq}_{P}\beta :\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*216·101.*206·142.\supset \vdash :x\in \delta _{P}ʻ\alpha .&\supset .(\exists \beta ).\beta \subset \alpha .\exists !\beta .x\in \breve{P} ʻʻ\beta .\\ [*37·2] &\supset .x\in \breve{P} ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*216·111. $\vdash .\delta _{P}ʻ\alpha \subset \text{ᗡ}ʻP \quad[*216·11.*37·16]$

*216·12. $\vdash .\delta _{P}ʻ\alpha =\delta _{P}ʻ(\alpha \cap CʻP) \quad[*22·5.(*216·01)]$

*216·13. $\vdash \colon\colon P\in \text{Ser}.\supset \colon\ldotp x\in \delta _{P}ʻ\alpha .\equiv :x\in \text{ᗡ}ʻP:yPx.\supset _{y}.\exists !\alpha \cap \overleftarrow{P}ʻy\cap \overrightarrow{P}ʻx$

Dem. $\begin{array}{l} \vdash .*206·173.*216·101.\supset \vdash \colon\colon P\in \text{connex} .P^{2}\,\unicode{x2abd}\, J.\supset \colon\ldotp \\ x\in \delta _{P}ʻ\alpha .&\equiv :(\exists \beta ).\beta \subset \alpha .\exists !\beta .\beta \subset \overrightarrow{P}ʻx.\overrightarrow{P}ʻx\subset P ʻʻ\beta :\\ [*37·46]&\equiv :(\exists \beta ):\beta \subset \alpha .\exists !\beta .\beta \subset \overrightarrow{P}ʻx:yPx.\supset _{y}.\exists !\beta \cap \overleftarrow{P}ʻy:\\ [*24·58]&\supset :yPx.\supset _{y}.\exists !\alpha \cap \overrightarrow{P}ʻx\cap \overleftarrow{P}ʻy &\qquad \text{(1)}\\ \vdash .*33·41·152.\supset \\ \vdash \colon\ldotp x\in \text{ᗡ}ʻP:yPx.\supset _{y}.\exists !\alpha \cap \overrightarrow{P}ʻx\cap \overleftarrow{P}ʻy:&\supset :\exists !\alpha \cap \overrightarrow{P}ʻx.\alpha \cap \overrightarrow{P}ʻx\subset \alpha \cap CʻP:\\ [*216·1] &\supset :x\text{lt}_P(\alpha \cap \overrightarrow{P}ʻx).\supset .x\in \delta _{P}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*37·2.*201·501.&\supset \vdash :\text{Hp}.\supset .Pʻʻ(\alpha \cap \overrightarrow{P}ʻx)\subset \overrightarrow{P}ʻx &\qquad \text{(3)}\\ \vdash .*50·24. &\supset \vdash :\text{Hp}.\supset .x{\sim}\in (\alpha \cap \overrightarrow{P}ʻx) &\qquad \text{(4)}\\ \vdash .(3).(4).*207·232.\supset\\ \vdash \colon\colon\text{Hp}.x\in \text{ᗡ}ʻP.\supset \colon\ldotp x\text{lt}_P(\alpha \cap \overrightarrow{P}ʻx).&\equiv :\overrightarrow{P}ʻx\subset Pʻʻ(\alpha \cap \overrightarrow{P}ʻx):\\ [*37·46] &\equiv :yPx.\supset _{y}.\exists !\alpha \cap \overrightarrow{P}ʻx\cap \overleftarrow{P}ʻy &\qquad \text{(5)}\\ \vdash .(2).(5).&\supset \vdash \colon\ldotp \text{Hp}.x\in \text{ᗡ}ʻP:yPx.\supset _{y}.\exists !\alpha \cap \overrightarrow{P}ʻx\cap \overleftarrow{P}ʻy:\supset .x\in \delta _{P}ʻ\alpha &\qquad \text{(6)}\\ \vdash .(1).(6).*216·111.\supset \vdash .\text{Prop} \end{array}$

*216·14. $\vdash :P\in \text{Ser}.\supset .\delta _{^{2}}ʻ\alpha \subset \delta _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*71·47.\supset \vdash \colon\ldotp \text{Hp}.\supset :\beta &\subset \text{lt}_Pʻʻ\text{Cl ex}ʻ\alpha .\exists !\beta .\supset .\\ &(\exists \kappa ).\kappa \subset \text{Cl ex}ʻ\alpha .\beta =\text{lt}_Pʻʻ\kappa .\exists !\beta .\\ [*37·26] &\supset .(\exists \lambda ).\lambda \subset \text{Cl ex}ʻ\alpha \cap \text{ᗡ}ʻ\text{lt}_P.\beta =\text{lt}_Pʻʻ\lambda .\exists !\beta .\\ [*207·54]&\supset .(\exists \lambda ).\lambda \subset \text{Cl ex}ʻ\alpha \cap \text{ᗡ}ʻ\text{lt}_P.\beta =\text{lt}_Pʻʻ\lambda .\exists !\beta .\overrightarrow{\text{limax}} _{P}ʻ\beta =\overrightarrow{\text{lt}} _{P}ʻsʻ\lambda .\\ [*216·1.*37·29.*53·24.\text{Transp}]&\supset .\overrightarrow{\text{limax}} _{P}ʻ\beta \subset \delta _{P}ʻ\alpha .\\ [*207·45] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).(*216·01).\supset \vdash \colon\ldotp \text{Hp}.&\supset :\beta \in \text{Cl ex}ʻ\delta _{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ\alpha :\\ [*40·43·5] &\supset :\text{lt}_Pʻʻ\text{Cl ex}ʻ\delta _{P}ʻ\alpha \subset \delta _{P}ʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*216·15. $\vdash :\alpha \subset \beta .\supset .\delta _{P}ʻ\alpha \subset \delta _{P}ʻ\beta \quad[*37·2.(*216·01)]$

*216·16. $\vdash :P\in \text{trans}\cap \text{connex} .\supset .\delta _{P}ʻ\alpha =\delta _{P}ʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*24·26·101.&\supset \vdash :\overrightarrow{\text{min}}_{P}ʻ\alpha =\Lambda .\supset .\delta _{P}ʻ\alpha =\delta _{P}ʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha ) &\qquad \text{(1)}\\ \vdash .*51·36.\supset \vdash :\beta \subset \alpha .\exists !\beta .\text{E}!\text{min}_{P}ʻ\alpha .\text{min}_{P}ʻ&\alpha {\sim}\in \beta .\supset .\\ &\beta \in \text{Cl ex}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ).\\ [*37·18] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(2)}\\ \vdash .*205·5.\supset \vdash :\text{Hp}.\beta \subset \alpha .\exists !\beta .\text{min}_{P}ʻ\alpha \in \beta .&\supset .\text{min}_{P}ʻ\alpha =\text{min}_{P}ʻ\beta .\\ [*207·262] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \overrightarrow{\text{lt}} _{P}ʻ(\beta -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(3)}\\ \vdash .(3).*37·18.&\supset \vdash :\text{Hp}(3).\beta \neq \iota ʻ\text{min}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(4)}\\ \vdash .*205·194·8.\supset \vdash :\text{E}!\text{min}_{P}ʻ\alpha .&\supset .\text{min}_{P}ʻ\alpha =\text{max}_{P}ʻ\iota ʻ\text{min}_{P}ʻ\alpha .\\ [*207·11] &\supset .\overrightarrow{\text{lt}} _{P}ʻ\iota ʻ\text{min}_{P}ʻ\alpha =\Lambda &\qquad \text{(5)}\\ \vdash .(5).*24·12.&\supset \vdash :\text{E}!\text{min}_{P}ʻ\alpha .\beta =\iota ʻ\text{min}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(6)}\\ \vdash .(4).(6).&\supset \vdash :\text{Hp}(3).\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(7)}\\ \vdash .(2).(7).&\supset \vdash :\text{Hp}.\beta \subset \alpha .\exists !\beta .\text{E}!\text{min}_{P}ʻ\alpha .\supset .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(8)}\\ \vdash .(8).*40·5·43.&\supset \vdash :\text{Hp}.\text{E}!\text{min}_{P}ʻ\alpha .\supset .\delta _{P}ʻ\alpha \subset \delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(9)}\\ \vdash .(9).*216·15.&\supset \vdash :\text{Hp}.\text{E}!\text{min}_{P}ʻ\alpha .\supset .\delta _{P}ʻ\alpha =\delta _{P}ʻ(\alpha -\iota ʻ\text{min}_{P}ʻ\alpha ) &\qquad \text{(10)}\\ \vdash .(1).(10).\supset \vdash .\text{Prop} \end{array}$

Dem. $\begin{array}{l} \vdash .*37·15.*216·111.&\supset \vdash .\delta _{P}ʻCʻP\subset \text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP &\qquad \text{(1)}\\ \vdash .*216·1. \supset \vdash :x\in \text{D}ʻ\text{lt}_P-\delta _{P}ʻCʻP.&\supset .x\text{lt}_P\Lambda .\\ [*207·3] &\supset .x\in \overrightarrow{B}ʻP &\qquad \text{(2)}\\ \vdash .(2).\text{Transp}. &\supset \vdash .\text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP\subset \delta _{P}ʻCʻP &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*216·21. $\begin{align}&\vdash :P\in \text{ᗡ}ʻʻʻJ\cap \text{connex} .\supset .\delta _{P}ʻCʻP=\text{ᗡ}ʻP-\text{ᗡ}ʻ(P\dot{-} P^{2})\\ &[*207·35.*216·2]\end{align}$

*216·22. $\vdash :P\in \text{ᗡ}ʻʻʻJ\cap \text{connex} .P\,\unicode{x2abd}\, P^{2}.\supset .\delta _{P}ʻCʻP=\text{ᗡ}ʻP \quad[*216·21]$

*216·23. $\vdash :P\in \text{trans}.\supset .\delta _{P}ʻCʻP=\text{seq}_{P}ʻʻ\text{ᗡ}ʻ\text{sgm}ʻP=\text{lt}_Pʻʻ\text{ᗡ}ʻ\text{sgm}ʻP$

Dem. $\begin{array}{l} \vdash .*206·25.*216·101.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x\in \delta _{P}ʻCʻP .&\equiv .(\exists \beta ).\exists !\beta .\beta \subset Pʻʻ\beta .x\text{seq}_{P}(Pʻʻ\beta ).\\ [*24·58.*37·29] &\equiv .(\exists \beta ).\beta \subset Pʻʻ\beta .\exists !Pʻʻ\beta .x\text{seq}_{P}(Pʻʻ\beta ).\\ [*201·55] &\supset .(\exists \beta ).PʻʻPʻʻ\beta =Pʻʻ\beta .\exists !Pʻʻ\beta .x\text{seq}_{P}(Pʻʻ\beta ).\\ [*212·152] &\supset .x\in \text{seq}_{P}ʻʻ\text{ᗡ}ʻ\text{sgm}ʻP &\qquad \text{(1)}\\ \vdash .*211·4.&\supset \vdash .\text{seq}_{P}ʻʻ\text{ᗡ}ʻ\text{sgm}ʻP=\text{lt}_Pʻʻ\text{ᗡ}ʻ\text{sgm}ʻP &\qquad \text{(2)}\\ \vdash .*212·152.(*216·01).&\supset \vdash .\text{lt}_Pʻʻ\text{ᗡ}ʻ\text{sgm}ʻP\subset \delta _{P}ʻCʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*216·3. $\vdash :\alpha \in \text{dense}ʻP.\equiv .\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha \subset \delta _{P}ʻ\alpha \quad[(*216·02)]$

*216·31. $\vdash :\alpha \in \text{dense}ʻP.\equiv .\alpha \subset CʻP.\alpha \cap \breve{P} ʻʻ\alpha \subset \delta _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*216·3·111.\supset \vdash :\alpha \in \text{dense}ʻP.&\supset .\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha \subset \text{ᗡ}ʻP.\\ [*205·11] &\supset .\alpha \subset CʻP. &\qquad \text{(1)}\\ [*205·11] &\supset .\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha =\alpha \cap \breve{P} ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*216·32. $\begin{align}&\vdash :\alpha \in \text{closed}ʻP.\equiv .\text{Cl ex}ʻ(\alpha \cap CʻP)\subset \text{ᗡ}ʻ\text{limax}_P.\delta _{P}ʻ\alpha \subset \alpha \\ &[(*216·03)]\end{align}$

*216·33. $\vdash \colon\ldotp \alpha \in \text{closed}ʻP.\equiv :\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .\supset _{\beta }.\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta .\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \alpha$

Dem. $\begin{array}{l} \vdash .*207·45.*205·123.&\supset \vdash \colon\ldotp \text{Cl ex}ʻ(\alpha \cap CʻP)\subset \text{ᗡ}ʻ\text{limax}_P.\equiv :\\ &\beta \subset \alpha .\exists !\beta .\beta \subset CʻP.\beta \subset Pʻʻ\beta .\supset _{\beta }.\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta :\\ [*37·15] & \equiv :\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .\supset _{\beta }.\exists !\overrightarrow{\text{lt}} _{P}ʻ\beta &\qquad \text{(1)}\\ \vdash .*40·43·5.\supset \vdash \colon\ldotp \delta _{P}ʻ\alpha \subset \alpha .&\equiv :\beta \subset \alpha .\exists !\beta .\beta \subset CʻP.\supset _{\beta }.\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \alpha :\\ [*207·11.*24·12] &\equiv :\beta \subset \alpha .\exists !\beta .\beta \subset CʻP.\overrightarrow{\text{max}}_{P}ʻ\beta =\Lambda .\supset _{\beta }.\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \alpha :\\ [*205·123.*37·15]&\equiv :\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .\supset _{\beta }.\overrightarrow{\text{lt}} _{P}ʻ\beta \subset \alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*216·32.\supset \vdash .\text{Prop} \end{array}$

*216·34. $\begin{align}&\vdash \colon\colon P\in \text{connex} .\supset \colon\ldotp \alpha \in \text{closed}ʻP.\equiv :\\ &\beta \subset \alpha .\exists !\beta .\beta \subset Pʻʻ\beta .\supset _{\beta }.\text{lt}_Pʻ\beta \in \alpha \quad[*216·33.*71·332.*207·24]\end{align}$

*216·35. $\vdash :P\in \text{Ser}.\text{Cl ex}ʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_P.\supset .\text{Cl ex}ʻ\delta _{P}ʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_P$

Dem. $\begin{array}{l} \vdash .*71·47.*37·26.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\beta \in \text{Cl ex}ʻ\delta _{P}ʻ\alpha .\supset .(\exists \lambda ).\lambda \subset \text{Cl ex}ʻ\alpha \cap \text{ᗡ}ʻ\text{lt}_P.\beta =\text{lt}_Pʻʻ\lambda .\exists !\beta .\\ [*207·54]&\supset .(\exists \lambda ).\lambda \subset \text{Cl ex}ʻ\alpha \cap \text{ᗡ}ʻ\text{lt}_P.\beta =\text{lt}_Pʻʻ\lambda .\exists !\beta .\overrightarrow{\text{limax}} _{P}ʻ\beta =\overrightarrow{\text{limax}} _{P}ʻsʻ\lambda .\\ [*37·29.\text{Transp}]&\supset .(\exists \lambda ).\lambda \subset \text{Cl ex}ʻ\alpha \cap \text{ᗡ}ʻ\text{lt}_P.\beta =\text{lt}_Pʻʻ\lambda .\exists !\lambda .\overrightarrow{\text{limax}} _{P}ʻ\beta =\overrightarrow{\text{limax}} _{P}ʻsʻ\lambda .\\ [*53·24.\text{Transp}] &\supset .(\exists \lambda ).sʻ\lambda \in \text{Cl ex}ʻ\alpha .\overrightarrow{\text{limax}} _{P}ʻ\beta =\overrightarrow{\text{limax}} _{P}ʻsʻ\lambda .\\ [\text{Hp}] & \supset .\exists !\overrightarrow{\text{limax}} _{P}ʻ\beta \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*216·36. $\vdash :\alpha \in \text{perf}ʻP.\equiv .\alpha \in \text{dense}ʻP\cap \text{closed}ʻP \quad[(*216·04)]$

*216·37. $\begin{align}&\vdash :\alpha \in \text{perf}ʻP.\equiv .\text{Cl ex}ʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_P.\delta _{P}ʻ\alpha =\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha \\ &[*216·3·32·36]\end{align}$

*216·371. $\begin{align}&\vdash :\alpha \in \text{perf}ʻP.\equiv .\text{Cl ex}ʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_P.\alpha \subset CʻP.\delta _{P}ʻ\alpha =\alpha \cap \breve{P} ʻʻ\alpha \\ &[*216·31·32·11·36]\end{align}$

*216·38. $\vdash :P\in \text{trans}\cap \text{connex} .\alpha \in \text{dense}ʻP.\supset .\delta _{P}ʻ\alpha \in \text{dense}ʻP.\delta _{P}ʻ\alpha \subset \delta _{P}ʻ\delta _{P}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*216·3·15.\supset \vdash :\text{Hp}.&\supset .\delta _{P}ʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha )\subset \delta _{P}ʻ\delta _{P}ʻ\alpha .\\ [*216·16] &\supset .\delta _{P}ʻ\alpha \subset \delta _{P}ʻ\delta _{P}ʻ\alpha .\\ [*216·3] &\supset .\delta _{P}ʻ\alpha \in \text{dense}ʻP:\supset \vdash .\text{Prop} \end{array}$

*216·381. $\begin{align}&\vdash :P\in \text{Ser}.\alpha \in \text{dense}ʻP.\supset .\delta _{P}ʻ\alpha =\delta _{P}ʻ\delta _{P}ʻ\alpha .\overrightarrow{\text{min}}_{P}ʻ\delta _{P}ʻ\alpha =\Lambda\\ &[*216·38·14·11]\end{align}$

*216·382. $\begin{align}&\vdash :P\in \text{Ser}.\alpha \in \text{dense}ʻP.\text{Cl ex}ʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_P.\supset .\delta _{P}ʻ\alpha \in \text{perf}ʻP\\ &[*216·35·381·37]\end{align}$

*216·4. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .\delta _{P}ʻ\alpha =Sʻʻ\delta _{Q}ʻ\breve{S} ʻʻ\alpha .\breve{S} ʻʻ\delta _{P}ʻ\alpha =\delta _{Q}ʻ\breve{S} ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*207·63.\supset \vdash :\text{Hp}.\supset .\delta _{P}ʻ\alpha &=Sʻʻ\text{lt}_{Q}ʻʻ\breve{S} ʻʻʻ\text{Cl ex}ʻ\alpha\\ [*71·491] &=Sʻʻ\text{lt}_{Q}ʻʻ\text{Cl ex}ʻ\breve{S} ʻʻ\alpha \\ [(*216·01)] &=Sʻʻ\delta _{Q}ʻ\breve{S} ʻʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*72·52.*216·111.\supset \vdash .\text{Prop} \end{array}$

*216·401. $\vdash :S\in P\,\overline{\,\text{smor}\,}\,Q.\supset .P\unicode{x0294f}\delta _{P}ʻ\alpha =S^{;}(Q\unicode{x0294f}\delta _{Q}ʻ\breve{S} ʻʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*150·37.\supset \vdash :\text{Hp}.\supset .S^{;}(Q\unicode{x0294f}\delta _{Q}ʻ\breve{S} ʻʻ\alpha )&=(S^{;}Q)\unicode{x0294f}Sʻʻ\delta _{Q}ʻ\breve{S} ʻʻ\alpha \\ [*216·4.*151·11] & =P\unicode{x0294f}\delta _{P}ʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*216·41. $\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\alpha \subset CʻP.\supset :\alpha \in \text{dense}ʻP.\equiv .\breve{S} ʻʻ\alpha \in \text{dense}ʻQ$

Dem. $\begin{array}{l} \vdash .*216·3.*37·2.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\alpha \in \text{dense}ʻP.\supset .\breve{S} ʻʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha )\subset \breve{S} ʻʻ\delta _{P}ʻ\alpha .\\ [*71·38.*205·8] & \supset .\breve{S} ʻʻ\alpha -\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha \subset \breve{S} ʻʻ\delta _{P}ʻ\alpha .\\ [*216·4] &\supset .\breve{S} ʻʻ\alpha -\overrightarrow{\text{min}}_{Q}ʻ\breve{S} ʻʻ\alpha \subset \delta _{Q}ʻ\breve{S} ʻʻ\alpha .\\ [*216·3] &\supset .\breve{S} ʻʻ\alpha \in \text{dense}ʻQ &\qquad \text{(1)}\\ \vdash .(1)\frac{Q,\,P,\,\breve{S}ʻʻ\alpha}{P,\,Q,\,\alpha}.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\breve{S} ʻʻ\alpha \in \text{dense}ʻQ.\supset .Sʻʻ\breve{S} ʻʻ\alpha \in \text{dense}ʻP.\\ [*72·502] &\supset .\alpha \in \text{dense}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*216·411. $\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\alpha \subset CʻP.\supset :\alpha \in \text{closed}ʻP.\equiv .\breve{S} ʻʻ\alpha \in \text{closed}ʻQ$

Dem. $\begin{array}{l} \vdash .*207·64.*37·431.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\beta \subset CʻP.\exists !\beta .\beta \in \text{ᗡ}ʻ&\text{limax}_P.\supset .\\ &\breve{S} ʻʻ\beta \subset CʻQ.\exists !\breve{S} ʻʻ\beta .\breve{S} ʻʻ\beta \in \text{ᗡ}ʻ\text{limax}_{Q}:\\ [*71·49]\supset :\text{Cl ex}ʻ\alpha \subset \text{ᗡ}ʻ&\text{limax}_P.\supset .\text{Cl ex}ʻ\breve{S} ʻʻ\alpha \subset \text{ᗡ}ʻ\text{limax}_{Q} &\qquad \text{(1)}\\ \vdash .*37·2.*216·4.&\supset \vdash \colon\ldotp \text{Hp}.\supset :\delta _{P}ʻ\alpha \subset \alpha .\supset .\delta _{Q}ʻ\breve{S} ʻʻ\alpha \subset \breve{S} ʻʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*216·32. &\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha \in \text{closed}ʻP.\supset .\breve{S} ʻʻ\alpha \in \text{closed}ʻQ &\qquad \text{(3)}\\ \vdash .(3) \frac{Q,\,P,\,\breve{S}ʻʻ\alpha}{P,\,Q,\,\alpha}. \supset \vdash \colon\ldotp \text{Hp}.&\supset :\breve{S} ʻʻ\alpha \in \text{closed}ʻQ.\supset .Sʻʻ\breve{S} ʻʻ\alpha \in \text{closed}ʻP.\\ [*72·502] & \supset .\alpha \in \text{closed}ʻP &\qquad \text{(4)}\\ \vdash .(3).(4).\supset \vdash .\text{Prop} \end{array}$

*216·412. $\begin{align}&\vdash \colon\ldotp S\in P\,\overline{\,\text{smor}\,}\,Q.\alpha \subset CʻP.\supset :\alpha \in \text{perf}ʻP.\equiv .\breve{S} ʻʻ\alpha \in \text{perf}ʻQ\\ &[*216·41·411·36]\end{align}$

*216·5. $\vdash :P\in \text{Ser}.\supset .\text{ᗡ}ʻ\varsigma ʻP-\overrightarrow{P}ʻʻCʻP\subset \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*212·134.*216·111.\supset \\ \vdash :\text{Hp}.P=\dot{\Lambda} .\supset .\text{ᗡ}ʻ\varsigma ʻP-\overrightarrow{P}ʻʻCʻP=\Lambda .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP=\Lambda &\qquad \text{(1)}\\ \vdash .*212·632.\supset \\ \vdash \colon\ldotp \text{Hp}.\dot{\exists} !P.Pʻʻ\alpha {\sim}\in \overrightarrow{P}ʻʻCʻP.\supset :Pʻʻ\alpha =\text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha :\\ [*216·1]\supset :\exists !\alpha .\alpha \subset CʻP.\supset .Pʻʻ\alpha \in \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(2)}\\ \vdash .(2).*212·132.*37·265.\supset \\ \vdash :\text{Hp}.\dot{\exists} !P.\beta \in \text{ᗡ}ʻ\varsigma ʻP-\overrightarrow{P}ʻʻCʻP.\supset .\beta \in \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*216·51. $\begin{align}&\vdash :P\in \text{Ser} .\supset .\\ &\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP=\delta (\varsigma ʻP)ʻCʻ\varsigma ʻP=\text{D}ʻ\text{lt}(\varsigma ʻP)-\iota ʻ\Lambda =\text{ᗡ}ʻ\text{sgm}ʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*212·661.&\supset \vdash :\text{Hp}.\kappa \subset \text{D}ʻP_{\in }.x = \text{lt}(\varsigma ʻP)ʻ\kappa .\supset .x = \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa &\qquad \text{(1)}\\ \vdash .*207·13.*212·133.\supset \\ \vdash :\text{Hp}.\kappa \subset \text{D}ʻP_{\in }.x = \text{lt}(\varsigma ʻP)ʻ\kappa .&\supset .\kappa \neq \iota ʻ\Lambda &\qquad \text{(2)}\\ \vdash .(1).(2).*40·26.\supset \\ \vdash :\text{Hp}.\kappa \subset \text{D}ʻP_{\in }.\exists !\kappa .x = \text{lt}(\varsigma ʻP)ʻ\kappa .&\supset .\exists !sʻ\kappa .x = \text{lt}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻsʻ\kappa .\\ [*216·1] &\supset .x\in \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(3)}\\ \vdash .(3).*216·1. &\supset \vdash :\text{Hp}.\supset .\delta (\varsigma ʻP)ʻCʻ\varsigma ʻP \subset \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP &\qquad \text{(4)}\\ \vdash .*211·3.*216·15.&\supset \vdash .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP\subset \delta (\varsigma ʻP)ʻCʻ\varsigma ʻP &\qquad \text{(5)}\\ \vdash .(4).(5). \supset \vdash :\text{Hp}.\supset .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻCʻP &= \delta (\varsigma ʻP)ʻCʻ\varsigma ʻP &\qquad \text{(6)}\\ [*216·2.*212·133] &= \text{D}ʻ\text{lt}(\varsigma ʻP)-\iota ʻ\Lambda &\qquad \text{(7)}\\ \vdash .(6).(7).*212·667.\supset \vdash .\text{Prop} \end{array}$

*216·52. $\vdash :P\in \text{Ser} .\dot{\exists} !P.\alpha \subset CʻP.\supset .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha = Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{P})$

Dem. $\begin{array}{l} \vdash .*216·1.\supset \vdash \colon\ldotp &\text{Hp}.\supset :\gamma \in \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha .\equiv .(\exists \kappa ).\kappa \subset \overrightarrow{P}ʻʻ\alpha .\exists !\kappa .\gamma = \text{lt}(\varsigma ʻP)ʻ\kappa .\\ [*212·402] &\equiv .(\exists \kappa ).\kappa \subset \overrightarrow{P}ʻʻ\alpha .\exists !\kappa .{\sim}\in !\text{max}(\varsigma ʻP)ʻ\kappa .\gamma = sʻ\kappa .\\ [*71·47.*37·2] &\equiv .(\exists \beta ).\beta \subset \alpha .\exists !\beta .{\sim}\text{E}!\text{max}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\beta .\gamma = sʻ\overrightarrow{P}ʻʻ\beta .\\ [*40·5.*212·601]&\equiv .(\exists \beta ).\beta \subset \alpha .\exists !\beta .{\sim}\text{E}!\text{max}_{P}ʻ\beta .\gamma = Pʻʻ\beta .\\ [*37·6] &\equiv .\gamma \in Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{P})\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*216·521. $\vdash :P\in \text{Ser} .\alpha \subset CʻP.\supset .\overrightarrow{P}ʻʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha ) = \overrightarrow{P}ʻʻ\alpha -\overrightarrow{\text{min}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*71·381.*204·34.\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha ) &= \overrightarrow{P}ʻʻ\alpha -\overrightarrow{P}ʻʻ\text{min}_{P}ʻ\alpha \\ [*212·6] &= \overrightarrow{P}ʻʻ\alpha -\overrightarrow{\text{min}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha :\supset \vdash .\text{Prop} \end{array}$

*216·53. $\vdash \colon\ldotp P\in \text{Ser} .\dot{\exists} !P.\alpha \subset CʻP.\supset :\alpha \in \text{dense}ʻP.\equiv .\overrightarrow{P}ʻʻ\alpha \in \text{dense}ʻ\varsigma ʻP$

Dem. $\begin{array}{l} \vdash . *216·52·3.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &\overrightarrow{P}ʻʻ\alpha \in \text{dense}ʻ\varsigma ʻP.\equiv :\\ &\overrightarrow{P}ʻʻ\alpha -\overrightarrow{\text{min}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \subset Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{P}):\\ [*216·521] &\equiv :\overrightarrow{P}ʻʻ(\alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha )\subset Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{P}):\\ [*37·6] &\equiv :x\in \alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha .\supset _{x}.(\exists \beta ).\beta \subset \alpha .\exists !\beta .{\sim}\text{E}!\text{max}_{P}ʻ\beta .\overrightarrow{P}ʻx = Pʻʻ\beta :\\ [*207·521] &\equiv :x\in \alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha .\supset _{x}.(\exists \beta ).\beta \subset \alpha .\exists !\beta .x = \text{lt}_Pʻ\beta :\\ [*216·1] &\equiv :x\in \alpha -\overrightarrow{\text{min}}_{P}ʻ\alpha .\supset _{x}.x\in \delta _{P}ʻ\alpha :\\ [*216·3] &\equiv :\alpha \in \text{dense}ʻP\colon\colon\supset \vdash .\text{Prop} \end{array}$

*216·54. $\vdash \colon\ldotp P\in \text{Ser} .\dot{\exists} !P.\alpha \subset CʻP.\supset :\alpha \in \text{closed}ʻP.\equiv .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \subset \overrightarrow{P}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*216·52.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp \delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha \subset \overrightarrow{P}ʻʻ\alpha .\equiv :Pʻʻʻ(\text{Cl ex}ʻ\alpha -\text{ᗡ}ʻ\text{max}_{P})\subset \overrightarrow{P}ʻʻ\alpha :\\ [*37·6] &\equiv :\beta \subset \alpha .\exists !\beta .{\sim}\text{E}!\text{max}_{P}ʻ\beta .\supset _{\beta }.(\exists x).x\in \alpha .Pʻʻ\beta = \overrightarrow{P}ʻx:\\ [*207·521] &\equiv :\beta \subset \alpha .\exists !\beta .{\sim}\text{E}!\text{max}_{P}ʻ\beta .\supset _{\beta }.\text{lt}_Pʻ\beta \in \alpha :\\ [*216·34] &\equiv :\alpha \in \text{closed}ʻP\colon\colon\supset \vdash .\text{Prop} \end{array}$

*216·55. $\vdash \colon\ldotp P\in \text{Ser} .\dot{\exists} !P.\alpha \subset CʻP.\supset :\alpha \in \text{closed}ʻP.\equiv .\overrightarrow{P}ʻʻ\alpha \in \text{closed}ʻ\varsigma ʻP$

Dem. $\begin{array}{l} \vdash .*212·44.\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}ʻʻ\alpha \subset \text{ᗡ}ʻ\text{limax}(\varsigma ʻP) &\qquad \text{(1)}\\ \vdash .(1).*212·54·32.\supset \vdash .\text{Prop} \end{array}$

*216·56. $\begin{align}\vdash \colon\ldotp P\in \text{Ser} .\dot{\exists} !P.\alpha &\subset CʻP.\supset :\alpha \in \text{perf}ʻP.\equiv .\overrightarrow{P}ʻʻ\alpha \in \text{perf}ʻ\varsigma ʻP.\\ &\equiv .\delta (\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha = \overrightarrow{P} ʻʻ\alpha - \overrightarrow{\text{min}}(\varsigma ʻP)ʻ\overrightarrow{P}ʻʻ\alpha\\ &[*216·53·54·55·36·37.*212·44]\end{align}$

*216·6. $\vdash :x(\nabla ʻP)y.\equiv .x,y\in \text{D}ʻ\text{lt}_P.xPy \quad[(*216·05)]$

*216·601. $\vdash :x\in \text{D}ʻ\text{lt}_P\cap \text{ᗡ}ʻP.P\in \text{connex} .\text{E}!BʻP.\supset .(BʻP)(\nabla ʻP)x$

Dem. $\begin{array}{l} \vdash .*206·14. &\supset \vdash :\text{Hp}.\supset .BʻP\in \text{D}ʻ\text{lt}_P &\qquad \text{(1)}\\ \vdash .*202·524.&\supset \vdash :\text{Hp}.\supset .(BʻP)Px &\qquad \text{(2)}\\ \vdash .(1).(2).*216·6.\supset \vdash .\text{Prop} \end{array}$

*216·602. $\vdash :P\in \text{connex} .\text{E}!BʻP.\supset .\text{ᗡ}ʻ\nabla ʻP=\text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP=\delta _{P}ʻCʻP$

Dem. $\begin{array}{l} \vdash .*216·601.&\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP\subset \text{ᗡ}ʻ\nabla ʻP &\qquad \text{(1)}\\ \vdash .*216·6. &\supset \vdash .\text{ᗡ}ʻ\nabla ʻP\subset \text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*216·2.\supset \vdash .\text{Prop} \end{array}$

*216·603. $\vdash :P\in \text{connex} .\dot{\exists} !\nabla ʻP.\supset .Cʻ\nabla ʻP=\text{D}ʻ\text{lt}_P$

Dem. $\begin{array}{l} \vdash .*200·35.\supset \vdash :\text{Hp}.&\supset .\text{D}ʻ\text{lt}_P{\sim}\in 1.\\ [*202·55] &\supset .Cʻ\nabla ʻP=\text{D}ʻ\text{lt}_P:\supset \vdash .\text{Prop} \end{array}$

*216·61. $\vdash :P\in \text{Ser}.\text{E}!BʻP.\supset .\text{ᗡ}ʻ\nabla ʻP=\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1} \quad[*216·602·21]$

*216·611. $\vdash :P\in \text{Ser}.\dot{\exists} !\nabla ʻP.\supset .Cʻ\nabla ʻP=CʻP-\text{ᗡ}ʻP_{1}=\delta _{P}ʻCʻP\cup \overrightarrow{B}ʻP$

Dem. $\begin{array}{l} \vdash .*216·603.*206·14.\supset \vdash :\text{Hp}.\supset .Cʻ\nabla ʻP&=(\text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP)\cup \overrightarrow{B}ʻP\\ [*216·2] & =\delta _{P}ʻCʻP\cup \overrightarrow{B}ʻP &\qquad \text{(1)}\\ [*216·21] &=(\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1})\cup \overrightarrow{B}ʻP\\ [*93·103.*24·412] &=CʻP-\text{ᗡ}ʻP_{1} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*216·612. $\vdash :P\in \text{Ser}.\supset .\text{ᗡ}ʻ\nabla ʻP\subset \text{ᗡ}ʻP-\text{ᗡ}ʻP_{1}$

Dem. $\begin{array}{l} \vdash .*216·6. &\supset \vdash .\text{ᗡ}ʻ\nabla ʻP\subset \text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP &\qquad \text{(1)}\\ \vdash .*216·2·21. &\supset \vdash :\text{Hp}.\supset .\text{D}ʻ\text{lt}_P-\overrightarrow{B}ʻP=\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1} &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*216·62. $\vdash :P\in \text{Ser}.\dot{\exists} !\nabla ʻP.\supset .Cʻ\nabla ʻP=\text{seq}_{P}ʻʻCʻ\text{sgm}ʻP=\text{lt}_PʻʻCʻ\text{sgm}ʻP$

Dem. $\begin{array}{l} \vdash .*216·611.\supset \vdash :\text{Hp}.\supset .Cʻ\nabla ʻP&=\delta _{P}ʻCʻP\cup \overrightarrow{B}ʻP\\ [*216·23] &=\text{seq}_{P}ʻʻ\text{ᗡ}ʻ\text{sgm}ʻP\cup \overrightarrow{B}ʻP &\qquad \text{(1)}\\ [*206·14] &=\text{seq}_{P}ʻʻ(\text{ᗡ}ʻ\text{sgm}ʻP\cup \iota ʻ\Lambda ) &\qquad \text{(2)}\\ \vdash .*211·45. \supset \vdash :\text{Hp}.\exists !\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1}.&\supset .\exists !\text{D}ʻ(P_{\in }\dot{\cap} I)-\iota ʻ\Lambda .\\ [*212·153] &\supset .\dot{\exists} !\text{sgm}ʻP.\\ [*212·155] &\supset .\text{ᗡ}ʻ\text{sgm}ʻP\cup \iota ʻ\Lambda =Cʻ\text{sgm}ʻP &\qquad \text{(3)}\\ \vdash .(1).*216·23.*207·17.&\supset \vdash :\text{Hp}.\supset .Cʻ\nabla ʻP=\text{lt}_Pʻʻ(\text{ᗡ}ʻ\text{sgm}ʻP\cup \iota ʻ\Lambda ) &\qquad \text{(4)}\\ \vdash .(2).(3).(4).\supset \vdash .\text{Prop} \end{array}$

*216·621. $\vdash :P\in \text{Ser}.\dot{\exists} !\nabla ʻP.\supset .\dot{\exists} !\text{sgm}ʻP.\exists !\text{ᗡ}ʻP-\text{ᗡ}ʻP_{1} \quad[*216·62·612]$

The purpose of the present number is to prove *217·43, which is required in the theory of real numbers (Part VI, Section A), where $Q$ will be the series of positive ratios including zero, $P$ will be the series of negative ratios in the order from zero to - $\infty$ (both excluded), $\alpha$ the real number zero, and $Z$ and $W$ two different series either of which may be taken as the series of negative and positive real numbers. In virtue of *217·43, these two series are ordinally similar.

*217·1. $\vdash :\alpha \cap CʻQ=\Lambda .\supset .(P\unicode{x2909} Q)ʻʻ\alpha =Pʻʻ\alpha \quad[*160·1]$

*217·11. $\vdash :\exists !\alpha \cap CʻQ.\supset .(P\unicode{x2909} Q)ʻʻ\alpha =CʻP\cup Qʻʻ\alpha \quad[*160·1]$

*217·12. $\vdash .\text{D}ʻ(P\unicode{x2909} Q)_{\in }\subset \text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ\text{D}ʻQ_{\in } \quad[*217·1·11.*211·11]$

*217·13. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .Pʻʻ\alpha =(P\unicode{x2909} Q)ʻʻ(\alpha -CʻQ) \quad[*217·1]$

*217·14. $\vdash :\exists !Qʻʻ\alpha .\supset .CʻP\cup Qʻʻ\alpha =(P\unicode{x2909} Q)ʻʻ\alpha \quad[*217·11]$

*217·15. $\begin{align}&\vdash :CʻP\cap CʻQ=\Lambda .\supset .\text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda )\subset \text{D}ʻ(P\unicode{x2909} Q)_{\in }\\ &[*217·13·14]\end{align}$

*217·16. $\vdash \colon\ldotp CʻP\cap CʻQ=\Lambda :{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\lor.\exists !\overrightarrow{B}ʻQ:\supset .CʻP_{\in }\text{D}ʻ(P\unicode{x2909} Q)_{\in }$

Dem. $\begin{array}{l} \vdash .*211·301. &\supset \vdash :{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\supset .CʻP\in \text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .(1).*217·15.&\supset \vdash :\text{Hp}.{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\supset .CʻP\in \text{D}ʻ(P\unicode{x2909} Q)_{\in } &\qquad \text{(2)}\\ \vdash .*217·11. &\supset \vdash :\exists !\overrightarrow{B}ʻQ.\supset .(P\unicode{x2909} Q)ʻʻ\overrightarrow{B}ʻQ=CʻP &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*217·17. $\begin{align}\vdash \colon\ldotp CʻP\cap &CʻQ=\Lambda :{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\lor.\exists !\overrightarrow{B}ʻQ:\supset .\\ &\text{D}ʻ(P\unicode{x2909} Q)_{\in }=\text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ\text{D}ʻQ_{\in } \quad[*217·12·15·16]\end{align}$

*217·18. $\begin{align}\vdash \colon\ldotp CʻP\cap CʻQ=\Lambda :{\sim}&\exists !\overrightarrow{B}ʻ\breve{P} .\lor.{\sim}\exists !\overrightarrow{B}ʻQ:\supset .\\ &\text{D}ʻ(P\unicode{x2909} Q)_{\in }=\text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda )\end{align}$

Dem. $\begin{array}{l} \vdash .*211·301.&\supset \vdash :{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\supset .(CʻP\cup )ʻʻ{℩}ʻ\Lambda \subset \text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .(1).*217·17.\supset \vdash :\text{Hp}.{\sim}&\exists !\overrightarrow{B}ʻ\breve{P} .\supset .\\ &\text{D}ʻ(P\unicode{x2909}Q)_{\in }=\text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda ) &\qquad \text{(2)}\\ \vdash .*217·11. &\supset \vdash :{\sim}\exists !\overrightarrow{B}ʻQ.\exists !\alpha \cap CʻQ.\supset .\exists !(P\unicode{x2909}Q)ʻʻ\alpha \cap CʻQ &\qquad \text{(3)}\\ \vdash .*217·1. &\supset \vdash :{\sim}\exists !\overrightarrow{B}ʻQ.\exists !\overrightarrow{B}ʻ\breve{P} .\alpha \cap CʻQ=\Lambda .\supset .(P\unicode{x2909}Q)ʻʻ\alpha \neq CʻP &\qquad \text{(4)}\\ \vdash .(3).(4). &\supset \vdash :\text{Hp}.{\sim}\exists !\overrightarrow{B}ʻQ.\exists !\overrightarrow{B}ʻ\breve{P} .\supset .CʻP{\sim}\in \text{D}ʻ(P\unicode{x2909}Q)_{\in } &\qquad \text{(5)}\\ \vdash .(5).*217·12·15.\supset \\ \vdash :\text{Hp}(5).&\supset .\text{D}ʻ(P\unicode{x2909}Q)_{\in }=\text{D}ʻP_{\in }\cup (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda )&\qquad \text{(6)}\\ \vdash .(2).(6).\supset \vdash .\text{Prop} \end{array}$

*217·2. $\vdash :CʻP\cap CʻQ=\Lambda .\supset .\text{D}ʻP_{\in }\cap (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda )=\Lambda$

Dem. $\begin{array}{l} \vdash .*211·11.\supset \\ \vdash :\text{D}ʻP_{\in }\subset \text{Cl}ʻCʻP:\alpha \in (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda ).\supset .\exists !\alpha \cap CʻQ:\supset \vdash .\text{Prop} \end{array}$

*217·21. $\vdash :\exists !\overrightarrow{B}ʻ\breve{P} .\supset .\text{D}ʻP_{\in }\cap (CʻP\cup )ʻʻ\text{D}ʻQ_{\in }=\Lambda$

Dem. $\vdash .*211·11.\supset \vdash :\text{Hp}.\alpha \in \text{D}ʻP_{\in }.\supset .\exists !CʻP-\alpha :\supset \vdash .\text{Prop}$

*217·22. $\begin{align}\vdash :P,Q\in \text{trans}\cap \text{connex} .CʻP\cap CʻQ&=\Lambda .\exists !\overrightarrow{B}ʻ\breve{P} .\exists!\overrightarrow{B}ʻQ.\supset .\\ &\varsigma ʻ(P\unicode{x2909}Q)=\varsigma ʻP\unicode{x2909}(CʻP\cup )^;\varsigma ʻQ\end{align}$

Dem. $\begin{array}{l} \vdash .*201·401.*202·401.&\supset \vdash :\text{Hp}.\supset .P\unicode{x2909}Q_{\in }\text{trans}\cap \text{connex} &\qquad \text{(1)}\\ \vdash .(1).*212·23.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \alpha \{\varsigma ʻ(P\unicode{x2909}Q)\}\beta .&\equiv :\alpha ,\beta \in \text{D}ʻ(P\unicode{x2909}Q)_{\in }.\alpha \subset \beta .\alpha \neq \beta :\\ [*217·17·21]&\equiv :\alpha ,\beta \in \text{D}ʻP_{\in }.\alpha \subset \beta .\alpha \neq \beta .\lor.\alpha \in \text{D}ʻP_{\in }.\beta \in (CʻP\cup )ʻʻ\text{D}ʻQ_{\in }.\\ &\lor.\alpha ,\beta \in (CʻP\cup )ʻʻ\text{D}ʻQ_{\in }.\alpha \subset \beta .\alpha \neq \beta :\\ [*212·23] &\equiv :\alpha (\varsigma ʻP)\beta .\lor.\alpha \in Cʻ\varsigma ʻP.\beta \in Cʻ(CʻP\cup )^{;}\varsigma ʻQ.\\ &\lor.\alpha \{(CʻP\cup )^{;}\varsigma ʻQ\}\beta :\\ [*160·11] &\equiv :\alpha \{\varsigma ʻP\unicode{x2909}(CʻP\cup )^{;}\varsigma ʻQ\}\beta \colon\colon\supset \vdash .\text{Prop} \end{array}$

*217·23. $\begin{align}\vdash \colon\ldotp P,Q\in \text{trans}\cap \text{connex} .&CʻP\cap CʻQ=\Lambda :{\sim}\exists !\overrightarrow{B}ʻ\breve{P} .\lor.{\sim}\exists !\overrightarrow{B}ʻQ:\supset .\\ &\varsigma ʻ(P\unicode{x2909}Q)=\varsigma ʻP\unicode{x2909}(CʻP\cup )^{;}(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda )\end{align}$

Dem. $\begin{array}{l} \vdash .*201·401.*202·401.*212·23.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \alpha\{\varsigma ʻ(P\unicode{x2909}Q)\}\beta .&\equiv :\alpha ,\beta \in \text{D}ʻ(P\unicode{x2909}Q)_{\in }.\alpha \subset \beta .\alpha \neq \beta :\\ [*217·18·2]&\equiv :\alpha ,\beta \in \text{D}ʻP_{\in }.\alpha \subset \beta .\alpha \neq \beta .\lor.\alpha \in \text{D}ʻP_{\in }.\beta \in (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda ).\\ &\lor.\alpha ,\beta \in (CʻP\cup )ʻʻ(\text{D}ʻQ_{\in }-{℩}ʻ\Lambda ).\alpha \subset \beta .\alpha \neq \beta :\\ [*212·23.*160·11]&\equiv :\alpha \{\varsigma ʻP\unicode{x2909}(CʻP\cup )^{;}(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda )\}\beta \colon\colon\supset \vdash .\text{Prop} \end{array}$

*217·24. $\vdash :\alpha \cap \beta =\Lambda .\supset .(\alpha \cup )\upharpoonright ʻ\text{Cl}ʻ\beta \in 1\rightarrow 1 \quad[*24·481]$

*217·25. $\begin{align}&\vdash :CʻP\cap CʻQ=\Lambda .\supset .(CʻP\cup )\upharpoonright Cʻ\varsigma ʻQ\in \{(CʻP\cup )^{;}\varsigma ʻQ\}\overline{\,\text{smor}\,} (\varsigma ʻQ)\\ &[*217·24]\end{align}$

*217·3. $\begin{align}&\vdash :P\in \text{Ser}.\supset .\text{ᗡ}ʻP_{\in }=\overrightarrow{P}ʻʻCʻP\cup \text{D}ʻ(P_{\in }\dot{\cap} I)-\text{ᗡ}ʻ\text{seq}_{P}\\ &[*211·32·302·41]\end{align}$

*217·301. $\vdash :P\in \text{Ser}.\gamma \in \text{D}ʻ(P_{\in }\dot{\cap} I)-\text{ᗡ}ʻ\text{seq}_{P}.\supset .\gamma =CʻP-\breve{P} ʻʻ(CʻP-\gamma )$

Dem. $\begin{array}{l} \vdash .*211·727.\supset \vdash :\text{Hp}.&\supset .{\sim}\text{E}!\,\text{limin}_Pʻ(CʻP-\gamma ).\\ [*207·44.*211·7] &\supset .CʻP-\gamma \in \text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{min}_{P}.\\ [*211·41·12] &\supset .CʻP-\gamma =\breve{P} ʻʻ(CʻP-\gamma ):\supset \vdash .\text{Prop} \end{array}$

*217·31. $\vdash :P\in \text{Ser}.\gamma \in \text{D}ʻP_{\in }.\supset .(\exists \beta ).\gamma =Pʻʻ(CʻP-\breve{P} ʻʻ\beta )$

Dem. $\begin{array}{l} \vdash .*201·53.\supset \\ \vdash :\text{Hp}.\gamma =\overrightarrow{P}ʻx.\beta =\overleftarrow{P}_{*}ʻx.&\supset .CʻP-\breve{P} ʻʻ\beta =\overrightarrow{P}_{*}ʻx.\\ [*201·53] &\supset .Pʻʻ(CʻP-\breve{P} ʻʻ\beta )=\gamma &\qquad \text{(1)}\\ \vdash .(1).*217·3·301.\supset \vdash .\text{Prop} \end{array}$

*217·32. $\vdash :P\in \text{Ser}.\supset .\text{D}ʻ(\breve{P} )_{\in }=(\breve{P} )_{\in }ʻʻ(CʻP-)ʻʻ\text{D}ʻP_{\in }$

Dem. $\begin{array}{l} \vdash .*217·31 \frac{\breve{P}}{P}.\supset \vdash :\text{Hp}.\supset .\text{D}ʻ(\breve{P} )_{\in }\subset (\breve{P} )_{\in }ʻʻ(CʻP-)ʻʻ\text{D}ʻP_{\in } &\qquad \text{(1)}\\ \vdash .(1).*37·16.\supset \vdash .\text{Prop} \end{array}$

*217·33. $\vdash .(\alpha -)\upharpoonright \text{Cl}ʻ\alpha \in 1\rightarrow 1$

Dem. $\vdash .*24·492.\supset \vdash :\beta \subset \alpha .\gamma \subset \alpha .\alpha -\beta =\alpha -\gamma .\supset .\beta =\gamma :\supset \vdash .\text{Prop}$

*217·34. $\vdash :P\in \text{Ser}.\supset .P_{\in }\upharpoonright (\text{sect}ʻP-\text{ᗡ}ʻ\text{lt}_P)\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*211·1.&\supset \vdash :\alpha ,\beta \in \text{sect}ʻP.Pʻʻ\alpha =Pʻʻ\beta .\exists !\beta -\alpha .\supset .\exists !\beta -Pʻʻ\beta &\qquad \text{(1)}\\ \vdash .(1).*205·111. & \supset \vdash :\text{Hp}.\text{Hp}(1).\supset .\text{E}!\text{max}_{P}ʻ\beta &\qquad \text{(2)}\\ \vdash .*211·56. \supset \vdash :\text{Hp}(2).&\supset .\alpha \subset Pʻʻ\beta . &\qquad \text{(3)}\\ [*205·111.(2)] &\supset .\text{max}_{P}ʻ\beta {\sim}\in \alpha &\qquad \text{(4)}\\ \vdash .(3). \supset \vdash :\text{Hp}(2).&\supset .\alpha =Pʻʻ\beta .\\ [*205·22.(2).\text{Hp}] &\supset .\alpha =\overrightarrow{P}ʻ\text{max}_{P}ʻ\beta =Pʻʻ\alpha &\qquad \text{(5)}\\ \vdash .(4).(5).*207·232.&\supset \vdash :\text{Hp}(2).\supset .\text{max}_{P}ʻ\beta =\text{lt}_Pʻ\alpha &\qquad \text{(6)}\\ \vdash .(6).\text{Transp}.&\supset \vdash :\text{Hp}.\alpha ,\beta \in \text{sect}ʻP.Pʻʻ\alpha =Pʻʻ\beta .{\sim}\text{E}!\text{lt}_Pʻ\alpha .\supset .\beta \subset \alpha &\qquad \text{(7)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\alpha ,\beta \in \text{sect}ʻP.Pʻʻ\alpha =Pʻʻ\beta .{\sim}\text{E}!\text{lt}_Pʻ\beta .\supset .\alpha \subset \beta &\qquad \text{(8)}\\ \vdash .(7).(8).&\supset \vdash :\text{Hp}.\alpha ,\beta \in \text{sect}ʻP-\text{ᗡ}ʻ\text{lt}_P.Pʻʻ\alpha =Pʻʻ\beta .\supset .\alpha =\beta :\supset \vdash .\text{Prop} \end{array}$

*217·35. $\vdash :P\in \text{Ser}.\supset .(\breve{P} )_{\in }\mid (CʻP-)\upharpoonright \text{D}ʻP_{\in }\in 1\rightarrow 1$

Dem. $\begin{array}{l} \vdash .*217·33.&\supset \vdash .(CʻP-)\upharpoonright \text{D}ʻP_{\in }\in 1\rightarrow 1 &\qquad \text{(1)}\\ \vdash .*211·76.\supset \vdash :\text{Hp}.&\supset .(CʻP-)ʻʻ\text{D}ʻP_{\in }=\text{sect}ʻ\breve{P} -\text{ᗡ}ʻ\text{tl}_P.\\ [*217·34] &\supset .(\breve{P} )_{\in }\upharpoonright (CʻP-)ʻʻ\text{D}ʻP_{\in }\in 1\rightarrow 1 &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*217·36. $\vdash :P\in \text{Ser}.\supset .\varsigma ʻ\breve{P} =(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP$

Dem. $\begin{array}{l} \vdash .*212·23.\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\beta (\varsigma ʻP)\alpha .\gamma =\breve{P} ʻʻ(CʻP-\alpha ).\delta =\breve{P} ʻʻ(CʻP-\beta ).\supset .\\ &\beta \subset \alpha .\alpha \neq \beta .CʻP-\alpha \subset CʻP-\beta .\\ [*37·2.*217·35]&\supset .\gamma \subset \delta .\gamma \neq \delta .\\ [*212·23] &\supset .\gamma (\varsigma ʻ\breve{P} )\delta &\qquad \text{(1)}\\ \vdash .(1).\supset \vdash :\text{Hp}.&\supset .(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP\,\unicode{x2abd}\, \varsigma ʻ\breve{P} &\qquad \text{(2)}\\ \vdash .(1).\text{Transp}.\supset \\ \vdash :\text{Hp}.&\delta (\varsigma ʻ\breve{P} )\gamma .\gamma =\breve{P} ʻʻ(CʻP-\alpha ).\delta =\breve{P} ʻʻ(CʻP-\beta ).\alpha ,\beta \in \text{D}ʻP_{\in }.\supset .\alpha \subset \beta &\qquad \text{(3)}\\ \vdash .*217·35. &\supset \vdash :\text{Hp}(3).\supset .\alpha \neq \beta &\qquad \text{(4)}\\ \vdash .(3).(4).*212·23.&\supset \vdash :\text{Hp}(3).\supset .\delta {(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP}\gamma &\qquad \text{(5)}\\ \vdash .*217·31.\supset \vdash :&\text{Hp}.\delta (\varsigma ʻ\breve{P} )\gamma .\supset .\\ &(\exists \alpha ,\beta ).\gamma =\breve{P} ʻʻ(CʻP-\alpha ).\delta =\breve{P} ʻʻ(CʻP-\beta ).\alpha ,\beta \in \text{D}ʻP_{\in } &\qquad \text{(6)}\\ \vdash .(5).(6).&\supset \vdash :\text{Hp}.\supset .\varsigma ʻ\breve{P} \,\unicode{x2abd}\, (\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP &\qquad \text{(7)}\\ \vdash .(2).(7).\supset \vdash .\text{Prop} \end{array}$

*217·37. $\begin{align}&\vdash :P\in \text{Ser}.\supset .(\breve{P} )_{\in }\mid (CʻP-)\upharpoonright \text{D}ʻP_{\in }\in (\varsigma ʻ\breve{P} )\overline{\,\text{smor}\,} (\text{Cnv}ʻ\varsigma ʻP)\\ &[*217·35·36]\end{align}$

*217·38. $\vdash :P\in \text{Ser}.\supset .(\varsigma ʻ\breve{P} )\,\text{smor}\,(\text{Cnv}ʻ\varsigma ʻP) \quad[*217·37]$

*217·4. $\begin{align}\vdash :&P,Q\in \text{Ser}.CʻP\cap CʻQ=\Lambda .\text{E}!BʻP.\text{E}!BʻQ.\supset .\\ &\varsigma ʻ(\breve{P} \unicode{x2909} Q)=(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP\unicode{x2909} (CʻP\cup )^{;}\varsigma ʻQ \quad[*217·22·36]\end{align}$

*217·41. $\begin{align}\vdash \colon\ldotp &P,Q\in \text{Ser}.CʻP\cap CʻQ=\Lambda :{\sim}\text{E}!BʻP.\lor.{\sim}\text{E}!BʻQ:\supset .\\ &\varsigma ʻ(\breve{P} \unicode{x2909} Q)=(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ\varsigma ʻP\unicode{x2909} (CʻP\cup )^{;}(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda ) &[*217·23·36]\end{align}$

*217·411. $\begin{align}\vdash :\text{Hp}&*217·41.\supset .{\varsigma ʻ(\breve{P} \unicode{x2909} Q)}\unicode{x0294f}(-{℩}ʻ\Lambda )=\\ &(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ(\varsigma ʻP)\unicode{x0294f}(-{℩}ʻ\text{D}ʻP)\unicode{x2909} (CʻP\cup )^{;}(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda )\\ &[*217·41]\end{align}$

*217·42. $\begin{align}\vdash :\text{Hp}*217·41.&\supset .\{\varsigma ʻ(\breve{P} \unicode{x2909} Q)\}\unicode{x0294f}\{-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻ(P\unicode{x2909} Q)\}=\\ &(\breve{P} )_{\in }^{;}(CʻP-)^{;}\text{Cnv}ʻ(\varsigma ʻP)\unicode{x0294f}(-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻP)\unicode{x21f8}\text{ᗡ}ʻP\\ &\unicode{x2909} (CʻP\cup )^{;}(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻQ) \quad[*217·411]\end{align}$

*217·43. $\begin{align}&\vdash \colon\ldotp P,Q\in \text{Ser}.CʻP\cap CʻQ=\Lambda :{\sim}\text{E}!BʻP.\lor.{\sim}\text{E}!BʻQ:\\ &X=(\varsigma ʻP)\unicode{x0294f}(-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻP).Y=(\varsigma ʻQ)\unicode{x0294f}(-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻQ).\\ &Z=\{\varsigma ʻ(\breve{P} \unicode{x2909} Q)\}\unicode{x0294f}\{-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻ(\breve{P} \unicode{x2909} Q)\}.\\ &W=\breve{X} \unicode{x21f8}\alpha \unicode{x2909} Y.\alpha {\sim}\in CʻX\cup CʻY.\supset .\\ &(\breve{P} )_{\in }\mid (CʻP-)\upharpoonright (\text{D}ʻP_{\in }-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻP)\unicode{x228d} (\text{D}ʻP)\downarrow \alpha \\ &\unicode{x228d} (CʻP\cup )\upharpoonright (\text{D}ʻQ_{\in }-{℩}ʻ\Lambda -{℩}ʻ\text{D}ʻQ)\in Z\,\overline{\text{smor}}\,\,W \quad[*217·37·25·42]\end{align}$

The purpose of this section is to express in a general form the definitions of convergence, the limits of functions, the continuity of functions, and kindred notions, and to give such elementary consequences of these definitions as may seem illustrative.

In the definitions usually given in treatises on analysis, it is assumed that both the arguments and the values of the function are numbers of some kind, generally real numbers, and limits are taken with respect to the order of magnitude. There is, however, nothing essential in the definitions to demand so narrow a hypothesis. What is essential is that the arguments should be given as belonging to a series, and that the values should also be given as belonging to a series, which need not be the same series as that to which the arguments belong. In what follows, therefore, we assume that all the possible arguments to our function, or at any rate all the arguments which we consider, belong to the field of a certain relation $Q$ , which, in cases where our definitions are useful, will be a serial relation; we assume similarly that the values of our function, at least for arguments belonging to $CʻQ$ , belong to the field of a relation $P$ , which, in all important cases, will be a serial relation. The function itself we represent by the relation of the value to the argument; that is, the relation of $f(x)$ to $x$ is to be $R$ , so that, if the function is one-valued, $f(x) = Rʻx$ . (If the function is not one-valued, $f(x)$ is any member of $\overrightarrow{R}ʻx$ .) Thus we may speak of $R$ as the function, $Q$ as the argument-series, and $P$ as the value-series.

To take an illustration: Suppose we are given a set of real numbers $x_{1}$ , $x_{2}$ , ... $x_{\nu }$ , ..., where $\nu$ may be any finite integer. Here $x_{\nu }$ is a function of $\nu$ ; the argument-series is that of the finite integers in order of magnitude, the value-series is that of the real numbers (or any part of this series which contains all the values $x_{1}$ , $x_{2}$ , ... $x_{\nu }$ , ...). The function $R$ is the relation of $x_{\nu}$ to $\nu$ , so that $x_{\nu } = Rʻ\nu$ . In this case, calling the argument-series $Q$ and the value-series $P$ (as will be done throughout this section), we have $\text{ᗡ}ʻR = CʻQ = \text{the finite integers}$ , $RʻʻCʻQ = \text{D}ʻR = \text{the class}\,\, x_{1}$ , [Pg 716] $x_{2}$ , ... $x_{\nu }$ , ..., and $R^{;}Q$ = the series $x_{1}$ , $x_{2}$ , ... $x_{\nu }$ , .... The series which arranges $x_{1}$ , $x_{2}$ , ... $x_{\nu }$ , ... in the order of their own magnitudes, instead of the order of magnitude of their suffixes, is $P\unicode{x0294f}\text{D}ʻR$ or $P\unicode{x0294f}RʻʻCʻQ$ . This will not be equal to $R^{;}Q$ unless the function is one which continually increases, i.e. one for which $\mu \lt \nu .\supset.x_{\mu } \lt x_{\nu }$ .

In general, the propositions of the present section are only important when $P$ and $Q$ are series. If our assertions are not to be trivial, we must have $\exists !CʻQ\cap \text{D}ʻR$ and $\exists !CʻP\cap RʻʻCʻQ$ , i.e. there must be arguments in $CʻQ$ which lead to values in $CʻP$ . It will also generally happen that the function is one-valued, i.e. that $R\in 1\rightarrow \text{Cls}$ . But the above conditions, though necessary to the importance of our propositions, are in general much narrower than the hypotheses that are necessary for the truth of our propositions.

The present section is wholly self-contained, that is to say, its propositions are not referred to in the sequel. We have, in this section, carried the subject as far as seemed suitable for the present work; its further development belongs to treatises on analysis.

We begin (*230) with a general conception which is involved in the notion of convergency. We shall say that the values of a function converge (or, simply, that the function itself converges) into the class $\alpha$ , if for late enough arguments the values always belong to the class $\alpha$ , i.e. if there is a term $y$ such that, if $yQ_{*}z$ , $Rʻz\in \alpha$ , or, to avoid assuming that $R$ is one-valued, $\overrightarrow{R}ʻz\subset \alpha$ . Thus the values of the function converge into the class $\alpha$ if $(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .$ If a term $y$ is one such that, from $y$ onward, all values belong to $\alpha$ , we write $y\in R\overline{Q}_{\text{cn}}\alpha$ (where " $\text{cn}$ " stands for "convergent"), i.e. we put $R\overline{Q}_{\text{cn}}\alpha =\hat{y} \{y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha\} \quad\text{Df}.$ When there is such a $y$ , i.e. when the function converges into the class $\alpha$ , we write " $RQ_{\text{cn}}\alpha$ ," i.e. we put $Q_{\text{cn}} = \hat{R} \hat{\alpha} (\exists !R\overline{Q}_{\text{cn}}\alpha ) \quad\text{Df}.$ " $RQ_{\text{cn}}\alpha$ " may be read " $R$ is $Q$ -convergent into $\alpha$ ." This means that for arguments sufficiently late in the $Q$ -series, the value of the function is always a member of $\alpha$ . Thus e.g. if $Rʻx = \dfrac{1}{x}$ , and $\alpha= \hat{y} (y \lt 1)$ , $RQ_{\text{cn}}\alpha$ , and if $z \gt 1$ , $z\in R\overline{Q}_{\text{cn}}\alpha$ .

We next consider (*231) limiting sections and ultimate oscillations of functions. For this purpose, we proceed as follows. If $RQ_{\text{cn}}\alpha$ , then $P_{*}ʻʻ\alpha$ is a section of the $P$ -series such that, for sufficiently late arguments, the values of the function must belong to $P_{*}ʻʻ\alpha$ . Hence if we take all possible values of $\alpha$ for which $RQ_{\text{cn}}\alpha$ , and take the logical product of all the resulting sections $P_{*}ʻʻ\alpha$ , we get a section containing all the "ultimate" values of the[Pg 717] function; moreover this is obviously the smallest section which has this property, because, if we take any section $\beta$ which contains all the "ultimate" values, we have $RQ_{\text{cn}}\beta$ , and $P_{*}ʻʻ\beta = \beta$ , and therefore the logical product in question is contained in $\beta$ . The logical product in question is $pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR.$ In order to avoid trivial exceptions which arise when $CʻQ\cap\text{ᗡ}ʻR = \Lambda$ , we define the "limiting section" as $pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP.$ This "limiting section" we denote by $P\overline{R}_{\text{sc}}Q$ , where the letters " $\text{sc}$ " stand for "section." Thus we put $P\overline{R}_{\text{sc}}Q = pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP \quad\text{Df}.$

$P\overline{R}_{\text{sc}}Q$ is the class of those members $x$ of the series $P$ which are such that, given any argument however late, there are still arguments as late or later for which the value of the function is not less than $x$ . In like manner, $\breve{P}\overline{R}_{\text{sc}}Q$ , which we will call the "limiting upper section," consists of those members $x$ of the series $P$ which are such that, given any argument however late, there are still arguments as late or later for which the value of the function is not greater than $x$ . Thus the product of $P\overline{R}_{\text{sc}}Q$ and $\breve{P}\overline{R}_{\text{sc}}Q$ is the smallest stretch which contains all the "ultimate" values of the function, i.e. it is the stretch consisting of those terms $x$ which are such that, however late an argument we take, there are arguments as late or later for which the value of the function is not greater than $x$ , and also arguments for which it is not less than $x$ . Thus the product of $P\overline{R}_{\text{sc}}Q$ and $\breve{P} \overline{R}_{\text{sc}}Q$ represents what we may call the "ultimate oscillation" of the function. We shall denote it by $P\overline{R}_{\text{os}}Q$ , putting $P\overline{R}_{\text{os}}Q = P\overline{R}_{\text{sc}}Q\cap \breve{P} \overline{R}_{\text{sc}}Q \quad\text{Df}.$ We may express $P\overline{R}_{\text{sc}}Q$ in a form not involving $Q_{\text{cn}}$ , namely (*231·12) $P\overline{R}_{\text{sc}}Q = pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\cap CʻP.$

This formula for $P\overline{R}_{\text{sc}}Q$ may be elucidated by the following considerations. If $y$ is any member of $CʻQ$ , then $\text{ᗡ}ʻR\cap \overleftarrow{Q}_{*}ʻy$ consists of all arguments from $y$ onwards. Hence $Rʻʻ(\text{ᗡ}ʻR\cap\overleftarrow{Q}_{*}ʻy)$ . i.e. $Rʻʻ\overleftarrow{Q}_{*}ʻy$ , consists of all values of the function for arguments from $y$ onwards. Hence $P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy$ consists of all members of the $P$ -series which are equalled or surpassed by values of the function for arguments equal to or later than $y$ . Now if a term $x$ belongs to the class $P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy$ for every argument $y$ , it is a term such that, however far up the argument-series $Q$ we go, we shall still find values as great as or greater than $x$ . When this is the case, we may say that $x$ is[Pg 718] $P$ -persistent. In this case, $x$ may be regarded as not greater than the "ultimate" values of the function. Now the class of arguments concerned is $CʻQ\cap \text{ᗡ}ʻR$ . Hence the class of $P$ -persistent terms is $pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR),$ where the factor $CʻP$ may be added in order to accommodate the formula to the trivial case where $CʻQ\cap \text{ᗡ}ʻR = \Lambda$ (the only case in which the factor $CʻP$ makes any difference). Thus the class of $P$ -persistent terms is the limiting section. Similarly the $\breve{P}$ -persistent terms are the limiting upper section. These are the terms which are not less than the "ultimate" values of the function. Thus the product $P\overline{R}_{\text{os}}Q$ is the terms which are neither greater than all ultimate values, nor less; hence it is the class of ultimate values, which may be appropriately called the "ultimate oscillation."

It will be seen that $P\overline{R}_{\text{os}}Q$ , being the product of an upper and lower section, is itself a stretch: we may call it (alternatively) the "limiting stretch." It consists of all members $x$ of the $P$ -series such that the function does not, however great we make the argument, become and remain less than $x$ , nor yet become and remain greater than $x$ . If $P\overline{R}_{\text{os}}Q$ consists of a single term, that term is the limit of the function as the argument travels up the series $Q$ . (This is, of course, in general different from the limit of the values of the function considered simply as a class of members of $CʻP$ , i.e. it is different from $\text{lt}_PʻRʻʻCʻQ$ .) If $P\overline{R}_{\text{os}}Q$ does not consist of a single term or none, we shall have two limits to consider, namely $\text{limax}_PʻP\overline{R}_{\text{os}}Q$ and $\text{limin}_PʻP\overline{R}_{\text{os}}Q$ , which give the two boundaries of the ultimate values of the function. When the class $P\overline{R}_{\text{os}}Q$ is null, the function may be regarded as having a definite limit: in this case, $P\overline{R}_{\text{sc}}Q$ and $\breve{P} \overline{R}_{\text{sc}}Q$ are the two parts of an "irrational" Dedekind cut, i.e. a cut in which the first portion has no maximum and the second no minimum. Thus $P\overline{R}_{\text{os}}Q\in 0\cup 1$ is the condition for a definite limit of the function as the argument grows indefinitely.

The above gives the generalization of the limit of a function when the argument may be any member of $CʻQ\cap \text{ᗡ}ʻR$ . In order to obtain limits for other classes of arguments, it is only necessary, as a rule, to limit the field of $Q$ to the class of arguments in question, i.e. to replace $Q$ by $Q\unicode{x0294f}\alpha$ (cf.*232). In order, however, to avoid vexatious and trivial exceptions arising when $\alpha \in 1$ , it is more convenient to replace $Q$ by $Q_{*}\unicode{x0294f}\alpha$ . Thus the section of $P$ defined by the class of arguments $\alpha$ is $P\overline{R}_{\text{sc}}(Q_{*}\unicode{x0294f}\alpha$ ). We put $(P\overline{R}Q)_{\text{sc}}ʻ\alpha = P\overline{R}_{\text{sc}} (Q_{*}\unicode{x0294f}\alpha ) \quad\text{Df}.$ This definition is useful because we very often wish to be able to exhibit the limiting section defined by $\alpha$ as a function of $\alpha$ . The section $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ is such that, if $x$ is any member of it, and $y$ is any argument belonging to $\alpha$ , there is in $\alpha$ an argument equal to or later than $y$ , for which the function[Pg 719] has a value equal to or later than $x$ . Thus $x$ is such that the function does not ultimately become less than $x$ as the argument increases in the class $\alpha$ . The limit or maximum of such terms as $x$ is the limit or maximum of the ultimate values of the function as the argument approaches the top of $\alpha$ . The class of ultimate values is $(P\overline{R}Q)_{\text{sc}}ʻ\alpha \cap (\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha ,\, \text{which we call}\, (P\overline{R}Q)_{\text{os}}ʻ\alpha .$ If the function has a definite limit as the argument increases in $\alpha$ , the class of ultimate values must not contain more than one term.

Our next number (*233) deals with the limit of a function for a given argument. The limit or maximum of the class of ultimate values is not necessarily the value for the limit of $\alpha$ . It will be found, however, that, with a suitable hypothesis, the limiting section $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ depends only upon $Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$ , and if $\alpha \cap \text{ᗡ}ʻR$ has no maximum, it depends only upon $Qʻʻ(\alpha \cap \text{ᗡ}ʻR)$ . Thus if $\alpha \cap \text{ᗡ}ʻR$ and $\beta \cap \text{ᗡ}ʻR$ both have the same limit, they define the same limiting section. Hence if $a$ is the limit of $\alpha$ , the limiting section of $\alpha$ is $(P\overline{R}Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻ\alpha$ . The upper limit of this is the upper limit of the ultimate values as the argument approaches $a$ from below. We put $R (PQ)ʻa = \text{limax}_Pʻ(P\overline{R}Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻa \quad\text{Df}.$ We have thus four limits of the function as the argument approaches $a$ , namely $R(PQ)ʻa,\quad R(\breve{P} Q)ʻa,\quad R(P\breve{Q} )ʻa,\quad R(\breve{P} \breve{Q} )ʻa .$ If $R$ is a continuous function, these four are all equal to $Rʻa$ ; but in general they are different from each other and from $Rʻa$ . The subject of the continuity of functions is dealt with in *234. When $R(PQ)ʻa= R(\breve{P} Q)ʻa$ , each is the limit of the function for the argument $a$ for approaches from below. It should be observed that if $R$ is defined for a set of arguments which are dense in $Q$ , i.e. if $\delta_{Q}ʻ\text{ᗡ}ʻR = CʻQ$ , then $R(PQ)ʻa$ and $R(\breve{P} Q)ʻa$ are defined for all arguments in $CʻQ$ .

In the present number, we have to consider the notion of a function converging into a given class, or, as we may express it, the notion that the value of the function "ultimately" belongs to the given class. If $R$ is the function in question, $\alpha$ the given class, and $Q$ a series to which the arguments belong, we say that " $R$ is $Q$ -convergent into $\alpha$ " if there is an argument $y$ such that, for all arguments from $y$ onward (in the $Q$ -order), the value of the function is an $\alpha$ . That is, $R$ is $Q$ -convergent into $\alpha$ if $(\exists y) . y\in CʻQ \cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy \subset \alpha .$ A term $y$ which is of this nature is said to belong to the class $R\overline{Q} _{\text{cn}}\alpha$ . Thus $R$ is $Q$ -convergent into $\alpha$ if the class $R\overline{Q} _{\text{cn}}\alpha$ is not null. Hence we have the following pair of definitions: $\begin{aligned} R\overline{Q} _{\text{cn}}\alpha &= CʻQ \cap \text{ᗡ}ʻR \cap \hat{y} (Rʻʻ\overleftarrow{Q}_{*}ʻy \subset \alpha ) \quad\text{Df},\\ Q_{\text{cn}} &= \hat{R} \hat{\alpha} (\exists ! R\overline{Q} _{\text{cn}}\alpha ) \quad\text{Df}. \end{aligned}$

In all the cases that have any importance, $R$ will be a one-valued function (i.e. a one-many relation), $Q$ will be a series, and $CʻQ \cap \text{ᗡ}ʻR$ will be a class having no maximum in $Q$ . For, if $CʻQ \cap \text{ᗡ}ʻR$ has a maximum in $Q$ , then the classes into which $R$ converges are simply those to which the value for this maximum belongs. The following propositions, though only important under the above circumstances, are in general true under much wider hypotheses.

It is possible to generalize still further the notion of convergence, so as to apply to any property which belongs to $R$ when confined to sufficiently late arguments. For this purpose, we have to consider $R\unicode{x0294f}\overleftarrow{Q}_{*}ʻz$ where $z$ is to be confined to terms later than or equal to some term $y$ . If, under these circumstances, $R \unicode{x0294f} \overleftarrow{Q}_{*}ʻz$ always belongs to the class $\lambda$ , we may say that $R$ ultimately becomes a $\lambda$ . We may put $\begin{aligned} R\overline{Q} _{\text{cng}} \lambda &= \hat{y}\{y \in CʻQ \cap \text{ᗡ}ʻR : yQ_{*}z .\supset _{z} . R \unicode{x0294f} \overleftarrow{Q}_{*}ʻz \in \lambda\} \quad\text{Df},\\ Q_{\text{cng}} &= \hat{R} \hat{\lambda} (\exists ! R\overline{Q} _{\text{cng}}\lambda ) \quad\text{Df}. \end{aligned}$

This is the general conception of which $Q_{\text{cn}}$ is a particular case; in fact, $\vdash :RQ_{\text{cn}}\alpha .\equiv .RQ_{\text{cng}}(\breve{\text{D}} ʻʻ\text{Cl}ʻ\alpha ).$ $Q_{\text{cng}}$ will have to be used when the ultimate properties of the function with which we are concerned are not properties of its values; but when they are properties of its values, $Q_{\text{cn}}$ enables us to deal with them more easily than $Q_{\text{cng}}$ .

*230·171. $\vdash :y\in R\overline{Q} _{\text{cn}}(\overleftarrow{P}_{*}ʻx).\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy$

*230·211. $\vdash \colon\ldotp \alpha \subset \beta .\supset :RQ_{\text{cn}}\alpha .\supset .RQ_{\text{cn}}\beta$

*230·253. $\begin{align}\vdash \colon\ldotp RʻʻCʻQ\subset \alpha .\supset :RQ_{\text{cn}}\alpha .&\equiv .\exists !CʻQ\cap \text{ᗡ}ʻR.\\ &\equiv .\exists !RʻʻCʻQ.\equiv .\dot{\exists} !(R\upharpoonright CʻQ)\end{align}$

*230·4. $\vdash .R\overline{Q} _{\text{cn}}\alpha =\text{ᗡ}ʻR\cap \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha )$

*230·42. $\vdash \colon\ldotp Q_{*}\in \text{connex} .\supset :RQ_{\text{cn}}\alpha .RQ_{\text{cn}}\beta .\equiv .RQ_{\text{cn}}(\alpha \cap \beta )$

*230·53. $\vdash \colon\ldotp Q\in \text{trans}\cap \text{connex} .\text{E}!\text{max}_{Q}ʻ\text{ᗡ}ʻR.\supset :RQ_{\text{cn}}\alpha .\equiv .\overrightarrow{R}ʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR\subset \alpha$

In virtue of this proposition, the case when $\text{E}!\text{max}_{Q}ʻ\text{ᗡ}ʻR$ is uninteresting, and in order to obtain interesting interpretations of our propositions, it is necessary to suppose that $\text{ᗡ}ʻR$ has no maximum. Similarly when, in later numbers, we consider $\text{ᗡ}ʻR\cap\overrightarrow{Q}ʻx$ , we shall only obtain interesting results when this has no maximum, which requires that $Q$ should be a compact series $(Q^{2}=Q)$ and $\text{ᗡ}ʻR$ should be dense in $Q$ . These assumptions are, however, not usually required for the truth of our propositions.

*230·01. $R\overline{Q} _{\text{cn}}\alpha =CʻQ\cap \text{ᗡ}ʻR\cap \hat{y} (Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha ) \quad\text{Df}$

*230·02. $Q_{\text{cn}}=\hat{R} \hat{\alpha} (\exists !R\overline{Q} _{\text{cn}}\alpha ) \quad\text{Df}$

*230·1. $\vdash :y\in R\overline{Q} _{\text{cn}}\alpha .\equiv .y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \quad[(*230·01)]$

*230·11. $\begin{align}&\vdash :RQ_{\text{cn}}\alpha .\equiv .\exists !R\overline{Q} _{\text{cn}}\alpha .\equiv .(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \\ &[(*230·02)]\end{align}$

*230·12. $\vdash :y\in R\overline{Q} _{\text{cn}}\alpha .\supset .\overleftarrow{Q}_{*}ʻy\cap \text{ᗡ}ʻR\subset R\overline{Q} _{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*230·1.*201·14·15.\supset \\ \vdash :y\in R\overline{Q} _{\text{cn}}\alpha .yQ_{*}z.z\in \text{ᗡ}ʻR.&\supset .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .z\in CʻQ\cap \text{ᗡ}ʻR.\overleftarrow{Q}_{*}ʻz\subset \overleftarrow{Q}_{*}ʻy.\\ [*37·2] &\supset .z\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻz\subset \alpha .\\ [*230·1]&\supset .z\in R\overline{Q} _{\text{cn}}\alpha :\supset \vdash .\text{Prop} \end{array}$

*230·13. $\vdash .R\overline{Q} _{\text{cn}}\alpha =(R\upharpoonright CʻQ)\overline{Q} _{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*35·64. &\supset \vdash .CʻQ\cap \text{ᗡ}ʻR=CʻQ\cap \text{ᗡ}ʻ(R\upharpoonright CʻQ) &\qquad \text{(1)}\\ \vdash .*37·421.&\supset \vdash .Rʻʻ\overleftarrow{Q}_{*}ʻy=(R\upharpoonright CʻQ)ʻʻ\overleftarrow{Q}_{*}ʻy &\qquad \text{(2)}\\ \vdash .(1).(2).*230·1.\supset \vdash .\text{Prop} \end{array}$

*230·131. $\vdash :R\upharpoonright CʻQ=T\upharpoonright CʻQ.\supset .R\overline{Q} _{\text{cn}}\alpha =T\overline{Q} _{\text{cn}}\alpha \quad[*230·13]$

*230·14. $\vdash :y\in R\overline{Q} _{\text{cn}}\alpha .\supset .\exists !CʻQ\cap \text{ᗡ}ʻR.\exists !\alpha \cap \text{D}ʻR$

Dem. $\begin{array}{l} \vdash .*230·1.&\supset \vdash :\text{Hp}.\supset .y\in CʻQ\cap \text{ᗡ}ʻR.\overrightarrow{R}ʻy\subset \alpha.\\ [*33·41] &\supset .y\in CʻQ\cap \text{ᗡ}ʻR.\exists !\overrightarrow{R}ʻy.\overrightarrow{R}ʻy\subset \alpha .\\ [*22·621.*33·15] &\supset .\exists !CʻQ\cap \text{ᗡ}ʻR.\exists !\alpha \cap \text{D}ʻR:\supset \vdash .\text{Prop} \end{array}$

*230·141. $\vdash .R\overline{Q} _{\text{cn}}\lambda =\Lambda \quad[*230·14.\text{Transp}]$

*230·142. $\vdash \colon\ldotp R=\dot{\Lambda} .\lor.Q=\dot{\Lambda} :\supset .R\overline{Q} _{\text{cn}}\alpha =\Lambda \quad[*230·14.\text{Transp}.*33·24]$

*230·15. $\vdash :RQ_{\text{cn}}\alpha .\supset .\exists !CʻQ\cap \text{ᗡ}ʻR.\exists !\alpha \cap \text{D}ʻR \quad[*230·14·11]$

*230·151. $\vdash :RQ_{\text{cn}}\alpha .\supset .\dot{\exists} !R.\dot{\exists} !Q.\exists !\alpha \quad[*230·15]$

*230·152. $\vdash \colon\ldotp R=\dot{\Lambda} .\lor.Q=\dot{\Lambda} .\lor.\alpha =\Lambda :\supset .{\sim}(RQ_{\text{cn}}\alpha ) \quad[*230·151.\text{Transp}]$

*230·16. $\vdash .R\overline{Q}_{\text{cn}}\alpha =R(\overline{Q_{*}\unicode{x0294f}\text{ᗡ}ʻR})_{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*230·14. &\supset \vdash :CʻQ\cap \text{ᗡ}ʻR=\Lambda .\supset .R\overline{Q} _{\text{cn}}\alpha =\Lambda .R(\overline{Q_{*}\unicode{x0294f}\text{ᗡ}ʻR} )_[cn]\alpha =\Lambda &\qquad \text{(1)}\\ \vdash .*90·41. &\supset \vdash :\exists !CʻQ\cap \text{ᗡ}ʻR.\supset .Cʻ(Q_{*}\unicode{x0294f}\text{ᗡ}ʻR)=CʻQ\cap \text{ᗡ}ʻR &\qquad \text{(2)}\\ \vdash .*37·26. &\supset \vdash .Rʻʻ\overleftarrow{Q}_{*}ʻy=Rʻʻ(\overleftarrow{Q}_{*}ʻy\cap \text{ᗡ}ʻR) &\qquad \text{(3)}\\ \vdash .(3).*35·102.&\supset \vdash :y\in \text{ᗡ}ʻR.\supset .Rʻʻ\overleftarrow{Q}_{*}ʻy=Rʻʻ\overleftarrow{Q_{*}\unicode{x0294f}\text{ᗡ}ʻR}ʻy &\qquad \text{(4)}\\ \vdash .(2).(4).*230·1.\supset \\ \vdash \colon\ldotp \exists !CʻQ\cap \text{ᗡ}ʻR.\supset :y\in R\overline{Q} _{\text{cn}}\alpha .&\equiv .y\in Cʻ(Q_{*}\unicode{x0294f}\text{ᗡ}ʻR)\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q_{*}\unicode{x0294f}\text{ᗡ}ʻR}ʻy\subset \alpha .\\ [*230·1] &\equiv .y\in R(\overline{Q_{*}\unicode{x0294f}\text{ᗡ}ʻR} )_{\text{cn}}\alpha &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*230·161. $\vdash :Q_{*}\unicode{x0294f}\text{ᗡ}ʻR=S_{*}\unicode{x0294f}\text{ᗡ}ʻR.\supset .R\overline{Q} _{\text{cn}}\alpha =R\overline{S} _{\text{cn}}\alpha \quad[*230·16]$

*230·17. $\vdash :y\in CʻQ\cap \text{ᗡ}ʻR.\supset .\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy$

Dem. $\begin{array}{l} \vdash .*90·12.*33·41.&\supset \vdash :\text{Hp}.\supset .y\in \overleftarrow{Q}_{*}.\exists !\overrightarrow{R}ʻy.\\ [*37·18]&\supset .\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy:\supset \vdash .\text{Prop} \end{array}$

*230·171. $\vdash :y\in R\overline{Q}_{\text{cn}}(\overleftarrow{P}_{*}ʻx).\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy$

Dem. $\begin{array}{l} \vdash .*230·1·17.\supset \vdash :\text{Hp}.&\supset .\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \overleftarrow{P}_{*}ʻx.\\ [*22·621] &\supset .\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy\cap \overleftarrow{P}_{*}ʻx.\\ [*37·46] &\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\supset \vdash .\text{Prop} \end{array}$

*230·21. $\vdash :\alpha \subset \beta .\supset .R\overline{Q}_{\text{cn}}\alpha \subset R\overline{Q}_{\text{cn}}\beta \quad[*230·1.*22·44]$

*230·211. $\vdash \colon\ldotp \alpha \subset \beta .\supset :RQ_{\text{cn}}\alpha .\supset .RQ_{\text{cn}}\beta \quad[*230·21·11]$

*230·22. $\vdash .R\overline{Q}_{\text{cn}}\alpha \cup R\overline{Q}_{\text{cn}}\beta \subset R\overline{Q}_{\text{cn}}(\alpha \cup \beta ) \quad[*230·21]$

*230·221. $\vdash \colon\ldotp RQ_{\text{cn}}\alpha .\lor.RQ_{\text{cn}}\beta :\supset .RQ_{\text{cn}}(\alpha \cup \beta ) \quad[*230·211]$

*230·23. $\vdash .R\overline{Q}_{\text{cn}}\alpha \cap R\overline{Q}_{\text{cn}}\beta =R\overline{Q}_{\text{cn}}(\alpha \cap \beta )$

Dem. $\begin{array}{l} \vdash .*230·1.\supset \vdash :y\in R\overline{Q}_{\text{cn}}\alpha \cap R\overline{Q}_{\text{cn}}\beta .&\equiv .y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \beta .\\ [Comp.*230·1] &\equiv .y\in R\overline{Q}_{\text{cn}}(\alpha \cap \beta ):\supset \vdash .\text{Prop} \end{array}$

*230·231. $\vdash :RQ_{\text{cn}}(\alpha \cap \beta ).\supset .RQ_{\text{cn}}\alpha .RQ_{\text{cn}}\beta \quad[*230·211]$

*230·24. $\vdash .R\overline{Q}_{\text{cn}}\alpha \cap R\overline{Q}_{\text{cn}}(\beta -\alpha )=\Lambda \quad[*230·23·141]$

*230·25. $\vdash .R\overline{Q}_{\text{cn}}\alpha =R\overline{Q}_{\text{cn}}(\alpha \cap \text{D}ʻR)=R\overline{Q}_{\text{cn}}(\alpha \cap Rʻʻ\breve{Q} _{*}ʻʻ\text{ᗡ}ʻR)=R\overline{Q}_{\text{cn}}(\alpha \cap RʻʻCʻQ)$

Dem. $\begin{array}{l} \vdash .*37·15.&\supset \vdash :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\equiv .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \cap \text{D}ʻR &\qquad \text{(1)}\\ \vdash .*37·18.\supset \vdash \colon\ldotp y\in \text{ᗡ}ʻR.&\supset :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset Rʻʻ\breve{Q} _{*}ʻʻ\text{ᗡ}ʻR:\\ [\text{Comp}] &\supset :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\equiv .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \cap Rʻʻ\breve{Q} _{*}ʻʻ\text{ᗡ}ʻR &\qquad \text{(2)}\\ \vdash .*37·2·18.&\supset \vdash .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset RʻʻCʻQ.\\ [\text{Comp}] &\supset \vdash :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\equiv .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \cap RʻʻCʻQ &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*230·1.\supset \vdash .\text{Prop} \end{array}$

*230·251. $\vdash .R\overline{Q}_{\text{cn}}(RʻʻCʻQ)=CʻQ\cap \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*33·15.*37·2.\supset \vdash .(y).Rʻʻ\overleftarrow{Q}_{*}ʻy\subset RʻʻCʻQ &\qquad \text{(1)}\\ \vdash .(1).*230·1.\supset \vdash .\text{Prop} \end{array}$

*230·252. $\vdash :RʻʻCʻQ\subset \alpha .\supset .R\overline{Q}_{\text{cn}}\alpha =CʻQ\cap \text{ᗡ}ʻR \quad[*230·25·251]$

*230·253. $\begin{align}\vdash \colon\ldotp &RʻʻCʻQ\subset \alpha .\supset:RQ_{\text{cn}}\alpha.\equiv.\exists !CʻQ\cap \text{ᗡ}ʻR.\equiv .\\ &\exists !RʻʻCʻQ.\equiv .\dot{\exists} !(R\upharpoonright CʻQ) \quad[*230·11·252.*37·401.*35·64]\end{align}$

*230·31. $\vdash .sʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset R\overline{Q} _{\text{cn}}(sʻ\kappa )$

Dem. $\vdash .*230·21.\supset \vdash :\alpha \in \kappa .\supset .R\overline{Q} _{\text{cn}}\alpha \subset R\overline{Q} _{\text{cn}}(sʻ\kappa ):\supset \vdash .\text{Prop}$

*230·311. $\vdash .Q_{\text{cn}}ʻʻ\kappa \subset \overrightarrow{Q}_{\text{cn}}ʻsʻ\kappa$

Dem. $\vdash .*230·211.\supset \vdash :\alpha \in \kappa .RQ_{\text{cn}}\alpha .\supset .RQ_{\text{cn}}(sʻ\kappa ):\supset \vdash .\text{Prop}$

*230·32. $\vdash .R\overline{Q} _{\text{cn}}(pʻ\kappa )=CʻQ\cap \text{ᗡ}ʻR\cap pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa$

Dem. $\begin{array}{l} \vdash .*230·1.\supset \\ \vdash \colon\ldotp y\in R\overline{Q} _{\text{cn}}(pʻ\kappa ).&\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset pʻ\kappa :\\ [*40·15] &\equiv :y\in CʻQ\cap \text{ᗡ}ʻR:\alpha \in \kappa .\supset _{\alpha }.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha :\\ [*4·73]&\equiv :y\in CʻQ\cap \text{ᗡ}ʻR:\alpha \in \kappa .\supset _{\alpha }.y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha :\\ [*230·1] &\equiv :y\in CʻQ\cap \text{ᗡ}ʻR\cap pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*230·321. $\vdash :\exists !k.\supset .R\overline{Q} _{\text{cn}}(pʻ\kappa )=pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa .pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset CʻQ\cap \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*230·1. &\supset \vdash :\alpha \in \kappa .\supset _{\alpha }.R\overline{Q} _{\text{cn}}\alpha \subset CʻQ\cap \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash .(1).*40·23·151.&\supset \vdash :\text{Hp}.\supset .pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset CʻQ\cap \text{ᗡ}ʻR &\qquad \text{(2)}\\ \vdash .(2).*230·32.\supset \vdash .\text{Prop} \end{array}$

*230·4. $\vdash .R\overline{Q} _{\text{cn}}\alpha =\text{ᗡ}ʻR\cap \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha )$

Dem. $\begin{array}{l} \vdash .*230·11.*90·21.&\supset \vdash .R\overline{Q} _{\text{cn}}\alpha \subset \text{ᗡ}ʻR.R\overline{Q} _{\text{cn}}\alpha \subset \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha ) &\qquad \text{(1)}\\ \vdash .*201·14·15. &\supset \vdash :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .yQ_{*}z.\supset .Rʻʻ\overleftarrow{Q}_{*}ʻz\subset \alpha &\qquad \text{(2)}\\ \vdash .(2).*230·1. &\supset \vdash :y\in R\overline{Q} _{\text{cn}}\alpha .yQ_{*}z,z\in \text{ᗡ}ʻR.\supset .z\in R\overline{Q} _{\text{cn}}\alpha :\\ [*37·105] &\supset \vdash .\text{ᗡ}ʻR\cap \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha )\subset R\overline{Q} _{\text{cn}}\alpha &\qquad \text{(3)}\\ \vdash .(1).(3).\supset \vdash .\text{Prop} \end{array}$

*230·41. $\vdash \colon\ldotp Q_{*}\in \text{connex} .\supset :R\overline{Q} _{\text{cn}}\alpha \subset R\overline{Q} _{\text{cn}}\beta .\lor.R\overline{Q} _{\text{cn}}\beta \subset R\overline{Q} _{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*211·61.*201·15.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha )&\subset \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\beta ).\lor.\breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\beta )\subset \breve{Q} _{*}ʻʻ(R\overline{Q} _{\text{cn}}\alpha ) :\\ [\text{Fact}.*230·4]\supset :R\overline{Q} _{\text{cn}}\alpha &\subset R\overline{Q} _{\text{cn}}\beta .\lor.R\overline{Q} _{\text{cn}}\beta \subset R\overline{Q} _{\text{cn}}\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*230·42. $\vdash \colon\ldotp Q_{*}\in \text{connex} .\supset :RQ_{\text{cn}}\alpha .RQ_{\text{cn}}\beta .\equiv .RQ_{\text{cn}}(\alpha \cap \beta )$

Dem. $\begin{array}{l} \vdash .*230·41.\supset \vdash \colon\ldotp \text{Hp}.&\supset :R\overline{Q} _{\text{cn}}\alpha \cap R\overline{Q} _{\text{cn}}\beta =R\overline{Q} _{\text{cn}}\alpha .\lor.R\overline{Q} _{\text{cn}}\alpha \cap R\overline{Q} _{\text{cn}}\beta =R\overline{Q} _{\text{cn}}\beta :\\ [*230·23] &\supset :R\overline{Q} _{\text{cn}}(\alpha \cap \beta )=R\overline{Q} _{\text{cn}}\alpha .\lor.R\overline{Q} _{\text{cn}}(\alpha \cap \beta )=R\overline{Q} _{\text{cn}}\beta :\\ [*230·11] &\supset :RQ_{\text{cn}}\alpha .RQ_{\text{cn}}\beta .\supset .RQ_{\text{cn}}(\alpha \cap \beta ) &\qquad \text{(1)}\\ \vdash .(1).*230·231.\supset \vdash .\text{Prop} \end{array}$

*230·421. $\vdash :Q_{*}\in \text{connex} .\alpha \cap \beta =\Lambda .\supset .{\sim}\{RQ_{\text{cn}}\alpha .RQ_{\text{cn}}\beta\} \quad[*230·42·141]$

*230·51. $\vdash :RQ_{\text{cn}}\alpha .\supset .pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\cap \text{ᗡ}ʻR\subset R\overline{Q} _{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*201·14.&\supset \vdash :y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .z\in pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.\supset .Rʻʻ\overleftarrow{Q}_{*}ʻz\subset \alpha &\qquad \text{(1)}\\ \vdash .*230·151.*40·62. &\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset CʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).*230·1. &\supset \vdash :\text{Hp}.y\in R\overline{Q} _{\text{cn}}\alpha .z\in &pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\cap \text{ᗡ}ʻR.\supset .\\ &z\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻz\subset \alpha &\qquad \text{(3)}\\ \vdash .(3).*230·1·11.\supset \vdash .\text{Prop} \end{array}$

*230·511. $\vdash :y\in pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.\supset .\overleftarrow{Q}_{*}ʻy=pʻ\overleftarrow{Q}_{*}ʻʻCʻQ$

Dem. $\begin{array}{l} \vdash .*40·12.&\supset \vdash :\text{Hp}.\supset .pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \overleftarrow{Q}_{*}ʻy &\qquad \text{(1)}\\ \vdash .*40·53.\supset \vdash \colon\ldotp \text{Hp}.z\in \overleftarrow{Q}_{*}ʻy.&\supset :x\in CʻQ.\supset _{x}.xQ_{*}y:yQ_{*}z:\\ [*201·15] &\supset :x\in CʻQ.\supset _{x}.xQ_{*}z:\\ [*40·53] &\supset :z\in pʻ\overleftarrow{Q}_{*}ʻʻCʻQ &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*230·512. $\vdash :\text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset R\overline{Q} _{\text{cn}}\alpha .\supset .Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha$

Dem. $\begin{array}{l} \vdash .*230·1.\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in \text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.&\supset .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\\ [*230·511]&\supset .Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*10·23.&\supset \vdash :\text{Hp}.\exists !\text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.\supset .Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha &\qquad \text{(2)}\\ \vdash .*37·26·29. \supset \vdash :\text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ=\Lambda .&\supset .Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ=\Lambda .\\ [*24·12] &\supset .Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*230·513. $\vdash \colon\ldotp \dot{\exists} !Q.\supset :Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha .\equiv .\text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset R\overline{Q} _{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash .*230·511.\supset \vdash \colon\ldotp y\in \text{ᗡ}ʻR\cap &pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.\supset :\\ &Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha .\supset .y\in \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha &\qquad \text{(1)}\\ \vdash .(1).*40·62.*230·1.\supset \\ &\vdash :\dot{\exists} !Q.y\in \text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ.Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ.\subset \alpha .\supset .y\in R\overline{Q} _{\text{cn}}\alpha &\qquad \text{(2)}\\ \vdash .(2).\text{Comm}.&\supset \vdash \colon\ldotp \dot{\exists} !Q.\supset :\\ &Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha .\supset .\text{ᗡ}ʻR\cap pʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset R\overline{Q} _{\text{cn}}\alpha &\qquad \text{(3)}\\ \vdash .(3).*230·512.\supset \vdash .\text{Prop} \end{array}$

*230·514. $\vdash : \dot{\exists} ! Q. \exists !pʻ\overleftarrow{Q}_{*}ʻʻCʻQ \cap \text{ᗡ}ʻR . Rʻʻpʻ\overleftarrow{Q}_{*}ʻʻCʻQ\subset \alpha . \supset . RQ_{\text{cn}}\alpha$

Dem. $\begin{array}{l} \vdash . *230·513. \supset \vdash : \text{Hp}. &\supset . \exists ! pʻ\overleftarrow{Q}_{*}ʻʻCʻQ \cap \text{ᗡ}ʻR . pʻ\overleftarrow{{Q}_{*}} ʻʻ CʻQ \cap \text{ᗡ}ʻR \subset R\overline{Q} _{\text{cn}}\alpha .\\ [*24·58.*230·11] &\supset . RQ_{\text{cn}} \alpha : \supset \vdash . \text{Prop} \end{array}$

*230·52. $\vdash : \exists ! CʻQ \cap \text{ᗡ}ʻR . \exists ! \text{ᗡ}ʻR \cap pʻ\overleftarrow{Q}_{*} ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa .\kappa \subset \overleftarrow{Q}_{\text{cn}}ʻR .\supset . pʻ\kappa \in \overleftarrow{Q}_{\text{cn}}ʻR$

Dem. $\begin{array}{l} \vdash . *40·16 . &\supset \vdash : \alpha \in \kappa . \supset . pʻ\overleftarrow{Q}_{*}ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset pʻ\overleftarrow{Q}_{*}ʻʻR\overline{Q} _{\text{cn}}\alpha &\qquad \text{(1)}\\ \vdash . (1). *40·61 . \supset \\ \vdash \colon\ldotp \text{Hp} . \supset : \alpha \in \kappa . &\supset . pʻ\overleftarrow{Q}_{*}ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset \breve{Q} _{*}ʻʻR\overline{Q} _{\text{cn}}\alpha .\\ [\text{Fact}.*230·4] &\supset . \text{ᗡ}ʻR \cap pʻ\overleftarrow{Q}_{*}ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset R\overline{Q} _{\text{cn}}\alpha :\\ [*40·44] &\supset : \text{ᗡ}ʻR \cap pʻ\overleftarrow{Q}_{*}ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset pʻR\overline{Q} _{\text{cn}}ʻʻ\kappa :\\ [*230·321] \supset :\exists !\kappa .&\supset. \text{ᗡ}ʻR \cap pʻ\overleftarrow{Q}_{*}ʻʻsʻR\overline{Q} _{\text{cn}}ʻʻ\kappa \subset R\overline{Q} _{\text{cn}}(pʻ\kappa ).\\ [\text{Hp}.*24·58] &\supset . \exists ! R\overline{Q} _{\text{cn}}(pʻ\kappa ).\\ [*230·11] &\supset . pʻ\kappa \in \overleftarrow{Q}_{\text{cn}}ʻR &\qquad \text{(2)}\\ \vdash . *230·253.*40·2 . &\supset \vdash : \exists ! CʻQ \cap \text{ᗡ}ʻR . \kappa = \Lambda . \supset . P ʻ\kappa \in \overleftarrow{Q}_{\text{cn}}ʻR &\qquad \text{(3)}\\ \vdash . (2) . (3). \supset \vdash . \text{Prop} \end{array}$

*230·53. $\vdash \colon\ldotp Q \in \text{trans} \cap \text{connex} . \text{E}! \text{max}_Qʻ\text{ᗡ}ʻR . \supset : RQ_{\text{cn}}\alpha . \equiv . \overrightarrow{R}ʻ\text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha$

Dem. $\begin{array}{l} \vdash . *205·111. &\supset \vdash : \text{Hp}. \supset . \text{max}_Q ʻ\text{ᗡ}ʻR \in CʻQ \cap \text{ᗡ}ʻR &\qquad \text{(1)}\\ \vdash . *205·141.*201·18. \supset \vdash : \text{Hp}. &\supset . \overleftarrow{Q}_*ʻ\text{max}_Qʻ\text{ᗡ}ʻR \cap \text{ᗡ}ʻR = \iota ʻ\text{max}_Qʻ\text{ᗡ}ʻR.\\ [*37·26.*53·301] &\supset . Rʻʻ(\overleftarrow{{Q}_{*}}ʻ\text{max}_Qʻ\text{ᗡ}ʻR) = \overrightarrow{R}ʻ\text{max}_Qʻ\text{ᗡ}ʻR &\qquad \text{(2)}\\ \vdash . (1). (2) . \supset \vdash \colon\ldotp \text{Hp}.& \supset : \overrightarrow{R}ʻ \text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha . \supset . \text{max}_Qʻ\text{ᗡ}ʻR \in (R\overline{Q} _{\text{cn}}\alpha ).\\ [*230·11] &\supset . RQ_{\text{cn}} \alpha &\qquad \text{(3)}\\ \vdash .*205·36. \supset \vdash \colon\ldotp \text{Hp}. &\supset : y\in CʻQ \cap \text{ᗡ}ʻR . Rʻʻ\overleftarrow{{Q}_{*}}ʻy \subset \alpha . \supset . Rʻʻ\overleftarrow{Q}_* ʻ\text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha :\\ [*230·11] \supset : RQ_{\text{cn}}\alpha . &\supset . Rʻʻ\overleftarrow{Q}_*ʻ\text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha .\\ [(2)] &\supset . \overrightarrow{R}ʻ\text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha &\qquad \text{(4)}\\ \vdash . (3). (4). \supset \vdash . \text{Prop} \end{array}$

*230·54. $\vdash \colon\ldotp Q \in \text{trans} \cap \text{connex} . \text{E}! \text{max}_Qʻ\text{ᗡ}ʻR . \supset : \kappa \subset \overleftarrow{{Q}_{\text{cn}}}ʻR . \equiv . P ʻ\kappa \in \overleftarrow{Q}{\text{cn}}ʻR$

Dem. $\begin{array}{l} \vdash . *230·53. \supset \vdash \colon\colon \text{Hp}. \supset \colon\ldotp \kappa \subset \overleftarrow{{Q}_{\text{cn}}}ʻR . &\equiv : \alpha \in \kappa . \supset _a . \overrightarrow{R}ʻ\text{max}_Qʻ\text{ᗡ}ʻR \subset \alpha :\\ [*40·15] &\equiv : \overrightarrow{R} ʻ \text{max}_Q ʻ\text{ᗡ}ʻR \subset pʻ\kappa :\\ [*230·53] &\equiv : pʻ\kappa \in \overleftarrow{Q}_{\text{cn}}ʻR \colon\colon\supset \vdash . \text{Prop} \end{array}$

In the present number we are concerned with the limiting section defined in a series $P$ , to which the values of a function $R$ belong, as the arguments to the function increase in the argument-series $Q$ . That is, we are concerned with the section consisting of those terms $x$ of $CʻP$ which are such that, however great the argument to $R$ becomes, there are still values at least as great as $x$ . Such terms as $x$ may be said to be $P$ -persistent; $x$ is $P$ -persistent if the function does not ultimately become and remain less than $x$ . The class of persistent terms is called the limiting section. The limiting section may be defined as follows. If $\alpha$ is any class into which $R$ is $Q$ -convergent, then the section $P_{*}ʻʻ\alpha$ is such that the values of the function are ultimately contained in it. The product of such terms as $P_{*}ʻʻ\alpha$ is the smallest section having this property. Hence if $x$ be any member of this section, then ultimately (i.e. for arguments far enough along the $Q$ series) the values of the function $R$ do not persistently remain less than $x$ in the $P$ series. Thus the product of such terms as $P_{*}ʻʻ\alpha$ is the limiting section, and we may therefore put $P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP \quad\text{Df},$ where the letters " $\text{sc}$ " are intended to suggest "section." (The factor $CʻP$ on the right is superfluous except when $\overleftarrow{Q}_{\text{cn}}ʻR=\Lambda$ , i.e. when $CʻQ\cap\text{ᗡ}ʻR=\Lambda$ .)

We will call the limiting section of $\breve{P}$ , i.e. $\breve{P} \overline{R} _{\text{sc}}Q$ , the "limiting upper section." It will be seen that if $x$ is a member of $\breve{P}\overline{R} _{\text{sc}}Q$ , then the function does not ultimately become and remain, as far as some of its arguments are concerned, greater than $x$ , that is, however great we make the argument, we still find values not greater than $x$ . Hence if $x$ belongs to both $P\overline{R} _{\text{sc}}Q$ and $\breve{P} \overline{R}_{\text{sc}}Q$ , we find values not less than $x$ and values not greater than $x$ however great we make the argument. This class, $P\overline{R}_{\text{sc}}Q\cap \breve{P} \overline{R} _{\text{sc}}Q$ , may therefore be regarded as the class of ultimate values of the function. We will call it the "ultimate oscillation" of the function, since, as the argument approaches $\infty$ , the value of the function ultimately oscillates in this stretch of $P$ , and no smaller stretch has the same property. We will denote this class by " $P\overline{R}_{\text{os}}Q$ ," where " $\text{os}$ " is intended to suggest "oscillation." $P\overline{R} _{\text{os}}Q$ is a stretch in $CʻP$ , because it is the product of two sections. Hence we shall also call it the "limiting[Pg 728] stretch." When the function has a definite limit as the argument approaches $\infty$ , the limiting stretch must not contain more than one term.

Limits of functions for arguments $x$ in the middle of $CʻQ\cap\text{ᗡ}ʻR$ , which will be considered later, are derived from the limits considered in the present number by limiting the field of $Q$ to predecessors of $x$ .

*231·103. $\vdash .P\overline{R} _{\text{os}}Q=P_{\text{po}}\overline{R} _{\text{os}}Q=P_{*}\overline{R} _{\text{os}}Q$

*231·12. $\vdash .P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\cap CʻP$

*231·141. $\vdash :Q_{*}\in \text{connex} .RQ_{\text{cn}}(\overleftarrow{P}_{*}ʻx).\supset .x\in P\overline{R} _{\text{sc}}Q$

*231·191. $\begin{align}\vdash :P_{\text{po}}\in \text{connex} .&\exists !P\overline{R} _{\text{os}}Q.\supset .\\ &P\overline{R} _{\text{sc}}Q=P_{*}ʻʻ(P\overline{R} _{\text{os}}Q).Pʻʻ(P\overline{R} _{\text{sc}}Q)=P_{\text{po}}ʻʻ(P\overline{R} _{\text{os}}Q)\end{align}$

*231·192. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in &\text{connex} .\exists !P\overline{R} _{\text{os}}Q.\exists !P\overline{R} _{\text{os}}Q'.\supset :\\ &P\overline{R} _{\text{os}}Q=P\overline{R} _{\text{os}}Q'.\equiv .P\overline{R} _{\text{sc}}Q=P\overline{R} _{\text{sc}}Q'.\breve{P} \overline{R} _{\text{sc}}Q=\breve{P} \overline{R} _{\text{sc}}Q'\end{align}$

*231·193. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.P\overline{R} _{\text{os}}Q&\in 1.\supset .\\ &P\overline{R} _{\text{os}}Q=\iota ʻ\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)=\iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\end{align}$

In all ordinary circumstances, we shall have $CʻP=P\overline{R}_{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q$ , so that if the upper and lower limiting sections do not have more than one term in common (i.e. if $P\overline{R} _{\text{os}}Q\in 1)$ , they define a Dedekind cut in $P$ . The following propositions are concerned with this fact:

*231·202. $\vdash :P_{*},Q_{*}\in \text{connex} .\exists !P\overline{R} _{\text{sc}}Q.\supset .CʻP-(P\overline{R} _{\text{sc}}Q)\subset \breve{P} \overline{R} _{\text{sc}}Q$

*231·21. $\begin{align}\vdash :P_{*},Q_{*}\in \text{connex} .CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻ&CʻP.\supset .\\ &CʻP=P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q\end{align}$

*231·22. $\vdash :P_{*},Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset .CʻP=P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q$

Note that " $RʻʻCʻQ\subset CʻP$ " is the hypothesis that for arguments belonging to $CʻQ$ , the values belong to $CʻP$ .

*231·24. $\vdash :P_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.{\sim}\{RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx)\}.\supset .\overrightarrow{P}_{*}ʻx\subset P\overline{R} _{\text{sc}}Q$

*231·01. $P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP \quad\text{Df}$

*231·02. $P\overline{R} _{\text{os}}Q=P\overline{R} _{\text{sc}}Q\cap \breve{P} \overline{R} _{\text{sc}}Q \quad\text{Df}$

*231·1. $\vdash .P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP \quad[(*231·01)]$

*231·101. $\vdash .P\overline{R} _{\text{os}}Q=P\overline{R} _{\text{sc}}Q\cap \breve{P} \overline{R} _{\text{sc}}Q \quad[(*231·02)]$

*231·102. $\vdash .P\overline{R} _{\text{sc}}Q=P_{\text{po}}\overline{R} _{\text{sc}}Q=P_{*}\overline{R} _{\text{sc}}Q \quad[*231·1.*91·602.*90·4]$

*231·103. $\vdash .P\overline{R} _{\text{os}}Q=P_{\text{po}}\overline{R} _{\text{os}}Q=P{*}\overline{R} _{\text{os}}Q \quad[*231·102·101]$

*231·11. $\vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.\equiv :RQ_{\text{cn}}\alpha .\supset _{\alpha }.x\in P_{*}ʻʻ\alpha :x\in CʻP \quad[*231·1]$

*231·111. $\begin{align}&\vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\supset _{y,\alpha }.x\in P_{*}ʻʻ\alpha :x\in CʻP\\ &[*231·11.*230·11]\end{align}$

*231·112. $\vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:x\in CʻP$

Dem. $\begin{array}{l} \vdash .*231·111.*22·42.\supset \\ \vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.&\supset :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}yʻ:x\in CʻP &\qquad \text{(1)}\\ \vdash .*37·2.\supset \\ \vdash \colon\ldotp y\in CʻQ\cap \text{ᗡ}ʻ&R.\supset _{y}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:x\in CʻP:\supset :\\ &y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha .\supset _{y,\alpha }.x\in P_{*}ʻʻ\alpha :x\in CʻP:\\ [*231·111] &\supset :x\in P\overline{R} _{\text{sc}}Q &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*231·113. $\begin{align}&\vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.x(P_{*}\mid R\mid \breve{Q} _{*})y:x\in CʻP\\ &[*231·112.*37·3]\end{align}$

If $R$ is a one-valued function (i.e. a one-many relation), and if we write $x\leq x'$ for $xP_{*}x'$ , and $y\leq y'$ for $yQ_{*}y'$ , we have $x\in P\overline{R} _{\text{sc}}Q.\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.(\exists y').y\leq y'.x\leq Rʻy':x\in CʻP.$ That is, $x$ belongs to $P\overline{R} _{\text{sc}}Q$ if, for any argument $y$ in $CʻQ$ , we can find an argument $y'$ greater than or equal to $y$ , for which the value is greater than or equal to $x$ .

*231·12. $\vdash .P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\cap CʻP \quad[*231·112]$

*231·121. $\begin{align}\vdash :\exists !&CʻQ\cap \text{ᗡ}ʻR.\supset .\\ &P\overline{R} _{\text{sc}}Q=pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR=pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*230·253.\supset \vdash :\text{Hp}.&\supset .\exists !\overleftarrow{Q}_{\text{cn}}ʻR.\\ [*40·23.*37·47] &\supset .pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\subset sʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR.\\ [*40·38.*37·16] &\supset .pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\subset CʻP &\qquad \text{(1)}\\ \vdash .*40·23.\supset \vdash :\text{Hp}.\supset .pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)&\subset sʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\\ [*40·38.*37·16] &\subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).*231·1·12.\supset \vdash .\text{Prop} \end{array}$

*231·13. $\vdash .P\overline{R}_{\text{sc}}Q\in \text{sect}ʻP \quad[*211·631·13.*231·12]$

*231·132. $\vdash :\exists !CʻQ\cap \text{ᗡ}ʻR.\supset .P\overline{R}_{\text{sc}}Q\subset P_{*}ʻʻRʻʻ\breve{Q} _{*}ʻʻ\text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*40·23.*231·121.\supset \vdash :\text{Hp}.\supset .P\overline{R}_{\text{sc}}Q&\subset sʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\\ [*40·38] &\subset P_{*}ʻʻRʻʻsʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR)\\ [*40·52.*37·265]&\subset P_{*}ʻʻRʻʻ\breve{Q} _{*}ʻʻ\text{ᗡ}ʻR:\supset \vdash .\text{Prop} \end{array}$

*231·133. $\vdash :CʻP\cap \text{ᗡ}ʻR=\Lambda .\supset .P\overline{R}_{\text{sc}}Q=CʻP \quad[*231·12.*37·29.*40·2]$

*231·134. $\vdash .P_{\text{po}}ʻʻ(P\overline{R}_{\text{sc}}Q)=Pʻʻ(P\overline{R}_{\text{sc}}Q) \quad[*211·131.*231·13]$

*231·14. $\begin{align}&\vdash \colon\colon R\in 1\rightarrow \text{Cls}.\supset \colon\ldotp x\in P\overline{R}_{\text{sc}}Q.\equiv :\\ &y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.(\exists z).yQ_{*}z.xP_{*}(Rʻz):x\in CʻP \quad[*71·7.*231·113]\end{align}$

*231·141. $\vdash :Q_{*}\in \text{connex} .RQ_{\text{cn}}(\overleftarrow{P}_{*}ʻx).\supset .x\in P\overline{R}_{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*230·4.\supset \vdash :y\in R\overline{Q}_{\text{cn}}(\overleftarrow{P}_{*}ʻx).z\in \text{ᗡ}ʻR.yQ_{*}z.&\supset .z\in R\overline{Q}_{\text{cn}}(\overleftarrow{P}_{*}ʻx).\\ [*230·171] &\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(1)}\\ \vdash .*230·171.*96·3.\supset\\ \vdash :y\in R\overline{Q}_{\text{cn}}(\overleftarrow{P}_{*}ʻx).zQ_{*}y.&\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy.\overleftarrow{Q}_{*}ʻy\subset \overleftarrow{Q}_{*}ʻz.\\ [*37·2] &\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash :\text{Hp}.y\in P\overline{Q}_{\text{cn}}(\overleftarrow{P}_{*}ʻx).z\in CʻQ\cap \text{ᗡ}ʻR.\supset .x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(3)}\\ \vdash .(3).*230·11.&\supset \vdash \colon\ldotp \text{Hp}.\supset :z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(4)}\\ \vdash .*230·151. &\supset \vdash :\text{Hp}.\supset .x\in CʻP &\qquad \text{(5)}\\ \vdash .(4).(5).*231·112.\supset \vdash .\text{Prop} \end{array}$

*231·142. $\vdash :\alpha \in \text{sect}ʻP.RQ_{\text{cn}}\alpha .\supset .P\overline{R}_{\text{sc}}Q\subset \alpha$

Dem. $\begin{array}{l} \vdash .*231·1.*40·12.\supset \vdash :\text{Hp}.&\supset .P\overline{R}_{\text{sc}}Q\subset P_{*}ʻʻ\alpha .\\ [*211·13] &\supset .P\overline{R}_{\text{sc}}Q\subset \alpha :\supset \vdash .\text{Prop} \end{array}$

*231·143. $\vdash :RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx).\supset .P\overline{R}_{\text{sc}}Q\subset \overrightarrow{P}_{*}ʻx \quad[*231·142.*211·13]$

*231·144. $\vdash :RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻx).\supset .P\overline{R}_{\text{sc}}Q\subset \overrightarrow{P}_{\text{po}}ʻx \quad[*231·142.*211·16]$

*231·15. $\vdash :RʻʻCʻQ\subset CʻP.\supset .CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R}_{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*37·2.\supset \vdash \colon\ldotp \text{Hp}.&\supset :Rʻʻ\overleftarrow{Q}_{*}ʻy\subset CʻP:\\ [*40·16] &\supset :pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset pʻ\overrightarrow{P}_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\\ [*40·23] &\supset :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\\ [*231·12] &\supset :CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R}_{\text{sc}}Q\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*231·151. $\begin{align}&\vdash :P_{*}\in \text{connex} .CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R} _{\text{sc}}Q.\supset .\overrightarrow{B}ʻP\subset P\overline{R} _{\text{sc}}Q\\ &[*202·521]\end{align}$

*231·152. $\begin{align}&\vdash :P_{*}\in \text{connex} .CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R} _{\text{sc}}Q.\exists !\overrightarrow{B}ʻP.\supset .BʻP\in P\overline{R} _{\text{sc}}Q\\ &[*231·151.*202·523]\end{align}$

The hypothesis $CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R} _{\text{sc}}Q$ is verified not only when $RʻʻCʻQ\subset CʻP$ , but also under certain more general hypotheses. Two such hypotheses, namely $\begin{aligned} &CʻQ\cap \text{ᗡ}ʻR\subset \breve{R} ʻʻCʻP\\ \text{and}\quad &CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP, \end{aligned}$ are considered in the following propositions.

*231·153. $\vdash :CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.\supset .CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP\subset P\overline{R} _{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*37·1.\supset \vdash \colon\colon&\text{Hp}.\supset \colon\ldotp y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}:(\exists z).z\in CʻP.z(R\mid \breve{Q} _{*})y:\\ [*40·51] \supset _{y}:x \in pʻ\overrightarrow{P}_{*}ʻʻCʻP.&\supset _{x}.(\exists z).z\in CʻP.z(R\mid \breve{Q} _{*})y.xP_{*}z.\\ [*34·1] &\supset _{x}.x(P_{*}\mid R\mid \breve{Q} _{*})y &\qquad \text{(1)}\\ \vdash .(1).\text{Comm}.\supset \\ \vdash \colon\ldotp \text{Hp}.x\in CʻP\cap pʻ\overrightarrow{P}_{*}ʻʻCʻP.\supset :y\in CʻQ\cap \text{ᗡ}ʻR.&\supset _{y}.x(P_{*}\mid R\mid \breve{Q} _{*})y:x\in CʻP:\\ [*231·113] &\supset :x\in P\overline{R} _{\text{sc}}Q\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*231·154. $\vdash :RʻʻCʻQ\subset CʻP.\supset .CʻQ\cap \text{ᗡ}ʻR\subset \breve{R} ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*37·2.\supset \vdash :\text{Hp}.&\supset .\breve{R} ʻʻRʻʻCʻQ\subset \breve{R} ʻʻCʻP.\\ [*37·501] &\supset .CʻQ\cap \text{ᗡ}ʻR\subset \breve{R} ʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

*231·155. $\vdash :CʻQ\cap \text{ᗡ}ʻR\subset \breve{R} ʻʻCʻP.\supset .CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP$

Dem. $\begin{array}{l} \vdash .*22·43·45.\supset \vdash :\text{Hp}.\supset .CʻQ\cap \text{ᗡ}ʻR&\subset CʻQ\cap \breve{R} ʻʻCʻP\\ [*90·33] &\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP:\supset \vdash .\text{Prop} \end{array}$

*231·156. $\begin{align}\vdash \colon\ldotp CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.&\equiv :\Lambda {\sim}\in P_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR):\\ &\equiv :z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.\exists !CʻP\cap Rʻʻ\overleftarrow{Q}_{*}ʻz\end{align}$

Dem. $\begin{array}{l} \vdash .*37·1.\supset \vdash \colon\ldotp &CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.\equiv :\\ &z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.(\exists x).x\in CʻP.z(Q_{*}\mid \breve{R} )x:\\ [*37·3] &\equiv :z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.(\exists x).x\in CʻP.x\in Rʻʻ\overleftarrow{Q}_{*}ʻz:\\ [*22·33] &\equiv :z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.\exists !CʻP\cap Rʻʻ\overleftarrow{Q}_{*}ʻz: &\qquad \text{(1)}\\ [*37·265·43] &\equiv :z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.\exists !P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*231·16. $\begin{align}\vdash :P_{*}\in \text{connex} .\exists !\overrightarrow{B}ʻP.&CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.\supset .\\ &\exists !P\overline{R} _{\text{sc}}Q.BʻP\in P\overline{R} _{\text{sc}}Q \quad[*231·152·153]\end{align}$

*231·161. $\begin{align}&\vdash :P_{*}\in \text{connex} .\exists !\overrightarrow{B}ʻP.RʻʻCʻQ\subset CʻP.\supset .\exists !P\overline{R} _{\text{sc}}Q.BʻP\in P\overline{R} _{\text{sc}}Q\\ &[*231·154·155·16]\end{align}$

*231·17. $\vdash :RʻʻCʻQ\subset CʻP.\supset .R\overline{Q} _{\text{cn}}\alpha \subset R\overline{Q} _{\text{cn}}(P_{*}ʻʻ\alpha )$

Dem. $\begin{array}{l} \vdash .*90·13.\supset \vdash \colon\ldotp \text{Hp}.&\supset :y\in CʻQ.\supset .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset CʻP:\\ [*230·1] \supset :y\in R\overline{Q} _{\text{cn}}\alpha .&\supset .y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \alpha \cap CʻP.\\ [*90·33] &\supset .y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset P_{*}ʻʻ\alpha .\\ [*230·1] &\supset .y\in R\overline{Q} _{\text{cn}}(P_{*}ʻʻ\alpha )\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*231·171. $\vdash :RʻʻCʻQ\subset CʻP.R\overline{Q} _{\text{cn}}\alpha .\supset .R\overline{Q} _{\text{cn}}(P_{*}ʻʻ\alpha ) \quad[*231·17.*230·11]$

*231·18. $\vdash :RʻʻCʻQ\subset CʻP.\supset .P\overline{R} _{\text{sc}}Q=pʻ(\text{sect}ʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR)\cap CʻP$

Dem. $\begin{array}{l} \vdash .*231·11.*211·13.\supset \\ \vdash \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.&\supset :\beta Q_{\text{cn}}R.\beta \in \text{sect}ʻP.\supset _{\beta }.x\in \beta :x\in CʻP &\qquad \text{(1)}\\ \vdash .*231·171.\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp RQ_{\text{cn}}(P_{*}ʻʻ\alpha ).\supset _{\alpha }.x\in P_{*}ʻʻ\alpha :\supset :RQ_{\text{cn}}\alpha .\supset _{\alpha }.x\in P_{*}ʻʻ\alpha \colon\ldotp \\ [*13·195.*231·11] &\supset \colon\ldotp (\exists \alpha ).\beta =P_{*}ʻʻ\alpha .RQ_{\text{cn}}\beta .\supset _{\beta }.x\in \beta :x\in CʻP:\supset :x\in P\overline{R} _{\text{sc}}Q\colon\ldotp \\ [*211·13]&\supset \colon\ldotp \beta \in \text{sect}ʻP.R\overline{Q} _{\text{cn}}\beta .\supset _{\beta }.x\in \beta :x\in CʻP:\supset :x\in P\overline{R} _{\text{sc}}Q &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \\ \vdash \colon\colon\text{Hp}.&\supset \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.\equiv :\beta \in \text{sect}ʻP.RQ_{\text{cn}}\beta .\supset _{\beta }.x\in \beta :x\in CʻP\colon\colon\supset \vdash .\text{Prop} \end{array}$

*231·181. $\vdash :P\in \text{Ser}.RʻʻCʻQ\subset CʻP.\supset .P\overline{R} _{\text{sc}}Q=CʻP\cap pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR)$

Dem. $\begin{array}{l} \vdash .*231·18.*211·302.*40·16.\supset \\ \vdash :\text{Hp}.&\supset .P\overline{R} _{\text{sc}}Q\subset CʻP\cap pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR) &\qquad \text{(1)}\\ \vdash .*40·55.*230·211.\supset \vdash \colon\ldotp \alpha \in \text{sect}ʻ&P\cap \overleftarrow{Q}_{\text{cn}}ʻR.z\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha .\supset :\\ &\overrightarrow{P}ʻz\in \overleftarrow{Q}_{\text{cn}}ʻR:\\ [*40·12] &\supset :x\in pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR).\supset .x\in \overrightarrow{P}ʻz &\qquad \text{(2)}\\ \vdash .(2).\text{Comm}.\supset \vdash \colon\ldotp x\in CʻP\cap &pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR).\alpha \in \text{sect}ʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR.\supset :\\ &x\in CʻP:z\in CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha .\supset _{z}.x\in \overrightarrow{P}ʻz:\\ [*40·41] &\supset :x\in CʻP\cap pʻ\overrightarrow{P}ʻʻ(CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha ) &\qquad \text{(3)}\\ \vdash .*211·711.\supset \\ \vdash :\text{Hp}.\alpha \in \text{sect}ʻP.\supset .CʻP\cap pʻ\overrightarrow{P}ʻʻ(CʻP\cap pʻ\overleftarrow{P}ʻʻ\alpha )&=CʻP\cap pʻ\overrightarrow{P}ʻʻ(CʻP-\alpha )\\ [*211·7·711] &=CʻP-(CʻP-\alpha ) &\qquad \text{(4)}\\ \vdash .(3).(4).\supset\\ \vdash \colon\ldotp \text{Hp}.x\in CʻP\cap pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR).&\supset :\alpha \in \text{sect}ʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR.\supset _{\alpha }.x\in \alpha :\\ [*231·18] &\supset :x\in P\overline{R} _{\text{sc}}Q &\qquad \text{(5)}\\ \vdash .(1).(5).\supset \vdash .\text{Prop} \end{array}$

*231·182. $\begin{align}\vdash :P\in \text{Ser}.Rʻʻ&CʻQ\subset CʻP.\exists !CʻP-(P\overline{R} _{\text{sc}}Q).\supset .\\ &P\overline{R} _{\text{sc}}Q=pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR).\exists !(\overrightarrow{P} ʻʻCʻP \cap \overleftarrow{Q}_{\text{cn}}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*231·181.\supset\\ \vdash :\text{Hp}.\exists !(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR).&\supset .P\overline{R} _{\text{sc}}Q=pʻ(\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR) &\qquad \text{(1)}\\ \vdash .*230·11.&\supset \vdash \colon\ldotp \text{Hp}.\overrightarrow{P} ʻʻCʻP \cap \overleftarrow{Q}_{\text{cn}}ʻR=\Lambda .\supset :\\ x\in CʻP.y\in CʻQ\cap \text{ᗡ}ʻR.&\supset _{x,y}.{\sim}(Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \overrightarrow{P}ʻx).\\ [*90·33.\text{Hp}] &\supset _{x,y}.{\sim}(P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy\subset \overrightarrow{P}ʻx).\\ [*211·56] &\supset _{x,y}.\overrightarrow{P}_{*}ʻx\subset P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy.\\ [*90·13] &\supset _{x,y}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy &\qquad \text{(2)}\\ \vdash .(2).*231·12.&\supset \vdash :\text{Hp}.\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR=\Lambda .\supset .CʻP\subset P\overline{R} _{\text{sc}}Q &\qquad \text{(3)}\\ \vdash .(3).\text{Transp}.&\supset \vdash .\text{Hp}.\supset .\exists !\overrightarrow{P}ʻʻCʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

*231·19. $\begin{align}\vdash :P\in \text{trans}.Q_{*}\in \text{connex} .Rʻʻ&CʻQ\subset CʻP.\supset .\\ &P\overline{R} _{\text{os}}Q=pʻ(\text{str}ʻP\cap \overleftarrow{Q}_{\text{cn}}ʻR)\cap CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*231·18·101.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp \\ x\in P\overline{R} _{\text{os}}Q.&\equiv :\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha ,\beta \in \overleftarrow{Q}_{\text{cn}}ʻR.\supset _{\alpha ,\beta }.x\in \alpha \cap \beta :x\in CʻP:\\ [*13·191.*11·35]&\equiv :(\exists \alpha ,\beta ).\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\alpha ,\beta \in \overleftarrow{Q}_{\text{cn}}ʻR.\gamma =\alpha \cap \beta .\supset _{\gamma }.\\ &x\in \gamma :x\in CʻP &\qquad \text{(1)}\\ \vdash .*230·42.\supset \vdash \colon\ldotp \text{Hp}.\supset :\alpha ,\beta \in \overleftarrow{Q}_{\text{cn}}ʻR.&\equiv .\alpha \cap \beta \in \overleftarrow{Q}_{\text{cn}}ʻR &\qquad \text{(2)}\\ \vdash .*215·16.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :(\exists \alpha ,\beta ).\alpha \in \text{sect}ʻP.\beta \in \text{sect}ʻ\breve{P} .\gamma =\alpha \cap \beta .&\equiv .\gamma \in \text{str}ʻP &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in P\overline{R} _{\text{os}}Q.&\equiv :\gamma \in \text{str}ʻP.RQ_{\text{cn}}\gamma .\supset _{\gamma }.x\in \gamma \colon\colon\supset \vdash .\text{Prop} \end{array}$

*231·192. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in &\text{connex} .\exists !P\overline{R} _{\text{os}}Q.\exists !P\overline{R} _{\text{os}}Qʻ.\supset :\\ &P\overline{R} _{\text{os}}Q=P\overline{R} _{\text{os}}Qʻ.\equiv .P\overline{R} _{\text{sc}}Q=P\overline{R} _{\text{sc}}Qʻ.\breve{P} \overline{R} _{\text{sc}}Q=\breve{P} \overline{R} _{\text{sc}}Qʻ\\ &[*231·191·101]\end{align}$

*231·193. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.P\overline{R} _{\text{os}}Q\in &1.\supset .\\ &P\overline{R} _{\text{os}}Q=\iota ʻ\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)=\iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &[*215·166.*231·13·101]\end{align}$

*231·2. $\begin{align}\vdash :P_{*},Q_{*}\in \text{connex} .CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻ&CʻP.\supset .\\ &CʻP-(P\overline{R} _{\text{sc}}Q)\subset \breve{P} \overline{R} _{\text{sc}}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*231·112.\supset \\ \vdash :x\in CʻP-(P\overline{R} _{\text{sc}}Q).&\supset .(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.x\in CʻP-P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy &\qquad \text{(1)}\\ \vdash .*202·501.*90·33.\supset \\ \vdash \colon\ldotp \text{Hp}.&x\in CʻP-P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy.\supset :x\in pʻ\overleftarrow{P}_{*}ʻʻ(Rʻʻ\overleftarrow{Q}_{*}ʻy\cap CʻP):\\ [*96·3] &\supset :yQ_{*}z.\supset _{z}.x\in pʻ\overleftarrow{P}_{*}ʻʻ(Rʻʻ\overleftarrow{Q}_{*}ʻz\cap CʻP):\\ [*40·61] \supset :yQ_{*}z.z\in \text{ᗡ}ʻR.&\supset _{z}.x\in \breve{P} _{*}ʻʻ(Rʻʻ\overleftarrow{Q}_{*}ʻz\cap CʻP).\\ [*37·265] & \supset _{z}.x\in \breve{P} _{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz: &\qquad \text{(2)}\\ [*90·12] &\supset :y\in CʻQ\cap \text{ᗡ}ʻR.\supset .x\in \breve{P} _{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\\ [*96·3.*37·2]&\supset :y\in CʻQ\cap \text{ᗡ}ʻR.zQ_{*}y.\supset _{z}.x\in \breve{P} _{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻz &\qquad \text{(3)}\\ \vdash .(2).(3).*202·137.\supset \vdash \colon\ldotp \text{Hp}.&y\in CʻQ\cap \text{ᗡ}ʻR.x\in CʻP-P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy.\supset :\\ &z\in CʻQ\cap \text{ᗡ}ʻR.\supset _{z}.x\in \breve{P} _{*}ʻʻRʻʻ\overleftarrow{Q}_{*}.ʻz:x\in CʻP:\\ [*231·112] &\supset :x\in \breve{P} \overline{R} _{\text{sc}}Q &\qquad \text{(4)}\\ \vdash .(1).(4).&\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in CʻP-(P\overline{R} _{\text{sc}}Q).\supset .x\in \breve{P} \overline{R} _{\text{sc}}Q\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*231·201. $\begin{align}&\vdash :P_{*},Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset .CʻP-(P\overline{R} _{\text{sc}}Q)\subset \breve{P} \overline{R} _{\text{sc}}Q\\ &[*231·2·154·155]\end{align}$

*231·202. $\vdash :P_{*},Q_{*}\in \text{connex} .\exists !P\overline{R} _{\text{sc}}Q.\supset .CʻP-(P\overline{R} _{\text{sc}}Q)\subset \breve{P} \overline{R} _{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*40·22.\text{Transp}.*231·12.\supset \\ \vdash :\text{Hp}.&\supset .\Lambda {\sim}\in P_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR).\\ [*231·156] &\supset .CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.\\ [*231·2] &\supset .CʻP-(P\overline{R} _{\text{sc}}Q)\subset \breve{P} \overline{R} _{\text{sc}}Q:\supset \vdash .\text{Prop} \end{array}$

*231·21. $\begin{align}\vdash :P_{*},Q_{*}\in \text{connex} .&CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ\breve{R} ʻʻCʻP.\supset .\\ &CʻP=P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q\end{align}$

Dem. $\begin{array}{l} \vdash .*231·13.&\supset \vdash :P\overline{R} _{\text{sc}}Q\subset CʻP.\breve{P} \overline{R} _{\text{sc}}Q\subset CʻP &\qquad \text{(1)}\\ \vdash .*231·2. &\supset \vdash :\text{Hp}.\supset .CʻP\subset P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q &\qquad \text{(2)}\\ \vdash .(1).(2).&\supset \vdash .\text{Prop} \end{array}$

*231·22. $\begin{align}&\vdash :P_{*},Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset .CʻP=P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q\\ &[*231·201·13]\end{align}$

*231·23. $\begin{align}\vdash \colon\ldotp P_{*}\in \text{connex} .Rʻʻ&CʻQ\subset CʻP.\supset :\\ &\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy-\overrightarrow{P}_{*}ʻx.\supset .\overrightarrow{P}_{*}ʻx\subset P_{\text{po}}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy\end{align}$

Dem. $\begin{array}{l} \vdash .*90·14. &\supset \vdash :\text{Hp}.\supset .Rʻʻ\overleftarrow{Q}_{*}ʻy\subset CʻP &\qquad \text{(1)}\\ \vdash .(1)*90·21.&\supset \vdash :\text{Hp}.\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy-\overrightarrow{P}_{*}ʻx.\supset .\exists !P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy-\overrightarrow{P}_{*}ʻx.\\ [*211·56.*202·13] &\supset .\overrightarrow{P}_{*}ʻx\subset P_{\text{po}}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\supset \vdash .\text{Prop} \end{array}$

*231·24. $\vdash :P_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.{\sim}{RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx)}.\supset .\overrightarrow{P}_{*}x\subset P\overline{R} _{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*230·11.\supset \vdash \colon\ldotp \text{Hp}.\supset :y\in CʻQ\cap \text{ᗡ}ʻR.&\supset _{y}.\exists !Rʻʻ\overleftarrow{Q}_{*}ʻy-\overrightarrow{P}_{*}ʻx.\\ [*231·23] &\supset _{y}.\overrightarrow{P}_{*}ʻx\subset P_{\text{po}}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\\ [*91·54.*40·44] &\supset :\overrightarrow{P}_{*}ʻx\subset pʻP_{*}ʻʻʻRʻʻʻ\overleftarrow{Q}_{*}ʻʻ(CʻQ\cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .(1).*231·12.*90·14.\supset \vdash .\text{Prop} \end{array}$

*231·25. $\begin{align}\vdash \colon\ldotp &P\in \text{Ser}.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.P\overline{R} _{\text{os}}Q=\Lambda .\\ &\text{E}!\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\supset :\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q).\lor.\\ &\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)P_{1}\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &[*215·54·541.*231·13·22]\end{align}$

*231·251. $\begin{align}\vdash :\text{Hp}*231·25.&\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q){\sim}\in \text{D}ʻP_{1}.\supset .\\ &\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q) \quad[*231·25]\end{align}$

*231·252. $\begin{align}\vdash :&P\in \text{Ser}.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.P\overline{R} _{\text{os}}\in 0\cup 1.\\ &\text{E}!\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q){\sim}e\in \text{D}ʻP_{1}.\supset .\\ &\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &[*215·543.*231·13·22]\end{align}$

*231·4. $\vdash :Q\in \text{trans}\cap \text{connex} .\text{E}!\text{max}_{Q}ʻ\text{ᗡ}ʻR.\supset .P\overline{R} _{\text{sc}}Q=P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*230·53.*231·121.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in P\overline{R} _{\text{sc}}Q.&\equiv :\overrightarrow{R}ʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR\subset \alpha .\supset _{\alpha }.x\in P_{*}ʻʻ\alpha :\\ [*37·2.*22·42] &\equiv :x\in P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR\colon\colon\supset \vdash .\text{Prop} \end{array}$

*231·41. $\vdash :Q\in \text{trans}\cap \text{connex} .\text{E}!Rʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR.\supset .P\overline{R} _{\text{sc}}Q=\overrightarrow{P}_{*}ʻRʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*30·5.*231·4.*53·31.\supset \\ \vdash :\text{Hp}.\supset .P\overline{R} _{\text{sc}}Q&=P_{*}ʻʻ\iota ʻRʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR\\ [*53·301] &=\overrightarrow{P}_{*}ʻRʻ\text{max}_{Q}ʻ\text{ᗡ}ʻR:\supset \vdash .\text{Prop} \end{array}$

In the preceding number, we considered the ultimate oscillation of a function when the argument grows without limit. If, in the propositions of the last number, we confine the field of $Q$ to $\overrightarrow{Q}ʻx$ , where $x\in \text{ᗡ}ʻQ$ , the ultimate oscillation becomes the ultimate oscillation as the argument approaches $x$ from below. If the ultimate oscillation consists of a single term, this is the limit of the function as the argument approaches $x$ from below. If, instead of confining the argument to $\overrightarrow{Q}ʻx$ , we confine it to any other class whose limit is $x$ , we shall, under a very usual hypothesis, obtain the same value for the ultimate oscillation as if we confined it to $\overrightarrow{Q}ʻx$ . And more generally, under a similar hypothesis, if $\alpha$ and $\beta$ are two classes of arguments which define the same section (i.e. such that $Q_{*}ʻʻ\alpha=Q_{*}ʻʻ\beta$ ), then, whether or not this section has a limit, the ultimate sections and the ultimate oscillation are the same for $\alpha$ as they are for $\beta$ . Hence we are led to consider first the result of confining the field of $Q$ , not to $\overrightarrow{Q}ʻx$ , but to any class $\alpha$ . In order not to have to exclude explicitly the case in which $\alpha \in 1$ , we deal with $Q_{*}\unicode{x0294f}\alpha$ , not $Q\unicode{x0294f}\alpha$ . Hence we are led to the following definitions:

*232·01. $(P\overline{R} Q)_{\text{sc}}ʻ\alpha =P\overline{R} _{\text{sc}}(Q_{*}\unicode{x0294f}\alpha ) \quad\text{Df}$

*232·02. $(P\overline{R} Q)_{\text{os}}ʻ\alpha =P\overline{R} _{os}(Q_{*}\unicode{x0294f}\alpha ) \quad\text{Df}$

Most of the propositions of the present number are immediate consequences of corresponding propositions in *231. The most important application of the propositions of the present number is to the case where $\alpha$ is of the form $\overrightarrow{Q}ʻx$ , $x$ being a member of $\delta _{Q}ʻ\text{ᗡ}ʻR$ . We may, in this case, take in place of $\overrightarrow{Q}ʻx$ any other class of arguments (e.g. a progression of arguments $x_{1}$ , $x_{2}$ , ... $x_{\nu }$ , ...) having $x$ for its limit, without altering the limiting sections or the ultimate oscillation. Hence the limit of the function for a given argument (if it exists) may be determined by choosing any selection of arguments having the given argument as their limit (cf. *233·142, below).

From the definition of $(P\overline{R} Q)_{\text{sc}}ʻ\alpha$ we obtain immediately

*232·11. $\begin{align}\vdash \colon\ldotp x\in (P\overline{R} Q)_{\text{sc}}ʻ&\alpha .\equiv :\\ &y\in \alpha \cap CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.x\in P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻy):x\in CʻP\end{align}$

We prove that $(P\overline{R} Q)_{\text{sc}}ʻ\alpha = (P\overline{R}Q)_{\text{sc}}ʻ(\alpha \cap CʻQ\cap \text{ᗡ}ʻR)$ (*232·131), and that if $\alpha \cap CʻQ\cap \text{ᗡ}ʻR=\Lambda$ , the two limiting sections and the ultimate oscillation are all equal to $CʻP$ (*232·15). Also we have

*232·14. $\vdash :Q\in \text{trans}\cap \text{connex} .\alpha \cap CʻQ{\sim}\in 1.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =P\overline{R} _{\text{sc}}(Q\unicode{x0294f}\alpha )$

Thus the substitution of $Q_{*}$ for $Q$ in our definitions has the effect of making them applicable to unit classes, and of enabling us to substitute the hypothesis $Q_{*}\in \text{connex}$ for $Q\in\text{trans}\cap \text{connex}$ . But when $Q$ is transitive and connected (and therefore when $Q$ is a series), the substitution of $Q_{*}$ for $Q$ in the definitions makes no difference unless $\alpha$ is a unit class. This case is trivial, since the only interest of our definitions is when a has no maximum in $Q$ .

*232·22. $\begin{align}\vdash :P_{*},Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)&\subset CʻP.\supset .\\ CʻP=(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \end{align}$

We have next a set of propositions concerned in discovering circumstances under which two classes $\alpha$ and $\beta$ which determine the same section in $Q$ (and therefore have the same limit, if any) give the same values for the two limiting sections. For this purpose, it is only necessary to discover circumstances under which we may substitute $Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$ for $\alpha$ . When this can be done, the ultimate oscillation of the function as the argument approaches the limit of a can be determined by taking any set of arguments having this limit. We have

*232·301. $\vdash .(P\overline{R} Q)_{\text{sc}}ʻ\alpha \subset (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$

*232·32. $\vdash :(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\supset .(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 0\cup 1$

Thus if the function has a limit as the argument approaches the limit of $Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$ , it also has a limit as the argument approaches the limit of $\alpha$ .

*232·33. $\begin{align}&\vdash :P_{*},Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=CʻP\end{align}$

*232·34. $\begin{align}&\vdash :\text{Hp} *232·33.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\Lambda .\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).(\breve{P} \overline{R} Qʻ\alpha =(\breve{P} \overline{R}Q)_{\text{sc}}ʻQ*ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

*232·341. $\begin{align}&\vdash :P_{*}\in \text{connex} .\exists !(P\overline{R} Q)_{\text{os}}ʻ\alpha .(P\overline{R} .Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 1.\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

Hence we arrive at the conclusion that, if $P_{\text{po}}$ is a series, and $x$ is the limit of the function for the class a $Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$ , if $x$ is a member of $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ , it is its maximum (*232·352), while if $x$ is not a member of $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ , it is its sequent (*232·356), assuming $(P\overline{R}Q)_{\text{sc}}ʻ\alpha \cup (\breve{P}\overline{R}Q)_{\text{sc}}ʻ\alpha = CʻP$ , which, as we saw (*233·22), is generally the case, and assuming also $P \in \text{Ser}$ . On the other hand, if $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ has no maximum, $x$ is the minimum of $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ ; and if $(P\overline{R}Q)_{\text{sc}}ʻ\alpha$ has a maximum other than $x$ , this is $P_1ʻx$ (*232·357 ·358). This latter case is impossible unless $x$ has an immediate predecessor. Hence we arrive at the following proposition:

*232·38. $\begin{align}\vdash : P \in \text{Ser} . Q_{*} \unicode{x0294f} &\alpha \in \text{connex} . Rʻʻ(\alpha \cap CʻQ) \subset CʻP .\\ &(P\overline{R}Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) \in 0 \cup (1 - \text{Cl}ʻCʻP_1) . \supset .\\ &\overrightarrow{\text{limax}} _pʻ(P\overline{R}Q)_{\text{sc}}ʻ\alpha = \overrightarrow{\text{limax}} _pʻ(P\overline{R}Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) .\\ &\overrightarrow{\text{limin}} _pʻ(\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha = \overrightarrow{\text{limin}} _pʻ(\breve{P} \overline{R}Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

Applying this to a series having Dedekindian continuity, we know that $P_1 = \dot{\Lambda}$ , and that the $\text{limax}$ and $\text{limin}$ always exist. Hence

*232·39. $\begin{align}\vdash \colon\ldotp P \in \text{Ser} \cap &\text{Ded} . P^{2} = P . Q_{*} \in \text{connex} . RʻʻCʻQ \subset CʻP . \supset :\\ &(P\overline{R}Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) \in 0 \cup 1 . \supset _\alpha .\\ &\text{limax}_pʻ(P\overline{R}Q)_{\text{sc}}ʻ\alpha = \text{limax}_pʻ(P\overline{R}Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) =\\ &\text{limin}_pʻ(\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha = \text{limin}_pʻ(\breve{P} \overline{R}Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

That is to say, if the value-series $P$ has Dedekindian continuity, and contains all values for arguments in $CʻQ$ , then, provided the function has a definite limit for the class $Q_{*}ʻʻ(\alpha \cap\text{ᗡ}ʻR)$ , this is its limit also for the class $\alpha$ ; that is to say, any collection of arguments having the same limit or maximum as a given section will give the same limit for the function.

*232·01. $(P\overline{R}Q)_{\text{sc}}ʻ\alpha = P\overline{R}_{\text{sc}}(Q_{*} \unicode{x0294f} \alpha ) \quad\text{Df}$

*232·02. $(P\overline{R}Q)_{\text{os}}ʻ\alpha = P\overline{R}_{\text{os}}(Q_{*} \unicode{x0294f} \alpha ) \quad\text{Df}$

*232·1. $\vdash . (P\overline{R}Q)_{\text{sc}}ʻ\alpha = P\overline{R}_{\text{sc}}(Q_{*} \unicode{x0294f} \alpha ) \quad[(*232·01)]$

*232·101. $\vdash . (P\overline{R}Q)_{\text{os}}ʻ\alpha = P\overline{R}_{\text{os}}(Q_{*} \unicode{x0294f} \alpha ) = (P\overline{R}Q)_{\text{sc}}ʻ\alpha \cap (\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha \quad[(*232·02)]$

*232·11. $\begin{align}\vdash \colon\ldotp x \in (P\overline{R}Q)_{\text{sc}}ʻ&\alpha . \equiv :\\ &y \in \alpha \cap CʻQ \cap \text{ᗡ}ʻR . \supset _y . x \in P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_*ʻy) : x \in CʻP\end{align}$

Dem. $\begin{array}{l} \vdash . *90·41·42 . *231·112 . \supset\\ \vdash \colon\ldotp x \in (P\overline{R}Q)_{\text{sc}}ʻ\alpha . \equiv : y \in \alpha \cap CʻQ \cap \text{ᗡ}ʻR . \supset _y . x \in P_{*}ʻʻRʻʻ(\overleftarrow{{Q}_{*}} \unicode{x0294f} \alpha ])ʻy : x \in CʻP :\\ [*35·102] \equiv : y \in \alpha \cap CʻQ \cap \text{ᗡ}ʻR . \supset _y . x \in P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_*ʻy) : x \in CʻP \colon\ldotp \supset \vdash . \text{Prop} \end{array}$

*232·12. $\begin{align}&\vdash .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =pʻP_{*}ʻʻʻRʻʻʻ(\alpha \cap )ʻʻ\overleftarrow{Q}_{*}ʻʻ(\alpha \cap CʻQ\cap \text{ᗡ}ʻR)\cap CʻP\\ &[*232·11]\end{align}$

*232·121. $\vdash :\gamma =\alpha \cap CʻQ\cap \text{ᗡ}ʻR.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =pʻP_{*}ʻʻʻRʻʻʻ(\gamma \cap )ʻʻ\overleftarrow{Q}_{*}ʻʻ\gamma \cap CʻP$

Dem. $\begin{array}{l} \vdash .*90·13. &\supset \vdash .\alpha \cap \overleftarrow{Q}_{*}ʻy=\alpha \cap CʻQ\cap \overleftarrow{Q}_{*}ʻy.\\ [*37·26] &\supset \vdash .Rʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻy)=Rʻʻ(\alpha \cap CʻQ\cap \text{ᗡ}ʻR\cap \overleftarrow{Q}_{*}ʻy) &\qquad \text{(1)}\\ \vdash .(1).*232·11.\supset \vdash .\text{Prop} \end{array}$

*232·13. $\begin{align}&\vdash :\alpha \cap CʻQ\cap \text{ᗡ}ʻR=\beta \cap CʻQ\cap \text{ᗡ}ʻR.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻ\beta\\ &[*232·121]\end{align}$

*232·131. $\vdash .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻ(\alpha \cap CʻQ\cap \text{ᗡ}ʻR) \quad[*232·13]$

From the above propositions it follows that the values of $(P\overline{R} Q)_{\text{sc}}ʻ\alpha$ , $(\breve{P} \overline{R}Q)_{\text{sc}}ʻ\alpha$ , and $(P\overline{R} Q)_{\text{os}}ʻ\alpha$ depend only upon $\alpha\cap CʻQ\cap \text{ᗡ}ʻR$ ; thus if $\alpha$ is not contained in $CʻQ\cap \text{ᗡ}ʻR$ , the part not contained in $CʻQ\cap\text{ᗡ}ʻR$ is irrelevant.

*232·14. $\begin{align}&\vdash :Q\in \text{trans} \cap\text{connex} .\alpha \cap CʻQ{\sim}\in 1.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =P\overline{R} _{\text{sc}}(Q\unicode{x0294f}\alpha )\\ &[*232·1.*202·54·541]\end{align}$

*232·15. $\begin{align}&\vdash :\alpha \cap CʻQ\cap \text{ᗡ}ʻR=\Lambda .\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{os}}ʻ\alpha =CʻP\\ &[*232·12·101.*37·29.*40·2]\end{align}$

*232·151. $\begin{align}&\vdash :\dot{\exists} !P.(P\overline{R} Q)_{\text{os}}ʻ\alpha =\Lambda .\supset .\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR\\ &[*232·15.\text{Transp}.*33·24]\end{align}$

*232·2. $\vdash :CʻQ\cap \text{ᗡ}ʻR\subset \alpha .\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =P\overline{R} _{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*22·621.*232·11.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp x\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .&\equiv :y\in CʻQ\cap \text{ᗡ}ʻR.\supset _{y}.x\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy:\\ [*231·112] &\equiv :x\in P\overline{R} _{\text{sc}}Q\colon\colon\supset \vdash .\text{Prop} \end{array}$

*232·21. $\begin{align}&\vdash :P_{*},Q_{*}\unicode{x0294f}\alpha \in \text{connex} .\alpha \cap CʻQ\cap \text{ᗡ}ʻR\subset Q_{*}ʻʻ(\alpha \cap \breve{R} ʻʻCʻP).\supset .\\ &CʻP=(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \\ &\left[*231·21 \frac{Q_{*}\unicode{x0294f}\alpha}{Q}\right]\end{align}$

*232·22. $\begin{align}\vdash :P_{*},Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ&(\alpha \cap CʻQ)\subset CʻP.\supset .\\ &CʻP=(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \quad[*231·22]\end{align}$

*232·23. $\vdash :y\in CʻQ\cap \text{ᗡ}ʻR.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\iota ʻy=P_{*}ʻʻ\overrightarrow{R}ʻy$

Dem. $\begin{array}{l} \vdash .*232·11.*13·191.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x\in (P\overline{R} Q)_{\text{sc}}ʻ\iota ʻy.\equiv .x\in P_{*}ʻʻRʻʻ(\iota ʻy\cap \overleftarrow{Q}]_{*}ʻy)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*232·24. $\begin{align}\vdash :Q\in \text{trans}\cap \text{connex} .\text{E}!\text{max}_{Q}ʻ&(\alpha \cap \text{ᗡ}ʻR).\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha =P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*232·14.&\supset \vdash :\text{Hp}.\alpha \cap CʻQ\cap \text{ᗡ}ʻR{\sim}\in 1.\supset .\\ (P\overline{R} Q)_{\text{sc}}ʻ\alpha &=P\overline{R} _{\text{sc}}\{Q\unicode{x0294f}(\alpha \cap \text{ᗡ}ʻR)\}\\ [*231·4.*205·9]&=P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .*205·17.*232·23·131.\supset \\ \vdash :\alpha \cap CʻQ\cap \text{ᗡ}ʻR\in 1.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha &=P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*232·3. $\vdash :\alpha \subset \text{ᗡ}ʻR.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha \subset (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ\alpha$

Dem. $\begin{array}{l} \vdash .*96·3.&\supset \vdash :y\in Q_{*}ʻʻ\alpha .\supset .(\exists z).z\in \alpha \cap CʻQ.\overleftarrow{Q}_{*}ʻz\subset \overleftarrow{Q}_{*}ʻy.\\ [\text{Fact}.*37·2]&\supset .(\exists z).z\in \alpha \cap CʻQ.P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻz)\subset P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻy) &\qquad \text{(1)}\\ \vdash .(1).*232·11.\supset \vdash \colon\ldotp \text{Hp}.x\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset :y\in Q_{*}ʻʻ\alpha .&\supset .x\in P_{*}ʻʻRʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻy).\\ [*90·33] &\supset .x\in P_{*}ʻʻRʻʻ(Q_{*}ʻʻ\alpha \cap \overleftarrow{Q}_{*}ʻy):\\ [*232·11] &\supset :x\in (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ\alpha \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*232·301. $\vdash .(P\overline{R} Q)_{\text{sc}}ʻ\alpha \subset (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$

Dem. $\begin{array}{l} \vdash .*232·13.\supset \vdash .(P\overline{R} Q)_{\text{sc}}ʻ\alpha &=(P\overline{R} Q)_{\text{sc}}ʻ(\alpha \cap \text{ᗡ}ʻR)\\ [*232·3] & \subset (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).\supset \vdash .\text{Prop} \end{array}$

*232·31. $\vdash .(P\overline{R} Q)_{\text{os}}ʻ\alpha \subset (P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$

Dem. $\begin{array}{l} \vdash .*232·301 \frac{\breve{P}}{P}.\supset \vdash .(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \subset (\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .*232·301.(1).*232·101.\supset \vdash .\text{Prop} \end{array}$

*232·32. $\vdash :(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\supset .(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 0\cup 1 \quad[*232·31]$

*232·33. $\begin{align}&\vdash :P_{*},Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=CʻP\end{align}$

Dem. $\begin{array}{l} \vdash .*232·22·301.\supset \\ \vdash :\text{Hp}.\supset .CʻP\subset (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .(1).*231·131.\supset \vdash .\text{Prop} \end{array}$

*232·34. $\begin{align}&\vdash :\text{Hp}*232·33.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\Lambda .\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·33·301.*24·482]\end{align}$

*232·341. $\begin{align}&\vdash : P_{*} \in \text{connex} . \exists ! (P\overline{R} Q)_{\text{os}}ʻ\alpha .(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) \in 1 . \supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha = (P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) . (\breve{P} RQ)_{\text{sc}}ʻ\alpha = . (\breve{P} RQ)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*231·192 . *232·31. *60·38]\end{align}$

*232·35. $\begin{align}&\vdash : P_{*} \in \text{connex} . (P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) = {℩}ʻx . \supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \subset \overrightarrow{P}_{*}ʻx . (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \subset \overleftarrow{P}_{*}ʻx\\ &[*232·301.*231·191]\end{align}$

*232·351. $\vdash : \text{Hp} *232·35 . x \in (P\overline{R} Q)_{\text{sc}}ʻ\alpha . \supset . (P\overline{R} Q)_{\text{sc}}ʻ\alpha = \overrightarrow{P} _{*}ʻx$

Dem. $\begin{array}{l} \vdash . *231*13. \supset \vdash : \text{Hp} . \supset . \overrightarrow{P}_{*}ʻx \supset (P\overline{R} Q)_{\text{sc}}ʻ\alpha &\qquad \text{(1)}\\ \vdash . (1). *232·35. \supset \vdash . \text{Prop} \end{array}$

*232·352. $\begin{align}&\vdash : \text{Hp} *232·351 . P_{\text{po}} \,\unicode{x2abd}\, J . \supset . x = \text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \\ &[*211·8 . *205·197 . *232·351]\end{align}$

*232·353. $\begin{align}\vdash : \text{Hp} *232·35. (P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha = CʻP . &x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha . \supset .\\ &(\breve{P}\overline{R} Q)_{\text{sc}}ʻ\alpha = \overleftarrow{P}_{*}ʻx\end{align}$

Dem. $\begin{array}{l} \vdash . *231·13. \supset \vdash : \text{Hp} . &\supset . x \in (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha .\\ [*232·351] &\supset . (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha = \overleftarrow{P}_{*}ʻx : \supset \vdash . \text{Prop} \end{array}$

*232·354. $\vdash : \text{Hp} *232·353 . P_{\text{po}} \,\unicode{x2abd}\, J. \supset . x = \text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \quad\left[*232·352 \frac{\breve{P}}{P}\right]$

*232·355. $\vdash : \text{Hp} *232·353. \supset . (P\overline{R} Q)_{\text{sc}}ʻ\alpha = \overrightarrow{P}_{\text{po}}ʻx$

Dem. $\begin{array}{l} \vdash . *232·35. \supset \vdash : \text{Hp} . \supset . (P\overline{R} Q)_{\text{sc}}ʻ\alpha &\subset \overrightarrow{P}_{*}ʻx - \iota ʻx\\ [*91·542] &\subset \overrightarrow{P}_{\text{po}}ʻx &\qquad \text{(1)}\\ \vdash . *232·353. \supset \vdash : \text{Hp}. &\supset . CʻP -\overleftarrow{P}_{*}ʻx \subset CʻP - (\breve{P} \overline{R} Q)_{\text{sc}} ʻ\alpha .\\ [*202·101.\text{Hp}] &\supset . \overrightarrow{P}_{\text{po}}ʻx \subset (P\overline{R} Q)_{\text{sc}}ʻ\alpha &\qquad \text{(2)}\\ \vdash . (1). (2). \supset \vdash . \text{Prop} \end{array}$

*232·356. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser}. (P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) = \iota ʻx.\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P}\overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP . \supset : x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha . \supset . x = \text{seq}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \\ &[*206·172 . *231·13 . *232·355]\end{align}$

*232·357. $\vdash : \text{Hp}*232·35 . P_{\text{po}} \,\unicode{x2abd}\, J. {\sim}\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha . \supset .x= \text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha$

Dem. $\begin{array}{l} \vdash . *232·352. \text{Transp} . \supset \vdash : \text{Hp}. &\supset . x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ [*232·354] &\supset . x = \text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}\alpha : \supset \vdash . \text{Prop} \end{array}$

*232·358. $\begin{align}&\vdash :\text{Hp}*232·35.P_{\text{po}}\,\unicode{x2abd}\, J.(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.\\ &\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \neq x.\supset .\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha P_{1}x\end{align}$

Dem. $\begin{array}{l} \vdash .*232·352.\text{Transp}.\supset \vdash :\text{Hp}.&\supset .x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ [*232·356] &\supset.x=\text{seq}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ [*206·5] & \supset .\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha P_{1}x:\supset \vdash .\text{Prop} \end{array}$

*232·36. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\iota ʻx.\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.\supset :\\ &x\in (P\overline{R} Q)_{os}ʻ\alpha .\supset .x=\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha :\\ &x\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha -(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha .\supset .x=\text{max}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =\text{prec}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha :\\ &x\in (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha -(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset .x=\text{seq}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha \\ &[*232·352·354·356]\end{align}$

*232·361. $\vdash :\text{Hp}*232·36.x{\sim}\in \text{ᗡ}ʻP_{1}.\supset .x=\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha$

Dem. $\begin{array}{l} \vdash .*232·358.\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .&\supset .\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =x &\qquad \text{(1)}\\ \vdash .*232·352.\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :{\sim}\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .&\supset .x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ [*232·356] &\supset .x=\text{seq}_{P}ʻ(P\overline{R} Q)ʻ\alpha &\qquad \text{(2)}\\ \vdash .(1).(2).*207·46.\supset \vdash .\text{Prop} \end{array}$

*232·37. $\begin{align}&\vdash :P\in \text{Ser}.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 1-\text{Cl}ʻ\text{ᗡ}ʻP_{1}.\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.\supset .\\ &\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &= \breve{\iota} ʻ(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·361.*231·193]\end{align}$

*232·38. $\begin{align}&\vdash :P\in \text{Ser}.Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup (1-\text{Cl}ʻCʻP_{1}).\supset .\\ &\overrightarrow{\text{limax}} _{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\overrightarrow{\text{limax}} _{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).\\ &\overrightarrow{\text{limin}} _{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =\overrightarrow{\text{limin}} _{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·33·34·37]\end{align}$

*232·39. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}\cap &\text{Ded}.P^{2}=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\supset _{\alpha }.\\ &\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &=\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*201·63.*232·38.&\supset \vdash :\text{Hp}.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\supset .\\ &\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).\\ &\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .*231·193.&\supset \vdash :\text{Hp}(1).(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 1.\supset .\\ &\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(2)}\\ \vdash .*214·42.*232·33.&\supset \vdash :\text{Hp}(1).(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\Lambda .\supset .\\ &\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\text{limin}_Pʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*232·5. $\begin{align}&\vdash .(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx=CʻP\cap \hat{y} \{z\in \overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR.\supset _{z}.y\in P_{*}ʻʻRʻʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz)\}\\ &[*232·11]\end{align}$

*232·51. $\begin{align}\vdash :Q\in \text{trans}\cap &\text{connex} .\text{E}!\text{max}_{Q}ʻ(\overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR).\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx=P_{*}ʻʻ\overrightarrow{R}ʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR) \quad[*232·24]\end{align}$

*232·511. $\begin{align}\vdash :Q\in \text{trans}\cap &\text{connex} .\text{E}!Rʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR).\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx=\overrightarrow{P}_{*}ʻRʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR) \quad[*232·51]\end{align}$

*232·52. $\begin{align}\vdash :Q\in \text{connex} .yQx.\overrightarrow{Q}ʻx\cap &(\overleftarrow{Q}ʻy\cup {℩}ʻy)\cap \text{ᗡ}ʻR=\Lambda .\supset .\\ &(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx=(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻy \quad[*232·13]\end{align}$

*232·53. $\vdash :Q\in \text{connex} .z\in \overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx=(P\overline{R} Q)_{\text{sc}}ʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz)$

Dem. $\begin{array}{l} \vdash .*232·5.*96·3.&\supset \vdash \colon\ldotp \text{Hp}.y\in (P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx.\supset :\\ &u\in \overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz\cap \text{ᗡ}ʻR.\supset _{u}.y\in P_{*}ʻʻRʻʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻu).\overleftarrow{Q}_{*}ʻu\subset \overleftarrow{Q}_{*}ʻz:\\ [*22·621.*232·11]&\supset :y\in (P\overline{R} Q)_{\text{sc}}ʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz) &\qquad \text{(1)}\\ \vdash .*232·11.*37·2.&\supset \vdash \colon\ldotp \text{Hp}.y\in (P\overline{R} Q)_{\text{sc}}ʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz).\supset :\\ &u\in \overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻz\cap \text{ᗡ}ʻR.\supset _{u}.y\in P_{*}ʻʻRʻʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻu) &\qquad \text{(2)}\\ [*96·3]&\supset :u\in \overrightarrow{Q}ʻx\cap \overrightarrow{Q}_{*}ʻz\cap \text{ᗡ}ʻR.\supset _{u}.y\in P_{*}ʻʻRʻʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻu) &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash \colon\ldotp \text{Hp}(2).&\supset :u\in \overrightarrow{Q}ʻx\cap \text{ᗡ}ʻR.\supset _{u}.y\in P_{*}ʻʻRʻʻ(\overrightarrow{Q}ʻx\cap \overleftarrow{Q}_{*}ʻu):\\ [*232·5] &\supset :y\in (P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻx &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \vdash .\text{Prop} \end{array}$

There are four limits of a function as the argument approaches some term $a$ in the argument-series, namely the upper and lower limits of the ultimate oscillation for approaches from below and above respectively. If the ultimate oscillation for approaches to $a$ from below reduces to a single term, i.e. if $(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa \in 1$ , that one term is the limit of the function for approaches to $a$ from below. If this one term is also the ultimate oscillation for approaches from above, we may call it simply the limit of the function for the argument $a$ . This may or may not (when it exists) be equal to the value for the argument $a$ . It is characteristic of continuous functions that the limit exists for every argument, and is always equal to the value for that argument. Continuous functions will be considered in *234.

The upper limit or maximum of the ultimate oscillation as the argument approaches $a$ is the upper limit or maximum of the ultimate section. Hence if we put $R(PQ)ʻa =\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻa \quad\text{Df},$ the four limits of the function as the argument approaches $a$ will be $R(PQ)ʻa,\quad R(\breve{P} Q)ʻa,\quad R(P\breve{Q} )ʻa,\quad R(\breve{P} \breve{Q} )ʻa .$ It will be seen that $R(PQ)ʻa$ is a function of $\overrightarrow{Q}ʻa$ . It may happen that, if we put $\alpha$ in place of $\overrightarrow{Q}ʻa$ , the function will have a definite limit as the argument increases in $\alpha$ , although $\alpha$ has no limit or maximum. Thus if, for example, $Q$ consists of the series of rationals, and $P$ of the series of real numbers, if $\alpha$ is a class of rationals not having a rational limit, we may regard the limit of the function (if it exists), as the argument increases in $\alpha$ , as the value of the function for the irrational limit of $\alpha$ . In this way we can extend the domain of definition of a function. In order to be able to deal with the cases in which $\alpha$ has no limit, we put $(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \quad\text{Df}.$ If $P$ is a Dedekindian series, $(P\overline{R}Q)_{\text{lmx}}ʻ\alpha$ always exists. If we take $\alpha$ to be any segment of $Q$ , we thus get a new function, derived from $R$ , but having segments of $Q$ instead of members of $CʻQ$ as its arguments. Thus if $R$ had[Pg 746] rationale for its arguments, this new function will have real numbers for its arguments. (Real numbers may be regarded as segments of the series of rationals.)

The function $R(PQ)ʻ\alpha$ is a particular case of the above; thus we take as our definition $R(PQ)ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻ\overrightarrow{Q}ʻ\alpha \quad\text{Df},$ or, what comes to the same thing, $R(PQ)=(P\overline{R} Q)_{\text{lmx}}\mid \overrightarrow{Q} \quad\text{Df}.$

*233·15. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}\cap \text{Ded}.(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.(P\overline{R} Q)_{\text{os}}ʻ\alpha =\Lambda .\supset :\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha .\lor.\{(P\overline{R} Q)_{\text{lmx}}ʻ\alpha \}P_{1}\{(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha\}\end{align}$

*233·16. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}\cap \text{Ded}.&P^{2}=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 0\cup 1.\supset _{\alpha }.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha\end{align}$

*233·2—·25 are applications of the more important of the propositions *232·34—·39, showing circumstances under which the limit of the function for the class $\alpha$ is the same as for the class $Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$ .

*233·4 and following propositions apply the earlier propositions of *233 to the case where $\alpha$ is replaced by $\overrightarrow{Q}ʻ\alpha$ , and therefore $(P\overline{R}Q)_{\text{lmx}}ʻ\alpha$ is replaced by $R(PQ)ʻ\alpha$ . We have

*233·43. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa &\in 1.\supset .\\ &R(PQ)ʻa =R(\breve{P} Q)ʻa =\breve{{℩}} ʻ(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\end{align}$

*233·433. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.&Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa \in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa \subset CʻP.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa=\Lambda .\\ &\text{E}!R(PQ)ʻa.\text{E}!R(\breve{P} Q)ʻa.\supset :\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa.\lor.\{R(PQ)ʻa \}P_{1}\{R(\breve{P} Q)ʻa\}\end{align}$

*233·45. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}\cap \text{Ded}.&P^{2}=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &R(PQ)ʻa =R(\breve{P} Q)ʻa.\equiv _{a}.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa \in 0\cup 1\end{align}$

I.e. in a series having Dedekindian continuity, the necessary and sufficient condition that the two limits of the function as the argument approaches $\alpha$ from below should be equal is that the ultimate oscillation should not have more than one term.

We have next a set of propositions (*233·5—·53) on the possibility of replacing $\overrightarrow{Q}ʻa$ by a class $\alpha$ having $a$ for its limit, without altering the limits of the function. We have to begin with

*233·5. $\vdash :Q\in \text{Ser}.\alpha =\text{lt}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR).\supset .\overrightarrow{Q}ʻ\alpha =Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)$

*233·512. $\begin{align}\vdash \colon\ldotp &\text{Hp}*233·5.P\in \text{Ser}.Rʻʻ(\alpha \cap CʻQ)\subset CʻP.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa =\iota ʻx.\supset :\\ &x=R(PQ)ʻa =R(\breve{P} Q)ʻa:x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\lor.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha P_{1}x\end{align}$

*233·514. $\vdash :\text{Hp}*233·512.x{\sim}\in CʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha$

Thus if $P$ , $Q$ are series, and $x$ is the limit of the function for the argument $\alpha$ ( $x$ being a term which has no immediate successor or predecessor), $x$ is the limit of the function for any class of arguments whose limit is $\alpha$ . Hence we arrive at the proposition

*233·53. $\begin{align}\vdash :Q\in \text{Ser}.&P\in \text{Ser}\cap \text{Ded}.P^{2}=P.RʻʻCʻQ\subset CʻP.\alpha \subset \text{ᗡ}ʻR.\text{E}!\text{lt}_{Q}ʻ\alpha .\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ\alpha \in 0\cup 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻ\text{lt}_{Q}ʻ\alpha =R(\breve{P} Q)ʻ\text{lt}_{Q}ʻ\alpha\end{align}$

Thus if $P$ has Dedekindian continuity, and $\alpha$ is a class of arguments having a limit, and if the ultimate oscillation as the argument approaches this limit has not more than one term, the limit of the function for the class $\alpha$ exists, and is equal to the limit of the function for the argument $\text{lt}_{Q}ʻ\alpha$ .

*233·01. $(P\overline{R} Q)_{\text{lmx}}=\text{limax}_P\mid (P\overline{R} Q)_{\text{sc}} \quad\text{Df}$

*233·02. $R(PQ)=(P\overline{R} Q)_{\text{lmx}}\mid \overrightarrow{Q} \quad\text{Df}$

*233·1. $\vdash :y\{(P\overline{R} Q)_{\text{lmx}}\}\alpha .\equiv .y(\text{limax}_P)\{(P\overline{R} Q)_{\text{sc}}ʻ\alpha\} \quad[(*233·01)]$

*233·101. $\vdash :y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .y=\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \quad[*233·1]$

*233·102. $\begin{align}\vdash :\text{E}!\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .&\equiv .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha\\. &\equiv .\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*233·101.*14·28]\end{align}$

*233·103. $\vdash :P\in \text{connex} .\supset .(P\overline{R} Q)_{\text{lmx}}\in 1\rightarrow \text{Cls} \quad[*207·41.*233·1]$

*233·11. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.\supset :y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .y\in CʻP.\overrightarrow{P}ʻy=Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \\ &[*207·51.*233·101]\end{align}$

*233·111. $\begin{align}\vdash \colon\ldotp &P\in \text{Ser}.\exists !Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset :\\ &y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .\overrightarrow{P}ʻy=Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \quad[*207·52.*233·101]\end{align}$

*233·12. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.{\sim}\text{E}!&\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset :\\ &y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .y\in CʻP.\overrightarrow{P}ʻy=(P\overline{R} Q)_{\text{sc}}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*231·13.*211·41.\supset \vdash :\text{Hp}.\supset .(P\overline{R} Q)_{\text{sc}}ʻ\alpha =Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha &\qquad \text{(1)}\\ \vdash .(1).*233·11.\supset \vdash .\text{Prop} \end{array}$

*233·13. $\begin{align}\vdash :P\in \text{connex} \cap &\text{Ded}.\supset .\\ &\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha=\text{limax}_Pʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha\\ &[*233·102·103.*214·11]\end{align}$

*233·14. $\begin{align}&\vdash :P\in \text{Ser}.(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 1.\supset .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =\breve{\iota} ʻ(P\overline{R} Q)_{\text{os}}ʻ\alpha \\ &[*231·193.*233·102]\end{align}$

*233·141. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.&(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.(P\overline{R} Q)_{\text{os}}ʻ\alpha =\Lambda .\supset :\\ &\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .\text{E}!(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &[*211·727.*233·102.*231·13]\end{align}$

*233·142. $\begin{align}&\vdash :P\in \text{Ser}.Q_{*}\unicode{x0294f}\alpha \in \text{connex} .\\ &Rʻʻ(\alpha \cap CʻQ)\subset CʻP.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\\ &\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR){\sim}\in CʻP_{1}.\supset .\\ (P\overline{R} Q)_{\text{lmx}}ʻ\alpha &=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &= (\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*231·252.\supset \vdash :\text{Hp}.&\supset .(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .*232·37.*233·14.&\supset \vdash :\text{Hp}.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 1.\supset .\\ (P\overline{R} Q)_{\text{lmx}}ʻ\alpha &=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(2)}\\ \vdash .(1).*232·34.\supset \vdash :\text{Hp}.&(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\Lambda .\supset .\\ (P\overline{R} Q)_{\text{lmx}}ʻ\alpha &=(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash .\text{Prop} \end{array}$

*233·16. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}\cap &\text{Ded}.P^{2}=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 0\cup 1.\supset _{\alpha }.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*232·22.&\supset \vdash :\text{Hp}.\supset .CʻP=(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*201·65.&\supset \vdash :\text{Hp}.\supset .P_{1}=\dot{\Lambda} &\qquad \text{(2)}\\ \vdash .(1).(2).*233·14·15.\supset \vdash .\text{Prop} \end{array}$

*233·17. $\vdash \colon\ldotp \alpha \cap CʻQ\cap \text{ᗡ}ʻR=\Lambda .\supset :y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .y=Bʻ\breve{P}$

Dem. $\begin{array}{l} \vdash .*232·15.*233·101.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :y=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .&\equiv .y=\text{limax}_PʻCʻP.\\ [*206·2.*93·117] &\equiv .y=Bʻ\breve{P} \colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*233·171. $\vdash :\alpha \cap CʻQ\cap \text{ᗡ}ʻR=\Lambda .\supset .{\sim}\{(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha\}$

Dem. $\begin{array}{l} \vdash .*93·102.\supset \vdash .{\sim}(BʻP=Bʻ\breve{P} ) &\qquad \text{(1)}\\ \vdash .(1).*233·17.\supset \vdash .\text{Prop} \end{array}$

*233·172. $\begin{align}\vdash :\alpha \cap CʻQ\cap \text{ᗡ}ʻR=\Lambda .\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\text{E}!(\breve{P} &\overline{R} Q)_{\text{lmx}}ʻ\alpha .\supset .\\ &(P\overline{R} Q)_{\text{os}}ʻ\alpha {\sim}\in 0\cup 1\end{align}$

Dem. $\begin{array}{l} \vdash .*233·171.*232·15.\supset \\ \vdash :\text{Hp}.&\supset .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha ,(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \in (P\overline{R} Q)_{\text{os}}ʻ\alpha .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha \neq (\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha .\\ [*52·41]&\supset .(P\overline{R} Q)_{\text{os}}ʻ\alpha {\sim}\in 0\cup 1:\supset \vdash .\text{Prop} \end{array}$

*233·173. $\begin{align}\vdash :(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 0\cup 1.\text{E}!&(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\text{E}!(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha .\supset .\\ &\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR \quad[*233·172.\text{Transp}]\end{align}$

*233·174. $\vdash :P \,\unicode{x2abd}\, J.(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 1.\supset .\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*200·12.\supset \vdash :\text{Hp}.&\supset .{\sim}\{CʻP\subset (P\overline{R} Q)_{\text{os}}ʻ\alpha\}.\\ [*232·15] &\supset .\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR:\supset \vdash .\text{Prop} \end{array}$

*233·2. $\begin{align}&\vdash :Q_{*}\unicode{x0294f}\alpha \in \text{connex} .P\in \text{Ser}.Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\Lambda .\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).(\breve{P} R\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} R\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·34.*211·727.*233·102]\end{align}$

*233·21. $\begin{align}\vdash :&P_{\text{po}}\in \text{Ser}.\exists !(P\overline{R} Q)_{\text{os}}ʻ\alpha .(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\breve{\iota} ʻ(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·341.*231·193]\end{align}$

*233·22. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=\iota ʻx.\\ &(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup (\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha =CʻP.\supset :\\ &x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\lor.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha P_{1}x.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha\end{align}$

Dem. $\begin{array}{l} \vdash .*232·352.&\supset \vdash :\text{Hp}.x\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha &\qquad \text{(1)}\\ \vdash .*232·356.&\supset \vdash :\text{Hp}.x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .{\sim}\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset .\\ &x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha &\qquad \text{(2)}\\ \vdash .*232·358.*207·42.&\supset \vdash :\text{Hp}.x{\sim}\in (P\overline{R} Q)_{\text{sc}}ʻ\alpha .\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\supset .\\ &\text{max}_{P}ʻ(P\overline{R} Q)ʻ\alpha P_{1}x.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*233·23. $\begin{align}&\vdash :\text{Hp}*233·22.\supset .\\ &x=(P\breve{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) \quad[*231·193]\end{align}$

*233·24. $\vdash :\text{Hp}*233·22.x{\sim}\in \text{ᗡ}ʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*233·22]$

*233·241. $\begin{align}&\vdash :\text{Hp}*233·22.x{\sim}\in CʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P}\overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &\left[*233·24 \frac{\breve{P}}{P}.*233·24\right]\end{align}$

*233·25. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}\cap \text{Ded}.P^{2}=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\in 0\cup 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(P\overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻQ_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\\ &[*232·39]\end{align}$

*233·4. $\vdash :y{R(PQ)}\alpha .\equiv .y\{(P\overline{R} Q)_{\text{lmx}}\}\overrightarrow{Q}ʻ\alpha \quad[(*233·02)]$

*233·401. $\vdash :y=R(PQ)ʻ\alpha .\equiv .y=(P\overline{R} Q)_{\text{lmx}}ʻ\overrightarrow{Q}ʻ\alpha \quad[*233·4]$

*233·402. $\vdash :P\in \text{connex} .\supset .R(PQ)\in 1\rightarrow \text{Cls} \quad[*207·41]$

*233·41. $\vdash :y=R(PQ)ʻ\alpha .\equiv .y=(P\overline{R} Q)_{\text{lmx}}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR)$

Dem. $\begin{array}{l} \vdash .*232·13.\supset \vdash .(P\overline{R} Q)_{\text{sc}}ʻ\overrightarrow{Q}ʻ\alpha =(P\overline{R} Q)_{\text{sc}}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR) &\qquad \text{(1)}\\ \vdash .(1).*233·401·101.\supset \vdash .\text{Prop} \end{array}$

*233·42. $\begin{align}\vdash :.Q\in \text{trans}&\cap \text{connex} .\text{E}!\text{max}_{Q}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR).\supset :\\ &y=R(PQ)ʻ\alpha .\equiv .y=\text{limax}_PʻP_{*}ʻʻ\overrightarrow{R}ʻ \text{max}_{Q}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR)\\ &[*232·24.*233·401·101]\end{align}$

*233·421. $\begin{align}&\vdash :P\in \text{ᗡ}ʻʻʻJ\cap \text{trans}.Q\in \text{trans}\cap \text{connex} .Rʻ\text{max}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR)\in C^{P}.\supset .\\ &R(PQ)ʻ\alpha =Rʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR)\end{align}$

Dem. $\begin{array}{l} \vdash .*233·42.\supset \vdash \colon\ldotp \text{Hp}.\supset :y=R(PQ)ʻ\alpha .&\equiv .y=\text{limax}_Pʻ\overrightarrow{P}_{Q}ʻRʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR).\\ [*205·197] &\equiv .y=Rʻ\text{max}_{Q}ʻ(\overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR)\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*233·422. $\vdash \colon\ldotp \overrightarrow{Q}ʻ\alpha \cap \text{ᗡ}ʻR=\Lambda .\supset :y=R(PQ)ʻ\alpha .\equiv .y=Bʻ\breve{P} \quad[*233·17]$

*233·423. $\vdash :\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR=\Lambda .\supset .{\sim}\{R(PQ)ʻa=R(\breve{P} Q)ʻa\} \quad[*233·171]$

*233·424. $\begin{align}&\vdash :\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR=\Lambda .\text{E}!R(PQ)ʻa.\text{E}!R(\breve{P} Q)ʻa.\supset .(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa{\sim}\in 0\cup 1\\ &[*233·172]\end{align}$

*233·425. $\begin{align}&\vdash :(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1.\text{E}!R(PQ)ʻa.\text{E}!P(\breve{P} Q)ʻa.\supset .\exists !\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR\\ &[*233·424.\text{Transp}]\end{align}$

*233·426. $\vdash :P\,\unicode{x2abd}\, J.(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 1.\supset .\exists !\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR \quad[*233·174]$

*233·43. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.&(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 1.\supset.\\ &R(PQ)ʻa = R(\breve{P} Q)ʻa = \breve{\iota} ʻ(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\alpha \quad[*231·193]\end{align}$

*233·431. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa{\sim}\in 0\cup 1.\\ &\text{E}!R(PQ)ʻa.\text{E}!R(\breve{P} Q)ʻa.\supset .\{R(\breve{P} Q)ʻa\}P\{R(PQ)ʻa\}\\ &[*215·52.*231·13·101]\end{align}$

*233·432. $\begin{align}&\vdash :P\in \text{trans}\cap \text{connex} .(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa=\Lambda .\\ &\text{E}!R(PQ)ʻa.\text{E}!R(\breve{P} Q)ʻa.\supset .\{R(PQ)ʻa\}P_{*}\{R(\breve{P} Q)ʻa\} \quad[*215·53]\end{align}$

*233·433. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset\\ &CʻP.(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa=\Lambda . \text{E}!R(PQ)ʻa.\text{E}!R(\breve{P} Q)ʻa.\supset :R(PQ)ʻa=R(\breve{P} Q)ʻa.\lor.\{R(PQ)ʻa\}P_1\{R(\breve{P} Q)ʻa\}\\ &[*215·54.*232·22]\end{align}$

*233·434. $\begin{align}&\vdash :P\in \text{Ser}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\text{E}!R(PQ)ʻa.\\ &\text{E}!R(\breve{P} Q)ʻa.\supset .\{R(PQ)ʻa\}(P_1\unicode{x228d} \breve{P} _*)\{R(\breve{P} Q)ʻa\} \quad[*233·43·431·433]\end{align}$

*233·435. $\begin{align}&\vdash :P\in \text{Ser}.R(PQ)ʻa=R(\breve{P} Q)ʻa.\supset .(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1\\ &[*233·431.\text{Transp}]\end{align}$

*233·44. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\text{E}!R(PQ)ʻa.\\ &\text{E}!R(\breve{P} Q)ʻa.{\sim}{R(PQ)ʻa\in \text{D}ʻP_1.R(\breve{P} Q)ʻa\in \text{ᗡ}ʻP_1}.\supset :\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa.\equiv .(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1 \quad[*233·426·43·433·435]\end{align}$

*233·45. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}\cap \text{Ded}.P^{2}&=P.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset :\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa.\equiv _a.(P\overline{R}Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1\\ &[*233·13.*201·65.*233·44]\end{align}$

*233·5. $\vdash :Q\in \text{Ser}.a=\text{lt}_Qʻ(\alpha \cap \text{ᗡ}ʻR).\supset .\overrightarrow{Q}ʻa=Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR) \quad[*207·291]$

*233·501. $\vdash \colon\ldotp Q\in \text{Ser}.\alpha=\text{lt}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR).\supset :\exists !\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.\equiv .\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*233·5.\supset \vdash \colon\ldotp \text{Hp}.\supset :\exists !\overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.&\equiv .\exists !Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\cap \text{ᗡ}ʻR. &\qquad \text{(1)}\\ [*37·29·265] &\supset .\exists !\alpha \cap \text{ᗡ}ʻR\cap CʻQ &\qquad \text{(2)}\\ \vdash .*90·33.*22·43.&\supset \vdash :x\in \alpha \cap CʻQ\cap \text{ᗡ}ʻR.\supset .x\in Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR).x\in \text{ᗡ}ʻR &\qquad \text{(3)}\\ \vdash .(3).*10·28. &\supset \vdash :\exists !\alpha \cap CʻQ\cap \text{ᗡ}ʻR.\supset .\exists !Q_{*}ʻʻ(\alpha \cap \text{ᗡ}ʻR)\cap \text{ᗡ}ʻR &\qquad \text{(4)}\\ \vdash .(1).(2).(4).\supset \vdash .\text{Prop} \end{array}$

*233·51. $\begin{align}\vdash :\text{Hp}*233·5.&P\in \text{Ser}.Rʻʻ(\alpha \cap CʻQ)\subset CʻP.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa=\Lambda .\\ &\text{E}!R(PQ)ʻ\alpha.\supset .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻ\alpha \quad[*233·2·5]\end{align}$

*233·511. $\begin{align}&\vdash :\text{Hp}*233·5.P\in \text{Ser}.\exists !(P\overline{R} Q)_{\text{os}}ʻ\alpha .(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\alpha\in 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻa=R(\breve{P} Q)ʻa=\breve{\iota} ʻ(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\alpha\\ &[*233·501·5·21]\end{align}$

*233·512. $\begin{align}&\vdash \colon\ldotp \text{Hp}*233·5.P\in \text{Ser}.Rʻʻ(\alpha \cap CʻQ)\subset CʻP.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\alpha=\iota ʻx.\supset :\\ &x=R(PQ)ʻ\alpha=R(\breve{P} Q)ʻ\alpha:x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\lor.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha P_{1}x\\ &[*233·22·23.*232·22]\end{align}$

*233·513. $\vdash :\text{Hp}*233·512.x{\sim}\in \text{ᗡ}ʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*233·512]$

*233·514. $\begin{align}&\vdash :\text{Hp}*233·512.x{\sim}\in CʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &\left[*233·513\frac{\breve{P}}{P}.*233·513\right]\end{align}$

*233·515. $\begin{align}\vdash :P,Q&\in \text{Ser}.a=\text{lt}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR).Rʻʻ(CʻQ\cap \alpha )\subset CʻP.\\ &(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\alpha\in 0\cup 1.\text{E}!R(PQ)ʻ\alpha.R(PQ)ʻ\alpha{\sim}\in CʻP_{1}.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻ\alpha=R(\breve{P} Q)ʻ\alpha\\ &[*233·142·5]\end{align}$

*233·516. $\begin{align}\vdash :P,Q&\in \text{Ser}.\text{E}!R(PQ)ʻ\text{lt}_{Q}ʻ\alpha .R(PQ)ʻ\text{lt}_{Q}ʻ\alpha {\sim}\in CʻP_{1}.\\ &Rʻʻ(CʻQ\cap \alpha )\subset CʻP.(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻ\text{lt}_{Q}ʻ\alpha \in 0\cup 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha = (\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha = R(PQ)ʻ\text{lt}_{Q}ʻ\alpha = R(\breve{P} Q)ʻ\text{lt}_{Q}ʻ\alpha \\ &[*233·515]\end{align}$

*233·52. $\begin{align}\vdash \colon\ldotp &\text{Hp}*233·5.P\in \text{Ser}\cap \text{Ded}.P^{2}=P.RʻʻCʻQ\subset CʻP.\supset :\\ &(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻ\alpha=R(\breve{P} Q)ʻa \quad[*233·25]\end{align}$

*233·53. $\begin{align}\vdash :Q\in \text{Ser}.P\in &\text{Ser}\cap \text{Ded}.P^{2}=P.RʻʻCʻQ\subset CʻP.\alpha \subset \text{ᗡ}ʻR.\text{E}!\text{lt}_{Q}ʻ\alpha .\\ &(P\overline{R} Q)_{\text{os}}ʻQ_{*}ʻʻ\alpha \in 0\cup 1.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =R(PQ)ʻ\text{lt}_{Q}ʻ\alpha =R(\breve{P} Q)ʻ\text{lt}_{Q}ʻ\alpha\\ &[*233·52]\end{align}$

In the present number we are concerned with the definition and analysis of the continuity of functions. The following definition of continuity is given by Dini[17]:

By the second form of the above definition, the function $R$ of previous numbers is to be called continuous at the point $a$ if $R(PQ)ʻa = R(\breve{P} Q)ʻa = R(P\breve{Q} )ʻa = R(\breve{P} \breve{Q} )ʻa = Rʻa.$ The first form of the definition can also be so stated as to be free from any reference to number, and derivable from the ideas dealt with in the previous numbers of the present section. For this purpose, instead of "a positive number $\sigma$ " we take an interval in which $Rʻa$ is contained, say $P(z - w)$ . Similarly the "values of $\delta$ which are numerically less than ${\in}$ " are replaced by arguments in a certain interval containing $a$ .

By *233·423, if the limits of the function as the argument approaches $a$ are to be all equal, $a$ must not be the maximum or minimum of $\text{ᗡ}ʻR$ . We therefore take the interval containing $a$ to be an interval in which the end-points are not included, say $Q(y -y')$ . Thus our definition becomes $\begin{aligned} (\text{A})\quad Rʻa\in &P(z-w).\supset _{z, w}.\\ &(\exists y,y').y,y'\in \text{ᗡ}ʻR.a\in Q(y-y').RʻʻQ(y\vdash\dashv y')\subset P(z-w) \end{aligned}$

We require further, what is tacitly assumed in Dini's definition, that $Rʻa$ is a member of $CʻP$ which has no immediate predecessor or successor, i.e. $Rʻa\in CʻP-CʻP_{1}.$

In order to deal more easily with the above definition, we analyse it into the product of four factors, which concern respectively $P$ and $Q$ , $\breve{P}$ and $Q$ , $P$ and $\breve{Q}$ , $\breve{P}$ and $\breve{Q}$ . In the first place, it is obvious that (A) is the product of $(\text{B})\quad Rʻa \in P(z-w). \supset _{z,w} . (\exists y) . y \in \text{ᗡ}ʻR . y \in \overrightarrow{Q}ʻa . RʻʻQ(y \unicode{x27dd} a) \subset P(z-w)$ and a factor obtained by substituting $\breve{Q}$ for $Q$ in ( $\text{B}$ ). If $Q_{*} \in \text{connex}$ , and $P_{\text{po}}\in\text{Ser}$ , ( $\text{B}$ ) is the product of $(\text{C}) Rʻa \in \overrightarrow{P}_{\text{po}}ʻw . \supset _w . (\exists y) . y \in \text{ᗡ}ʻR . y \in \overrightarrow{Q}ʻa . RʻʻQ (y \unicode{x27dd} a) \subset \overrightarrow{P}_{*}ʻw$ and a factor obtained by writing $\breve{P}$ for $P$ and $z$ for $w$ in ( $\text{C}$ ); and in virtue of $Rʻa {\sim}\in CʻP_{1}$ , ( $\text{C}$ ) becomes $Rʻa \in \overrightarrow{P}_{\text{po}}ʻw . \supset _w . (\exists y) . y \in \text{ᗡ}ʻR . y \in \overrightarrow{Q}ʻa . RʻʻQ (y \unicode{x27dd} a) \subset \overrightarrow{P}_{\text{po}}ʻw.$ i.e. if $Q$ is transitive, $(\text{D}) Rʻa \in \overrightarrow{P}_{\text{po}}ʻw . \supset _w . R(Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)_{\text{cn}} (\overrightarrow{P}_{\text{po}}ʻw)$

Hence the function is continuous for the argument a if a satisfies ( $\text{D}$ ) and the three other hypotheses resulting from replacing $P$ by $\breve{P}$ , or $Q$ by $\breve{Q}$ , or $P$ and $Q$ by $\breve{P}$ and $\breve{Q}$ . If we substitute $x$ for $Rʻa$ , and $Q$ for $Q_{*} \unicode{x0294f} \overrightarrow{Q}ʻa$ , ( $\text{D}$ ) becomes $(\text{E}) \overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx \subset \overleftarrow{Q}_{\text{cn}}ʻR$

Hence continuity can be studied by studying the hypothesis ( $\text{E}$ ), and replacing $x$ by $Rʻa$ and $Q$ by $Q_{*}\unicode{x0294f} \overrightarrow{Q}ʻa$ .

The hypothesis ( $\text{E}$ ) is an interesting one on its own account. We put $\text{sc}(P,Q)ʻR = CʻP \cap \hat{x} (\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx \subset \overleftarrow{Q}_{\text{cn}}ʻR) \quad\text{Df}.$ Thus " $x \in \text{sc}(P,Q)ʻR$ " means that $x$ is a member of the value-series such that, if $y$ is any later member, the function ultimately becomes less than $y$ . If we put further $\text{os}(P,Q)ʻR = \text{sc}(P,Q)ʻR \cap \text{sc}(\breve{P} ,Q)ʻR \quad\text{Df},$ then, if $x$ is a member of $\text{os}(P,Q)ʻR$ , the function ultimately becomes less than any later member of $CʻP$ , and greater than any earlier member. Hence $x$ is the limit of the function as the argument increases indefinitely. Hence, if we substitute $Q_{*}\unicode{x0294f} \overrightarrow{Q}ʻa$ for $Q$ , and if $x\in \text{os}(P,Q_{*} \unicode{x0294f} \overrightarrow{Q}ʻa)ʻR$ , $x$ is the limit of the function as the argument approaches a from below, i.e. $R(PQ)ʻa = R(\breve{P} Q)ʻa = x.$ (This is proved in *234·462.) Hence, putting $Rʻa$ in place of $x$ , the function is continuous from below at the point $a$ if $Rʻa \in \text{os}(P,Q_{*} \unicode{x0294f} \overrightarrow{Q}ʻa)ʻR,$ [Pg 755] and is continuous from above if $Rʻa\in \text{os}(P,\breve{Q} _{*}\unicode{x0294f}\overleftarrow{Q}ʻa)ʻR.$ These results, and various others connected with them, are proved below. The equivalence of Dini's two definitions is proved in *234·63. It will be observed that practically nothing in the theory of continuous functions requires the use of numbers.

We use the symbol " $\text{ct}(PQ)ʻR$ " for the class of arguments $a$ for which the limit of the function for approaches to a from below is $Rʻa$ . Thus, in virtue of what was said above, we may put $\text{ct}(PQ)ʻR=\hat{a}\{Rʻa\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR-CʻP_{1}\} \quad\text{Df}.$ Then a function is continuous at the point $a$ if a belongs to the two classes $\text{ct}(PQ)ʻR$ and $\text{ct}(P\breve{Q} )ʻR$ . Hence we put $\text{contin}(PQ)ʻR=\text{ct}(PQ)ʻR\cap \text{ct}(P\breve{Q} )ʻR \quad\text{Df}.$ The function $R$ is continuous with respect to $P$ and $Q$ if it is continuous for all arguments in $CʻQ$ . Thus we put $P\overline{\text{contin}} Q=\hat{R}\{\exists !CʻQ\cap \text{ᗡ}ʻR.CʻQ\cap \text{ᗡ}ʻR\subset \text{contin}(PQ)ʻR\} \quad\text{Df}.$

Our propositions in this number begin with the properties of $\text{sc}(P,Q)ʻR$ and $\text{os}(P,Q)ʻR$ . We have

*234·103. $\vdash :P_{\text{po}}\in \text{Ser}.\exists !\text{os}(P,Q)ʻR.\supset .P\overline{R} _{\text{os}}Q\in 0\cup 1$

Thus the hypothesis $\exists !\text{os}(P,Q)ʻR$ enables us to use propositions of previous numbers having the hypothesis $P\overline{R}_{\text{os}}Q\in 0\cup 1$ .

The identification of our definitions with the usual definitions of continuity of functions proceeds by means of the proposition

*234·12. $\begin{align}\vdash \colon\colon Q_{*}\in &\text{connex} .\supset \colon\ldotp x\in \text{os}(P,Q)ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.RQ_{\text{cn}}\{P(z-w)\}\end{align}$

We have a collection of propositions dealing with the relations of $\text{sc}(P,Q)ʻR$ to $P\overline{R} _{\text{sc}}Q$ and $\breve{P}\overline{R}_{\text{sc}}Q$ . $\text{sc}(P,Q)ʻR$ is an upper section of $P$ (*234·131); $\text{sc}(P,Q)ʻR$ is the complement of $Pʻʻ(P\overline{R} _{\text{sc}}Q)$ , i.e. of $P\overline{R} _{\text{sc}}Q$ without its maximum (if any). This is expressed in the following proposition:

*234·174. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.Q_{*}\in \text{connex} .Rʻʻ&CʻQ\subset CʻP.\supset .\\ &CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR=Pʻʻ(P\overline{R} _{\text{sc}}Q)=CʻP-\text{sc}(P,Q)ʻR\end{align}$

*234·182. $\begin{align}\vdash :P\in \text{Ser}.Q_{*}\in \text{connex} .Rʻʻ&CʻQ\subset CʻP.\supset .\\ &\overrightarrow{\text{limax}} _{P}ʻ(P\overline{R} _{\text{sc}}Q) = \overrightarrow{\text{min}}_{P}ʻ\text{sc}(P, Q)ʻR\end{align}$

Thus $\text{os}(P,Q)ʻR$ is contained in $\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup\overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R}_{\text{sc}}Q)$ (*234·201), and therefore has not more than two terms (*234·202). If $P\overline{R}_{\text{os}}Q$ has one term, this is the only member of $\text{os}(P,Q)ʻR$ (*234·203). If $\text{os}(P,Q)ʻR$ has two terms, they have the relation $P_{1}$ (*234·242); hence if $P$ is a compact series, and $\text{os}(P,Q)ʻR$ is not null, its only member is both $\text{limax}_Pʻ(P\overline{R}_{\text{sc}}Q)$ and $\text{limin}_Pʻ(\breve{P} \overline{R}_{\text{sc}}Q)$ (*234·25), while conversely, if $\text{limax}_Pʻ(P\overline{R}_{\text{sc}}Q)$ and $\text{limin}_Pʻ(\breve{P} \overline{R}_{\text{sc}}Q)$ are equal, each is the only member of $\text{os}(P,Q)ʻR$ (*234·251).

We now apply the above results to the limits of a function as its argument approaches the limit of a class $\alpha$ . This is done, as before, by substituting $Q_{*}\unicode{x0294f}\alpha$ for $Q$ . We arrive at the proposition (*234·33) that if $P$ has Dedekindian continuity, and $\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR$ is not null, its only member is both $(P\overline{R} Q)_{\text{lmx}}ʻ\alpha$ and $(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha$ , i.e. is the limit of the function as the argument increases in $\alpha$ .

We then take for $\alpha$ the particular value $\overrightarrow{Q}_{\text{po}}ʻa$ , so that we become concerned with what happens when the argument approaches a from below. For the comparison of our definition of continuity with such definitions as the one quoted from Dini above, we have

*234·41. $\begin{align}\vdash \colon\colon Q\in \text{trans}.Q_{*}\unicode{x0294f}&\overrightarrow{Q}ʻa\in \text{connex} .\supset \colon\ldotp\\ &x\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.\\ &(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\unicode{x27dd} a)\subset P(z-w)\end{align}$

I.e. if $x$ is neither the first nor the last member of the $P$ -series, $x$ belongs to $\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR$ when, and only when, given any interval $P(z-w)$ , however small, in which $x$ is contained, there is an argument $y$ earlier than $a$ , such that the value of the function for all arguments earlier than a but not earlier than $y$ lies in the interval $P(z-w)$ .

We deduce from previous propositions that, with the usual hypothesis as to $Q$ , if $P$ is a Dedekindian series, $R(PQ)ʻa=\text{limin}_Pʻ\text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR \quad(*234·422),$ and if $P$ is a series and $\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)$ is a unit class, its only member is both $R(PQ)ʻa$ and $R(\breve{P} Q)ʻa$ , i.e. is the limit of the function for approaches to $a$ from below (*234·43). The following proposition sums up our results:

*234·45. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}.Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.P^{2}=P.\supset :\\ \exists !\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR.&\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(PQ)ʻa.\\ &\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(\breve{P} Q)ʻa.\\ &\equiv .R(PQ)ʻa=R(\breve{P} Q)ʻa\end{align}$

Thus $\exists!\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR$ is, in a compact series, the necessary and sufficient condition for the existence of a definite limit of the function as the argument approaches $a$ from below.

Without assuming $P^{2} = P$ , if $x$ is a member of $\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR$ , and if $x$ has no immediate predecessor or successor, so that in the neighbourhood of $x$ the series is compact, we still have $x =R(PQ)ʻa = R(\breve{P} Q)ʻa$ (*234·462).

*234·5. $\vdash :a\in \text{ct}(PQ)ʻR.\equiv .Rʻa\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR-CʻP_{1}$

Thus $a$ is an argument for which the function has a single value which has no immediate predecessor or successor in $P$ , and which, in virtue of *234·462, is the limit of the function as the argument approaches $a$ from below (*234·52). The cases when $Rʻa = BʻP$ or $Rʻa = Bʻ\breve{P}$ require special attention; excluding these cases, we arrive at

*234·51. $\begin{align}\vdash &\colon\colon Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP.\supset \colon\ldotp \\ &a\in \text{ct}(PQ)ʻR.\equiv :Rʻa{\sim}\in CʻP_{1}:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\vdash\dashv a)\subset P(z-w)\end{align}$

We prove (*234·562) that if $P$ , $Q$ are series, and $\alpha$ is any class of arguments for which all the values belong to $CʻP$ , and if $\alpha$ has a limit at which the function is continuous from below, then the limit of the function, as the argument increases in $\alpha$ , is the value of the function at the limit of $\alpha$ .

We next consider $\text{contin}(PQ)ʻR$ , which is defined as $\text{ct}(PQ)ʻR\cap \text{ct}(P\breve{Q} )ʻR$ . We show that if $P$ is a series whose field contains $Rʻʻ(\overleftrightarrow{Q}ʻa$ and $Q$ is transitive, and $Q_{*} \unicode{x0294f}\overleftrightarrow{Q}ʻa$ is connected, and $Rʻa$ is neither $BʻP$ nor $Bʻ\breve{P}$ , then if $a$ belongs to the class $\text{contin}(PQ)ʻR$ , $Rʻa$ is the limit of the function for the argument $a$ for approaches either from below or from above (*234·62). If $P$ is compact, the converse also holds (*234·63). Our definition of a point of continuity is thus identified with the second form of Dini's definition quoted above. It is identified with the first form by the following proposition: In the circumstances of *234·62, if $Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP$ , we have (*234·64) $\begin{aligned} a\in \text{contin}(PQ)ʻ&R.\equiv :Rʻa\in CʻP-CʻP_{1}:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y,y').y,y'\in \text{ᗡ}ʻR.a\in Q(y-y').RʻʻQ(y\vdash\dashv y')\subset P(z-w), \end{aligned}$ i.e. $a$ is a point of continuity when, and only when, the value $Rʻa$ for the argument $a$ is a member of the $P$ -series having no immediate predecessor or successor, and if $Rʻa$ is contained in the interval $P(z-w)$ , then,[Pg 758] however small this interval may be, two arguments $y$ , $y'$ can be found such that a lies between them, and the values for all arguments from $y$ to $y'$ (both included) lie in the interval $P(z-w)$ .

We end with a few propositions on continuous functions. The last of these (*234·73) states that, if $P$ is a compact series and $Q$ is transitive and connected, then $R$ is continuous with respect to $P$ and $Q$ when, and only when, it has arguments in $CʻQ$ , and for all such arguments $a$ we have $R(PQ)ʻa=R(\breve{P} Q)ʻa=R(P\breve{Q} )ʻa=R(\breve{P} \breve{Q} )ʻa=Rʻa,$ i.e. the value for every argument is the limit for that argument for approaches either from above or from below.

*234·01. $\text{sc}(P,Q)ʻR=CʻP\cap \hat{x} (\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\subset \overleftarrow{Q}_{\text{cn}}ʻR) \quad\text{Df}$

*234·02. $\text{os}(P,Q)ʻR=\text{sc}(P,Q)ʻR\cap \text{sc}(\breve{P},Q)ʻR \quad\text{Df}$

*234·03. $\text{ct}(PQ)ʻR=\hat{a} \{Rʻa\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR-CʻP_{1}\} \quad\text{Df}$

*234·04. $\text{contin}(PQ)ʻR=\text{ct}(PQ)ʻR\cap \text{ct}(P\breve{Q})ʻR \quad\text{Df}$

*234·05. $P\overline{\text{contin}} Q=\hat{R} \{\exists !CʻQ\cap \text{ᗡ}ʻR.CʻQ\cap \text{ᗡ}ʻR\subset \text{contin}(PQ)ʻR\} \quad\text{Df}$

*234·1. $\begin{align}\vdash \colon\ldotp &x\in \text{sc}(P,Q)ʻR.\equiv :x\in CʻP:xP_{\text{po}}w.\supset _{w}.RQ_{\text{cn}}(\overrightarrow{P} _{\text{pο}}ʻw):\\ &\equiv :x\in CʻP:xP_{\text{pο}}w.\supset _{w}.(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \overrightarrow{P}_{\text{po}}ʻw\\ &[*230·11.(*234·01)]\end{align}$

*234·101. $\vdash :P_{\text{po}}\in \text{Ser}.x\in \text{sc}(P,Q)ʻR.\supset .P\overline{R} _{\text{sc}}Q\subset \overrightarrow{P}_{*}ʻx$

Dem. $\begin{array}{l} \vdash .*40·16.(*234·01).\supset \\ \vdash :\text{Hp}.\supset .x\in CʻP.pʻP_{*}ʻʻʻ\overleftarrow{Q}_{\text{cn}}ʻR\cap CʻP&\subset pʻP _{*}ʻʻʻ\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\cap CʻP\\ [*91·574] & \subset pʻ\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\cap CʻP\\ [*204·65.*91·602] &\subset \overrightarrow{P}_{*}ʻx &\qquad \text{(1)}\\ \vdash .(1).*231·1.\supset \vdash .\text{Prop} \end{array}$

*234·102. $\vdash :P_{\text{po}}\in \text{Ser}.x\in \text{os}(P,Q)ʻR.\supset .P\overline{R} _{\text{os}}Q\subset \iota ʻx$

Dem. $\begin{array}{l} \vdash .*234·1·101.(*234·02)\supset \vdash :\text{Hp}.&\supset .x\in CʻP.P\overline{R} _{\text{os}}Q\subset \overrightarrow{P}_{*}ʻx\cap \overleftarrow{P}_{*}ʻx.\\ [*200·39] &\supset .P\overline{R} _{\text{os}}Q\subset \iota ʻx:\supset \vdash .\text{Prop} \end{array}$

*234·103. $\vdash :P_{\text{po}}\in \text{Ser}.\exists !\text{os}(P,Q)ʻR.\supset .P\overline{R} _{\text{os}}Q\in 0\cup 1$

Dem. $\begin{array}{l} \vdash .*234·102.\supset \vdash :\text{Hp}.&\supset .(\exists x).P\overline{R} _{\text{os}}Q\subset \iota ʻx\\ [*51·401] &\supset .P\overline{R} _{\text{os}}Q\in 0\cup 1:\supset \vdash .\text{Prop} \end{array}$

*234·104. $\vdash :RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx).\supset .x\in \text{sc}(P,Q)ʻR$

Dem. $\begin{array}{l} \vdash .*91·52. &\supset \vdash :xP_{\text{po}}z.\supset .\overrightarrow{P}_{*}ʻx\subset \overrightarrow{P}_{\text{po}}ʻz &\qquad \text{(1)}\\ \vdash .(1).*230·211·151.&\supset \vdash \colon\ldotp \text{Hp}.\supset :xP_{\text{po}}z.\supset _{z}.RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻz):x\in CʻP:\\ [*234·1] &\supset :x\in \text{sc}(P,Q)ʻR\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*234·105. $\vdash :P_{\text{po}}\in \text{Ser}.x\in \text{sc}(P,Q)ʻR\cap \text{D}ʻP_{1}.\supset .RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx)$

Dem. $\begin{array}{l} \vdash .*201·63.*121·254.\supset \vdash \colon\colon\text{Hp}.xP_{1}z.\supset \colon\ldotp yP_{\text{po}}z.&\supset :{\sim}(xP_{\text{po}}y):\\ [*202·103] &\supset :yP_{\text{po}}x.\lor.y=x &\qquad \text{(1)}\\ \vdash .(1).*91·54. \supset \vdash \colon\ldotp \text{Hp}.xP_{1}z.&\supset :\overrightarrow{P}_{\text{po}}ʻz\subset \overrightarrow{P}_{*}ʻx:\\ [*230·211] &\supset :RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻz).\supset .RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx) &\qquad \text{(2)}\\ \vdash .*234·1. &\supset \vdash :\text{Hp}.\supset .(\exists z).xP_{1}z.RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻz) &\qquad \text{(3)}\\ \vdash .(2)·(3).\supset \vdash .\text{Prop} \end{array}$

When $x{\sim}\in \text{D}ʻP_{1}$ , the above proposition is not necessarily true: it may fail if $x=\text{min}_{P}ʻ\text{sc}(P,Q)ʻR$ .

It is to be observed that $\text{sc}(P,Q)ʻR$ and $\text{os}(P,Q)ʻR$ are functions of $P_{\text{po}}$ , so that they are unchanged when $P_{\text{po}}$ is substituted for $P$ . Hence the hypothesis $P_{\text{po}}\in \text{Ser}$ is as effective, with regard to them, as the hypothesis $P\in \text{Ser}$ . This is stated in the following proposition.

*234·106. $\vdash .\text{sc}(P,Q)ʻR=\text{sc}(P_{\text{po}},Q)ʻR.\text{os}(P,Q)ʻR=\text{os}(P_{\text{po}},Q)ʻR \quad[*234·1]$

*234·107. $\vdash \colon\ldotp x\in CʻP-\text{D}ʻP_{1}.\supset :x\in \text{sc}(P,Q)ʻR.\equiv .\overrightarrow{P}_{*}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\subset \overleftarrow{Q}_{\text{cn}}ʻR$

Dem. $\begin{array}{l} \vdash .*121·254.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x{\sim}\in \text{D}ʻ(P_{\text{po}})_{1}:\\ [*201·61] & \supset :x{\sim}\in \text{D}ʻ{P_{\text{po}}\dot{-} P_{\text{po}}^{2}}:\\ [*10·51] \supset :xP_{\text{po}}y.&\supset .xP_{\text{po}}^{2}y.\\ [*91·574] &\supset .(\exists z).xP_{\text{po}}z.\overrightarrow{P}_{*}ʻz\subset \overrightarrow{P}_{\text{po}}ʻy &\qquad \text{(1)}\\ \vdash .(1).*230·211.\supset \\ \vdash \colon\ldotp \text{Hp}:xP_{\text{po}}y.&\supset _{y}.RQ_{\text{cn}}\overrightarrow{P}_{*}ʻy:\supset :xP_{\text{po}}y.\supset _{y}.RQ_{\text{cn}}\overrightarrow{P}_{\text{po}}ʻy &\qquad \text{(2)}\\ \vdash .*91·54.*230·211.\supset \\ \vdash \colon\ldotp xP_{\text{po}}y.&\supset _{y}.RQ_{\text{cn}}\overrightarrow{P}_{\text{po}}ʻy:\supset :xP_{\text{po}}y.\supset _{y}.RQ_{\text{cn}}\overrightarrow{P}_{*}ʻy &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash \colon\ldotp \text{Hp}.&\supset :\overrightarrow{P}_{*}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\subset \overleftarrow{Q}_{\text{cn}}ʻR.\equiv .\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx\subset \overleftarrow{Q}_{\text{cn}}ʻR &\qquad \text{(4)}\\ \vdash .(4).*234·1.\supset \vdash .\text{Prop} \end{array}$

*234·11. $\begin{align}\vdash \colon\ldotp &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.RQ_{\text{cn}}{P(z-w)}:\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.\\ &(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset P(z-w) \quad[*230·11]\end{align}$

*234·111. $\begin{align}\vdash \colon\ldotp x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.&RQ_{\text{cn}}\{P(z-w)\}:\supset .\\ &x\in \text{os}(P,Q)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*230·211.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp &x\in \text{D}ʻP\cap \text{ᗡ}ʻP\colon\ldotp xP_{\text{po}}w:(\exists z).zP_{\text{po}}x:\supset _{w}.RQ_{\text{cn}}\overrightarrow{P}_{\text{po}}ʻw\colon\ldotp \\ [*91·504] &\supset \colon\ldotp x\in \text{D}ʻP:xP_{\text{po}}w.\supset _{w}.RQ_{\text{cn}}\overrightarrow{P}_{\text{po}}ʻw\colon\ldotp \\ [*234·1] &\supset \colon\ldotp x\in \text{sc}(P,Q)ʻR &\qquad \text{(1)}\\ \text{Similarly}\quad &\vdash :\text{Hp}.\supset .\text{sc}(\breve{P} ,Q)ʻR &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·12. $\begin{align}\vdash \colon\colon Q_{*}\in \text{connex} .&\supset \colon\ldotp x\in \text{os}(P,Q)ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.RQ_{\text{cn}}\{P(z-w)\}\end{align}$

Dem. $\begin{array}{l} \vdash .*234·1.&\supset \vdash \colon\ldotp x\in \text{os}(P,Q)ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:xP_{\text{po}}w.\supset _{w}.RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻw):zP_{\text{po}}x.\supset _{z}.RQ_{\text{cn}}(\overleftarrow{P}_{\text{po}}ʻz):\\ [*11·71]&\equiv :x\in \text{D}ʻP\cap \text{ᗡ}ʻP:zP_{\text{po}}x.xP_{\text{po}}w.\supset _{z,w}.RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻw).RQ_{\text{cn}}(\overleftarrow{P}_{\text{po}}ʻz) &\qquad \text{(1)}\\ \vdash .*230·42.\supset \vdash \colon\ldotp \text{Hp}.\supset :&RQ_{\text{cn}}\overrightarrow{P}_{\text{po}}ʻw.RQ_{\text{cn}}(\overleftarrow{P}_{\text{po}}ʻz).\equiv.\\ \end{array}$

*234·121. $\vdash .\overrightarrow{B}ʻ\breve{P} \subset \text{sc}(P,Q)ʻR \quad[*93·104.(*234·01)]$

*234·122. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in &\text{connex} .x=BʻP.\supset :\\ &x\in \text{os}(P,Q)ʻR.\equiv .x\in \text{sc}(P,Q)ʻR.\equiv .\overrightarrow{P}_{\text{po}}ʻʻ\text{ᗡ}ʻP\subset \overleftarrow{Q}_{\text{cn}}ʻR\\ &[*234·121.(*234·02).*234·1.*205·253]\end{align}$

*234·13. $\vdash :x\in \text{sc}(P,Q)ʻR.\supset .\overleftarrow{P}_{*}ʻx\subset \text{sc}(P,Q)ʻR$

Dem. $\begin{array}{l} \vdash .*96·3.*91·74.*90·13.\supset \vdash :xP_{*}z.&\supset .\overleftarrow{P}_{\text{po}}ʻz\subset \overleftarrow{P}_{\text{po}}ʻx.z\in CʻP.\\ [*37·2] &\supset .\overrightarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻz\subset \overleftarrow{P}_{\text{po}}ʻʻ\overleftarrow{P}_{\text{po}}ʻx.z\in CʻP &\qquad \text{(1)}\\ \vdash .(1).(*234·01).\supset \vdash .\text{Prop} \end{array}$

*234·131. $\vdash .\text{sc}(P,Q)ʻR=\breve{P} _{*}ʻʻ\text{sc}(P,Q)ʻR.\text{sc}(P,Q)ʻR\in \text{sect}ʻ\breve{P}$

Dem. $\begin{array}{l} \vdash .*90·21.*234·1.&\supset \vdash .\text{sc}(P,Q)ʻR\subset \breve{P} _{*}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(1)}\\ \vdash .*234·13. &\supset \vdash .\breve{P} _{*}ʻʻ\text{sc}(P,Q)ʻR\subset \text{sc}(P,Q)ʻR &\qquad \text{(2)}\\ \vdash .(1).(2).*211·13.\supset \vdash .\text{Prop} \end{array}$

*234·14. $\vdash :Q_{*}\in \text{connex} .x\in \text{sc}(P,Q)ʻR.\supset .x\in CʻP.\overleftarrow{P}_{\text{po}}ʻx\subset \breve{P} \overline{R} _{\text{sc}}Q$

Dem. $\begin{array}{l} \vdash .*234·1.\supset \vdash \colon\ldotp \text{Hp}.\supset :x\in CʻP:xP_{\text{po}}z.&\supset _{z}.RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻz).\\ [*230·211] &\supset _{z}.RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻz).\\ [*231·141] &\supset _{z}.z\in \breve{P} \overline{R} _{\text{sc}}Q\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*234·141. $\vdash :Q_{*}\in \text{connex} .\exists !\text{sc}(P,Q)ʻR.\supset .\exists !\breve{P} \overline{R} _{\text{sc}}Q \quad[*234·14]$

*234·142. $\vdash :\exists !\text{sc}(P,Q)ʻR\cap \text{D}ʻP.\supset .\exists !CʻQ\cap \text{ᗡ}ʻR$

Dem. $\begin{array}{l} \vdash .*234·1.\supset \\ \vdash \colon\ldotp x\in \text{sc}(P,Q)ʻR\cap \text{D}ʻP.&\supset :x\in \text{D}ʻP:(\exists w).xP_{\text{po}}w.\supset .\exists !CʻQ\cap \text{ᗡ}ʻR:\\ [*91·504] & \supset :\exists !CʻQ\cap \text{ᗡ}ʻR\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*234·15. $\vdash :P_{*},Q_{*}\in \text{connex} .\exists !\text{sc}(P,Q)ʻR.\supset .P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q=CʻP$

Dem. $\begin{array}{l} \vdash .*231·202.*234·141.&\supset \vdash :\text{Hp}.\supset .CʻP-P\overline{R} _{\text{sc}}Q\subset \breve{P} \overline{R} _{\text{sc}}Q &\qquad \text{(1)}\\ \vdash .*231·1. &\supset \vdash .P\overline{R} _{\text{sc}}Q\cup \breve{P} \overline{R} _{\text{sc}}Q\subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·16. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.Q_{*}\in \text{connex} .\supset .\\ &P\overline{R} _{\text{sc}}Q\subset pʻ\overrightarrow{P}_{*}ʻʻ\text{sc}(P,Q)ʻR.\breve{P} _{\text{po}}ʻʻ\text{sc}(P,Q)ʻR\subset \breve{P} \overline{R} _{\text{sc}}Q \quad[*234·101·14]\end{align}$

*234·161. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset CʻP.P\overline{R} _{\text{sc}}Q&\subset \overrightarrow{P}_{*}ʻx.\supset :\\ &P\overline{R} _{\text{sc}}Q=\overrightarrow{P}_{*}ʻx.\lor.RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx)\end{align}$

Dem. $\begin{array}{l} \vdash .*231·24.\supset \vdash :\text{Hp}.{\sim}\{RQ_{\text{cn}}(\overrightarrow{P}_{*}ʻx)\}.&\supset .\overrightarrow{P}_{*}ʻx\subset P\overline{R} _{\text{sc}}Q.\\ [\text{Hp}.*22·41] &\supset .\overrightarrow{P}_{*}ʻx=P\overline{R} _{\text{sc}}Q:\in \vdash .\text{Prop} \end{array}$

*234·162. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset &CʻP.\overrightarrow{P}_{*}ʻx=P\overline{R} _{\text{sc}}Q.x\in CʻP.\supset .\\ &x\in \text{sc}(P,Q)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*202·5.\supset \vdash \colon\ldotp \text{Hp}.xP_{\text{po}}z.&\supset :z{\sim}\in P\overline{R} _{\text{sc}}Q:\\ [*231·12] &\supset :(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.z{\sim}\in P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}y:\\ [*211·56] & \supset :(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.P_{*}ʻʻRʻʻ\overleftarrow{Q}_{*}ʻy\subset \overrightarrow{P}_{\text{po}}ʻz:\\ [*90·33] &\supset :(\exists y).y\in CʻQ\cap \text{ᗡ}ʻR.Rʻʻ\overleftarrow{Q}_{*}ʻy\subset \overrightarrow{P}_{\text{po}}ʻz:\\ [*230·11] &\supset :RQ_{\text{cn}}(\overrightarrow{P}_{\text{po}}ʻz) &\qquad \text{(1)}\\ \vdash .(1).*234·1.\supset \vdash .\text{Prop} \end{array}$

*234·17. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset &CʻP.\supset :\\ &x\in \text{sc}(P,Q)ʻR.\equiv .x\in CʻP.P\overline{R} _{\text{sc}}Q\subset \overrightarrow{P}_{*}ʻx\end{align}$

Dem. $\begin{array}{l} \vdash .*234·1·101.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in \text{sc}(P,Q)ʻR.\supset .x\in CʻP.P\overline{R} _{\text{sc}}Q\subset \overrightarrow{P}_{*}ʻx &\qquad \text{(1)}\\ \vdash .*234·161·162·104.\supset \vdash \colon\ldotp \text{Hp}.&\supset :x\in CʻP.P\overline{R} _{\text{sc}}Q\subset \overrightarrow{P}_{*}ʻx.\supset .\\ &x\in \text{sc}(P,Q)ʻR &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·171. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset CʻP.x\in CʻP-&\text{sc}(P,Q)ʻR.\supset .\\ &\overrightarrow{P}_{*}ʻx\subset Pʻʻ(P\overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·17.\supset \vdash :\text{Hp}.\supset .\exists !P\overline{R} _{\text{sc}}Q-\overrightarrow{P}_{*}ʻx &\qquad \text{(1)}\\ \vdash .(1).*211·56.*231·13.\supset \vdash :\text{Hp}.\supset .\overrightarrow{P}_{*}ʻx\subset P_{\text{po}}ʻʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(2)}\\ \vdash .(2).*231·134.\supset \vdash .\text{Prop} \end{array}$

*234·172. $\vdash :P_{\text{po}}\in \text{Ser}.\supset .CʻP-\text{sc}(P,Q)ʻR=CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR$

Dem. $\begin{array}{l} \vdash .*200·5.\supset \vdash :\text{Hp}.&\supset .CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR\subset CʻP-\text{sc}(P,Q)ʻR &\qquad \text{(1)}\\ \vdash .*234·131.\supset\\ \vdash :x\in \text{sc}(P,Q)ʻR.y\in CʻP-\text{sc}(P,Q)ʻR.&\supset .{\sim}(xP_{*}y).x,y\in CʻP.\\ [*202·103] &\supset .yP_{\text{po}}x &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·173. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.\exists !\text{sc}(P,Q)ʻR.\supset .CʻP-\text{sc}(P,Q)ʻR=pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR\\ &[*234·172.*40·61.*37·15]\end{align}$

*234·174. $\begin{align}\vdash :P_{\text{po}}\in &\text{Ser}.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset .\\ &CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR=P ʻʻ(P \overline{R} _{\text{sc}}Q)=CʻP-\text{sc}(P,Q)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*234·171·172.\supset \vdash :\text{Hp}.&\supset .P_{*}ʻʻ{CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR}\subset Pʻʻ(P \overline{R} _{\text{sc}}Q).\\ [*90·21] &\supset .CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR\subset Pʻʻ(P \overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash .*234·16.*37·2.\supset \vdash :\text{Hp}.\supset .Pʻʻ(P \overline{R} _{\text{sc}}Q)&\subset Pʻʻpʻ\overrightarrow{P}_{*}ʻʻ\text{sc}(P,Q)ʻR\\ [*40·37.*91·52] & \subset pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(2)}\\ \vdash .*37·15. &\supset \vdash .Pʻʻ(P\overline{R} _{\text{sc}}Q)\subset \text{D}ʻP. &\qquad \text{(3)}\\ \vdash .(1).(2).(3).*234·172.\supset \vdash .\text{Prop} \end{array}$

*234·175. $\begin{align}&\vdash :\text{Hp}*234·174.\exists !\text{sc}(P,Q)ʻR.\supset .pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR=Pʻʻ(P \overline{R} _{\text{sc}}Q)\\ &[*234·174.*40·61.*37·15]\end{align}$

*234·18. $\begin{align}\vdash :&P_{\text{po}}\in \text{Ser}.Q_{*}\in \text{connex} .RʻʻCʻQ\subset CʻP.\supset .\\ &CʻP=\text{sc}(P,Q)ʻR\cup Pʻʻ(P\overline{R} _{\text{sc}}Q).\text{sc}(P,Q)ʻR\cap Pʻʻ(P\overline{R} _{\text{sc}}Q)=\Lambda .\\ &\text{sc}(P,Q)ʻR=CʻP-Pʻʻ(P\overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·174.*24·411.&\supset \vdash :\text{Hp}.\supset .CʻP=\text{sc}(P,Q)ʻR\cup Pʻʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash .*234·174. \supset \vdash :\text{Hp}.&\supset .Pʻʻ(P\overline{R} _{\text{sc}}Q)\subset pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q)ʻR.\\ [*200·5] &\supset .\text{sc}(P,Q)ʻR\cap Pʻʻ(P\overline{R} _{\text{sc}}Q)=\Lambda &\qquad \text{(2)}\\ \vdash .*24·492.*234·174.&\supset \vdash :\text{Hp}.\supset .\text{sc}(P,Q)ʻR=CʻP-Pʻʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

In virtue of this proposition, $Pʻʻ(P\overline{R} _{\text{sc}}Q)$ and $\text{sc}(P,Q)ʻR$ are complementary sections of $P$ , i.e. they constitute a Dedekind cut in $P$ .

*234·181. $\begin{align}\vdash :P_{\text{po}}\in \text{Ser}.Q_{*}\in &\text{connex} .RʻʻCʻQ\subset CʻP.\supset .\\ &P\overline{R} _{\text{sc}}Q\cap \text{sc}(P,Q)ʻR=\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q).\\ &\text{sc}(P,Q)ʻR=(CʻP-P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·18.\supset \vdash :\text{Hp}.\supset .P\overline{R} _{\text{sc}}Q\cap \text{sc}(P,Q)ʻR&=P\overline{R} _{\text{sc}}Q-Pʻʻ(P\overline{R} _{\text{sc}}Q)\\ [*205·111] &=\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash .*24·412.*231·13.\supset \\ \vdash :\text{Hp}.\supset .CʻP-Pʻʻ(P\overline{R} _{\text{sc}}Q)&=\{CʻP-(P\overline{R} _{\text{sc}}Q)\}\cup \{(P\overline{R} _{\text{sc}}Q)-Pʻʻ(P\overline{R} _{\text{sc}}Q)\}.\\ [*234·18.*205·111] \supset .\text{sc}(P,Q)ʻR&=(CʻP-P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·182. $\begin{align}\vdash :P\in \text{Ser}.Q_{*}\in \text{connex} .RʻʻCʻQ&\subset CʻP.\supset .\\ &\overrightarrow{\text{limax}} _{P}ʻ(P\overline{R} _{\text{sc}}Q)=\overrightarrow{\text{min}}_{P}ʻ\text{sc}(P,Q)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*207·51.\supset \vdash \colon\ldotp \text{Hp}.\supset :x&=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\equiv .x\in CʻP.\overrightarrow{P}ʻx=Pʻʻ(P\overline{R} _{\text{sc}}Q).\\ [*234·174] &\equiv .x\in CʻP.\overrightarrow{P}ʻx=CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(1)}\\ \vdash .*200·52.\supset \\ \vdash :\text{Hp}.x\in CʻP.\overrightarrow{P}ʻx&=CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\supset .CʻP\neq CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\\ [*40·2.\text{Transp}]\supset .\exists !\text{sc}(P,Q)ʻR.\\ [*40·62] \supset .CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR&=pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\\ [*13·12] \supset .\overrightarrow{P}ʻx&=pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(2)}\\ \vdash .*22·621.\supset \\ \vdash :\overrightarrow{P}ʻx&=pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\supset .\overrightarrow{P}ʻx=CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(3)}\\ \vdash .(2).(3).\supset \vdash \colon\ldotp \text{Hp}.x\in CʻP.\supset :\\ \overrightarrow{P}ʻx&=CʻP\cap pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\equiv .\overrightarrow{P}ʻx=pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR &\qquad \text{(4)}\\ \vdash .(1).(4).\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :x&=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\equiv .x\in CʻP.\overrightarrow{P}ʻx=pʻ\overrightarrow{P}ʻʻ\text{sc}(P,Q)ʻR.\\ [*205·67] &\equiv .x=\text{min}_{P}ʻ\text{sc}(P,Q)ʻR\colon\ldotp \supset \vdash .\text{Prop} \end{array}$

*234·183. $\begin{align}&\vdash :\text{Hp}*234·18.\text{sc}(P,Q)ʻR=\Lambda .\supset .P\overline{R} _{\text{sc}}Q=CʻP.{\sim}\text{E}!Bʻ\breve{P}\\ &[*234·181·121]\end{align}$

*234·2. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset CʻP.Q_{*}\in \text{connex} .\supset .\\ \quad\quad\quad\text{os}(P,Q)ʻR=&\{\overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)-P\overline{R} _{\text{sc}}Q\}\cup \{\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)-\breve{P} \overline{R} _{\text{sc}}Q\}\cup \\ &\{\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cap \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\}\end{align}$

Dem. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.RʻʻCʻQ\subset CʻP.Q_{*}\in \text{connex} .\supset .\\ \quad\quad\quad\text{os}(P,Q)ʻR=&\{\overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)-P\overline{R} _{\text{sc}}Q\}\cup \{\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)-\breve{P} \overline{R} _{\text{sc}}Q\}\cup \\ &\{\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cap \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\}\end{align}$

*234·201. $\begin{align}&\vdash :\text{Hp}*234·2.\supset .\text{os}(P,Q)ʻR\subset \overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &[*234·2]\end{align}$

*234·202. $\begin{align}&\vdash :\text{Hp}*234·2.\supset .\text{os}(P,Q)ʻR\in 0\cup 1\cup 2\\ &[*234·201.*205·681.*60·391]\end{align}$

*234·203. $\begin{align}&\vdash :\text{Hp}*234·2.P\overline{R} _{\text{os}}Q\in 1.\supset .\\ &\text{os}(P,Q)ʻP\in 1.\text{os}(P,Q)ʻR = \iota ʻ\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)=\iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)=P\overline{R} _{\text{os}}Q\\ &[*231·193·103.*205·68.*234·2]\end{align}$

*234·204. $\vdash :P_{\text{po}}\in \text{Ser}.P\overline{R} _{\text{os}}Q{\sim}\in 0\cup 1.\supset .\text{os}(P,Q)ʻR=\Lambda \quad[*234·103]$

*234·21. $\begin{align}\vdash :\text{Hp}*234·2.P\overline{R} _{\text{os}}Q = &\Lambda .\supset .\\ &\text{os}(P,Q)ʻR=\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*205·11·111. \supset\\ \vdash :\text{Hp}.\supset .\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\subset -(\breve{P} \overline{R} _{\text{sc}}Q).\overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\subset -(P\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash .(1).*234·2.\supset \vdash .\text{Prop} \end{array}$

*234·23. $\begin{align}&\vdash \colon\ldotp \text{Hp}*234·2.P\overline{R} _{\text{os}}Q{\sim}\in 1.\text{os}(P,Q)ʻR\in 1.\supset :\\ P\overline{R} _{\text{os}}Q=\Lambda :&\text{os}(P,Q)ʻR=\iota ʻ\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q).{\sim}\text{E}!\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q).\lor.\\ &\text{os}(P,Q)ʻR = \iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q).{\sim}\text{E}!\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·103.\supset \vdash :\text{Hp}.&\supset .P\overline{R} _{\text{sc}}Q=\Lambda &\qquad \text{(1)}\\ [*234·21] &\supset .\text{os}(P,Q)ʻR=\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q) &\qquad \text{(2)}\\ \vdash .*52·41.\supset \vdash :P\overline{R} _{\text{os}}Q=\Lambda .&\text{E}!\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q).\text{E}!\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q).\supset .\\ &\{\overrightarrow{\text{max}}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup \overrightarrow{\text{min}}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\}{\sim}\in 1 &\qquad \text{(3)}\\ \vdash.(1).(2).(3).\text{Transp}.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :{\sim}&\text{E}!\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q).\lor.{\sim}\text{E}!\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q) &\qquad \text{(4)}\\ \vdash .(2).*205·681.\supset \vdash \colon\ldotp \text{Hp}.\supset :&\text{E}!\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q).\lor.\text{E}!\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q) &\qquad \text{(5)}\\ \vdash .(1).(2).(4).(5).\supset \vdash .\text{Prop} \end{array}$

*234·24. $\begin{align}&\vdash \colon\ldotp P \in \text{Ser}. Q_{*} \in \text{connex} . RʻʻCʻQ \subset CʻP . \supset :\\ &\text{os}(P,Q)ʻR \in 1 . \supset . \text{os}(P,Q)ʻR = \iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) = \iota ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash . *234·203 . *207·42 . \supset \\ \vdash : \text{Hp} . P\overline{R} _{\text{os}}Q \in 1 . &\supset . \text{os}(P,Q)ʻR = \iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) = \iota ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash . *234·23 . *211·728 . *207·42 . \supset \\ \vdash : \text{Hp}.P\overline{R} _{\text{os}}Q{\sim}\in 1 . &\supset .\text{os}(P,Q)ʻR = \iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) = \iota ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q) &\qquad \text{(2)}\\ \vdash . (1). (2). \supset \vdash . \text{Prop} \end{array}$

*234·241. $\vdash : \text{Hp} *234·2 . \text{os}(P,Q)ʻR \in 2. \supset . P\overline{R} _{\text{os}}Q = \Lambda$

Dem. $\begin{array}{l} \vdash . *234·103. &\supset \vdash : \text{Hp}.\supset . P\overline{R} _{\text{os}}Q \in 0\cup 1 &\qquad \text{(1)}\\ \vdash . *234·203. \text{Transp}. &\supset \vdash : \text{Hp}. \supset . P\overline{R} _{\text{os}}Q{\sim}\in 1 &\qquad \text{(2)}\\ \vdash . (1). (2). \supset \vdash . \text{Prop} \end{array}$

*234·242. $\begin{align}&\vdash : \text{Hp} *234·2. \text{os}(P,Q)ʻR \in 2. \supset .\\ &\text{os}(P,Q)ʻR = \iota ʻ\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\cup \iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q) . \text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)P_{1} \text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash . *234·201. *205·3. \supset \vdash : \text{Hp}. \supset . \text{E}! &\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q). \text{E}! \text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q).\\ &\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q) \neq \text{min}_{P}ʻ(\breve{P}\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash . *234·241·15. \supset \vdash : \text{Hp}. &\supset . \breve{P} \overline{R} _{\text{sc}}Q = CʻP - P\overline{R} _{\text{sc}}Q.\\ [*211·8.(1)] &\supset . \text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q) = \text{max}(P_{\text{po}})ʻ(P\overline{R} _{\text{sc}}Q).\\ &\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q) =\text{seq}(P_{\text{po}})ʻ(P\overline{R} _{\text{sc}}Q).\\ [*206·5.*201·63] &\supset . \{\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\} (P_{\text{po}})_{1} \{\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\}.\\ [*121·254] &\supset . \{\text{max}_{P}ʻ(P\overline{R} _{\text{sc}}Q)\} P_{1} \{\text{min}_{P}ʻ(\breve{P} \overline{R} _{\text{sc}}Q)\} &\qquad \text{(2)}\\ \vdash . (1). (2). *234·201. \supset \vdash . \text{Prop} \end{array}$

*234·243. $\begin{align}\vdash : \text{Hp} *234·24 . \exists ! &\text{os}(P,Q)ʻR. \supset .\\ &\text{E}! \text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q). \text{E}! \text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\end{align}$

Dem. $\begin{array}{l} \vdash . *234·202. \supset \vdash :\text{Hp}. \supset . \text{os}(P,Q)ʻP \in 1 \cup 2 &\qquad \text{(1)}\\ \vdash . (1). *234·24·242. \supset \vdash . \text{Prop} \end{array}$

*234·244. $\vdash : \text{Hp} *234·2 . P^{2} = P. \supset . \text{os}(P,Q)ʻR \in 0 \cup 1$

Dem. $\begin{array}{l} \vdash . *234·242·202. \supset \vdash : \text{Hp} *234·2 . \text{os}(P,Q)ʻR {\sim} \in 0 \cup 1 . \supset . \dot{\exists} ! P_{1} &\qquad \text{(1)}\\ \vdash .(1).\text{Transp}. *201·65. \supset \vdash . \text{Prop} \end{array}$

*234·25. $\begin{align}\vdash : \text{Hp} *234·2. P^{2} &= P. \exists ! \text{os}(P,Q)ʻR . \supset .\\ &\text{os}(P,Q)ʻR = \iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) = \iota ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q) &[*234·244·24]\end{align}$

*234·251. $\begin{align}&\vdash :\text{Hp}*234·24.\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q).\supset .\\ &\text{os}(P,Q)ʻR=\iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\iota ʻ\text{min}_{P}ʻ\text{sc}(P,Q)ʻR=\iota ʻ\text{max}_{P}ʻ\text{sc}(\breve{P} ,Q)ʻR\end{align}$

Dem. $\begin{array}{l} \vdash .*234·18.*207·51.\supset \\ \vdash :\text{Hp}.\supset .\text{sc}(P,Q)ʻR&=CʻP-\overrightarrow{P}ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\\ \text{sc}(\breve{P} ,Q)ʻR&=CʻP-\overleftarrow{P}ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q).\\ [\text{Hp}.*202·101] \supset .\text{os}(P,Q)ʻR&=CʻP\cap \iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\\ [*51·31] &=\iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ [*234·182] &=\iota ʻ\text{min}_{P}ʻ\text{sc}(P,Q)ʻR &\qquad \text{(2)}\\ \left[(2) \frac{\breve{P}}{P}\right] & =\iota ʻ\text{max}_{P}ʻ\text{sc}(\breve{P},Q)ʻR &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*234·26. $\begin{align}\vdash \colon\ldotp \text{Hp}*234·2.P^{2}&=P.\supset :\\ \exists !\text{os}(P,Q)ʻR.&\equiv .\text{os}(P,Q)ʻR=\iota ʻ\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q).\\ &\equiv .\text{os}(P,Q)ʻR=\iota ʻ\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q).\\ &\equiv .\text{os}(P,Q)ʻR=\iota ʻ\text{min}_{P}ʻ\text{sc}(PQ)ʻR.\\ &\equiv .\text{os}(P,Q)ʻR=\iota ʻ\text{max}_{P}ʻ\text{sc}(\breve{P} Q)ʻR.\\ &\equiv .\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &[*234·25·251·182.*51·161]\end{align}$

*234·27. $\vdash :\text{Hp}*234·24.x\in \text{os}(P,Q)ʻR-\text{ᗡ}ʻP_{1}.\supset .x=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)$

Dem. $\begin{array}{l} \vdash .*234·24. &\supset \vdash :\text{Hp}.\text{os}(P,Q)ʻR\in 1.\supset .x=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(1)}\\ \vdash .*234·242. &\supset \vdash :\text{Hp}.\text{os}(P,Q)ʻR\in 2.\supset .x=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q) &\qquad \text{(2)}\\ \vdash .*234·202. &\supset \vdash :\text{Hp}.\supset .\text{os}(P,Q)ʻR\in 1\cup 2 &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*234·271. $\begin{align}&\vdash :\text{Hp}.234·24.x\in \text{os}(P,Q)ʻR-\text{D}ʻP_{1}.\supset .x=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q)\\ &\left[*234·27 \frac{\breve{P}}{P}\right]\end{align}$

*234·272. $\begin{align}\vdash :\text{Hp}.*234·24.&x\in \text{os}(P,Q)ʻR-CʻP_{1}.\supset .\\ &x=\text{limax}_Pʻ(P\overline{R} _{\text{sc}}Q)=\text{limin}_Pʻ(\breve{P} \overline{R} _{\text{sc}}Q) \quad[*234·27·271]\end{align}$

The remaining propositions of the present number are for the most part immediate consequences of those already proved. In order to obtain, from propositions already proved, propositions concerning the limit of a function as the argument approaches the limit of some class of arguments $\alpha$ , we only have to substitute $Q_{*}\unicode{x0294f}\alpha$ for $Q$ . In order to obtain the limit of a function as the argument approaches a given term $a$ , we take $Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa$ in place of $Q$ .

*234·3. $\begin{align}&\vdash \colon\ldotp x\in \text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR.\equiv :\\ &x\in CʻP:xP_{\text{po}}w.\supset _{w}.(\exists y).y\in \alpha \cap CʻQ\cap \text{ᗡ}ʻR.Rʻʻ(\alpha \cap \overrightarrow{Q}_{*}ʻy)\subset \overrightarrow{P}_{\text{po}}ʻw\\ &[*234·1]\end{align}$

*234·301. $\begin{align}\vdash \colon\colon Q_{*}\unicode{x0294f}\alpha \in &\text{connex} .\supset \colon\ldotp x\in \text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :\\ &x\in \text{D}ʻP\cap \text{ᗡ}ʻP:x\in P(z-w).\supset _{z,w}.\\ &(\exists y).y\in \alpha \cap CʻQ\cap \text{ᗡ}ʻR.Rʻʻ(\alpha \cap \overleftarrow{Q}_{*}ʻy)\subset P(z-w)\\ [*234·12]\end{align}$

*234·31. $\begin{align}&\vdash :P_{\text{po}}\in \text{Ser}.Q_{*}\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\supset .\\ &CʻP-\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=CʻP\cap pʻ\overrightarrow{P}_{\text{po}}ʻʻ\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \\ &[*234·174]\end{align}$

*234·311. $\begin{align}\vdash :\text{Hp}*234·31.\supset .CʻP=&\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\cup Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ &\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\cap Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\Lambda .\\ &\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=CʻP-Pʻʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha\\ &[*234·18]\end{align}$

*234·312. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.Q_{*}&\unicode{x0294f}\alpha \in \text{connex} .Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\supset :\\ &\text{E}!(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\equiv .\text{E}!\text{min}_{P}ʻ\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR.\\ &\equiv .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\text{min}_{P}ʻ\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\\ &[*234·182]\end{align}$

*234·32. $\begin{align}&\vdash \colon\ldotp P_{\text{po}}\in \text{Ser}.Q_{*}\unicode{x0294f}\alpha \in \text{connex}.Rʻʻ(\alpha\cap CʻQ)\subset CʻP.\supset:(P\overline{R} Q)_{\text{os}}ʻ\alpha \in 1.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=(P\overline{R} Q)_{\text{os}}ʻ\alpha =\iota ʻ\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha =\iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha\\ &[*234·203]\end{align}$

*234·321. $\begin{align}&\vdash \colon\colon\text{Hp}*234·32.\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\in 1.\supset \colon\ldotp (P\overline{R} Q)_{\text{os}}ʻ\alpha {\sim}\in 1.\supset :\\ (P\overline{R} Q)_{\text{os}}ʻ\alpha =&\Lambda :\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha .{\sim}\text{E}!\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha .\\ &\lor.\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha .{\sim}\text{E}!\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha\\ &[*234·23]\end{align}$

*234·322. $\begin{align}&\vdash :\text{Hp}.*234·312.\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\in 1.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\iota ʻ(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*234·24]\end{align}$

*234·329. $\begin{align}&\vdash :\text{Hp}*234·32.\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR\in 2.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}}ʻ\alpha \cup \iota ʻ\text{min}_{P}ʻ(\breve{P}\overline{R} Q)_{\text{sc}}ʻ\alpha .\\ &\{\text{max}_{P}ʻ(P\overline{R} Q)_{\text{sc}\}ʻ\alpha }P_{1}\{\text{min}_{P}ʻ(\breve{P} \overline{R} Q)_{\text{sc}}ʻ\alpha\}\\ &[*234·242]\end{align}$

*234·33. $\begin{align}\vdash :\text{Hp}&*234·32.P^{2}=P.\exists !\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\iota ʻ(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*234·25]\end{align}$

*234·331. $\begin{align}&\vdash : \text{Hp}*234·312.(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha .\supset .\\ \text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR&=\iota ʻ(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =\iota ʻ(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &=\iota ʻ\text{min}_{P}ʻ\text{sc}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ\text{max}_{P}ʻ\text{sc}(\breve{P} ,Q_{*}\unicode{x0294f}\alpha )ʻR\\ &[*234·251]\end{align}$

*234·34. $\begin{align}&\vdash \colon\ldotp \text{Hp}*234·32.P^{2}=P.\supset :\\ \exists !\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR.&\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ(P\overline{R} Q)_{\text{lmx}}ʻ\alpha .\\ &\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR=\iota ʻ(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha .\\ &\equiv .(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &[*234·26]\end{align}$

*234·35. $\begin{align}&\vdash :\text{Hp}*234·312.x\in \text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR-\text{ᗡ}ʻP_{1}.\supset .x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha\\ &[*234·27]\end{align}$

*234·351. $\begin{align}&\vdash :\text{Hp}*234·312.x\in \text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR-\text{D}ʻP_{1}.\supset.x=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \\ &\left[*234·35 \frac{\breve{P}}{P}\right]\end{align}$

*234·352. $\begin{align}\vdash :\text{Hp}*234·312.x\in &\text{os}(P,Q_{*}\unicode{x0294f}\alpha )ʻR-CʻP_{1}.\supset .\\ &x=(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*234·35·351]\end{align}$

*234·4. $\begin{align}&\vdash \colon\ldotp x\in \text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR.\equiv :\\ &x\in CʻP:xP_{\text{po}}w.\supset _{w}.(\exists y).y\in \overrightarrow{Q}_{\text{po}}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\unicode{x27dd} a)\subset \overrightarrow{P}_{\text{po}}ʻw\\ &[*234·3.(*121·012)]\end{align}$

*234·41. $\begin{align}&\vdash \colon\colon Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .\supset \colon\ldotp \\ &x\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR\cap \text{D}ʻP\cap \text{ᗡ}ʻP.\equiv :x\in \text{D}ʻP\cap \text{ᗡ}ʻP:\\ &x\in P(z-w).\supset _{z,w}.(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\unicode{x27dd} a)\subset P(z-w)\\ &[*234·301.(*121·012).*201·18]\end{align}$

*234·42. $\begin{align}\vdash \colon\ldotp P\in \text{Ser}.Q\in &\text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\supset :\\ &\overrightarrow{R(PQ)}ʻa=\overrightarrow{\text{min}}_{P}ʻ\text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR \quad[*234·182]\end{align}$

*234·421. $\begin{align}\vdash \colon\ldotp P_{\text{po}}\in &\text{Ser}.Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\supset :\\ &\text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\Lambda .\supset .\overrightarrow{R(PQ)}ʻa=\overrightarrow{B}ʻ\breve{P} \quad[*234·183]\end{align}$

*234·422. $\begin{align}&\vdash :\text{Hp}*234·42.P\in \text{Ded}.\supset .R(PQ)ʻa=\text{limin}_Pʻ\text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR\\ &[*233·13.*234·42]\end{align}$

*234·43. $\begin{align}\vdash :\text{Hp}*234·42.&\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR\in 1.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)=\iota ʻR(PQ)ʻa= \iota ʻR(\breve{P} Q)ʻa \quad[*234·322]\end{align}$

*234·439. $\begin{align}\vdash :\text{Hp}&*234·421.\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR\in 2.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(PQ)ʻa\cup \iota ʻR(\breve{P} Q)ʻa.\\ &\{R(PQ)ʻa\}P_{1}\{R(\breve{P} Q)ʻa\} \quad[*234·329]\end{align}$

*234·44. $\begin{align}\vdash :\text{Hp}&*234·421.P^{2}=P.\exists !\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(PQ)ʻa=\iota ʻR(\breve{P} Q)ʻa \quad[*234·33]\end{align}$

*234·441. $\begin{align}\vdash :\text{Hp}*234·42.&R(PQ)ʻa=R(\breve{P} Q)ʻa.\supset .\\ &\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)=\iota ʻR(PQ)ʻa=\iota ʻR(\breve{P} Q)ʻa \quad[*234·331]\end{align}$

*234·45. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.P^{2}=P.\supset :\\ \exists !\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR.&\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(PQ)ʻa.\\ &\equiv .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻR(\breve{P} Q)ʻa.\\ &\equiv .R(PQ)ʻa=R(\breve{P} Q)ʻa \quad[*234·34]\end{align}$

*234·46. $\begin{align}&\vdash :\text{Hp}*234·42.x\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR-\text{ᗡ}ʻP_1.\supset .x=R(PQ)ʻa\\ &[*234·35]\end{align}$

*234·461. $\begin{align}&\vdash :\text{Hp}*234·42.x\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR-\text{D}ʻP_1.\supset .x=R(\breve{P} Q)ʻa\\ &\left[*234·46 \frac{\breve{P}}{P}\right]\end{align}$

*234·462. $\begin{align}\vdash :\text{Hp}*234·42.x\in &\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR-CʻP_1.\supset .\\ &x=R(PQ)ʻa=R(\breve{P} Q)ʻa \quad[*234·46·461]\end{align}$

*234·5. $\vdash :a\in \text{ct}(PQ)ʻR.\equiv .Rʻa\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR-CʻP_1 \quad[(*234·03)]$

*234·51. $\begin{align}&\vdash \colon\colon Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP.\supset \colon\ldotp \\ &a\in \text{ct}(PQ)ʻR.\equiv :Rʻa{\sim}\in CʻP_1:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\vdash\dashv a)\subset P(z-w)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·5·4.*53·31.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp a\in \text{ct}(PQ)ʻR.\equiv :Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP-CʻP_1:Rʻa\in P(z-w).\supset _{z,w}.\\ (\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\unicode{x27dd} a)\subset P(z-w).Rʻʻ\iota ʻa\subset P(z-w) &\qquad \text{(1)}\\ \vdash .(1).*121·242.\supset \vdash .\text{Prop} \end{array}$

*234·52. $\begin{align}\vdash \colon\ldotp P\in &\text{Ser}.Q\in \text{trans}.Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa\in \text{connex} .Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\supset :\\ &a\in \text{ct}(PQ)ʻR.\supset .R(PQ)ʻa=R(\breve{P} Q)ʻa=Rʻa \quad[*234·462·5]\end{align}$

*234·521. $\begin{align}&\vdash :\text{Hp}*234·52.a\in \text{ct}(PQ)ʻR.\supset .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)=\iota ʻRʻa\\ &[*234·441·52]\end{align}$

*234·522. $\begin{align}\vdash \colon\ldotp \text{Hp}*234·52.P^{2}=&P.\supset :\\ &a\in \text{ct}(PQ)ʻR.\equiv .R(PQ)ʻa=R(\breve{P} Q)ʻa=Rʻa\end{align}$

Dem. $\begin{array}{l} \vdash .*234·45.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :R(PQ)ʻa=R(\breve{P} Q)ʻa=Rʻa.&\supset .\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR=\iota ʻRʻa.\\ [*234·5.*201·65] &\supset .a\in \text{ct}(PQ)ʻR &\qquad \text{(1)}\\ \vdash .(1).*234·52.\supset \vdash .\text{Prop} \end{array}$

*234·53. $\begin{align}\vdash \colon\colon P_{\text{po}}&\in \text{connex} .Q\in \text{trans}.Rʻa=BʻP.\supset \colon\ldotp \\ a\in \text{ct}(PQ)ʻR.&\equiv :BʻP{\sim}\in \text{D}ʻP_{1}:w\in \text{ᗡ}ʻP.\supset _{w}.\\ &(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\vdash\dashv a)\subset \overrightarrow{P}_{\text{po}}ʻw\end{align}$

Dem. $\begin{array}{l} \vdash .*234·122.*53·31.*234·5.\supset \\ \vdash \colon\colon\text{Hp}.\supset \colon\ldotp a\in \text{ct}(PQ)ʻR.&\equiv :BʻP{\sim}\in \text{D}ʻP_{1}:(BʻP)P_{\text{po}}w.\supset _{w}.\\ &(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.Rʻʻ(\overleftarrow{Q}_{*}ʻy\cap \overrightarrow{Q}ʻa)\subset \overrightarrow{P}_{\text{po}}ʻw.Rʻʻ\iota ʻa\subset \overrightarrow{P}_{\text{po}}ʻw:\\ [*202·522.*205·253.*201·18]&\equiv :BʻP{\sim}\in \text{D}ʻP_{1}:\\ &w\in \text{ᗡ}ʻP.\supset _{w}.(\exists y).y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.RʻʻQ(y\vdash\dashv a)\subset \overrightarrow{P}_{\text{po}}ʻw\colon\colon\supset \vdash .\text{Prop} \end{array}$

*234·54. $\vdash :a\in \text{ct}(PQ)ʻR.\supset .a\in \text{ᗡ}ʻR\cap \breve{Q} _{\text{po}}ʻʻ\text{ᗡ}ʻR.Rʻa\in CʻP$

Dem. $\begin{array}{l} \vdash .*234·5·1.(*234·02).&\supset \vdash :\text{Hp}.\supset .Rʻa\in CʻP &\qquad \text{(1)}\\ \vdash .(1).*234·5.(*234·02).\supset \\ \vdash \colon\ldotp \text{Hp}.&\supset :\exists !\text{sc}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR\cap \text{D}ʻP.\lor.\exists !\text{sc}(\breve{P} ,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR\cap \text{ᗡ}ʻP:\\ [*234·142]&\supset :\exists !\overrightarrow{Q}_{\text{po}}ʻa\cap \text{ᗡ}ʻR:\\ [*37·46] &\supset :a\in \breve{Q} _{\text{po}}ʻʻ\text{ᗡ}ʻR &\qquad \text{(2)}\\ \vdash .(1).*14·21.*33·43.&\supset \vdash :\text{Hp}.\supset .a\in \text{ᗡ}ʻR &\qquad \text{(3)}\\ \vdash .(1).(2).(3).\supset \vdash .\text{Prop} \end{array}$

*234·55. $\vdash .{\sim}\{\text{min}(Q_{\text{po}})ʻ\text{ᗡ}ʻR\in \text{ct}(PQ)ʻR\} \quad[*234·54.\text{Transp}]$

*234·56. $\begin{align}&\vdash :\text{Hp}*234·52.a\in \text{ct}(PQ)ʻR.\supset .\\ &(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1.\text{E}!R(PQ)ʻa.R(PQ)ʻa{\sim}\in CʻP_{1}.Rʻa=R(PQ)ʻa\end{align}$

Dem. $\begin{array}{l} \vdash .*234·5. \supset \vdash :\text{Hp}.&\supset .\exists !\text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}ʻa)ʻR.Rʻa{\sim}\in CʻP_{1} .\\ [*234·103] &\supset .(P\overline{R} Q)_{\text{os}}ʻ\overrightarrow{Q}ʻa\in 0\cup 1.Rʻa{\sim}\in CʻP_{1} &\qquad \text{(1)}\\ \vdash .*234·52.\supset \vdash :\text{Hp}.&\supset .Rʻa=R(PQ)ʻa.\text{E}!R(PQ)ʻa &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

*234·561. $\begin{align}\vdash :P,Q\in \text{Ser}.&a\in \text{ct}(PQ)ʻR.a=\text{lt}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR).Rʻʻ\overrightarrow{Q}ʻa\subset CʻP.\supset .\\ &(P\overline{R}Q)_{\text{lmx}}ʻ\alpha =Rʻa=(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha \quad[*233·515.*234·56]\end{align}$

*234·562. $\begin{align}\vdash :P,Q\in &\text{Ser}.\text{lt}_{Q}ʻ(\alpha \cap \text{ᗡ}ʻR)\in \text{ct}(PQ)ʻR.Rʻʻ(\alpha \cap CʻQ)\subset CʻP.\supset .\\ &(P\overline{R} Q)_{\text{lmx}}ʻ\alpha =(\breve{P} \overline{R} Q)_{\text{lmx}}ʻ\alpha =Rʻ\text{lt}_{Q}ʻ\alpha \quad[*233·516.*234·56]\end{align}$

That is, if $\alpha$ is any class of arguments having a limit at which the function is continuous, then the limit of the function, as the argument approaches the limit of the set of arguments, is the value of the function for that limit.

*234·6. $\vdash :a\in \text{contin}(PQ)ʻR.\equiv .a\in \text{ct}(PQ)ʻR\cap \text{ct}(P\breve{Q} )ʻR \quad[(*234·04)]$

*234·61. $\begin{align}&\vdash \colon\colon P_{\text{po}}\in \text{Ser}.Q\in \text{trans}.Q_{*}\unicode{x0294f}\overleftrightarrow{Q}ʻa\in \text{connex} .Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP.\supset \colon\ldotp \\ &a\in \text{contin}(PQ)ʻR.\equiv :Rʻa{\sim}\in CʻP_{1}:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y,y').a\in Q(y-y').y,y'\in \text{ᗡ}ʻR.RʻʻQ(y\vdash\dashv y')\subset P(z-w)\end{align}$

Dem. $\begin{array}{l} \vdash .*234·51.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp a\in &\text{contin}(PQ)ʻR.\equiv :\\ &Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP-CʻP_{1}:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y,y').y\in \overrightarrow{Q}ʻa\cap \text{ᗡ}ʻR.y'\in \overleftarrow{Q}ʻa\cap \text{ᗡ}ʻR.\\ &RʻʻQ(y\vdash\dashv a)\cup RʻʻQ(a\vdash\dashv y')\subset P(z-w) &\qquad \text{(1)}\\ \vdash .(1).*201·19.*202·17.\supset \vdash .\text{Prop} \end{array}$

*234·62. $\begin{align}\vdash \colon\ldotp \text{Hp}*234·61.&P\in \text{trans}.Rʻʻ\overleftrightarrow{Q}ʻa\subset CʻP.\supset :a\in \text{contin}(PQ)ʻR.\supset .\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa=R(P\breve{Q} )ʻa=R(\breve{P} \breve{Q} )ʻa=Rʻa\\ [*234·52·6]\end{align}$

*234·63. $\begin{align}\vdash \colon\ldotp \text{Hp}*234·62.&P^{2}=P.\supset :a\in \text{contin}(PQ)ʻR.\equiv .\\ &R(PQ)ʻa = R(\breve{P} Q)ʻa = R(P\breve{Q} )ʻa = R(\breve{P} \breve{Q} )ʻa = Rʻa\\ [*234·522·6]\end{align}$

*234·64. $\begin{align}&\vdash \colon\colon\text{Hp}*234·62.Rʻa\in \text{D}ʻP\cap \text{ᗡ}ʻP.\supset \colon\ldotp a\in \text{contin}(P,Q)ʻR.\equiv :\\ Rʻa\in CʻP-&CʻP_{1}:Rʻa\in P(z-w).\supset _{z,w}.\\ &(\exists y,y').y,y'\in \text{ᗡ}ʻR.a\in Q(y-y').RʻʻQ(y\vdash\dashv y')\subset P(z-w)\\ &[*234·51·6]\end{align}$

*234·7. $\begin{align}&\vdash :R\in P\,\overline{\text{contin}}\,Q.\equiv .\exists !CʻQ\cap \text{ᗡ}ʻR.CʻQ\cap \text{ᗡ}ʻR\subset \text{contin}(PQ)ʻR\\ &[(*234·04)]\end{align}$

*234·71. $\vdash :R\in P\,\overline{\text{contin}}\,Q.\supset .R\upharpoonright CʻQ\in 1\rightarrow \text{Cls}.RʻʻCʻQ\subset CʻP$

Dem. $\begin{array}{l} \vdash .*234·7·6·5.\supset \\ \vdash \colon\ldotp \text{Hp}.\supset :a\in CʻQ\cap \text{ᗡ}ʻR.&\supset .Rʻa\in \text{os}(P,Q_{*}\unicode{x0294f}\overrightarrow{Q}_{\text{po}}ʻa)ʻR.\\ [*234·1] &\supset .Rʻa\in CʻP. &\qquad \text{(1)}\\ [*14·21] &\supset .\text{E}!Rʻa &\qquad \text{(2)}\\ \vdash .(2).*71·572. \supset \vdash :\text{Hp}.&\supset .R\upharpoonright CʻQ\in 1\rightarrow \text{Cls} &\qquad \text{(3)}\\ \vdash .(1).(2).*37·61.&\supset \vdash :\text{Hp}.\supset .Rʻʻ(CʻQ\cap \text{ᗡ}ʻR)\subset CʻP &\qquad \text{(4)}\\ \vdash .(3).(4).*37·26.&\supset \vdash .\text{Prop} \end{array}$

*234·72. $\begin{align}&\vdash \colon\ldotp P\in \text{Ser}.Q\in \text{trans}\cap \text{connex} .R\in P\,\overline{\text{contin}}\,Q.\supset :\\ &a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a}.R(PQ)ʻa=R(\breve{P} Q)ʻa=R(P\breve{Q})ʻa=R(\breve{P} \breve{Q} )ʻa=Rʻa\\ &[*234·62·7]\end{align}$

*234·73. $\begin{align}\vdash \colon\colon P\in \text{Ser}.&P^{2}=P.Q\in \text{trans}\cap \text{connex} .\supset \colon\ldotp \\ &R\in P\,\overline{\text{contin}}\,Q.\equiv :\exists !CʻQ\cap \text{ᗡ}ʻR:a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a} .\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa=R(P\breve{Q} )ʻa=R(\breve{P} \breve{Q} )ʻa=Rʻa\end{align}$

Dem. $\begin{array}{l} \vdash .*234·7·71.\supset \vdash \colon\colon\text{Hp}.\supset \colon\ldotp R\in P&\overline{\text{contin}} Q.\equiv :\exists !CʻQ\cap \text{ᗡ}ʻR.RʻʻCʻQ\subset CʻP:\\ &a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a}.a\in \text{contin}(PQ)ʻR:\\ [*234·63]\equiv :\exists !&CʻQ\cap \text{ᗡ}ʻR.RʻʻCʻQ\subset CʻP:a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a}.\\ &R(PQ)ʻa=R(\breve{P} Q)ʻa=R(P\breve{Q} )ʻa=R(\breve{P} \breve{Q} )ʻa=Rʻa &\qquad \text{(1)}\\ \vdash .*233·401·101.\supset \\ \vdash \colon\ldotp a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a}.R(PQ)ʻa=Rʻa:&\supset :a\in CʻQ\cap \text{ᗡ}ʻR.\supset _{a}.Rʻa\in CʻP:\\ [*37·61·26] &\supset :RʻʻCʻQ\subset CʻP &\qquad \text{(2)}\\ \vdash .(1).(2).\supset \vdash .\text{Prop} \end{array}$

FOOTNOTES:

[17] Theorie der Functionen einer veränderlichen reellen Grösse, Chap. IV. § 30, p. 50.

TRANSCRIBER’S NOTES

All items in the Errata, from all three volumes, have been added and corrected accordingly.

The author's notation as *102·72·73 is an abbreviation for *102·72 and *102·73 respectively.

The lemmas *113·01 (page 302): *120·450 (page 209); *122·436 (page 268) *122·473 and *126·122 (page xxxiii); *124·62 (page 279); *151·45 (page 315); *165·372 (page 387) although they were mentioned by the authors, they have not been described in the corresponding sections.

From Section C, the authors use the lower case “a” as a limit and the Greek letter $\alpha$ as a class.

The alt texts for the illustrations in this book have been created by the Post-Processor.

*** END OF THE PROJECT GUTENBERG EBOOK PRINCIPIA MATHEMATICA, VOL. 2 (OF 3) ***

Updated editions will replace the previous one—the old editions will be renamed.

Creating the works from print editions not protected by U.S. copyright law means that no one owns a United States copyright in these works, so the Foundation (and you!) can copy and distribute it in the United States without permission and without paying copyright royalties. Special rules, set forth in the General Terms of Use part of this license, apply to copying and distributing Project Gutenberg™ electronic works to protect the PROJECT GUTENBERG™ concept and trademark. Project Gutenberg is a registered trademark, and may not be used if you charge for an eBook, except by following the terms of the trademark license, including paying royalties for use of the Project Gutenberg trademark. If you do not charge anything for copies of this eBook, complying with the trademark license is very easy. You may use this eBook for nearly any purpose such as creation of derivative works, reports, performances and research. Project Gutenberg eBooks may be modified and printed and given away—you may do practically ANYTHING in the United States with eBooks not protected by U.S. copyright law. Redistribution is subject to the trademark license, especially commercial redistribution.

START: FULL LICENSE

PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free distribution of electronic works, by using or distributing this work (or any other work associated in any way with the phrase “Project Gutenberg”), you agree to comply with all the terms of the Full Project Gutenberg License available with this file or online at www.gutenberg.org/license.

Section 1. General Terms of Use and Redistributing Project Gutenberg electronic works

1.A. By reading or using any part of this Project Gutenberg electronic work, you indicate that you have read, understand, agree to and accept all the terms of this license and intellectual property (trademark/copyright) agreement. If you do not agree to abide by all the terms of this agreement, you must cease using and return or destroy all copies of Project Gutenberg electronic works in your possession. If you paid a fee for obtaining a copy of or access to a Project Gutenberg electronic work and you do not agree to be bound by the terms of this agreement, you may obtain a refund from the person or entity to whom you paid the fee as set forth in paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be used on or associated in any way with an electronic work by people who agree to be bound by the terms of this agreement. There are a few things that you can do with most Project Gutenberg electronic works even without complying with the full terms of this agreement. See paragraph 1.C below. There are a lot of things you can do with Project Gutenberg electronic works if you follow the terms of this agreement and help preserve free future access to Project Gutenberg electronic works. See paragraph 1.E below.

1.C. The Project Gutenberg Literary Archive Foundation (“the Foundation” or PGLAF), owns a compilation copyright in the collection of Project Gutenberg electronic works. Nearly all the individual works in the collection are in the public domain in the United States. If an individual work is unprotected by copyright law in the United States and you are located in the United States, we do not claim a right to prevent you from copying, distributing, performing, displaying or creating derivative works based on the work as long as all references to Project Gutenberg are removed. Of course, we hope that you will support the Project Gutenberg mission of promoting free access to electronic works by freely sharing Project Gutenberg works in compliance with the terms of this agreement for keeping the Project Gutenberg name associated with the work. You can easily comply with the terms of this agreement by keeping this work in the same format with its attached full Project Gutenberg License when you share it without charge with others.

1.D. The copyright laws of the place where you are located also govern what you can do with this work. Copyright laws in most countries are in a constant state of change. If you are outside the United States, check the laws of your country in addition to the terms of this agreement before downloading, copying, displaying, performing, distributing or creating derivative works based on this work or any other Project Gutenberg work. The Foundation makes no representations concerning the copyright status of any work in any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other immediate access to, the full Project Gutenberg License must appear prominently whenever any copy of a Project Gutenberg work (any work on which the phrase “Project Gutenberg” appears, or with which the phrase “Project Gutenberg” is associated) is accessed, displayed, performed, viewed, copied or distributed:

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg™ License included with this eBook or online at www.gutenberg.org. If you are not located in the United States, you will have to check the laws of the country where you are located before using this eBook.

1.E.2. If an individual Project Gutenberg electronic work is derived from texts not protected by U.S. copyright law (does not contain a notice indicating that it is posted with permission of the copyright holder), the work can be copied and distributed to anyone in the United States without paying any fees or charges. If you are redistributing or providing access to a work with the phrase “Project Gutenberg” associated with or appearing on the work, you must comply either with the requirements of paragraphs 1.E.1 through 1.E.7 or obtain permission for the use of the work and the Project Gutenberg trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg electronic work is posted with the permission of the copyright holder, your use and distribution must comply with both paragraphs 1.E.1 through 1.E.7 and any additional terms imposed by the copyright holder. Additional terms will be linked to the Project Gutenberg License for all works posted with the permission of the copyright holder found at the beginning of this work.

1.E.4. Do not unlink or detach or remove the full Project Gutenberg License terms from this work, or any files containing a part of this work or any other work associated with Project Gutenberg.

1.E.5. Do not copy, display, perform, distribute or redistribute this electronic work, or any part of this electronic work, without prominently displaying the sentence set forth in paragraph 1.E.1 with active links or immediate access to the full terms of the Project Gutenberg License.

1.E.6. You may convert to and distribute this work in any binary, compressed, marked up, nonproprietary or proprietary form, including any word processing or hypertext form. However, if you provide access to or distribute copies of a Project Gutenberg work in a format other than “Plain Vanilla ASCII” or other format used in the official version posted on the official Project Gutenberg website (www.gutenberg.org), you must, at no additional cost, fee or expense to the user, provide a copy, a means of exporting a copy, or a means of obtaining a copy upon request, of the work in its original “Plain Vanilla ASCII” or other form. Any alternate format must include the full Project Gutenberg License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying, performing, copying or distributing any Project Gutenberg works unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or providing access to or distributing Project Gutenberg electronic works provided that:

• You pay a royalty fee of 20% of the gross profits you derive from the use of Project Gutenberg works calculated using the method you already use to calculate your applicable taxes. The fee is owed to the owner of the Project Gutenberg trademark, but he has agreed to donate royalties under this paragraph to the Project Gutenberg Literary Archive Foundation. Royalty payments must be paid within 60 days following each date on which you prepare (or are legally required to prepare) your periodic tax returns. Royalty payments should be clearly marked as such and sent to the Project Gutenberg Literary Archive Foundation at the address specified in Section 4, “Information about donations to the Project Gutenberg Literary Archive Foundation.”
• You provide a full refund of any money paid by a user who notifies you in writing (or by e-mail) within 30 days of receipt that s/he does not agree to the terms of the full Project Gutenberg™ License. You must require such a user to return or destroy all copies of the works possessed in a physical medium and discontinue all use of and all access to other copies of Project Gutenberg™ works.
• You provide, in accordance with paragraph 1.F.3, a full refund of any money paid for a work or a replacement copy, if a defect in the electronic work is discovered and reported to you within 90 days of receipt of the work.
• You comply with all other terms of this agreement for free distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™ electronic work or group of works on different terms than are set forth in this agreement, you must obtain permission in writing from the Project Gutenberg Literary Archive Foundation, the manager of the Project Gutenberg™ trademark. Contact the Foundation as set forth in Section 3 below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend considerable effort to identify, do copyright research on, transcribe and proofread works not protected by U.S. copyright law in creating the Project Gutenberg™ collection. Despite these efforts, Project Gutenberg™ electronic works, and the medium on which they may be stored, may contain “Defects,” such as, but not limited to, incomplete, inaccurate or corrupt data, transcription errors, a copyright or other intellectual property infringement, a defective or damaged disk or other medium, a computer virus, or computer codes that damage or cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except for the “Right of Replacement or Refund” described in paragraph 1.F.3, the Project Gutenberg Literary Archive Foundation, the owner of the Project Gutenberg™ trademark, and any other party distributing a Project Gutenberg™ electronic work under this agreement, disclaim all liability to you for damages, costs and expenses, including legal fees. YOU AGREE THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE FOUNDATION, THE TRADEMARK OWNER, AND ANY DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL, PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you discover a defect in this electronic work within 90 days of receiving it, you can receive a refund of the money (if any) you paid for it by sending a written explanation to the person you received the work from. If you received the work on a physical medium, you must return the medium with your written explanation. The person or entity that provided you with the defective work may elect to provide a replacement copy in lieu of a refund. If you received the work electronically, the person or entity providing it to you may choose to give you a second opportunity to receive the work electronically in lieu of a refund. If the second copy is also defective, you may demand a refund in writing without further opportunities to fix the problem.

1.F.4. Except for the limited right of replacement or refund set forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied warranties or the exclusion or limitation of certain types of damages. If any disclaimer or limitation set forth in this agreement violates the law of the state applicable to this agreement, the agreement shall be interpreted to make the maximum disclaimer or limitation permitted by the applicable state law. The invalidity or unenforceability of any provision of this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the Foundation, the trademark owner, any agent or employee of the Foundation, anyone providing copies of Project Gutenberg™ electronic works in accordance with this agreement, and any volunteers associated with the production, promotion and distribution of Project Gutenberg™ electronic works, harmless from all liability, costs and expenses, including legal fees, that arise directly or indirectly from any of the following which you do or cause to occur: (a) distribution of this or any Project Gutenberg work, (b) alteration, modification, or additions or deletions to any Project Gutenberg work, and (c) any Defect you cause.

Section 2. Information about the Mission of Project Gutenberg

Project Gutenberg is synonymous with the free distribution of electronic works in formats readable by the widest variety of computers including obsolete, old, middle-aged and new computers. It exists because of the efforts of hundreds of volunteers and donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the assistance they need are critical to reaching Project Gutenberg’s goals and ensuring that the Project Gutenberg collection will remain freely available for generations to come. In 2001, the Project Gutenberg Literary Archive Foundation was created to provide a secure and permanent future for Project Gutenberg and future generations. To learn more about the Project Gutenberg Literary Archive Foundation and how your efforts and donations can help, see Sections 3 and 4 and the Foundation information page at www.gutenberg.org.

Section 3. Information about the Project Gutenberg Literary Archive Foundation

The Project Gutenberg Literary Archive Foundation is a non-profit 501(c)(3) educational corporation organized under the laws of the state of Mississippi and granted tax exempt status by the Internal Revenue Service. The Foundation’s EIN or federal tax identification number is 64-6221541. Contributions to the Project Gutenberg Literary Archive Foundation are tax deductible to the full extent permitted by U.S. federal laws and your state’s laws.

The Foundation’s business office is located at 41 Watchung Plaza #516, Montclair NJ 07042, USA, +1 (862) 621-9288. Email contact links and up to date contact information can be found at the Foundation’s website and official page at www.gutenberg.org/contact

Section 4. Information about Donations to the Project Gutenberg Literary Archive Foundation

Project Gutenberg™ depends upon and cannot survive without widespread public support and donations to carry out its mission of increasing the number of public domain and licensed works that can be freely distributed in machine-readable form accessible by the widest array of equipment including outdated equipment. Many small donations ($1 to $5,000) are particularly important to maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws regulating charities and charitable donations in all 50 states of the United States. Compliance requirements are not uniform and it takes a considerable effort, much paperwork and many fees to meet and keep up with these requirements. We do not solicit donations in locations where we have not received written confirmation of compliance. To SEND DONATIONS or determine the status of compliance for any particular state visit www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states where we have not met the solicitation requirements, we know of no prohibition against accepting unsolicited donations from donors in such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot make any statements concerning tax treatment of donations received from outside the United States. U.S. laws alone swamp our small staff.

Please check the Project Gutenberg web pages for current donation methods and addresses. Donations are accepted in a number of other ways including checks, online payments and credit card donations. To donate, please visit: www.gutenberg.org/donate.

Section 5. General Information About Project Gutenberg electronic works

Professor Michael S. Hart was the originator of the Project Gutenberg concept of a library of electronic works that could be freely shared with anyone. For forty years, he produced and distributed Project Gutenberg eBooks with only a loose network of volunteer support.

Project Gutenberg eBooks are often created from several printed editions, all of which are confirmed as not protected by copyright in the U.S. unless a copyright notice is included. Thus, we do not necessarily keep eBooks in compliance with any particular paper edition.

Most people start at our website which has the main PG search facility: www.gutenberg.org.

This website includes information about Project Gutenberg, including how to make donations to the Project Gutenberg Literary Archive Foundation, how to help produce our new eBooks, and how to subscribe to our email newsletter to hear about new eBooks.

	PAGE
PREFATORY STATEMENT OF SYMBOLIC CONVENTIONS	ix
PART III. CARDINAL ARITHMETIC.
Summary of Part III	3
SECTION A. DEFINITION AND LOGICAL PROPERTIES OF CARDINAL NUMBERS	4
*100. Definition and elementary properties of cardinal numbers	13
*101. On 0 and 1 and 2	19
*102. On cardinal numbers of assigned types	24
*103. Homogeneous cardinals	36
*104. Ascending cardinals	42
*105. Descending cardinals	52
*106. Cardinals of relational types	60
SECTION B. ADDITION, MULTIPLICATION AND EXPONENTIATION	66
*110. The arithmetical sum of two classes and of two cardinals	75
*111. Double similarity	88
*112. The arithmetical sum of a class of classes	97
*113. On the arithmetical product of two classes or of two cardinals	105
*114. The arithmetical product of a class of classes	124
*115. Multiplicative classes and arithmetical classes	135
*116. Exponentiation	143
*117. Greater and less	171
General note on cardinal correlators	185
SECTION C. FINITE AND INFINITE	187
*118. Arithmetical substitution and uniform formal numbers	193
*119. Subtraction	201
*120. Inductive cardinals	207
*121. Intervals	233
*122. Progressions	253
*123. $\aleph_{0}$	268
*124. Reflexive classes and cardinals	278
*125. The axiom of infinity	289
*126. On typically indefinite inductive cardinals	293[Pg vi]
PART IV. RELATION-ARITHMETIC.
Summary of Part IV	301
SECTION A. ORDINAL SIMILARITY AND RELATION-NUMBERS	303
*150. Internal transformation of a relation	306
*151. Ordinal similarity	319
*152. Definition and elementary properties of relation-numbers	330
*153. The relation-numbers $0_{r}$ , $2_{r}$ and $1_{s}$	334
*154. Relation-numbers of assigned types	339
*155. Homogeneous relation-numbers	344
SECTION B. ADDITION OF RELATIONS, AND THE PRODUCT OF TWO RELATIONS	347
*160. The sum of two relations	351
*161. Addition of a term to a relation	357
*162. The sum of the relations of a field	362
*163. Relations of mutually exclusive relations	369
*164. Double likeness	376
*165. Relations of relations of couples	386
*166. The product of two relations	396
SECTION C. THE PRINCIPLE OF FIRST DIFFERENCES, AND THE MULTIPLICATION AND EXPONENTIATION OF RELATIONS	403
*170. On the relation of first differences among the sub-classes of a given class	411
*171. The principle of first differences (continued)	423
*172. The product of the relations of a field	428
*173. The product of the relations of a field (continued)	443
*174. The associative law of relational multiplication	447
*176. Exponentiation	458
*177. Propositions connecting $P_{\text{df}}$ with products and powers	471
SECTION D. ARITHMETIC OF RELATION-NUMBERS	473
*180. The sum of two relation-numbers	477
*181. On the addition of unity to a relation-number	482
*182. On separated relations	487
*183. The sum of the relation-numbers of a field	496
*184. The product of two relation-numbers	501
*185. The product of the relation-numbers of a field	505
*186. Powers of relation-numbers	507
PART V. SERIES.
Summary of Part V.	513
SECTION A. GENERAL THEORY OF SERIES	516
*200. Relations contained in diversity	518
*201. Transitive relations	525
*202. Connected relations	533
*204. Elementary properties of series	547
*205. Maximum and minimum points	559
*206. Sequent points	577
*207. Limits	594
*208. The correlation of series	605[Pg vii]
SECTION B. ON SECTIONS, SEGMENTS, STRETCHES, AND DERIVATIVES	612
*210. On series of classes generated by the relation of inclusion	615
*211. On sections and segments	624
*212. The series of segments	651
*213. Sectional relations	668
*214. Dedekindian relations	684
*215. Stretches	691
*216. Derivatives	700
*217. On segments of sums and converses	710
SECTION C. ON CONVERGENCE, AND THE LIMITS OF FUNCTIONS	715
*230. On convergents	720
*231. Limiting sections and ultimate oscillation of a function	727
*232. On the oscillation of a function as the argument approaches a given limit	737
*233. On the limits of functions	745
*234. Continuity of functions	753

The Project Gutenberg eBook of Principia mathematica, vol. 2 (of 3)

PRINCIPIA MATHEMATICA

CONTENTS OF VOLUME II

ADDITIONAL ERRATA TO VOLUME I.

PREFATORY STATEMENT OF SYMBOLIC CONVENTIONS

FOOTNOTES:

PART III. CARDINAL ARITHMETIC.

SECTION A. DEFINITION AND LOGICAL PROPERTIES OF CARDINAL NUMBERS.

FOOTNOTES:

*100. DEFINITION AND ELEMENTARY PROPERTIES OF CARDINAL NUMBERS.

*101. ON 0 AND 1 AND 2.

*102. ON CARDINAL NUMBERS OF ASSIGNED TYPES.

*103. HOMOGENEOUS CARDINALS.

*104. ASCENDING CARDINALS.

*105. DESCENDING CARDINALS.

*106. CARDINALS OF RELATIONAL TYPES.

SECTION B. ADDITION, MULTIPLICATION AND EXPONENTIATION.

*110. THE ARITHMETICAL SUM OF TWO CLASSES AND OF TWO CARDINALS.

*111. DOUBLE SIMILARITY.

*112. THE ARITHMETICAL SUM OF A CLASS OF CLASSES.

*113. ON THE ARITHMETICAL PRODUCT OF TWO CLASSES OR OF TWO CARDINALS.

FOOTNOTES:

*114. THE ARITHMETICAL PRODUCT OF A CLASS OF CLASSES.

*115. MULTIPLICATIVE CLASSES AND ARITHMETICAL CLASSES.

*116. EXPONENTIATION.

*117. GREATER AND LESS.

GENERAL NOTE ON CARDINAL CORRELATORS.

SECTION C. FINITE AND INFINITE.

FOOTNOTES:

*118. ARITHMETICAL SUBSTITUTION AND UNIFORM FORMAL NUMBERS.

*119. SUBTRACTION.

*120. INDUCTIVE CARDINALS.

*121. INTERVALS.

FOOTNOTES:

*122. PROGRESSIONS.

*123. .

*124. REFLEXIVE CLASSES AND CARDINALS.

*125. THE AXIOM OF INFINITY.

*126. ON TYPICALLY INDEFINITE INDUCTIVE CARDINALS.

PART IV. RELATION-ARITHMETIC.

SUMMARY OF PART IV.

FOOTNOTES:

SECTION A. ORDINAL SIMILARITY AND RELATION-NUMBERS.

*150. INTERNAL TRANSFORMATION OF A RELATION.

FOOTNOTES:

*151. ORDINAL SIMILARITY.

*152. DEFINITION AND ELEMENTARY PROPERTIES OF RELATION-NUMBERS.

*153. THE RELATION-NUMBERS , AND .

FOOTNOTES:

*154. RELATION-NUMBERS OF ASSIGNED TYPES.

*155. HOMOGENEOUS RELATION-NUMBERS.

FOOTNOTES:

SECTION B. ADDITION OF RELATIONS, AND THE PRODUCT OF TWO RELATIONS.

*160. THE SUM OF TWO RELATIONS.

*161. ADDITION OF A TERM TO A RELATION.

*162. THE SUM OF THE RELATIONS OF A FIELD.

*163. RELATIONS OF MUTUALLY EXCLUSIVE RELATIONS.

*164. DOUBLE LIKENESS.

*165. RELATIONS OF RELATIONS OF COUPLES.

*166. THE PRODUCT OF TWO RELATIONS.

SECTION C. THE PRINCIPLE OF FIRST DIFFERENCES, AND THE MULTIPLICATION AND EXPONENTIATION OF RELATIONS.

FOOTNOTES:

*170. ON THE RELATION OF FIRST DIFFERENCES AMONG THE SUB-CLASSES OF A GIVEN CLASS.

*171. THE PRINCIPLE OF FIRST DIFFERENCES (continued).

*172. THE PRODUCT OF THE RELATIONS OF A FIELD.

*173. THE PRODUCT OF THE RELATIONS OF A FIELD (continued).

*174. THE ASSOCIATIVE LAW OF RELATIONAL MULTIPLICATION.

*176. EXPONENTIATION.

*177. PROPOSITIONS CONNECTING WITH PRODUCTS AND POWERS.

SECTION D. ARITHMETIC OF RELATION-NUMBERS.

*180. THE SUM OF TWO RELATION-NUMBERS.

*181. ON THE ADDITION OF UNITY TO A RELATION-NUMBER.

*182 ON SEPARATED RELATIONS.

*183. THE SUM OF THE RELATION-NUMBERS OF A FIELD.

*184. THE PRODUCT OF TWO RELATION-NUMBERS.

*185. THE PRODUCT OF THE RELATION-NUMBERS OF A FIELD.

*186. POWERS OF RELATION-NUMBERS.

PART V. SERIES.

SUMMARY OF PART V.

SECTION A. GENERAL THEORY OF SERIES.

PART III.

CARDINAL ARITHMETIC.

SECTION A.
DEFINITION AND LOGICAL PROPERTIES OF CARDINAL NUMBERS.

SECTION B.
ADDITION, MULTIPLICATION AND EXPONENTIATION.

SECTION C.
FINITE AND INFINITE.

*123. $\aleph _{0}$ .

PART IV.

RELATION-ARITHMETIC.

SECTION A.
ORDINAL SIMILARITY AND RELATION-NUMBERS.

*153. THE RELATION-NUMBERS $0_{r}$ , $2_{r}$ AND $1_{s}$ .

SECTION B.
ADDITION OF RELATIONS, AND THE PRODUCT OF TWO RELATIONS.

SECTION C.
THE PRINCIPLE OF FIRST DIFFERENCES, AND THE MULTIPLICATION AND EXPONENTIATION OF RELATIONS.

171. THE PRINCIPLE OF FIRST DIFFERENCES (continued*).

*177. PROPOSITIONS CONNECTING $P_{\text{df}}$ WITH PRODUCTS AND POWERS.

SECTION D.
ARITHMETIC OF RELATION-NUMBERS.

PART V.

SERIES.

SECTION A.
GENERAL THEORY OF SERIES.

SECTION B.
ON SECTIONS, SEGMENTS, STRETCHES, AND DERIVATIVES.

SECTION C.
ON CONVERGENCE, AND THE LIMITS OF FUNCTIONS.