We keep the notation of the statement. Throughout, for 1≤k≤r let Pk denote the family of iterated rectangles B1×⋯×Bk⊆Rk with all Bi∈B(R) (Cartesian products, under the identification fixed in the statement). Pk is a π-system in the sense of Dynkin's Pi-Lambda Theorem — it is closed under intersection, since (B1×⋯×Bk)∩(B1′×⋯×Bk′)=(B1∩B1′)×⋯×(Bk∩Bk′) — and it contains Rk.
Step 0 (iterated rectangles generate, and product values). We show by induction on k that the generated σ-algebra satisfies σ(Pk)=Bk. For k=1, P1=B(R). Let k≥2 and assume σ(Pk−1)=Bk−1. Each member of Pk is a measurable rectangle in the sense of Product Sigma-Algebra (its first factor lies in Pk−1⊆Bk−1), so σ(Pk)⊆Bk. Conversely, fix B∈B(R) and let AB={A⊆Rk−1:A×B∈σ(Pk)}. Then AB is a σ-algebra: it contains Rk−1, is closed under countable unions ((⋃jAj)×B=⋃j(Aj×B)), and under complements, since (Rk−1∖A)×B=(Rk−1×B)∖(A×B) with Rk−1×B∈Pk. It contains Pk−1, hence contains σ(Pk−1)=Bk−1. So every measurable rectangle A×B lies in σ(Pk), and these generate Bk; thus Bk⊆σ(Pk).
Also, by induction on k using the defining property of the product measure in Existence and Uniqueness of the Product Measure,
(ν1⊗⋯⊗νk)(B1×⋯×Bk)=i=1∏kνi(Bi),
with the finite product notation.
Step 1 (Claim 1). Measurability of V: by induction on k, with V(k)=(V1,…,Vk). The class {C⊆Rk:(V(k))−1(C)∈F} is a σ-algebra (preimages commute with complements and countable unions) containing every measurable rectangle A×B, since (V(k))−1(A×B)=(V(k−1))−1(A)∩Vk−1(B)∈F by the induction hypothesis and measurability of Vk; hence it contains Bk.
PV is a probability measure on (Rr,Br): PV(∅)=0, PV(Rr)=P(Ω)=1, and countable additivity follows from that of P because preimages of pairwise disjoint sets are pairwise disjoint and V−1(⋃jCj)=⋃jV−1(Cj).
On Pr: by independence of V1,…,Vr and Step 0,
PV(B1×⋯×Br)=P(i=1⋂r{Vi∈Bi})=i=1∏rP(Vi∈Bi)=i=1∏rνi(Bi)=(ν1⊗⋯⊗νr)(B1×⋯×Br).
Let L={C∈Br:PV(C)=(ν1⊗⋯⊗νr)(C)}. Since both set functions are probability measures, L contains Rr, is closed under proper differences (if A⊆B both lie in L, then B∖A∈L by additivity and finiteness) and under increasing countable unions (continuity from below, obtained by writing an increasing union as a disjoint union of successive differences and using countable additivity). So L is a λ-system containing the π-system Pr, and Dynkin's Pi-Lambda Theorem together with Step 0 gives L⊇σ(Pr)=Br. This proves Claim 1.
Step 2 (Claim 2). φ∘V is a random variable since preimages compose: (φ∘V)−1(B)=V−1(φ−1(B)). The identity E[φ∘V]=∫RrφdPV follows by the standard machine exactly as in the proof of Change of Variables for Expectations, with (R,B(R)) there replaced by (Rr,Br): for indicators both sides equal PV(C) by the integral of a simple function; linearity for nonnegative functions (claim 1 of Linearity and Monotonicity of the Lebesgue Integral) extends this to nonnegative simple φ; for nonnegative measurable φ, compose with the dyadic staircase functions of Step 0(b) of the proof of Linearity and Monotonicity of the Lebesgue Integral and apply Monotone Convergence Theorem on both spaces. If instead φ is bounded, say ∣φ∣≤M, apply the nonnegative case to the positive and negative parts φ± (as in Integrable Function and the Lebesgue Integral); each is bounded by M, whose integral against a probability measure is M<∞, so φ∘V is integrable and the identities subtract. By Claim 1, PV=ν1⊗⋯⊗νr, so the value depends only on φ and ν1,…,νr.
Step 3 (Claim 3). Selecting a subfamily of an independent family preserves independence (immediate from Independence of Events and of Random Variables), so the entries of the tuples VI=(Vi1,…,Vip) and VJ=(Vj1,…,Vjq), and of the combined tuple over I∪J, are independent, and each tuple map is measurable by Step 1 (whose measurability argument uses no independence). Hence φ(VI) and ψ(VJ) are random variables by Step 2. Fix Borel sets B,B′⊆R and put C=φ−1(B)∈Bp, D=ψ−1(B′)∈Bq. It suffices to prove
P(VI∈C, VJ∈D)=P(VI∈C)P(VJ∈D)for all C∈Bp, D∈Bq;
independence of the two random variables φ(VI), ψ(VJ) in the sense of Independence of Events and of Random Variables then follows (for a pair, only the product identity for the pair itself is nontrivial).
If C and D are iterated rectangles, both sides expand by independence of the combined family into the same product of the numbers P(Vi∈⋅) over I∪J. Now fix an iterated rectangle D. The two set functions C↦P(VI∈C, VJ∈D) and C↦P(VI∈C)P(VJ∈D) are finite measures on Bp (countable additivity as in Step 1) with the same total mass P(VJ∈D), agreeing on Pp; the class where they agree is a λ-system exactly as in Step 1, so by Dynkin's Pi-Lambda Theorem and Step 0 they agree on all of Bp. Finally fix an arbitrary C∈Bp and repeat the same argument in the D-coordinate over the π-system Pq. This proves Claim 3.
Step 4 (Claim 4). Projections: πr−1(B)=Rr−1×B∈Br, and for i<r, by induction on r, πi−1(B)=A×R with A∈Br−1, a measurable rectangle. Next, if u,v:Rr→R are jointly Borel then so is u+v: for t∈R, by density of the rationals,
{x:u(x)+v(x)>t}=s∈Q⋃({x:u(x)>s}∩{x:v(x)>t−s}),
a countable union of members of Br; and the rays (t,∞) generate B(R) (every open interval with rational endpoints is obtained from rays by countable set operations, e.g. (c,d)=(c,∞)∖⋂k≥1(d−1/k,∞), and every open set is a countable union of such intervals by density of the rationals), so the generator criterion of Measurable Function and Real-Valued Measurable Function applies. The addition map is the sum of the r projections, hence jointly Borel by induction on the number of summands. Finally, (t∘φ)−1(B)=φ−1(t−1(B)) with t−1(B)∈B(R), proving the composition statement. ■