Metamath Proof Explorer


Theorem bj-nsnid

Description: A set does not contain the singleton formed on it. More precisely, one can prove that a class contains the singleton formed on it if and only if it is proper and contains the empty set (since it is "the singleton formed on" any proper class, see snprc ): |- -. ( { A } e. A <-> ( (/) e. A -> A e. _V ) ) . (Contributed by BJ, 4-Feb-2023)

Ref Expression
Assertion bj-nsnid
|- ( A e. V -> -. { A } e. A )

Proof

Step Hyp Ref Expression
1 en2lp
 |-  -. ( A e. { A } /\ { A } e. A )
2 snidg
 |-  ( A e. V -> A e. { A } )
3 2 anim1i
 |-  ( ( A e. V /\ { A } e. A ) -> ( A e. { A } /\ { A } e. A ) )
4 3 ex
 |-  ( A e. V -> ( { A } e. A -> ( A e. { A } /\ { A } e. A ) ) )
5 1 4 mtoi
 |-  ( A e. V -> -. { A } e. A )