Every identity is an equality of sets and is checked elementwise: a pair (u,v) lies in a product CΓD if and only if uβC and vβD (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)), every element of XΓY is such a pair, two pairs are equal exactly when their entries are (The Characteristic Property of Ordered Pairs and Nested Tuples of Sets (i)), and sβuβ1(V) if and only if u(s)βV, for s in the domain of u (Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (ii)).
Proof of (i). A pair (u,v) lies in both AΓB and Aβ²ΓBβ² exactly when uβA, uβAβ², vβB and vβBβ², that is, when (u,v)β(Aβ©Aβ²)Γ(Bβ©Bβ²). For yβ²βY we have (x,yβ²)βAΓB if and only if xβA and yβ²βB (Sections of Subsets and Functions on a Product (i)); so (AΓB)xβ=B if xβA, and (AΓB)xβ=β
if xβ/A. The section at y is the same computation in the first entry.
Proof of (ii). For yβ²βY: (x,yβ²)β(XΓY)βE if and only if (x,yβ²)β/E, that is, yβ²β/Exβ; (x,yβ²)ββkβEkβ if and only if (x,yβ²)βEkβ for some k, that is, yβ²β(Ekβ)xβ for some k; and (x,yβ²)βEβ©Eβ² if and only if yβ²βExβ and yβ²βExβ²β. If Eβ©Eβ²=β
, then Exββ©Exβ²β=(Eβ©Eβ²)xβ=β
xβ=β
. Sections at y are treated in the same way.
Proof of (iii). For yβ²βY, yβ²βixβ1β(E) if and only if (x,yβ²)=ixβ(yβ²)βE, that is, yβ²βExβ; likewise xβ²β(iy)β1(E) if and only if (xβ²,y)βE, that is, xβ²βEy.
Proof of (iv). For (yβ²,xβ²)βYΓX: (yβ²,xβ²)βtβ1(AΓB) if and only if (xβ²,yβ²)βAΓB, that is, yβ²βB and xβ²βA, that is, (yβ²,xβ²)βBΓA. For xβ²βX, xβ²β(tβ1(E))yβ if and only if (y,xβ²)βtβ1(E), that is, (xβ²,y)βE, that is, xβ²βEy; and for yβ²βY, yβ²β(tβ1(E))x if and only if (yβ²,x)βtβ1(E), that is, (x,yβ²)βE, that is, yβ²βExβ.