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

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

Proof of Theorem truimfal
StepHypRef Expression
1 tru 1247 . . 3  |- T.
21a1bi 232 . 2  |-  ( F.  <-> 
( T.  -> F.  ) )
32bicomi 123 1  |-  ( ( T.  -> F.  )  <-> F.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> 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
This theorem depends on definitions:  df-bi 110  df-tru 1246
This theorem is referenced by:  trubifal  1307
  Copyright terms: Public domain W3C validator