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

Theorem dcan 939
Description: A conjunction of two decidable propositions is decidable. (Contributed by Jim Kingdon, 12-Apr-2018.)
Assertion
Ref Expression
dcan  |-  ( (DECID  ph  /\ DECID  ps )  -> DECID 
( ph  /\  ps )
)

Proof of Theorem dcan
StepHypRef Expression
1 simpl 109 . 2  |-  ( (DECID  ph  /\ DECID  ps )  -> DECID  ph )
2 simpr 110 . 2  |-  ( (DECID  ph  /\ DECID  ps )  -> DECID  ps )
31, 2dcand 938 1  |-  ( (DECID  ph  /\ DECID  ps )  -> DECID 
( ph  /\  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 839
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 617  ax-in2 618  ax-io 714
This theorem depends on definitions:  df-bi 117  df-dc 840
This theorem is referenced by:  dcan2  940  dcbi  942  annimdc  943  pm4.55dc  944  orandc  945  anordc  962  xordidc  1441  gcdmndc  12476
  Copyright terms: Public domain W3C validator