NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  pm4.78 GIF version

Theorem pm4.78 565
Description: Theorem *4.78 of [WhiteheadRussell] p. 121. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 19-Nov-2012.)
Assertion
Ref Expression
pm4.78 ⊢ (((φ → ψ) ∨ (φ → χ)) ↔ (φ → (ψ ∨ χ)))

Proof of Theorem pm4.78
StepHypRef Expression
1 orordi 516 . 2 ⊢ ((¬ φ ∨ (ψ ∨ χ)) ↔ ((¬ φ ∨ ψ) ∨ (¬ φ ∨ χ)))
2 imor 401 . 2 ⊢ ((φ → (ψ ∨ χ)) ↔ (¬ φ ∨ (ψ ∨ χ)))
3 imor 401 . . 3 ⊢ ((φ → ψ) ↔ (¬ φ ∨ ψ))
4 imor 401 . . 3 ⊢ ((φ → χ) ↔ (¬ φ ∨ χ))
53, 4orbi12i 507 . 2 ⊢ (((φ → ψ) ∨ (φ → χ)) ↔ ((¬ φ ∨ ψ) ∨ (¬ φ ∨ χ)))
61, 2, 53bitr4ri 269 1 ⊢ (((φ → ψ) ∨ (φ → χ)) ↔ (φ → (ψ ∨ χ)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 176   ∨ wo 357
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This proof depends on definitions:  df-bi 177  df-or 359
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator