| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Reductio ad absurdum. Theorem *2.01 of [WhiteheadRussell] p. 100. (The proof was shortened by O'Cat, 21-Nov-2008; compare pm2.01OLD 92. |
| Ref | Expression |
|---|---|
| pm2.01 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.18 84 |
. 2
| |
| 2 | looinv 86 |
. 2
| |
| 3 | 1, 2 | ax-mp 7 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: pm2.01d 93 bijust 152 pm4.8 169 dtrucor2 2830 ominf 4593 elirr 4659 ruclem39 7640 usinuniop 10703 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |