| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdxor | Unicode version | ||
| Description: The exclusive disjunction of two bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.) |
| Ref | Expression |
|---|---|
| bdxor.1 |
|
| bdxor.2 |
|
| Ref | Expression |
|---|---|
| bdxor |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdxor.1 |
. . . 4
| |
| 2 | bdxor.2 |
. . . 4
| |
| 3 | 1, 2 | ax-bdor 15462 |
. . 3
|
| 4 | 1, 2 | ax-bdan 15461 |
. . . 4
|
| 5 | 4 | ax-bdn 15463 |
. . 3
|
| 6 | 3, 5 | ax-bdan 15461 |
. 2
|
| 7 | df-xor 1387 |
. 2
| |
| 8 | 6, 7 | 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-bdan 15461 ax-bdor 15462 ax-bdn 15463 |
| This theorem depends on definitions: df-bi 117 df-xor 1387 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |