TheoremBase

Each of xnx^n and nRn_R is the value at n of a map from the natural numbers with zero to R, given by the iterated-operation maps lemma, and a value of a map lies in its codomain.

Proof

Each result cited is universally quantified over the data in its own statement. No choice is used.

By Commutative Rings §ring, whose framing makes RR a set, and by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §sets, in force by Commutative Rings, Fields and Ordered Fields: Standard Notation §base, both RR and N0\mathbb{N}_{0} are sets. No map or class is formed from a formula in this proof: each map used is one whose existence a cited clause asserts.

Clause powers. Let x∈Rx\in R and n∈N0n\in\mathbb{N}_{0}. By Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set §ring-powers applied to RR and xx, there is a map p:N0→Rp:\mathbb{N}_{0}\to R with p(m)=xmp(m)=x^{m} for every m∈N0m\in\mathbb{N}_{0}. As n∈N0n\in\mathbb{N}_{0}, Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §graph, applied with A=N0A=\mathbb{N}_{0}, B=RB=R, f=pf=p and a=na=n, gives p(n)∈Rp(n)\in R. Hence xn=p(n)∈Rx^{n}=p(n)\in R.

Clause images. Let n∈N0n\in\mathbb{N}_{0}. By Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set §images, applied to RR, there is a map ν:N0→R\nu:\mathbb{N}_{0}\to R with ν(m)=mR\nu(m)=m_{R} for every m∈N0m\in\mathbb{N}_{0}. As n∈N0n\in\mathbb{N}_{0}, Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §graph, applied with A=N0A=\mathbb{N}_{0}, B=RB=R, f=νf=\nu and a=na=n, gives ν(n)∈R\nu(n)\in R. Hence nR=ν(n)∈Rn_{R}=\nu(n)\in R.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…