Productive set ($W_e\subseteq P⟹p(e)\downarrow \in P\setminus W_e$)

A set $P$ is productive when a partial computable function returns an element of $P$ outside any computably enumerable subset supplied by its index. The function must halt for every index of a subset of $P$, including finite subsets. Productive sets are not computably enumerable.

Uniformly diagonalize against the formula expressing membership in $W_e$ to obtain a sentence saying that its own code is not in $W_e$. If every enumerated sentence is true, this new sentence cannot be enumerated, and hence is true. Its code is a computable new element of arithmetic truth outside $W_e$.