MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tbw-negdf Unicode version

Theorem tbw-negdf 1532
Description: The definition of negation, in terms of -> and . (Contributed by Anthony Hart, 15-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
tbw-negdf

Proof of Theorem tbw-negdf
StepHypRef Expression
1 pm2.21 108 . . 3
2 ax-1 6 . . . . 5
3 falim 1409 . . . . 5
42, 3ja 161 . . . 4
54pm2.43i 47 . . 3
61, 5impbii 188 . 2
7 tbw-bijust 1531 . 2
86, 7mpbi 208 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  <->wb 184   wfal 1400
This theorem is referenced by:  re1luk2  1544  re1luk3  1545
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 185  df-tru 1398  df-fal 1401
  Copyright terms: Public domain W3C validator