I have to argue that a given logical expression is satisfiable and not universally applicable. This is quite easy because all I have to do is find for which values is the expression true and false. However, I want to know how to write the solution formally. For example, let's say that we have the following expression:
$$\alpha_i := X \lor \lnot X$$
Due to the the laws of contradiction, we know that the expression is always true. But if I want to say that: "Let $X=T$ , $T$ is shorthand for TRUTH". How can I let $X$ take on the value of TRUTH?
This might be badly explained, but essentially I want to know how to formally write "let $X$ take on the value of TRUTH".