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

Theorem anmp 1506
Description: Modus ponens for  \/  -. axiom systems. (Contributed by Anthony Hart, 12-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
anmp.min  |-  ph
anmp.maj  |-  ( -. 
ph  \/  ps )
Assertion
Ref Expression
anmp  |-  ps

Proof of Theorem anmp
StepHypRef Expression
1 anmp.min . 2  |-  ph
2 anmp.maj . . 3  |-  ( -. 
ph  \/  ps )
32imorri 403 . 2  |-  ( ph  ->  ps )
41, 3ax-mp 8 1  |-  ps
Colors of variables: wff set class
Syntax hints:   -. wn 3    \/ wo 357
This theorem is referenced by:  rbsyl  1511  rblem1  1512  rblem2  1513  rblem4  1515  rblem5  1516  rblem6  1517  rblem7  1518  re1axmp  1519  re2luk1  1520  re2luk2  1521  re2luk3  1522
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 177  df-or 359
  Copyright terms: Public domain W3C validator