Rewriting under binders. As typeclass resolution is extensible using tactics, this allows users to define general ways to solve morphism constraints. An example extension to the base algorithm is the ability to define one relation as a subrelation of another so that morphism declarations on one relation can be used automatically for the other.
The work is a complete rewrite of the previous implementation, based on the typeclass infrastructure. There is a similar tactic field for simplifying values in fields by conversion to fractions over rings.
The fourier tactic uses Fourier's method to prove inequalities over real numbers, which are axiomatized in the Coq standard library. For example using lists to denote finite sets drive to difficulties since two non convertible terms can denote the same set. The table of setoid theories is compatible with the Coq sectioning mechanism.
That is, omega proves any goal that follows from looking only at parts of that goal that can be interpreted as propositional formulas whose atomic formulas are basic comparison operations on natural numbers or integers, with operands built from constants, variables, addition, and subtraction with multiplication by a constant available as a shorthand for addition or subtraction.
Error messages: Not a valid setoid theory.