Proof Techniques

Now that we know what connectives and quantifiers are, we can put that knowledge to use to figure out how to prove when statements of the form "For all x in D, if p(x), then q(x)" are true (or demonstrate that they are false).