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

Theorem dcand 945
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 847 . . . . 5  |-  (DECID  ps  <->  ( ps  \/  -.  ps ) )
3 id 19 . . . . . . 7  |-  ( -. 
ps  ->  -.  ps )
43intnanrd 944 . . . . . 6  |-  ( -. 
ps  ->  -.  ( ps  /\ 
ch ) )
54orim2i 773 . . . . 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 847 . . . . 5  |-  (DECID  ch  <->  ( ch  \/  -.  ch ) )
10 id 19 . . . . . . 7  |-  ( -. 
ch  ->  -.  ch )
1110intnand 943 . . . . . 6  |-  ( -. 
ch  ->  -.  ( ps  /\ 
ch ) )
1211orim2i 773 . . . . 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 829 . . 3  |-  ( ( ( ps  /\  ch )  \/  -.  ( ps  /\  ch ) )  <-> 
( ( ps  \/  -.  ( ps  /\  ch ) )  /\  ( ch  \/  -.  ( ps 
/\  ch ) ) ) )
167, 14, 15sylanbrc 421 . 2  |-  ( ph  ->  ( ( ps  /\  ch )  \/  -.  ( ps  /\  ch )
) )
17 df-dc 847 . 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 720  DECID wdc 846
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 623  ax-in2 624  ax-io 721
This theorem depends on definitions:  df-bi 117  df-dc 847
This theorem is referenced by:  dcan  946  dcfi  7305  fdcf1  7306  nn0n0n1ge2b  9704  infssfzcldc  10647  infssfzledc  10648  hashfibclem  11260  fzowrddc  11397  bitsinv1  12707  gcdsupex  12712  gcdsupcl  12713  gcdaddm  12739  nnwosdc  12794  lcmval  12819  lcmcllem  12823  lcmledvds  12826  prmdc  12886  pclemdc  13045  infpnlem2  13117  ballotfilemdifcfi  13203  ballotfilemiex  13222  nninfdclemcl  13317
  Copyright terms: Public domain W3C validator