[Math] How to define a truth set that is the entire domain in logic

Question

I just have a question regarding how to define a truth set for the following:
Suppose the domain is all integers Z, and the statement is true for all integers in the domain.

How would i define the truth set?
The way i have been writing them is {x E Z| x = 2k} – example for even integers.
But i am not sure how you would define all of the domain.

thanks heaps
Corey 🙂

Answer 1

How about $\{x: x=x\}$? (Or, making the domain explicit, $\{x\in D: x=x\}$.)