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

Theorem 2exnaln 1861
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 1812 . 2 (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥 ¬ ∃𝑦𝜑)
2 alnex 1813 . . 3 (∀𝑦 ¬ 𝜑 ↔ ¬ ∃𝑦𝜑)
32albii 1851 . 2 (∀𝑥∀𝑦 ¬ 𝜑 ↔ ∀𝑥 ¬ ∃𝑦𝜑)
41, 3xchbinxr 338 1 (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1567  ∃wex 1811
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841
This proof depends on definitions:  df-bi 210  df-ex 1812
This theorem is used by:  2nexaln  1862  excomimw  2076  exexw  2085  excom  2198  opab0  5528  bj-modal4e  37712
  Copyright terms: Public domain W3C validator