Hi,

I have an example for why coNP is in NP (and therefore coNP=NP):

Suppose L in coNP, therefore not(L) is in NP and has a non-deterministic TM which decides it in polynomial time: M.

Let us build M' which on input x runs M, accepts if M rejects and rejects if M accepts.

I don't think that what I said is correct, but I am not sure where is the problem.

Help? :)