Throughout, S is the successor map of Natural Numbers, so S(j)=j+1 by statement 1 of Arithmetic of Addition on the Natural Numbers. The order ≤ on R is that of an ordered field and s<t means s≤t and s=t; ∣⋅∣ is the absolute value, so dR(s,t)=∣s−t∣, and ∥⋅∥ is the Euclidean norm. Let ι be the canonical map of R.
By part 1 of Difference, Dot Product, and Orthogonality in Rn, for every m∈N the difference x(m)−x is the point of Rn whose i-th coordinate is xi(m)−xi, and by statement 2 of Elementary Properties of the Euclidean Norm on Rn,
dE(x(m),x)=∥x(m)−x∥.
Necessity. Suppose (x(m))m∈N converges to x in (Rn,dE), and let i∈[n] and let ε be a real number with 0<ε. By the definition of convergence there is N∈N with dE(x(m),x)<ε for every m∈N with N≤m. Statement 4 of Elementary Properties of the Euclidean Norm on Rn, applied to the point x(m)−x, gives
∣xi(m)−xi∣≤∥x(m)−x∥=dE(x(m),x),
so mixed transitivity, statement 2 of Elementary Order Arithmetic in an Ordered Field, gives dR(xi(m),xi)<ε for every such m. Hence (xi(m))m∈N converges to xi in (R,dR).
Sufficiency. Suppose that for every i∈[n] the sequence (xi(m))m∈N converges to xi in (R,dR), and let ε be a real number with 0<ε.
A tolerance for the coordinates. Statement 8 of Elementary Order Arithmetic in an Ordered Field gives 0<ε⋅2−1 and ε⋅2−1<ε, and statement 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field gives 0<ι(n)−1. Put
δ=(ε⋅2−1)ι(n)−1,
so 0<δ by statement 5 of Elementary Order Arithmetic in an Ordered Field. Using the commutativity and associativity of multiplication in the field R together with ι(n)ι(n)−1=1 and a⋅1=a,
ι(n)δ=(ε⋅2−1)(ι(n)ι(n)−1)=ε⋅2−1<ε.
A common threshold, by induction. Let B be the set of j∈N for which there exists N∈N such that
∣xi(m)−xi∣<δfor every m∈N with N≤m and every i∈[j]∩[n].
Statement 4 of Properties of the Order on the Natural Numbers gives 1≤n, so 1∈[n]; and if k∈[1] then k≤1 and 1≤k, so k=1 by antisymmetry, whence [1]∩[n]={1}. Convergence of the first coordinate supplies N with dR(x1(m),x1)<δ for every m with N≤m, so 1∈B.
Suppose j∈B, with witness N. By statement 5 of Properties of the Order on the Natural Numbers, every i∈[S(j)] satisfies i≤j or i=S(j). If S(j)∈/[n], then no i∈[S(j)]∩[n] can equal S(j), so [S(j)]∩[n]⊆[j]∩[n] and the same N witnesses S(j)∈B. If S(j)∈[n], convergence of the coordinate S(j) supplies N′∈N with ∣xS(j)(m)−xS(j)∣<δ for every m with N′≤m. Put N′′=N+N′; statement 6 of Properties of the Order on the Natural Numbers gives N<N+N′ and N′<N′+N, and addition on N is commutative by statement 4 of Arithmetic of Addition on the Natural Numbers, so N≤N′′ and N′≤N′′ by statement 1 of Properties of the Order on the Natural Numbers. Let m∈N with N′′≤m and let i∈[S(j)]∩[n]. If i≤j then i∈[j]∩[n] and N≤m by transitivity, so the bound holds; if i=S(j) then N′≤m by transitivity and the bound holds. Hence S(j)∈B.
By Principle of Induction for the Natural Numbers, B=N. Taking j=n and noting [n]∩[n]=[n], there is N∈N such that
∣xi(m)−xi∣<δfor every m∈N with N≤m and every i∈[n].
Conclusion. Let m∈N with N≤m. The i-th coordinate of x(m)−x is xi(m)−xi, and ∣xi(m)−xi∣≤δ for every i∈[n]; since also 0≤δ, Coordinate Bounds Control the Euclidean Norm applied to the point x(m)−x gives
∥x(m)−x∥≤ι(n)δ.
Combining with ι(n)δ<ε by mixed transitivity, statement 2 of Elementary Order Arithmetic in an Ordered Field, gives dE(x(m),x)<ε. As ε was arbitrary, (x(m))m∈N converges to x in (Rn,dE).