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

Theorem ori 200
Description: Inference from disjunction definition.
Hypothesis
Ref Expression
ori.1 |- (ph \/ ps)
Assertion
Ref Expression
ori |- (-. ph -> ps)

Proof of Theorem ori
StepHypRef Expression
1 ori.1 . 2 |- (ph \/ ps)
2 df-or 197 . 2 |- ((ph \/ ps) <-> (-. ph -> ps))
31, 2mpbi 164 1 |- (-. ph -> ps)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   \/ wo 195
This theorem is referenced by:  moexex 1058  mo2icl 1434  mosubop 1911  onuninsuc 2356  omelon 3476  cardom 3632  cardlim 3657  nneo 4719  absgt0 4842
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-or 197
metamath.org