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

Theorem alex 1750
Description: Universal quantifier in terms of existential quantifier and negation. Theorem 19.6 of [Margaris] p. 89. (Contributed by NM, 12-Mar-1993.)
Assertion
Ref Expression
alex (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)

Proof of Theorem alex
StepHypRef Expression
1 notnotb 304 . . 3 (𝜑 ↔ ¬ ¬ 𝜑)
21albii 1744 . 2 (∀𝑥𝜑 ↔ ∀𝑥 ¬ ¬ 𝜑)
3 alnex 1703 . 2 (∀𝑥 ¬ ¬ 𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)
42, 3bitri 264 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:  exnal  1751  2nalexn  1752  alimex  1755  19.3v  1894  nfa1  2025  sp  2051  exists2  2561  19.9alt  33771  pm10.253  38082  vk15.4j  38255  vk15.4jVD  38672
  Copyright terms: Public domain W3C validator