Thread: Cartesian product over union

Prove that for any sets A, B, C, D;

(AxB)U(CxD) is a subset of (AUC) x (BUD).

Give an example to show that the reverse inclusion need not hold.

Write in symbolic form what the following means.

1. A subset (every element of one set is an element of the other).

2. An element of (AxB)U(CxD)

3. An element of (AUC) x (BUD).

The result should be a proposition consisting of logical connectives and things like or . Is this proposition true?

You will not be able to solve this problem until you know the definitions of a subset, a Cartesian product and a union and are able apply those definitions to this situation.

Thanks for your post.

I have managed to prove this now.

It is not a good habit to ask for help before doing your job or offort.
So It is wise to follow emakarov's advice.

Originally Posted by emakarov

Write in symbolic form what the following means.

1. A subset (every element of one set is an element of the other).

2. An element of (AxB)U(CxD)

3. An element of (AUC) x (BUD).

The result should be a proposition consisting of logical connectives and things like or . Is this proposition true?

You will not be able to solve this problem until you know the definitions of a subset, a Cartesian product and a union and are able apply those definitions to this situation.

There are not only Venn diagram method .I think it is vital to proof this example by using proof by definition method.