Theorem pm5.63dc 959

Description: Theorem *5.63 of [WhiteheadRussell] p. 125, for a decidable proposition. (Contributed by Jim Kingdon, 12-May-2018.)

Assertion

Ref	Expression
pm5.63dc	⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) ↔ (𝜑 ∨ (¬ 𝜑 ∧ 𝜓))))

Proof of Theorem pm5.63dc

Step	Hyp	Ref	Expression
1		df-dc 847	. . 3 ⊢ (DECID 𝜑 ↔ (𝜑 ∨ ¬ 𝜑))
2		ordi 828	. . . 4 ⊢ ((𝜑 ∨ (¬ 𝜑 ∧ 𝜓)) ↔ ((𝜑 ∨ ¬ 𝜑) ∧ (𝜑 ∨ 𝜓)))
3	2	simplbi2 385	. . 3 ⊢ ((𝜑 ∨ ¬ 𝜑) → ((𝜑 ∨ 𝜓) → (𝜑 ∨ (¬ 𝜑 ∧ 𝜓))))
4	1, 3	sylbi 121	. 2 ⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) → (𝜑 ∨ (¬ 𝜑 ∧ 𝜓))))
5	2	simprbi 275	. 2 ⊢ ((𝜑 ∨ (¬ 𝜑 ∧ 𝜓)) → (𝜑 ∨ 𝜓))
6	4, 5	impbid1 142	1 ⊢ (DECID 𝜑 → ((𝜑 ∨ 𝜓) ↔ (𝜑 ∨ (¬ 𝜑 ∧ 𝜓))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721

This proof depends on definitions:  df-bi 117  df-dc 847

This theorem is used by:  swrdnd  11433