In order to prove that P prime does what we want it to do, that is, accept H inverse of the language PDAP, we need to do two inductive proofs, one in each direction of the statement that characterizes the way in which P prime simulates P. We're not gonna give the proofs here. 