### The Prove it! Math Academy summer program will not be offered in 2021. Big changes are in the works to provide our unique curriculum and high-quality resources to a wider audience of math enthusiasts in 2022. Check this site for updates or follow us on Facebook for announcements.

• 1. Carefully read section 6.10 of the Lecture Notes linked to belown on deriving rules of inference from theorems and definitions. See if you can derive the template form of the rule of inference for induction on page 30 from a rule of inference that has no premises and concludes axiom N4, using the rules in section 6.10.
• 2. Prove the following using only the rules of natural deduction for predicate logic given in the lecture notes. Your proof should be written in the semiformal proof style using any of the shortcuts we went over. All quantified variables represent natural numbers. Note that Lurch does not have the Peano Axioms built in (though you could define them if you wanted to.) Feel free to ask an instructor for help if you get stuck.
• a. Nonzero implies successor. $\forall n,n\neq 0\Rightarrow \exists m, n=\sigma(m)$
• b. No number is it’s own successor. $\forall n,n\neq \sigma(n)$
• c. Associativity of Addition. $\forall n,\forall m, \forall p, (n+m)+p=n+(m+p)$