mathlib documentation

tactic.omega.int.preterm

source
meta inductive omega.int.exprterm  :
Type

The shadow syntax for arithmetic terms. All constants are reified to cst (e.g., -5 is reified to cst -5) and all other atomic terms are reified to exp (e.g., -5 * (gcd 14 -7) is reified to exp -5 \(gcd 14 -7)).expaccepts a coefficient of typeint` as its first argument because multiplication by constant is allowed by the omega test.

source
@[protected, instance]
meta def omega.int.preterm.has_reflect  :
has_reflect omega.int.preterm
source
@[protected, instance]
def omega.int.preterm.inhabited  :
inhabited omega.int.preterm
source
inductive omega.int.preterm  :
Type

Similar to exprterm, except that all exprs are now replaced with de Brujin indices of type nat. This is akin to generalizing over the terms represented by the said exprs.

source
@[simp]
def omega.int.preterm.val (v : ℕ → ℤ) :
omega.int.preterm → ℤ

Preterm evaluation

Equations
source
def omega.int.preterm.fresh_index  :
omega.int.preterm → ℕ

Fresh de Brujin index not used by any variable in argument

Equations
source
@[simp]
def omega.int.preterm.add_one (t : omega.int.preterm) :
omega.int.preterm
Equations
source
def omega.int.preterm.repr  :
omega.int.preterm → string
Equations
source
@[simp]
def omega.int.canonize  :
omega.int.preterm → omega.term

Return a term (which is in canonical form by definition) that is equivalent to the input preterm

Equations
source
@[simp]
theorem omega.int.val_canonize {v : ℕ → ℤ} {t : omega.int.preterm} :
omega.term.val v (omega.int.canonize t) = omega.int.preterm.val v t