| 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 | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | olc 712 | 
. 2
 | |
| 2 | df-dc 836 | 
. 2
 | |
| 3 | 1, 2 | sylibr 134 | 
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-io 710 | 
| This theorem depends on definitions: df-bi 117 df-dc 836 | 
| This theorem is referenced by: bj-dcfal 15401 | 
| Copyright terms: Public domain | W3C validator |