Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
eqtrans()
Defn
LemmaError
andI()
beta_conv()
cong()
consider()
define_fix()
defns
einstan()
eqrefl()
eqsym()
forget()
forget2()
fresh_const()
herb()
induct_inductive()
instan()
instan2()
is_defined()
is_proof()
modus()
proj()
skolem()
subst()
Prove transitivity of equality
>>> x, y, z = smt.Ints("x y z") >>> eq1 = axiom(x == y) >>> eq2 = axiom(y == z) >>> eqtrans(eq1, eq2) |- x == z
eq1 (Proof)
eq2 (Proof)