Each result cited is universally quantified over the data in its own statement.
Preliminaries. By The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §reals, R is an ordered field, so the rules of arithmetic and order in force there are used for real numbers without further citation; in particular 0=1 in R by Fields §field. C=R×R is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set §set. For a,b∈R the pair (a,b) lies in C by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set §membership, and every z∈C is z=(a,b) for some a,b∈R by The Cartesian Product of Two Classes §product. For a,b,c,d∈R, (a,b)=(c,d) if and only if a=c and b=d, by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic; every equation between elements of C below is checked componentwise in this way. By The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit §operations, + and ⋅ are binary operations on C, given by
(a,b)+(c,d)=(a+c,b+d),(a,b)⋅(c,d)=(ac−bd,ad+bc).
For a∈R, since 2=1+1 by Arithmetic and Order of the Natural Numbers §digits, a2=a1+1=a1a1=aa by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §exponents and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §product.
Clause field. Let x=(a,b), y=(c,d) and z=(e,f) be elements of C, with a,b,c,d,e,f∈R; (0,0) and (1,0) lie in C. We check the conditions of Commutative Rings §ring, using the commutative ring laws of R in each component.
Associativity of +: (x+y)+z=((a+c)+e,(b+d)+f)=(a+(c+e),b+(d+f))=x+(y+z).
Commutativity of +: x+y=(a+c,b+d)=(c+a,d+b)=y+x.
Zero: x+(0,0)=(a+0,b+0)=(a,b)=x.
Negatives: w=(−a,−b)∈C and x+w=(a+(−a),b+(−b))=(0,0).
Associativity of ⋅: on the one hand
(x⋅y)⋅z=(ac−bd,ad+bc)⋅(e,f)=((ac−bd)e−(ad+bc)f,(ac−bd)f+(ad+bc)e)=(ace−bde−adf−bcf,acf−bdf+ade+bce);
on the other hand
x⋅(y⋅z)=(a,b)⋅(ce−df,cf+de)=(a(ce−df)−b(cf+de),a(cf+de)+b(ce−df))=(ace−adf−bcf−bde,acf+ade+bce−bdf).
The two agree componentwise.
Commutativity of ⋅: y⋅x=(ca−db,cb+da)=(ac−bd,ad+bc)=x⋅y.
Unit: x⋅(1,0)=(a⋅1−b⋅0,a⋅0+b⋅1)=(a,b)=x.
Distributivity:
x⋅(y+z)=(a,b)⋅(c+e,d+f)=(a(c+e)−b(d+f),a(d+f)+b(c+e))=((ac−bd)+(ae−bf),(ad+bc)+(af+be))=x⋅y+x⋅z.
Hence C, with +, ⋅, (0,0) and (1,0), is a commutative ring by Commutative Rings §ring. Moreover (0,0)=(1,0) because 0=1 in R.
Let now x=(a,b)=(0,0), so a=0 or b=0, and put s=a2+b2=aa+bb. In R, 0≤aa and 0≤bb, and a product of nonzero elements is nonzero; so if a=0 then 0<aa, and if b=0 then 0<bb. In either case 0<aa+bb=s, so s=0. Let y′=(a/s,−b/s)∈C. Then
x⋅y′=(asa−bs−b,as−b+bsa)=(saa+bb,s−ab+ab)=(1,0).
So every nonzero element of C has some y′ with x⋅y′=(1,0), and C is a field by Fields §field.
By Negatives, Differences, Reciprocals and Quotients §negative, the negative −(a,b) is the unique w∈C with (a,b)+w=(0,0), unique by Additive and Multiplicative Inverses Are Unique §negative; the element (−a,−b) found above has this property, so −(a,b)=(−a,−b). Likewise, for (a,b)=(0,0), by Negatives, Differences, Reciprocals and Quotients §reciprocal the reciprocal (a,b)−1 is the unique y∈C with (a,b)⋅y=(1,0), unique by Additive and Multiplicative Inverses Are Unique §reciprocal; the element y′ has this property, so (a,b)−1=(a/(a2+b2),−b/(a2+b2)).
Clause embedding. For a∈R, (a,0)∈C, so ι is the map of Maps and Relations Given by Formulas §map, with ι(a)=(a,0). If ι(a)=ι(a′) for a,a′∈R, then (a,0)=(a′,0), so a=a′ by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic; thus ι is injective by Injective, Surjective and Bijective Functions between Classes §injective. Plainly ι(0)=(0,0) and ι(1)=(1,0), the zero and the unit of C by the clause field. For a,b∈R,
ι(a)+ι(b)=(a+b,0+0)=(a+b,0)=ι(a+b),ι(a)⋅ι(b)=(ab−0⋅0,a⋅0+0⋅b)=(ab,0)=ι(ab).
Hence ι(a)+ι(−a)=ι(a+(−a))=ι(0)=(0,0), so ι(−a) is the unique w∈C with ι(a)+w=(0,0), that is, ι(−a)=−ι(a) by Negatives, Differences, Reciprocals and Quotients §negative. Let moreover a=0. Then ι(a)=ι(0)=(0,0) by injectivity, and ι(a)⋅ι(a−1)=ι(aa−1)=ι(1)=(1,0), so ι(a−1) is the unique y∈C with ι(a)⋅y=(1,0), that is, ι(a−1)=ι(a)−1 by Negatives, Differences, Reciprocals and Quotients §reciprocal.
Clause imaginary-unit. By The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit §imaginary-unit, i=(0,1), so
i⋅i=(0,1)⋅(0,1)=(0⋅0−1⋅1,0⋅1+1⋅0)=(−1,0)=ι(−1),
and ι(−1)=−ι(1) by the clause embedding.
Clause not-real. Let a∈R. If i=ι(a), then (0,1)=(a,0), so 1=0 in R by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic, contradicting 0=1 from the preliminaries. Hence i=ι(a).
Clause canonical. Let a,b∈R. Then
ι(b)⋅i=(b,0)⋅(0,1)=(b⋅0−0⋅1,b⋅1+0⋅0)=(0,b),ι(a)+ι(b)⋅i=(a,0)+(0,b)=(a+0,0+b)=(a,b).
Let z∈C. By the preliminaries z=(a,b) for some a,b∈R, and then z=ι(a)+ι(b)⋅i by what was just shown, so such a pair exists. If also z=ι(a′)+ι(b′)⋅i with a′,b′∈R, then by the same identity (a,b)=z=(a′,b′), so the pair is the same; thus it is unique.
Clause arithmetic. Let a,b,c,d∈R. By the clause canonical and The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit §operations,
(ι(a)+ι(b)⋅i)+(ι(c)+ι(d)⋅i)=(a,b)+(c,d)=(a+c,b+d),(ι(a)+ι(b)⋅i)⋅(ι(c)+ι(d)⋅i)=(a,b)⋅(c,d)=(ac−bd,ad+bc).
Since a+c, b+d, ac−bd and ad+bc lie in R, the clause canonical gives (a+c,b+d)=ι(a+c)+ι(b+d)⋅i and (ac−bd,ad+bc)=ι(ac−bd)+ι(ad+bc)⋅i, which proves both identities.
Clause numerals. By the clause field, C, with +, ⋅, (0,0) and (1,0), is a field and so a commutative ring by Fields §field; so is R, with its zero 0 and unit 1, by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §reals. Hence The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products applies to both. We show nC=ι(nR) by induction on n∈N0, by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §induction.
For n=0: by The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products §constants, 0R=0 and 0C=(0,0), and ι(0)=(0,0) by the clause embedding; so 0C=ι(0R).
Let n∈N0 with nC=ι(nR). By The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products §sum and The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products §constants, (n+1)R=nR+1R=nR+1 and (n+1)C=nC+1C=nC+(1,0). By the clause embedding, ι(1)=(1,0) and ι preserves sums, so
ι((n+1)R)=ι(nR)+ι(1)=nC+(1,0)=(n+1)C.
Hence nC=ι(nR) for every n∈N0.