Theorem orbididc 966

Description: Disjunction distributes over the biconditional, for a decidable proposition. Based on an axiom of system DS in Vladimir Lifschitz, "On calculational proofs" (1998), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3384. (Contributed by Jim Kingdon, 2-Apr-2018.)

Assertion

Ref	Expression
orbididc	⊢ (DECID 𝜑 → ((𝜑 ∨ (𝜓 ↔ 𝜒)) ↔ ((𝜑 ∨ 𝜓) ↔ (𝜑 ∨ 𝜒))))

Proof of Theorem orbididc

Step	Hyp	Ref	Expression
1		orimdidc 918	. . 3 ⊢ (DECID 𝜑 → ((𝜑 ∨ (𝜓 → 𝜒)) ↔ ((𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜒))))
2		orimdidc 918	. . 3 ⊢ (DECID 𝜑 → ((𝜑 ∨ (𝜒 → 𝜓)) ↔ ((𝜑 ∨ 𝜒) → (𝜑 ∨ 𝜓))))
3	1, 2	anbi12d 477	. 2 ⊢ (DECID 𝜑 → (((𝜑 ∨ (𝜓 → 𝜒)) ∧ (𝜑 ∨ (𝜒 → 𝜓))) ↔ (((𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜒)) ∧ ((𝜑 ∨ 𝜒) → (𝜑 ∨ 𝜓)))))
4		dfbi2 392	. . . 4 ⊢ ((𝜓 ↔ 𝜒) ↔ ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓)))
5	4	orbi2i 774	. . 3 ⊢ ((𝜑 ∨ (𝜓 ↔ 𝜒)) ↔ (𝜑 ∨ ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓))))
6		ordi 828	. . 3 ⊢ ((𝜑 ∨ ((𝜓 → 𝜒) ∧ (𝜒 → 𝜓))) ↔ ((𝜑 ∨ (𝜓 → 𝜒)) ∧ (𝜑 ∨ (𝜒 → 𝜓))))
7	5, 6	bitri 184	. 2 ⊢ ((𝜑 ∨ (𝜓 ↔ 𝜒)) ↔ ((𝜑 ∨ (𝜓 → 𝜒)) ∧ (𝜑 ∨ (𝜒 → 𝜓))))
8		dfbi2 392	. 2 ⊢ (((𝜑 ∨ 𝜓) ↔ (𝜑 ∨ 𝜒)) ↔ (((𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜒)) ∧ ((𝜑 ∨ 𝜒) → (𝜑 ∨ 𝜓))))
9	3, 7, 8	3bitr4g 223	1 ⊢ (DECID 𝜑 → ((𝜑 ∨ (𝜓 ↔ 𝜒)) ↔ ((𝜑 ∨ 𝜓) ↔ (𝜑 ∨ 𝜒))))

This proof depends on syntax axioms:   → 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-in2 624  ax-io 721

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

This theorem is used by:  pm5.7dc  967