- put declarations inside a structure (NominalPermeq)
- dynamic_thm(s) now looks up theorems in theory
associated with proof state (rather than in context
associated with simpset)
- finite_guess_tac now automatically adds some extra
rules about supp to the simpset
Bool = FOL +
types bool 0
arities bool :: term
consts tt,ff :: "bool"
end