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

Theorem dcand 941
Description: A conjunction of two decidable propositions is decidable. (Contributed by Jim Kingdon, 12-Apr-2018.) (Revised by BJ, 14-Nov-2024.)
Hypotheses
Ref Expression
dcand.1  |-  ( ph  -> DECID  ps )
dcand.2  |-  ( ph  -> DECID  ch )
Assertion
Ref Expression
dcand  |-  ( ph  -> DECID  ( ps  /\  ch )
)

Proof of Theorem dcand
StepHypRef Expression
1 dcand.1 . . . 4  |-  ( ph  -> DECID  ps )
2 df-dc 843 . . . . 5  |-  (DECID  ps  <->  ( ps  \/  -.  ps ) )
3 id 19 . . . . . . 7  |-  ( -. 
ps  ->  -.  ps )
43intnanrd 940 . . . . . 6  |-  ( -. 
ps  ->  -.  ( ps  /\ 
ch ) )
54orim2i 769 . . . . 5  |-  ( ( ps  \/  -.  ps )  ->  ( ps  \/  -.  ( ps  /\  ch ) ) )
62, 5sylbi 121 . . . 4  |-  (DECID  ps  ->  ( ps  \/  -.  ( ps  /\  ch ) ) )
71, 6syl 14 . . 3  |-  ( ph  ->  ( ps  \/  -.  ( ps  /\  ch )
) )
8 dcand.2 . . . 4  |-  ( ph  -> DECID  ch )
9 df-dc 843 . . . . 5  |-  (DECID  ch  <->  ( ch  \/  -.  ch ) )
10 id 19 . . . . . . 7  |-  ( -. 
ch  ->  -.  ch )
1110intnand 939 . . . . . 6  |-  ( -. 
ch  ->  -.  ( ps  /\ 
ch ) )
1211orim2i 769 . . . . 5  |-  ( ( ch  \/  -.  ch )  ->  ( ch  \/  -.  ( ps  /\  ch ) ) )
139, 12sylbi 121 . . . 4  |-  (DECID  ch  ->  ( ch  \/  -.  ( ps  /\  ch ) ) )
148, 13syl 14 . . 3  |-  ( ph  ->  ( ch  \/  -.  ( ps  /\  ch )
) )
15 ordir 825 . . 3  |-  ( ( ( ps  /\  ch )  \/  -.  ( ps  /\  ch ) )  <-> 
( ( ps  \/  -.  ( ps  /\  ch ) )  /\  ( ch  \/  -.  ( ps 
/\  ch ) ) ) )
167, 14, 15sylanbrc 417 . 2  |-  ( ph  ->  ( ( ps  /\  ch )  \/  -.  ( ps  /\  ch )
) )
17 df-dc 843 . 2  |-  (DECID  ( ps 
/\  ch )  <->  ( ( ps  /\  ch )  \/ 
-.  ( ps  /\  ch ) ) )
1816, 17sylibr 134 1  |-  ( ph  -> DECID  ( ps  /\  ch )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716  DECID wdc 842
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-in1 619  ax-in2 620  ax-io 717
This theorem depends on definitions:  df-bi 117  df-dc 843
This theorem is referenced by:  dcan  942  dcfi  7223  nn0n0n1ge2b  9603  fzowrddc  11277  bitsinv1  12586  gcdsupex  12591  gcdsupcl  12592  gcdaddm  12618  nnwosdc  12673  lcmval  12698  lcmcllem  12702  lcmledvds  12705  prmdc  12765  pclemdc  12924  infpnlem2  12996  nninfdclemcl  13132
  Copyright terms: Public domain W3C validator