Theorem imordc 898

Description: Implication in terms of disjunction for a decidable proposition. Based on theorem *4.6 of [WhiteheadRussell] p. 120. The reverse direction, imorr 722, holds for all propositions. (Contributed by Jim Kingdon, 20-Apr-2018.)

Assertion

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

Proof of Theorem imordc

Step	Hyp	Ref	Expression
1		notnotbdc 873	. . 3 ⊢ (DECID 𝜑 → (𝜑 ↔ ¬ ¬ 𝜑))
2	1	imbi1d 231	. 2 ⊢ (DECID 𝜑 → ((𝜑 → 𝜓) ↔ (¬ ¬ 𝜑 → 𝜓)))
3		dcn 843	. . 3 ⊢ (DECID 𝜑 → DECID ¬ 𝜑)
4		dfordc 893	. . 3 ⊢ (DECID ¬ 𝜑 → ((¬ 𝜑 ∨ 𝜓) ↔ (¬ ¬ 𝜑 → 𝜓)))
5	3, 4	syl 14	. 2 ⊢ (DECID 𝜑 → ((¬ 𝜑 ∨ 𝜓) ↔ (¬ ¬ 𝜑 → 𝜓)))
6	2, 5	bitr4d 191	1 ⊢ (DECID 𝜑 → ((𝜑 → 𝜓) ↔ (¬ 𝜑 ∨ 𝜓)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 105   ∨ wo 709  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-dc 836

This theorem is referenced by:  pm4.62dc  899  pm2.26dc  908  nf4dc  1684  algcvgblem  12217  divgcdodd  12311