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

Theorem 2exnaln 1755
Description: Theorem *11.22 in [WhiteheadRussell] p. 160. (Contributed by Andrew Salmon, 24-May-2011.)
Assertion
Ref Expression
2exnaln (∃𝑥𝑦𝜑 ↔ ¬ ∀𝑥𝑦 ¬ 𝜑)

Proof of Theorem 2exnaln
StepHypRef Expression
1 df-ex 1704 . 2 (∃𝑥𝑦𝜑 ↔ ¬ ∀𝑥 ¬ ∃𝑦𝜑)
2 alnex 1705 . . 3 (∀𝑦 ¬ 𝜑 ↔ ¬ ∃𝑦𝜑)
32albii 1746 . 2 (∀𝑥𝑦 ¬ 𝜑 ↔ ∀𝑥 ¬ ∃𝑦𝜑)
41, 3xchbinxr 325 1 (∃𝑥𝑦𝜑 ↔ ¬ ∀𝑥𝑦 ¬ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 196  wal 1480  wex 1703
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736
This theorem depends on definitions:  df-bi 197  df-ex 1704
This theorem is referenced by:  2nexaln  1756  excom  2041  cbvex2  2279  opab0  5005  bj-modal4e  32689  bj-cbvex2v  32722
  Copyright terms: Public domain W3C validator