Why Church-encoded types aren't sufficient to express inductive proofs?

Question

I've heard some claims that the calculus of constructions without inductive types isn't powerful enough to express proofs by induction. Is that correct? If so, why isn't the Church-encoding sufficient for that?