quotients revisited for isabelle/hol
Higher-Order Logic (HOL) is based on a small logic kernel, whose only mechanism for extension is the introduction of safe definitions and of non-empty types. Both extensions are often performed in quotient constructions. To ease the work involved with such quotient constructions, we re-implemented in the Isabelle/HOL theorem prover the quotient package by Homeier. In doing so we extended his work in order to deal with compositions of quotients and also specified completely the procedure of lifting theorems from the raw level to the quotient level. The importance for theorem proving is that many formal verifications, in order to be feasible, require a convenient reasoning infrastructure for quotient constructions.
quotients higher-order logic isabelle theorem prover