Metamath Proof Explorer


Theorem exnelv

Description: For any set x , there is a set not contained in x . The proof is based on Russell's paradox. (Contributed by NM, 23-Aug-1993) Remove use of ax-12 and ax-13 . (Revised by BJ, 31-May-2019) Extract from nalset . (Revised by Matthew House, 12-Apr-2026)

Ref Expression
Assertion exnelv 𝑦 ¬ 𝑦𝑥

Proof

Step Hyp Ref Expression
1 ax-sep 𝑦𝑧 ( 𝑧𝑦 ↔ ( 𝑧𝑥 ∧ ¬ 𝑧𝑧 ) )
2 elequ1 ( 𝑧 = 𝑦 → ( 𝑧𝑥𝑦𝑥 ) )
3 elequ2 ( 𝑧 = 𝑦 → ( 𝑧𝑧𝑧𝑦 ) )
4 3 notbid ( 𝑧 = 𝑦 → ( ¬ 𝑧𝑧 ↔ ¬ 𝑧𝑦 ) )
5 2 4 anbi12d ( 𝑧 = 𝑦 → ( ( 𝑧𝑥 ∧ ¬ 𝑧𝑧 ) ↔ ( 𝑦𝑥 ∧ ¬ 𝑧𝑦 ) ) )
6 5 bibi2d ( 𝑧 = 𝑦 → ( ( 𝑧𝑦 ↔ ( 𝑧𝑥 ∧ ¬ 𝑧𝑧 ) ) ↔ ( 𝑧𝑦 ↔ ( 𝑦𝑥 ∧ ¬ 𝑧𝑦 ) ) ) )
7 pclem6 ( ( 𝑧𝑦 ↔ ( 𝑦𝑥 ∧ ¬ 𝑧𝑦 ) ) → ¬ 𝑦𝑥 )
8 6 7 biimtrdi ( 𝑧 = 𝑦 → ( ( 𝑧𝑦 ↔ ( 𝑧𝑥 ∧ ¬ 𝑧𝑧 ) ) → ¬ 𝑦𝑥 ) )
9 8 spimvw ( ∀ 𝑧 ( 𝑧𝑦 ↔ ( 𝑧𝑥 ∧ ¬ 𝑧𝑧 ) ) → ¬ 𝑦𝑥 )
10 1 9 eximii 𝑦 ¬ 𝑦𝑥