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

Theorem nrexdv 2559
Description: Deduction adding restricted existential quantifier to negated wff. (Contributed by NM, 16-Oct-2003.)
Hypothesis
Ref Expression
nrexdv.1 ((𝜑𝑥𝐴) → ¬ 𝜓)
Assertion
Ref Expression
nrexdv (𝜑 → ¬ ∃𝑥𝐴 𝜓)
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem nrexdv
StepHypRef Expression
1 nrexdv.1 . . 3 ((𝜑𝑥𝐴) → ¬ 𝜓)
21ralrimiva 2539 . 2 (𝜑 → ∀𝑥𝐴 ¬ 𝜓)
3 ralnex 2454 . 2 (∀𝑥𝐴 ¬ 𝜓 ↔ ¬ ∃𝑥𝐴 𝜓)
42, 3sylib 121 1 (𝜑 → ¬ ∃𝑥𝐴 𝜓)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wcel 2136  wral 2444  wrex 2445
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1435  ax-gen 1437  ax-ie2 1482  ax-4 1498  ax-17 1514
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-fal 1349  df-nf 1449  df-ral 2449  df-rex 2450
This theorem is referenced by:  ltpopr  7536  cauappcvgprlemladdru  7597  cauappcvgprlemladdrl  7598  caucvgprlemladdrl  7619  caucvgprprlemaddq  7649  dvdsle  11782
  Copyright terms: Public domain W3C validator