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

Theorem fal 1322
Description: is refutable. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Mel L. O'Cat, 11-Mar-2012.)
Assertion
Ref Expression
fal

Proof of Theorem fal
StepHypRef Expression
1 tru 1321 . . 3
21notnoti 115 . 2
3 df-fal 1320 . 2
42, 3mtbir 290 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wtru 1316   wfal 1317
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-tru 1319  df-fal 1320
This theorem is referenced by:  nbfal  1325  bifal  1327  falim  1328  truanfal  1337  falantru  1338  notfal  1349
  Copyright terms: Public domain W3C validator