| New Foundations Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > NFE Home > Th. List > con4bid | Unicode version | ||
| Description: A contraposition deduction. (Contributed by NM, 21-May-1994.) | 
| Ref | Expression | 
|---|---|
| con4bid.1 | 
 | 
| Ref | Expression | 
|---|---|
| con4bid | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | con4bid.1 | 
. . . 4
 | |
| 2 | 1 | biimprd 214 | 
. . 3
 | 
| 3 | 2 | con4d 97 | 
. 2
 | 
| 4 | 1 | biimpd 198 | 
. 2
 | 
| 5 | 3, 4 | impcon4bid 196 | 
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 | 
| This theorem is referenced by: notbid 285 notbi 286 had0 1403 necon4abid 2581 sbcne12g 3155 isomin 5497 | 
| Copyright terms: Public domain | W3C validator |