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

Theorem pm4.79 1021
Description: Theorem *4.79 of [WhiteheadRussell] p. 121. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 27-Jun-2013.)
Assertion
Ref Expression
pm4.79 (((𝜓 → 𝜑) ∨ (𝜒 → 𝜑)) ↔ ((𝜓 ∧ 𝜒) → 𝜑))

Proof of Theorem pm4.79
StepHypRef Expression
1 id 23 . . 3 ((𝜓 → 𝜑) → (𝜓 → 𝜑))
2 id 23 . . 3 ((𝜒 → 𝜑) → (𝜒 → 𝜑))
31, 2jaoa 970 . 2 (((𝜓 → 𝜑) ∨ (𝜒 → 𝜑)) → ((𝜓 ∧ 𝜒) → 𝜑))
4 simplim 168 . . . 4 (¬ (𝜓 → 𝜑) → 𝜓)
5 pm3.3 454 . . . 4 (((𝜓 ∧ 𝜒) → 𝜑) → (𝜓 → (𝜒 → 𝜑)))
64, 5syl5 35 . . 3 (((𝜓 ∧ 𝜒) → 𝜑) → (¬ (𝜓 → 𝜑) → (𝜒 → 𝜑)))
76orrd 877 . 2 (((𝜓 ∧ 𝜒) → 𝜑) → ((𝜓 → 𝜑) ∨ (𝜒 → 𝜑)))
83, 7impbii 212 1 (((𝜓 → 𝜑) ∨ (𝜒 → 𝜑)) ↔ ((𝜓 ∧ 𝜒) → 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ 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:  reuprg  4664  islinindfis  49505
  Copyright terms: Public domain W3C validator