CSE 215 Lecture Notes - Lecture 6: Venn Diagram

• School: Stony Brook University
• Department: Computer Science
• Course: CSE 215
• Professor: Gupta

Document Summary

Let "e" be the exists in the set symbol. X e d, p(x) == x, (x e d) -> p(x) Left side: for all x in the domain, p(x) is true. Right side: for all x where x is inside the domain, p(x) is true. We can illustrate this concept by drawing a venn diagram where a bunch of dots that represent all elements in d is inside a circle with other dots outside the circle. This means that for all p(x) that are inside the circle, p(x) is true. X e d, p(x) == x, ((x e d) ^ p(x)) The statement above can be made always true as long as domain d is not the set of universal numbers (or in general, by making the premise or left condition false). Let"s say we let d be the set of integers.