Results 1 to 2 of 2

Math Help - Proving unions by Algebra of Sets

  1. #1
    Newbie
    Joined
    Nov 2007
    Posts
    7

    Proving unions by Algebra of Sets

    Yikes...help please if you can:
    1. Prove B-(A U B)=0 Note "0" here is the empty set

    2. Prove if A Intersect B =A, then A is a subset of B Note: This is not to be proven by Algebra of Sets, rather treated as a proof of a biconditional proposition.
    Last edited by IIuvsnshine; November 18th 2007 at 03:09 AM. Reason: changing the 2nd problem
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by IIuvsnshine View Post
    Yikes...help please if you can:
    1. Prove B-(A U B)=0 Note "0" here is the empty set
    .
    If x\in B then x\in (A\cup B) so B has all its elements in A\cup B so the set difference is zero.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Proving Sets
    Posted in the Algebra Forum
    Replies: 2
    Last Post: July 8th 2011, 05:40 PM
  2. Sets containing unions, and vice versa
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 20th 2011, 08:27 AM
  3. Proving Sets
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: February 28th 2010, 02:22 AM
  4. Sigma Algebra is closed under countable increasing unions
    Posted in the Differential Geometry Forum
    Replies: 1
    Last Post: September 19th 2009, 08:27 PM
  5. Infintie unions of closed sets in R
    Posted in the Calculus Forum
    Replies: 5
    Last Post: October 22nd 2008, 04:20 PM

Search Tags


/mathhelpforum @mathhelpforum