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

Theorem pm5.61 1016
Description: Theorem *5.61 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 30-Jun-2013.)
Assertion
Ref Expression
pm5.61 (((𝜑 ∨ 𝜓) ∧ ¬ 𝜓) ↔ (𝜑 ∧ ¬ 𝜓))

Proof of Theorem pm5.61
StepHypRef Expression
1 orel2 904 . . 3 (¬ 𝜓 → ((𝜑 ∨ 𝜓) → 𝜑))
2 orc 881 . . 3 (𝜑 → (𝜑 ∨ 𝜓))
31, 2impbid1 228 . 2 (¬ 𝜓 → ((𝜑 ∨ 𝜓) ↔ 𝜑))
43pm5.32ri 586 1 (((𝜑 ∨ 𝜓) ∧ ¬ 𝜓) ↔ (𝜑 ∧ ¬ 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ 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:  ordtri3  6399  xrnemnf  13246  xrnepnf  13247  hashinfxadd  14529  tltnle  18594  limcdif  26196  ellimc2  26197  limcmpt  26203  limcres  26206  tglineeltr  29099  icorempo  38274  poimirlem14  38552  xrlttri5d  46299
  Copyright terms: Public domain W3C validator