Theorem ecase2d 1032

Description: Deduction for elimination by cases. (Contributed by NM, 21-Apr-1994.) (Proof shortened by Wolf Lammen, 19-Sep-2024.)

Hypotheses

Ref	Expression
ecase2d.1	⊢ (𝜑 → 𝜓)
ecase2d.2	⊢ (𝜑 → ¬ (𝜓 ∧ 𝜒))
ecase2d.3	⊢ (𝜑 → ¬ (𝜓 ∧ 𝜃))
ecase2d.4	⊢ (𝜑 → (𝜏 ∨ (𝜒 ∨ 𝜃)))

Assertion

Ref	Expression
ecase2d	⊢ (𝜑 → 𝜏)

Proof of Theorem ecase2d

Step	Hyp	Ref	Expression
1		ecase2d.1	. . . 4 ⊢ (𝜑 → 𝜓)
2		ecase2d.2	. . . 4 ⊢ (𝜑 → ¬ (𝜓 ∧ 𝜒))
3	1, 2	mpnanrd 409	. . 3 ⊢ (𝜑 → ¬ 𝜒)
4		ecase2d.3	. . . 4 ⊢ (𝜑 → ¬ (𝜓 ∧ 𝜃))
5	1, 4	mpnanrd 409	. . 3 ⊢ (𝜑 → ¬ 𝜃)
6		ecase2d.4	. . . 4 ⊢ (𝜑 → (𝜏 ∨ (𝜒 ∨ 𝜃)))
7	6	ord 865	. . 3 ⊢ (𝜑 → (¬ 𝜏 → (𝜒 ∨ 𝜃)))
8	3, 5, 7	mtord 880	. 2 ⊢ (𝜑 → ¬ ¬ 𝜏)
9	8	notnotrd 133	1 ⊢ (𝜑 → 𝜏)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 848

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 207  df-an 396  df-or 849

This theorem is referenced by: (None)