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

Theorem imnang 1766
Description: Quantified implication in terms of quantified negation of conjunction. (Contributed by BJ, 16-Jul-2021.)
Assertion
Ref Expression
imnang (∀𝑥(𝜑 → ¬ 𝜓) ↔ ∀𝑥 ¬ (𝜑𝜓))

Proof of Theorem imnang
StepHypRef Expression
1 imnan 438 . 2 ((𝜑 → ¬ 𝜓) ↔ ¬ (𝜑𝜓))
21albii 1744 1 (∀𝑥(𝜑 → ¬ 𝜓) ↔ ∀𝑥 ¬ (𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  wal 1478
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-an 386
This theorem is referenced by:  alinexa  1767  raln  2987  ballotlem2  30373  n0el  33665
  Copyright terms: Public domain W3C validator