- #1

MushroomPirat

- 10

- 0

## Homework Statement

I'm self-studying Daniel Velleman's How to Prove It, and I'm wondering if there is some way to write that "Sets A and B are disjoint" using symbols, other than the [itex] A \cap B = \emptyset [/itex] given in the book.

## Homework Equations

## The Attempt at a Solution

I'm thinking that if A and B are disjoint, then for every element x, where if x is an element of A, then x is not an element of B. Or:

[itex] \forall x (x\in A \rightarrow x \notin B) [/itex]

Thanks !Edit: Right after I posted this, I realized I could just prove the equivalency, and it turned out to be a pretty trivial proof (if I did it right). So, I think this thread can be deleted now.

Last edited: