Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdfal Unicode version

Theorem bdfal 9953
Description: The truth value F. is bounded. (Contributed by BJ, 3-Oct-2019.)
Assertion
Ref Expression
bdfal  |- BOUNDED F.

Proof of Theorem bdfal
StepHypRef Expression
1 bdtru 9952 . . 3  |- BOUNDED T.
21ax-bdn 9937 . 2  |- BOUNDED  -. T.
3 df-fal 1249 . 2  |-  ( F.  <->  -. T.  )
42, 3bd0r 9945 1  |- BOUNDED F.
Colors of variables: wff set class
Syntax hints:   -. wn 3   T. wtru 1244   F. wfal 1248  BOUNDED wbd 9932
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-bd0 9933  ax-bdim 9934  ax-bdn 9937  ax-bdeq 9940
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-fal 1249
This theorem is referenced by:  bdnth  9954  bj-axemptylem  10012
  Copyright terms: Public domain W3C validator