Theorem ordir 1024

Description: Distributive law for disjunction. (Contributed by NM, 12-Aug-1994.)

Assertion

Ref	Expression
ordir	⊢ (((𝜑 ∧ 𝜓) ∨ 𝜒) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)))

Proof of Theorem ordir

Step	Hyp	Ref	Expression
1		ordi 1023	. 2 ⊢ ((𝜒 ∨ (𝜑 ∧ 𝜓)) ↔ ((𝜒 ∨ 𝜑) ∧ (𝜒 ∨ 𝜓)))
2		orcom 884	. 2 ⊢ (((𝜑 ∧ 𝜓) ∨ 𝜒) ↔ (𝜒 ∨ (𝜑 ∧ 𝜓)))
3		orcom 884	. . 3 ⊢ ((𝜑 ∨ 𝜒) ↔ (𝜒 ∨ 𝜑))
4		orcom 884	. . 3 ⊢ ((𝜓 ∨ 𝜒) ↔ (𝜒 ∨ 𝜓))
5	3, 4	anbi12i 640	. 2 ⊢ (((𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)) ↔ ((𝜒 ∨ 𝜑) ∧ (𝜒 ∨ 𝜓)))
6	1, 2, 5	3bitr4i 306	1 ⊢ (((𝜑 ∧ 𝜓) ∨ 𝜒) ↔ ((𝜑 ∨ 𝜒) ∧ (𝜓 ∨ 𝜒)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∨ wo 861

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862

This theorem is used by:  orddi  1027  pm5.62  1036  dn1  1073  cadan  1642  poxp3  8151  elnn0z  12631  eln0s  28627  ifpim123g  44342  rp-fakeanorass  44355  fvmptrabdm  48183