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

Theorem 2nalexn 1752
Description: Part of theorem *11.5 in [WhiteheadRussell] p. 164. (Contributed by Andrew Salmon, 24-May-2011.)
Assertion
Ref Expression
2nalexn (¬ ∀𝑥𝑦𝜑 ↔ ∃𝑥𝑦 ¬ 𝜑)

Proof of Theorem 2nalexn
StepHypRef Expression
1 df-ex 1702 . . 3 (∃𝑥𝑦 ¬ 𝜑 ↔ ¬ ∀𝑥 ¬ ∃𝑦 ¬ 𝜑)
2 alex 1750 . . . 4 (∀𝑦𝜑 ↔ ¬ ∃𝑦 ¬ 𝜑)
32albii 1744 . . 3 (∀𝑥𝑦𝜑 ↔ ∀𝑥 ¬ ∃𝑦 ¬ 𝜑)
41, 3xchbinxr 325 . 2 (∃𝑥𝑦 ¬ 𝜑 ↔ ¬ ∀𝑥𝑦𝜑)
54bicomi 214 1 (¬ ∀𝑥𝑦𝜑 ↔ ∃𝑥𝑦 ¬ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 196  wal 1478  wex 1701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734
This theorem depends on definitions:  df-bi 197  df-ex 1702
This theorem is referenced by:  spc2gv  3282  hashfun  13167  spc2d  29174  pm11.52  38089  2exanali  38090
  Copyright terms: Public domain W3C validator