Class: CSE 16 Subject: computer-science discrete-math Date: 2024-11-14 Teacher: Prof. Musacchio
Disproof
How to disprove ∀ x ∈ S, P(x).
- Produce an example of an that makes false.
How to disprove P(x) ⇒ Q(x).
- Produce an example of an that makes ) true and false.
Example: Either prove or disprove the following conjecture.
- Conjecture If and are sets, then .
- Disproof. This conjecture is false because of the following counterexample.
- Let , and . Notice that and , so .