MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nalset Structured version   Visualization version   GIF version

Theorem nalset 5277
Description: No set contains all sets. Theorem 41 of [Suppes] p. 30. (Contributed by NM, 23-Aug-1993.) Extract exnelv 5276. (Revised by Matthew House, 12-Apr-2026.)
Assertion
Ref Expression
nalset ¬ ∃𝑥𝑦 𝑦𝑥
Distinct variable group:   𝑥,𝑦

Proof of Theorem nalset
StepHypRef Expression
1 alexn 1875 . 2 (∀𝑥𝑦 ¬ 𝑦𝑥 ↔ ¬ ∃𝑥𝑦 𝑦𝑥)
2 exnelv 5276 . 2 𝑦 ¬ 𝑦𝑥
31, 2mpgbi 1828 1 ¬ ∃𝑥𝑦 𝑦𝑥
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wal 1568  wex 1809
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-sep 5257
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810
This theorem is referenced by:  vnexOLD  5281  iota0ndef  47776  aiota0ndef  47834
  Copyright terms: Public domain W3C validator