Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
ForAllI()
Goal
LemmaCallback
SchemaVars()
forallI()
simp_tac()
subst()
All vs must be SchemaVars Combinator name tries to make it clear that this is a smt.ForAll that works on Proofs instead of BoolRefs.
vs (list[ExprRef])
pf (Proof)