Theorem ecase23d 1350

Description: Variation of ecased 1349 with three disjuncts instead of two. (Contributed by NM, 22-Apr-1994.) (Revised by Jim Kingdon, 9-Dec-2017.)

Hypotheses

Ref	Expression
ecase23d.1	⊢ (𝜑 → ¬ 𝜒)
ecase23d.2	⊢ (𝜑 → ¬ 𝜃)
ecase23d.3	⊢ (𝜑 → (𝜓 ∨ 𝜒 ∨ 𝜃))

Assertion

Ref	Expression
ecase23d	⊢ (𝜑 → 𝜓)

Proof of Theorem ecase23d

Step	Hyp	Ref	Expression
1		ecase23d.1	. 2 ⊢ (𝜑 → ¬ 𝜒)
2		ecase23d.2	. . 3 ⊢ (𝜑 → ¬ 𝜃)
3		ecase23d.3	. . . 4 ⊢ (𝜑 → (𝜓 ∨ 𝜒 ∨ 𝜃))
4		df-3or 979	. . . 4 ⊢ ((𝜓 ∨ 𝜒 ∨ 𝜃) ↔ ((𝜓 ∨ 𝜒) ∨ 𝜃))
5	3, 4	sylib 122	. . 3 ⊢ (𝜑 → ((𝜓 ∨ 𝜒) ∨ 𝜃))
6	2, 5	ecased 1349	. 2 ⊢ (𝜑 → (𝜓 ∨ 𝜒))
7	1, 6	ecased 1349	1 ⊢ (𝜑 → 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 708   ∨ w3o 977

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in2 615  ax-io 709

This theorem depends on definitions:  df-bi 117  df-3or 979

This theorem is referenced by:  iseqf1olemklt  10482  xrmaxiflemcl  11248  xrmaxifle  11249  xrmaxiflemab  11250  xrmaxiflemlub  11251  ennnfonelemex  12409  mulgval  12940  mulgfng  12941  subgmulg  13001