| New Foundations Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > NFE 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 423 | 
. 2
 | 
| 3 | 2 | pm2.01d 161 | 
1
 | 
| Colors of variables: wff setvar class | 
| Syntax hints:    | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 | 
| This theorem depends on definitions: df-bi 177 df-an 360 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |