Each result cited is universally quantified over the data in its own statement.
Clause index-split. m+n∈N and [m]⊆[m+n] (Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] §sum). For j∈[n], m+j∈[m+n] and m+j∈/[m] (Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] §shift). Every k∈[m+n] lies in exactly one of [m] and {m+j:j∈[n]}, and in the second case m<k and k=m+j for exactly one j∈[n], namely j=k−m (Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] §cases).
Points of Rm+n are compared coordinatewise: by Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations §equality, two points of Rp are equal exactly when their components agree at every index of [p], and by the clause index-split every k∈[m+n] lies in [m] or equals m+j for exactly one j∈[n], and not both; so for Rm+n it suffices to compare components at the indices k∈[m] and m+j with j∈[n].
Preliminaries. By the clause index-split, m+n∈N, so for each p∈{m,n,m+n} the Euclidean space Rp is the set R[p] of maps [p]→R by Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations §space and Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations §membership. Let σ:[n]→[m+n]∖[m], j↦m+j, be the bijection of the segment-split clause shift cited in the clause index-split. Its inverse ρ=σ−1:[m+n]∖[m]→[n] is a bijective map with ρ∘σ=id[n] and σ∘ρ=id[m+n]∖[m] (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §inverse); evaluating composites and identities by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition and Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §identity, ρ(m+j)=j for j∈[n] and m+ρ(k)=k for k∈[m+n]∖[m].
For the clause concatenation, let X=Rm×Rn. Both X and X×[m+n] are sets by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set §set. Let π1:X→Rm and π2:X→Rn be the projections of Projection, Evaluation and Currying Maps §projections, with Rm and Rn for its X and Y, so that π1(ξ,η)=ξ and π2(ξ,η)=η for ξ∈Rm and η∈Rn; and let q1:X×[m+n]→X and q2:X×[m+n]→[m+n] be the projections of the same clause, with X and [m+n] for its X and Y, so that q1(u,k)=u and q2(u,k)=k for u∈X and k∈[m+n]. For p∈X×[m+n] write u=q1(p)∈X and k=q2(p)∈[m+n]; then π1u∈Rm=R[m] and π2u∈Rn=R[n], so π1u is a map [m]→R and π2u a map [n]→R.
We apply Maps Defined by Cases §cases on X×[m+n]. Its property is q2(p)∈[m], that is k∈[m], which, for p∈X×[m+n], is expressed by the predicative formula ∃z((p,z)∈q2∧z∈[m]), with q2 and [m] as parameters, as p∈domq2 by Functions, Values of a Function, and Functions from One Class to Another §map. Its expressions are t1(p)=(π1u)(k) and t2(p)=(π2u)(ρ(k)), with u=q1(p) and k=q2(p), built from the values of the maps q1, q2, π1, π2, ρ, π1u and π2u; values of functions are defined set symbols by Functions, Values of a Function, and Functions from One Class to Another §value, a value F(c) is used properly when c∈domF, and values of maps lie in their codomains. If k∈[m], then k∈[m]=domπ1u, so t1(p) is used properly and lies in R. If not, then k∈[m+n]∖[m]=domρ and ρ(k)∈[n]=domπ2u, so t2(p) is used properly and lies in R. This gives a map g:X×[m+n]→R with g(u,k)=(π1u)(k) if k∈[m] and g(u,k)=(π2u)(ρ(k)) if k∈/[m], for u∈X and k∈[m+n], and Projection, Evaluation and Currying Maps §currying gives a map ι:X→R[m+n]=Rm+n with ι(u)(k)=g(u,k) for u∈X and k∈[m+n].
Let ξ∈Rm, η∈Rn and w=ι(ξ,η). As π1(ξ,η)=ξ and π2(ξ,η)=η, wk=ξk for k∈[m]; and for j∈[n], m+j=σ(j)∈[m+n]∖[m], so wm+j=ηρ(m+j)=ηj. If w′∈Rm+n also has wk′=ξk for k∈[m] and wm+j′=ηj for j∈[n], then wk′=wk for k∈[m], and each k∈[m+n]∖[m] equals m+ρ(k) with ρ(k)∈[n], so wk′=ηρ(k)=wk; hence w′=w. So exactly one w∈Rm+n satisfies the conditions of the clause concatenation, ι sends (ξ,η) to it, and every map X→Rm+n doing the same has the values of ι and so equals ι.
Claim 1. Injectivity. Let (ξ,η),(ξ′,η′)∈Rm×Rn with ι(ξ,η)=ι(ξ′,η′). Comparing coordinates, ξk=ι(ξ,η)k=ι(ξ′,η′)k=ξk′ for k∈[m] and ηj=ι(ξ,η)m+j=ι(ξ′,η′)m+j=ηj′ for j∈[n], so ξ=ξ′ and η=η′, and (ξ,η)=(ξ′,η′) by The Characteristic Property of Ordered Pairs and Nested Tuples of Sets §characteristic. So ι is injective.
Surjectivity. Let w∈Rm+n, and let σ:[n]→[m+n]∖[m], j↦m+j, be as in the preliminaries; as [m+n]∖[m]⊆[m+n], σ is also a map [n]→[m+n]. Let ξ=w∣[m] and η=w∘σ. Since [m]⊆[m+n] by the clause index-split, ξ is a function with domain [m] and ξk=wk∈R for k∈[m] (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §restriction), and η is a map [n]→R with ηj=w(σ(j))=wm+j for j∈[n]; so ξ∈R[m]=Rm and η∈R[n]=Rn. As wk=ξk for k∈[m] and wm+j=ηj for j∈[n], the uniqueness in the clause concatenation gives ι(ξ,η)=w. So ι is surjective, hence bijective.
Inverse. As in the preliminaries, ι−1:Rm+n→Rm×Rn is a bijective map with ι−1∘ι=idRm×Rn. For w∈Rm+n and (ξ,η) as in the surjectivity step, ι(ξ,η)=w, so ι−1(w)=ι−1(ι(ξ,η))=(ξ,η), evaluating the composite and the identity. Thus ι−1 sends w to the pair whose first entry has kth coordinate wk for k∈[m] and whose second entry has jth coordinate wm+j for j∈[n], which is the map described in claim 1.
Claim 2. By Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations §operations, the kth component of ι(ξ,η)+ι(ξ′,η′) is ι(ξ,η)k+ι(ξ′,η′)k. For k∈[m] this is ξk+ξk′=(ξ+ξ′)k, which is the kth component of ι(ξ+ξ′,η+η′); at the index m+j with j∈[n] it is ηj+ηj′=(η+η′)j, which is the (m+j)th component of ι(ξ+ξ′,η+η′). This proves the first identity. The second and third are proved in the same way, using (λz)k=λzk and (z−z′)k=zk−zk′ from the same clause.
Claim 3. Let c:[m+n]→R be the pointwise product k↦ι(ξ,η)kι(ξ′,η′)k. By The Dot Product on Rn §dot-product,
ι(ξ,η)⋅ι(ξ′,η′)=k=1∑m+nck,
a sum from 1 to m+n. Addition on R is associative and commutative, so Splitting an Operation over the Segment [m+n] into [m] and a Shifted Copy of [n] §interval-split, applied to + on R and a=c, gives
k=1∑m+nck=k=1∑mck+j=1∑ncm+j,
in whichever reading the three sums from 1 are taken, the first sum on the right being that of c∣[m]. For k∈[m] we have ck=ξkξk′, so c∣[m] is the pointwise product of ξ and ξ′ and the first sum is ξ⋅ξ′ by the same definition; for j∈[n] we have cm+j=ηjηj′, so the second sum is η⋅η′. This proves the first identity of claim 3.
By Properties of the Euclidean Norm on Rn: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square §square, ∥z∥2=z⋅z in each Euclidean space. Taking ξ′=ξ and η′=η in the first identity therefore gives ∥ι(ξ,η)∥2=∥ξ∥2+∥η∥2.
Claim 4. By Properties of the Euclidean Norm on Rn: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square §distance, dE(u,u′)=∥u−u′∥ in each Euclidean space. By claim 2, ι(z)−ι(z′)=ι(ξ−ξ′,η−η′), so by claim 3
dE(ι(z),ι(z′))2=∥ι(ξ−ξ′,η−η′)∥2=∥ξ−ξ′∥2+∥η−η′∥2=dE(ξ,ξ′)2+dE(η,η′)2,
which is the first assertion.
Write α=dE(ξ,ξ′), β=dE(η,η′), γ=dE(ι(z),ι(z′)) and μ=d×(z,z′). These are nonnegative by Metric Space §nonnegative, since dE is a metric by Rn with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence §metric and d× is a metric by The Product Metric is a Metric §metric. By Product Metric on the Cartesian Product of Two Metric Spaces §value, μ=max{α,β}; by The Product Metric is a Metric §domination, α≤μ and β≤μ; and since α≤β or β≤α, The Maximum and Minimum of Two Elements of a Total Order §values gives μ=β or μ=α. The first assertion says γ2=α2+β2.
For the first inequality of the second assertion: μ is one of α,β, and the square of the other is nonnegative by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares §squares, so μ2≤α2+β2=γ2 by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares §sum. As μ and γ are nonnegative, μ≤γ (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §monotone-iff, with exponent 2 in the ordered field R).
For the second inequality: 0≤α≤μ and 0≤β≤μ give α2≤μ2 and β2≤μ2 by Rules of Order in an Ordered Ring: Differences, Sums, Negatives, Products and Squares §product, so γ2=α2+β2≤μ2+μ2 by the rule for sums used above. Moreover (μ+μ)2=(μ2+μ2)+(μμ+μμ) by field arithmetic, and 0≤μμ+μμ by the rules for squares and sums, so μ2+μ2≤(μ+μ)2. Hence γ2≤(μ+μ)2. Since γ and μ+μ are nonnegative, the latter as a sum of nonnegative reals, γ≤μ+μ, by the monotonicity of squaring used above.