This exports a predicate for checking whether a name should be made visible in auto-completion and other tactics that suggest names to insert into Lean code.
The exact?
tactic is an example of a tactic that benefits from this
functionality. exact?
finds lemmas in the environment to use to
prove a theorem, but it needs to avoid inserting references to theorems
with unstable names such as auxiliary lemmas that could change with
minor unintentional modifications to definitions.
It uses a blacklist environment extension to enable names in an environment to be specifically hidden.
Instances For
Return true if completion is allowed for name.