Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > pm2.21fal | Unicode version |
Description: If a wff and its negation are provable, then falsum is provable. (Contributed by Mario Carneiro, 9-Feb-2017.) |
Ref | Expression |
---|---|
pm2.21fal.1 | |
pm2.21fal.2 |
Ref | Expression |
---|---|
pm2.21fal |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm2.21fal.1 | . 2 | |
2 | pm2.21fal.2 | . 2 | |
3 | 1, 2 | pm2.21dd 609 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wfal 1336 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-in2 604 |
This theorem is referenced by: genpdisj 7331 suplocexprlemdisj 7528 suplocexprlemub 7531 suplocsrlem 7616 recvguniqlem 10766 resqrexlemoverl 10793 leabs 10846 climge0 11094 dedekindeulemeu 12769 dedekindicclemeu 12778 |
Copyright terms: Public domain | W3C validator |