Prove: A is a subset of B iff A-B= empty set
hey, how's it going?
hi there I am just cracking my head on this proof
I started but am stuck
hmm, i'm not the best at formal proofs, but let's see
A is a subset of B means that every element of A is an element of B
yes
then A-B is the set of elements in A that don't belong to set B
yeah
but since A is a subset of B, we know that every element of A is an element of B, so that means that there are no elements in A that don't belong to set B
that's a little confusing can you explain that again?
we want to know what A-B is, or the set of elements in A that don't belong to B
we started with A is a subset of B, which means that every element of A is an element of B
right I understand that so far
so for any element in A, we know that it is also in B
so for any element in A, we know that it is also in B
yes
so we are considering A-B, or the set of elements in A that don't belong to B. Let's assume element x is in A-B. that means that x is in A, and x is not in B. but we know that can't be true because for any element in A, we know it is in B. so x cannot exist! therefore A-B is the empty set.
hey, you still there?
Join our real-time social learning platform and learn together with your friends!