Calc
FreshVar()
FreshVars()
Inductive()
Lemma()
NewType()
PTheorem()
Proof
QExists()
QForAll()
QImplies()
Struct()
Theorem()
axiom()
cond()
define()
prove()
search()
simp()
Fin()
DeclareFunction()
HasType()
Id()
Pi()
Program()
ProgramState
TExists()
TForAll()
ann()
axiom_sig()
has_type()
normalize()
open_binder()
prove_sig()
subsort_domain()
>>> m = smt.Int("m") >>> Fin(3) Lambda(x, And(Lambda(n, n >= 0)[x], x < 3)) >>> kd.prove(smt.Not(smt.Exists([m], Fin(0)[m]))) |= Not(Exists(m, Lambda(x, And(Lambda(n, n >= 0)[x], x < 0))[m]))