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

Theorem dfordc 827
Description: Definition of 'or' in terms of negation and implication for a decidable proposition. Based on definition of [Margaris] p. 49. One direction, pm2.53 674, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 26-Mar-2018.)
Assertion
Ref Expression
dfordc  |-  (DECID  ph  ->  ( ( ph  \/  ps ) 
<->  ( -.  ph  ->  ps ) ) )

Proof of Theorem dfordc
StepHypRef Expression
1 pm2.53 674 . 2  |-  ( (
ph  \/  ps )  ->  ( -.  ph  ->  ps ) )
2 pm2.54dc 826 . 2  |-  (DECID  ph  ->  ( ( -.  ph  ->  ps )  ->  ( ph  \/  ps ) ) )
31, 2impbid2 141 1  |-  (DECID  ph  ->  ( ( ph  \/  ps ) 
<->  ( -.  ph  ->  ps ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 103    \/ wo 662  DECID wdc 778
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663
This theorem depends on definitions:  df-bi 115  df-dc 779
This theorem is referenced by:  imordc  832  pm4.64dc  837  pm5.17dc  846  pm5.6dc  871  pm3.12dc  902  pm5.15dc  1323  19.32dc  1612  r19.32vdc  2512  prime  8781  isprm4  11007  prm2orodd  11014  euclemma  11031  phiprmpw  11104
  Copyright terms: Public domain W3C validator