HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem olcs 275
Description: Deduction eliminating disjunct.
Hypothesis
Ref Expression
olcs.1 |- ((ph \/ ps) -> ch)
Assertion
Ref Expression
olcs |- (ps -> ch)

Proof of Theorem olcs
StepHypRef Expression
1 olc 268 . 2 |- (ps -> (ph \/ ps))
2 olcs.1 . 2 |- ((ph \/ ps) -> ch)
31, 2syl 10 1 |- (ps -> ch)
Colors of variables: wff set class
Syntax hints:   -> wi 3   \/ wo 222
This theorem is referenced by:  eueq3 1915  sucid 3046  0nn0 6068  bcpasc 6915
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-or 224
Copyright terms: Public domain