Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > bj-fadc | Unicode version |
Description: A refutable formula is decidable. (Contributed by BJ, 24-Nov-2023.) |
Ref | Expression |
---|---|
bj-fadc | DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | olc 706 | . 2 | |
2 | df-dc 830 | . 2 DECID | |
3 | 1, 2 | sylibr 133 | 1 DECID |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wo 703 DECID wdc 829 |
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-io 704 |
This theorem depends on definitions: df-bi 116 df-dc 830 |
This theorem is referenced by: bj-dcfal 13790 |
Copyright terms: Public domain | W3C validator |