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

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

Proof of Theorem nalset
StepHypRef Expression
1 alexn 1865 . 2 (∀𝑥𝑦 ¬ 𝑦𝑥 ↔ ¬ ∃𝑥𝑦 𝑦𝑥)
2 exnelv 5263 . 2 𝑦 ¬ 𝑦𝑥
31, 2mpgbi 1818 1 ¬ ∃𝑥𝑦 𝑦𝑥
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wal 1558  wex 1799
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-sep 5246
This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800
This theorem is referenced by:  vnexOLD  5268  iota0ndef  47630  aiota0ndef  47688
  Copyright terms: Public domain W3C validator