| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pm2.01da | Unicode version | ||
| Description: Deduction based on reductio ad absurdum. (Contributed by Mario Carneiro, 9-Feb-2017.) |
| Ref | Expression |
|---|---|
| pm2.01da.1 |
|
| Ref | Expression |
|---|---|
| pm2.01da |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.01da.1 |
. . 3
| |
| 2 | 1 | ex 115 |
. 2
|
| 3 | 2 | pm2.01d 627 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia3 108 ax-in1 623 |
| This theorem is used by: efrirr 4498 infnfi 7199 fun2dmnop0 11302 4sqlem18 13187 uhgr2edg 16447 |
| Copyright terms: Public domain | W3C validator |