In [1]:

```
import proveit
# Prepare this notebook for defining the theorems of a theory:
%theorems_notebook # Keep this at the top following 'import proveit'.
from proveit import b
from proveit.logic import Forall, InSet
from proveit.numbers import zero, one, greater_eq, LessEq, Natural, number_ordering
from proveit.numbers.numerals.binaries import Bit
```

In [2]:

```
%begin theorems
```

In [3]:

```
bits_lower_bound = Forall(b, greater_eq(b, zero), domain=Bit)
```

In [4]:

```
bits_upper_bound = Forall(b, LessEq(b, one), domain=Bit)
```

In [5]:

```
b_in_bits = Forall(b, InSet(b, Bit),
conditions=[number_ordering(LessEq(zero, b), LessEq(b, one))],
domain=Natural)
```

In [ ]:

```
```

In [6]:

```
%end theorems
```

These web pages were generated on 2023-08-23 by Prove-It Beta Version 0.3, licensed under the GNU Public License by Sandia Corporation.

Presented proofs are not absolutely guaranteed. For assurance, it is important to check the structure of the statement being proven, independently verify the derivation steps, track dependencies, and ensure that employed axioms are valid and properly structured. Inconsistencies may exist, unknowingly, in this system.

This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, under the Quantum Computing Application Teams program. Sandia National Labs is managed and operated by National Technology and Engineering Solutions of Sandia, LLC, a subsidiary of Honeywell International, Inc., for the U.S. Dept. of Energy's NNSA under contract DE-NA0003525. The views expressed above do not necessarily represent the views of the DOE or the U.S. Government.

Please send questions/comments to: wwitzel@sandia.gov.