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.
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 , and be distinct set variables, and let , with a metatheoretic number, be distinct variables of either kind, different from , and (the parameters), with a set assigned to each parameter that is a set variable as in the reading of formulas. For sets and , denotes their ordered pair.
If is a predicative formula whose free variables are among , then for all classes there is a class such that, for all sets and ,
If is a predicative formula whose free variables are among , then for all classes there is a class such that, for all sets , and ,
Loading…
No relations recorded yet.