Calc
Inductive()
Lemma
NewType()
Proof
QExists()
QForAll()
Struct()
axiom()
cond()
define()
prove()
search()
simp()
Set()
diff()
inter()
member()
subset()
union()
Set difference. >>> IntSet = Set(smt.IntSort()) >>> A = smt.Const(“A”, IntSet) >>> kd.prove(diff(A, A) == IntSet.empty) |- setminus(A, A) == K(Int, False)
A (ArrayRef)
B (ArrayRef)
ArrayRef