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

Theorem notfal 1305
Description: A  -. identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)
Assertion
Ref Expression
notfal  |-  ( -. F.  <-> T.  )

Proof of Theorem notfal
StepHypRef Expression
1 fal 1250 . 2  |-  -. F.
21bitru 1255 1  |-  ( -. F.  <-> T.  )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 98   T. wtru 1244   F. wfal 1248
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 544  ax-in2 545
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-fal 1249
This theorem is referenced by:  truxorfal  1311  falxortru  1312  falxorfal  1313
  Copyright terms: Public domain W3C validator