We did examples of modular arithmetic (Sections 4.12-4.13), including using repeated squaring to compute large modular powers with only small intermediate results.
We looked at set-builder notation, vacuous truth (set relationships involving the empty set) and some gotchas with set notation.
Finally, we did a subset inclusion proofs: the concrete example from section 5.10.