lean2/library/data/set/set.md

data.set
========

Subsets of an arbitrary type.

* [basic](basic.lean) : unions, intersections, etc.
* [comm_semiring](comm_semiring.lean)
* [function](function.lean) : functions from one set to another
* [map](map.lean) : set functions bundled with their domain and codomain
* [finite](finite.lean) : the "finite" predicate on sets
* [card](card.lean) : cardinality (for finite sets)
* [filter](filter.lean) : filters on sets
* [classical_inverse](classical_inverse.lean) : inverse functions, defined classically
refactor(library/data/set): expand set.lean to set directory 2015-04-05 13:27:15 +00:00			`data.set`
			`========`

			`Subsets of an arbitrary type.`

feat(library/data/set): add theory of functions and maps between sets 2015-04-07 16:41:52 +00:00			`* [basic](basic.lean) : unions, intersections, etc.`
feat(library/data/set/finite): start the theory of finite sets 2015-08-05 02:46:22 +00:00			`* [comm_semiring](comm_semiring.lean)`
feat(library/data/set): add theory of functions and maps between sets 2015-04-07 16:41:52 +00:00			`* [function](function.lean) : functions from one set to another`
			`* [map](map.lean) : set functions bundled with their domain and codomain`
feat(library/data/set/finite): start the theory of finite sets 2015-08-05 02:46:22 +00:00			`* [finite](finite.lean) : the "finite" predicate on sets`
feat(library/data/nat/bigops,library/data/set/card,library/*): add set versions of bigops for nat This required splitting data/set/card.lean from data/set/finite.lean, to avoid dependencies 2015-08-08 20:50:22 +00:00			`* [card](card.lean) : cardinality (for finite sets)`
feat(library/data/set/filter): add filters, show they form a complete lattice 2015-08-10 01:51:59 +00:00			`* [filter](filter.lean) : filters on sets`
feat(library/data/set): add theory of functions and maps between sets 2015-04-07 16:41:52 +00:00			`* [classical_inverse](classical_inverse.lean) : inverse functions, defined classically`