For the statement below, if you assume A is known to be true, X is known to be false, and P is not known you c

For the statement below, if you assume A is known to be true, X is known to be false, and P is not known you can still solve the truth value for the statement. Explain why:








[~P v (~P v X)] v (~P v A)For the statement below, if you assume A is known to be true, X is known to be false, and P is not known you c
The statement is true, as follows.





[~P v (~P v X)] v (~P v A). Then substitute:





[~P v (~P v false)] v (~P v true): Then substitute, based on anything OR'd with true is true.





[~P v (~P v false)] v true: Then, once again, substitute, based on anything OR'd with true is true.





true

ie