Theorem dcstab 851

Description: Decidability implies stability. The converse need not hold. (Contributed by David A. Wheeler, 13-Aug-2018.)

Assertion

Ref	Expression
dcstab	⊢ (DECID 𝜑 → STAB 𝜑)

Proof of Theorem dcstab

Step	Hyp	Ref	Expression
1		notnotrdc 850	. 2 ⊢ (DECID 𝜑 → (¬ ¬ 𝜑 → 𝜑))
2		df-stab 838	. 2 ⊢ (STAB 𝜑 ↔ (¬ ¬ 𝜑 → 𝜑))
3	1, 2	sylibr 134	1 ⊢ (DECID 𝜑 → STAB 𝜑)

Syntax hints:  ¬ wn 3   → wi 4  STAB wstab 837  DECID wdc 841

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-in2 620  ax-io 716

This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842

This theorem is referenced by:  stdcndc  852  stdcndcOLD  853  condc  860  imandc  896  sbthlemi3  7158