Towards a higher reasoning level in formalized Homological Algebra

We present a possible solution to some problems to mecha- nize proofs in Homological Algebra: how to deal with partial functions in a logic of total functions and how to get a level of abstraction that allows the prover to work with morphisms in an equational way.