A pair of identical elements is a singleton
From Maths
Contents
[hide]Statement
Let t be a set. By the axiom of pairing we may construct a unique (unordered) pair, which up until now we have denoted by {t,t}. We now show that {t,t} is a singleton, thus justifying the notation:
- {t} for a pair consisting of the same thing for both parts.
Formally we must show:
- ∃x[x∈{t,t}∧∀y(y∈{t,t}→y=x)] (as per definition of singleton
Proof of claim
[<collapsible-expand>]
Recall the definition: for singleton
TODO: When the paring axiom has a page, do the same thing
- ∀A∀B∃C∀x(x∈C↔x=A∨x=B) this is the pairing axiom, in this case A and B are t and C is the (it turns out unique) set {t,t}
- To show they are equivalent we must use the axiom of extensionality
- TODO: until it has a page, use:∀X∀Y(∀u(u∈X↔u∈Y)→X=Y) (to compare sets X and Y
-
Proof body
Grade: A*
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
This proof has been marked as an page requiring an easy proof
The message provided is:
Would be good to have.
I did it on paper with paring given slightly differently:
- ∀A∀B∃C[A∈C∧B∈C∧∀x[x∈C⟹(c=A∨c=B)]]
This proof has been marked as an page requiring an easy proof
Notes
- Jump up ↑ Note that:
- ∃t[t∈X→∀s(s∈X→s=t)]
- Jump up ↑ see rewriting for-all and exists within set theory
References