Singleton (set theory)/Definition
From Maths
< Singleton (set theory)
Revision as of 15:57, 8 March 2017 by Alec (Talk | contribs) (Created page with "<noinclude> {{Requires references|grade=B|msg=Would be good to get this confirmed.}} __TOC__ ==Definition== </noinclude>Let {{M|X}} be a set. We call {{M|X}} a ''singleton...")
Grade: B
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
The message provided is:
The message provided is:
Would be good to get this confirmed.
Contents
Definition
Let [ilmath]X[/ilmath] be a set. We call [ilmath]X[/ilmath] a singleton if:
- [ilmath]\exists t[t\in X\rightarrow\forall s(s\in X\rightarrow s\eq t)][/ilmath]
- In words: [ilmath]X[/ilmath] is a singleton if: there exists a thing such that ( if the thing is in X then forall stuff ( if that stuff is in [ilmath]X[/ilmath] then the stuff is the thing ) )
References
