Theorem ecase 1049

Description: Inference for elimination by cases. (Contributed by NM, 13-Jul-2005.)

Hypotheses

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

Assertion

Ref	Expression
ecase	⊢ 𝜒

Proof of Theorem ecase

Step	Hyp	Ref	Expression
1		ecase.3	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜒)
2	1	ex 418	. 2 ⊢ (𝜑 → (𝜓 → 𝜒))
3		ecase.1	. 2 ⊢ (¬ 𝜑 → 𝜒)
4		ecase.2	. 2 ⊢ (¬ 𝜓 → 𝜒)
5	2, 3, 4	pm2.61nii 186	1 ⊢ 𝜒

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401

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

This theorem is used by:  sbccomlem  3817  prfi  9299  hashprb  14521  txindislem  23932  iswwlksnon  30424  iswspthsnon  30427  1to3vfriswmgr  30863