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

Theorem inegd 1561
Description: Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.)
Hypothesis
Ref Expression
inegd.1 ((𝜑𝜓) → ⊥)
Assertion
Ref Expression
inegd (𝜑 → ¬ 𝜓)

Proof of Theorem inegd
StepHypRef Expression
1 inegd.1 . . 3 ((𝜑𝜓) → ⊥)
21ex 412 . 2 (𝜑 → (𝜓 → ⊥))
3 dfnot 1560 . 2 𝜓 ↔ (𝜓 → ⊥))
42, 3sylibr 233 1 (𝜑 → ¬ 𝜓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wfal 1553
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1544  df-fal 1554
This theorem is referenced by:  efald  1562  tglndim0  26971  archiabllem2c  31428  lindsun  31685
  Copyright terms: Public domain W3C validator