Calc
FreshVar()
FreshVars()
Inductive()
Lemma()
NewType()
PTheorem()
Proof
QExists()
QForAll()
QImplies()
Struct()
Theorem()
axiom()
cond()
define()
prove()
search()
simp()
vprove()
ForAllI()
Goal
LemmaCallback
ProofState
ProofStateProxy
auto()
forallI()
open_binder()
simp_tac()
skolem()
subst()
Prove a theorem using an egraph-based solver.
>>> x = smt.Int("x") >>> vprove(x + 1 > x) |= x + 1 > x
thm (BoolRef)