Theorem dfordc 899

Description: Definition of disjunction in terms of negation and implication for a decidable proposition. Based on definition of [Margaris] p. 49. One direction, pm2.53 729, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 26-Mar-2018.)

Assertion

Ref	Expression
dfordc	⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)))

Proof of Theorem dfordc

Step	Hyp	Ref	Expression
1		pm2.53 729	. 2 ⊢ ((𝜑 ∨ 𝜓) → (¬ 𝜑 → 𝜓))
2		pm2.54dc 898	. 2 ⊢ (DECID 𝜑 → ((¬ 𝜑 → 𝜓) → (𝜑 ∨ 𝜓)))
3	1, 2	impbid2 143	1 ⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 105   ∨ wo 715  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-in1 619  ax-in2 620  ax-io 716

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

This theorem is referenced by:  imordc  904  pm4.64dc  907  pm5.17dc  911  pm5.6dc  933  pm3.12dc  966  pm5.15dc  1433  19.32dc  1727  r19.30dc  2680  r19.32vdc  2682  prime  9578  isprm4  12690  prm2orodd  12697  euclemma  12717  phiprmpw  12793