Some Basic Properties of Many Sorted Sets

Artur Kornilowicz

Institute of Mathematics, Warsaw University, Bialystok

MML Identifier: PZFMISC1

Contents (PDF format)

1. Preliminaries
2. Singleton and unordered pairs
3. Sum of unordered pairs (or a singleton) and a set
4. Intersection of unordered pairs (or a singleton) and a set
5. Difference of unordered pairs (or a singleton) and a set
6. Cartesian product

Bibliography

[1] Czeslaw Bylinski. Functions and their basic properties. Journal of Formalized Mathematics, 1, 1989.

[2] Czeslaw Bylinski. Some basic properties of sets. Journal of Formalized Mathematics, 1, 1989.

[3] Czeslaw Bylinski. A classical first order language. Journal of Formalized Mathematics, 2, 1990.

[4] Czeslaw Bylinski. The modification of a function by a function and the iteration of the composition of a function. Journal of Formalized Mathematics, 2, 1990.

[5] Agata Darmochwal. Finite sets. Journal of Formalized Mathematics, 1, 1989.

[6] Artur Kornilowicz. Definitions and basic properties of boolean and union of many sorted sets. Journal of Formalized Mathematics, 7, 1995.

[7] Beata Madras. Products of many sorted algebras. Journal of Formalized Mathematics, 6, 1994.

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

[9] Andrzej Trybulec. Many-sorted sets. Journal of Formalized Mathematics, 5, 1993.

[10] Edmund Woronowicz. Relations and their basic properties. Journal of Formalized Mathematics, 1, 1989.