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 836 | . . 3 DECID DECID DECID | |
2 | dcim 836 | . . . 4 DECID DECID DECID | |
3 | 2 | com12 30 | . . 3 DECID DECID DECID |
4 | dcan2 929 | . . 3 DECID DECID DECID | |
5 | 1, 3, 4 | syl6c 66 | . 2 DECID DECID DECID |
6 | dfbi2 386 | . . 3 | |
7 | 6 | dcbii 835 | . 2 DECID DECID |
8 | 5, 7 | syl6ibr 161 | 1 DECID DECID DECID |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 DECID wdc 829 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 |
This theorem depends on definitions: df-bi 116 df-dc 830 |
This theorem is referenced by: xor3dc 1382 pm5.15dc 1384 bilukdc 1391 xordidc 1394 |
Copyright terms: Public domain | W3C validator |