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

Theorem truorfal 1331
Description: A  \/ identity. (Contributed by Anthony Hart, 22-Oct-2010.)
Assertion
Ref Expression
truorfal  |-  ( (  T.  \/  F.  )  <->  T.  )

Proof of Theorem truorfal
StepHypRef Expression
1 tru 1312 . . 3  |-  T.
21orci 379 . 2  |-  (  T.  \/  F.  )
32bitru 1317 1  |-  ( (  T.  \/  F.  )  <->  T.  )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    \/ wo 357    T. wtru 1307    F. wfal 1308
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-or 359  df-tru 1310
  Copyright terms: Public domain W3C validator