Theorem bj-dcdc 15405

Description: Decidability of a proposition is decidable if and only if that proposition is decidable. DECID is idempotent. (Contributed by BJ, 9-Oct-2019.)

Assertion

Ref	Expression
bj-dcdc	⊢ (DECID DECID 𝜑 ↔ DECID 𝜑)

Proof of Theorem bj-dcdc

Step	Hyp	Ref	Expression
1		nndc 852	. 2 ⊢ ¬ ¬ DECID 𝜑
2		bj-nnbidc 15403	. 2 ⊢ (¬ ¬ DECID 𝜑 → (DECID DECID 𝜑 ↔ DECID 𝜑))
3	1, 2	ax-mp 5	1 ⊢ (DECID DECID 𝜑 ↔ DECID 𝜑)

Syntax hints:  ¬ wn 3   ↔ wb 105  DECID wdc 835

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-in1 615  ax-in2 616  ax-io 710

This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836

This theorem is referenced by: (None)