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

Theorem pm4.83 895
Description: Theorem *4.83 of [WhiteheadRussell] p. 122. (Contributed by NM, 3-Jan-2005.)
Assertion
Ref Expression
pm4.83 ⊢ (((φ → ψ) ∧ (¬ φ → ψ)) ↔ ψ)

Proof of Theorem pm4.83
StepHypRef Expression
1 exmid 404 . . 3 ⊢ (φ ∨ ¬ φ)
21a1bi 327 . 2 ⊢ (ψ ↔ ((φ ∨ ¬ φ) → ψ))
3 jaob 758 . 2 ⊢ (((φ ∨ ¬ φ) → ψ) ↔ ((φ → ψ) ∧ (¬ φ → ψ)))
42, 3bitr2i 241 1 ⊢ (((φ → ψ) ∧ (¬ φ → ψ)) ↔ ψ)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 176   ∨ wo 357   ∧ wa 358
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  df-an 360
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator