Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dcbi | Unicode version |
Description: An equivalence of two decidable propositions is decidable. (Contributed by Jim Kingdon, 12-Apr-2018.) |
Ref | Expression |
---|---|
dcbi | DECID DECID DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dcim 784 | . . 3 DECID DECID DECID | |
2 | dcim 784 | . . . 4 DECID DECID DECID | |
3 | 2 | com12 27 | . . 3 DECID DECID DECID |
4 | dcan 842 | . . 3 DECID DECID DECID | |
5 | 1, 3, 4 | syl6c 60 | . 2 DECID DECID DECID |
6 | dfbi2 368 | . . 3 | |
7 | 6 | dcbii 747 | . 2 DECID DECID |
8 | 5, 7 | syl6ibr 151 | 1 DECID DECID DECID |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 DECID wdc 742 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 |
This theorem depends on definitions: df-bi 110 df-dc 743 |
This theorem is referenced by: xor3dc 1278 pm5.15dc 1280 bilukdc 1287 xordidc 1290 |
Copyright terms: Public domain | W3C validator |