ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mtord Unicode version

Theorem mtord 697
Description: A modus tollens deduction involving disjunction. (Contributed by Jeff Hankins, 15-Jul-2009.) (Revised by Mario Carneiro, 31-Jan-2015.)
Hypotheses
Ref Expression
mtord.1  |-  ( ph  ->  -.  ch )
mtord.2  |-  ( ph  ->  -.  th )
mtord.3  |-  ( ph  ->  ( ps  ->  ( ch  \/  th ) ) )
Assertion
Ref Expression
mtord  |-  ( ph  ->  -.  ps )

Proof of Theorem mtord
StepHypRef Expression
1 mtord.3 . . 3  |-  ( ph  ->  ( ps  ->  ( ch  \/  th ) ) )
2 mtord.1 . . . . 5  |-  ( ph  ->  -.  ch )
32pm2.21d 549 . . . 4  |-  ( ph  ->  ( ch  ->  -.  ps ) )
4 mtord.2 . . . . 5  |-  ( ph  ->  -.  th )
54pm2.21d 549 . . . 4  |-  ( ph  ->  ( th  ->  -.  ps ) )
63, 5jaod 637 . . 3  |-  ( ph  ->  ( ( ch  \/  th )  ->  -.  ps )
)
71, 6syld 40 . 2  |-  ( ph  ->  ( ps  ->  -.  ps ) )
87pm2.01d 548 1  |-  ( ph  ->  -.  ps )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 629
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630
This theorem depends on definitions:  df-bi 110
This theorem is referenced by:  swoer  6134
  Copyright terms: Public domain W3C validator