# The following are two proofs that for all sets A and B , A − B ⊆ A . The first is less formal, and the second is more formal. Fill on the blanks. Proof: Suppose A and B are any sets. To show that A − B ⊆ A , we must show that every element in (1) is in (2) But any element in A - B is in (2) But any element in A - B is in (3) and not in (4) (by definition of A - B ). In particular, such an element is in A . Proof: Suppose A and B are any sets and x ∈ A − B . [We must shoe that (1) J By definition of A - B ). In particular, such an element is in A.

### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193

### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193

#### Solutions

Chapter
Section
Chapter 6.2, Problem 2ES
Textbook Problem

## Expert Solution

### Want to see the full answer?

Check out a sample textbook solution.See solution

### Want to see this answer and more?

Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*

See Solution

*Response times vary by subject and question complexity. Median response time is 34 minutes and may be longer for new subjects.