Every discrete math book I've ever seen has a strong proof component; it's supposed to be an undergraduate's introduction to rigor. The classes taught out of those books may not actually be that rigorous, depending on whether the students are going to be expected to rigorously prove things later, or if it's just Leetcode combinatorics.
But for a guess, maybe Kenneth Rosen?