closure of Context free grammer to homomorphism using PDA


I was looking online, on sipser book, and on lecture notes and I can’t find a proof to closure of context free languages to homomorphism that using PDA instead of CFG. I’m not looking for a full and formal proof, I just want to understand the general idea.