| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nalset | Structured version Visualization version GIF version | ||
| Description: No set contains all sets. Theorem 41 of [Suppes] p. 30. (Contributed by NM, 23-Aug-1993.) Extract exnelv 5278. (Revised by Matthew House, 12-Apr-2026.) |
| Ref | Expression |
|---|---|
| nalset | ⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | alexn 1872 | . 2 ⊢ (∀𝑥∃𝑦 ¬ 𝑦 ∈ 𝑥 ↔ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥) | |
| 2 | exnelv 5278 | . 2 ⊢ ∃𝑦 ¬ 𝑦 ∈ 𝑥 | |
| 3 | 1, 2 | mpgbi 1825 | 1 ⊢ ¬ ∃𝑥∀𝑦 𝑦 ∈ 𝑥 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∀wal 1565 ∃wex 1806 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-sep 5261 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 |
| This theorem is referenced by: vnexOLD 5283 iota0ndef 47664 aiota0ndef 47722 |
| Copyright terms: Public domain | W3C validator |