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

Theorem inegd 1421
Description: Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.)
Hypothesis
Ref Expression
inegd.1  |-  ( (
ph  /\  ps )  -> F.  )
Assertion
Ref Expression
inegd  |-  ( ph  ->  -.  ps )

Proof of Theorem inegd
StepHypRef Expression
1 inegd.1 . . 3  |-  ( (
ph  /\  ps )  -> F.  )
21ex 115 . 2  |-  ( ph  ->  ( ps  -> F.  ) )
3 dfnot 1420 . 2  |-  ( -. 
ps 
<->  ( ps  -> F.  ) )
42, 3sylibr 134 1  |-  ( ph  ->  -.  ps )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104   F. wfal 1407
This proof depends on 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
This proof depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408
This theorem is used by:  genpdisj  7890  cauappcvgprlemdisj  8018  caucvgprlemdisj  8041  caucvgprprlemdisj  8069  suplocexprlemdisj  8087  suplocexprlemub  8090  suplocsrlem  8175  resqrexlemgt0  11786  resqrexlemoverl  11787  leabs  11840  climge0  12091  isprm5lem  12919  ennnfonelemex  13305  dedekindeu  15724  dedekindicclemicc  15733  usgr1vr  16489  pw1nct  17033
  Copyright terms: Public domain W3C validator