[FOM] Post Completeness and Conservative Extensions

[Harry Deutsch]

Doesn't it follow from the fact that classical propositional logic is 
Post complete--meaning that no non-theorem in the language of classical 
PC can be added consistently--that any consistent extension of classical 
PC (classical quantification theory, for example) is conservative over 
PC?  Is this known, say, in the exercises in logic books?

Harry