Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nbbndc | Unicode version |
Description: Move negation outside of biconditional, for decidable propositions. Compare Theorem *5.18 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.) |
Ref | Expression |
---|---|
nbbndc | DECID DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xor3dc 1382 | . . . . 5 DECID DECID | |
2 | 1 | imp 123 | . . . 4 DECID DECID |
3 | con2bidc 870 | . . . . 5 DECID DECID | |
4 | 3 | imp 123 | . . . 4 DECID DECID |
5 | 2, 4 | bitrd 187 | . . 3 DECID DECID |
6 | bicom 139 | . . 3 | |
7 | 5, 6 | bitr2di 196 | . 2 DECID DECID |
8 | 7 | ex 114 | 1 DECID DECID |
Colors of variables: wff set class |
Syntax hints: wn 3 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-stab 826 df-dc 830 |
This theorem is referenced by: biassdc 1390 |
Copyright terms: Public domain | W3C validator |