ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nexdv GIF version

Theorem nexdv 1996
Description: Deduction for generalization rule for negated wff. (Contributed by NM, 5-Aug-1993.)
Hypothesis
Ref Expression
nexdv.1 (𝜑 → ¬ 𝜓)
Assertion
Ref Expression
nexdv (𝜑 → ¬ ∃𝑥𝜓)
Distinct variable group:   𝜑,𝑥
Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem nexdv
StepHypRef Expression
1 ax-17 1579 . 2 (𝜑 → ∀𝑥𝜑)
2 nexdv.1 . 2 (𝜑 → ¬ 𝜓)
31, 2nexd 1666 1 (𝜑 → ¬ ∃𝑥𝜓)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wex 1545
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-5 1500  ax-gen 1502  ax-ie2 1547  ax-17 1579
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408
This theorem is referenced by:  lgsquadlem3  16112  umgredgnlp  16307  pw1nct  16947
  Copyright terms: Public domain W3C validator