Definitions and Properties of the Join and Meet of Subsets

Artur Kornilowicz

Institute of Mathematics, Warsaw University, Bialystok

Summary.

This paper is the continuation of formalization of [4]. The definitions of meet and join of subsets of relational structures are introduced. The properties of these notions are proved.

This work was partially supported by Office of Naval Research Grant N00014-95-1-1336.

MML Identifier: YELLOW_4

Contents (PDF format)

1. Preliminaries
2. The Join of Subsets
3. The Meet of Subsets

Bibliography

[1] Grzegorz Bancerek. Complete lattices. Journal of Formalized Mathematics, 4, 1992.

[2] Grzegorz Bancerek. Bounds in posets and relational substructures. Journal of Formalized Mathematics, 8, 1996.

[3] Grzegorz Bancerek. Directed sets, nets, ideals, filters, and maps. Journal of Formalized Mathematics, 8, 1996.

[4] G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, and D.S. Scott. \em A Compendium of Continuous Lattices. Springer-Verlag, Berlin, Heidelberg, New York, 1980.

[5] Adam Grabowski and Robert Milewski. Boolean posets, posets under inclusion and products of relational structures. Journal of Formalized Mathematics, 8, 1996.

[6] Artur Kornilowicz. Cartesian products of relations and relational structures. Journal of Formalized Mathematics, 8, 1996.

[7] Beata Padlewska and Agata Darmochwal. Topological spaces and continuous functions. Journal of Formalized Mathematics, 1, 1989.

[8] Andrzej Trybulec. Tarski Grothendieck set theory. Journal of Formalized Mathematics, Axiomatics, 1989.

[9] Wojciech A. Trybulec. Partially ordered sets. Journal of Formalized Mathematics, 1, 1989.

[10] Zinaida Trybulec. Properties of subsets. Journal of Formalized Mathematics, 1, 1989.