TheoremBase

Inductive Classes

Defines a class as inductive when it contains the empty set and contains the successor of each of its elements.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let AA be a class, and let S(u)S(u) denote the successor of a set uu.

AA is inductive if the empty set satisfies ∅∈A\emptyset\in A and S(u)∈AS(u)\in A for every u∈Au\in A. This is the defined predicate abbreviating ∅∈A∧∀u (u∈A⇒S(u)∈A)\emptyset\in A\wedge\forall u\,(u\in A\Rightarrow S(u)\in A), with uu a set variable; ∅\emptyset and S(u)S(u) are defined set symbols, so the formula is predicative.

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…