TheoremBase

The first clause is checked case by case on whether the term is a variable or a parameter; for the second, the condition is written as a formula built from atomic and pair-membership formulas by connectives and quantifiers over set variables, and read off.

Proof

Throughout, formulas written with the abbreviations ∀\forall and ⇒\Rightarrow stand for the formulas they abbreviate in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (ii), and are read as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (iv). By Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v), a formula is predicative exactly when none of its quantifiers is applied to a class variable; hence a formula built from predicative formulas by ¬\neg, ∧\wedge and quantifiers over set variables is again predicative.

Values of variables and set parameters. We prove (i). Fix an assignment of sets to x0,…,xn−1x_{0},\dots,x_{n-1}; by Conditions Expressed by a Predicative Formula, and Guards (i), the value of a variable xjx_{j} is the set assigned to it, and the value of a parameter is its fixed value, given before the assignment and unaffected by it. If τ\tau is a variable xjx_{j} with j<nj<n, then xjx_{j} is among x0,…,xn−1x_{0},\dots,x_{n-1}, so its value is the set assigned to it. If τ\tau is a parameter whose value is a set, its value is that set, whatever is assigned to x0,x1,…x_{0},x_{1},\dots. In both cases the value of τ\tau is a set.

The monotonicity condition. We prove (ii). Let mm, aa and bb be distinct set variables other than x0x_{0}; they differ from the class variables FF, N\mathbb{N}, ≤ω\le_{\omega} and ≤‾\overline{\le}. By Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii), applied with ≤ω\le_{\omega} for ss, mm for t1t_{1} and x0x_{0} for t2t_{2}, and with FF, FF, ≤‾\overline{\le} for ss and the pairs m,am,a, then x0,bx_{0},b, then a,ba,b for t1,t2t_{1},t_{2}, the four formulas

(m,x0)∈≤ω,(m,a)∈F,(x0,b)∈F,(a,b)∈≤‾(m,x_{0})\in{\le_{\omega}},\qquad (m,a)\in F,\qquad (x_{0},b)\in F,\qquad (a,b)\in{\overline{\le}}

are predicative, and when sets are assigned to the two components each holds if and only if the ordered pair of the assigned sets is an element of the value of the class variable on the right. Each is the renaming π2[t/t′]\pi_{2}[t/t'] of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii), so, by the construction in Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (i), its free variables are among its two components and the class variable on the right. The formula m∈Nm\in\mathbb{N} is atomic, hence predicative, with free variables mm and N\mathbb{N}. Let ψ\psi be the formula

∀m ((m∈N∧(m,x0)∈≤ω)⇒∃a ∃b ((m,a)∈F∧(x0,b)∈F∧(a,b)∈≤‾)).\forall m\,\Bigl(\bigl(m\in\mathbb{N}\wedge(m,x_{0})\in{\le_{\omega}}\bigr)\Rightarrow\exists a\,\exists b\,\bigl((m,a)\in F\wedge(x_{0},b)\in F\wedge(a,b)\in{\overline{\le}}\bigr)\Bigr).

It is built from the formula m∈Nm\in\mathbb{N} and the four displayed formulas by ¬\neg, ∧\wedge and quantifiers over the set variables mm, aa and bb, so it is predicative; and since mm, aa and bb are bound in it, its free variables are among x0x_{0} and the parameters FF, N\mathbb{N}, ≤ω\le_{\omega} and ≤‾\overline{\le} of the condition.

Let a set cc be assigned to x0x_{0}, the parameters having their values. Read as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (iv), the quantifiers over mm, aa and bb range over sets, so ψ\psi holds if and only if for every set dd with d∈Nd\in\mathbb{N} and (d,c)∈≤ω(d,c)\in{\le_{\omega}} there are sets ee and ff with (d,e)∈F(d,e)\in F, (c,f)∈F(c,f)\in F and (e,f)∈≤‾(e,f)\in{\overline{\le}}, by what was said of the four pair-membership formulas; that is, if and only if the condition holds at cc. By Conditions Expressed by a Predicative Formula, and Guards (ii), ψ\psi is a predicative formula in x0x_{0} expressing the condition.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…