Here's the question you clicked on:
lgbasallote
why is \(p \vee T \equiv T\)? can it be proven?
aside from stating "domination law" of course
not familiar with this cant help u :(
i assume i do this... \[\huge \begin{array}{c|c|c|} \hline p &T &p \vee T\\ \hline\\T & T &T \\ F &T&T\end{array}\]