TheoremBase

Each identity is checked elementwise, using membership of pairs in a product and the definitions of sections and preimages.

Proof

Every identity is an equality of sets and is checked elementwise: a pair (u,v)(u,v) lies in a product CΓ—DC\times D if and only if u∈Cu\in C and v∈Dv\in D (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)), every element of XΓ—YX\times 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)s\in u^{-1}(V) if and only if u(s)∈Vu(s)\in V, for ss in the domain of uu (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)(u,v) lies in both AΓ—BA\times B and Aβ€²Γ—Bβ€²A'\times B' exactly when u∈Au\in A, u∈Aβ€²u\in A', v∈Bv\in B and v∈Bβ€²v\in B', that is, when (u,v)∈(A∩Aβ€²)Γ—(B∩Bβ€²)(u,v)\in(A\cap A')\times(B\cap B'). For yβ€²βˆˆYy'\in Y we have (x,yβ€²)∈AΓ—B(x,y')\in A\times B if and only if x∈Ax\in A and yβ€²βˆˆBy'\in B (Sections of Subsets and Functions on a Product (i)); so (AΓ—B)x=B(A\times B)_{x}=B if x∈Ax\in A, and (AΓ—B)x=βˆ…(A\times B)_{x}=\emptyset if xβˆ‰Ax\notin A. The section at yy is the same computation in the first entry.

Proof of (ii). For yβ€²βˆˆYy'\in Y: (x,yβ€²)∈(XΓ—Y)βˆ–E(x,y')\in(X\times Y)\setminus E if and only if (x,yβ€²)βˆ‰E(x,y')\notin E, that is, yβ€²βˆ‰Exy'\notin E_{x}; (x,yβ€²)βˆˆβ‹ƒkEk(x,y')\in\bigcup_{k}E_{k} if and only if (x,yβ€²)∈Ek(x,y')\in E_{k} for some kk, that is, yβ€²βˆˆ(Ek)xy'\in(E_{k})_{x} for some kk; and (x,yβ€²)∈E∩Eβ€²(x,y')\in E\cap E' if and only if yβ€²βˆˆExy'\in E_{x} and yβ€²βˆˆExβ€²y'\in E'_{x}. If E∩Eβ€²=βˆ…E\cap E'=\emptyset, then Ex∩Exβ€²=(E∩Eβ€²)x=βˆ…x=βˆ…E_{x}\cap E'_{x}=(E\cap E')_{x}=\emptyset_{x}=\emptyset. Sections at yy are treated in the same way.

Proof of (iii). For yβ€²βˆˆYy'\in Y, yβ€²βˆˆixβˆ’1(E)y'\in i_{x}^{-1}(E) if and only if (x,yβ€²)=ix(yβ€²)∈E(x,y')=i_{x}(y')\in E, that is, yβ€²βˆˆExy'\in E_{x}; likewise xβ€²βˆˆ(iy)βˆ’1(E)x'\in(i^{y})^{-1}(E) if and only if (xβ€²,y)∈E(x',y)\in E, that is, xβ€²βˆˆEyx'\in E^{y}.

Proof of (iv). For (yβ€²,xβ€²)∈YΓ—X(y',x')\in Y\times X: (yβ€²,xβ€²)∈tβˆ’1(AΓ—B)(y',x')\in t^{-1}(A\times B) if and only if (xβ€²,yβ€²)∈AΓ—B(x',y')\in A\times B, that is, yβ€²βˆˆBy'\in B and xβ€²βˆˆAx'\in A, that is, (yβ€²,xβ€²)∈BΓ—A(y',x')\in B\times A. For xβ€²βˆˆXx'\in X, xβ€²βˆˆ(tβˆ’1(E))yx'\in(t^{-1}(E))_{y} if and only if (y,xβ€²)∈tβˆ’1(E)(y,x')\in t^{-1}(E), that is, (xβ€²,y)∈E(x',y)\in E, that is, xβ€²βˆˆEyx'\in E^{y}; and for yβ€²βˆˆYy'\in Y, yβ€²βˆˆ(tβˆ’1(E))xy'\in(t^{-1}(E))^{x} if and only if (yβ€²,x)∈tβˆ’1(E)(y',x)\in t^{-1}(E), that is, (x,yβ€²)∈E(x,y')\in E, that is, yβ€²βˆˆExy'\in E_{x}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…