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

Theorem mtord 660
Description: A modus tollens deduction involving disjunction. (Contributed by Jeff Hankins, 15-Jul-2009.)
Hypotheses
Ref Expression
mtord.1
mtord.2
mtord.3
Assertion
Ref Expression
mtord

Proof of Theorem mtord
StepHypRef Expression
1 mtord.2 . 2
2 mtord.1 . . 3
3 mtord.3 . . . 4
4 df-or 370 . . . 4
53, 4syl6ib 226 . . 3
62, 5mpid 41 . 2
71, 6mtod 177 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  \/wo 368
This theorem is referenced by:  swoer  7358  inar1  9174
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 185  df-or 370
  Copyright terms: Public domain W3C validator