Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > notnotrdc | Unicode version |
Description: Double negation elimination for a decidable proposition. The converse, notnot 603, holds for all propositions, not just decidable ones. This is Theorem *2.14 of [WhiteheadRussell] p. 102, but with a decidability condition added. (Contributed by Jim Kingdon, 11-Mar-2018.) |
Ref | Expression |
---|---|
notnotrdc | DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-dc 805 | . . 3 DECID | |
2 | orcom 702 | . . 3 | |
3 | 1, 2 | bitri 183 | . 2 DECID |
4 | pm2.53 696 | . 2 | |
5 | 3, 4 | sylbi 120 | 1 DECID |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wo 682 DECID wdc 804 |
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-in2 589 ax-io 683 |
This theorem depends on definitions: df-bi 116 df-dc 805 |
This theorem is referenced by: dcstab 814 notnotbdc 842 condandc 851 pm2.13dc 855 pm2.54dc 861 mkvprop 7000 |
Copyright terms: Public domain | W3C validator |