MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  notfal Unicode version

Theorem notfal 1339
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 1313 . 2  |-  -.  F.
21bitru 1317 1  |-  ( -. 
F. 
<->  T.  )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 176    T. wtru 1307    F. wfal 1308
This theorem is referenced by:  trunanfal  1345  falnanfal  1347  truxorfal  1349  falxortru  1350
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 177  df-tru 1310  df-fal 1311
  Copyright terms: Public domain W3C validator