Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
instan2()
Defn
LemmaError
beta_conv()
consider()
define_fix()
defns
einstan()
forget()
forget2()
fresh_const()
herb()
induct_inductive()
instan()
is_defined()
is_proof()
skolem()
Instantiate a universally quantified formula forall xs, P(xs) -> P(ts) This is forall elimination
ts (Sequence[ExprRef])
thm (BoolRef)