Let ^ be a nonempty indexing set, let A* = {A subscript alpha such that alpha is an..

Let ^ be a nonempty indexing set, let A*={A (subscript alpha) such that alpha is an element of ^} be an indexing family of sets, and let B be a set. Use the results of the theorems for indeing sets and indexing families of sets to prove :

B- ( Intersection of (alpha in the ^ <- below intersect symbol; A (subscript alpha) <- next to intersection symbol) = Union of (B-A (subscript alpha) <- next to Union symbol w/ (alpha in the ^ below intersect symbol)

How would I go about doing this proof, it is extra points on my quiz and I cannot figure it out, please help!

Re: Let ^ be a nonempty indexing set, let A* = {A subscript alpha such that alpha is

Quote:

Originally Posted by

**Brjakewa** Let ^ be a nonempty indexing set, let A*={A (subscript alpha) such that alpha is an element of ^} be an indexing family of sets, and let B be a set. Use the results of the theorems for indeing sets and indexing families of sets to prove :

B- ( Intersection of (alpha in the ^ <- below intersect symbol; A (subscript alpha) <- next to intersection symbol) = Union of (B-A (subscript alpha) <- next to Union symbol w/ (alpha in the ^ below intersect symbol)

How would I go about doing this proof, it is extra points on my quiz and I cannot figure it out, please help!

Why don't you post in LaTeX? I cannot read that.

In order to help you we need to see your work..

Post some of your own thoughts on this question.

Tell us where your are having difficulties.