Theorem dcan2 947

Description: A conjunction of two decidable propositions is decidable, expressed in a curried form as compared to dcan 946. This is deprecated; it's trivial to recreate with ex 115, but it's here in case someone is using this older form. (Contributed by Jim Kingdon, 12-Apr-2018.) (New usage is discouraged.)

Assertion

Ref	Expression
dcan2	⊢ (DECID 𝜑 → (DECID 𝜓 → DECID (𝜑 ∧ 𝜓)))

Proof of Theorem dcan2

Step	Hyp	Ref	Expression
1		dcan 946	. 2 ⊢ ((DECID 𝜑 ∧ DECID 𝜓) → DECID (𝜑 ∧ 𝜓))
2	1	ex 115	1 ⊢ (DECID 𝜑 → (DECID 𝜓 → DECID (𝜑 ∧ 𝜓)))

Syntax hints:   → wi 4   ∧ wa 104  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:  pcmptdvds  13102  1arith  13124  ctiunctlemudc  13306  nninfdclemp1  13319  lgsval  16037  lgscllem  16040  lgsneg  16057  lgsdir  16068  lgsdi  16070  lgsne0  16071  nninfsellemdc  16958