Does security against a CCA1 attacker imply security against a CPA attacker?
Simply consider the two games and a reduction between them. From the contapositive you need to show that every attacker against CPA yields a CCA1 one. Now, from every CPA adversary you can always construct an adversary that breaks CCA1 but simply makes/requires no decryption query (clearly the same holds for CCA2).