Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
proj()
Defn
LemmaError
andI()
beta_conv()
cong()
consider()
define_fix()
defns
einstan()
eqrefl()
eqsym()
eqtrans()
forget()
forget2()
fresh_const()
herb()
induct_inductive()
instan()
instan2()
is_defined()
is_proof()
modus()
skolem()
subst()
Project out of an And proof
>>> x = smt.Int("x") >>> p = prove(smt.And(x > x - 1, x > x - 2, x > x - 3)) >>> proj(p, 0) |- x > x - 1 >>> proj(p, 2) |- x > x - 3
p (Proof)
n (int)