I am new in complexity theory and this question is a part of a homework that I have and I am stuck on it.Let ${\sf coNP}$ be the class of languages $\{\overline{L}: L \in {\sf NP} \}$.Show that if ${\sf NP} \neq {\sf coNP}$, then ${\sf P}\neq  {\sf NP}$.
Proving that if coNP $\neq$ NP then P $\neq$ NP
complexity theory;complexity classes;np;p vs np