“Finding the proof is itself in NP” does not make sense as finding a singular proof is not something that depends on the size of its input, which is what the entire field of algorithmic complexity studies.
In general a nice way of thinking about what NP is are the set of formula that have polynomial time checkable proofs.