ΘρϵηΠατπ

cartesian product
Suppose that A,B are set, then we define A×B:={(a,b):aA,bB}
intersection and cartesian product commute
Given sets A,B,C,D, then (A×B)(C×D)=(AC)×(BD)

We will prove this true by the definition of set equality.

Suppose that (x,y)(A×B)(C×D), which is true iff (x,y)(A×B), so that xA and yB.

We also know that (x,y)(C×D) which is equivalent to xC and yD

We have xAC and yBD which is equivalent to (x,y)(AC)×(BD).

Thus we've proven that (x,y)(A×B)(C×D) if and only if (x,y)(A×B)(C×D) as needed.

cartesian product distributes over intersection
Given sets A,B,C, then (AB)×C=(A×C)(B×C)
We will show their equality directly

So suppose that (x,y)(AB)×C, which is true iff xAB and yC, which is true iff (x,y)A×C and (x,y)B×C, which is true iff x(A×C)(B×C).

Therefore (x,y)(AB)×C if and only if x(A×C)(B×C), so (AB)×C=(A×C)(B×C) as needed.

Set Power
Suppose that A is a set, and that n1, then we define An to be the set of all n-tuples of A, that is : An:={(a1,a2,...,an):i[n],aiA}