| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bd3or | Unicode version | ||
| Description: A disjunction of three bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.) |
| Ref | Expression |
|---|---|
| bd3or.1 |
|
| bd3or.2 |
|
| bd3or.3 |
|
| Ref | Expression |
|---|---|
| bd3or |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bd3or.1 |
. . . 4
| |
| 2 | bd3or.2 |
. . . 4
| |
| 3 | 1, 2 | ax-bdor 15462 |
. . 3
|
| 4 | bd3or.3 |
. . 3
| |
| 5 | 3, 4 | ax-bdor 15462 |
. 2
|
| 6 | df-3or 981 |
. 2
| |
| 7 | 5, 6 | bd0r 15471 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-bd0 15459 ax-bdor 15462 |
| This theorem depends on definitions: df-bi 117 df-3or 981 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |