| New Foundations Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > NFE Home > Th. List > dedlem0b | Unicode version | ||
| Description: Lemma for an alternate version of weak deduction theorem. (Contributed by NM, 2-Apr-1994.) | 
| Ref | Expression | 
|---|---|
| dedlem0b | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | pm2.21 100 | 
. . . 4
 | |
| 2 | 1 | imim2d 48 | 
. . 3
 | 
| 3 | 2 | com23 72 | 
. 2
 | 
| 4 | pm2.21 100 | 
. . . . 5
 | |
| 5 | simpr 447 | 
. . . . 5
 | |
| 6 | 4, 5 | imim12i 53 | 
. . . 4
 | 
| 7 | 6 | con1d 116 | 
. . 3
 | 
| 8 | 7 | com12 27 | 
. 2
 | 
| 9 | 3, 8 | impbid 183 | 
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 |