New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > pm2.65d | Unicode version |
Description: Deduction rule for proof by contradiction. (Contributed by NM, 26-Jun-1994.) (Proof shortened by Wolf Lammen, 26-May-2013.) |
Ref | Expression |
---|---|
pm2.65d.1 | |
pm2.65d.2 |
Ref | Expression |
---|---|
pm2.65d |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm2.65d.2 | . . 3 | |
2 | pm2.65d.1 | . . 3 | |
3 | 1, 2 | nsyld 132 | . 2 |
4 | 3 | pm2.01d 161 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem is referenced by: mtod 168 pm2.65da 559 |
Copyright terms: Public domain | W3C validator |