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

Theorem nexd 1549
Description: Deduction for generalization rule for negated wff. (Contributed by NM, 2-Jan-2002.)
Hypotheses
Ref Expression
nexd.1 (𝜑 → ∀𝑥𝜑)
nexd.2 (𝜑 → ¬ 𝜓)
Assertion
Ref Expression
nexd (𝜑 → ¬ ∃𝑥𝜓)

Proof of Theorem nexd
StepHypRef Expression
1 nexd.1 . . 3 (𝜑 → ∀𝑥𝜑)
2 nexd.2 . . 3 (𝜑 → ¬ 𝜓)
31, 2alrimih 1403 . 2 (𝜑 → ∀𝑥 ¬ 𝜓)
4 alnex 1433 . 2 (∀𝑥 ¬ 𝜓 ↔ ¬ ∃𝑥𝜓)
53, 4sylib 120 1 (𝜑 → ¬ ∃𝑥𝜓)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wal 1287  wex 1426
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-5 1381  ax-gen 1383  ax-ie2 1428
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-fal 1295
This theorem is referenced by:  nexdv  1859
  Copyright terms: Public domain W3C validator