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

Theorem orim2d 569
Description: Disjoin antecedents and consequents in a deduction.
Hypothesis
Ref Expression
orim1d.1 |- (ph -> (ps -> ch))
Assertion
Ref Expression
orim2d |- (ph -> ((th \/ ps) -> (th \/ ch)))

Proof of Theorem orim2d
StepHypRef Expression
1 idd 61 . 2 |- (ph -> (th -> th))
2 orim1d.1 . 2 |- (ph -> (ps -> ch))
31, 2orim12d 567 1 |- (ph -> ((th \/ ps) -> (th \/ ch)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   \/ wo 222
This theorem is referenced by:  orim2 570  pm2.75 576  pm2.82 580  nneo 6199
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  df-an 225
Copyright terms: Public domain