Set existence property for intuitionistic theories with dependent choice

Abstract Let TC be intuitionistic higher-order arithmetic or intuitionistic ZF (with Replacement), both with Relativized Dependent Choice, or just Countable Choice. We show that TC[boxvr]∄ x . A( x ) (closed) gives TC[boxvr]A( t ) for some comprehension term t . This solves a problem left open by Myhill in [4].