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

Theorem orcd 279
Description: Deduction introducing a disjunct.
Hypothesis
Ref Expression
orcd.1 |- (ph -> ps)
Assertion
Ref Expression
orcd |- (ph -> (ps \/ ch))

Proof of Theorem orcd
StepHypRef Expression
1 orcd.1 . 2 |- (ph -> ps)
2 orc 276 . 2 |- (ps -> (ps \/ ch))
31, 2syl 10 1 |- (ph -> (ps \/ ch))
Colors of variables: wff set class
Syntax hints:   -> wi 3   \/ wo 229
This theorem is referenced by:  pm2.47 286  sbc2or 2008  xrlttri 5617  nnleltp1 6015  zaddcl 6247  zmulcl 6262  sqrge0i 6792  cctop 7737  usinuniop 10703
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 154  df-or 231
Copyright terms: Public domain