TheoremBase

Kit for def:complex-numbers-nbg

Being the sum operation, or the product operation, of the complex numbers is a predicative condition on a set, and the sets satisfying either condition form a class.

Statement

In the setting of Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity, let nβ‰₯1n\ge1 be a metatheoretic number, let x0,…,xnβˆ’1x_{0},\dots,x_{n-1} be distinct set variables, and let i<ni<n. A condition on x0,…,xnβˆ’1x_{0},\dots,x_{n-1} is predicative if it is expressed by a predicative formula, with x0,…,xnβˆ’1x_{0},\dots,x_{n-1} in place of the variables x1,…,xkx_{1},\dots,x_{k} of Conditions Expressed by a Predicative Formula, and Guards (i) and no displayed variables; R\mathbb{R}, its operations ++ and β‹…\cdot, and its element 00 are parameters. The sum operation and the product operation of the set C\mathbb{C} of complex numbers are the binary operations on C\mathbb{C} of The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (iii).

The sum. The condition "xix_{i} is the sum operation of C\mathbb{C}" on x0,…,xnβˆ’1x_{0},\dots,x_{n-1} is predicative.

The product. The condition "xix_{i} is the product operation of C\mathbb{C}" on x0,…,xnβˆ’1x_{0},\dots,x_{n-1} is predicative.

A class for the sum. There is a class AA such that, for every class aa, a∈Aa\in A if and only if aa is the sum operation of C\mathbb{C}.

A class for the product. There is a class MM such that, for every class aa, a∈Ma\in M if and only if aa is the product operation of C\mathbb{C}.

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…