Theorem dfordc 900

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 730, 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 730	. 2 ⊢ ((𝜑 ∨ 𝜓) → (¬ 𝜑 → 𝜓))
2		pm2.54dc 899	. 2 ⊢ (DECID 𝜑 → ((¬ 𝜑 → 𝜓) → (𝜑 ∨ 𝜓)))
3	1, 2	impbid2 143	1 ⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 105   ∨ wo 716  DECID wdc 842

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 717

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

This theorem is referenced by:  imordc  905  pm4.64dc  908  pm5.17dc  912  pm5.6dc  934  pm3.12dc  967  pm5.15dc  1434  19.32dc  1727  r19.30dc  2681  r19.32vdc  2683  prime  9623  isprm4  12754  prm2orodd  12761  euclemma  12781  phiprmpw  12857