| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference rule for proof by contradiction. |
| Ref | Expression |
|---|---|
| pm2.65i.1 |
|
| pm2.65i.2 |
|
| Ref | Expression |
|---|---|
| pm2.65i |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.65i.2 |
. . 3
| |
| 2 | pm2.65i.1 |
. . 3
| |
| 3 | 1, 2 | nsyl 102 |
. 2
|
| 4 | pm2.01 80 |
. 2
| |
| 5 | 3, 4 | ax-mp 6 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: canth 2945 cardprc 3667 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |