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

Theorem pm4.79 1001
 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 22 . . 3 ((𝜓𝜑) → (𝜓𝜑))
2 id 22 . . 3 ((𝜒𝜑) → (𝜒𝜑))
31, 2jaoa 953 . 2 (((𝜓𝜑) ∨ (𝜒𝜑)) → ((𝜓𝜒) → 𝜑))
4 simplim 170 . . . 4 (¬ (𝜓𝜑) → 𝜓)
5 pm3.3 452 . . . 4 (((𝜓𝜒) → 𝜑) → (𝜓 → (𝜒𝜑)))
64, 5syl5 34 . . 3 (((𝜓𝜒) → 𝜑) → (¬ (𝜓𝜑) → (𝜒𝜑)))
76orrd 860 . 2 (((𝜓𝜒) → 𝜑) → ((𝜓𝜑) ∨ (𝜒𝜑)))
83, 7impbii 212 1 (((𝜓𝜑) ∨ (𝜒𝜑)) ↔ ((𝜓𝜒) → 𝜑))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844 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 210  df-an 400  df-or 845 This theorem is referenced by:  reuprg  4599  islinindfis  45251
 Copyright terms: Public domain W3C validator