This lecture covers the proof and applications of the inclusion-exclusion formula in discrete mathematics. The formula is demonstrated through examples, including the computation of permutations without fixed points and Euler's totient function. The lecture also explores the hat-check girl problem and the probability of nobody receiving their own hat back.