NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  nanbi Unicode version

Theorem nanbi 1294
Description: Show equivalence between the bidirectional and the Nicod version. (Contributed by Jeff Hoffman, 19-Nov-2007.)
Assertion
Ref Expression
nanbi

Proof of Theorem nanbi
StepHypRef Expression
1 pm4.57 483 . 2
2 df-nan 1288 . . 3
3 df-nan 1288 . . . 4
4 df-nan 1288 . . . . 5
5 nannot 1293 . . . . . 6
6 nannot 1293 . . . . . 6
75, 6anbi12i 678 . . . . 5
84, 7xchbinxr 302 . . . 4
93, 8anbi12i 678 . . 3
102, 9xchbinx 301 . 2
11 dfbi3 863 . 2
121, 10, 113bitr4ri 269 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wb 176   wo 357   wa 358   wnan 1287
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-or 359  df-an 360  df-nan 1288
This theorem is referenced by:  nic-dfim  1434  nic-dfneg  1435
  Copyright terms: Public domain W3C validator