Theorem bj-fadc 14366

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

Assertion

Ref	Expression
bj-fadc	⊢ (¬ 𝜑 → DECID 𝜑)

Proof of Theorem bj-fadc

Step	Hyp	Ref	Expression
1		olc 711	. 2 ⊢ (¬ 𝜑 → (𝜑 ∨ ¬ 𝜑))
2		df-dc 835	. 2 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
3	1, 2	sylibr 134	1 ⊢ (¬ 𝜑 → DECID 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 708  DECID wdc 834

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 709

This theorem depends on definitions:  df-bi 117  df-dc 835

This theorem is referenced by:  bj-dcfal  14367