Prove that $a ⊈ {a}$, where $a$ is non-empty

I show it like this.

Assume, $a subseteq {a}$

Let $x in a.~$ Then $x in {a} (∵ a subseteq {a})$

And we know $a in {a}$

$therefore x in a in {a}$

$∴ x ∉ {a}$.

This is a contradiction!

$a subseteq {a}$ is false.$~∴ a ⊈ {a}$ is true.

Is this method right or wrong? If there is another way to prove it?

Mathematics Asked by Galaxylokka on November 12, 2021

1 Answers

One Answer

No, it is incorrect. For one thing: the inclusion $asubseteq{a}$ is obviously true if $a=emptyset$.

If you assume that $aneemptyset$, then your idea works, but for a different reason than you believe. If $xin a$, then $xin{a}$, by transitivity of inclusion, hence $x=a$. Thus $ain a$, which is ruled out by the axiom of foundation (or regularity).

If the axiom of foundation is not assumed, then it is impossible to prove the statement (when restricted to nonempty $a$), because there might exist sets such that $a={a}$.

Answered by egreg on November 12, 2021

Add your own answers!

Related Questions

Isometric mapping of two subsets in a metric space

1  Asked on December 28, 2020 by user856180


Understanding the proof of $cl(cl(A))=cl(A)$

1  Asked on December 27, 2020 by averroes2


The Range of Taxi Fares

1  Asked on December 25, 2020 by cameron-chandler


Can someone help me with this other limit?

2  Asked on December 25, 2020 by toni-rivera-vargas


Ask a Question

Get help from others!

© 2021 All rights reserved.