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

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

Proof of Theorem falorfal
StepHypRef Expression
1 oridm 500 1  |-  ( (  F.  \/  F.  )  <->  F.  )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    \/ wo 357    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
  Copyright terms: Public domain W3C validator