- #1

- 35

- 0

{x[itex]\in[/itex]S : [itex]\exists[/itex]y[itex]\in[/itex]x, y[itex]\in[/itex]W}

S is a set of pairs of symbols (tuples of length 2 is the technical term I believe). W is a set of symbols.

What I want is the set of pairs in S that contain at least 1 symbol from set W.

Does my set builder notation correctly describe what I'm looking for? I don't necessarily have to use set builder notation; I just can't think of a way to describe it with unions, intersections, and quantifiers.