Calc
FreshVar()
FreshVars()
Inductive()
Lemma()
NewType()
PTheorem()
Proof
QExists()
QForAll()
QImplies()
Struct()
Theorem()
axiom()
cond()
define()
prove()
search()
simp()
open_binder()
ForAllI()
Goal
LemmaCallback
ProofState
auto()
forallI()
simp_tac()
skolem()
subst()
Open a proof with schematic variables so that it can be reconstructed.
>>> x,y,z = smt.Reals("x y z") >>> pf = kd.prove(smt.ForAll([x,y], x + y + 1 > x + y)) >>> open_binder(pf) ([x!..., y!...], |= x!... + y!... + 1 > x!... + y!...)
pf (Proof)
tuple[list[ExprRef], Proof]