Uniformly diagonalize against the formula expressing membership in We to obtain a sentence saying that its own code is not in We. 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 We.