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

Theorem nexd 2217
Description: Deduction for generalization rule for negated wff. (Contributed by Mario Carneiro, 24-Sep-2016.)
Hypotheses
Ref Expression
nexd.1 𝑥𝜑
nexd.2 (𝜑 → ¬ 𝜓)
Assertion
Ref Expression
nexd (𝜑 → ¬ ∃𝑥𝜓)

Proof of Theorem nexd
StepHypRef Expression
1 nexd.1 . . 3 𝑥𝜑
21nf5ri 2191 . 2 (𝜑 → ∀𝑥𝜑)
3 nexd.2 . 2 (𝜑 → ¬ 𝜓)
42, 3nexdh 1869 1 (𝜑 → ¬ ∃𝑥𝜓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wex 1783  wnf 1787
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-12 2173
This theorem depends on definitions:  df-bi 206  df-ex 1784  df-nf 1788
This theorem is referenced by:  axrepnd  10281  axunnd  10283
  Copyright terms: Public domain W3C validator