Theorem bj-fadc 13635

Description: A refutable formula is decidable. (Contributed by BJ, 24-Nov-2023.)

Assertion

Ref	Expression
bj-fadc	|- ( -. ph -> DECID ph )

Proof of Theorem bj-fadc

Step	Hyp	Ref	Expression
1		olc 701	. 2 |- ( -. ph -> ( ph \/ -. ph ) )
2		df-dc 825	. 2 |- (DECID ph <-> ( ph \/ -. ph ) )
3	1, 2	sylibr 133	1 |- ( -. ph -> DECID ph )

Syntax hints:   -. wn 3   -> wi 4   \/ wo 698  DECID wdc 824

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 699

This theorem depends on definitions:  df-bi 116  df-dc 825

This theorem is referenced by:  bj-dcfal  13636