There are two approaches to lattices used in the Mizar Mathematical Library: on the one hand, these structures are based on the set with two binary operations (with an equational characterization as in [17]). On the other hand, we may look at them as at relational structures (posets – see [12]). As the main result of this article we can state that the Mizar formalization enables us to use both approaches simultaneously (Section 3). This is especially useful because most of lemmas on ortholattices in the literature are stated in the poset setting, so we cannot use equational theorem provers in a straightforward way. We give also short equational characterization of lattices via four axioms (as it was done in [7] with the help of the Otter prover). Some corresponding results about ortholattices are also formalized.
[1]
A. Zalewska,et al.
Properties of Binary Relations
,
1990
.
[2]
Wojciech A. Trybulec.
Partially Ordered Sets
,
1990
.
[3]
Edmund Woronowicz.
Relations Defined on Sets
,
1990
.
[4]
Adam Grabowski,et al.
Robbins Algebras vs. Boolean Algebras1
,
2004
.
[5]
Edmund Woronowicz.
Relations and Their Basic Properties
,
2004
.
[6]
William McCune,et al.
Automated discovery of single axioms for ortholattices
,
2005
.
[7]
Czeslaw Bylinski.
Some Basic Properties of Sets
,
2004
.
[8]
A. Trybulec.
Tarski Grothendieck Set Theory
,
1990
.
[9]
B. Balkay,et al.
Introduction to lattice theory
,
1965
.