MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  orcs Unicode version

Theorem orcs 394
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 16) -type inference in a proof. (Contributed by NM, 21-Jun-1994.)
Hypothesis
Ref Expression
orcs.1
Assertion
Ref Expression
orcs

Proof of Theorem orcs
StepHypRef Expression
1 orc 385 . 2
2 orcs.1 . 2
31, 2syl 16 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  \/wo 368
This theorem is referenced by:  olcs  395  ifor  3988  tppreqb  4171  frxp  6910  mndifsplit  19138  maducoeval2  19142  leibpilem2  23272  leibpi  23273  3o1cs  27369  3o2cs  27370  tsan2  30549
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 185  df-or 370
  Copyright terms: Public domain W3C validator