Class: CSE 16 Subject: computer-science discrete-math Date: 2024-11-13 Teacher: Prof. Musacchio

Proofs Involving Sets

Introduction

  • Recall (Definition 1.3) that if and are sets, then means that every element of is also an element of . In other words, it means if , then .
  • Therefore to prove that , we just need to prove that the conditional statement “If a ∈ A, then a ∈ B” is true.

Example

  • Prove that
    • Proof. Suppose .
    • By definition of intersection, this means and .
    • Since we know , so for some .
    • Thus a is even. Since we know , so for some .
    • As a is even, implies is even. (Otherwise would be odd.)
    • Then for some integer , and we have .
    • From , we conclude , and this means .
  • We have shown that implies , so it follows that .