Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > bddc | Unicode version |
Description: Decidability of a bounded formula is bounded. (Contributed by BJ, 3-Oct-2019.) |
Ref | Expression |
---|---|
bdstab.1 | BOUNDED |
Ref | Expression |
---|---|
bddc | BOUNDED DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bdstab.1 | . . 3 BOUNDED | |
2 | 1 | ax-bdn 9937 | . . 3 BOUNDED |
3 | 1, 2 | ax-bdor 9936 | . 2 BOUNDED |
4 | df-dc 743 | . 2 DECID | |
5 | 3, 4 | bd0r 9945 | 1 BOUNDED DECID |
Colors of variables: wff set class |
Syntax hints: wn 3 wo 629 DECID wdc 742 BOUNDED wbd 9932 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-bd0 9933 ax-bdor 9936 ax-bdn 9937 |
This theorem depends on definitions: df-bi 110 df-dc 743 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |