A specification language used in the context of an effective theorem p
rover can provide novel features that enhance precision and expressive
ness. in particular, typechecking for the language can exploit the ser
vices of the theorem prover. We describe a feature called ''predicate
subtyping'' that uses this capability and illustrate its utility as me
chanized in PVS.