Help Proving This Set-Based Theorem

Greetings,

I'm not sure how in-depth this community goes into discrete math (also, as far as I know discrete math varies depending on the school and location) but I'm having trouble proving this theorem.

S x T subset S x U /\ S =! 0set implies T subset U

where x is any arbitrary set operator, and /\ is and.

Thanks.. Hope I supplied enough information.

Re: Help Proving This Set-Based Theorem

Quote:

Originally Posted by

**RobertXIV** where x is any arbitrary set operator, and /\ is and.

Are you sure x is not Cartesian product?

Re: Help Proving This Set-Based Theorem

Indeed, emakarov is correct. Sorry about that one :P.

Re: Help Proving This Set-Based Theorem

Then do you need further help with this problem?

Re: Help Proving This Set-Based Theorem

Any member of S X T is of the form (s, t) where x S and t T. If that is a subset of S X ( U S) then t .

Re: Help Proving This Set-Based Theorem

I take it you mean s is an element of S, not x, correct?

If so, this helps.

Thank you!

Re: Help Proving This Set-Based Theorem