I want to rigorously show that [$(p \rightarrow q)\equiv(q \rightarrow q)$] is not true.
$Let A =(p \rightarrow q), B =(q \rightarrow q)$
I tried to prove this by supposing $A$ and showing that $B$ does not follow.
[$(p \rightarrow q) \rightarrow (q \rightarrow p)$]
I expanded that but it didn't $= 0$
I was told to look at Reductio Ad Absurdum, but I don't see how that applies in this case.
This is a real-world example. This is not homework.