TheoremBase

The Graph of Multiplication on ℕ₀ Is Given by a Predicative Formula

The condition that a set is the triple ((m, n), m·n) for natural numbers m and n is expressed by a predicative formula, both with m and n as variables and with m and n bound by existential quantifiers.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let x0,x1,x2x_{0},x_{1},x_{2} be distinct set variables, let N0\mathbb{N}_{0} be as in The Class Omega of Natural Numbers with Zero (i), for m,n∈N0m,n\in\mathbb{N}_{0} let m⋅nm\cdot n be their product, and let (u,v)(u,v) denote the ordered pair. Each clause asserts that the condition shown is expressed by a predicative formula, the variables it names being the x1,…,xkx_{1},\dots,x_{k} of Conditions Expressed by a Predicative Formula, and Guards (i), with no displayed variables.

The graph on three variables. The condition on x0,x1,x2x_{0},x_{1},x_{2}

x1∈N0,x2∈N0andx0=((x1,x2),x1⋅x2).x_{1}\in\mathbb{N}_{0},\quad x_{2}\in\mathbb{N}_{0}\quad\text{and}\quad x_{0}=((x_{1},x_{2}),x_{1}\cdot x_{2}).

The graph on one variable. The condition on x0x_{0}

there are sets m and n with m∈N0, n∈N0 and x0=((m,n),m⋅n).\text{there are sets } m \text{ and } n \text{ with } m\in\mathbb{N}_{0},\ n\in\mathbb{N}_{0}\ \text{and}\ x_{0}=((m,n),m\cdot n).

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…