In each identity of functions both sides are functions on the same set, so it suffices to show that their values agree at every point (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (i)); the value of a composite at v is (fβT)(v)=f(T(v)) (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii)). Let vβV.
Proof of (i). By Positive Part, Negative Part and Absolute Value of a Real-Valued Function (i),
(fβT)+(v)=max{f(T(v)),0}=f+(T(v)),
and in the same way (fβT)β(v)=max{βf(T(v)),0}=fβ(T(v)) and β£fβTβ£(v)=β£f(T(v))β£=β£fβ£(T(v)) (Positive Part, Negative Part and Absolute Value of a Real-Valued Function (ii), Positive Part, Negative Part and Absolute Value of a Real-Valued Function (iii)).
Proof of (ii). By Sums, Multiples and Products of Functions into [0,β] (i) and Sums, Multiples and Products of Functions into [0,β] (ii),
((f+g)βT)(v)=f(T(v))+g(T(v))=(fβT+gβT)(v),((cf)βT)(v)=cf(T(v))=(c(fβT))(v).
Since vβTβ1(A) if and only if T(v)βA (Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (ii)), 1Aβ(T(v)) and 1Tβ1(A)β(v) are both 1 or both 0 (Indicator Function of a Subset (i)). Finally, (hβT)(v)=h(T(v))=supmβfmβ(T(v))=supmβ(fmββT)(v), by the hypothesis on h at the point T(v)βW.
Proof of (iii). By Dyadic Approximations of a Map into [0,β] (i), smβ(g)(T(v)) and smβ(gβT)(v) are given by the same expression in the number g(T(v))=(gβT)(v), so they are equal.
Proof of (iv). For wβ²βW, fvβ(wβ²)=f(v,wβ²)=f(ivβ(wβ²))=(fβivβ)(wβ²) by Sections of Subsets and Functions on a Product (ii); likewise fw(vβ²)=f(vβ²,w)=(fβiw)(vβ²) for vβ²βV.