![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dcan2 | Unicode version |
Description: A conjunction of two decidable propositions is decidable, expressed in a curried form as compared to dcan 935. 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.) |
Ref | Expression |
---|---|
dcan2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dcan 935 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | 1 | ex 115 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() |
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 615 ax-in2 616 ax-io 710 |
This theorem depends on definitions: df-bi 117 df-dc 836 |
This theorem is referenced by: pcmptdvds 12483 1arith 12505 ctiunctlemudc 12594 nninfdclemp1 12607 lgsval 15120 lgscllem 15123 lgsneg 15140 lgsdir 15151 lgsdi 15153 lgsne0 15154 nninfsellemdc 15500 |
Copyright terms: Public domain | W3C validator |