In [1]:

```
from proveit.logic import Equals, Or, TRUE, FALSE, Forall, inBool
from proveit._common_ import A, B, BB, n
from proveit.logic._common_ import iterB1n
from proveit.number import NaturalsPos
```

In [2]:

```
%begin axioms
```

In [3]:

```
orTT = Equals(Or(TRUE, TRUE), TRUE)
```

Out[3]:

In [4]:

```
orTF = Equals(Or(TRUE, FALSE), TRUE)
```

Out[4]:

In [5]:

```
orFT = Equals(Or(FALSE, TRUE), TRUE)
```

Out[5]:

In [6]:

```
orFF = Equals(Or(FALSE, FALSE), FALSE)
```

Out[6]:

In [7]:

```
leftInBool = Forall((A, B), inBool(A), conditions=[inBool(Or(A, B))])
```

Out[7]:

In [8]:

```
rightInBool = Forall((A, B), inBool(B), conditions=[inBool(Or(A, B))])
```

Out[8]:

In [9]:

```
emptyDisjunction = Equals(Or(), FALSE) # base case
```

Out[9]:

In [10]:

```
multiDisjunctionDef = Forall(n, Forall((A, BB), Equals(Or(A, iterB1n), Or(A, Or(iterB1n)))),
domain=NaturalsPos)
```

Out[10]:

In [11]:

```
%end axioms
```

These web pages were generated on 2019-02-06 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.