Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdnth Structured version   GIF version

Theorem bdnth 7061
Description: A falsity is a bounded formula. (Contributed by BJ, 6-Oct-2019.)
Hypothesis
Ref Expression
bdnth.1 ¬ φ
Assertion
Ref Expression
bdnth BOUNDED φ

Proof of Theorem bdnth
StepHypRef Expression
1 bdfal 7060 . 2 BOUNDED
2 fal 1235 . . 3 ¬ ⊥
3 bdnth.1 . . 3 ¬ φ
42, 32false 604 . 2 ( ⊥ ↔ φ)
51, 4bd0 7051 1 BOUNDED φ
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wfal 1233  BOUNDED wbd 7039
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 532  ax-in2 533  ax-bd0 7040  ax-bdim 7041  ax-bdn 7044  ax-bdeq 7047
This theorem depends on definitions:  df-bi 110  df-tru 1231  df-fal 1234
This theorem is referenced by:  bdcnul  7092
  Copyright terms: Public domain W3C validator