2.5 What is a theory?

A theory consists in a container of rules, written in theory language 1.

Rules are named t.n, with

Example:


 
THEORY th1 IS  
 
    binhyp(a: B) &  
    binhyp(B<: C)  
    =>  
    a: C;  
 
 
    btest(0<=-t)  
    =>  
    0<=t**2 - 4*t + 1  
 
END  
 


The prover always tries to apply higher index rules before lower index rules (from the “ bottom” of the theory to the “top”).