Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
forallI()
Goal
simp_tac()
subst()
Open a forall quantifier but giving a new goal and fresh variables to a callback function.
>>> x = smt.Int("x") >>> forallI(smt.ForAll([x], x > x - 1), lambda goal, x1: kd.prove(goal)) |- ForAll(x, x > x - 1)
e (QuantifierRef)
cb (Callable[[BoolRef, ExprRef], Proof])