Proof of logical equivalence

I have the standard logical equivalence: $(p\rightarrow q)\wedge(q\rightarrow r)\Leftrightarrow p\rightarrow (q\wedge r)$.

Using several distributive laws I was able to get it down to: $(\neg p\wedge\neg q) \vee (\neg p\wedge r) \vee (q\wedge r)$.

I must be missing some manipulation I can do to reduce this.

-
Where did you start, where were you trying to get? "Get it down"... get what down? – Arturo Magidin Sep 23 '10 at 19:49
How about a truth table? That would be the simplest thing to do, I think. – Arturo Magidin Sep 23 '10 at 19:58
I haven't worked through the details, but it strikes me that this statement is not correct. Change the bidirectional implication to a simple implication, and it holds, however. – Noldorin Sep 24 '10 at 0:18
@Noldorin: Yes, they are not equivalent. See my answer. – Aryabhata Sep 24 '10 at 1:20
It seems clear to me that it should have been $(p\rightarrow q)\wedge (p\rightarrow r)$ on the right hand side. I checked to make sure it wasn't me who introduced the mistake when I edited the question, and it was incorrect in the original. – Arturo Magidin Sep 24 '10 at 13:53

Umm... maybe I am missing something, but

if $p$ is false, $q$ is true and $r$ is false, then we have that

$(p\rightarrow q)\wedge(q\rightarrow r)$ is false

$p\rightarrow (q\wedge r)$ is true.

So I don't see how you can prove the equivalence.

-

$$\begin{array}{|c|c|c|c|c|c|c|c|c}\hline p&q&r&p\Rightarrow q&q\Rightarrow r&(p\Rightarrow q)\land (q\Rightarrow r)&q\land r&p\Rightarrow(q\land r)&\cdots\\\hline T&T&T&T&T&T&T&T\\T&T&F&T&F&F&F&F\\T&F&T&F&T&F&F&F\\T&F&F&F&T&F&F&F\\F&T&T&T&T&T&T&T\\F&T&F&T&F&F&F&T\\F&F&T&T&T&T&F&T\\F&F&F&T&T&T&F&T\\\hline \end{array}$$

$$\begin{array}{c|c|c|}\hline \cdots&\big[(p\Rightarrow q)\land (q\Rightarrow r)\big]\iff \big[ p\Rightarrow(q\land r)\big]\\\hline &T\\&T\\&T\\&T\\&F\\&T\\&T\\\hline \end{array}$$

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8635885119438171, "perplexity": 332.4038200893095}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2016-07/segments/1454701159031.19/warc/CC-MAIN-20160205193919-00337-ip-10-236-182-209.ec2.internal.warc.gz"}