Singleton (set theory)/Definition
From Maths
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:
Book reference would be great!
Contents
[hide]Definition
Let X be a set. We call X a singleton if[1]:
- ∃t[t∈X∧∀s(s∈X→s=t)]Caveat:See:[Note 1]
- In words: X is a singleton if: there exists a thing such that ( the thing is in X and for any stuff ( if that stuff is in X then the stuff is the thing ) )
More concisely this may be written:
- ∃t∈X∀s∈X[t=s][Note 2]
Notes
- Jump up ↑ Note that:
- ∃t[t∈X→∀s(s∈X→s=t)]
- Jump up ↑ see rewriting for-all and exists within set theory