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 10607 | . . 3 BOUNDED |
4 | 1, 2 | ax-bdan 10606 | . . . 4 BOUNDED |
5 | 4 | ax-bdn 10608 | . . 3 BOUNDED |
6 | 3, 5 | ax-bdan 10606 | . 2 BOUNDED |
7 | df-xor 1307 | . 2 | |
8 | 6, 7 | bd0r 10616 | 1 BOUNDED |
Colors of variables: wff set class |
Syntax hints: wn 3 wa 102 wo 661 wxo 1306 BOUNDED wbd 10603 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-bd0 10604 ax-bdan 10606 ax-bdor 10607 ax-bdn 10608 |
This theorem depends on definitions: df-bi 115 df-xor 1307 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |