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

Theorem dfnot 1247
Description: Given falsum, we can define the negation of a wff as the statement that a contradiction follows from assuming . (Contributed by Mario Carneiro, 9-Feb-2017.) (Proof shortened by Wolf Lammen, 21-Jul-2019.)
Assertion
Ref Expression
dfnot

Proof of Theorem dfnot
StepHypRef Expression
1 fal 1235 . 2
2 mtt 597 . 2
31, 2ax-mp 7 1
Colors of variables: wff set class
Syntax hints:   wn 3   wi 4   wb 98   wfal 1233
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 532  ax-in2 533
This theorem depends on definitions:  df-bi 110  df-tru 1231  df-fal 1234
This theorem is referenced by:  inegd  1248  pclem6  1250  alnex  1369  alexim  1518  difin  3151  indifdir  3170
  Copyright terms: Public domain W3C validator