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

Theorem orel2 698
Description: Elimination of disjunction by denial of a disjunct. Theorem *2.56 of [WhiteheadRussell] p. 107. (Contributed by NM, 12-Aug-1994.) (Proof shortened by Wolf Lammen, 5-Apr-2013.)
Assertion
Ref Expression
orel2  |-  ( -. 
ph  ->  ( ( ps  \/  ph )  ->  ps ) )

Proof of Theorem orel2
StepHypRef Expression
1 idd 21 . 2  |-  ( -. 
ph  ->  ( ps  ->  ps ) )
2 pm2.21 589 . 2  |-  ( -. 
ph  ->  ( ph  ->  ps ) )
31, 2jaod 689 1  |-  ( -. 
ph  ->  ( ( ps  \/  ph )  ->  ps ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 680
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in2 587  ax-io 681
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  biorfi  718  pm2.64  773  stdcn  815  pm5.71dc  928  ecased  1310  19.30dc  1589  dveeq2  1769  prel12  3666  funun  5135
  Copyright terms: Public domain W3C validator