Theorem ecased 1051

Description: Deduction for elimination by cases. (Contributed by NM, 8-Oct-2012.)

Hypotheses

Ref	Expression
ecased.1	⊢ (𝜑 → (¬ 𝜓 → 𝜃))
ecased.2	⊢ (𝜑 → (¬ 𝜒 → 𝜃))
ecased.3	⊢ (𝜑 → ((𝜓 ∧ 𝜒) → 𝜃))

Assertion

Ref	Expression
ecased	⊢ (𝜑 → 𝜃)

Proof of Theorem ecased

Step	Hyp	Ref	Expression
1		ecased.1	. 2 ⊢ (𝜑 → (¬ 𝜓 → 𝜃))
2		ecased.2	. 2 ⊢ (𝜑 → (¬ 𝜒 → 𝜃))
3		pm3.11 1008	. . 3 ⊢ (¬ (¬ 𝜓 ∨ ¬ 𝜒) → (𝜓 ∧ 𝜒))
4		ecased.3	. . 3 ⊢ (𝜑 → ((𝜓 ∧ 𝜒) → 𝜃))
5	3, 4	syl5 35	. 2 ⊢ (𝜑 → (¬ (¬ 𝜓 ∨ ¬ 𝜒) → 𝜃))
6	1, 2, 5	ecase3d 1050	1 ⊢ (𝜑 → 𝜃)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ 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:  itgsplitioo  26034  rolle  26186  dalaw  40701