Introducing Euclidean Relations to Mizar

Abstract

Abstract-In this paper we present the methodology of implementing a new enhancement of the Mizar proof checker based on enabling special processing of Euclidean predicates, i.e. binary predicates which fulfill a specific variant of transitivity postulated by Euclid. Typically, every proof step in formal mathematical reasoning is associated with a formula to be proved and a list of references used to justify the formula. With the proposed enhancement, the Euclidean property of given relations can be registered during their definition, and so the verification of some proof steps related to these relations can be automated to avoid explicit referencing.