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

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 x A and y B .

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

We have x A C and y B D which is equivalent to ( x , y ) ( A C ) × ( B D ) .

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 ( A B ) × C = ( A × C ) ( B × C )
We will show their equality directly

So suppose that ( x , y ) ( A B ) × C , which is true iff x A B and y C , 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 ) ( A B ) × C if and only if x ( A × C ) ( B × C ) , so ( A B ) × C = ( A × C ) ( B × C ) as needed.

Set Power
Suppose that A is a set, and that n N 1 , then we define A n to be the set of all n-tuples of A , that is : A n := { ( a 1 , a 2 , . . . , a n ) : i [ n ] , a i A }