Theorem orcs 876

Description: Deduction eliminating disjunct. Notational convention: We sometimes suffix with "s" the label of an inference that manipulates an antecedent, leaving the consequent unchanged. The "s" means that the inference eliminates the need for a syllogism (syl 17) -type inference in a proof. (Contributed by NM, 21-Jun-1994.)

Hypothesis

Ref	Expression
orcs.1	⊢ ((𝜑 ∨ 𝜓) → 𝜒)

Assertion

Ref	Expression
orcs	⊢ (𝜑 → 𝜒)

Proof of Theorem orcs

Step	Hyp	Ref	Expression
1		orc 868	. 2 ⊢ (𝜑 → (𝜑 ∨ 𝜓))
2		orcs.1	. 2 ⊢ ((𝜑 ∨ 𝜓) → 𝜒)
3	1, 2	syl 17	1 ⊢ (𝜑 → 𝜒)

Syntax hints:   → wi 4   ∨ 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-or 849

This theorem is referenced by:  olcs  877  norasslem2  1537  ifor  4521  tppreqb  4750  frxp  8076  mndifsplit  22601  maducoeval2  22605  leibpilem2  26905  leibpi  26906  3o1cs  32530  3o2cs  32531  elrgspnlem2  33304  poimirlem31  37972  tsan2  38463  frege114d  44185  ntrneiel2  44513  nnfoctbdjlem  46883  homf0  49484