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 | BOUNDED |
bdxor.2 | BOUNDED |
Ref | Expression |
---|---|
bdxor | BOUNDED |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bdxor.1 | . . . 4 BOUNDED | |
2 | bdxor.2 | . . . 4 BOUNDED | |
3 | 1, 2 | ax-bdor 13658 | . . 3 BOUNDED |
4 | 1, 2 | ax-bdan 13657 | . . . 4 BOUNDED |
5 | 4 | ax-bdn 13659 | . . 3 BOUNDED |
6 | 3, 5 | ax-bdan 13657 | . 2 BOUNDED |
7 | df-xor 1366 | . 2 | |
8 | 6, 7 | bd0r 13667 | 1 BOUNDED |
Colors of variables: wff set class |
Syntax hints: wn 3 wa 103 wo 698 wxo 1365 BOUNDED wbd 13654 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-bd0 13655 ax-bdan 13657 ax-bdor 13658 ax-bdn 13659 |
This theorem depends on definitions: df-bi 116 df-xor 1366 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |