NP ⊆ AM
Statement
: every language in NP has an Arthur–Merlin proof system with perfect completeness and perfect soundness — folklore.
Sketch
Merlin ignores Arthur’s coins and sends an witness, which Arthur checks with the deterministic verifier, so completeness and soundness are those of that verifier.