If A is any set , prove that :
A⊈ϕ⇔A=ϕ.
The symbol ′⇔′ stands for if and only if (in short if).
In order to show that two sets A and B are equal we show that A⊈B and B⊈A.
We have A⊈ϕ, ∵ is a subset of every set.
∴ϕ⊈A
Hence A = ϕ
To show the backward implication, suppose that A = ϕ
∵ every set is a subset of itself
∴ϕ=A⊆ϕ.
Hence, proved.