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

Theorem biorf 752
Description: A wff is equivalent to its disjunction with falsehood. Theorem *4.74 of [WhiteheadRussell] p. 121. (Contributed by NM, 23-Mar-1995.) (Proof shortened by Wolf Lammen, 18-Nov-2012.)
Assertion
Ref Expression
biorf  |-  ( -. 
ph  ->  ( ps  <->  ( ph  \/  ps ) ) )

Proof of Theorem biorf
StepHypRef Expression
1 olc 719 . 2  |-  ( ps 
->  ( ph  \/  ps ) )
2 orel1 733 . 2  |-  ( -. 
ph  ->  ( ( ph  \/  ps )  ->  ps ) )
31, 2impbid2 143 1  |-  ( -. 
ph  ->  ( ps  <->  ( ph  \/  ps ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    \/ wo 716
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in2 620  ax-io 717
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  biortn  753  pm5.61  802  pm5.55dc  921  3bior1fd  1389  3bior2fd  1391  euor  2105  eueq3dc  2981  ifordc  3651  difprsnss  3816  exmidsssn  4298  opthprc  4783  frecabcl  6608  frecsuclem  6615  swoord1  6774  indpi  7622  enq0tr  7714  mulap0r  8854  mulge0  8858  leltap  8864  ap0gt0  8879  sumsplitdc  12073  coprm  12796  gsumval2  13560  bdbl  15314  eupth2lem1  16399  eupth2lem2dc  16400  eupth2lem3lem6fi  16412  subctctexmid  16722
  Copyright terms: Public domain W3C validator