Theorem pm5.61 998

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

Step	Hyp	Ref	Expression
1		orel2 888	. . 3 ⊢ (¬ 𝜓 → ((𝜑 ∨ 𝜓) → 𝜑))
2		orc 864	. . 3 ⊢ (𝜑 → (𝜑 ∨ 𝜓))
3	1, 2	impbid1 228	. 2 ⊢ (¬ 𝜓 → ((𝜑 ∨ 𝜓) ↔ 𝜑))
4	3	pm5.32ri 579	1 ⊢ (((𝜑 ∨ 𝜓) ∧ ¬ 𝜓) ↔ (𝜑 ∧ ¬ 𝜓))

Syntax hints:  ¬ wn 3   ↔ 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:  ordtri3  6195  xrnemnf  12500  xrnepnf  12501  hashinfxadd  13742  limcdif  24479  ellimc2  24480  limcmpt  24486  limcres  24489  tglineeltr  26425  tltnle  30675  icorempo  34768  poimirlem14  35071  xrlttri5d  41914