TheoremBase

Class Comprehension in Two and Three Set Variables, Stated with Ordered Pairs

Instances n = 2 and n = 3 of the class comprehension theorem, written with the ordered pair (u,v) and the nested pair ((u,v),w) instead of tuples.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation. This is a theorem scheme of the metatheory: it asserts one helper for each formula as below.

Let uu, vv and ww be distinct set variables, and let Y1,…,YmY_{1},\dots,Y_{m}, with m≥0m\ge0 a metatheoretic number, be distinct variables of either kind, different from uu, vv and ww (the parameters), with a set assigned to each parameter that is a set variable as in the reading of formulas. For sets uu and vv, (u,v)(u,v) denotes their ordered pair.

If φ(u,v,Y1,…,Ym)\varphi(u,v,Y_{1},\dots,Y_{m}) is a predicative formula whose free variables are among u,v,Y1,…,Ymu,v,Y_{1},\dots,Y_{m}, then for all classes Y1,…,YmY_{1},\dots,Y_{m} there is a class ZZ such that, for all sets uu and vv,

(u,v)∈Zif and only ifφ(u,v,Y1,…,Ym).(u,v)\in Z\quad\text{if and only if}\quad \varphi(u,v,Y_{1},\dots,Y_{m}).

If φ(u,v,w,Y1,…,Ym)\varphi(u,v,w,Y_{1},\dots,Y_{m}) is a predicative formula whose free variables are among u,v,w,Y1,…,Ymu,v,w,Y_{1},\dots,Y_{m}, then for all classes Y1,…,YmY_{1},\dots,Y_{m} there is a class ZZ such that, for all sets uu, vv and ww,

((u,v),w)∈Zif and only ifφ(u,v,w,Y1,…,Ym).((u,v),w)\in Z\quad\text{if and only if}\quad \varphi(u,v,w,Y_{1},\dots,Y_{m}).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…