MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordi Structured version   Visualization version   GIF version

Theorem ordi 903
Description: Distributive law for disjunction. Theorem *4.41 of [WhiteheadRussell] p. 119. (Contributed by NM, 5-Jan-1993.) (Proof shortened by Andrew Salmon, 7-May-2011.) (Proof shortened by Wolf Lammen, 28-Nov-2013.)
Assertion
Ref Expression
ordi ((𝜑 ∨ (𝜓𝜒)) ↔ ((𝜑𝜓) ∧ (𝜑𝜒)))

Proof of Theorem ordi
StepHypRef Expression
1 jcab 902 . 2 ((¬ 𝜑 → (𝜓𝜒)) ↔ ((¬ 𝜑𝜓) ∧ (¬ 𝜑𝜒)))
2 df-or 383 . 2 ((𝜑 ∨ (𝜓𝜒)) ↔ (¬ 𝜑 → (𝜓𝜒)))
3 df-or 383 . . 3 ((𝜑𝜓) ↔ (¬ 𝜑𝜓))
4 df-or 383 . . 3 ((𝜑𝜒) ↔ (¬ 𝜑𝜒))
53, 4anbi12i 728 . 2 (((𝜑𝜓) ∧ (𝜑𝜒)) ↔ ((¬ 𝜑𝜓) ∧ (¬ 𝜑𝜒)))
61, 2, 53bitr4i 290 1 ((𝜑 ∨ (𝜓𝜒)) ↔ ((𝜑𝜓) ∧ (𝜑𝜒)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 194  wo 381  wa 382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384
This theorem is referenced by:  ordir  904  orddi  908  pm5.63  960  pm4.43  963  cadan  1538  undi  3832  undif3  3846  undif4  3986  elnn1uz2  11600  or3di  28525  ifpan23  36647  ifpidg  36679  ifpim123g  36688
  Copyright terms: Public domain W3C validator